-- --
-- B o d y --
-- --
--- Copyright (C) 1992-2003, Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2007, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
--- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
--- MA 02111-1307, USA. --
+-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
+-- Boston, MA 02110-1301, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
with Freeze; use Freeze;
with Lib; use Lib;
with Lib.Xref; use Lib.Xref;
-with Namet; use Namet;
with Nlists; use Nlists;
-with Nmake; use Nmake;
with Output; use Output;
with Opt; use Opt;
-with Restrict; use Restrict;
+with Rtsfind; use Rtsfind;
with Scans; use Scans;
with Scn; use Scn;
with Sem; use Sem;
+with Sem_Attr; use Sem_Attr;
+with Sem_Ch6; use Sem_Ch6;
with Sem_Ch8; use Sem_Ch8;
with Sem_Eval; use Sem_Eval;
with Sem_Res; use Sem_Res;
with Targparm; use Targparm;
with Tbuild; use Tbuild;
with Ttypes; use Ttypes;
+with Uname; use Uname;
package body Sem_Util is
+ use Nmake;
+
-----------------------
-- Local Subprograms --
-----------------------
-- T is a derived tagged type. Check whether the type extension is null.
-- If the parent type is fully initialized, T can be treated as such.
+ ------------------------------
+ -- Abstract_Interface_List --
+ ------------------------------
+
+ function Abstract_Interface_List (Typ : Entity_Id) return List_Id is
+ Nod : Node_Id;
+
+ begin
+ if Is_Concurrent_Type (Typ) then
+
+ -- If we are dealing with a synchronized subtype, go to the base
+ -- type, whose declaration has the interface list.
+
+ -- Shouldn't this be Declaration_Node???
+
+ Nod := Parent (Base_Type (Typ));
+
+ elsif Ekind (Typ) = E_Record_Type_With_Private then
+ if Nkind (Parent (Typ)) = N_Full_Type_Declaration then
+ Nod := Type_Definition (Parent (Typ));
+
+ elsif Nkind (Parent (Typ)) = N_Private_Type_Declaration then
+ if Present (Full_View (Typ)) then
+ Nod := Type_Definition (Parent (Full_View (Typ)));
+
+ -- If the full-view is not available we cannot do anything
+ -- else here (the source has errors)
+
+ else
+ return Empty_List;
+ end if;
+
+ -- The support for generic formals with interfaces is still
+ -- missing???
+
+ elsif Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
+ return Empty_List;
+
+ else
+ pragma Assert
+ (Nkind (Parent (Typ)) = N_Private_Extension_Declaration);
+ Nod := Parent (Typ);
+ end if;
+
+ elsif Ekind (Typ) = E_Record_Subtype then
+ Nod := Type_Definition (Parent (Etype (Typ)));
+
+ elsif Ekind (Typ) = E_Record_Subtype_With_Private then
+
+ -- Recurse, because parent may still be a private extension
+
+ return Abstract_Interface_List (Etype (Full_View (Typ)));
+
+ else pragma Assert ((Ekind (Typ)) = E_Record_Type);
+ if Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
+ Nod := Formal_Type_Definition (Parent (Typ));
+ else
+ Nod := Type_Definition (Parent (Typ));
+ end if;
+ end if;
+
+ return Interface_List (Nod);
+ end Abstract_Interface_List;
+
--------------------------------
-- Add_Access_Type_To_Process --
--------------------------------
Append_Elmt (A, L);
end Add_Access_Type_To_Process;
+ ----------------------------
+ -- Add_Global_Declaration --
+ ----------------------------
+
+ procedure Add_Global_Declaration (N : Node_Id) is
+ Aux_Node : constant Node_Id := Aux_Decls_Node (Cunit (Current_Sem_Unit));
+
+ begin
+ if No (Declarations (Aux_Node)) then
+ Set_Declarations (Aux_Node, New_List);
+ end if;
+
+ Append_To (Declarations (Aux_Node), N);
+ Analyze (N);
+ end Add_Global_Declaration;
+
-----------------------
-- Alignment_In_Bits --
-----------------------
Rtyp := Typ;
end if;
- if No (Compile_Time_Constraint_Error (N, Msg, Ent, Loc, Warn => Warn))
- or else not Rep
- then
+ Discard_Node
+ (Compile_Time_Constraint_Error (N, Msg, Ent, Loc, Warn => Warn));
+
+ if not Rep then
return;
end if;
(T : Entity_Id;
N : Node_Or_Entity_Id) return Node_Id
is
- Obj : Node_Id;
+ Loc : Source_Ptr;
+ -- Normally Sloc (N), but may point to corresponding body in some cases
- Loc : constant Source_Ptr := Sloc (N);
Constraints : List_Id;
Decl : Node_Id;
Discr : Entity_Id;
Lo : Node_Id;
Subt : Entity_Id;
Disc_Type : Entity_Id;
+ Obj : Node_Id;
begin
+ Loc := Sloc (N);
+
if Nkind (N) = N_Defining_Identifier then
Obj := New_Reference_To (N, Loc);
+
+ -- If this is a formal parameter of a subprogram declaration, and
+ -- we are compiling the body, we want the declaration for the
+ -- actual subtype to carry the source position of the body, to
+ -- prevent anomalies in gdb when stepping through the code.
+
+ if Is_Formal (N) then
+ declare
+ Decl : constant Node_Id := Unit_Declaration_Node (Scope (N));
+ begin
+ if Nkind (Decl) = N_Subprogram_Declaration
+ and then Present (Corresponding_Body (Decl))
+ then
+ Loc := Sloc (Corresponding_Body (Decl));
+ end if;
+ end;
+ end if;
+
else
Obj := N;
end if;
if Is_Array_Type (T) then
Constraints := New_List;
-
for J in 1 .. Number_Dimensions (T) loop
- -- Build an array subtype declaration with the nominal
- -- subtype and the bounds of the actual. Add the declaration
- -- in front of the local declarations for the subprogram, for
- -- analysis before any reference to the formal in the body.
+ -- Build an array subtype declaration with the nominal subtype and
+ -- the bounds of the actual. Add the declaration in front of the
+ -- local declarations for the subprogram, for analysis before any
+ -- reference to the formal in the body.
Lo :=
Make_Attribute_Reference (Loc,
end if;
Discr := First_Discriminant (Disc_Type);
-
while Present (Discr) loop
Append_To (Constraints,
Make_Selected_Component (Loc,
begin
D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
while Present (D) loop
-
if Denotes_Discriminant (Node (D)) then
D_Val := Make_Selected_Component (Loc,
Prefix => New_Copy_Tree (P),
if Ekind (Deaccessed_T) = E_Array_Subtype then
Id := First_Index (Deaccessed_T);
- Indx_Type := Underlying_Type (Etype (Id));
-
while Present (Id) loop
+ Indx_Type := Underlying_Type (Etype (Id));
if Denotes_Discriminant (Type_Low_Bound (Indx_Type)) or else
Denotes_Discriminant (Type_High_Bound (Indx_Type))
then
D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
while Present (D) loop
-
if Denotes_Discriminant (Node (D)) then
Remove_Side_Effects (P);
return
end loop;
end if;
- -- If none of the above, the actual and nominal subtypes are the same.
+ -- If none of the above, the actual and nominal subtypes are the same
return Empty;
end Build_Actual_Subtype_Of_Component;
Decl : Node_Id;
begin
+ -- Unchecked_Union components do not require component subtypes
+
+ if Is_Unchecked_Union (T) then
+ return Empty;
+ end if;
+
Subt :=
Make_Defining_Identifier (Loc,
Chars => New_Internal_Name ('S'));
return Decl;
end Build_Component_Subtype;
+ ---------------------------
+ -- Build_Default_Subtype --
+ ---------------------------
+
+ function Build_Default_Subtype
+ (T : Entity_Id;
+ N : Node_Id) return Entity_Id
+ is
+ Loc : constant Source_Ptr := Sloc (N);
+ Disc : Entity_Id;
+
+ begin
+ if not Has_Discriminants (T) or else Is_Constrained (T) then
+ return T;
+ end if;
+
+ Disc := First_Discriminant (T);
+
+ if No (Discriminant_Default_Value (Disc)) then
+ return T;
+ end if;
+
+ declare
+ Act : constant Entity_Id :=
+ Make_Defining_Identifier (Loc,
+ Chars => New_Internal_Name ('S'));
+
+ Constraints : constant List_Id := New_List;
+ Decl : Node_Id;
+
+ begin
+ while Present (Disc) loop
+ Append_To (Constraints,
+ New_Copy_Tree (Discriminant_Default_Value (Disc)));
+ Next_Discriminant (Disc);
+ end loop;
+
+ Decl :=
+ Make_Subtype_Declaration (Loc,
+ Defining_Identifier => Act,
+ Subtype_Indication =>
+ Make_Subtype_Indication (Loc,
+ Subtype_Mark => New_Occurrence_Of (T, Loc),
+ Constraint =>
+ Make_Index_Or_Discriminant_Constraint (Loc,
+ Constraints => Constraints)));
+
+ Insert_Action (N, Decl);
+ Analyze (Decl);
+ return Act;
+ end;
+ end Build_Default_Subtype;
+
--------------------------------------------
-- Build_Discriminal_Subtype_Of_Component --
--------------------------------------------
begin
if Ekind (T) = E_Array_Subtype then
Id := First_Index (T);
-
while Present (Id) loop
if Denotes_Discriminant (Type_Low_Bound (Etype (Id))) or else
Denotes_Discriminant (Type_High_Bound (Etype (Id)))
end loop;
end if;
- -- If none of the above, the actual and nominal subtypes are the same.
+ -- If none of the above, the actual and nominal subtypes are the same
return Empty;
end Build_Discriminal_Subtype_Of_Component;
------------------------------
procedure Build_Elaboration_Entity (N : Node_Id; Spec_Id : Entity_Id) is
- Loc : constant Source_Ptr := Sloc (N);
- Unum : constant Unit_Number_Type := Get_Source_Unit (Loc);
- Decl : Node_Id;
- P : Natural;
- Elab_Ent : Entity_Id;
+ Loc : constant Source_Ptr := Sloc (N);
+ Decl : Node_Id;
+ Elab_Ent : Entity_Id;
+
+ procedure Set_Package_Name (Ent : Entity_Id);
+ -- Given an entity, sets the fully qualified name of the entity in
+ -- Name_Buffer, with components separated by double underscores. This
+ -- is a recursive routine that climbs the scope chain to Standard.
+
+ ----------------------
+ -- Set_Package_Name --
+ ----------------------
+
+ procedure Set_Package_Name (Ent : Entity_Id) is
+ begin
+ if Scope (Ent) /= Standard_Standard then
+ Set_Package_Name (Scope (Ent));
+
+ declare
+ Nam : constant String := Get_Name_String (Chars (Ent));
+ begin
+ Name_Buffer (Name_Len + 1) := '_';
+ Name_Buffer (Name_Len + 2) := '_';
+ Name_Buffer (Name_Len + 3 .. Name_Len + Nam'Length + 2) := Nam;
+ Name_Len := Name_Len + Nam'Length + 2;
+ end;
+
+ else
+ Get_Name_String (Chars (Ent));
+ end if;
+ end Set_Package_Name;
+
+ -- Start of processing for Build_Elaboration_Entity
begin
-- Ignore if already constructed
return;
end if;
- -- Construct name of elaboration entity as xxx_E, where xxx
- -- is the unit name with dots replaced by double underscore.
- -- We have to manually construct this name, since it will
- -- be elaborated in the outer scope, and thus will not have
- -- the unit name automatically prepended.
-
- Get_Name_String (Unit_Name (Unum));
+ -- Construct name of elaboration entity as xxx_E, where xxx is the unit
+ -- name with dots replaced by double underscore. We have to manually
+ -- construct this name, since it will be elaborated in the outer scope,
+ -- and thus will not have the unit name automatically prepended.
- -- Replace the %s by _E
+ Set_Package_Name (Spec_Id);
- Name_Buffer (Name_Len - 1 .. Name_Len) := "_E";
+ -- Append _E
- -- Replace dots by double underscore
-
- P := 2;
- while P < Name_Len - 2 loop
- if Name_Buffer (P) = '.' then
- Name_Buffer (P + 2 .. Name_Len + 1) :=
- Name_Buffer (P + 1 .. Name_Len);
- Name_Len := Name_Len + 1;
- Name_Buffer (P) := '_';
- Name_Buffer (P + 1) := '_';
- P := P + 3;
- else
- P := P + 1;
- end if;
- end loop;
+ Name_Buffer (Name_Len + 1) := '_';
+ Name_Buffer (Name_Len + 2) := 'E';
+ Name_Len := Name_Len + 2;
-- Create elaboration flag
Make_Defining_Identifier (Loc, Chars => Name_Find);
Set_Elaboration_Entity (Spec_Id, Elab_Ent);
- if No (Declarations (Aux_Decls_Node (N))) then
- Set_Declarations (Aux_Decls_Node (N), New_List);
- end if;
-
Decl :=
Make_Object_Declaration (Loc,
Defining_Identifier => Elab_Ent,
Expression =>
New_Occurrence_Of (Standard_False, Loc));
- Append_To (Declarations (Aux_Decls_Node (N)), Decl);
- Analyze (Decl);
+ Push_Scope (Standard_Standard);
+ Add_Global_Declaration (Decl);
+ Pop_Scope;
- -- Reset True_Constant indication, since we will indeed
- -- assign a value to the variable in the binder main.
+ -- Reset True_Constant indication, since we will indeed assign a value
+ -- to the variable in the binder main. We also kill the Current_Value
+ -- and Last_Assignment fields for the same reason.
Set_Is_True_Constant (Elab_Ent, False);
Set_Current_Value (Elab_Ent, Empty);
+ Set_Last_Assignment (Elab_Ent, Empty);
-- We do not want any further qualification of the name (if we did
-- not do this, we would pick up the name of the generic package
else
declare
- N : Node_Id := First (Expressions (Expr));
+ N : Node_Id;
begin
+ N := First (Expressions (Expr));
while Present (N) loop
if Cannot_Raise_Constraint_Error (N) then
Next (N);
begin
if Ekind (T) = E_Incomplete_Type then
- -- Ada0Y (AI-50217): If the type is available through a limited
+ -- Ada 2005 (AI-50217): If the type is available through a limited
-- with_clause, verify that its full view has been analyzed.
if From_With_Type (T)
end if;
end Check_Fully_Declared;
+ -------------------------
+ -- Check_Nested_Access --
+ -------------------------
+
+ procedure Check_Nested_Access (Ent : Entity_Id) is
+ Scop : constant Entity_Id := Current_Scope;
+ Current_Subp : Entity_Id;
+
+ begin
+ -- Currently only enabled for VM back-ends for efficiency, should we
+ -- enable it more systematically ???
+
+ if VM_Target /= No_VM
+ and then (Ekind (Ent) = E_Variable
+ or else
+ Ekind (Ent) = E_Constant
+ or else
+ Ekind (Ent) = E_Loop_Parameter)
+ and then Scope (Ent) /= Empty
+ and then not Is_Library_Level_Entity (Ent)
+ then
+ if Is_Subprogram (Scop)
+ or else Is_Generic_Subprogram (Scop)
+ or else Is_Entry (Scop)
+ then
+ Current_Subp := Scop;
+ else
+ Current_Subp := Current_Subprogram;
+ end if;
+
+ if Enclosing_Subprogram (Ent) /= Current_Subp then
+ Set_Has_Up_Level_Access (Ent, True);
+ end if;
+ end if;
+ end Check_Nested_Access;
+
------------------------------------------
-- Check_Potentially_Blocking_Operation --
------------------------------------------
procedure Check_Potentially_Blocking_Operation (N : Node_Id) is
- S : Entity_Id;
- Loc : constant Source_Ptr := Sloc (N);
-
+ S : Entity_Id;
begin
- -- N is one of the potentially blocking operations listed in
- -- 9.5.1 (8). When using the Ravenscar profile, raise Program_Error
- -- before N if the context is a protected action. Otherwise, only issue
- -- a warning, since some users are relying on blocking operations
- -- inside protected objects.
- -- Indirect blocking through a subprogram call
- -- cannot be diagnosed statically without interprocedural analysis,
- -- so we do not attempt to do it here.
+ -- N is one of the potentially blocking operations listed in 9.5.1(8).
+ -- When pragma Detect_Blocking is active, the run time will raise
+ -- Program_Error. Here we only issue a warning, since we generally
+ -- support the use of potentially blocking operations in the absence
+ -- of the pragma.
- S := Scope (Current_Scope);
+ -- Indirect blocking through a subprogram call cannot be diagnosed
+ -- statically without interprocedural analysis, so we do not attempt
+ -- to do it here.
+ S := Scope (Current_Scope);
while Present (S) and then S /= Standard_Standard loop
if Is_Protected_Type (S) then
- if Restricted_Profile then
- Insert_Before_And_Analyze (N,
- Make_Raise_Program_Error (Loc,
- Reason => PE_Potentially_Blocking_Operation));
- Error_Msg_N ("potentially blocking operation, " &
- " Program Error will be raised at run time?", N);
-
- else
- Error_Msg_N
- ("potentially blocking operation in protected operation?", N);
- end if;
+ Error_Msg_N
+ ("potentially blocking operation in protected operation?", N);
return;
end if;
end if;
end Check_VMS;
- ----------------------------------
- -- Collect_Primitive_Operations --
- ----------------------------------
+ ---------------------------------
+ -- Collect_Abstract_Interfaces --
+ ---------------------------------
- function Collect_Primitive_Operations (T : Entity_Id) return Elist_Id is
- B_Type : constant Entity_Id := Base_Type (T);
- B_Decl : constant Node_Id := Original_Node (Parent (B_Type));
- B_Scope : Entity_Id := Scope (B_Type);
- Op_List : Elist_Id;
- Formal : Entity_Id;
- Is_Prim : Boolean;
- Formal_Derived : Boolean := False;
- Id : Entity_Id;
+ procedure Collect_Abstract_Interfaces
+ (T : Entity_Id;
+ Ifaces_List : out Elist_Id;
+ Exclude_Parent_Interfaces : Boolean := False;
+ Use_Full_View : Boolean := True)
+ is
+ procedure Add_Interface (Iface : Entity_Id);
+ -- Add the interface it if is not already in the list
- begin
- -- For tagged types, the primitive operations are collected as they
- -- are declared, and held in an explicit list which is simply returned.
+ procedure Collect (Typ : Entity_Id);
+ -- Subsidiary subprogram used to traverse the whole list
+ -- of directly and indirectly implemented interfaces
- if Is_Tagged_Type (B_Type) then
- return Primitive_Operations (B_Type);
+ function Interface_Present_In_Parent
+ (Typ : Entity_Id;
+ Iface : Entity_Id) return Boolean;
+ -- Typ must be a tagged record type/subtype and Iface must be an
+ -- abstract interface type. This function is used to check if Typ
+ -- or some parent of Typ implements Iface.
- -- An untagged generic type that is a derived type inherits the
- -- primitive operations of its parent type. Other formal types only
- -- have predefined operators, which are not explicitly represented.
+ -------------------
+ -- Add_Interface --
+ -------------------
- elsif Is_Generic_Type (B_Type) then
- if Nkind (B_Decl) = N_Formal_Type_Declaration
- and then Nkind (Formal_Type_Definition (B_Decl))
- = N_Formal_Derived_Type_Definition
- then
- Formal_Derived := True;
- else
- return New_Elmt_List;
- end if;
- end if;
+ procedure Add_Interface (Iface : Entity_Id) is
+ Elmt : Elmt_Id;
- Op_List := New_Elmt_List;
+ begin
+ Elmt := First_Elmt (Ifaces_List);
+ while Present (Elmt) and then Node (Elmt) /= Iface loop
+ Next_Elmt (Elmt);
+ end loop;
- if B_Scope = Standard_Standard then
- if B_Type = Standard_String then
- Append_Elmt (Standard_Op_Concat, Op_List);
+ if No (Elmt) then
+ Append_Elmt (Iface, Ifaces_List);
+ end if;
+ end Add_Interface;
- elsif B_Type = Standard_Wide_String then
- Append_Elmt (Standard_Op_Concatw, Op_List);
+ -------------
+ -- Collect --
+ -------------
- else
- null;
- end if;
+ procedure Collect (Typ : Entity_Id) is
+ Ancestor : Entity_Id;
+ Full_T : Entity_Id;
+ Iface_List : List_Id;
+ Id : Node_Id;
+ Iface : Entity_Id;
- elsif (Is_Package (B_Scope)
- and then Nkind (
- Parent (Declaration_Node (First_Subtype (T))))
- /= N_Package_Body)
+ begin
+ Full_T := Typ;
- or else Is_Derived_Type (B_Type)
- then
- -- The primitive operations appear after the base type, except
- -- if the derivation happens within the private part of B_Scope
- -- and the type is a private type, in which case both the type
- -- and some primitive operations may appear before the base
- -- type, and the list of candidates starts after the type.
+ -- Handle private types
- if In_Open_Scopes (B_Scope)
- and then Scope (T) = B_Scope
- and then In_Private_Part (B_Scope)
+ if Use_Full_View
+ and then Is_Private_Type (Typ)
+ and then Present (Full_View (Typ))
then
- Id := Next_Entity (T);
- else
- Id := Next_Entity (B_Type);
+ Full_T := Full_View (Typ);
end if;
- while Present (Id) loop
-
- -- Note that generic formal subprograms are not
- -- considered to be primitive operations and thus
- -- are never inherited.
+ Iface_List := Abstract_Interface_List (Full_T);
- if Is_Overloadable (Id)
- and then Nkind (Parent (Parent (Id)))
- /= N_Formal_Subprogram_Declaration
- then
- Is_Prim := False;
+ -- Include the ancestor if we are generating the whole list of
+ -- abstract interfaces.
- if Base_Type (Etype (Id)) = B_Type then
- Is_Prim := True;
- else
- Formal := First_Formal (Id);
- while Present (Formal) loop
- if Base_Type (Etype (Formal)) = B_Type then
- Is_Prim := True;
- exit;
+ -- In concurrent types the ancestor interface (if any) is the
+ -- first element of the list of interface types.
- elsif Ekind (Etype (Formal)) = E_Anonymous_Access_Type
- and then Base_Type
- (Designated_Type (Etype (Formal))) = B_Type
- then
- Is_Prim := True;
- exit;
- end if;
+ if Is_Concurrent_Type (Full_T)
+ or else Is_Concurrent_Record_Type (Full_T)
+ then
+ if Is_Non_Empty_List (Iface_List) then
+ Ancestor := Etype (First (Iface_List));
+ Collect (Ancestor);
- Next_Formal (Formal);
- end loop;
+ if not Exclude_Parent_Interfaces then
+ Add_Interface (Ancestor);
end if;
+ end if;
- -- For a formal derived type, the only primitives are the
- -- ones inherited from the parent type. Operations appearing
- -- in the package declaration are not primitive for it.
+ elsif Etype (Full_T) /= Typ
- if Is_Prim
- and then (not Formal_Derived
- or else Present (Alias (Id)))
- then
- Append_Elmt (Id, Op_List);
- end if;
+ -- Protect the frontend against wrong sources. For example:
+
+ -- package P is
+ -- type A is tagged null record;
+ -- type B is new A with private;
+ -- type C is new A with private;
+ -- private
+ -- type B is new C with null record;
+ -- type C is new B with null record;
+ -- end P;
+
+ and then Etype (Full_T) /= T
+ then
+ Ancestor := Etype (Full_T);
+ Collect (Ancestor);
+
+ if Is_Interface (Ancestor)
+ and then not Exclude_Parent_Interfaces
+ then
+ Add_Interface (Ancestor);
end if;
+ end if;
- Next_Entity (Id);
+ -- Traverse the graph of ancestor interfaces
- -- For a type declared in System, some of its operations
- -- may appear in the target-specific extension to System.
+ if Is_Non_Empty_List (Iface_List) then
+ Id := First (Iface_List);
- if No (Id)
- and then Chars (B_Scope) = Name_System
- and then Scope (B_Scope) = Standard_Standard
- and then Present_System_Aux
+ -- In concurrent types the ancestor interface (if any) is the
+ -- first element of the list of interface types and we have
+ -- already processed them while climbing to the root type.
+
+ if Is_Concurrent_Type (Full_T)
+ or else Is_Concurrent_Record_Type (Full_T)
then
- B_Scope := System_Aux_Id;
- Id := First_Entity (System_Aux_Id);
+ Next (Id);
end if;
- end loop;
- end if;
- return Op_List;
- end Collect_Primitive_Operations;
+ while Present (Id) loop
+ Iface := Etype (Id);
- -----------------------------------
- -- Compile_Time_Constraint_Error --
- -----------------------------------
+ -- Protect against wrong uses. For example:
+ -- type I is interface;
+ -- type O is tagged null record;
+ -- type Wrong is new I and O with null record; -- ERROR
+
+ if Is_Interface (Iface) then
+ if Exclude_Parent_Interfaces
+ and then Interface_Present_In_Parent (T, Iface)
+ then
+ null;
+ else
+ Collect (Iface);
+ Add_Interface (Iface);
+ end if;
+ end if;
+
+ Next (Id);
+ end loop;
+ end if;
+ end Collect;
+
+ ---------------------------------
+ -- Interface_Present_In_Parent --
+ ---------------------------------
+
+ function Interface_Present_In_Parent
+ (Typ : Entity_Id;
+ Iface : Entity_Id) return Boolean
+ is
+ Aux : Entity_Id := Typ;
+ Iface_List : List_Id;
+
+ begin
+ if Is_Concurrent_Type (Typ)
+ or else Is_Concurrent_Record_Type (Typ)
+ then
+ Iface_List := Abstract_Interface_List (Typ);
+
+ if Is_Non_Empty_List (Iface_List) then
+ Aux := Etype (First (Iface_List));
+ else
+ return False;
+ end if;
+ end if;
+
+ return Interface_Present_In_Ancestor (Aux, Iface);
+ end Interface_Present_In_Parent;
+
+ -- Start of processing for Collect_Abstract_Interfaces
+
+ begin
+ pragma Assert (Is_Tagged_Type (T) or else Is_Concurrent_Type (T));
+ Ifaces_List := New_Elmt_List;
+ Collect (T);
+ end Collect_Abstract_Interfaces;
+
+ ----------------------------------
+ -- Collect_Interface_Components --
+ ----------------------------------
+
+ procedure Collect_Interface_Components
+ (Tagged_Type : Entity_Id;
+ Components_List : out Elist_Id)
+ is
+ procedure Collect (Typ : Entity_Id);
+ -- Subsidiary subprogram used to climb to the parents
+
+ -------------
+ -- Collect --
+ -------------
+
+ procedure Collect (Typ : Entity_Id) is
+ Tag_Comp : Entity_Id;
+
+ begin
+ if Etype (Typ) /= Typ
+
+ -- Protect the frontend against wrong sources. For example:
+
+ -- package P is
+ -- type A is tagged null record;
+ -- type B is new A with private;
+ -- type C is new A with private;
+ -- private
+ -- type B is new C with null record;
+ -- type C is new B with null record;
+ -- end P;
+
+ and then Etype (Typ) /= Tagged_Type
+ then
+ Collect (Etype (Typ));
+ end if;
+
+ -- Collect the components containing tags of secondary dispatch
+ -- tables.
+
+ Tag_Comp := Next_Tag_Component (First_Tag_Component (Typ));
+ while Present (Tag_Comp) loop
+ pragma Assert (Present (Related_Interface (Tag_Comp)));
+ Append_Elmt (Tag_Comp, Components_List);
+
+ Tag_Comp := Next_Tag_Component (Tag_Comp);
+ end loop;
+ end Collect;
+
+ -- Start of processing for Collect_Interface_Components
+
+ begin
+ pragma Assert (Ekind (Tagged_Type) = E_Record_Type
+ and then Is_Tagged_Type (Tagged_Type));
+
+ Components_List := New_Elmt_List;
+ Collect (Tagged_Type);
+ end Collect_Interface_Components;
+
+ -----------------------------
+ -- Collect_Interfaces_Info --
+ -----------------------------
+
+ procedure Collect_Interfaces_Info
+ (T : Entity_Id;
+ Ifaces_List : out Elist_Id;
+ Components_List : out Elist_Id;
+ Tags_List : out Elist_Id)
+ is
+ Comps_List : Elist_Id;
+ Comp_Elmt : Elmt_Id;
+ Comp_Iface : Entity_Id;
+ Iface_Elmt : Elmt_Id;
+ Iface : Entity_Id;
+
+ function Search_Tag (Iface : Entity_Id) return Entity_Id;
+ -- Search for the secondary tag associated with the interface type
+ -- Iface that is implemented by T.
+
+ ----------------
+ -- Search_Tag --
+ ----------------
+
+ function Search_Tag (Iface : Entity_Id) return Entity_Id is
+ ADT : Elmt_Id;
+
+ begin
+ ADT := Next_Elmt (First_Elmt (Access_Disp_Table (T)));
+ while Present (ADT)
+ and then Ekind (Node (ADT)) = E_Constant
+ and then Related_Interface (Node (ADT)) /= Iface
+ loop
+ Next_Elmt (ADT);
+ end loop;
+
+ pragma Assert (Ekind (Node (ADT)) = E_Constant);
+ return Node (ADT);
+ end Search_Tag;
+
+ -- Start of processing for Collect_Interfaces_Info
+
+ begin
+ Collect_Abstract_Interfaces (T, Ifaces_List);
+ Collect_Interface_Components (T, Comps_List);
+
+ -- Search for the record component and tag associated with each
+ -- interface type of T.
+
+ Components_List := New_Elmt_List;
+ Tags_List := New_Elmt_List;
+
+ Iface_Elmt := First_Elmt (Ifaces_List);
+ while Present (Iface_Elmt) loop
+ Iface := Node (Iface_Elmt);
+
+ -- Associate the primary tag component and the primary dispatch table
+ -- with all the interfaces that are parents of T
+
+ if Is_Parent (Iface, T) then
+ Append_Elmt (First_Tag_Component (T), Components_List);
+ Append_Elmt (Node (First_Elmt (Access_Disp_Table (T))), Tags_List);
+
+ -- Otherwise search for the tag component and secondary dispatch
+ -- table of Iface
+
+ else
+ Comp_Elmt := First_Elmt (Comps_List);
+ while Present (Comp_Elmt) loop
+ Comp_Iface := Related_Interface (Node (Comp_Elmt));
+
+ if Comp_Iface = Iface
+ or else Is_Parent (Iface, Comp_Iface)
+ then
+ Append_Elmt (Node (Comp_Elmt), Components_List);
+ Append_Elmt (Search_Tag (Comp_Iface), Tags_List);
+ exit;
+ end if;
+
+ Next_Elmt (Comp_Elmt);
+ end loop;
+ pragma Assert (Present (Comp_Elmt));
+ end if;
+
+ Next_Elmt (Iface_Elmt);
+ end loop;
+ end Collect_Interfaces_Info;
+
+ ----------------------------------
+ -- Collect_Primitive_Operations --
+ ----------------------------------
+
+ function Collect_Primitive_Operations (T : Entity_Id) return Elist_Id is
+ B_Type : constant Entity_Id := Base_Type (T);
+ B_Decl : constant Node_Id := Original_Node (Parent (B_Type));
+ B_Scope : Entity_Id := Scope (B_Type);
+ Op_List : Elist_Id;
+ Formal : Entity_Id;
+ Is_Prim : Boolean;
+ Formal_Derived : Boolean := False;
+ Id : Entity_Id;
+
+ begin
+ -- For tagged types, the primitive operations are collected as they
+ -- are declared, and held in an explicit list which is simply returned.
+
+ if Is_Tagged_Type (B_Type) then
+ return Primitive_Operations (B_Type);
+
+ -- An untagged generic type that is a derived type inherits the
+ -- primitive operations of its parent type. Other formal types only
+ -- have predefined operators, which are not explicitly represented.
+
+ elsif Is_Generic_Type (B_Type) then
+ if Nkind (B_Decl) = N_Formal_Type_Declaration
+ and then Nkind (Formal_Type_Definition (B_Decl))
+ = N_Formal_Derived_Type_Definition
+ then
+ Formal_Derived := True;
+ else
+ return New_Elmt_List;
+ end if;
+ end if;
+
+ Op_List := New_Elmt_List;
+
+ if B_Scope = Standard_Standard then
+ if B_Type = Standard_String then
+ Append_Elmt (Standard_Op_Concat, Op_List);
+
+ elsif B_Type = Standard_Wide_String then
+ Append_Elmt (Standard_Op_Concatw, Op_List);
+
+ else
+ null;
+ end if;
+
+ elsif (Is_Package_Or_Generic_Package (B_Scope)
+ and then
+ Nkind (Parent (Declaration_Node (First_Subtype (T)))) /=
+ N_Package_Body)
+ or else Is_Derived_Type (B_Type)
+ then
+ -- The primitive operations appear after the base type, except
+ -- if the derivation happens within the private part of B_Scope
+ -- and the type is a private type, in which case both the type
+ -- and some primitive operations may appear before the base
+ -- type, and the list of candidates starts after the type.
+
+ if In_Open_Scopes (B_Scope)
+ and then Scope (T) = B_Scope
+ and then In_Private_Part (B_Scope)
+ then
+ Id := Next_Entity (T);
+ else
+ Id := Next_Entity (B_Type);
+ end if;
+
+ while Present (Id) loop
+
+ -- Note that generic formal subprograms are not
+ -- considered to be primitive operations and thus
+ -- are never inherited.
+
+ if Is_Overloadable (Id)
+ and then Nkind (Parent (Parent (Id)))
+ not in N_Formal_Subprogram_Declaration
+ then
+ Is_Prim := False;
+
+ if Base_Type (Etype (Id)) = B_Type then
+ Is_Prim := True;
+ else
+ Formal := First_Formal (Id);
+ while Present (Formal) loop
+ if Base_Type (Etype (Formal)) = B_Type then
+ Is_Prim := True;
+ exit;
+
+ elsif Ekind (Etype (Formal)) = E_Anonymous_Access_Type
+ and then Base_Type
+ (Designated_Type (Etype (Formal))) = B_Type
+ then
+ Is_Prim := True;
+ exit;
+ end if;
+
+ Next_Formal (Formal);
+ end loop;
+ end if;
+
+ -- For a formal derived type, the only primitives are the
+ -- ones inherited from the parent type. Operations appearing
+ -- in the package declaration are not primitive for it.
+
+ if Is_Prim
+ and then (not Formal_Derived
+ or else Present (Alias (Id)))
+ then
+ Append_Elmt (Id, Op_List);
+ end if;
+ end if;
+
+ Next_Entity (Id);
+
+ -- For a type declared in System, some of its operations
+ -- may appear in the target-specific extension to System.
+
+ if No (Id)
+ and then Chars (B_Scope) = Name_System
+ and then Scope (B_Scope) = Standard_Standard
+ and then Present_System_Aux
+ then
+ B_Scope := System_Aux_Id;
+ Id := First_Entity (System_Aux_Id);
+ end if;
+ end loop;
+ end if;
+
+ return Op_List;
+ end Collect_Primitive_Operations;
+
+ -----------------------------------
+ -- Compile_Time_Constraint_Error --
+ -----------------------------------
+
+ function Compile_Time_Constraint_Error
+ (N : Node_Id;
+ Msg : String;
+ Ent : Entity_Id := Empty;
+ Loc : Source_Ptr := No_Location;
+ Warn : Boolean := False) return Node_Id
+ is
+ Msgc : String (1 .. Msg'Length + 2);
+ -- Copy of message, with room for possible ? and ! at end
- function Compile_Time_Constraint_Error
- (N : Node_Id;
- Msg : String;
- Ent : Entity_Id := Empty;
- Loc : Source_Ptr := No_Location;
- Warn : Boolean := False) return Node_Id
- is
- Msgc : String (1 .. Msg'Length + 2);
Msgl : Natural;
Wmsg : Boolean;
P : Node_Id;
+ OldP : Node_Id;
Msgs : Boolean;
Eloc : Source_Ptr;
Eloc := Sloc (N);
end if;
- -- Make all such messages unconditional
-
Msgc (1 .. Msg'Length) := Msg;
- Msgc (Msg'Length + 1) := '!';
- Msgl := Msg'Length + 1;
+ Msgl := Msg'Length;
-- Message is a warning, even in Ada 95 case
- if Msg (Msg'Length) = '?' then
+ if Msg (Msg'Last) = '?' then
Wmsg := True;
-- In Ada 83, all messages are warnings. In the private part and
-- the body of an instance, constraint_checks are only warnings.
-- We also make this a warning if the Warn parameter is set.
- elsif Warn or else (Ada_83 and then Comes_From_Source (N)) then
+ elsif Warn
+ or else (Ada_Version = Ada_83 and then Comes_From_Source (N))
+ then
Msgl := Msgl + 1;
Msgc (Msgl) := '?';
Wmsg := True;
Wmsg := True;
-- Otherwise we have a real error message (Ada 95 static case)
+ -- and we make this an unconditional message. Note that in the
+ -- warning case we do not make the message unconditional, it seems
+ -- quite reasonable to delete messages like this (about exceptions
+ -- that will be raised) in dead code.
else
Wmsg := False;
+ Msgl := Msgl + 1;
+ Msgc (Msgl) := '!';
end if;
-- Should we generate a warning? The answer is not quite yes. The
-- very annoying exception occurs in the case of a short circuit
-- operator where the left operand is static and decisive. Climb
- -- parents to see if that is the case we have here.
+ -- parents to see if that is the case we have here. Conditional
+ -- expressions with decisive conditions are a similar situation.
Msgs := True;
P := N;
-
loop
+ OldP := P;
P := Parent (P);
- if (Nkind (P) = N_And_Then
- and then Compile_Time_Known_Value (Left_Opnd (P))
- and then Is_False (Expr_Value (Left_Opnd (P))))
- or else (Nkind (P) = N_Or_Else
- and then Compile_Time_Known_Value (Left_Opnd (P))
- and then Is_True (Expr_Value (Left_Opnd (P))))
+ -- And then with False as left operand
+
+ if Nkind (P) = N_And_Then
+ and then Compile_Time_Known_Value (Left_Opnd (P))
+ and then Is_False (Expr_Value (Left_Opnd (P)))
+ then
+ Msgs := False;
+ exit;
+
+ -- OR ELSE with True as left operand
+
+ elsif Nkind (P) = N_Or_Else
+ and then Compile_Time_Known_Value (Left_Opnd (P))
+ and then Is_True (Expr_Value (Left_Opnd (P)))
then
Msgs := False;
exit;
+ -- Conditional expression
+
+ elsif Nkind (P) = N_Conditional_Expression then
+ declare
+ Cond : constant Node_Id := First (Expressions (P));
+ Texp : constant Node_Id := Next (Cond);
+ Fexp : constant Node_Id := Next (Texp);
+
+ begin
+ if Compile_Time_Known_Value (Cond) then
+
+ -- Condition is True and we are in the right operand
+
+ if Is_True (Expr_Value (Cond))
+ and then OldP = Fexp
+ then
+ Msgs := False;
+ exit;
+
+ -- Condition is False and we are in the left operand
+
+ elsif Is_False (Expr_Value (Cond))
+ and then OldP = Texp
+ then
+ Msgs := False;
+ exit;
+ end if;
+ end if;
+ end;
+
+ -- Special case for component association in aggregates, where
+ -- we want to keep climbing up to the parent aggregate.
+
elsif Nkind (P) = N_Component_Association
and then Nkind (Parent (P)) = N_Aggregate
then
- null; -- Keep going.
+ null;
+
+ -- Keep going if within subexpression
else
exit when Nkind (P) not in N_Subexpr;
if Wmsg then
if Inside_Init_Proc then
Error_Msg_NEL
- ("\& will be raised for objects of this type!?",
+ ("\?& will be raised for objects of this type",
N, Standard_Constraint_Error, Eloc);
else
Error_Msg_NEL
- ("\& will be raised at run time!?",
+ ("\?& will be raised at run time",
N, Standard_Constraint_Error, Eloc);
end if;
+
else
- Error_Msg_NEL
- ("\static expression raises&!",
- N, Standard_Constraint_Error, Eloc);
+ Error_Msg
+ ("\static expression fails Constraint_Check", Eloc);
+ Set_Error_Posted (N);
end if;
end if;
end if;
begin
E := Get_Name_Entity_Id (Chars (N));
-
while Present (E)
and then Scope (E) /= CS
and then (not Transient_Case or else Scope (E) /= Scope (CS))
--------------------------
function Denotes_Discriminant
- (N : Node_Id;
- Check_Protected : Boolean := False) return Boolean
+ (N : Node_Id;
+ Check_Concurrent : Boolean := False) return Boolean
is
E : Entity_Id;
begin
return Ekind (E) = E_Discriminant
or else
- (Check_Protected
+ (Check_Concurrent
and then Ekind (E) = E_In_Parameter
and then Present (Discriminal_Link (E))
and then
- (Is_Protected_Type (Scope (Discriminal_Link (E)))
+ (Is_Concurrent_Type (Scope (Discriminal_Link (E)))
or else
Is_Concurrent_Record_Type (Scope (Discriminal_Link (E)))));
----------------------------
function Enclosing_Generic_Body
- (E : Entity_Id) return Node_Id
+ (N : Node_Id) return Node_Id
is
P : Node_Id;
Decl : Node_Id;
Spec : Node_Id;
begin
- P := Parent (E);
-
+ P := Parent (N);
while Present (P) loop
if Nkind (P) = N_Package_Body
or else Nkind (P) = N_Subprogram_Body
return Empty;
end Enclosing_Generic_Body;
- -------------------------------
- -- Enclosing_Lib_Unit_Entity --
+ ----------------------------
+ -- Enclosing_Generic_Unit --
+ ----------------------------
+
+ function Enclosing_Generic_Unit
+ (N : Node_Id) return Node_Id
+ is
+ P : Node_Id;
+ Decl : Node_Id;
+ Spec : Node_Id;
+
+ begin
+ P := Parent (N);
+ while Present (P) loop
+ if Nkind (P) = N_Generic_Package_Declaration
+ or else Nkind (P) = N_Generic_Subprogram_Declaration
+ then
+ return P;
+
+ elsif Nkind (P) = N_Package_Body
+ or else Nkind (P) = N_Subprogram_Body
+ then
+ Spec := Corresponding_Spec (P);
+
+ if Present (Spec) then
+ Decl := Unit_Declaration_Node (Spec);
+
+ if Nkind (Decl) = N_Generic_Package_Declaration
+ or else Nkind (Decl) = N_Generic_Subprogram_Declaration
+ then
+ return Decl;
+ end if;
+ end if;
+ end if;
+
+ P := Parent (P);
+ end loop;
+
+ return Empty;
+ end Enclosing_Generic_Unit;
+
+ -------------------------------
+ -- Enclosing_Lib_Unit_Entity --
-------------------------------
function Enclosing_Lib_Unit_Entity return Entity_Id is
- Unit_Entity : Entity_Id := Current_Scope;
+ Unit_Entity : Entity_Id;
begin
-- Look for enclosing library unit entity by following scope links.
-- Equivalent to, but faster than indexing through the scope stack.
+ Unit_Entity := Current_Scope;
while (Present (Scope (Unit_Entity))
and then Scope (Unit_Entity) /= Standard_Standard)
and not Is_Child_Unit (Unit_Entity)
-----------------------------
function Enclosing_Lib_Unit_Node (N : Node_Id) return Node_Id is
- Current_Node : Node_Id := N;
+ Current_Node : Node_Id;
begin
+ Current_Node := N;
while Present (Current_Node)
and then Nkind (Current_Node) /= N_Compilation_Unit
loop
elsif Ekind (Dynamic_Scope) = E_Subprogram_Body then
return Corresponding_Spec (Parent (Parent (Dynamic_Scope)));
- elsif Ekind (Dynamic_Scope) = E_Block then
+ elsif Ekind (Dynamic_Scope) = E_Block
+ or else Ekind (Dynamic_Scope) = E_Return_Statement
+ then
return Enclosing_Subprogram (Dynamic_Scope);
elsif Ekind (Dynamic_Scope) = E_Task_Type then
-- Enter_Name --
----------------
- procedure Enter_Name (Def_Id : Node_Id) is
+ procedure Enter_Name (Def_Id : Entity_Id) is
C : constant Entity_Id := Current_Entity (Def_Id);
E : constant Entity_Id := Current_Entity_In_Scope (Def_Id);
S : constant Entity_Id := Current_Scope;
+ function Is_Private_Component_Renaming (N : Node_Id) return Boolean;
+ -- Recognize a renaming declaration that is introduced for private
+ -- components of a protected type. We treat these as weak declarations
+ -- so that they are overridden by entities with the same name that
+ -- come from source, such as formals or local variables of a given
+ -- protected declaration.
+
+ -----------------------------------
+ -- Is_Private_Component_Renaming --
+ -----------------------------------
+
+ function Is_Private_Component_Renaming (N : Node_Id) return Boolean is
+ begin
+ return not Comes_From_Source (N)
+ and then not Comes_From_Source (Current_Scope)
+ and then Nkind (N) = N_Object_Renaming_Declaration;
+ end Is_Private_Component_Renaming;
+
+ -- Start of processing for Enter_Name
+
begin
Generate_Definition (Def_Id);
-- hides the implicit one, which is removed from all visibility,
-- i.e. the entity list of its scope, and homonym chain of its name.
- elsif (Is_Overloadable (E) and then Present (Alias (E)))
+ elsif (Is_Overloadable (E) and then Is_Inherited_Operation (E))
or else Is_Internal (E)
- or else (Ekind (E) = E_Enumeration_Literal
- and then Is_Derived_Type (Etype (E)))
then
declare
Prev : Entity_Id;
-- entity in the scope.
Prev := First_Entity (Current_Scope);
-
while Present (Prev)
and then Next_Entity (Prev) /= E
loop
then
return;
+ elsif Is_Private_Component_Renaming (Parent (Def_Id)) then
+ return;
+
-- In the body or private part of an instance, a type extension
-- may introduce a component with the same name as that of an
-- actual. The legality rule is not enforced, but the semantics
-- Warn if new entity hides an old one
- if Warn_On_Hiding
- and then Present (C)
- and then Length_Of_Name (Chars (C)) /= 1
- and then Comes_From_Source (C)
- and then Comes_From_Source (Def_Id)
- and then In_Extended_Main_Source_Unit (Def_Id)
+ if Warn_On_Hiding and then Present (C)
+
+ -- Don't warn for record components since they always have a well
+ -- defined scope which does not confuse other uses. Note that in
+ -- some cases, Ekind has not been set yet.
+
+ and then Ekind (C) /= E_Component
+ and then Ekind (C) /= E_Discriminant
+ and then Nkind (Parent (C)) /= N_Component_Declaration
+ and then Ekind (Def_Id) /= E_Component
+ and then Ekind (Def_Id) /= E_Discriminant
+ and then Nkind (Parent (Def_Id)) /= N_Component_Declaration
+
+ -- Don't warn for one character variables. It is too common to use
+ -- such variables as locals and will just cause too many false hits.
+
+ and then Length_Of_Name (Chars (C)) /= 1
+
+ -- Don't warn for non-source eneities
+
+ and then Comes_From_Source (C)
+ and then Comes_From_Source (Def_Id)
+
+ -- Don't warn unless entity in question is in extended main source
+
+ and then In_Extended_Main_Source_Unit (Def_Id)
+
+ -- Finally, the hidden entity must be either immediately visible
+ -- or use visible (from a used package)
+
+ and then
+ (Is_Immediately_Visible (C)
+ or else
+ Is_Potentially_Use_Visible (C))
then
Error_Msg_Sloc := Sloc (C);
Error_Msg_N ("declaration hides &#?", Def_Id);
if Is_Array_Type (T) then
Error_Msg_Node_2 := T;
Error_Msg_NE
- ("component type& of type& is limited", N, Component_Type (T));
+ ("\component type& of type& is limited", N, Component_Type (T));
Explain_Limited_Type (Component_Type (T), N);
elsif Is_Record_Type (T) then
return;
end if;
- -- Otherwise find a limited component
+ -- Otherwise find a limited component. Check only components that
+ -- come from source, or inherited components that appear in the
+ -- source of the ancestor.
C := First_Component (T);
while Present (C) loop
- if Is_Limited_Type (Etype (C)) then
+ if Is_Limited_Type (Etype (C))
+ and then
+ (Comes_From_Source (C)
+ or else
+ (Present (Original_Record_Component (C))
+ and then
+ Comes_From_Source (Original_Record_Component (C))))
+ then
Error_Msg_Node_2 := T;
Error_Msg_NE ("\component& of type& has limited type", N, C);
Explain_Limited_Type (Etype (C), N);
Next_Component (C);
end loop;
- -- It's odd if the loop falls through, but this is only an extra
- -- error message, so we just let it go and ignore the situation.
-
+ -- The type may be declared explicitly limited, even if no component
+ -- of it is limited, in which case we fall out of the loop.
return;
end if;
end Explain_Limited_Type;
raise Program_Error;
end Find_Corresponding_Discriminant;
+ --------------------------------------------
+ -- Find_Overridden_Synchronized_Primitive --
+ --------------------------------------------
+
+ function Find_Overridden_Synchronized_Primitive
+ (Def_Id : Entity_Id;
+ First_Hom : Entity_Id;
+ Ifaces_List : Elist_Id;
+ In_Scope : Boolean) return Entity_Id
+ is
+ Candidate : Entity_Id := Empty;
+ Hom : Entity_Id := Empty;
+ Iface_Typ : Entity_Id;
+ Subp : Entity_Id := Empty;
+ Tag_Typ : Entity_Id;
+
+ function Find_Parameter_Type (Param : Node_Id) return Entity_Id;
+ -- Return the type of a formal parameter as determined by its
+ -- specification.
+
+ function Has_Correct_Formal_Mode (Subp : Entity_Id) return Boolean;
+ -- For an overridden subprogram Subp, check whether the mode of its
+ -- first parameter is correct depending on the kind of Tag_Typ.
+
+ function Matches_Prefixed_View_Profile
+ (Prim_Params : List_Id;
+ Iface_Params : List_Id) return Boolean;
+ -- Determine whether a subprogram's parameter profile Prim_Params
+ -- matches that of a potentially overriden interface subprogram
+ -- Iface_Params. Also determine if the type of first parameter of
+ -- Iface_Params is an implemented interface.
+
+ -------------------------
+ -- Find_Parameter_Type --
+ -------------------------
+
+ function Find_Parameter_Type (Param : Node_Id) return Entity_Id is
+ begin
+ pragma Assert (Nkind (Param) = N_Parameter_Specification);
+
+ if Nkind (Parameter_Type (Param)) = N_Access_Definition then
+ return Etype (Subtype_Mark (Parameter_Type (Param)));
+
+ else
+ return Etype (Parameter_Type (Param));
+ end if;
+ end Find_Parameter_Type;
+
+ -----------------------------
+ -- Has_Correct_Formal_Mode --
+ -----------------------------
+
+ function Has_Correct_Formal_Mode (Subp : Entity_Id) return Boolean is
+ Param : Node_Id;
+
+ begin
+ Param := First_Formal (Subp);
+
+ -- In order for an entry or a protected procedure to override, the
+ -- first parameter of the overridden routine must be of mode "out",
+ -- "in out" or access-to-variable.
+
+ if (Ekind (Subp) = E_Entry
+ or else Ekind (Subp) = E_Procedure)
+ and then Is_Protected_Type (Tag_Typ)
+ and then Ekind (Param) /= E_In_Out_Parameter
+ and then Ekind (Param) /= E_Out_Parameter
+ and then Nkind (Parameter_Type (Parent (Param))) /=
+ N_Access_Definition
+ then
+ return False;
+ end if;
+
+ -- All other cases are OK since a task entry or routine does not
+ -- have a restriction on the mode of the first parameter of the
+ -- overridden interface routine.
+
+ return True;
+ end Has_Correct_Formal_Mode;
+
+ -----------------------------------
+ -- Matches_Prefixed_View_Profile --
+ -----------------------------------
+
+ function Matches_Prefixed_View_Profile
+ (Prim_Params : List_Id;
+ Iface_Params : List_Id) return Boolean
+ is
+ Iface_Id : Entity_Id;
+ Iface_Param : Node_Id;
+ Iface_Typ : Entity_Id;
+ Prim_Id : Entity_Id;
+ Prim_Param : Node_Id;
+ Prim_Typ : Entity_Id;
+
+ function Is_Implemented (Iface : Entity_Id) return Boolean;
+ -- Determine if Iface is implemented by the current task or
+ -- protected type.
+
+ --------------------
+ -- Is_Implemented --
+ --------------------
+
+ function Is_Implemented (Iface : Entity_Id) return Boolean is
+ Iface_Elmt : Elmt_Id;
+
+ begin
+ Iface_Elmt := First_Elmt (Ifaces_List);
+ while Present (Iface_Elmt) loop
+ if Node (Iface_Elmt) = Iface then
+ return True;
+ end if;
+
+ Next_Elmt (Iface_Elmt);
+ end loop;
+
+ return False;
+ end Is_Implemented;
+
+ -- Start of processing for Matches_Prefixed_View_Profile
+
+ begin
+ Iface_Param := First (Iface_Params);
+ Iface_Typ := Find_Parameter_Type (Iface_Param);
+ Prim_Param := First (Prim_Params);
+
+ -- The first parameter of the potentially overriden subprogram
+ -- must be an interface implemented by Prim.
+
+ if not Is_Interface (Iface_Typ)
+ or else not Is_Implemented (Iface_Typ)
+ then
+ return False;
+ end if;
+
+ -- The checks on the object parameters are done, move onto the rest
+ -- of the parameters.
+
+ if not In_Scope then
+ Prim_Param := Next (Prim_Param);
+ end if;
+
+ Iface_Param := Next (Iface_Param);
+ while Present (Iface_Param) and then Present (Prim_Param) loop
+ Iface_Id := Defining_Identifier (Iface_Param);
+ Iface_Typ := Find_Parameter_Type (Iface_Param);
+ Prim_Id := Defining_Identifier (Prim_Param);
+ Prim_Typ := Find_Parameter_Type (Prim_Param);
+
+ -- Case of multiple interface types inside a parameter profile
+
+ -- (Obj_Param : in out Iface; ...; Param : Iface)
+
+ -- If the interface type is implemented, then the matching type
+ -- in the primitive should be the implementing record type.
+
+ if Ekind (Iface_Typ) = E_Record_Type
+ and then Is_Interface (Iface_Typ)
+ and then Is_Implemented (Iface_Typ)
+ then
+ if Prim_Typ /= Tag_Typ then
+ return False;
+ end if;
+
+ -- The two parameters must be both mode and subtype conformant
+
+ elsif Ekind (Iface_Id) /= Ekind (Prim_Id)
+ or else
+ not Conforming_Types (Iface_Typ, Prim_Typ, Subtype_Conformant)
+ then
+ return False;
+ end if;
+
+ Next (Iface_Param);
+ Next (Prim_Param);
+ end loop;
+
+ -- One of the two lists contains more parameters than the other
+
+ if Present (Iface_Param) or else Present (Prim_Param) then
+ return False;
+ end if;
+
+ return True;
+ end Matches_Prefixed_View_Profile;
+
+ -- Start of processing for Find_Overridden_Synchronized_Primitive
+
+ begin
+ -- At this point the caller should have collected the interfaces
+ -- implemented by the synchronized type.
+
+ pragma Assert (Present (Ifaces_List));
+
+ -- Find the tagged type to which subprogram Def_Id is primitive. If the
+ -- subprogram was declared within a protected or a task type, the type
+ -- is the scope itself, otherwise it is the type of the first parameter.
+
+ if In_Scope then
+ Tag_Typ := Scope (Def_Id);
+
+ elsif Present (First_Formal (Def_Id)) then
+ Tag_Typ := Find_Parameter_Type (Parent (First_Formal (Def_Id)));
+
+ -- A parameterless subprogram which is declared outside a synchronized
+ -- type cannot act as a primitive, thus it cannot override anything.
+
+ else
+ return Empty;
+ end if;
+
+ -- Traverse the homonym chain, looking at a potentially overriden
+ -- subprogram that belongs to an implemented interface.
+
+ Hom := First_Hom;
+ while Present (Hom) loop
+ Subp := Hom;
+
+ -- Entries can override abstract or null interface procedures
+
+ if Ekind (Def_Id) = E_Entry
+ and then Ekind (Subp) = E_Procedure
+ and then Nkind (Parent (Subp)) = N_Procedure_Specification
+ and then (Is_Abstract_Subprogram (Subp)
+ or else Null_Present (Parent (Subp)))
+ then
+ while Present (Alias (Subp)) loop
+ Subp := Alias (Subp);
+ end loop;
+
+ if Matches_Prefixed_View_Profile
+ (Parameter_Specifications (Parent (Def_Id)),
+ Parameter_Specifications (Parent (Subp)))
+ then
+ Candidate := Subp;
+
+ -- Absolute match
+
+ if Has_Correct_Formal_Mode (Candidate) then
+ return Candidate;
+ end if;
+ end if;
+
+ -- Procedures can override abstract or null interface procedures
+
+ elsif Ekind (Def_Id) = E_Procedure
+ and then Ekind (Subp) = E_Procedure
+ and then Nkind (Parent (Subp)) = N_Procedure_Specification
+ and then (Is_Abstract_Subprogram (Subp)
+ or else Null_Present (Parent (Subp)))
+ and then Matches_Prefixed_View_Profile
+ (Parameter_Specifications (Parent (Def_Id)),
+ Parameter_Specifications (Parent (Subp)))
+ then
+ Candidate := Subp;
+
+ -- Absolute match
+
+ if Has_Correct_Formal_Mode (Candidate) then
+ return Candidate;
+ end if;
+
+ -- Functions can override abstract interface functions
+
+ elsif Ekind (Def_Id) = E_Function
+ and then Ekind (Subp) = E_Function
+ and then Nkind (Parent (Subp)) = N_Function_Specification
+ and then Is_Abstract_Subprogram (Subp)
+ and then Matches_Prefixed_View_Profile
+ (Parameter_Specifications (Parent (Def_Id)),
+ Parameter_Specifications (Parent (Subp)))
+ and then Etype (Result_Definition (Parent (Def_Id))) =
+ Etype (Result_Definition (Parent (Subp)))
+ then
+ return Subp;
+ end if;
+
+ Hom := Homonym (Hom);
+ end loop;
+
+ -- After examining all candidates for overriding, we are left with
+ -- the best match which is a mode incompatible interface routine.
+ -- Do not emit an error if the Expander is active since this error
+ -- will be detected later on after all concurrent types are expanded
+ -- and all wrappers are built. This check is meant for spec-only
+ -- compilations.
+
+ if Present (Candidate)
+ and then not Expander_Active
+ then
+ Iface_Typ := Find_Parameter_Type (Parent (First_Formal (Candidate)));
+
+ -- Def_Id is primitive of a protected type, declared inside the type,
+ -- and the candidate is primitive of a limited or synchronized
+ -- interface.
+
+ if In_Scope
+ and then Is_Protected_Type (Tag_Typ)
+ and then
+ (Is_Limited_Interface (Iface_Typ)
+ or else Is_Protected_Interface (Iface_Typ)
+ or else Is_Synchronized_Interface (Iface_Typ)
+ or else Is_Task_Interface (Iface_Typ))
+ then
+ -- Must reword this message, comma before to in -gnatj mode ???
+
+ Error_Msg_NE
+ ("first formal of & must be of mode `OUT`, `IN OUT` or " &
+ "access-to-variable", Tag_Typ, Candidate);
+ Error_Msg_N
+ ("\to be overridden by protected procedure or entry " &
+ "(RM 9.4(11.9/2))", Tag_Typ);
+ end if;
+ end if;
+
+ return Candidate;
+ end Find_Overridden_Synchronized_Primitive;
+
-----------------------------
-- Find_Static_Alternative --
-----------------------------
Search : loop
if Nkind (Alt) /= N_Pragma then
Choice := First (Discrete_Choices (Alt));
-
while Present (Choice) loop
-- Others choice, always matches
pragma Warnings (Off, Res);
function Internal_Full_Qualified_Name (E : Entity_Id) return String_Id;
- -- Compute recursively the qualified name without NUL at the end.
+ -- Compute recursively the qualified name without NUL at the end
----------------------------------
-- Internal_Full_Qualified_Name --
Ent := Defining_Identifier (Ent);
end if;
- -- Compute recursively the qualification. Only "Standard" has no
- -- scope.
+ -- Compute qualification recursively (only "Standard" has no scope)
if Present (Scope (Scope (Ent))) then
Parent_Name := Internal_Full_Qualified_Name (Scope (Ent));
-- Generates the entity name in upper case
- Get_Name_String (Chars (Ent));
+ Get_Decoded_Name_String (Chars (Ent));
Set_All_Upper_Case;
Store_String_Chars (Name_Buffer (1 .. Name_Len));
return End_String;
while Present (Comp_Item) loop
- -- Skip the tag of a tagged record, as well as all items
- -- that are not user components (anonymous types, rep clauses,
- -- Parent field, controller field).
+ -- Skip the tag of a tagged record, the interface tags, as well
+ -- as all items that are not user components (anonymous types,
+ -- rep clauses, Parent field, controller field).
- if Nkind (Comp_Item) = N_Component_Declaration
- and then Chars (Defining_Identifier (Comp_Item)) /= Name_uTag
- and then Chars (Defining_Identifier (Comp_Item)) /= Name_uParent
- and then Chars (Defining_Identifier (Comp_Item)) /= Name_uController
- then
- Append_Elmt (Defining_Identifier (Comp_Item), Into);
+ if Nkind (Comp_Item) = N_Component_Declaration then
+ declare
+ Comp : constant Entity_Id := Defining_Identifier (Comp_Item);
+ begin
+ if not Is_Tag (Comp)
+ and then Chars (Comp) /= Name_uParent
+ and then Chars (Comp) /= Name_uController
+ then
+ Append_Elmt (Comp, Into);
+ end if;
+ end;
end if;
Next (Comp_Item);
and then Is_Derived_Type (Typ)
and then Present (Stored_Constraint (Typ))
then
-
-- If the type is a tagged type with inherited discriminants,
-- use the stored constraint on the parent in order to find
-- the values of discriminants that are otherwise hidden by an
begin
D := First_Discriminant (Etype (Typ));
C := First_Elmt (Stored_Constraint (Typ));
-
- while Present (D)
- and then Present (C)
- loop
+ while Present (D) and then Present (C) loop
if Chars (Discrim_Name) = Chars (D) then
if Is_Entity_Name (Node (C))
and then Entity (Node (C)) = Entity (Discrim)
then
- -- D is renamed by Discrim, whose value is
- -- given in Assoc.
+ -- D is renamed by Discrim, whose value is given in
+ -- Assoc.
null;
exit Find_Constraint;
end if;
- D := Next_Discriminant (D);
+ Next_Discriminant (D);
Next_Elmt (C);
end loop;
end;
Atyp : Entity_Id;
begin
- if not Present (Utyp) then
+ if No (Utyp) then
Utyp := Typ;
end if;
-- because the discriminant is not available. The restrictions on
-- Unchecked_Union are designed to make sure that this is OK.
- elsif Is_Unchecked_Union (Utyp) then
+ elsif Is_Unchecked_Union (Base_Type (Utyp)) then
return Typ;
-- Here for the unconstrained case, we must find actual subtype
Loc : Source_Ptr) return Node_Id
is
Lit : Node_Id;
- P : constant Nat := UI_To_Int (Pos);
begin
- -- In the case where the literal is either of type Wide_Character
- -- or Character or of a type derived from them, there needs to be
- -- some special handling since there is no explicit chain of
- -- literals to search. Instead, an N_Character_Literal node is
- -- created with the appropriate Char_Code and Chars fields.
+ -- In the case where the literal is of type Character, Wide_Character
+ -- or Wide_Wide_Character or of a type derived from them, there needs
+ -- to be some special handling since there is no explicit chain of
+ -- literals to search. Instead, an N_Character_Literal node is created
+ -- with the appropriate Char_Code and Chars fields.
if Root_Type (T) = Standard_Character
or else Root_Type (T) = Standard_Wide_Character
+ or else Root_Type (T) = Standard_Wide_Wide_Character
then
- Set_Character_Literal_Name (Char_Code (P));
+ Set_Character_Literal_Name (UI_To_CC (Pos));
return
Make_Character_Literal (Loc,
- Chars => Name_Find,
- Char_Literal_Value => Char_Code (P));
+ Chars => Name_Find,
+ Char_Literal_Value => Pos);
-- For all other cases, we have a complete table of literals, and
-- we simply iterate through the chain of literal until the one
else
Lit := First_Literal (Base_Type (T));
- for J in 1 .. P loop
+ for J in 1 .. UI_To_Int (Pos) loop
Next_Literal (Lit);
end loop;
function Get_Generic_Entity (N : Node_Id) return Entity_Id is
Ent : constant Entity_Id := Entity (Name (N));
-
begin
if Present (Renamed_Object (Ent)) then
return Renamed_Object (Ent);
end if;
else
- -- N is an expression, indicating a range with one value.
+ -- N is an expression, indicating a range with one value
L := N;
H := N;
end if;
end Get_Index_Bounds;
+ ----------------------------------
+ -- Get_Library_Unit_Name_string --
+ ----------------------------------
+
+ procedure Get_Library_Unit_Name_String (Decl_Node : Node_Id) is
+ Unit_Name_Id : constant Unit_Name_Type := Get_Unit_Name (Decl_Node);
+
+ begin
+ Get_Unit_Name_String (Unit_Name_Id);
+
+ -- Remove seven last character (" (spec)" or " (body)")
+
+ Name_Len := Name_Len - 7;
+ pragma Assert (Name_Buffer (Name_Len + 1) = ' ');
+ end Get_Library_Unit_Name_String;
+
------------------------
-- Get_Name_Entity_Id --
------------------------
---------------------------
function Get_Referenced_Object (N : Node_Id) return Node_Id is
- R : Node_Id := N;
+ R : Node_Id;
+
+ begin
+ R := N;
+ while Is_Entity_Name (R)
+ and then Present (Renamed_Object (Entity (R)))
+ loop
+ R := Renamed_Object (Entity (R));
+ end loop;
+
+ return R;
+ end Get_Referenced_Object;
+
+ ------------------------
+ -- Get_Renamed_Entity --
+ ------------------------
+
+ function Get_Renamed_Entity (E : Entity_Id) return Entity_Id is
+ R : Entity_Id;
+
+ begin
+ R := E;
+ while Present (Renamed_Entity (R)) loop
+ R := Renamed_Entity (R);
+ end loop;
+
+ return R;
+ end Get_Renamed_Entity;
+
+ -------------------------
+ -- Get_Subprogram_Body --
+ -------------------------
+
+ function Get_Subprogram_Body (E : Entity_Id) return Node_Id is
+ Decl : Node_Id;
+
+ begin
+ Decl := Unit_Declaration_Node (E);
+
+ if Nkind (Decl) = N_Subprogram_Body then
+ return Decl;
+
+ -- The below comment is bad, because it is possible for
+ -- Nkind (Decl) to be an N_Subprogram_Body_Stub ???
+
+ else -- Nkind (Decl) = N_Subprogram_Declaration
+
+ if Present (Corresponding_Body (Decl)) then
+ return Unit_Declaration_Node (Corresponding_Body (Decl));
+
+ -- Imported subprogram case
+
+ else
+ return Empty;
+ end if;
+ end if;
+ end Get_Subprogram_Body;
+
+ ---------------------------
+ -- Get_Subprogram_Entity --
+ ---------------------------
+
+ function Get_Subprogram_Entity (Nod : Node_Id) return Entity_Id is
+ Nam : Node_Id;
+ Proc : Entity_Id;
+
+ begin
+ if Nkind (Nod) = N_Accept_Statement then
+ Nam := Entry_Direct_Name (Nod);
+
+ -- For an entry call, the prefix of the call is a selected component.
+ -- Need additional code for internal calls ???
+
+ elsif Nkind (Nod) = N_Entry_Call_Statement then
+ if Nkind (Name (Nod)) = N_Selected_Component then
+ Nam := Entity (Selector_Name (Name (Nod)));
+ else
+ Nam := Empty;
+ end if;
+
+ else
+ Nam := Name (Nod);
+ end if;
+
+ if Nkind (Nam) = N_Explicit_Dereference then
+ Proc := Etype (Prefix (Nam));
+ elsif Is_Entity_Name (Nam) then
+ Proc := Entity (Nam);
+ else
+ return Empty;
+ end if;
+
+ if Is_Object (Proc) then
+ Proc := Etype (Proc);
+ end if;
+
+ if Ekind (Proc) = E_Access_Subprogram_Type then
+ Proc := Directly_Designated_Type (Proc);
+ end if;
+
+ if not Is_Subprogram (Proc)
+ and then Ekind (Proc) /= E_Subprogram_Type
+ then
+ return Empty;
+ else
+ return Proc;
+ end if;
+ end Get_Subprogram_Entity;
+
+ -----------------------------
+ -- Get_Task_Body_Procedure --
+ -----------------------------
+
+ function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
+ begin
+ -- Note: A task type may be the completion of a private type with
+ -- discriminants. when performing elaboration checks on a task
+ -- declaration, the current view of the type may be the private one,
+ -- and the procedure that holds the body of the task is held in its
+ -- underlying type.
+
+ -- This is an odd function, why not have Task_Body_Procedure do
+ -- the following digging???
+
+ return Task_Body_Procedure (Underlying_Type (Root_Type (E)));
+ end Get_Task_Body_Procedure;
+
+ -----------------------------
+ -- Has_Abstract_Interfaces --
+ -----------------------------
+
+ function Has_Abstract_Interfaces
+ (Tagged_Type : Entity_Id;
+ Use_Full_View : Boolean := True) return Boolean
+ is
+ Typ : Entity_Id;
+
+ begin
+ pragma Assert (Is_Record_Type (Tagged_Type)
+ and then Is_Tagged_Type (Tagged_Type));
+
+ -- Handle concurrent record types
+
+ if Is_Concurrent_Record_Type (Tagged_Type)
+ and then Is_Non_Empty_List (Abstract_Interface_List (Tagged_Type))
+ then
+ return True;
+ end if;
+
+ Typ := Tagged_Type;
+
+ -- Handle private types
+
+ if Use_Full_View
+ and then Present (Full_View (Tagged_Type))
+ then
+ Typ := Full_View (Tagged_Type);
+ end if;
+
+ loop
+ if Is_Interface (Typ)
+ or else
+ (Is_Record_Type (Typ)
+ and then Present (Abstract_Interfaces (Typ))
+ and then not Is_Empty_Elmt_List (Abstract_Interfaces (Typ)))
+ then
+ return True;
+ end if;
+
+ exit when Etype (Typ) = Typ
+
+ -- Handle private types
+
+ or else (Present (Full_View (Etype (Typ)))
+ and then Full_View (Etype (Typ)) = Typ)
+
+ -- Protect the frontend against wrong source with cyclic
+ -- derivations
+
+ or else Etype (Typ) = Tagged_Type;
+
+ -- Climb to the ancestor type handling private types
+
+ if Present (Full_View (Etype (Typ))) then
+ Typ := Full_View (Etype (Typ));
+ else
+ Typ := Etype (Typ);
+ end if;
+ end loop;
+
+ return False;
+ end Has_Abstract_Interfaces;
+
+ -----------------------
+ -- Has_Access_Values --
+ -----------------------
+
+ function Has_Access_Values (T : Entity_Id) return Boolean is
+ Typ : constant Entity_Id := Underlying_Type (T);
+
+ begin
+ -- Case of a private type which is not completed yet. This can only
+ -- happen in the case of a generic format type appearing directly, or
+ -- as a component of the type to which this function is being applied
+ -- at the top level. Return False in this case, since we certainly do
+ -- not know that the type contains access types.
+
+ if No (Typ) then
+ return False;
+
+ elsif Is_Access_Type (Typ) then
+ return True;
+
+ elsif Is_Array_Type (Typ) then
+ return Has_Access_Values (Component_Type (Typ));
+
+ elsif Is_Record_Type (Typ) then
+ declare
+ Comp : Entity_Id;
+
+ begin
+ Comp := First_Component_Or_Discriminant (Typ);
+ while Present (Comp) loop
+ if Has_Access_Values (Etype (Comp)) then
+ return True;
+ end if;
+
+ Next_Component_Or_Discriminant (Comp);
+ end loop;
+ end;
+
+ return False;
+
+ else
+ return False;
+ end if;
+ end Has_Access_Values;
+
+ ------------------------------
+ -- Has_Compatible_Alignment --
+ ------------------------------
+
+ function Has_Compatible_Alignment
+ (Obj : Entity_Id;
+ Expr : Node_Id) return Alignment_Result
+ is
+ function Has_Compatible_Alignment_Internal
+ (Obj : Entity_Id;
+ Expr : Node_Id;
+ Default : Alignment_Result) return Alignment_Result;
+ -- This is the internal recursive function that actually does the work.
+ -- There is one additional parameter, which says what the result should
+ -- be if no alignment information is found, and there is no definite
+ -- indication of compatible alignments. At the outer level, this is set
+ -- to Unknown, but for internal recursive calls in the case where types
+ -- are known to be correct, it is set to Known_Compatible.
+
+ ---------------------------------------
+ -- Has_Compatible_Alignment_Internal --
+ ---------------------------------------
+
+ function Has_Compatible_Alignment_Internal
+ (Obj : Entity_Id;
+ Expr : Node_Id;
+ Default : Alignment_Result) return Alignment_Result
+ is
+ Result : Alignment_Result := Known_Compatible;
+ -- Set to result if Problem_Prefix or Problem_Offset returns True.
+ -- Note that once a value of Known_Incompatible is set, it is sticky
+ -- and does not get changed to Unknown (the value in Result only gets
+ -- worse as we go along, never better).
+
+ procedure Check_Offset (Offs : Uint);
+ -- Called when Expr is a selected or indexed component with Offs set
+ -- to resp Component_First_Bit or Component_Size. Checks that if the
+ -- offset is specified it is compatible with the object alignment
+ -- requirements. The value in Result is modified accordingly.
+
+ procedure Check_Prefix;
+ -- Checks the prefix recursively in the case where the expression
+ -- is an indexed or selected component.
+
+ procedure Set_Result (R : Alignment_Result);
+ -- If R represents a worse outcome (unknown instead of known
+ -- compatible, or known incompatible), then set Result to R.
+
+ ------------------
+ -- Check_Offset --
+ ------------------
+
+ procedure Check_Offset (Offs : Uint) is
+ begin
+ -- Unspecified or zero offset is always OK
+
+ if Offs = No_Uint or else Offs = Uint_0 then
+ null;
+
+ -- If we do not know required alignment, any non-zero offset is
+ -- a potential problem (but certainly may be OK, so result is
+ -- unknown).
+
+ elsif Unknown_Alignment (Obj) then
+ Set_Result (Unknown);
+
+ -- If we know the required alignment, see if offset is compatible
+
+ else
+ if Offs mod (System_Storage_Unit * Alignment (Obj)) /= 0 then
+ Set_Result (Known_Incompatible);
+ end if;
+ end if;
+ end Check_Offset;
+
+ ------------------
+ -- Check_Prefix --
+ ------------------
+
+ procedure Check_Prefix is
+ begin
+ -- The subtlety here is that in doing a recursive call to check
+ -- the prefix, we have to decide what to do in the case where we
+ -- don't find any specific indication of an alignment problem.
+
+ -- At the outer level, we normally set Unknown as the result in
+ -- this case, since we can only set Known_Compatible if we really
+ -- know that the alignment value is OK, but for the recursive
+ -- call, in the case where the types match, and we have not
+ -- specified a peculiar alignment for the object, we are only
+ -- concerned about suspicious rep clauses, the default case does
+ -- not affect us, since the compiler will, in the absence of such
+ -- rep clauses, ensure that the alignment is correct.
+
+ if Default = Known_Compatible
+ or else
+ (Etype (Obj) = Etype (Expr)
+ and then (Unknown_Alignment (Obj)
+ or else
+ Alignment (Obj) = Alignment (Etype (Obj))))
+ then
+ Set_Result
+ (Has_Compatible_Alignment_Internal
+ (Obj, Prefix (Expr), Known_Compatible));
+
+ -- In all other cases, we need a full check on the prefix
+
+ else
+ Set_Result
+ (Has_Compatible_Alignment_Internal
+ (Obj, Prefix (Expr), Unknown));
+ end if;
+ end Check_Prefix;
+
+ ----------------
+ -- Set_Result --
+ ----------------
+
+ procedure Set_Result (R : Alignment_Result) is
+ begin
+ if R > Result then
+ Result := R;
+ end if;
+ end Set_Result;
+
+ -- Start of processing for Has_Compatible_Alignment_Internal
+
+ begin
+ -- If Expr is a selected component, we must make sure there is no
+ -- potentially troublesome component clause, and that the record is
+ -- not packed.
+
+ if Nkind (Expr) = N_Selected_Component then
+
+ -- Packed record always generate unknown alignment
+
+ if Is_Packed (Etype (Prefix (Expr))) then
+ Set_Result (Unknown);
+ end if;
+
+ -- Check possible bad component offset and check prefix
+
+ Check_Offset
+ (Component_Bit_Offset (Entity (Selector_Name (Expr))));
+ Check_Prefix;
+
+ -- If Expr is an indexed component, we must make sure there is no
+ -- potentially troublesome Component_Size clause and that the array
+ -- is not bit-packed.
+
+ elsif Nkind (Expr) = N_Indexed_Component then
+
+ -- Bit packed array always generates unknown alignment
+
+ if Is_Bit_Packed_Array (Etype (Prefix (Expr))) then
+ Set_Result (Unknown);
+ end if;
+
+ -- Check possible bad component size and check prefix
+
+ Check_Offset (Component_Size (Etype (Prefix (Expr))));
+ Check_Prefix;
+ end if;
+
+ -- Case where we know the alignment of the object
+
+ if Known_Alignment (Obj) then
+ declare
+ ObjA : constant Uint := Alignment (Obj);
+ ExpA : Uint := No_Uint;
+ SizA : Uint := No_Uint;
+
+ begin
+ -- If alignment of Obj is 1, then we are always OK
+
+ if ObjA = 1 then
+ Set_Result (Known_Compatible);
+
+ -- Alignment of Obj is greater than 1, so we need to check
+
+ else
+ -- See if Expr is an object with known alignment
+
+ if Is_Entity_Name (Expr)
+ and then Known_Alignment (Entity (Expr))
+ then
+ ExpA := Alignment (Entity (Expr));
+
+ -- Otherwise, we can use the alignment of the type of
+ -- Expr given that we already checked for
+ -- discombobulating rep clauses for the cases of indexed
+ -- and selected components above.
+
+ elsif Known_Alignment (Etype (Expr)) then
+ ExpA := Alignment (Etype (Expr));
+ end if;
+
+ -- If we got an alignment, see if it is acceptable
+
+ if ExpA /= No_Uint then
+ if ExpA < ObjA then
+ Set_Result (Known_Incompatible);
+ end if;
+
+ -- Case of Expr alignment unknown
+
+ else
+ Set_Result (Default);
+ end if;
+
+ -- See if size is given. If so, check that it is not too
+ -- small for the required alignment.
+ -- See if Expr is an object with known alignment
+
+ if Is_Entity_Name (Expr)
+ and then Known_Static_Esize (Entity (Expr))
+ then
+ SizA := Esize (Entity (Expr));
+
+ -- Otherwise, we check the object size of the Expr type
+
+ elsif Known_Static_Esize (Etype (Expr)) then
+ SizA := Esize (Etype (Expr));
+ end if;
+
+ -- If we got a size, see if it is a multiple of the Obj
+ -- alignment, if not, then the alignment cannot be
+ -- acceptable, since the size is always a multiple of the
+ -- alignment.
+
+ if SizA /= No_Uint then
+ if SizA mod (ObjA * Ttypes.System_Storage_Unit) /= 0 then
+ Set_Result (Known_Incompatible);
+ end if;
+ end if;
+ end if;
+ end;
+
+ -- If we can't find the result by direct comparison of alignment
+ -- values, then there is still one case that we can determine known
+ -- result, and that is when we can determine that the types are the
+ -- same, and no alignments are specified. Then we known that the
+ -- alignments are compatible, even if we don't know the alignment
+ -- value in the front end.
+
+ elsif Etype (Obj) = Etype (Expr) then
+
+ -- Types are the same, but we have to check for possible size
+ -- and alignments on the Expr object that may make the alignment
+ -- different, even though the types are the same.
+
+ if Is_Entity_Name (Expr) then
+
+ -- First check alignment of the Expr object. Any alignment less
+ -- than Maximum_Alignment is worrisome since this is the case
+ -- where we do not know the alignment of Obj.
+
+ if Known_Alignment (Entity (Expr))
+ and then
+ UI_To_Int (Alignment (Entity (Expr)))
+ < Ttypes.Maximum_Alignment
+ then
+ Set_Result (Unknown);
+
+ -- Now check size of Expr object. Any size that is not an
+ -- even multiple of Maxiumum_Alignment is also worrisome
+ -- since it may cause the alignment of the object to be less
+ -- than the alignment of the type.
+
+ elsif Known_Static_Esize (Entity (Expr))
+ and then
+ (UI_To_Int (Esize (Entity (Expr))) mod
+ (Ttypes.Maximum_Alignment * Ttypes.System_Storage_Unit))
+ /= 0
+ then
+ Set_Result (Unknown);
+
+ -- Otherwise same type is decisive
+
+ else
+ Set_Result (Known_Compatible);
+ end if;
+ end if;
+
+ -- Another case to deal with is when there is an explicit size or
+ -- alignment clause when the types are not the same. If so, then the
+ -- result is Unknown. We don't need to do this test if the Default is
+ -- Unknown, since that result will be set in any case.
+
+ elsif Default /= Unknown
+ and then (Has_Size_Clause (Etype (Expr))
+ or else
+ Has_Alignment_Clause (Etype (Expr)))
+ then
+ Set_Result (Unknown);
+
+ -- If no indication found, set default
+
+ else
+ Set_Result (Default);
+ end if;
+
+ -- Return worst result found
+
+ return Result;
+ end Has_Compatible_Alignment_Internal;
+
+ -- Start of processing for Has_Compatible_Alignment
+
+ begin
+ -- If Obj has no specified alignment, then set alignment from the type
+ -- alignment. Perhaps we should always do this, but for sure we should
+ -- do it when there is an address clause since we can do more if the
+ -- alignment is known.
+
+ if Unknown_Alignment (Obj) then
+ Set_Alignment (Obj, Alignment (Etype (Obj)));
+ end if;
- begin
- while Is_Entity_Name (R)
- and then Present (Renamed_Object (Entity (R)))
- loop
- R := Renamed_Object (Entity (R));
- end loop;
+ -- Now do the internal call that does all the work
- return R;
- end Get_Referenced_Object;
+ return Has_Compatible_Alignment_Internal (Obj, Expr, Unknown);
+ end Has_Compatible_Alignment;
- -------------------------
- -- Get_Subprogram_Body --
- -------------------------
+ ----------------------
+ -- Has_Declarations --
+ ----------------------
- function Get_Subprogram_Body (E : Entity_Id) return Node_Id is
- Decl : Node_Id;
+ function Has_Declarations (N : Node_Id) return Boolean is
+ K : constant Node_Kind := Nkind (N);
+ begin
+ return K = N_Accept_Statement
+ or else K = N_Block_Statement
+ or else K = N_Compilation_Unit_Aux
+ or else K = N_Entry_Body
+ or else K = N_Package_Body
+ or else K = N_Protected_Body
+ or else K = N_Subprogram_Body
+ or else K = N_Task_Body
+ or else K = N_Package_Specification;
+ end Has_Declarations;
+
+ -------------------------------------------
+ -- Has_Discriminant_Dependent_Constraint --
+ -------------------------------------------
+
+ function Has_Discriminant_Dependent_Constraint
+ (Comp : Entity_Id) return Boolean
+ is
+ Comp_Decl : constant Node_Id := Parent (Comp);
+ Subt_Indic : constant Node_Id :=
+ Subtype_Indication (Component_Definition (Comp_Decl));
+ Constr : Node_Id;
+ Assn : Node_Id;
begin
- Decl := Unit_Declaration_Node (E);
+ if Nkind (Subt_Indic) = N_Subtype_Indication then
+ Constr := Constraint (Subt_Indic);
+
+ if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
+ Assn := First (Constraints (Constr));
+ while Present (Assn) loop
+ case Nkind (Assn) is
+ when N_Subtype_Indication |
+ N_Range |
+ N_Identifier
+ =>
+ if Depends_On_Discriminant (Assn) then
+ return True;
+ end if;
- if Nkind (Decl) = N_Subprogram_Body then
- return Decl;
+ when N_Discriminant_Association =>
+ if Depends_On_Discriminant (Expression (Assn)) then
+ return True;
+ end if;
- else -- Nkind (Decl) = N_Subprogram_Declaration
+ when others =>
+ null;
- if Present (Corresponding_Body (Decl)) then
- return Unit_Declaration_Node (Corresponding_Body (Decl));
+ end case;
- else -- imported subprogram.
- return Empty;
+ Next (Assn);
+ end loop;
end if;
end if;
- end Get_Subprogram_Body;
-
- -----------------------------
- -- Get_Task_Body_Procedure --
- -----------------------------
- function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
- begin
- return Task_Body_Procedure (Declaration_Node (Root_Type (E)));
- end Get_Task_Body_Procedure;
+ return False;
+ end Has_Discriminant_Dependent_Constraint;
--------------------
-- Has_Infinities --
end Has_Infinities;
------------------------
+ -- Has_Null_Exclusion --
+ ------------------------
+
+ function Has_Null_Exclusion (N : Node_Id) return Boolean is
+ begin
+ case Nkind (N) is
+ when N_Access_Definition |
+ N_Access_Function_Definition |
+ N_Access_Procedure_Definition |
+ N_Access_To_Object_Definition |
+ N_Allocator |
+ N_Derived_Type_Definition |
+ N_Function_Specification |
+ N_Subtype_Declaration =>
+ return Null_Exclusion_Present (N);
+
+ when N_Component_Definition |
+ N_Formal_Object_Declaration |
+ N_Object_Renaming_Declaration =>
+ if Present (Subtype_Mark (N)) then
+ return Null_Exclusion_Present (N);
+ else pragma Assert (Present (Access_Definition (N)));
+ return Null_Exclusion_Present (Access_Definition (N));
+ end if;
+
+ when N_Discriminant_Specification =>
+ if Nkind (Discriminant_Type (N)) = N_Access_Definition then
+ return Null_Exclusion_Present (Discriminant_Type (N));
+ else
+ return Null_Exclusion_Present (N);
+ end if;
+
+ when N_Object_Declaration =>
+ if Nkind (Object_Definition (N)) = N_Access_Definition then
+ return Null_Exclusion_Present (Object_Definition (N));
+ else
+ return Null_Exclusion_Present (N);
+ end if;
+
+ when N_Parameter_Specification =>
+ if Nkind (Parameter_Type (N)) = N_Access_Definition then
+ return Null_Exclusion_Present (Parameter_Type (N));
+ else
+ return Null_Exclusion_Present (N);
+ end if;
+
+ when others =>
+ return False;
+
+ end case;
+ end Has_Null_Exclusion;
+
+ ------------------------
-- Has_Null_Extension --
------------------------
end if;
end Has_Null_Extension;
+ --------------------------------------
+ -- Has_Preelaborable_Initialization --
+ --------------------------------------
+
+ function Has_Preelaborable_Initialization (E : Entity_Id) return Boolean is
+ Has_PE : Boolean;
+
+ procedure Check_Components (E : Entity_Id);
+ -- Check component/discriminant chain, sets Has_PE False if a component
+ -- or discriminant does not meet the preelaborable initialization rules.
+
+ ----------------------
+ -- Check_Components --
+ ----------------------
+
+ procedure Check_Components (E : Entity_Id) is
+ Ent : Entity_Id;
+ Exp : Node_Id;
+
+ begin
+ -- Loop through entities of record or protected type
+
+ Ent := E;
+ while Present (Ent) loop
+
+ -- We are interested only in components and discriminants
+
+ if Ekind (Ent) = E_Component
+ or else
+ Ekind (Ent) = E_Discriminant
+ then
+ -- Get default expression if any. If there is no declaration
+ -- node, it means we have an internal entity. The parent and
+ -- tag fields are examples of such entitires. For these
+ -- cases, we just test the type of the entity.
+
+ if Present (Declaration_Node (Ent)) then
+ Exp := Expression (Declaration_Node (Ent));
+ else
+ Exp := Empty;
+ end if;
+
+ -- A component has PI if it has no default expression and
+ -- the component type has PI.
+
+ if No (Exp) then
+ if not Has_Preelaborable_Initialization (Etype (Ent)) then
+ Has_PE := False;
+ exit;
+ end if;
+
+ -- Or if expression obeys rules for preelaboration. For
+ -- now we approximate this by testing if the default
+ -- expression is a static expression or if it is an
+ -- access attribute reference, or the literal null.
+
+ -- This is an approximation, it is probably incomplete???
+
+ elsif Is_Static_Expression (Exp) then
+ null;
+
+ elsif Nkind (Exp) = N_Attribute_Reference
+ and then (Attribute_Name (Exp) = Name_Access
+ or else
+ Attribute_Name (Exp) = Name_Unchecked_Access
+ or else
+ Attribute_Name (Exp) = Name_Unrestricted_Access)
+ then
+ null;
+
+ elsif Nkind (Exp) = N_Null then
+ null;
+
+ else
+ Has_PE := False;
+ exit;
+ end if;
+ end if;
+
+ Next_Entity (Ent);
+ end loop;
+ end Check_Components;
+
+ -- Start of processing for Has_Preelaborable_Initialization
+
+ begin
+ -- Immediate return if already marked as known preelaborable init. This
+ -- covers types for which this function has already been called once
+ -- and returned True (in which case the result is cached), and also
+ -- types to which a pragma Preelaborable_Initialization applies.
+
+ if Known_To_Have_Preelab_Init (E) then
+ return True;
+ end if;
+
+ -- Other private types never have preelaborable initialization
+
+ if Is_Private_Type (E) then
+ return False;
+ end if;
+
+ -- Here for all non-private view
+
+ -- All elementary types have preelaborable initialization
+
+ if Is_Elementary_Type (E) then
+ Has_PE := True;
+
+ -- Array types have PI if the component type has PI
+
+ elsif Is_Array_Type (E) then
+ Has_PE := Has_Preelaborable_Initialization (Component_Type (E));
+
+ -- A derived type has preelaborable initialization if its parent type
+ -- has preelaborable initialization and (in the case of a derived record
+ -- extension) if the non-inherited components all have preelaborable
+ -- initialization. However, a user-defined controlled type with an
+ -- overriding Initialize procedure does not have preelaborable
+ -- initialization.
+
+ elsif Is_Derived_Type (E) then
+
+ -- First check whether ancestor type has preelaborable initialization
+
+ Has_PE := Has_Preelaborable_Initialization (Etype (Base_Type (E)));
+
+ -- If OK, check extension components (if any)
+
+ if Has_PE and then Is_Record_Type (E) then
+ Check_Components (First_Entity (E));
+ end if;
+
+ -- Check specifically for 10.2.1(11.4/2) exception: a controlled type
+ -- with a user defined Initialize procedure does not have PI.
+
+ if Has_PE
+ and then Is_Controlled (E)
+ and then Present (Primitive_Operations (E))
+ then
+ declare
+ P : Elmt_Id;
+
+ begin
+ P := First_Elmt (Primitive_Operations (E));
+ while Present (P) loop
+ if Chars (Node (P)) = Name_Initialize
+ and then Comes_From_Source (Node (P))
+ then
+ Has_PE := False;
+ exit;
+ end if;
+
+ Next_Elmt (P);
+ end loop;
+ end;
+ end if;
+
+ -- Record type has PI if it is non private and all components have PI
+
+ elsif Is_Record_Type (E) then
+ Has_PE := True;
+ Check_Components (First_Entity (E));
+
+ -- Protected types must not have entries, and components must meet
+ -- same set of rules as for record components.
+
+ elsif Is_Protected_Type (E) then
+ if Has_Entries (E) then
+ Has_PE := False;
+ else
+ Has_PE := True;
+ Check_Components (First_Entity (E));
+ Check_Components (First_Private_Entity (E));
+ end if;
+
+ -- Type System.Address always has preelaborable initialization
+
+ elsif Is_RTE (E, RE_Address) then
+ Has_PE := True;
+
+ -- In all other cases, type does not have preelaborable initialization
+
+ else
+ return False;
+ end if;
+
+ -- If type has preelaborable initialization, cache result
+
+ if Has_PE then
+ Set_Known_To_Have_Preelab_Init (E);
+ end if;
+
+ return Has_PE;
+ end Has_Preelaborable_Initialization;
+
---------------------------
-- Has_Private_Component --
---------------------------
Component := First_Component (Btype);
while Present (Component) loop
-
if Has_Private_Component (Etype (Component)) then
return True;
end if;
end if;
end Has_Private_Component;
+ ----------------
+ -- Has_Stream --
+ ----------------
+
+ function Has_Stream (T : Entity_Id) return Boolean is
+ E : Entity_Id;
+
+ begin
+ if No (T) then
+ return False;
+
+ elsif Is_RTE (Root_Type (T), RE_Root_Stream_Type) then
+ return True;
+
+ elsif Is_Array_Type (T) then
+ return Has_Stream (Component_Type (T));
+
+ elsif Is_Record_Type (T) then
+ E := First_Component (T);
+ while Present (E) loop
+ if Has_Stream (Etype (E)) then
+ return True;
+ else
+ Next_Component (E);
+ end if;
+ end loop;
+
+ return False;
+
+ elsif Is_Private_Type (T) then
+ return Has_Stream (Underlying_Type (T));
+
+ else
+ return False;
+ end if;
+ end Has_Stream;
+
--------------------------
-- Has_Tagged_Component --
--------------------------
elsif Is_Record_Type (Typ) then
Comp := First_Component (Typ);
-
while Present (Comp) loop
if Has_Tagged_Component (Etype (Comp)) then
return True;
-----------------
function In_Instance return Boolean is
- S : Entity_Id := Current_Scope;
+ Curr_Unit : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
+ S : Entity_Id;
begin
+ S := Current_Scope;
while Present (S)
and then S /= Standard_Standard
loop
or else Ekind (S) = E_Procedure)
and then Is_Generic_Instance (S)
then
- return True;
+
+ -- A child instance is always compiled in the context of a parent
+ -- instance. Nevertheless, the actuals are not analyzed in an
+ -- instance context. We detect this case by examining the current
+ -- compilation unit, which must be a child instance, and checking
+ -- that it is not currently on the scope stack.
+
+ if Is_Child_Unit (Curr_Unit)
+ and then
+ Nkind (Unit (Cunit (Current_Sem_Unit)))
+ = N_Package_Instantiation
+ and then not In_Open_Scopes (Curr_Unit)
+ then
+ return False;
+ else
+ return True;
+ end if;
end if;
S := Scope (S);
----------------------
function In_Instance_Body return Boolean is
- S : Entity_Id := Current_Scope;
+ S : Entity_Id;
begin
+ S := Current_Scope;
while Present (S)
and then S /= Standard_Standard
loop
-----------------------------
function In_Instance_Not_Visible return Boolean is
- S : Entity_Id := Current_Scope;
+ S : Entity_Id;
begin
+ S := Current_Scope;
while Present (S)
and then S /= Standard_Standard
loop
------------------------------
function In_Instance_Visible_Part return Boolean is
- S : Entity_Id := Current_Scope;
+ S : Entity_Id;
begin
+ S := Current_Scope;
while Present (S)
and then S /= Standard_Standard
loop
----------------------
function In_Package_Body return Boolean is
- S : Entity_Id := Current_Scope;
+ S : Entity_Id;
begin
+ S := Current_Scope;
while Present (S)
and then S /= Standard_Standard
loop
function In_Visible_Part (Scope_Id : Entity_Id) return Boolean is
begin
return
- Is_Package (Scope_Id)
+ Is_Package_Or_Generic_Package (Scope_Id)
and then In_Open_Scopes (Scope_Id)
and then not In_Package_Body (Scope_Id)
and then not In_Private_Part (Scope_Id);
procedure Insert_Explicit_Dereference (N : Node_Id) is
New_Prefix : constant Node_Id := Relocate_Node (N);
+ Ent : Entity_Id := Empty;
+ Pref : Node_Id;
I : Interp_Index;
It : Interp;
T : Entity_Id;
-- designated types of the interpretations of the original node.
Set_Etype (N, Any_Type);
- Get_First_Interp (New_Prefix, I, It);
+ Get_First_Interp (New_Prefix, I, It);
while Present (It.Nam) loop
T := It.Typ;
end loop;
End_Interp_List;
+
+ else
+ -- Prefix is unambiguous: mark the original prefix (which might
+ -- Come_From_Source) as a reference, since the new (relocated) one
+ -- won't be taken into account.
+
+ if Is_Entity_Name (New_Prefix) then
+ Ent := Entity (New_Prefix);
+
+ -- For a retrieval of a subcomponent of some composite object,
+ -- retrieve the ultimate entity if there is one.
+
+ elsif Nkind (New_Prefix) = N_Selected_Component
+ or else Nkind (New_Prefix) = N_Indexed_Component
+ then
+ Pref := Prefix (New_Prefix);
+ while Present (Pref)
+ and then
+ (Nkind (Pref) = N_Selected_Component
+ or else Nkind (Pref) = N_Indexed_Component)
+ loop
+ Pref := Prefix (Pref);
+ end loop;
+
+ if Present (Pref) and then Is_Entity_Name (Pref) then
+ Ent := Entity (Pref);
+ end if;
+ end if;
+
+ if Present (Ent) then
+ Generate_Reference (Ent, New_Prefix);
+ end if;
end if;
end Insert_Explicit_Dereference;
begin
if Is_Entity_Name (Obj) then
- -- Shouldn't we check that we really have an object here?
- -- If we do, then a-caldel.adb blows up mysteriously ???
-
E := Entity (Obj);
- return Is_Aliased (E)
- or else (Present (Renamed_Object (E))
- and then Is_Aliased_View (Renamed_Object (E)))
+ return
+ (Is_Object (E)
+ and then
+ (Is_Aliased (E)
+ or else (Present (Renamed_Object (E))
+ and then Is_Aliased_View (Renamed_Object (E)))))
or else ((Is_Formal (E)
or else Ekind (E) = E_Generic_In_Out_Parameter
or else Ekind (E) = E_Generic_In_Parameter)
and then Is_Tagged_Type (Etype (E)))
- or else ((Ekind (E) = E_Task_Type or else
- Ekind (E) = E_Protected_Type)
- and then In_Open_Scopes (E))
+ or else (Is_Concurrent_Type (E)
+ and then In_Open_Scopes (E))
- -- Current instance of type
+ -- Current instance of type, either directly or as rewritten
+ -- reference to the current object.
+
+ or else (Is_Entity_Name (Original_Node (Obj))
+ and then Present (Entity (Original_Node (Obj)))
+ and then Is_Type (Entity (Original_Node (Obj))))
or else (Is_Type (E) and then E = Current_Scope)
+
or else (Is_Incomplete_Or_Private_Type (E)
and then Full_View (E) = Current_Scope);
end if;
end Is_Aliased_View;
+ -------------------------
+ -- Is_Ancestor_Package --
+ -------------------------
+
+ function Is_Ancestor_Package
+ (E1 : Entity_Id;
+ E2 : Entity_Id) return Boolean
+ is
+ Par : Entity_Id;
+
+ begin
+ Par := E2;
+ while Present (Par)
+ and then Par /= Standard_Standard
+ loop
+ if Par = E1 then
+ return True;
+ end if;
+
+ Par := Scope (Par);
+ end loop;
+
+ return False;
+ end Is_Ancestor_Package;
+
----------------------
-- Is_Atomic_Object --
----------------------
-- Determines if given object has atomic components
function Is_Atomic_Prefix (N : Node_Id) return Boolean;
- -- If prefix is an implicit dereference, examine designated type.
+ -- If prefix is an implicit dereference, examine designated type
function Is_Atomic_Prefix (N : Node_Id) return Boolean is
begin
else
return False;
end if;
- end Is_Atomic_Object;
+ end Is_Atomic_Object;
+
+ -------------------------
+ -- Is_Coextension_Root --
+ -------------------------
+
+ function Is_Coextension_Root (N : Node_Id) return Boolean is
+ begin
+ return
+ Nkind (N) = N_Allocator
+ and then Present (Coextensions (N))
+
+ -- Anonymous access discriminants carry a list of all nested
+ -- controlled coextensions.
+
+ and then not Is_Dynamic_Coextension (N)
+ and then not Is_Static_Coextension (N);
+ end Is_Coextension_Root;
+
+ --------------------------------------
+ -- Is_Controlling_Limited_Procedure --
+ --------------------------------------
+
+ function Is_Controlling_Limited_Procedure
+ (Proc_Nam : Entity_Id) return Boolean
+ is
+ Param_Typ : Entity_Id := Empty;
+
+ begin
+ if Ekind (Proc_Nam) = E_Procedure
+ and then Present (Parameter_Specifications (Parent (Proc_Nam)))
+ then
+ Param_Typ := Etype (Parameter_Type (First (
+ Parameter_Specifications (Parent (Proc_Nam)))));
+
+ -- In this case where an Itype was created, the procedure call has been
+ -- rewritten.
+
+ elsif Present (Associated_Node_For_Itype (Proc_Nam))
+ and then Present (Original_Node (Associated_Node_For_Itype (Proc_Nam)))
+ and then
+ Present (Parameter_Associations
+ (Associated_Node_For_Itype (Proc_Nam)))
+ then
+ Param_Typ :=
+ Etype (First (Parameter_Associations
+ (Associated_Node_For_Itype (Proc_Nam))));
+ end if;
+
+ if Present (Param_Typ) then
+ return
+ Is_Interface (Param_Typ)
+ and then Is_Limited_Record (Param_Typ);
+ end if;
+
+ return False;
+ end Is_Controlling_Limited_Procedure;
----------------------------------------------
-- Is_Dependent_Component_Of_Mutable_Object --
P_Aliased : Boolean := False;
Comp : Entity_Id;
- function Has_Dependent_Constraint (Comp : Entity_Id) return Boolean;
- -- Returns True if and only if Comp has a constrained subtype
- -- that depends on a discriminant.
-
function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean;
- -- Returns True if and only if Comp is declared within a variant part.
-
- ------------------------------
- -- Has_Dependent_Constraint --
- ------------------------------
-
- function Has_Dependent_Constraint (Comp : Entity_Id) return Boolean is
- Comp_Decl : constant Node_Id := Parent (Comp);
- Subt_Indic : constant Node_Id := Subtype_Indication (Comp_Decl);
- Constr : Node_Id;
- Assn : Node_Id;
-
- begin
- if Nkind (Subt_Indic) = N_Subtype_Indication then
- Constr := Constraint (Subt_Indic);
-
- if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
- Assn := First (Constraints (Constr));
- while Present (Assn) loop
- case Nkind (Assn) is
- when N_Subtype_Indication |
- N_Range |
- N_Identifier
- =>
- if Depends_On_Discriminant (Assn) then
- return True;
- end if;
-
- when N_Discriminant_Association =>
- if Depends_On_Discriminant (Expression (Assn)) then
- return True;
- end if;
-
- when others =>
- null;
-
- end case;
-
- Next (Assn);
- end loop;
- end if;
- end if;
-
- return False;
- end Has_Dependent_Constraint;
+ -- Returns True if and only if Comp is declared within a variant part
--------------------------------
-- Is_Declared_Within_Variant --
function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean is
Comp_Decl : constant Node_Id := Parent (Comp);
Comp_List : constant Node_Id := Parent (Comp_Decl);
-
begin
return Nkind (Parent (Comp_List)) = N_Variant;
end Is_Declared_Within_Variant;
P_Aliased := True;
end if;
+ -- A discriminant check on a selected component may be
+ -- expanded into a dereference when removing side-effects.
+ -- Recover the original node and its type, which may be
+ -- unconstrained.
+
+ elsif Nkind (P) = N_Explicit_Dereference
+ and then not (Comes_From_Source (P))
+ then
+ P := Original_Node (P);
+ Prefix_Type := Etype (P);
+
else
-- Check for prefix being an aliased component ???
null;
+
end if;
- if Is_Access_Type (Prefix_Type)
- or else Nkind (P) = N_Explicit_Dereference
- then
- return False;
+ -- A heap object is constrained by its initial value
+
+ -- Ada 2005 (AI-363): Always assume the object could be mutable in
+ -- the dereferenced case, since the access value might denote an
+ -- unconstrained aliased object, whereas in Ada 95 the designated
+ -- object is guaranteed to be constrained. A worst-case assumption
+ -- has to apply in Ada 2005 because we can't tell at compile time
+ -- whether the object is "constrained by its initial value"
+ -- (despite the fact that 3.10.2(26/2) and 8.5.1(5/2) are
+ -- semantic rules -- these rules are acknowledged to need fixing).
+
+ if Ada_Version < Ada_05 then
+ if Is_Access_Type (Prefix_Type)
+ or else Nkind (P) = N_Explicit_Dereference
+ then
+ return False;
+ end if;
+
+ elsif Ada_Version >= Ada_05 then
+ if Is_Access_Type (Prefix_Type) then
+ Prefix_Type := Designated_Type (Prefix_Type);
+ end if;
end if;
Comp :=
-- As per AI-0017, the renaming is illegal in a generic body,
-- even if the subtype is indefinite.
+ -- Ada 2005 (AI-363): In Ada 2005 an aliased object can be mutable
+
if not Is_Constrained (Prefix_Type)
and then (not Is_Indefinite_Subtype (Prefix_Type)
or else
and then In_Package_Body (Current_Scope)))
and then (Is_Declared_Within_Variant (Comp)
- or else Has_Dependent_Constraint (Comp))
- and then not P_Aliased
+ or else Has_Discriminant_Dependent_Constraint (Comp))
+ and then (not P_Aliased or else Ada_Version >= Ada_05)
then
return True;
or else Nkind (Object) = N_Slice
then
return Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
+
+ -- A type conversion that Is_Variable is a view conversion:
+ -- go back to the denoted object.
+
+ elsif Nkind (Object) = N_Type_Conversion then
+ return
+ Is_Dependent_Component_Of_Mutable_Object (Expression (Object));
end if;
end if;
function Is_Dereferenced (N : Node_Id) return Boolean is
P : constant Node_Id := Parent (N);
-
begin
return
(Nkind (P) = N_Selected_Component
and then Prefix (P) = N;
end Is_Dereferenced;
+ ----------------------
+ -- Is_Descendent_Of --
+ ----------------------
+
+ function Is_Descendent_Of (T1 : Entity_Id; T2 : Entity_Id) return Boolean is
+ T : Entity_Id;
+ Etyp : Entity_Id;
+
+ begin
+ pragma Assert (Nkind (T1) in N_Entity);
+ pragma Assert (Nkind (T2) in N_Entity);
+
+ T := Base_Type (T1);
+
+ -- Immediate return if the types match
+
+ if T = T2 then
+ return True;
+
+ -- Comment needed here ???
+
+ elsif Ekind (T) = E_Class_Wide_Type then
+ return Etype (T) = T2;
+
+ -- All other cases
+
+ else
+ loop
+ Etyp := Etype (T);
+
+ -- Done if we found the type we are looking for
+
+ if Etyp = T2 then
+ return True;
+
+ -- Done if no more derivations to check
+
+ elsif T = T1
+ or else T = Etyp
+ then
+ return False;
+
+ -- Following test catches error cases resulting from prev errors
+
+ elsif No (Etyp) then
+ return False;
+
+ elsif Is_Private_Type (T) and then Etyp = Full_View (T) then
+ return False;
+
+ elsif Is_Private_Type (Etyp) and then Full_View (Etyp) = T then
+ return False;
+ end if;
+
+ T := Base_Type (Etyp);
+ end loop;
+ end if;
+
+ raise Program_Error;
+ end Is_Descendent_Of;
+
+ ------------------------------
+ -- Is_Descendent_Of_Address --
+ ------------------------------
+
+ function Is_Descendent_Of_Address (T1 : Entity_Id) return Boolean is
+ begin
+ -- If Address has not been loaded, answer must be False
+
+ if not RTU_Loaded (System) then
+ return False;
+
+ -- Otherwise we can get the entity we are interested in without
+ -- causing an unwanted dependency on System, and do the test.
+
+ else
+ return Is_Descendent_Of (T1, Base_Type (RTE (RE_Address)));
+ end if;
+ end Is_Descendent_Of_Address;
+
--------------
-- Is_False --
--------------
S : constant Ureal := Small_Value (T);
M : Urealp.Save_Mark;
R : Boolean;
-
begin
M := Urealp.Mark;
R := (U = UR_Trunc (U / S) * S);
begin
Indx := First_Index (Typ);
while Present (Indx) loop
-
if Etype (Indx) = Any_Type then
return False;
- -- If index is a range, use directly.
+ -- If index is a range, use directly
elsif Nkind (Indx) = N_Range then
Lbd := Low_Bound (Indx);
Indx_Typ := Full_View (Indx_Typ);
end if;
- if No (Indx_Typ) then
+ if No (Indx_Typ) or else Etype (Indx_Typ) = Any_Type then
return False;
else
Lbd := Type_Low_Bound (Indx_Typ);
begin
Ent := First_Entity (Typ);
-
while Present (Ent) loop
if Chars (Ent) = Name_uController then
null;
and then (No (Parent (Ent))
or else No (Expression (Parent (Ent))))
and then not Is_Fully_Initialized_Type (Etype (Ent))
+
+ -- Special VM case for uTag component, which needs to be
+ -- defined in this case, but is never initialized as VMs
+ -- are using other dispatching mechanisms. Ignore this
+ -- uninitialized case.
+
+ and then (VM_Target = No_VM
+ or else Chars (Ent) /= Name_uTag)
then
return False;
end if;
function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean is
Loc : constant Source_Ptr := Sloc (Typ);
+ Constraints : constant List_Id := New_List;
+ Components : constant Elist_Id := New_Elmt_List;
Comp_Elmt : Elmt_Id;
Comp_Id : Node_Id;
Comp_List : Node_Id;
Discr : Entity_Id;
Discr_Val : Node_Id;
- Constraints : List_Id := New_List;
- Components : Elist_Id := New_Elmt_List;
Report_Errors : Boolean;
begin
and then Nkind (Type_Definition (Parent (Typ))) = N_Record_Definition
then
Comp_List := Component_List (Type_Definition (Parent (Typ)));
- Discr := First_Discriminant (Typ);
+ Discr := First_Discriminant (Typ);
while Present (Discr) loop
if Nkind (Parent (Discr)) = N_Discriminant_Specification then
Discr_Val := Expression (Parent (Discr));
- if not Is_OK_Static_Expression (Discr_Val) then
- return False;
- else
+
+ if Present (Discr_Val)
+ and then Is_OK_Static_Expression (Discr_Val)
+ then
Append_To (Constraints,
Make_Component_Association (Loc,
Choices => New_List (New_Occurrence_Of (Discr, Loc)),
Expression => New_Copy (Discr_Val)));
-
+ else
+ return False;
end if;
else
return False;
Into => Components,
Report_Errors => Report_Errors);
- -- Check that each component present is fully initialized.
+ -- Check that each component present is fully initialized
Comp_Elmt := First_Elmt (Components);
-
while Present (Comp_Elmt) loop
Comp_Id := Node (Comp_Elmt);
function Is_Inherited_Operation (E : Entity_Id) return Boolean is
Kind : constant Node_Kind := Nkind (Parent (E));
-
begin
pragma Assert (Is_Overloadable (E));
return Kind = N_Full_Type_Declaration
function Is_Library_Level_Entity (E : Entity_Id) return Boolean is
begin
- -- The following is a small optimization, and it also handles
- -- properly discriminals, which in task bodies might appear in
- -- expressions before the corresponding procedure has been
- -- created, and which therefore do not have an assigned scope.
+ -- The following is a small optimization, and it also properly handles
+ -- discriminals, which in task bodies might appear in expressions before
+ -- the corresponding procedure has been created, and which therefore do
+ -- not have an assigned scope.
if Ekind (E) in Formal_Kind then
return False;
declare
Ent : constant Entity_Id := Entity (Expr);
Sub : constant Entity_Id := Enclosing_Subprogram (Ent);
-
begin
if Ekind (Ent) /= E_Variable
and then
Ekind (Ent) /= E_In_Out_Parameter
then
return False;
-
else
return Present (Sub) and then Sub = Current_Subprogram;
end if;
end if;
end Is_Local_Variable_Reference;
- ---------------
- -- Is_Lvalue --
- ---------------
-
- function Is_Lvalue (N : Node_Id) return Boolean is
- P : constant Node_Id := Parent (N);
-
- begin
- case Nkind (P) is
-
- -- Test left side of assignment
-
- when N_Assignment_Statement =>
- return N = Name (P);
-
- -- Test prefix of component or attribute
-
- when N_Attribute_Reference |
- N_Expanded_Name |
- N_Explicit_Dereference |
- N_Indexed_Component |
- N_Reference |
- N_Selected_Component |
- N_Slice =>
- return N = Prefix (P);
-
- -- Test subprogram parameter (we really should check the
- -- parameter mode, but it is not worth the trouble)
-
- when N_Function_Call |
- N_Procedure_Call_Statement |
- N_Accept_Statement |
- N_Parameter_Association =>
- return True;
-
- -- Test for appearing in a conversion that itself appears
- -- in an lvalue context, since this should be an lvalue.
-
- when N_Type_Conversion =>
- return Is_Lvalue (P);
-
- -- Test for appearence in object renaming declaration
-
- when N_Object_Renaming_Declaration =>
- return True;
-
- -- All other references are definitely not Lvalues
-
- when others =>
- return False;
-
- end case;
- end Is_Lvalue;
-
-------------------------
-- Is_Object_Reference --
-------------------------
function Is_Object_Reference (N : Node_Id) return Boolean is
begin
if Is_Entity_Name (N) then
- return Is_Object (Entity (N));
+ return Present (Entity (N)) and then Is_Object (Entity (N));
else
case Nkind (N) is
when N_Indexed_Component | N_Slice =>
- return Is_Object_Reference (Prefix (N));
+ return
+ Is_Object_Reference (Prefix (N))
+ or else Is_Access_Type (Etype (Prefix (N)));
- -- In Ada95, a function call is a constant object
+ -- In Ada95, a function call is a constant object; a procedure
+ -- call is not.
when N_Function_Call =>
- return True;
+ return Etype (N) /= Standard_Void_Type;
-- A reference to the stream attribute Input is a function call
return Attribute_Name (N) = Name_Input;
when N_Selected_Component =>
- return Is_Object_Reference (Selector_Name (N));
+ return
+ Is_Object_Reference (Selector_Name (N))
+ and then
+ (Is_Object_Reference (Prefix (N))
+ or else Is_Access_Type (Etype (Prefix (N))));
when N_Explicit_Dereference =>
return True;
+ -- A view conversion of a tagged object is an object reference
+
+ when N_Type_Conversion =>
+ return Is_Tagged_Type (Etype (Subtype_Mark (N)))
+ and then Is_Tagged_Type (Etype (Expression (N)))
+ and then Is_Object_Reference (Expression (N));
+
-- An unchecked type conversion is considered to be an object if
-- the operand is an object (this construction arises only as a
-- result of expansion activities).
return True;
-- Unchecked conversions are allowed only if they come from the
- -- generated code, which sometimes uses unchecked conversions for
- -- out parameters in cases where code generation is unaffected.
- -- We tell source unchecked conversions by seeing if they are
- -- rewrites of an original UC function call, or of an explicit
+ -- generated code, which sometimes uses unchecked conversions for out
+ -- parameters in cases where code generation is unaffected. We tell
+ -- source unchecked conversions by seeing if they are rewrites of an
+ -- original Unchecked_Conversion function call, or of an explicit
-- conversion of a function call.
elsif Nkind (AV) = N_Unchecked_Type_Conversion then
then
return False;
+ elsif Nkind (Original_Node (AV)) = N_Type_Conversion then
+ return Is_OK_Variable_For_Out_Formal (Expression (AV));
+
else
return True;
end if;
end if;
end Is_OK_Variable_For_Out_Formal;
+ ---------------
+ -- Is_Parent --
+ ---------------
+
+ function Is_Parent
+ (E1 : Entity_Id;
+ E2 : Entity_Id) return Boolean
+ is
+ Iface_List : List_Id;
+ T : Entity_Id := E2;
+
+ begin
+ if Is_Concurrent_Type (T)
+ or else Is_Concurrent_Record_Type (T)
+ then
+ Iface_List := Abstract_Interface_List (E2);
+
+ if Is_Empty_List (Iface_List) then
+ return False;
+ end if;
+
+ T := Etype (First (Iface_List));
+ end if;
+
+ return Is_Ancestor (E1, T);
+ end Is_Parent;
+
-----------------------------------
-- Is_Partially_Initialized_Type --
-----------------------------------
elsif Is_Private_Type (Typ) then
declare
U : constant Entity_Id := Underlying_Type (Typ);
-
begin
if No (U) then
return True;
end if;
end Is_Partially_Initialized_Type;
+ ------------------------------------
+ -- Is_Potentially_Persistent_Type --
+ ------------------------------------
+
+ function Is_Potentially_Persistent_Type (T : Entity_Id) return Boolean is
+ Comp : Entity_Id;
+ Indx : Node_Id;
+
+ begin
+ -- For private type, test corrresponding full type
+
+ if Is_Private_Type (T) then
+ return Is_Potentially_Persistent_Type (Full_View (T));
+
+ -- Scalar types are potentially persistent
+
+ elsif Is_Scalar_Type (T) then
+ return True;
+
+ -- Record type is potentially persistent if not tagged and the types of
+ -- all it components are potentially persistent, and no component has
+ -- an initialization expression.
+
+ elsif Is_Record_Type (T)
+ and then not Is_Tagged_Type (T)
+ and then not Is_Partially_Initialized_Type (T)
+ then
+ Comp := First_Component (T);
+ while Present (Comp) loop
+ if not Is_Potentially_Persistent_Type (Etype (Comp)) then
+ return False;
+ else
+ Next_Entity (Comp);
+ end if;
+ end loop;
+
+ return True;
+
+ -- Array type is potentially persistent if its component type is
+ -- potentially persistent and if all its constraints are static.
+
+ elsif Is_Array_Type (T) then
+ if not Is_Potentially_Persistent_Type (Component_Type (T)) then
+ return False;
+ end if;
+
+ Indx := First_Index (T);
+ while Present (Indx) loop
+ if not Is_OK_Static_Subtype (Etype (Indx)) then
+ return False;
+ else
+ Next_Index (Indx);
+ end if;
+ end loop;
+
+ return True;
+
+ -- All other types are not potentially persistent
+
+ else
+ return False;
+ end if;
+ end Is_Potentially_Persistent_Type;
+
-----------------------------
-- Is_RCI_Pkg_Spec_Or_Body --
-----------------------------
if Nkind (The_Unit) /= N_Package_Declaration then
return False;
end if;
+
return Is_Remote_Call_Interface (Defining_Entity (The_Unit));
end Is_RCI_Pkg_Decl_Cunit;
D : Entity_Id;
function Comes_From_Limited_Private_Type_Declaration
- (E : Entity_Id)
- return Boolean;
+ (E : Entity_Id) return Boolean;
-- Check that the type is declared by a limited type declaration,
-- or else is derived from a Remote_Type ancestor through private
-- extensions.
-- Comes_From_Limited_Private_Type_Declaration --
-------------------------------------------------
- function Comes_From_Limited_Private_Type_Declaration (E : in Entity_Id)
- return Boolean
+ function Comes_From_Limited_Private_Type_Declaration
+ (E : Entity_Id) return Boolean
is
N : constant Node_Id := Declaration_Node (E);
+
begin
if Nkind (N) = N_Private_Type_Declaration
and then Limited_Present (N)
elsif Nkind (Name (N)) = N_Explicit_Dereference
and then Is_Remote_Access_To_Subprogram_Type
- (Etype (Prefix (Name (N))))
+ (Etype (Prefix (Name (N))))
then
-- The dereference of a RAS is a remote call
end Is_Remote_Call;
----------------------
+ -- Is_Renamed_Entry --
+ ----------------------
+
+ function Is_Renamed_Entry (Proc_Nam : Entity_Id) return Boolean is
+ Orig_Node : Node_Id := Empty;
+ Subp_Decl : Node_Id := Parent (Parent (Proc_Nam));
+
+ function Is_Entry (Nam : Node_Id) return Boolean;
+ -- Determine whether Nam is an entry. Traverse selectors
+ -- if there are nested selected components.
+
+ --------------
+ -- Is_Entry --
+ --------------
+
+ function Is_Entry (Nam : Node_Id) return Boolean is
+ begin
+ if Nkind (Nam) = N_Selected_Component then
+ return Is_Entry (Selector_Name (Nam));
+ end if;
+
+ return Ekind (Entity (Nam)) = E_Entry;
+ end Is_Entry;
+
+ -- Start of processing for Is_Renamed_Entry
+
+ begin
+ if Present (Alias (Proc_Nam)) then
+ Subp_Decl := Parent (Parent (Alias (Proc_Nam)));
+ end if;
+
+ -- Look for a rewritten subprogram renaming declaration
+
+ if Nkind (Subp_Decl) = N_Subprogram_Declaration
+ and then Present (Original_Node (Subp_Decl))
+ then
+ Orig_Node := Original_Node (Subp_Decl);
+ end if;
+
+ -- The rewritten subprogram is actually an entry
+
+ if Present (Orig_Node)
+ and then Nkind (Orig_Node) = N_Subprogram_Renaming_Declaration
+ and then Is_Entry (Name (Orig_Node))
+ then
+ return True;
+ end if;
+
+ return False;
+ end Is_Renamed_Entry;
+
+ ----------------------
-- Is_Selector_Name --
----------------------
function Is_Selector_Name (N : Node_Id) return Boolean is
-
begin
if not Is_List_Member (N) then
declare
P : constant Node_Id := Parent (N);
K : constant Node_Kind := Nkind (P);
-
begin
return
(K = N_Expanded_Name or else
declare
L : constant List_Id := List_Containing (N);
P : constant Node_Id := Parent (L);
-
begin
return (Nkind (P) = N_Discriminant_Association
and then Selector_Names (P) = L)
or else Nkind (N) = N_Procedure_Call_Statement;
end Is_Statement;
+ ---------------------------------
+ -- Is_Synchronized_Tagged_Type --
+ ---------------------------------
+
+ function Is_Synchronized_Tagged_Type (E : Entity_Id) return Boolean is
+ Kind : constant Entity_Kind := Ekind (Base_Type (E));
+
+ begin
+ -- A task or protected type derived from an interface is a tagged type.
+ -- Such a tagged type is called a synchronized tagged type, as are
+ -- synchronized interfaces and private extensions whose declaration
+ -- includes the reserved word synchronized.
+
+ return (Is_Tagged_Type (E)
+ and then (Kind = E_Task_Type
+ or else Kind = E_Protected_Type))
+ or else
+ (Is_Interface (E)
+ and then Is_Synchronized_Interface (E))
+ or else
+ (Ekind (E) = E_Record_Type_With_Private
+ and then (Synchronized_Present (Parent (E))
+ or else Is_Synchronized_Interface (Etype (E))));
+ end Is_Synchronized_Tagged_Type;
+
-----------------
-- Is_Transfer --
-----------------
Kind : constant Node_Kind := Nkind (N);
begin
- if Kind = N_Return_Statement
+ if Kind = N_Simple_Return_Statement
+ or else
+ Kind = N_Extended_Return_Statement
or else
Kind = N_Goto_Statement
or else
return (U /= 0);
end Is_True;
+ -------------------
+ -- Is_Value_Type --
+ -------------------
+
+ function Is_Value_Type (T : Entity_Id) return Boolean is
+ begin
+ return VM_Target = CLI_Target
+ and then Chars (T) /= No_Name
+ and then Get_Name_String (Chars (T)) = "valuetype";
+ end Is_Value_Type;
+
-----------------
-- Is_Variable --
-----------------
return False;
else
S := Current_Scope;
-
while Present (S) and then S /= Prot loop
-
if Ekind (S) = E_Function
and then Scope (S) = Prot
then
begin
if Is_Access_Type (Etype (P)) then
return not Is_Access_Constant (Root_Type (Etype (P)));
+
+ -- For the case of an indexed component whose prefix has a packed
+ -- array type, the prefix has been rewritten into a type conversion.
+ -- Determine variable-ness from the converted expression.
+
+ elsif Nkind (P) = N_Type_Conversion
+ and then not Comes_From_Source (P)
+ and then Is_Array_Type (Etype (P))
+ and then Is_Packed (Etype (P))
+ then
+ return Is_Variable (Expression (P));
+
else
return Is_Variable (P);
end if;
-- variable, even though the original node may not be (since it could
-- be a constant of the access type).
+ -- In Ada 2005 we have a further case to consider: the prefix may be
+ -- a function call given in prefix notation. The original node appears
+ -- to be a selected component, but we need to examine the call.
+
elsif Nkind (N) = N_Explicit_Dereference
and then Nkind (Orig_Node) /= N_Explicit_Dereference
+ and then Present (Etype (Orig_Node))
and then Is_Access_Type (Etype (Orig_Node))
then
- return Is_Variable_Prefix (Original_Node (Prefix (N)));
+ return Is_Variable_Prefix (Original_Node (Prefix (N)))
+ or else
+ (Nkind (Orig_Node) = N_Function_Call
+ and then not Is_Access_Constant (Etype (Prefix (N))));
+
+ -- A function call is never a variable
+
+ elsif Nkind (N) = N_Function_Call then
+ return False;
-- All remaining checks use the original node
- elsif Is_Entity_Name (Orig_Node) then
+ elsif Is_Entity_Name (Orig_Node)
+ and then Present (Entity (Orig_Node))
+ then
declare
E : constant Entity_Id := Entity (Orig_Node);
K : constant Entity_Kind := Ekind (E);
when N_Explicit_Dereference =>
declare
Typ : constant Entity_Id := Etype (Prefix (Orig_Node));
-
begin
return Is_Access_Type (Typ)
and then not Is_Access_Constant (Root_Type (Typ))
-- Determines if given object has volatile components
function Is_Volatile_Prefix (N : Node_Id) return Boolean;
- -- If prefix is an implicit dereference, examine designated type.
+ -- If prefix is an implicit dereference, examine designated type
------------------------
-- Is_Volatile_Prefix --
-- Kill_Current_Values --
-------------------------
+ procedure Kill_Current_Values (Ent : Entity_Id) is
+ begin
+ if Is_Object (Ent) then
+ Kill_Checks (Ent);
+ Set_Current_Value (Ent, Empty);
+
+ if Ekind (Ent) = E_Variable then
+ Set_Last_Assignment (Ent, Empty);
+ end if;
+
+ if not Can_Never_Be_Null (Ent) then
+ Set_Is_Known_Non_Null (Ent, False);
+ end if;
+
+ Set_Is_Known_Null (Ent, False);
+ end if;
+ end Kill_Current_Values;
+
procedure Kill_Current_Values is
S : Entity_Id;
procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id);
-- Clear current value for entity E and all entities chained to E
- -------------------------------------------
- -- Kill_Current_Values_For_Entity_Chain --
- -------------------------------------------
+ ------------------------------------------
+ -- Kill_Current_Values_For_Entity_Chain --
+ ------------------------------------------
procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id) is
Ent : Entity_Id;
-
begin
Ent := E;
while Present (Ent) loop
- if Is_Object (Ent) then
- Set_Current_Value (Ent, Empty);
-
- if not Can_Never_Be_Null (Ent) then
- Set_Is_Known_Non_Null (Ent, False);
- end if;
- end if;
-
+ Kill_Current_Values (Ent);
Next_Entity (Ent);
end loop;
end Kill_Current_Values_For_Entity_Chain;
Kill_Current_Values_For_Entity_Chain (First_Private_Entity (S));
end if;
- -- If this is a block or nested package, deal with parent
+ -- If this is a not a subprogram, deal with parents
- if Ekind (S) = E_Block
- or else (Ekind (S) = E_Package
- and then not Is_Library_Level_Entity (S))
- then
+ if not Is_Subprogram (S) then
S := Scope (S);
+ exit Scope_Loop when S = Standard_Standard;
else
exit Scope_Loop;
end if;
end if;
end Kill_Size_Check_Code;
+ --------------------------
+ -- Known_To_Be_Assigned --
+ --------------------------
+
+ function Known_To_Be_Assigned (N : Node_Id) return Boolean is
+ P : constant Node_Id := Parent (N);
+
+ begin
+ case Nkind (P) is
+
+ -- Test left side of assignment
+
+ when N_Assignment_Statement =>
+ return N = Name (P);
+
+ -- Function call arguments are never lvalues
+
+ when N_Function_Call =>
+ return False;
+
+ -- Positional parameter for procedure or accept call
+
+ when N_Procedure_Call_Statement |
+ N_Accept_Statement
+ =>
+ declare
+ Proc : Entity_Id;
+ Form : Entity_Id;
+ Act : Node_Id;
+
+ begin
+ Proc := Get_Subprogram_Entity (P);
+
+ if No (Proc) then
+ return False;
+ end if;
+
+ -- If we are not a list member, something is strange, so
+ -- be conservative and return False.
+
+ if not Is_List_Member (N) then
+ return False;
+ end if;
+
+ -- We are going to find the right formal by stepping forward
+ -- through the formals, as we step backwards in the actuals.
+
+ Form := First_Formal (Proc);
+ Act := N;
+ loop
+ -- If no formal, something is weird, so be conservative
+ -- and return False.
+
+ if No (Form) then
+ return False;
+ end if;
+
+ Prev (Act);
+ exit when No (Act);
+ Next_Formal (Form);
+ end loop;
+
+ return Ekind (Form) /= E_In_Parameter;
+ end;
+
+ -- Named parameter for procedure or accept call
+
+ when N_Parameter_Association =>
+ declare
+ Proc : Entity_Id;
+ Form : Entity_Id;
+
+ begin
+ Proc := Get_Subprogram_Entity (Parent (P));
+
+ if No (Proc) then
+ return False;
+ end if;
+
+ -- Loop through formals to find the one that matches
+
+ Form := First_Formal (Proc);
+ loop
+ -- If no matching formal, that's peculiar, some kind of
+ -- previous error, so return False to be conservative.
+
+ if No (Form) then
+ return False;
+ end if;
+
+ -- Else test for match
+
+ if Chars (Form) = Chars (Selector_Name (P)) then
+ return Ekind (Form) /= E_In_Parameter;
+ end if;
+
+ Next_Formal (Form);
+ end loop;
+ end;
+
+ -- Test for appearing in a conversion that itself appears
+ -- in an lvalue context, since this should be an lvalue.
+
+ when N_Type_Conversion =>
+ return Known_To_Be_Assigned (P);
+
+ -- All other references are definitely not knwon to be modifications
+
+ when others =>
+ return False;
+
+ end case;
+ end Known_To_Be_Assigned;
+
+ -------------------
+ -- May_Be_Lvalue --
+ -------------------
+
+ function May_Be_Lvalue (N : Node_Id) return Boolean is
+ P : constant Node_Id := Parent (N);
+
+ begin
+ case Nkind (P) is
+
+ -- Test left side of assignment
+
+ when N_Assignment_Statement =>
+ return N = Name (P);
+
+ -- Test prefix of component or attribute
+
+ when N_Attribute_Reference =>
+ return N = Prefix (P)
+ and then Name_Implies_Lvalue_Prefix (Attribute_Name (P));
+
+ when N_Expanded_Name |
+ N_Explicit_Dereference |
+ N_Indexed_Component |
+ N_Reference |
+ N_Selected_Component |
+ N_Slice =>
+ return N = Prefix (P);
+
+ -- Function call arguments are never lvalues
+
+ when N_Function_Call =>
+ return False;
+
+ -- Positional parameter for procedure, entry, or accept call
+
+ when N_Procedure_Call_Statement |
+ N_Entry_Call_Statement |
+ N_Accept_Statement
+ =>
+ declare
+ Proc : Entity_Id;
+ Form : Entity_Id;
+ Act : Node_Id;
+
+ begin
+ Proc := Get_Subprogram_Entity (P);
+
+ if No (Proc) then
+ return True;
+ end if;
+
+ -- If we are not a list member, something is strange, so
+ -- be conservative and return True.
+
+ if not Is_List_Member (N) then
+ return True;
+ end if;
+
+ -- We are going to find the right formal by stepping forward
+ -- through the formals, as we step backwards in the actuals.
+
+ Form := First_Formal (Proc);
+ Act := N;
+ loop
+ -- If no formal, something is weird, so be conservative
+ -- and return True.
+
+ if No (Form) then
+ return True;
+ end if;
+
+ Prev (Act);
+ exit when No (Act);
+ Next_Formal (Form);
+ end loop;
+
+ return Ekind (Form) /= E_In_Parameter;
+ end;
+
+ -- Named parameter for procedure or accept call
+
+ when N_Parameter_Association =>
+ declare
+ Proc : Entity_Id;
+ Form : Entity_Id;
+
+ begin
+ Proc := Get_Subprogram_Entity (Parent (P));
+
+ if No (Proc) then
+ return True;
+ end if;
+
+ -- Loop through formals to find the one that matches
+
+ Form := First_Formal (Proc);
+ loop
+ -- If no matching formal, that's peculiar, some kind of
+ -- previous error, so return True to be conservative.
+
+ if No (Form) then
+ return True;
+ end if;
+
+ -- Else test for match
+
+ if Chars (Form) = Chars (Selector_Name (P)) then
+ return Ekind (Form) /= E_In_Parameter;
+ end if;
+
+ Next_Formal (Form);
+ end loop;
+ end;
+
+ -- Test for appearing in a conversion that itself appears
+ -- in an lvalue context, since this should be an lvalue.
+
+ when N_Type_Conversion =>
+ return May_Be_Lvalue (P);
+
+ -- Test for appearence in object renaming declaration
+
+ when N_Object_Renaming_Declaration =>
+ return True;
+
+ -- All other references are definitely not Lvalues
+
+ when others =>
+ return False;
+
+ end case;
+ end May_Be_Lvalue;
+
+ -----------------------
+ -- Mark_Coextensions --
+ -----------------------
+
+ procedure Mark_Coextensions (Context_Nod : Node_Id; Root_Nod : Node_Id) is
+ Is_Dynamic : Boolean := False;
+
+ function Mark_Allocator (N : Node_Id) return Traverse_Result;
+ -- Recognize an allocator node and label it as a dynamic coextension
+
+ --------------------
+ -- Mark_Allocator --
+ --------------------
+
+ function Mark_Allocator (N : Node_Id) return Traverse_Result is
+ begin
+ if Nkind (N) = N_Allocator then
+ if Is_Dynamic then
+ Set_Is_Dynamic_Coextension (N);
+ else
+ Set_Is_Static_Coextension (N);
+ end if;
+ end if;
+
+ return OK;
+ end Mark_Allocator;
+
+ procedure Mark_Allocators is new Traverse_Proc (Mark_Allocator);
+
+ -- Start of processing Mark_Coextensions
+
+ begin
+ case Nkind (Context_Nod) is
+ when N_Assignment_Statement |
+ N_Simple_Return_Statement =>
+ Is_Dynamic := Nkind (Expression (Context_Nod)) = N_Allocator;
+
+ when N_Object_Declaration =>
+ Is_Dynamic := Nkind (Root_Nod) = N_Allocator;
+
+ -- This routine should not be called for constructs which may not
+ -- contain coextensions.
+
+ when others =>
+ raise Program_Error;
+ end case;
+
+ Mark_Allocators (Root_Nod);
+ end Mark_Coextensions;
+
+ ----------------------
+ -- Needs_One_Actual --
+ ----------------------
+
+ function Needs_One_Actual (E : Entity_Id) return Boolean is
+ Formal : Entity_Id;
+
+ begin
+ if Ada_Version >= Ada_05
+ and then Present (First_Formal (E))
+ then
+ Formal := Next_Formal (First_Formal (E));
+ while Present (Formal) loop
+ if No (Default_Value (Formal)) then
+ return False;
+ end if;
+
+ Next_Formal (Formal);
+ end loop;
+
+ return True;
+
+ else
+ return False;
+ end if;
+ end Needs_One_Actual;
+
-------------------------
-- New_External_Entity --
-------------------------
-- Normalize_Actuals --
-----------------------
- -- Chain actuals according to formals of subprogram. If there are
- -- no named associations, the chain is simply the list of Parameter
- -- Associations, since the order is the same as the declaration order.
- -- If there are named associations, then the First_Named_Actual field
- -- in the N_Procedure_Call_Statement node or N_Function_Call node
- -- points to the Parameter_Association node for the parameter that
- -- comes first in declaration order. The remaining named parameters
- -- are then chained in declaration order using Next_Named_Actual.
+ -- Chain actuals according to formals of subprogram. If there are no named
+ -- associations, the chain is simply the list of Parameter Associations,
+ -- since the order is the same as the declaration order. If there are named
+ -- associations, then the First_Named_Actual field in the N_Function_Call
+ -- or N_Procedure_Call_Statement node points to the Parameter_Association
+ -- node for the parameter that comes first in declaration order. The
+ -- remaining named parameters are then chained in declaration order using
+ -- Next_Named_Actual.
- -- This routine also verifies that the number of actuals is compatible
- -- with the number and default values of formals, but performs no type
- -- checking (type checking is done by the caller).
+ -- This routine also verifies that the number of actuals is compatible with
+ -- the number and default values of formals, but performs no type checking
+ -- (type checking is done by the caller).
- -- If the matching succeeds, Success is set to True, and the caller
- -- proceeds with type-checking. If the match is unsuccessful, then
- -- Success is set to False, and the caller attempts a different
- -- interpretation, if there is one.
+ -- If the matching succeeds, Success is set to True and the caller proceeds
+ -- with type-checking. If the match is unsuccessful, then Success is set to
+ -- False, and the caller attempts a different interpretation, if there is
+ -- one.
- -- If the flag Report is on, the call is not overloaded, and a failure
- -- to match can be reported here, rather than in the caller.
+ -- If the flag Report is on, the call is not overloaded, and a failure to
+ -- match can be reported here, rather than in the caller.
procedure Normalize_Actuals
(N : Node_Id;
Success : out Boolean)
is
Actuals : constant List_Id := Parameter_Associations (N);
- Actual : Node_Id := Empty;
+ Actual : Node_Id := Empty;
Formal : Entity_Id;
Last : Node_Id := Empty;
First_Named : Node_Id := Empty;
begin
if No (Last) then
- -- Call node points to first actual in list.
+ -- Call node points to first actual in list
Set_First_Named_Actual (N, Explicit_Actual_Parameter (A));
elsif Actuals_To_Match > Formals_To_Match then
- -- Too many actuals: will not work.
+ -- Too many actuals: will not work
if Reporting then
if Is_Entity_Name (Name (N)) then
end if;
Formal := First_Formal (S);
-
while Present (Formal) loop
-- Match the formals in order. If the corresponding actual
Actual := First_Named;
Found := False;
-
while Present (Actual) loop
if Chars (Selector_Name (Actual)) = Chars (Formal) then
Found := True;
or else Sloc (S) = Standard_Location)
and then Is_Overloadable (S)
then
- Error_Msg_Name_1 := Chars (S);
- Error_Msg_Sloc := Sloc (S);
- Error_Msg_NE
- ("missing argument for parameter & " &
- "in call to % declared #", N, Formal);
+ if No (Actuals)
+ and then
+ (Nkind (Parent (N)) = N_Procedure_Call_Statement
+ or else
+ (Nkind (Parent (N)) = N_Function_Call
+ or else
+ Nkind (Parent (N)) = N_Parameter_Association))
+ and then Ekind (S) /= E_Function
+ then
+ Set_Etype (N, Etype (S));
+ else
+ Error_Msg_Name_1 := Chars (S);
+ Error_Msg_Sloc := Sloc (S);
+ Error_Msg_NE
+ ("missing argument for parameter & " &
+ "in call to % declared #", N, Formal);
+ end if;
elsif Is_Overloadable (S) then
Error_Msg_Name_1 := Chars (S);
- -- Point to type derivation that
- -- generated the operation.
+ -- Point to type derivation that generated the
+ -- operation.
Error_Msg_Sloc := Sloc (Parent (S));
Next_Formal (Formal);
end loop;
- if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
+ if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
Success := True;
return;
-- attached to the list of associations.
Actual := First (Actuals);
-
while Present (Actual) loop
-
if Nkind (Actual) = N_Parameter_Association
and then Actual /= Last
and then No (Next_Named_Actual (Actual))
--------------------------------
procedure Note_Possible_Modification (N : Node_Id) is
+ Modification_Comes_From_Source : constant Boolean :=
+ Comes_From_Source (Parent (N));
+
Ent : Entity_Id;
Exp : Node_Id;
- procedure Set_Ref (E : Entity_Id; N : Node_Id);
- -- Internal routine to note modification on entity E by node N
- -- Has no effect if entity E does not represent an object.
+ begin
+ -- Loop to find referenced entity, if there is one
+
+ Exp := N;
+ loop
+ <<Continue>>
+ Ent := Empty;
- -------------
- -- Set_Ref --
- -------------
+ if Is_Entity_Name (Exp) then
+ Ent := Entity (Exp);
+
+ -- If the entity is missing, it is an undeclared identifier,
+ -- and there is nothing to annotate.
+
+ if No (Ent) then
+ return;
+ end if;
+
+ elsif Nkind (Exp) = N_Explicit_Dereference then
+ declare
+ P : constant Node_Id := Prefix (Exp);
+
+ begin
+ if Nkind (P) = N_Selected_Component
+ and then Present (
+ Entry_Formal (Entity (Selector_Name (P))))
+ then
+ -- Case of a reference to an entry formal
- procedure Set_Ref (E : Entity_Id; N : Node_Id) is
- begin
- if Is_Object (E) then
- if Comes_From_Source (N) then
- Set_Never_Set_In_Source (E, False);
- end if;
+ Ent := Entry_Formal (Entity (Selector_Name (P)));
- Set_Is_True_Constant (E, False);
- Set_Current_Value (E, Empty);
- Generate_Reference (E, N, 'm');
- Kill_Checks (E);
+ elsif Nkind (P) = N_Identifier
+ and then Nkind (Parent (Entity (P))) = N_Object_Declaration
+ and then Present (Expression (Parent (Entity (P))))
+ and then Nkind (Expression (Parent (Entity (P))))
+ = N_Reference
+ then
+ -- Case of a reference to a value on which
+ -- side effects have been removed.
- if not Can_Never_Be_Null (E) then
- Set_Is_Known_Non_Null (E, False);
- end if;
- end if;
- end Set_Ref;
+ Exp := Prefix (Expression (Parent (Entity (P))));
+ goto Continue;
- -- Start of processing for Note_Possible_Modification
+ else
+ return;
- begin
- -- Loop to find referenced entity, if there is one
+ end if;
+ end;
- Exp := N;
- loop
- -- Test for node rewritten as dereference (e.g. accept parameter)
+ elsif Nkind (Exp) = N_Type_Conversion
+ or else Nkind (Exp) = N_Unchecked_Type_Conversion
+ then
+ Exp := Expression (Exp);
+ goto Continue;
- if Nkind (Exp) = N_Explicit_Dereference
- and then not Comes_From_Source (Exp)
+ elsif Nkind (Exp) = N_Slice
+ or else Nkind (Exp) = N_Indexed_Component
+ or else Nkind (Exp) = N_Selected_Component
then
- Exp := Original_Node (Exp);
+ Exp := Prefix (Exp);
+ goto Continue;
+
+ else
+ return;
end if;
-- Now look for entity being referenced
- if Is_Entity_Name (Exp) then
- Ent := Entity (Exp);
+ if Present (Ent) then
+ if Is_Object (Ent) then
+ if Comes_From_Source (Exp)
+ or else Modification_Comes_From_Source
+ then
+ Set_Never_Set_In_Source (Ent, False);
+ end if;
- if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
- and then Present (Renamed_Object (Ent))
- then
- Set_Never_Set_In_Source (Ent, False);
- Set_Is_True_Constant (Ent, False);
- Set_Current_Value (Ent, Empty);
+ Set_Is_True_Constant (Ent, False);
+ Set_Current_Value (Ent, Empty);
+ Set_Is_Known_Null (Ent, False);
if not Can_Never_Be_Null (Ent) then
Set_Is_Known_Non_Null (Ent, False);
end if;
- Exp := Renamed_Object (Ent);
+ -- Follow renaming chain
- else
- Set_Ref (Ent, Exp);
- Kill_Checks (Ent);
- return;
- end if;
+ if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
+ and then Present (Renamed_Object (Ent))
+ then
+ Exp := Renamed_Object (Ent);
+ goto Continue;
+ end if;
- elsif Nkind (Exp) = N_Type_Conversion
- or else Nkind (Exp) = N_Unchecked_Type_Conversion
- then
- Exp := Expression (Exp);
+ -- Generate a reference only if the assignment comes from
+ -- source. This excludes, for example, calls to a dispatching
+ -- assignment operation when the left-hand side is tagged.
- elsif Nkind (Exp) = N_Slice
- or else Nkind (Exp) = N_Indexed_Component
- or else Nkind (Exp) = N_Selected_Component
- then
- Exp := Prefix (Exp);
+ if Modification_Comes_From_Source then
+ Generate_Reference (Ent, Exp, 'm');
+ end if;
- else
+ Check_Nested_Access (Ent);
+ end if;
+
+ Kill_Checks (Ent);
return;
end if;
end loop;
E : Entity_Id;
-- Returns the static accessibility level of the view denoted
- -- by Obj. Note that the value returned is the result of a
- -- call to Scope_Depth. Only scope depths associated with
- -- dynamic scopes can actually be returned. Since only
+ -- by Obj. Note that the value returned is the result of a
+ -- call to Scope_Depth. Only scope depths associated with
+ -- dynamic scopes can actually be returned. Since only
-- relative levels matter for accessibility checking, the fact
-- that the distance between successive levels of accessibility
-- is not always one is immaterial (invariant: if level(E2) is
-- deeper than level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
+ function Reference_To (Obj : Node_Id) return Node_Id;
+ -- An explicit dereference is created when removing side-effects
+ -- from expressions for constraint checking purposes. In this case
+ -- a local access type is created for it. The correct access level
+ -- is that of the original source node. We detect this case by
+ -- noting that the prefix of the dereference is created by an object
+ -- declaration whose initial expression is a reference.
+
+ ------------------
+ -- Reference_To --
+ ------------------
+
+ function Reference_To (Obj : Node_Id) return Node_Id is
+ Pref : constant Node_Id := Prefix (Obj);
+ begin
+ if Is_Entity_Name (Pref)
+ and then Nkind (Parent (Entity (Pref))) = N_Object_Declaration
+ and then Present (Expression (Parent (Entity (Pref))))
+ and then Nkind (Expression (Parent (Entity (Pref)))) = N_Reference
+ then
+ return (Prefix (Expression (Parent (Entity (Pref)))));
+ else
+ return Empty;
+ end if;
+ end Reference_To;
+
+ -- Start of processing for Object_Access_Level
+
begin
if Is_Entity_Name (Obj) then
E := Entity (Obj);
Ekind (Entity (Selector_Name (Prefix (Obj)))) = E_Discriminant
then
return Object_Access_Level (Prefix (Obj));
+
+ elsif not (Comes_From_Source (Obj)) then
+ declare
+ Ref : constant Node_Id := Reference_To (Obj);
+ begin
+ if Present (Ref) then
+ return Object_Access_Level (Ref);
+ else
+ return Type_Access_Level (Etype (Prefix (Obj)));
+ end if;
+ end;
+
else
return Type_Access_Level (Etype (Prefix (Obj)));
end if;
if Is_Private_Type (Btype)
and then not Is_Generic_Type (Btype)
then
- return Btype;
+ if Present (Full_View (Btype))
+ and then Is_Record_Type (Full_View (Btype))
+ and then not Is_Frozen (Btype)
+ then
+ -- To indicate that the ancestor depends on a private type,
+ -- the current Btype is sufficient. However, to check for
+ -- circular definition we must recurse on the full view.
+
+ Candidate := Trace_Components (Full_View (Btype), True);
+
+ if Candidate = Any_Type then
+ return Any_Type;
+ else
+ return Btype;
+ end if;
+
+ else
+ return Btype;
+ end if;
elsif Is_Array_Type (Btype) then
return Trace_Components (Component_Type (Btype), True);
Component := First_Entity (Btype);
while Present (Component) loop
- -- skip anonymous types generated by constrained components.
+ -- Skip anonymous types generated by constrained components
if not Is_Type (Component) then
P := Trace_Components (Etype (Component), True);
function Rep_To_Pos_Flag (E : Entity_Id; Loc : Source_Ptr) return Node_Id is
begin
- if Range_Checks_Suppressed (E) then
- return New_Occurrence_Of (Standard_False, Loc);
- else
- return New_Occurrence_Of (Standard_True, Loc);
- end if;
+ return New_Occurrence_Of
+ (Boolean_Literals (not Range_Checks_Suppressed (E)), Loc);
end Rep_To_Pos_Flag;
--------------------
-- A transient scope is required when variable-sized temporaries are
-- allocated in the primary or secondary stack, or when finalization
- -- actions must be generated before the next instruction
+ -- actions must be generated before the next instruction.
function Requires_Transient_Scope (Id : Entity_Id) return Boolean is
Typ : constant Entity_Id := Underlying_Type (Id);
+ -- Start of processing for Requires_Transient_Scope
+
begin
-- This is a private type which is not completed yet. This can only
-- happen in a default expression (of a formal parameter or of a
if No (Typ) then
return False;
+ -- Do not expand transient scope for non-existent procedure return
+
elsif Typ = Standard_Void_Type then
return False;
- -- The back-end has trouble allocating variable-size temporaries so
- -- we generate them in the front-end and need a transient scope to
- -- reclaim them properly
+ -- Elementary types do not require a transient scope
- elsif not Size_Known_At_Compile_Time (Typ) then
- return True;
+ elsif Is_Elementary_Type (Typ) then
+ return False;
- -- Unconstrained discriminated records always require a variable
- -- length temporary, since the length may depend on the variant.
+ -- Generally, indefinite subtypes require a transient scope, since the
+ -- back end cannot generate temporaries, since this is not a valid type
+ -- for declaring an object. It might be possible to relax this in the
+ -- future, e.g. by declaring the maximum possible space for the type.
- elsif Is_Record_Type (Typ)
- and then Has_Discriminants (Typ)
- and then not Is_Constrained (Typ)
- then
+ elsif Is_Indefinite_Subtype (Typ) then
return True;
-- Functions returning tagged types may dispatch on result so their
elsif Is_Tagged_Type (Typ)
or else Has_Controlled_Component (Typ)
then
- return True;
+ return not Is_Value_Type (Typ);
+
+ -- Record type
+
+ elsif Is_Record_Type (Typ) then
+ declare
+ Comp : Entity_Id;
+ begin
+ Comp := First_Entity (Typ);
+ while Present (Comp) loop
+ if Ekind (Comp) = E_Component
+ and then Requires_Transient_Scope (Etype (Comp))
+ then
+ return True;
+ else
+ Next_Entity (Comp);
+ end if;
+ end loop;
+ end;
+
+ return False;
+
+ -- String literal types never require transient scope
+
+ elsif Ekind (Typ) = E_String_Literal_Subtype then
+ return False;
- -- Unconstrained array types are returned on the secondary stack
+ -- Array type. Note that we already know that this is a constrained
+ -- array, since unconstrained arrays will fail the indefinite test.
elsif Is_Array_Type (Typ) then
- return not Is_Constrained (Typ);
- end if;
- return False;
+ -- If component type requires a transient scope, the array does too
+
+ if Requires_Transient_Scope (Component_Type (Typ)) then
+ return True;
+
+ -- Otherwise, we only need a transient scope if the size is not
+ -- known at compile time.
+
+ else
+ return not Size_Known_At_Compile_Time (Typ);
+ end if;
+
+ -- All other cases do not require a transient scope
+
+ else
+ return False;
+ end if;
end Requires_Transient_Scope;
--------------------------
procedure Reset_Analyzed_Flags (N : Node_Id) is
- function Clear_Analyzed
- (N : Node_Id) return Traverse_Result;
+ function Clear_Analyzed (N : Node_Id) return Traverse_Result;
-- Function used to reset Analyzed flags in tree. Note that we do
-- not reset Analyzed flags in entities, since there is no need to
-- renalalyze entities, and indeed, it is wrong to do so, since it
-- Clear_Analyzed --
--------------------
- function Clear_Analyzed
- (N : Node_Id) return Traverse_Result
- is
+ function Clear_Analyzed (N : Node_Id) return Traverse_Result is
begin
if not Has_Extension (N) then
Set_Analyzed (N, False);
---------------------------
function Safe_To_Capture_Value
- (N : Node_Id;
- Ent : Entity_Id) return Boolean
+ (N : Node_Id;
+ Ent : Entity_Id;
+ Cond : Boolean := False) return Boolean
is
begin
- -- The only entities for which we track constant values are variables,
- -- out parameters and in out parameters, so check if we have this case.
+ -- The only entities for which we track constant values are variables
+ -- which are not renamings, constants, out parameters, and in out
+ -- parameters, so check if we have this case.
- if Ekind (Ent) /= E_Variable
- and then
- Ekind (Ent) /= E_Out_Parameter
- and then
- Ekind (Ent) /= E_In_Out_Parameter
+ -- Note: it may seem odd to track constant values for constants, but in
+ -- fact this routine is used for other purposes than simply capturing
+ -- the value. In particular, the setting of Known[_Non]_Null.
+
+ if (Ekind (Ent) = E_Variable and then No (Renamed_Object (Ent)))
+ or else
+ Ekind (Ent) = E_Constant
+ or else
+ Ekind (Ent) = E_Out_Parameter
+ or else
+ Ekind (Ent) = E_In_Out_Parameter
+ then
+ null;
+
+ -- For conditionals, we also allow loop parameters and all formals,
+ -- including in parameters.
+
+ elsif Cond
+ and then
+ (Ekind (Ent) = E_Loop_Parameter
+ or else
+ Ekind (Ent) = E_In_Parameter)
then
+ null;
+
+ -- For all other cases, not just unsafe, but impossible to capture
+ -- Current_Value, since the above are the only entities which have
+ -- Current_Value fields.
+
+ else
return False;
end if;
- -- Skip volatile and aliased variables, since funny things might
- -- be going on in these cases which we cannot necessarily track.
+ -- Skip if volatile or aliased, since funny things might be going on in
+ -- these cases which we cannot necessarily track. Also skip any variable
+ -- for which an address clause is given, or whose address is taken.
- if Treat_As_Volatile (Ent) or else Is_Aliased (Ent) then
+ if Treat_As_Volatile (Ent)
+ or else Is_Aliased (Ent)
+ or else Present (Address_Clause (Ent))
+ or else Address_Taken (Ent)
+ then
return False;
end if;
- -- OK, all above conditions are met. We also require that the scope
- -- of the reference be the same as the scope of the entity, not
- -- counting packages and blocks.
+ -- OK, all above conditions are met. We also require that the scope of
+ -- the reference be the same as the scope of the entity, not counting
+ -- packages and blocks and loops.
declare
E_Scope : constant Entity_Id := Scope (Ent);
exit when R_Scope = E_Scope;
if Ekind (R_Scope) /= E_Package
- and then
- Ekind (R_Scope) /= E_Block
+ and then
+ Ekind (R_Scope) /= E_Block
+ and then
+ Ekind (R_Scope) /= E_Loop
then
return False;
else
-- We also require that the reference does not appear in a context
-- where it is not sure to be executed (i.e. a conditional context
- -- or an exception handler).
+ -- or an exception handler). We skip this if Cond is True, since the
+ -- capturing of values from conditional tests handles this ok.
+
+ if Cond then
+ return True;
+ end if;
declare
- P : Node_Id;
+ Desc : Node_Id;
+ P : Node_Id;
begin
+ Desc := N;
+
P := Parent (N);
while Present (P) loop
if Nkind (P) = N_If_Statement
- or else
- Nkind (P) = N_Case_Statement
- or else
- Nkind (P) = N_Exception_Handler
- or else
- Nkind (P) = N_Selective_Accept
- or else
- Nkind (P) = N_Conditional_Entry_Call
- or else
- Nkind (P) = N_Timed_Entry_Call
- or else
- Nkind (P) = N_Asynchronous_Select
+ or else Nkind (P) = N_Case_Statement
+ or else (Nkind (P) = N_And_Then and then Desc = Right_Opnd (P))
+ or else (Nkind (P) = N_Or_Else and then Desc = Right_Opnd (P))
+ or else Nkind (P) = N_Exception_Handler
+ or else Nkind (P) = N_Selective_Accept
+ or else Nkind (P) = N_Conditional_Entry_Call
+ or else Nkind (P) = N_Timed_Entry_Call
+ or else Nkind (P) = N_Asynchronous_Select
then
return False;
else
- P := Parent (P);
+ Desc := P;
+ P := Parent (P);
end if;
end loop;
end;
end if;
end Same_Name;
+ -----------------
+ -- Same_Object --
+ -----------------
+
+ function Same_Object (Node1, Node2 : Node_Id) return Boolean is
+ N1 : constant Node_Id := Original_Node (Node1);
+ N2 : constant Node_Id := Original_Node (Node2);
+ -- We do the tests on original nodes, since we are most interested
+ -- in the original source, not any expansion that got in the way.
+
+ K1 : constant Node_Kind := Nkind (N1);
+ K2 : constant Node_Kind := Nkind (N2);
+
+ begin
+ -- First case, both are entities with same entity
+
+ if K1 in N_Has_Entity
+ and then K2 in N_Has_Entity
+ and then Present (Entity (N1))
+ and then Present (Entity (N2))
+ and then (Ekind (Entity (N1)) = E_Variable
+ or else
+ Ekind (Entity (N1)) = E_Constant)
+ and then Entity (N1) = Entity (N2)
+ then
+ return True;
+
+ -- Second case, selected component with same selector, same record
+
+ elsif K1 = N_Selected_Component
+ and then K2 = N_Selected_Component
+ and then Chars (Selector_Name (N1)) = Chars (Selector_Name (N2))
+ then
+ return Same_Object (Prefix (N1), Prefix (N2));
+
+ -- Third case, indexed component with same subscripts, same array
+
+ elsif K1 = N_Indexed_Component
+ and then K2 = N_Indexed_Component
+ and then Same_Object (Prefix (N1), Prefix (N2))
+ then
+ declare
+ E1, E2 : Node_Id;
+ begin
+ E1 := First (Expressions (N1));
+ E2 := First (Expressions (N2));
+ while Present (E1) loop
+ if not Same_Value (E1, E2) then
+ return False;
+ else
+ Next (E1);
+ Next (E2);
+ end if;
+ end loop;
+
+ return True;
+ end;
+
+ -- Fourth case, slice of same array with same bounds
+
+ elsif K1 = N_Slice
+ and then K2 = N_Slice
+ and then Nkind (Discrete_Range (N1)) = N_Range
+ and then Nkind (Discrete_Range (N2)) = N_Range
+ and then Same_Value (Low_Bound (Discrete_Range (N1)),
+ Low_Bound (Discrete_Range (N2)))
+ and then Same_Value (High_Bound (Discrete_Range (N1)),
+ High_Bound (Discrete_Range (N2)))
+ then
+ return Same_Name (Prefix (N1), Prefix (N2));
+
+ -- All other cases, not clearly the same object
+
+ else
+ return False;
+ end if;
+ end Same_Object;
+
---------------
-- Same_Type --
---------------
end if;
end Same_Type;
+ ----------------
+ -- Same_Value --
+ ----------------
+
+ function Same_Value (Node1, Node2 : Node_Id) return Boolean is
+ begin
+ if Compile_Time_Known_Value (Node1)
+ and then Compile_Time_Known_Value (Node2)
+ and then Expr_Value (Node1) = Expr_Value (Node2)
+ then
+ return True;
+ elsif Same_Object (Node1, Node2) then
+ return True;
+ else
+ return False;
+ end if;
+ end Same_Value;
+
------------------------
-- Scope_Is_Transient --
------------------------
then
if Nkind (N) = N_Identifier then
Nod := N;
-
elsif Nkind (N) = N_Expanded_Name then
Nod := Selector_Name (N);
-
else
return;
end if;
- Val_Actual := Val;
-
-- A special situation arises for derived operations, where we want
-- to do the check against the parent (since the Sloc of the derived
-- operation points to the derived type declaration itself).
+ Val_Actual := Val;
while not Comes_From_Source (Val_Actual)
and then Nkind (Val_Actual) in N_Entity
and then (Ekind (Val_Actual) = E_Enumeration_Literal
S : constant Entity_Id := Current_Scope;
begin
- if S = Standard_Standard
- or else (Is_Public (S)
- and then (Ekind (S) = E_Package
- or else Is_Record_Type (S)
- or else Ekind (S) = E_Void))
+ -- Everything in the scope of Standard is public
+
+ if S = Standard_Standard then
+ Set_Is_Public (Id);
+
+ -- Entity is definitely not public if enclosing scope is not public
+
+ elsif not Is_Public (S) then
+ return;
+
+ -- An object declaration that occurs in a handled sequence of statements
+ -- is the declaration for a temporary object generated by the expander.
+ -- It never needs to be made public and furthermore, making it public
+ -- can cause back end problems if it is of variable size.
+
+ elsif Nkind (Parent (Id)) = N_Object_Declaration
+ and then
+ Nkind (Parent (Parent (Id))) = N_Handled_Sequence_Of_Statements
then
+ return;
+
+ -- Entities in public packages or records are public
+
+ elsif Ekind (S) = E_Package or Is_Record_Type (S) then
Set_Is_Public (Id);
-- The bounds of an entry family declaration can generate object
-- declarations that are visible to the back-end, e.g. in the
-- the declaration of a composite type that contains tasks.
- elsif Is_Public (S)
- and then Is_Concurrent_Type (S)
+ elsif Is_Concurrent_Type (S)
and then not Has_Completion (S)
and then Nkind (Parent (Id)) = N_Object_Declaration
then
then
Set_Is_Unsigned_Type (T1, Is_Unsigned_Type (T2));
end if;
+
Set_Alignment (T1, Alignment (T2));
end Set_Size_Info;
function Statically_Different (E1, E2 : Node_Id) return Boolean is
R1 : constant Node_Id := Get_Referenced_Object (E1);
R2 : constant Node_Id := Get_Referenced_Object (E2);
-
begin
return Is_Entity_Name (R1)
and then Is_Entity_Name (R2)
-----------------------
procedure Transfer_Entities (From : Entity_Id; To : Entity_Id) is
- Ent : Entity_Id := First_Entity (From);
+ Ent : Entity_Id := First_Entity (From);
begin
if No (Ent) then
declare
Comp : Entity_Id;
-
begin
Comp := First_Entity (Ent);
-
while Present (Comp) loop
Set_Is_Public (Comp);
Next_Entity (Comp);
-----------------------
function Type_Access_Level (Typ : Entity_Id) return Uint is
- Btyp : Entity_Id := Base_Type (Typ);
+ Btyp : Entity_Id;
begin
- -- If the type is an anonymous access type we treat it as being
- -- declared at the library level to ensure that names such as
- -- X.all'access don't fail static accessibility checks.
+ Btyp := Base_Type (Typ);
+
+ -- Ada 2005 (AI-230): For most cases of anonymous access types, we
+ -- simply use the level where the type is declared. This is true for
+ -- stand-alone object declarations, and for anonymous access types
+ -- associated with components the level is the same as that of the
+ -- enclosing composite type. However, special treatment is needed for
+ -- the cases of access parameters, return objects of an anonymous access
+ -- type, and, in Ada 95, access discriminants of limited types.
if Ekind (Btyp) in Access_Kind then
if Ekind (Btyp) = E_Anonymous_Access_Type then
- return Scope_Depth (Standard_Standard);
+
+ -- If the type is a nonlocal anonymous access type (such as for
+ -- an access parameter) we treat it as being declared at the
+ -- library level to ensure that names such as X.all'access don't
+ -- fail static accessibility checks.
+
+ if not Is_Local_Anonymous_Access (Typ) then
+ return Scope_Depth (Standard_Standard);
+
+ -- If this is a return object, the accessibility level is that of
+ -- the result subtype of the enclosing function. The test here is
+ -- little complicated, because we have to account for extended
+ -- return statements that have been rewritten as blocks, in which
+ -- case we have to find and the Is_Return_Object attribute of the
+ -- itype's associated object. It would be nice to find a way to
+ -- simplify this test, but it doesn't seem worthwhile to add a new
+ -- flag just for purposes of this test. ???
+
+ elsif Ekind (Scope (Btyp)) = E_Return_Statement
+ or else
+ (Is_Itype (Btyp)
+ and then Nkind (Associated_Node_For_Itype (Btyp)) =
+ N_Object_Declaration
+ and then Is_Return_Object
+ (Defining_Identifier
+ (Associated_Node_For_Itype (Btyp))))
+ then
+ declare
+ Scop : Entity_Id;
+
+ begin
+ Scop := Scope (Scope (Btyp));
+ while Present (Scop) loop
+ exit when Ekind (Scop) = E_Function;
+ Scop := Scope (Scop);
+ end loop;
+
+ -- Treat the return object's type as having the level of the
+ -- function's result subtype (as per RM05-6.5(5.3/2)).
+
+ return Type_Access_Level (Etype (Scop));
+ end;
+ end if;
end if;
Btyp := Root_Type (Btyp);
+
+ -- The accessibility level of anonymous acccess types associated with
+ -- discriminants is that of the current instance of the type, and
+ -- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
+
+ -- AI-402: access discriminants have accessibility based on the
+ -- object rather than the type in Ada 2005, so the above paragraph
+ -- doesn't apply.
+
+ -- ??? Needs completion with rules from AI-416
+
+ if Ada_Version <= Ada_95
+ and then Ekind (Typ) = E_Anonymous_Access_Type
+ and then Present (Associated_Node_For_Itype (Typ))
+ and then Nkind (Associated_Node_For_Itype (Typ)) =
+ N_Discriminant_Specification
+ then
+ return Scope_Depth (Enclosing_Dynamic_Scope (Btyp)) + 1;
+ end if;
end if;
return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
N : Node_Id := Parent (Unit_Id);
begin
- -- Predefined operators do not have a full function declaration.
+ -- Predefined operators do not have a full function declaration
if Ekind (Unit_Id) = E_Operator then
return N;
end if;
+ -- Isn't there some better way to express the following ???
+
while Nkind (N) /= N_Abstract_Subprogram_Declaration
and then Nkind (N) /= N_Formal_Package_Declaration
- and then Nkind (N) /= N_Formal_Subprogram_Declaration
and then Nkind (N) /= N_Function_Instantiation
and then Nkind (N) /= N_Generic_Package_Declaration
and then Nkind (N) /= N_Generic_Subprogram_Declaration
and then Nkind (N) /= N_Subprogram_Renaming_Declaration
and then Nkind (N) /= N_Task_Body
and then Nkind (N) /= N_Task_Type_Declaration
+ and then Nkind (N) not in N_Formal_Subprogram_Declaration
and then Nkind (N) not in N_Generic_Renaming_Declaration
loop
N := Parent (N);
else
Get_First_Interp (Opnd, Index, It);
-
while Present (It.Typ) loop
-
if It.Typ = Universal_Integer
or else It.Typ = Universal_Real
then
end if;
end Universal_Interpretation;
+ ---------------
+ -- Unqualify --
+ ---------------
+
+ function Unqualify (Expr : Node_Id) return Node_Id is
+ begin
+ -- Recurse to handle unlikely case of multiple levels of qualification
+
+ if Nkind (Expr) = N_Qualified_Expression then
+ return Unqualify (Expression (Expr));
+
+ -- Normal case, not a qualified expression
+
+ else
+ return Expr;
+ end if;
+ end Unqualify;
+
----------------------
-- Within_Init_Proc --
----------------------
Expec_Type : constant Entity_Id := First_Subtype (Expected_Type);
function Has_One_Matching_Field return Boolean;
- -- Determines whether Expec_Type is a record type with a single
- -- component or discriminant whose type matches the found type or
- -- is a one dimensional array whose component type matches the
- -- found type.
+ -- Determines if Expec_Type is a record type with a single component or
+ -- discriminant whose type matches the found type or is one dimensional
+ -- array whose component type matches the found type.
+
+ ----------------------------
+ -- Has_One_Matching_Field --
+ ----------------------------
function Has_One_Matching_Field return Boolean is
E : Entity_Id;
else
E := First_Entity (Expec_Type);
-
loop
if No (E) then
return False;
-- There is no simple way to insure that it is consistent ???
elsif In_Instance then
-
if Etype (Etype (Expr)) = Etype (Expected_Type)
and then
(Has_Private_Declaration (Expected_Type)
Error_Msg_N ("result must be general access type!", Expr);
Error_Msg_NE ("add ALL to }!", Expr, Expec_Type);
+ -- Another special check, if the expected type is an integer type,
+ -- but the expression is of type System.Address, and the parent is
+ -- an addition or subtraction operation whose left operand is the
+ -- expression in question and whose right operand is of an integral
+ -- type, then this is an attempt at address arithmetic, so give
+ -- appropriate message.
+
+ elsif Is_Integer_Type (Expec_Type)
+ and then Is_RTE (Found_Type, RE_Address)
+ and then (Nkind (Parent (Expr)) = N_Op_Add
+ or else
+ Nkind (Parent (Expr)) = N_Op_Subtract)
+ and then Expr = Left_Opnd (Parent (Expr))
+ and then Is_Integer_Type (Etype (Right_Opnd (Parent (Expr))))
+ then
+ Error_Msg_N
+ ("address arithmetic not predefined in package System",
+ Parent (Expr));
+ Error_Msg_N
+ ("\possible missing with/use of System.Storage_Elements",
+ Parent (Expr));
+ return;
+
-- If the expected type is an anonymous access type, as for access
-- parameters and discriminants, the error is on the designated types.
and then not Comes_From_Source (Found_Type)
then
Error_Msg_NE
- ("found an access type with designated}!",
+ ("\\found an access type with designated}!",
Expr, Designated_Type (Found_Type));
else
if From_With_Type (Found_Type) then
- Error_Msg_NE ("found incomplete}!", Expr, Found_Type);
- Error_Msg_NE
- ("\possibly missing with_clause on&", Expr,
- Scope (Found_Type));
+ Error_Msg_NE ("\\found incomplete}!", Expr, Found_Type);
+ Error_Msg_Qual_Level := 99;
+ Error_Msg_NE ("\\missing `WITH &;", Expr, Scope (Found_Type));
+ Error_Msg_Qual_Level := 0;
else
Error_Msg_NE ("found}!", Expr, Found_Type);
end if;
-- Normal case of one type found, some other type expected
else
- -- If the names of the two types are the same, see if some
- -- number of levels of qualification will help. Don't try
- -- more than three levels, and if we get to standard, it's
- -- no use (and probably represents an error in the compiler)
- -- Also do not bother with internal scope names.
+ -- If the names of the two types are the same, see if some number
+ -- of levels of qualification will help. Don't try more than three
+ -- levels, and if we get to standard, it's no use (and probably
+ -- represents an error in the compiler) Also do not bother with
+ -- internal scope names.
declare
Expec_Scope : Entity_Id;
Found_Scope := Scope (Found_Scope);
exit when Expec_Scope = Standard_Standard
- or else
- Found_Scope = Standard_Standard
- or else
- not Comes_From_Source (Expec_Scope)
- or else
- not Comes_From_Source (Found_Scope);
+ or else Found_Scope = Standard_Standard
+ or else not Comes_From_Source (Expec_Scope)
+ or else not Comes_From_Source (Found_Scope);
end loop;
end;
- Error_Msg_NE ("expected}!", Expr, Expec_Type);
+ if Is_Record_Type (Expec_Type)
+ and then Present (Corresponding_Remote_Type (Expec_Type))
+ then
+ Error_Msg_NE ("expected}!", Expr,
+ Corresponding_Remote_Type (Expec_Type));
+ else
+ Error_Msg_NE ("expected}!", Expr, Expec_Type);
+ end if;
if Is_Entity_Name (Expr)
- and then Is_Package (Entity (Expr))
+ and then Is_Package_Or_Generic_Package (Entity (Expr))
then
- Error_Msg_N ("found package name!", Expr);
+ Error_Msg_N ("\\found package name!", Expr);
elsif Is_Entity_Name (Expr)
and then
or else
Ekind (Entity (Expr)) = E_Generic_Procedure)
then
- Error_Msg_N ("found procedure name instead of function!", Expr);
+ if Ekind (Expec_Type) = E_Access_Subprogram_Type then
+ Error_Msg_N
+ ("found procedure name, possibly missing Access attribute!",
+ Expr);
+ else
+ Error_Msg_N
+ ("\\found procedure name instead of function!", Expr);
+ end if;
+
+ elsif Nkind (Expr) = N_Function_Call
+ and then Ekind (Expec_Type) = E_Access_Subprogram_Type
+ and then Etype (Designated_Type (Expec_Type)) = Etype (Expr)
+ and then No (Parameter_Associations (Expr))
+ then
+ Error_Msg_N
+ ("found function name, possibly missing Access attribute!",
+ Expr);
- -- catch common error: a prefix or infix operator which is not
+ -- Catch common error: a prefix or infix operator which is not
-- directly visible because the type isn't.
elsif Nkind (Expr) in N_Op
and then not In_Use (Expec_Type)
and then Has_Compatible_Type (Right_Opnd (Expr), Expec_Type)
then
- Error_Msg_N (
- "operator of the type is not directly visible!", Expr);
+ Error_Msg_N
+ ("operator of the type is not directly visible!", Expr);
- elsif Ekind (Found_Type) = E_Void then
- Error_Msg_NE ("found premature usage of}!", Expr, Found_Type);
+ elsif Ekind (Found_Type) = E_Void
+ and then Present (Parent (Found_Type))
+ and then Nkind (Parent (Found_Type)) = N_Full_Type_Declaration
+ then
+ Error_Msg_NE ("\\found premature usage of}!", Expr, Found_Type);
else
- Error_Msg_NE ("found}!", Expr, Found_Type);
+ Error_Msg_NE ("\\found}!", Expr, Found_Type);
end if;
Error_Msg_Qual_Level := 0;
OSDN Git Service
