-- --
-- B o d y --
-- --
--- Copyright (C) 1992-2007, Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
with Debug; use Debug;
with Errout; use Errout;
with Elists; use Elists;
+with Exp_Ch11; use Exp_Ch11;
+with Exp_Disp; use Exp_Disp;
with Exp_Tss; use Exp_Tss;
with Exp_Util; use Exp_Util;
with Fname; use Fname;
with Scans; use Scans;
with Scn; use Scn;
with Sem; use Sem;
+with Sem_Aux; use Sem_Aux;
with Sem_Attr; use Sem_Attr;
-with Sem_Ch6; use Sem_Ch6;
with Sem_Ch8; use Sem_Ch8;
+with Sem_Disp; use Sem_Disp;
with Sem_Eval; use Sem_Eval;
with Sem_Res; use Sem_Res;
+with Sem_SCIL; use Sem_SCIL;
with Sem_Type; use Sem_Type;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
-with Snames; use Snames;
with Stand; use Stand;
with Style;
with Stringt; use Stringt;
with Ttypes; use Ttypes;
with Uname; use Uname;
+with GNAT.HTable; use GNAT.HTable;
package body Sem_Util is
- use Nmake;
+ ----------------------------------------
+ -- Global_Variables for New_Copy_Tree --
+ ----------------------------------------
+
+ -- These global variables are used by New_Copy_Tree. See description
+ -- of the body of this subprogram for details. Global variables can be
+ -- safely used by New_Copy_Tree, since there is no case of a recursive
+ -- call from the processing inside New_Copy_Tree.
+
+ NCT_Hash_Threshhold : constant := 20;
+ -- If there are more than this number of pairs of entries in the
+ -- map, then Hash_Tables_Used will be set, and the hash tables will
+ -- be initialized and used for the searches.
+
+ NCT_Hash_Tables_Used : Boolean := False;
+ -- Set to True if hash tables are in use
+
+ NCT_Table_Entries : Nat;
+ -- Count entries in table to see if threshhold is reached
+
+ NCT_Hash_Table_Setup : Boolean := False;
+ -- Set to True if hash table contains data. We set this True if we
+ -- setup the hash table with data, and leave it set permanently
+ -- from then on, this is a signal that second and subsequent users
+ -- of the hash table must clear the old entries before reuse.
+
+ subtype NCT_Header_Num is Int range 0 .. 511;
+ -- Defines range of headers in hash tables (512 headers)
-----------------------
-- Local Subprograms --
Nod := Parent (Base_Type (Typ));
+ if Nkind (Nod) = N_Full_Type_Declaration then
+ return Empty_List;
+ end if;
+
elsif Ekind (Typ) = E_Record_Type_With_Private then
if Nkind (Parent (Typ)) = N_Full_Type_Declaration then
Nod := Type_Definition (Parent (Typ));
elsif Ekind (Typ) = E_Record_Subtype_With_Private then
- -- Recurse, because parent may still be a private extension
+ -- Recurse, because parent may still be a private extension. Also
+ -- note that the full view of the subtype or the full view of its
+ -- base type may (both) be unavailable.
- return Abstract_Interface_List (Etype (Full_View (Typ)));
+ return Abstract_Interface_List (Etype (Typ));
else pragma Assert ((Ekind (Typ)) = E_Record_Type);
if Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
Rep : Boolean := True;
Warn : Boolean := False)
is
- Stat : constant Boolean := Is_Static_Expression (N);
- Rtyp : Entity_Id;
+ Stat : constant Boolean := Is_Static_Expression (N);
+ R_Stat : constant Node_Id :=
+ Make_Raise_Constraint_Error (Sloc (N), Reason => Reason);
+ Rtyp : Entity_Id;
begin
if No (Typ) then
-- Now we replace the node by an N_Raise_Constraint_Error node
-- This does not need reanalyzing, so set it as analyzed now.
- Rewrite (N,
- Make_Raise_Constraint_Error (Sloc (N),
- Reason => Reason));
+ Rewrite (N, R_Stat);
Set_Analyzed (N, True);
+
Set_Etype (N, Rtyp);
Set_Raises_Constraint_Error (N);
+ -- Now deal with possible local raise handling
+
+ Possible_Local_Raise (N, Standard_Constraint_Error);
+
-- If the original expression was marked as static, the result is
-- still marked as static, but the Raises_Constraint_Error flag is
-- always set so that further static evaluation is not attempted.
else
Constraints := New_List;
- if Is_Private_Type (T) and then No (Full_View (T)) then
+ -- Type T is a generic derived type, inherit the discriminants from
+ -- the parent type.
- -- Type is a generic derived type. Inherit discriminants from
- -- Parent type.
+ if Is_Private_Type (T)
+ and then No (Full_View (T))
+ -- T was flagged as an error if it was declared as a formal
+ -- derived type with known discriminants. In this case there
+ -- is no need to look at the parent type since T already carries
+ -- its own discriminants.
+
+ and then not Error_Posted (T)
+ then
Disc_Type := Etype (Base_Type (T));
else
Disc_Type := T;
-- Start of processing for Build_Actual_Subtype_Of_Component
begin
- if In_Default_Expression then
+ -- Why the test for Spec_Expression mode here???
+
+ if In_Spec_Expression then
return Empty;
+ -- More comments for the rest of this body would be good ???
+
elsif Nkind (N) = N_Explicit_Dereference then
if Is_Composite_Type (T)
and then not Is_Constrained (T)
while Present (Id) loop
Indx_Type := Underlying_Type (Etype (Id));
- if Denotes_Discriminant (Type_Low_Bound (Indx_Type)) or else
+ if Denotes_Discriminant (Type_Low_Bound (Indx_Type))
+ or else
Denotes_Discriminant (Type_High_Bound (Indx_Type))
then
Remove_Side_Effects (P);
return
- Build_Component_Subtype (
- Build_Actual_Array_Constraint, Loc, Base_Type (T));
+ Build_Component_Subtype
+ (Build_Actual_Array_Constraint, Loc, Base_Type (T));
end if;
Next_Index (Id);
end if;
end Cannot_Raise_Constraint_Error;
+ -----------------------------------------
+ -- Check_Dynamically_Tagged_Expression --
+ -----------------------------------------
+
+ procedure Check_Dynamically_Tagged_Expression
+ (Expr : Node_Id;
+ Typ : Entity_Id;
+ Related_Nod : Node_Id)
+ is
+ begin
+ pragma Assert (Is_Tagged_Type (Typ));
+
+ -- In order to avoid spurious errors when analyzing the expanded code,
+ -- this check is done only for nodes that come from source and for
+ -- actuals of generic instantiations.
+
+ if (Comes_From_Source (Related_Nod)
+ or else In_Generic_Actual (Expr))
+ and then (Is_Class_Wide_Type (Etype (Expr))
+ or else Is_Dynamically_Tagged (Expr))
+ and then Is_Tagged_Type (Typ)
+ and then not Is_Class_Wide_Type (Typ)
+ then
+ Error_Msg_N ("dynamically tagged expression not allowed!", Expr);
+ end if;
+ end Check_Dynamically_Tagged_Expression;
+
--------------------------
-- Check_Fully_Declared --
--------------------------
("premature usage of incomplete}", N, First_Subtype (T));
end if;
+ -- Need comments for these tests ???
+
elsif Has_Private_Component (T)
and then not Is_Generic_Type (Root_Type (T))
- and then not In_Default_Expression
+ and then not In_Spec_Expression
then
-
-- Special case: if T is the anonymous type created for a single
-- task or protected object, use the name of the source object.
procedure Check_Nested_Access (Ent : Entity_Id) is
Scop : constant Entity_Id := Current_Scope;
Current_Subp : Entity_Id;
+ Enclosing : Entity_Id;
begin
-- Currently only enabled for VM back-ends for efficiency, should we
-- enable it more systematically ???
+ -- Check for Is_Imported needs commenting below ???
+
if VM_Target /= No_VM
and then (Ekind (Ent) = E_Variable
or else
Ekind (Ent) = E_Loop_Parameter)
and then Scope (Ent) /= Empty
and then not Is_Library_Level_Entity (Ent)
+ and then not Is_Imported (Ent)
then
if Is_Subprogram (Scop)
or else Is_Generic_Subprogram (Scop)
Current_Subp := Current_Subprogram;
end if;
- if Enclosing_Subprogram (Ent) /= Current_Subp then
+ Enclosing := Enclosing_Subprogram (Ent);
+
+ if Enclosing /= Empty
+ and then Enclosing /= Current_Subp
+ then
Set_Has_Up_Level_Access (Ent, True);
end if;
end if;
end loop;
end Check_Potentially_Blocking_Operation;
+ ------------------------------
+ -- Check_Unprotected_Access --
+ ------------------------------
+
+ procedure Check_Unprotected_Access
+ (Context : Node_Id;
+ Expr : Node_Id)
+ is
+ Cont_Encl_Typ : Entity_Id;
+ Pref_Encl_Typ : Entity_Id;
+
+ function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id;
+ -- Check whether Obj is a private component of a protected object.
+ -- Return the protected type where the component resides, Empty
+ -- otherwise.
+
+ function Is_Public_Operation return Boolean;
+ -- Verify that the enclosing operation is callable from outside the
+ -- protected object, to minimize false positives.
+
+ ------------------------------
+ -- Enclosing_Protected_Type --
+ ------------------------------
+
+ function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id is
+ begin
+ if Is_Entity_Name (Obj) then
+ declare
+ Ent : Entity_Id := Entity (Obj);
+
+ begin
+ -- The object can be a renaming of a private component, use
+ -- the original record component.
+
+ if Is_Prival (Ent) then
+ Ent := Prival_Link (Ent);
+ end if;
+
+ if Is_Protected_Type (Scope (Ent)) then
+ return Scope (Ent);
+ end if;
+ end;
+ end if;
+
+ -- For indexed and selected components, recursively check the prefix
+
+ if Nkind_In (Obj, N_Indexed_Component, N_Selected_Component) then
+ return Enclosing_Protected_Type (Prefix (Obj));
+
+ -- The object does not denote a protected component
+
+ else
+ return Empty;
+ end if;
+ end Enclosing_Protected_Type;
+
+ -------------------------
+ -- Is_Public_Operation --
+ -------------------------
+
+ function Is_Public_Operation return Boolean is
+ S : Entity_Id;
+ E : Entity_Id;
+
+ begin
+ S := Current_Scope;
+ while Present (S)
+ and then S /= Pref_Encl_Typ
+ loop
+ if Scope (S) = Pref_Encl_Typ then
+ E := First_Entity (Pref_Encl_Typ);
+ while Present (E)
+ and then E /= First_Private_Entity (Pref_Encl_Typ)
+ loop
+ if E = S then
+ return True;
+ end if;
+ Next_Entity (E);
+ end loop;
+ end if;
+
+ S := Scope (S);
+ end loop;
+
+ return False;
+ end Is_Public_Operation;
+
+ -- Start of processing for Check_Unprotected_Access
+
+ begin
+ if Nkind (Expr) = N_Attribute_Reference
+ and then Attribute_Name (Expr) = Name_Unchecked_Access
+ then
+ Cont_Encl_Typ := Enclosing_Protected_Type (Context);
+ Pref_Encl_Typ := Enclosing_Protected_Type (Prefix (Expr));
+
+ -- Check whether we are trying to export a protected component to a
+ -- context with an equal or lower access level.
+
+ if Present (Pref_Encl_Typ)
+ and then No (Cont_Encl_Typ)
+ and then Is_Public_Operation
+ and then Scope_Depth (Pref_Encl_Typ) >=
+ Object_Access_Level (Context)
+ then
+ Error_Msg_N
+ ("?possible unprotected access to protected data", Expr);
+ end if;
+ end if;
+ end Check_Unprotected_Access;
+
---------------
-- Check_VMS --
---------------
end if;
end Check_VMS;
- ---------------------------------
- -- Collect_Abstract_Interfaces --
- ---------------------------------
+ ------------------------
+ -- Collect_Interfaces --
+ ------------------------
- procedure Collect_Abstract_Interfaces
- (T : Entity_Id;
- Ifaces_List : out Elist_Id;
- Exclude_Parent_Interfaces : Boolean := False;
- Use_Full_View : Boolean := True)
+ procedure Collect_Interfaces
+ (T : Entity_Id;
+ Ifaces_List : out Elist_Id;
+ Exclude_Parents : 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
-
procedure Collect (Typ : Entity_Id);
-- Subsidiary subprogram used to traverse the whole list
-- of directly and indirectly implemented interfaces
- 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.
-
- -------------------
- -- Add_Interface --
- -------------------
-
- procedure Add_Interface (Iface : Entity_Id) is
- Elmt : Elmt_Id;
-
- begin
- Elmt := First_Elmt (Ifaces_List);
- while Present (Elmt) and then Node (Elmt) /= Iface loop
- Next_Elmt (Elmt);
- end loop;
-
- if No (Elmt) then
- Append_Elmt (Iface, Ifaces_List);
- end if;
- end Add_Interface;
-
-------------
-- Collect --
-------------
procedure Collect (Typ : Entity_Id) is
Ancestor : Entity_Id;
Full_T : Entity_Id;
- Iface_List : List_Id;
Id : Node_Id;
Iface : Entity_Id;
Full_T := Full_View (Typ);
end if;
- Iface_List := Abstract_Interface_List (Full_T);
-
-- Include the ancestor if we are generating the whole list of
-- abstract interfaces.
- -- In concurrent types the ancestor interface (if any) is the
- -- first element of the list of interface types.
-
- 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);
-
- if not Exclude_Parent_Interfaces then
- Add_Interface (Ancestor);
- end if;
- end if;
-
- elsif Etype (Full_T) /= Typ
+ if Etype (Full_T) /= Typ
-- Protect the frontend against wrong sources. For example:
Collect (Ancestor);
if Is_Interface (Ancestor)
- and then not Exclude_Parent_Interfaces
+ and then not Exclude_Parents
then
- Add_Interface (Ancestor);
+ Append_Unique_Elmt (Ancestor, Ifaces_List);
end if;
end if;
-- Traverse the graph of ancestor interfaces
- if Is_Non_Empty_List (Iface_List) then
- Id := First (Iface_List);
-
- -- 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
- Next (Id);
- end if;
-
+ if Is_Non_Empty_List (Abstract_Interface_List (Full_T)) then
+ Id := First (Abstract_Interface_List (Full_T));
while Present (Id) loop
Iface := Etype (Id);
-- 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)
+ if Exclude_Parents
+ and then Etype (T) /= T
+ and then Interface_Present_In_Ancestor (Etype (T), Iface)
then
null;
else
- Collect (Iface);
- Add_Interface (Iface);
+ Collect (Iface);
+ Append_Unique_Elmt (Iface, Ifaces_List);
end if;
end if;
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
+ -- Start of processing for Collect_Interfaces
begin
pragma Assert (Is_Tagged_Type (T) or else Is_Concurrent_Type (T));
Ifaces_List := New_Elmt_List;
Collect (T);
- end Collect_Abstract_Interfaces;
+ end Collect_Interfaces;
----------------------------------
-- Collect_Interface_Components --
-------------
procedure Collect (Typ : Entity_Id) is
- Tag_Comp : Entity_Id;
+ Tag_Comp : Entity_Id;
+ Parent_Typ : Entity_Id;
begin
- if Etype (Typ) /= Typ
+ -- Handle private types
+
+ if Present (Full_View (Etype (Typ))) then
+ Parent_Typ := Full_View (Etype (Typ));
+ else
+ Parent_Typ := Etype (Typ);
+ end if;
+
+ if Parent_Typ /= Typ
-- Protect the frontend against wrong sources. For example:
-- type C is new B with null record;
-- end P;
- and then Etype (Typ) /= Tagged_Type
+ and then Parent_Typ /= Tagged_Type
then
- Collect (Etype (Typ));
+ Collect (Parent_Typ);
end if;
-- Collect the components containing tags of secondary dispatch
Tag_Comp := Next_Tag_Component (First_Tag_Component (Typ));
while Present (Tag_Comp) loop
- pragma Assert (Present (Related_Interface (Tag_Comp)));
+ pragma Assert (Present (Related_Type (Tag_Comp)));
Append_Elmt (Tag_Comp, Components_List);
Tag_Comp := Next_Tag_Component (Tag_Comp);
ADT : Elmt_Id;
begin
- ADT := Next_Elmt (First_Elmt (Access_Disp_Table (T)));
+ ADT := Next_Elmt (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
+ and then Related_Type (Node (ADT)) /= Iface
loop
+ -- Skip the secondary dispatch tables of Iface
+
+ Next_Elmt (ADT);
+ Next_Elmt (ADT);
+ Next_Elmt (ADT);
Next_Elmt (ADT);
end loop;
-- Start of processing for Collect_Interfaces_Info
begin
- Collect_Abstract_Interfaces (T, Ifaces_List);
+ Collect_Interfaces (T, Ifaces_List);
Collect_Interface_Components (T, Comps_List);
-- Search for the record component and tag associated with each
-- 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
+ if Is_Ancestor (Iface, T) then
Append_Elmt (First_Tag_Component (T), Components_List);
Append_Elmt (Node (First_Elmt (Access_Disp_Table (T))), Tags_List);
else
Comp_Elmt := First_Elmt (Comps_List);
while Present (Comp_Elmt) loop
- Comp_Iface := Related_Interface (Node (Comp_Elmt));
+ Comp_Iface := Related_Type (Node (Comp_Elmt));
if Comp_Iface = Iface
- or else Is_Parent (Iface, Comp_Iface)
+ or else Is_Ancestor (Iface, Comp_Iface)
then
Append_Elmt (Node (Comp_Elmt), Components_List);
Append_Elmt (Search_Tag (Comp_Iface), Tags_List);
end if;
end Conditional_Delay;
+ -------------------------
+ -- Copy_Parameter_List --
+ -------------------------
+
+ function Copy_Parameter_List (Subp_Id : Entity_Id) return List_Id is
+ Loc : constant Source_Ptr := Sloc (Subp_Id);
+ Plist : List_Id;
+ Formal : Entity_Id;
+
+ begin
+ if No (First_Formal (Subp_Id)) then
+ return No_List;
+ else
+ Plist := New_List;
+ Formal := First_Formal (Subp_Id);
+ while Present (Formal) loop
+ Append
+ (Make_Parameter_Specification (Loc,
+ Defining_Identifier =>
+ Make_Defining_Identifier (Sloc (Formal),
+ Chars => Chars (Formal)),
+ In_Present => In_Present (Parent (Formal)),
+ Out_Present => Out_Present (Parent (Formal)),
+ Parameter_Type =>
+ New_Reference_To (Etype (Formal), Loc),
+ Expression =>
+ New_Copy_Tree (Expression (Parent (Formal)))),
+ Plist);
+
+ Next_Formal (Formal);
+ end loop;
+ end if;
+
+ return Plist;
+ end Copy_Parameter_List;
+
--------------------
-- Current_Entity --
--------------------
function Current_Subprogram return Entity_Id is
Scop : constant Entity_Id := Current_Scope;
-
begin
if Is_Subprogram (Scop) or else Is_Generic_Subprogram (Scop) then
return Scop;
end Denotes_Discriminant;
+ ----------------------
+ -- Denotes_Variable --
+ ----------------------
+
+ function Denotes_Variable (N : Node_Id) return Boolean is
+ begin
+ return Is_Variable (N) and then Paren_Count (N) = 0;
+ end Denotes_Variable;
+
-----------------------------
-- Depends_On_Discriminant --
-----------------------------
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);
then
return;
- elsif Is_Private_Component_Renaming (Parent (Def_Id)) then
+ -- If the homograph is a protected component renaming, it should not
+ -- be hiding the current entity. Such renamings are treated as weak
+ -- declarations.
+
+ elsif Is_Prival (E) then
+ Set_Is_Immediately_Visible (E, False);
+
+ -- In this case the current entity is a protected component renaming.
+ -- Perform minimal decoration by setting the scope and return since
+ -- the prival should not be hiding other visible entities.
+
+ elsif Is_Prival (Def_Id) then
+ Set_Scope (Def_Id, Current_Scope);
+ return;
+
+ -- Analogous to privals, the discriminal generated for an entry
+ -- index parameter acts as a weak declaration. Perform minimal
+ -- decoration to avoid bogus errors.
+
+ elsif Is_Discriminal (Def_Id)
+ and then Ekind (Discriminal_Link (Def_Id)) = E_Entry_Index_Parameter
+ then
+ Set_Scope (Def_Id, Current_Scope);
return;
-- In the body or private part of an instance, a type extension
-- of the full type with two components of the same name are not
-- clear at this point ???
- elsif In_Instance_Not_Visible then
+ elsif In_Instance_Not_Visible then
null;
-- When compiling a package body, some child units may have become
and then Nkind (Parent (Def_Id)) = N_Private_Type_Declaration
then
Error_Msg_N
- ("incomplete type cannot be completed" &
- " with a private declaration",
- Parent (Def_Id));
+ ("incomplete type cannot be completed with a private " &
+ "declaration", Parent (Def_Id));
Set_Is_Immediately_Visible (E, False);
Set_Full_View (E, Def_Id);
+ -- An inherited component of a record conflicts with a new
+ -- discriminant. The discriminant is inserted first in the scope,
+ -- but the error should be posted on it, not on the component.
+
elsif Ekind (E) = E_Discriminant
and then Present (Scope (Def_Id))
and then Scope (Def_Id) /= Current_Scope
then
- -- An inherited component of a record conflicts with
- -- a new discriminant. The discriminant is inserted first
- -- in the scope, but the error should be posted on it, not
- -- on the component.
-
Error_Msg_Sloc := Sloc (Def_Id);
Error_Msg_N ("& conflicts with declaration#", E);
return;
end if;
end if;
- if Nkind (Parent (Parent (Def_Id)))
- = N_Generic_Subprogram_Declaration
+ if Nkind (Parent (Parent (Def_Id))) =
+ N_Generic_Subprogram_Declaration
and then Def_Id =
Defining_Entity (Specification (Parent (Parent (Def_Id))))
then
and then Length_Of_Name (Chars (C)) /= 1
- -- Don't warn for non-source eneities
+ -- Don't warn for non-source entities
and then Comes_From_Source (C)
and then Comes_From_Source (Def_Id)
end if;
end Explain_Limited_Type;
- ----------------------
- -- Find_Actual_Mode --
- ----------------------
+ -----------------
+ -- Find_Actual --
+ -----------------
- procedure Find_Actual_Mode
- (N : Node_Id;
- Kind : out Entity_Kind;
- Call : out Node_Id)
+ procedure Find_Actual
+ (N : Node_Id;
+ Formal : out Entity_Id;
+ Call : out Node_Id)
is
Parnt : constant Node_Id := Parent (N);
- Formal : Entity_Id;
Actual : Node_Id;
begin
Nkind (Parnt) = N_Selected_Component)
and then N = Prefix (Parnt)
then
- Find_Actual_Mode (Parnt, Kind, Call);
+ Find_Actual (Parnt, Formal, Call);
return;
elsif Nkind (Parnt) = N_Parameter_Association
Call := Parnt;
else
- Kind := E_Void;
- Call := Empty;
+ Formal := Empty;
+ Call := Empty;
return;
end if;
- -- If we have a call to a subprogram look for the parametere
+ -- If we have a call to a subprogram look for the parameter. Note that
+ -- we exclude overloaded calls, since we don't know enough to be sure
+ -- of giving the right answer in this case.
if Is_Entity_Name (Name (Call))
and then Present (Entity (Name (Call)))
and then Is_Overloadable (Entity (Name (Call)))
+ and then not Is_Overloaded (Name (Call))
then
-- Fall here if we are definitely a parameter
Formal := First_Formal (Entity (Name (Call)));
while Present (Formal) and then Present (Actual) loop
if Actual = N then
- Kind := Ekind (Formal);
return;
else
Actual := Next_Actual (Actual);
-- Fall through here if we did not find matching actual
- Kind := E_Void;
- Call := Empty;
- end Find_Actual_Mode;
+ Formal := Empty;
+ Call := Empty;
+ end Find_Actual;
-------------------------------------
-- Find_Corresponding_Discriminant --
end Find_Corresponding_Discriminant;
--------------------------
- -- Find_Overlaid_Object --
+ -- Find_Overlaid_Entity --
--------------------------
- function Find_Overlaid_Object (N : Node_Id) return Entity_Id is
- Expr : Node_Id;
+ procedure Find_Overlaid_Entity
+ (N : Node_Id;
+ Ent : out Entity_Id;
+ Off : out Boolean)
+ is
+ Expr : Node_Id;
begin
-- We are looking for one of the two following forms:
-- In the second case, the expr is either Y'Address, or recursively a
-- constant that eventually references Y'Address.
+ Ent := Empty;
+ Off := False;
+
if Nkind (N) = N_Attribute_Definition_Clause
and then Chars (N) = Name_Address
then
- -- This loop checks the form of the expression for Y'Address where Y
- -- is an object entity name. The first loop checks the original
- -- expression in the attribute definition clause. Subsequent loops
- -- check referenced constants.
-
Expr := Expression (N);
+
+ -- This loop checks the form of the expression for Y'Address,
+ -- using recursion to deal with intermediate constants.
+
loop
- -- Check for Y'Address where Y is an object entity
+ -- Check for Y'Address
if Nkind (Expr) = N_Attribute_Reference
and then Attribute_Name (Expr) = Name_Address
- and then Is_Entity_Name (Prefix (Expr))
- and then Is_Object (Entity (Prefix (Expr)))
then
- return Entity (Prefix (Expr));
+ Expr := Prefix (Expr);
+ exit;
-- Check for Const where Const is a constant entity
-- Anything else does not need checking
else
- exit;
+ return;
end if;
end loop;
- end if;
- return Empty;
- end Find_Overlaid_Object;
+ -- This loop checks the form of the prefix for an entity,
+ -- using recursion to deal with intermediate components.
- --------------------------------------------
- -- Find_Overridden_Synchronized_Primitive --
- --------------------------------------------
+ loop
+ -- Check for Y where Y is an entity
- 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.
+ if Is_Entity_Name (Expr) then
+ Ent := Entity (Expr);
+ return;
- -------------------------
- -- Find_Parameter_Type --
- -------------------------
+ -- Check for components
- function Find_Parameter_Type (Param : Node_Id) return Entity_Id is
- begin
- pragma Assert (Nkind (Param) = N_Parameter_Specification);
+ elsif
+ Nkind_In (Expr, N_Selected_Component, N_Indexed_Component) then
- if Nkind (Parameter_Type (Param)) = N_Access_Definition then
- return Etype (Subtype_Mark (Parameter_Type (Param)));
+ Expr := Prefix (Expr);
+ Off := True;
- else
- return Etype (Parameter_Type (Param));
- end if;
- end Find_Parameter_Type;
+ -- Anything else does not need checking
- -----------------------------
- -- Has_Correct_Formal_Mode --
- -----------------------------
+ else
+ return;
+ end if;
+ end loop;
+ end if;
+ end Find_Overlaid_Entity;
- function Has_Correct_Formal_Mode (Subp : Entity_Id) return Boolean is
- Param : Node_Id;
+ -------------------------
+ -- Find_Parameter_Type --
+ -------------------------
- 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;
+ function Find_Parameter_Type (Param : Node_Id) return Entity_Id is
+ begin
+ if Nkind (Param) /= N_Parameter_Specification then
+ return Empty;
- -- 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.
+ -- For an access parameter, obtain the type from the formal entity
+ -- itself, because access to subprogram nodes do not carry a type.
+ -- Shouldn't we always use the formal entity ???
- return True;
- end Has_Correct_Formal_Mode;
+ elsif Nkind (Parameter_Type (Param)) = N_Access_Definition then
+ return Etype (Defining_Identifier (Param));
- -----------------------------------
- -- Matches_Prefixed_View_Profile --
- -----------------------------------
+ else
+ return Etype (Parameter_Type (Param));
+ end if;
+ end Find_Parameter_Type;
- 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;
+ -----------------------------
+ -- Find_Static_Alternative --
+ -----------------------------
- function Is_Implemented (Iface : Entity_Id) return Boolean;
- -- Determine if Iface is implemented by the current task or
- -- protected type.
+ function Find_Static_Alternative (N : Node_Id) return Node_Id is
+ Expr : constant Node_Id := Expression (N);
+ Val : constant Uint := Expr_Value (Expr);
+ Alt : Node_Id;
+ Choice : Node_Id;
- --------------------
- -- Is_Implemented --
- --------------------
+ begin
+ Alt := First (Alternatives (N));
- function Is_Implemented (Iface : Entity_Id) return Boolean is
- Iface_Elmt : Elmt_Id;
+ Search : loop
+ if Nkind (Alt) /= N_Pragma then
+ Choice := First (Discrete_Choices (Alt));
+ while Present (Choice) loop
- begin
- Iface_Elmt := First_Elmt (Ifaces_List);
- while Present (Iface_Elmt) loop
- if Node (Iface_Elmt) = Iface then
- return True;
- end if;
+ -- Others choice, always matches
- Next_Elmt (Iface_Elmt);
- end loop;
+ if Nkind (Choice) = N_Others_Choice then
+ exit Search;
- return False;
- end Is_Implemented;
+ -- Range, check if value is in the range
- -- 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 --
- -----------------------------
-
- function Find_Static_Alternative (N : Node_Id) return Node_Id is
- Expr : constant Node_Id := Expression (N);
- Val : constant Uint := Expr_Value (Expr);
- Alt : Node_Id;
- Choice : Node_Id;
-
- begin
- Alt := First (Alternatives (N));
-
- Search : loop
- if Nkind (Alt) /= N_Pragma then
- Choice := First (Discrete_Choices (Alt));
- while Present (Choice) loop
-
- -- Others choice, always matches
-
- if Nkind (Choice) = N_Others_Choice then
- exit Search;
-
- -- Range, check if value is in the range
-
- elsif Nkind (Choice) = N_Range then
- exit Search when
- Val >= Expr_Value (Low_Bound (Choice))
- and then
- Val <= Expr_Value (High_Bound (Choice));
+ elsif Nkind (Choice) = N_Range then
+ exit Search when
+ Val >= Expr_Value (Low_Bound (Choice))
+ and then
+ Val <= Expr_Value (High_Bound (Choice));
-- Choice is a subtype name. Note that we know it must
-- be a static subtype, since otherwise it would have
elsif Is_Entity_Name (Choice)
and then Is_Type (Entity (Choice))
then
- exit Search when Is_In_Range (Expr, Etype (Choice));
+ exit Search when Is_In_Range (Expr, Etype (Choice),
+ Assume_Valid => False);
-- Choice is a subtype indication
begin
Res := Internal_Full_Qualified_Name (E);
- Store_String_Char (Get_Char_Code (ASCII.nul));
+ Store_String_Char (Get_Char_Code (ASCII.NUL));
return End_String;
end Full_Qualified_Name;
and then not Has_Unknown_Discriminants (Utyp)
and then not (Ekind (Utyp) = E_String_Literal_Subtype)
then
- -- Nothing to do if in default expression
+ -- Nothing to do if in spec expression (why not???)
- if In_Default_Expression then
+ if In_Spec_Expression then
return Typ;
elsif Is_Private_Type (Typ)
-- 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
+ if Is_Standard_Character_Type (T) then
Set_Character_Literal_Name (UI_To_CC (Pos));
return
Make_Character_Literal (Loc,
return Entity_Id (Get_Name_Table_Info (Id));
end Get_Name_Entity_Id;
+ -------------------
+ -- Get_Pragma_Id --
+ -------------------
+
+ function Get_Pragma_Id (N : Node_Id) return Pragma_Id is
+ begin
+ return Get_Pragma_Id (Pragma_Name (N));
+ end Get_Pragma_Id;
+
---------------------------
-- Get_Referenced_Object --
---------------------------
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
+ -- 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.
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 --
-----------------------
Comp : Entity_Id;
begin
+ -- Loop to Check components
+
Comp := First_Component_Or_Discriminant (Typ);
while Present (Comp) loop
- if Has_Access_Values (Etype (Comp)) then
+
+ -- Check for access component, tag field does not count, even
+ -- though it is implemented internally using an access type.
+
+ if Has_Access_Values (Etype (Comp))
+ and then Chars (Comp) /= Name_uTag
+ then
return True;
end if;
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).
+ -- Holds the current status of the result. Note that once a value of
+ -- Known_Incompatible is set, it is sticky and does not get changed
+ -- to Unknown (the value in Result only gets worse as we go along,
+ -- never better).
- 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.
+ Offs : Uint := No_Uint;
+ -- Set to a factor of the offset from the base object when Expr is a
+ -- selected or indexed component, based on Component_Bit_Offset and
+ -- Component_Size respectively. A negative value is used to represent
+ -- a value which is not known at compile time.
procedure Check_Prefix;
-- Checks the prefix recursively in the case where the expression
-- 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 --
------------------
Set_Result (Unknown);
end if;
- -- Check possible bad component offset and check prefix
+ -- Check prefix and component offset
- Check_Offset
- (Component_Bit_Offset (Entity (Selector_Name (Expr))));
Check_Prefix;
+ Offs := Component_Bit_Offset (Entity (Selector_Name (Expr)));
-- If Expr is an indexed component, we must make sure there is no
-- potentially troublesome Component_Size clause and that the array
-- is not bit-packed.
elsif Nkind (Expr) = N_Indexed_Component then
+ declare
+ Typ : constant Entity_Id := Etype (Prefix (Expr));
+ Ind : constant Node_Id := First_Index (Typ);
- -- Bit packed array always generates unknown alignment
+ begin
+ -- Bit packed array always generates unknown alignment
- if Is_Bit_Packed_Array (Etype (Prefix (Expr))) then
- Set_Result (Unknown);
- end if;
+ if Is_Bit_Packed_Array (Typ) then
+ Set_Result (Unknown);
+ end if;
- -- Check possible bad component size and check prefix
+ -- Check prefix and component offset
- Check_Offset (Component_Size (Etype (Prefix (Expr))));
- Check_Prefix;
+ Check_Prefix;
+ Offs := Component_Size (Typ);
+
+ -- Small optimization: compute the full offset when possible
+
+ if Offs /= No_Uint
+ and then Offs > Uint_0
+ and then Present (Ind)
+ and then Nkind (Ind) = N_Range
+ and then Compile_Time_Known_Value (Low_Bound (Ind))
+ and then Compile_Time_Known_Value (First (Expressions (Expr)))
+ then
+ Offs := Offs * (Expr_Value (First (Expressions (Expr)))
+ - Expr_Value (Low_Bound ((Ind))));
+ end if;
+ end;
end if;
+ -- If we have a null offset, the result is entirely determined by
+ -- the base object and has already been computed recursively.
+
+ if Offs = Uint_0 then
+ null;
+
-- Case where we know the alignment of the object
- if Known_Alignment (Obj) then
+ elsif Known_Alignment (Obj) then
declare
ObjA : constant Uint := Alignment (Obj);
- ExpA : Uint := No_Uint;
- SizA : Uint := No_Uint;
+ ExpA : Uint := No_Uint;
+ SizA : Uint := No_Uint;
begin
-- If alignment of Obj is 1, then we are always OK
-- Alignment of Obj is greater than 1, so we need to check
else
- -- See if Expr is an object with known alignment
+ -- If we have an offset, see if it is compatible
+
+ if Offs /= No_Uint and Offs > Uint_0 then
+ if Offs mod (System_Storage_Unit * ObjA) /= 0 then
+ Set_Result (Known_Incompatible);
+ end if;
- if Is_Entity_Name (Expr)
+ -- See if Expr is an object with known alignment
+
+ elsif Is_Entity_Name (Expr)
and then Known_Alignment (Entity (Expr))
then
ExpA := Alignment (Entity (Expr));
elsif Known_Alignment (Etype (Expr)) then
ExpA := Alignment (Etype (Expr));
+
+ -- Otherwise the alignment is unknown
+
+ else
+ Set_Result (Default);
end if;
-- If we got an alignment, see if it is acceptable
- if ExpA /= No_Uint then
- if ExpA < ObjA then
- Set_Result (Known_Incompatible);
- end if;
+ if ExpA /= No_Uint and then ExpA < ObjA then
+ Set_Result (Known_Incompatible);
+ end if;
- -- Case of Expr alignment unknown
+ -- If Expr is not a piece of a larger object, see if size
+ -- is given. If so, check that it is not too small for the
+ -- required alignment.
- else
- Set_Result (Default);
- end if;
+ if Offs /= No_Uint then
+ null;
- -- 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
+ -- See if Expr is an object with known size
- if Is_Entity_Name (Expr)
+ elsif Is_Entity_Name (Expr)
and then Known_Static_Esize (Entity (Expr))
then
SizA := Esize (Entity (Expr));
end if;
end;
+ -- If we do not know required alignment, any non-zero offset is a
+ -- potential problem (but certainly may be OK, so result is unknown).
+
+ elsif Offs /= No_Uint then
+ Set_Result (Unknown);
+
-- If we can't find the result by direct comparison of alignment
-- values, then there is still one case that we can determine known
-- result, and that is when we can determine that the types are the
if Known_Alignment (Entity (Expr))
and then
- UI_To_Int (Alignment (Entity (Expr)))
- < Ttypes.Maximum_Alignment
+ 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
+ -- even multiple of Maximum_Alignment is also worrisome
-- since it may cause the alignment of the object to be less
-- than the alignment of the type.
and then
(UI_To_Int (Esize (Entity (Expr))) mod
(Ttypes.Maximum_Alignment * Ttypes.System_Storage_Unit))
- /= 0
+ /= 0
then
Set_Result (Unknown);
-- Unknown, since that result will be set in any case.
elsif Default /= Unknown
- and then (Has_Size_Clause (Etype (Expr))
+ and then (Has_Size_Clause (Etype (Expr))
or else
Has_Alignment_Clause (Etype (Expr)))
then
----------------------
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;
+ begin
+ return Nkind_In (Nkind (N), N_Accept_Statement,
+ N_Block_Statement,
+ N_Compilation_Unit_Aux,
+ N_Entry_Body,
+ N_Package_Body,
+ N_Protected_Body,
+ N_Subprogram_Body,
+ N_Task_Body,
+ N_Package_Specification);
end Has_Declarations;
-------------------------------------------
and then Includes_Infinities (Scalar_Range (E));
end Has_Infinities;
- ------------------------
- -- Has_Null_Exclusion --
- ------------------------
+ --------------------
+ -- Has_Interfaces --
+ --------------------
+
+ function Has_Interfaces
+ (T : Entity_Id;
+ Use_Full_View : Boolean := True) return Boolean
+ is
+ Typ : Entity_Id;
- 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);
+ -- Handle concurrent types
- 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;
+ if Is_Concurrent_Type (T) then
+ Typ := Corresponding_Record_Type (T);
+ else
+ Typ := T;
+ end if;
- when N_Discriminant_Specification =>
- if Nkind (Discriminant_Type (N)) = N_Access_Definition then
- return Null_Exclusion_Present (Discriminant_Type (N));
- else
+ if not Present (Typ)
+ or else not Is_Record_Type (Typ)
+ or else not Is_Tagged_Type (Typ)
+ then
+ return False;
+ end if;
+
+ -- Handle private types
+
+ if Use_Full_View
+ and then Present (Full_View (Typ))
+ then
+ Typ := Full_View (Typ);
+ end if;
+
+ -- Handle concurrent record types
+
+ if Is_Concurrent_Record_Type (Typ)
+ and then Is_Non_Empty_List (Abstract_Interface_List (Typ))
+ then
+ return True;
+ end if;
+
+ loop
+ if Is_Interface (Typ)
+ or else
+ (Is_Record_Type (Typ)
+ and then Present (Interfaces (Typ))
+ and then not Is_Empty_Elmt_List (Interfaces (Typ)))
+ then
+ return True;
+ end if;
+
+ exit when Etype (Typ) = Typ
+
+ -- Handle private types
+
+ or else (Present (Full_View (Etype (Typ)))
+ and then Full_View (Etype (Typ)) = Typ)
+
+ -- Protect the frontend against wrong source with cyclic
+ -- derivations
+
+ or else Etype (Typ) = T;
+
+ -- Climb to the ancestor type handling private types
+
+ if Present (Full_View (Etype (Typ))) then
+ Typ := Full_View (Etype (Typ));
+ else
+ Typ := Etype (Typ);
+ end if;
+ end loop;
+
+ return False;
+ end Has_Interfaces;
+
+ ------------------------
+ -- Has_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;
end if;
end Has_Null_Extension;
+ -------------------------------
+ -- Has_Overriding_Initialize --
+ -------------------------------
+
+ function Has_Overriding_Initialize (T : Entity_Id) return Boolean is
+ BT : constant Entity_Id := Base_Type (T);
+ Comp : Entity_Id;
+ P : Elmt_Id;
+
+ begin
+ if Is_Controlled (BT) then
+
+ -- For derived types, check immediate ancestor, excluding
+ -- Controlled itself.
+
+ if Is_Derived_Type (BT)
+ and then not In_Predefined_Unit (Etype (BT))
+ and then Has_Overriding_Initialize (Etype (BT))
+ then
+ return True;
+
+ elsif Present (Primitive_Operations (BT)) then
+ P := First_Elmt (Primitive_Operations (BT));
+ while Present (P) loop
+ if Chars (Node (P)) = Name_Initialize
+ and then Comes_From_Source (Node (P))
+ then
+ return True;
+ end if;
+
+ Next_Elmt (P);
+ end loop;
+ end if;
+
+ return False;
+
+ elsif Has_Controlled_Component (BT) then
+ Comp := First_Component (BT);
+ while Present (Comp) loop
+ if Has_Overriding_Initialize (Etype (Comp)) then
+ return True;
+ end if;
+
+ Next_Component (Comp);
+ end loop;
+
+ return False;
+
+ else
+ return False;
+ end if;
+ end Has_Overriding_Initialize;
+
--------------------------------------
-- Has_Preelaborable_Initialization --
--------------------------------------
elsif Nkind (N) = N_Null then
return True;
- elsif Nkind (N) = N_Attribute_Reference
+ -- Attributes are allowed in general, even if their prefix is a
+ -- formal type. (It seems that certain attributes known not to be
+ -- static might not be allowed, but there are no rules to prevent
+ -- them.)
+
+ elsif Nkind (N) = N_Attribute_Reference then
+ return True;
+
+ -- The name of a discriminant evaluated within its parent type is
+ -- defined to be preelaborable (10.2.1(8)). Note that we test for
+ -- names that denote discriminals as well as discriminants to
+ -- catch references occurring within init procs.
+
+ elsif Is_Entity_Name (N)
and then
- (Attribute_Name (N) = Name_Access
- or else
- Attribute_Name (N) = Name_Unchecked_Access
- or else
- Attribute_Name (N) = Name_Unrestricted_Access)
+ (Ekind (Entity (N)) = E_Discriminant
+ or else
+ ((Ekind (Entity (N)) = E_Constant
+ or else Ekind (Entity (N)) = E_In_Parameter)
+ and then Present (Discriminal_Link (Entity (N)))))
then
return True;
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,
+ -- tag fields are examples of such entities. For these cases,
-- we just test the type of the entity.
if Present (Declaration_Node (Ent)) then
return Has_Preelaborable_Initialization (Base_Type (E));
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
elsif Is_Derived_Type (E) then
+ -- If the derived type is a private extension then it doesn't have
+ -- preelaborable initialization.
+
+ if Ekind (Base_Type (E)) = E_Record_Type_With_Private then
+ return False;
+ end if;
+
-- First check whether ancestor type has preelaborable initialization
Has_PE := Has_Preelaborable_Initialization (Etype (Base_Type (E)));
if Has_PE
and then Is_Controlled (E)
- and then Present (Primitive_Operations (E))
+ and then Has_Overriding_Initialize (E)
then
- declare
- P : Elmt_Id;
+ Has_PE := False;
+ end if;
- 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;
+ -- Private types not derived from a type having preelaborable init and
+ -- that are not marked with pragma Preelaborable_Initialization do not
+ -- have preelaborable initialization.
- Next_Elmt (P);
- end loop;
- end;
- end if;
+ elsif Is_Private_Type (E) then
+ return False;
-- Record type has PI if it is non private and all components have PI
return True;
end if;
- Comp := Next_Component (Typ);
+ Next_Component (Comp);
end loop;
return False;
end if;
end Has_Tagged_Component;
+ --------------------------
+ -- Implements_Interface --
+ --------------------------
+
+ function Implements_Interface
+ (Typ_Ent : Entity_Id;
+ Iface_Ent : Entity_Id;
+ Exclude_Parents : Boolean := False) return Boolean
+ is
+ Ifaces_List : Elist_Id;
+ Elmt : Elmt_Id;
+ Iface : Entity_Id := Base_Type (Iface_Ent);
+ Typ : Entity_Id := Base_Type (Typ_Ent);
+
+ begin
+ if Is_Class_Wide_Type (Typ) then
+ Typ := Root_Type (Typ);
+ end if;
+
+ if not Has_Interfaces (Typ) then
+ return False;
+ end if;
+
+ if Is_Class_Wide_Type (Iface) then
+ Iface := Root_Type (Iface);
+ end if;
+
+ Collect_Interfaces (Typ, Ifaces_List);
+
+ Elmt := First_Elmt (Ifaces_List);
+ while Present (Elmt) loop
+ if Is_Ancestor (Node (Elmt), Typ)
+ and then Exclude_Parents
+ then
+ null;
+
+ elsif Node (Elmt) = Iface then
+ return True;
+ end if;
+
+ Next_Elmt (Elmt);
+ end loop;
+
+ return False;
+ end Implements_Interface;
+
-----------------
-- In_Instance --
-----------------
return False;
end In_Instance_Visible_Part;
- ----------------------
- -- In_Packiage_Body --
- ----------------------
+ ---------------------
+ -- In_Package_Body --
+ ---------------------
function In_Package_Body return Boolean is
S : Entity_Id;
return False;
end In_Package_Body;
+ --------------------------------
+ -- In_Parameter_Specification --
+ --------------------------------
+
+ function In_Parameter_Specification (N : Node_Id) return Boolean is
+ PN : Node_Id;
+
+ begin
+ PN := Parent (N);
+ while Present (PN) loop
+ if Nkind (PN) = N_Parameter_Specification then
+ return True;
+ end if;
+
+ PN := Parent (PN);
+ end loop;
+
+ return False;
+ end In_Parameter_Specification;
+
--------------------------------------
-- In_Subprogram_Or_Concurrent_Unit --
--------------------------------------
begin
Save_Interps (N, New_Prefix);
- Rewrite (N,
- Make_Explicit_Dereference (Sloc (N),
- Prefix => New_Prefix));
+
+ -- Check if the node relocation requires readjustment of some SCIL
+ -- dispatching node.
+
+ if Generate_SCIL
+ and then Nkind (N) = N_Function_Call
+ then
+ Adjust_SCIL_Node (N, New_Prefix);
+ end if;
+
+ Rewrite (N, Make_Explicit_Dereference (Sloc (N), Prefix => New_Prefix));
Set_Etype (N, Designated_Type (Etype (New_Prefix)));
if Is_Overloaded (New_Prefix) then
- -- The deference is also overloaded, and its interpretations are the
- -- designated types of the interpretations of the original node.
+ -- The dereference is also overloaded, and its interpretations are
+ -- the designated types of the interpretations of the original node.
Set_Etype (N, Any_Type);
end if;
end Insert_Explicit_Dereference;
+ ------------------------------------------
+ -- Inspect_Deferred_Constant_Completion --
+ ------------------------------------------
+
+ procedure Inspect_Deferred_Constant_Completion (Decls : List_Id) is
+ Decl : Node_Id;
+
+ begin
+ Decl := First (Decls);
+ while Present (Decl) loop
+
+ -- Deferred constant signature
+
+ if Nkind (Decl) = N_Object_Declaration
+ and then Constant_Present (Decl)
+ and then No (Expression (Decl))
+
+ -- No need to check internally generated constants
+
+ and then Comes_From_Source (Decl)
+
+ -- The constant is not completed. A full object declaration
+ -- or a pragma Import complete a deferred constant.
+
+ and then not Has_Completion (Defining_Identifier (Decl))
+ then
+ Error_Msg_N
+ ("constant declaration requires initialization expression",
+ Defining_Identifier (Decl));
+ end if;
+
+ Decl := Next (Decl);
+ end loop;
+ end Inspect_Deferred_Constant_Completion;
+
-------------------
-- Is_AAMP_Float --
-------------------
and then E = Base_Type (E);
end Is_AAMP_Float;
+ -----------------------------
+ -- Is_Actual_Out_Parameter --
+ -----------------------------
+
+ function Is_Actual_Out_Parameter (N : Node_Id) return Boolean is
+ Formal : Entity_Id;
+ Call : Node_Id;
+ begin
+ Find_Actual (N, Formal, Call);
+ return Present (Formal)
+ and then Ekind (Formal) = E_Out_Parameter;
+ end Is_Actual_Out_Parameter;
+
-------------------------
-- Is_Actual_Parameter --
-------------------------
and then not Is_Static_Coextension (N);
end Is_Coextension_Root;
+ -----------------------------
+ -- Is_Concurrent_Interface --
+ -----------------------------
+
+ function Is_Concurrent_Interface (T : Entity_Id) return Boolean is
+ begin
+ return
+ Is_Interface (T)
+ and then
+ (Is_Protected_Interface (T)
+ or else Is_Synchronized_Interface (T)
+ or else Is_Task_Interface (T));
+ end Is_Concurrent_Interface;
+
--------------------------------------
-- Is_Controlling_Limited_Procedure --
--------------------------------------
return False;
end Is_Controlling_Limited_Procedure;
+ -----------------------------
+ -- Is_CPP_Constructor_Call --
+ -----------------------------
+
+ function Is_CPP_Constructor_Call (N : Node_Id) return Boolean is
+ begin
+ return Nkind (N) = N_Function_Call
+ and then Is_CPP_Class (Etype (Etype (N)))
+ and then Is_Constructor (Entity (Name (N)))
+ and then Is_Imported (Entity (Name (N)));
+ end Is_CPP_Constructor_Call;
+
----------------------------------------------
-- Is_Dependent_Component_Of_Mutable_Object --
----------------------------------------------
elsif Ada_Version >= Ada_05 then
if Is_Access_Type (Prefix_Type) then
- Prefix_Type := Designated_Type (Prefix_Type);
+
+ -- If the access type is pool-specific, and there is no
+ -- constrained partial view of the designated type, then the
+ -- designated object is known to be constrained.
+
+ if Ekind (Prefix_Type) = E_Access_Type
+ and then not Has_Constrained_Partial_View
+ (Designated_Type (Prefix_Type))
+ then
+ return False;
+
+ -- Otherwise (general access type, or there is a constrained
+ -- partial view of the designated type), we need to check
+ -- based on the designated type.
+
+ else
+ Prefix_Type := Designated_Type (Prefix_Type);
+ end if;
end if;
end if;
T := Base_Type (Etyp);
end loop;
end if;
-
- raise Program_Error;
end Is_Descendent_Of;
--------------
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
+ -- Special VM case for tag components, which need to be
+ -- defined in this case, but are never initialized as VMs
-- are using other dispatching mechanisms. Ignore this
- -- uninitialized case.
+ -- uninitialized case. Note that this applies both to the
+ -- uTag entry and the main vtable pointer (CPP_Class case).
- and then (VM_Target = No_VM
- or else Chars (Ent) /= Name_uTag)
+ and then (Tagged_Type_Expansion or else not Is_Tag (Ent))
then
return False;
end if;
end if;
end Is_Fully_Initialized_Variant;
+ ------------
+ -- Is_LHS --
+ ------------
+
+ -- We seem to have a lot of overlapping functions that do similar things
+ -- (testing for left hand sides or lvalues???). Anyway, since this one is
+ -- purely syntactic, it should be in Sem_Aux I would think???
+
+ function Is_LHS (N : Node_Id) return Boolean is
+ P : constant Node_Id := Parent (N);
+ begin
+ return Nkind (P) = N_Assignment_Statement
+ and then Name (P) = N;
+ end Is_LHS;
+
----------------------------
-- Is_Inherited_Operation --
----------------------------
function Is_OK_Variable_For_Out_Formal (AV : Node_Id) return Boolean is
begin
- Note_Possible_Modification (AV);
+ Note_Possible_Modification (AV, Sure => True);
-- We must reject parenthesized variable names. The check for
-- Comes_From_Source is present because there are currently
if Is_Variable (Expression (AV))
and then Paren_Count (Expression (AV)) = 0
then
- Note_Possible_Modification (Expression (AV));
+ Note_Possible_Modification (Expression (AV), Sure => True);
return True;
-- We also allow a non-parenthesized expression that raises
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 --
-----------------------------------
Indx : Node_Id;
begin
- -- For private type, test corrresponding full type
+ -- For private type, test corresponding full type
if Is_Private_Type (T) then
return Is_Potentially_Persistent_Type (Full_View (T));
end if;
end Is_Potentially_Persistent_Type;
- -----------------------------
- -- Is_RCI_Pkg_Spec_Or_Body --
- -----------------------------
+ ---------------------------------
+ -- Is_Protected_Self_Reference --
+ ---------------------------------
- function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
+ function Is_Protected_Self_Reference (N : Node_Id) return Boolean is
- function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
- -- Return True if the unit of Cunit is an RCI package declaration
+ function In_Access_Definition (N : Node_Id) return Boolean;
+ -- Returns true if N belongs to an access definition
- ---------------------------
+ --------------------------
+ -- In_Access_Definition --
+ --------------------------
+
+ function In_Access_Definition (N : Node_Id) return Boolean is
+ P : Node_Id;
+
+ begin
+ P := Parent (N);
+ while Present (P) loop
+ if Nkind (P) = N_Access_Definition then
+ return True;
+ end if;
+
+ P := Parent (P);
+ end loop;
+
+ return False;
+ end In_Access_Definition;
+
+ -- Start of processing for Is_Protected_Self_Reference
+
+ begin
+ -- Verify that prefix is analyzed and has the proper form. Note that
+ -- the attributes Elab_Spec, Elab_Body, and UET_Address, which also
+ -- produce the address of an entity, do not analyze their prefix
+ -- because they denote entities that are not necessarily visible.
+ -- Neither of them can apply to a protected type.
+
+ return Ada_Version >= Ada_05
+ and then Is_Entity_Name (N)
+ and then Present (Entity (N))
+ and then Is_Protected_Type (Entity (N))
+ and then In_Open_Scopes (Entity (N))
+ and then not In_Access_Definition (N);
+ end Is_Protected_Self_Reference;
+
+ -----------------------------
+ -- Is_RCI_Pkg_Spec_Or_Body --
+ -----------------------------
+
+ function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
+
+ function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
+ -- Return True if the unit of Cunit is an RCI package declaration
+
+ ---------------------------
-- Is_RCI_Pkg_Decl_Cunit --
---------------------------
function Is_Remote_Access_To_Class_Wide_Type
(E : Entity_Id) return Boolean
is
- D : Entity_Id;
-
- function Comes_From_Limited_Private_Type_Declaration
- (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 : 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)
- then
- return True;
- end if;
-
- if Nkind (N) = N_Private_Extension_Declaration then
- return
- Comes_From_Limited_Private_Type_Declaration (Etype (E))
- or else
- (Is_Remote_Types (Etype (E))
- and then Is_Limited_Record (Etype (E))
- and then Has_Private_Declaration (Etype (E)));
- end if;
-
- return False;
- end Comes_From_Limited_Private_Type_Declaration;
-
- -- Start of processing for Is_Remote_Access_To_Class_Wide_Type
-
begin
- if not (Is_Remote_Call_Interface (E)
- or else Is_Remote_Types (E))
- or else Ekind (E) /= E_General_Access_Type
- then
- return False;
- end if;
+ -- A remote access to class-wide type is a general access to object type
+ -- declared in the visible part of a Remote_Types or Remote_Call_
+ -- Interface unit.
- D := Designated_Type (E);
-
- if Ekind (D) /= E_Class_Wide_Type then
- return False;
- end if;
-
- return Comes_From_Limited_Private_Type_Declaration
- (Defining_Identifier (Parent (D)));
+ return Ekind (E) = E_General_Access_Type
+ and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
end Is_Remote_Access_To_Class_Wide_Type;
-----------------------------------------
return (Ekind (E) = E_Access_Subprogram_Type
or else (Ekind (E) = E_Record_Type
and then Present (Corresponding_Remote_Type (E))))
- and then (Is_Remote_Call_Interface (E)
- or else Is_Remote_Types (E));
+ and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
end Is_Remote_Access_To_Subprogram_Type;
--------------------
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.
+ -- Determine whether Nam is an entry. Traverse selectors if there are
+ -- nested selected components.
--------------
-- Is_Entry --
and then Present (Etype (Orig_Node))
and then Is_Access_Type (Etype (Orig_Node))
then
- return Is_Variable_Prefix (Original_Node (Prefix (N)))
+ -- Note that if the prefix is an explicit dereference that does not
+ -- come from source, we must check for a rewritten function call in
+ -- prefixed notation before other forms of rewriting, to prevent a
+ -- compiler crash.
+
+ return
+ (Nkind (Orig_Node) = N_Function_Call
+ and then not Is_Access_Constant (Etype (Prefix (N))))
or else
- (Nkind (Orig_Node) = N_Function_Call
- and then not Is_Access_Constant (Etype (Prefix (N))));
+ Is_Variable_Prefix (Original_Node (Prefix (N)));
-- A function call is never a variable
Last_Assignment_Only : Boolean := False)
is
begin
+ -- ??? do we have to worry about clearing cached checks?
+
if Is_Assignable (Ent) then
Set_Last_Assignment (Ent, Empty);
end if;
- if not Last_Assignment_Only and then Is_Object (Ent) then
- Kill_Checks (Ent);
- Set_Current_Value (Ent, Empty);
+ if Is_Object (Ent) then
+ if not Last_Assignment_Only then
+ Kill_Checks (Ent);
+ Set_Current_Value (Ent, Empty);
- if not Can_Never_Be_Null (Ent) then
- Set_Is_Known_Non_Null (Ent, False);
- 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);
+
+ -- Reset Is_Known_Valid unless type is always valid, or if we have
+ -- a loop parameter (loop parameters are always valid, since their
+ -- bounds are defined by the bounds given in the loop header).
- Set_Is_Known_Null (Ent, False);
+ if not Is_Known_Valid (Etype (Ent))
+ and then Ekind (Ent) /= E_Loop_Parameter
+ then
+ Set_Is_Known_Valid (Ent, False);
+ end if;
+ end if;
end if;
end Kill_Current_Values;
-- If scope is a package, also clear current values of all
-- private entities in the scope.
- if Ekind (S) = E_Package
- or else
- Ekind (S) = E_Generic_Package
- or else
- Is_Concurrent_Type (S)
+ if Is_Package_Or_Generic_Package (S)
+ or else Is_Concurrent_Type (S)
then
Kill_Current_Values_For_Entity_Chain (First_Private_Entity (S));
end if;
when N_Type_Conversion =>
return Known_To_Be_Assigned (P);
- -- All other references are definitely not knwon to be modifications
+ -- All other references are definitely not known to be modifications
when others =>
return False;
when N_Assignment_Statement =>
return N = Name (P);
- -- Test prefix of component or attribute
+ -- Test prefix of component or attribute. Note that the prefix of an
+ -- explicit or implicit dereference cannot be an l-value.
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);
+ -- For an expanded name, the name is an lvalue if the expanded name
+ -- is an lvalue, but the prefix is never an lvalue, since it is just
+ -- the scope where the name is found.
+
+ when N_Expanded_Name =>
+ if N = Prefix (P) then
+ return May_Be_Lvalue (P);
+ else
+ return False;
+ end if;
+
+ -- For a selected component A.B, A is certainly an lvalue if A.B is.
+ -- B is a little interesting, if we have A.B := 3, there is some
+ -- discussion as to whether B is an lvalue or not, we choose to say
+ -- it is. Note however that A is not an lvalue if it is of an access
+ -- type since this is an implicit dereference.
+
+ when N_Selected_Component =>
+ if N = Prefix (P)
+ and then Present (Etype (N))
+ and then Is_Access_Type (Etype (N))
+ then
+ return False;
+ else
+ return May_Be_Lvalue (P);
+ end if;
+
+ -- For an indexed component or slice, the index or slice bounds is
+ -- never an lvalue. The prefix is an lvalue if the indexed component
+ -- or slice is an lvalue, except if it is an access type, where we
+ -- have an implicit dereference.
+
+ when N_Indexed_Component =>
+ if N /= Prefix (P)
+ or else (Present (Etype (N)) and then Is_Access_Type (Etype (N)))
+ then
+ return False;
+ else
+ return May_Be_Lvalue (P);
+ end if;
+
+ -- Prefix of a reference is an lvalue if the reference is an lvalue
+
+ when N_Reference =>
+ return May_Be_Lvalue (P);
+
+ -- Prefix of explicit dereference is never an lvalue
+
+ when N_Explicit_Dereference =>
+ return False;
-- Function call arguments are never lvalues
end loop;
end;
- -- Test for appearing in a conversion that itself appears
- -- in an lvalue context, since this should be an lvalue.
+ -- 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
+ -- Test for appearance in object renaming declaration
when N_Object_Renaming_Declaration =>
return True;
- -- All other references are definitely not Lvalues
+ -- All other references are definitely not lvalues
when others =>
return False;
-----------------------
procedure Mark_Coextensions (Context_Nod : Node_Id; Root_Nod : Node_Id) is
- Is_Dynamic : Boolean := False;
+ Is_Dynamic : Boolean;
+ -- Indicates whether the context causes nested coextensions to be
+ -- dynamic or static
function Mark_Allocator (N : Node_Id) return Traverse_Result;
-- Recognize an allocator node and label it as a dynamic coextension
if Is_Dynamic then
Set_Is_Dynamic_Coextension (N);
else
- Set_Is_Static_Coextension (N);
+ 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_Copy_List_Tree --
+ ------------------------
+
+ function New_Copy_List_Tree (List : List_Id) return List_Id is
+ NL : List_Id;
+ E : Node_Id;
+
+ begin
+ if List = No_List then
+ return No_List;
+
+ else
+ NL := New_List;
+ E := First (List);
+
+ while Present (E) loop
+ Append (New_Copy_Tree (E), NL);
+ E := Next (E);
+ end loop;
+
+ return NL;
+ end if;
+ end New_Copy_List_Tree;
+
+ -------------------
+ -- New_Copy_Tree --
+ -------------------
+
+ use Atree.Unchecked_Access;
+ use Atree_Private_Part;
+
+ -- Our approach here requires a two pass traversal of the tree. The
+ -- first pass visits all nodes that eventually will be copied looking
+ -- for defining Itypes. If any defining Itypes are found, then they are
+ -- copied, and an entry is added to the replacement map. In the second
+ -- phase, the tree is copied, using the replacement map to replace any
+ -- Itype references within the copied tree.
+
+ -- The following hash tables are used if the Map supplied has more
+ -- than hash threshhold entries to speed up access to the map. If
+ -- there are fewer entries, then the map is searched sequentially
+ -- (because setting up a hash table for only a few entries takes
+ -- more time than it saves.
+
+ function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
+ -- Hash function used for hash operations
+
+ -------------------
+ -- New_Copy_Hash --
+ -------------------
+
+ function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
+ begin
+ return Nat (E) mod (NCT_Header_Num'Last + 1);
+ end New_Copy_Hash;
+
+ ---------------
+ -- NCT_Assoc --
+ ---------------
+
+ -- The hash table NCT_Assoc associates old entities in the table
+ -- with their corresponding new entities (i.e. the pairs of entries
+ -- presented in the original Map argument are Key-Element pairs).
+
+ package NCT_Assoc is new Simple_HTable (
+ Header_Num => NCT_Header_Num,
+ Element => Entity_Id,
+ No_Element => Empty,
+ Key => Entity_Id,
+ Hash => New_Copy_Hash,
+ Equal => Types."=");
+
+ ---------------------
+ -- NCT_Itype_Assoc --
+ ---------------------
+
+ -- The hash table NCT_Itype_Assoc contains entries only for those
+ -- old nodes which have a non-empty Associated_Node_For_Itype set.
+ -- The key is the associated node, and the element is the new node
+ -- itself (NOT the associated node for the new node).
+
+ package NCT_Itype_Assoc is new Simple_HTable (
+ Header_Num => NCT_Header_Num,
+ Element => Entity_Id,
+ No_Element => Empty,
+ Key => Entity_Id,
+ Hash => New_Copy_Hash,
+ Equal => Types."=");
+
+ -- Start of processing for New_Copy_Tree function
+
+ function New_Copy_Tree
+ (Source : Node_Id;
+ Map : Elist_Id := No_Elist;
+ New_Sloc : Source_Ptr := No_Location;
+ New_Scope : Entity_Id := Empty) return Node_Id
+ is
+ Actual_Map : Elist_Id := Map;
+ -- This is the actual map for the copy. It is initialized with the
+ -- given elements, and then enlarged as required for Itypes that are
+ -- copied during the first phase of the copy operation. The visit
+ -- procedures add elements to this map as Itypes are encountered.
+ -- The reason we cannot use Map directly, is that it may well be
+ -- (and normally is) initialized to No_Elist, and if we have mapped
+ -- entities, we have to reset it to point to a real Elist.
+
+ function Assoc (N : Node_Or_Entity_Id) return Node_Id;
+ -- Called during second phase to map entities into their corresponding
+ -- copies using Actual_Map. If the argument is not an entity, or is not
+ -- in Actual_Map, then it is returned unchanged.
+
+ procedure Build_NCT_Hash_Tables;
+ -- Builds hash tables (number of elements >= threshold value)
+
+ function Copy_Elist_With_Replacement
+ (Old_Elist : Elist_Id) return Elist_Id;
+ -- Called during second phase to copy element list doing replacements
+
+ procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
+ -- Called during the second phase to process a copied Itype. The actual
+ -- copy happened during the first phase (so that we could make the entry
+ -- in the mapping), but we still have to deal with the descendents of
+ -- the copied Itype and copy them where necessary.
+
+ function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
+ -- Called during second phase to copy list doing replacements
+
+ function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
+ -- Called during second phase to copy node doing replacements
+
+ procedure Visit_Elist (E : Elist_Id);
+ -- Called during first phase to visit all elements of an Elist
+
+ procedure Visit_Field (F : Union_Id; N : Node_Id);
+ -- Visit a single field, recursing to call Visit_Node or Visit_List
+ -- if the field is a syntactic descendent of the current node (i.e.
+ -- its parent is Node N).
+
+ procedure Visit_Itype (Old_Itype : Entity_Id);
+ -- Called during first phase to visit subsidiary fields of a defining
+ -- Itype, and also create a copy and make an entry in the replacement
+ -- map for the new copy.
+
+ procedure Visit_List (L : List_Id);
+ -- Called during first phase to visit all elements of a List
+
+ procedure Visit_Node (N : Node_Or_Entity_Id);
+ -- Called during first phase to visit a node and all its subtrees
+
+ -----------
+ -- Assoc --
+ -----------
+
+ function Assoc (N : Node_Or_Entity_Id) return Node_Id is
+ E : Elmt_Id;
+ Ent : Entity_Id;
+
+ begin
+ if not Has_Extension (N) or else No (Actual_Map) then
+ return N;
+
+ elsif NCT_Hash_Tables_Used then
+ Ent := NCT_Assoc.Get (Entity_Id (N));
+
+ if Present (Ent) then
+ return Ent;
+ else
+ return N;
+ end if;
+
+ -- No hash table used, do serial search
+
+ else
+ E := First_Elmt (Actual_Map);
+ while Present (E) loop
+ if Node (E) = N then
+ return Node (Next_Elmt (E));
+ else
+ E := Next_Elmt (Next_Elmt (E));
+ end if;
+ end loop;
+ end if;
+
+ return N;
+ end Assoc;
+
+ ---------------------------
+ -- Build_NCT_Hash_Tables --
+ ---------------------------
+
+ procedure Build_NCT_Hash_Tables is
+ Elmt : Elmt_Id;
+ Ent : Entity_Id;
+ begin
+ if NCT_Hash_Table_Setup then
+ NCT_Assoc.Reset;
+ NCT_Itype_Assoc.Reset;
+ end if;
+
+ Elmt := First_Elmt (Actual_Map);
+ while Present (Elmt) loop
+ Ent := Node (Elmt);
+
+ -- Get new entity, and associate old and new
+
+ Next_Elmt (Elmt);
+ NCT_Assoc.Set (Ent, Node (Elmt));
+
+ if Is_Type (Ent) then
+ declare
+ Anode : constant Entity_Id :=
+ Associated_Node_For_Itype (Ent);
+
+ begin
+ if Present (Anode) then
+
+ -- Enter a link between the associated node of the
+ -- old Itype and the new Itype, for updating later
+ -- when node is copied.
+
+ NCT_Itype_Assoc.Set (Anode, Node (Elmt));
+ end if;
+ end;
+ end if;
+
+ Next_Elmt (Elmt);
+ end loop;
+
+ NCT_Hash_Tables_Used := True;
+ NCT_Hash_Table_Setup := True;
+ end Build_NCT_Hash_Tables;
+
+ ---------------------------------
+ -- Copy_Elist_With_Replacement --
+ ---------------------------------
+
+ function Copy_Elist_With_Replacement
+ (Old_Elist : Elist_Id) return Elist_Id
+ is
+ M : Elmt_Id;
+ New_Elist : Elist_Id;
+
+ begin
+ if No (Old_Elist) then
+ return No_Elist;
+
+ else
+ New_Elist := New_Elmt_List;
+
+ M := First_Elmt (Old_Elist);
+ while Present (M) loop
+ Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
+ Next_Elmt (M);
+ end loop;
+ end if;
+
+ return New_Elist;
+ end Copy_Elist_With_Replacement;
+
+ ---------------------------------
+ -- Copy_Itype_With_Replacement --
+ ---------------------------------
+
+ -- This routine exactly parallels its phase one analog Visit_Itype,
+
+ procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
+ begin
+ -- Translate Next_Entity, Scope and Etype fields, in case they
+ -- reference entities that have been mapped into copies.
+
+ Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
+ Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
+
+ if Present (New_Scope) then
+ Set_Scope (New_Itype, New_Scope);
+ else
+ Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
+ end if;
+
+ -- Copy referenced fields
+
+ if Is_Discrete_Type (New_Itype) then
+ Set_Scalar_Range (New_Itype,
+ Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
+
+ elsif Has_Discriminants (Base_Type (New_Itype)) then
+ Set_Discriminant_Constraint (New_Itype,
+ Copy_Elist_With_Replacement
+ (Discriminant_Constraint (New_Itype)));
+
+ elsif Is_Array_Type (New_Itype) then
+ if Present (First_Index (New_Itype)) then
+ Set_First_Index (New_Itype,
+ First (Copy_List_With_Replacement
+ (List_Containing (First_Index (New_Itype)))));
+ end if;
+
+ if Is_Packed (New_Itype) then
+ Set_Packed_Array_Type (New_Itype,
+ Copy_Node_With_Replacement
+ (Packed_Array_Type (New_Itype)));
+ end if;
+ end if;
+ end Copy_Itype_With_Replacement;
+
+ --------------------------------
+ -- Copy_List_With_Replacement --
+ --------------------------------
+
+ function Copy_List_With_Replacement
+ (Old_List : List_Id) return List_Id
+ is
+ New_List : List_Id;
+ E : Node_Id;
+
+ begin
+ if Old_List = No_List then
+ return No_List;
+
+ else
+ New_List := Empty_List;
+
+ E := First (Old_List);
+ while Present (E) loop
+ Append (Copy_Node_With_Replacement (E), New_List);
+ Next (E);
+ end loop;
+
+ return New_List;
+ end if;
+ end Copy_List_With_Replacement;
+
+ --------------------------------
+ -- Copy_Node_With_Replacement --
+ --------------------------------
+
+ function Copy_Node_With_Replacement
+ (Old_Node : Node_Id) return Node_Id
+ is
+ New_Node : Node_Id;
+
+ procedure Adjust_Named_Associations
+ (Old_Node : Node_Id;
+ New_Node : Node_Id);
+ -- If a call node has named associations, these are chained through
+ -- the First_Named_Actual, Next_Named_Actual links. These must be
+ -- propagated separately to the new parameter list, because these
+ -- are not syntactic fields.
+
+ function Copy_Field_With_Replacement
+ (Field : Union_Id) return Union_Id;
+ -- Given Field, which is a field of Old_Node, return a copy of it
+ -- if it is a syntactic field (i.e. its parent is Node), setting
+ -- the parent of the copy to poit to New_Node. Otherwise returns
+ -- the field (possibly mapped if it is an entity).
+
+ -------------------------------
+ -- Adjust_Named_Associations --
+ -------------------------------
+
+ procedure Adjust_Named_Associations
+ (Old_Node : Node_Id;
+ New_Node : Node_Id)
+ is
+ Old_E : Node_Id;
+ New_E : Node_Id;
+
+ Old_Next : Node_Id;
+ New_Next : Node_Id;
+
+ begin
+ Old_E := First (Parameter_Associations (Old_Node));
+ New_E := First (Parameter_Associations (New_Node));
+ while Present (Old_E) loop
+ if Nkind (Old_E) = N_Parameter_Association
+ and then Present (Next_Named_Actual (Old_E))
+ then
+ if First_Named_Actual (Old_Node)
+ = Explicit_Actual_Parameter (Old_E)
+ then
+ Set_First_Named_Actual
+ (New_Node, Explicit_Actual_Parameter (New_E));
+ end if;
+
+ -- Now scan parameter list from the beginning,to locate
+ -- next named actual, which can be out of order.
+
+ Old_Next := First (Parameter_Associations (Old_Node));
+ New_Next := First (Parameter_Associations (New_Node));
+
+ while Nkind (Old_Next) /= N_Parameter_Association
+ or else Explicit_Actual_Parameter (Old_Next)
+ /= Next_Named_Actual (Old_E)
+ loop
+ Next (Old_Next);
+ Next (New_Next);
+ end loop;
+
+ Set_Next_Named_Actual
+ (New_E, Explicit_Actual_Parameter (New_Next));
+ end if;
+
+ Next (Old_E);
+ Next (New_E);
+ end loop;
+ end Adjust_Named_Associations;
+
+ ---------------------------------
+ -- Copy_Field_With_Replacement --
+ ---------------------------------
+
+ function Copy_Field_With_Replacement
+ (Field : Union_Id) return Union_Id
+ is
+ begin
+ if Field = Union_Id (Empty) then
+ return Field;
+
+ elsif Field in Node_Range then
+ declare
+ Old_N : constant Node_Id := Node_Id (Field);
+ New_N : Node_Id;
+
+ begin
+ -- If syntactic field, as indicated by the parent pointer
+ -- being set, then copy the referenced node recursively.
+
+ if Parent (Old_N) = Old_Node then
+ New_N := Copy_Node_With_Replacement (Old_N);
+
+ if New_N /= Old_N then
+ Set_Parent (New_N, New_Node);
+ end if;
+
+ -- For semantic fields, update possible entity reference
+ -- from the replacement map.
+
+ else
+ New_N := Assoc (Old_N);
+ end if;
+
+ return Union_Id (New_N);
+ end;
+
+ elsif Field in List_Range then
+ declare
+ Old_L : constant List_Id := List_Id (Field);
+ New_L : List_Id;
+
+ begin
+ -- If syntactic field, as indicated by the parent pointer,
+ -- then recursively copy the entire referenced list.
+
+ if Parent (Old_L) = Old_Node then
+ New_L := Copy_List_With_Replacement (Old_L);
+ Set_Parent (New_L, New_Node);
+
+ -- For semantic list, just returned unchanged
+
+ else
+ New_L := Old_L;
+ end if;
+
+ return Union_Id (New_L);
+ end;
+
+ -- Anything other than a list or a node is returned unchanged
+
+ else
+ return Field;
+ end if;
+ end Copy_Field_With_Replacement;
+
+ -- Start of processing for Copy_Node_With_Replacement
+
+ begin
+ if Old_Node <= Empty_Or_Error then
+ return Old_Node;
+
+ elsif Has_Extension (Old_Node) then
+ return Assoc (Old_Node);
+
+ else
+ New_Node := New_Copy (Old_Node);
+
+ -- If the node we are copying is the associated node of a
+ -- previously copied Itype, then adjust the associated node
+ -- of the copy of that Itype accordingly.
+
+ if Present (Actual_Map) then
+ declare
+ E : Elmt_Id;
+ Ent : Entity_Id;
+
+ begin
+ -- Case of hash table used
+
+ if NCT_Hash_Tables_Used then
+ Ent := NCT_Itype_Assoc.Get (Old_Node);
+
+ if Present (Ent) then
+ Set_Associated_Node_For_Itype (Ent, New_Node);
+ end if;
+
+ -- Case of no hash table used
+
+ else
+ E := First_Elmt (Actual_Map);
+ while Present (E) loop
+ if Is_Itype (Node (E))
+ and then
+ Old_Node = Associated_Node_For_Itype (Node (E))
+ then
+ Set_Associated_Node_For_Itype
+ (Node (Next_Elmt (E)), New_Node);
+ end if;
+
+ E := Next_Elmt (Next_Elmt (E));
+ end loop;
+ end if;
+ end;
+ end if;
+
+ -- Recursively copy descendents
+
+ Set_Field1
+ (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
+ Set_Field2
+ (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
+ Set_Field3
+ (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
+ Set_Field4
+ (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
+ Set_Field5
+ (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
+
+ -- Adjust Sloc of new node if necessary
+
+ if New_Sloc /= No_Location then
+ Set_Sloc (New_Node, New_Sloc);
+
+ -- If we adjust the Sloc, then we are essentially making
+ -- a completely new node, so the Comes_From_Source flag
+ -- should be reset to the proper default value.
+
+ Nodes.Table (New_Node).Comes_From_Source :=
+ Default_Node.Comes_From_Source;
+ end if;
+
+ -- If the node is call and has named associations,
+ -- set the corresponding links in the copy.
+
+ if (Nkind (Old_Node) = N_Function_Call
+ or else Nkind (Old_Node) = N_Entry_Call_Statement
+ or else
+ Nkind (Old_Node) = N_Procedure_Call_Statement)
+ and then Present (First_Named_Actual (Old_Node))
+ then
+ Adjust_Named_Associations (Old_Node, New_Node);
+ end if;
+
+ -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
+ -- The replacement mechanism applies to entities, and is not used
+ -- here. Eventually we may need a more general graph-copying
+ -- routine. For now, do a sequential search to find desired node.
+
+ if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
+ and then Present (First_Real_Statement (Old_Node))
+ then
+ declare
+ Old_F : constant Node_Id := First_Real_Statement (Old_Node);
+ N1, N2 : Node_Id;
+
+ begin
+ N1 := First (Statements (Old_Node));
+ N2 := First (Statements (New_Node));
+
+ while N1 /= Old_F loop
+ Next (N1);
+ Next (N2);
+ end loop;
+
+ Set_First_Real_Statement (New_Node, N2);
+ end;
+ end if;
+ end if;
+
+ -- All done, return copied node
+
+ return New_Node;
+ end Copy_Node_With_Replacement;
+
+ -----------------
+ -- Visit_Elist --
+ -----------------
+
+ procedure Visit_Elist (E : Elist_Id) is
+ Elmt : Elmt_Id;
+ begin
+ if Present (E) then
+ Elmt := First_Elmt (E);
+
+ while Elmt /= No_Elmt loop
+ Visit_Node (Node (Elmt));
+ Next_Elmt (Elmt);
+ end loop;
+ end if;
+ end Visit_Elist;
+
+ -----------------
+ -- Visit_Field --
+ -----------------
+
+ procedure Visit_Field (F : Union_Id; N : Node_Id) is
+ begin
+ if F = Union_Id (Empty) then
+ return;
+
+ elsif F in Node_Range then
+
+ -- Copy node if it is syntactic, i.e. its parent pointer is
+ -- set to point to the field that referenced it (certain
+ -- Itypes will also meet this criterion, which is fine, since
+ -- these are clearly Itypes that do need to be copied, since
+ -- we are copying their parent.)
+
+ if Parent (Node_Id (F)) = N then
+ Visit_Node (Node_Id (F));
+ return;
+
+ -- Another case, if we are pointing to an Itype, then we want
+ -- to copy it if its associated node is somewhere in the tree
+ -- being copied.
+
+ -- Note: the exclusion of self-referential copies is just an
+ -- optimization, since the search of the already copied list
+ -- would catch it, but it is a common case (Etype pointing
+ -- to itself for an Itype that is a base type).
+
+ elsif Has_Extension (Node_Id (F))
+ and then Is_Itype (Entity_Id (F))
+ and then Node_Id (F) /= N
+ then
+ declare
+ P : Node_Id;
+
+ begin
+ P := Associated_Node_For_Itype (Node_Id (F));
+ while Present (P) loop
+ if P = Source then
+ Visit_Node (Node_Id (F));
+ return;
+ else
+ P := Parent (P);
+ end if;
+ end loop;
+
+ -- An Itype whose parent is not being copied definitely
+ -- should NOT be copied, since it does not belong in any
+ -- sense to the copied subtree.
+
+ return;
+ end;
+ end if;
+
+ elsif F in List_Range
+ and then Parent (List_Id (F)) = N
+ then
+ Visit_List (List_Id (F));
+ return;
+ end if;
+ end Visit_Field;
+
+ -----------------
+ -- Visit_Itype --
+ -----------------
+
+ procedure Visit_Itype (Old_Itype : Entity_Id) is
+ New_Itype : Entity_Id;
+ E : Elmt_Id;
+ Ent : Entity_Id;
+
+ begin
+ -- Itypes that describe the designated type of access to subprograms
+ -- have the structure of subprogram declarations, with signatures,
+ -- etc. Either we duplicate the signatures completely, or choose to
+ -- share such itypes, which is fine because their elaboration will
+ -- have no side effects.
+
+ if Ekind (Old_Itype) = E_Subprogram_Type then
+ return;
+ end if;
+
+ New_Itype := New_Copy (Old_Itype);
+
+ -- The new Itype has all the attributes of the old one, and
+ -- we just copy the contents of the entity. However, the back-end
+ -- needs different names for debugging purposes, so we create a
+ -- new internal name for it in all cases.
+
+ Set_Chars (New_Itype, New_Internal_Name ('T'));
+
+ -- If our associated node is an entity that has already been copied,
+ -- then set the associated node of the copy to point to the right
+ -- copy. If we have copied an Itype that is itself the associated
+ -- node of some previously copied Itype, then we set the right
+ -- pointer in the other direction.
+
+ if Present (Actual_Map) then
+
+ -- Case of hash tables used
+
+ if NCT_Hash_Tables_Used then
+
+ Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
+
+ if Present (Ent) then
+ Set_Associated_Node_For_Itype (New_Itype, Ent);
+ end if;
+
+ Ent := NCT_Itype_Assoc.Get (Old_Itype);
+ if Present (Ent) then
+ Set_Associated_Node_For_Itype (Ent, New_Itype);
+
+ -- If the hash table has no association for this Itype and
+ -- its associated node, enter one now.
+
+ else
+ NCT_Itype_Assoc.Set
+ (Associated_Node_For_Itype (Old_Itype), New_Itype);
+ end if;
+
+ -- Case of hash tables not used
+
+ else
+ E := First_Elmt (Actual_Map);
+ while Present (E) loop
+ if Associated_Node_For_Itype (Old_Itype) = Node (E) then
+ Set_Associated_Node_For_Itype
+ (New_Itype, Node (Next_Elmt (E)));
+ end if;
+
+ if Is_Type (Node (E))
+ and then
+ Old_Itype = Associated_Node_For_Itype (Node (E))
+ then
+ Set_Associated_Node_For_Itype
+ (Node (Next_Elmt (E)), New_Itype);
+ end if;
+
+ E := Next_Elmt (Next_Elmt (E));
+ end loop;
+ end if;
+ end if;
+
+ if Present (Freeze_Node (New_Itype)) then
+ Set_Is_Frozen (New_Itype, False);
+ Set_Freeze_Node (New_Itype, Empty);
+ end if;
+
+ -- Add new association to map
+
+ if No (Actual_Map) then
+ Actual_Map := New_Elmt_List;
+ end if;
+
+ Append_Elmt (Old_Itype, Actual_Map);
+ Append_Elmt (New_Itype, Actual_Map);
+
+ if NCT_Hash_Tables_Used then
+ NCT_Assoc.Set (Old_Itype, New_Itype);
+
+ else
+ NCT_Table_Entries := NCT_Table_Entries + 1;
+
+ if NCT_Table_Entries > NCT_Hash_Threshhold then
+ Build_NCT_Hash_Tables;
+ end if;
+ end if;
+
+ -- If a record subtype is simply copied, the entity list will be
+ -- shared. Thus cloned_Subtype must be set to indicate the sharing.
+
+ if Ekind (Old_Itype) = E_Record_Subtype
+ or else Ekind (Old_Itype) = E_Class_Wide_Subtype
+ then
+ Set_Cloned_Subtype (New_Itype, Old_Itype);
+ end if;
+
+ -- Visit descendents that eventually get copied
+
+ Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
+
+ if Is_Discrete_Type (Old_Itype) then
+ Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
+
+ elsif Has_Discriminants (Base_Type (Old_Itype)) then
+ -- ??? This should involve call to Visit_Field
+ Visit_Elist (Discriminant_Constraint (Old_Itype));
+
+ elsif Is_Array_Type (Old_Itype) then
+ if Present (First_Index (Old_Itype)) then
+ Visit_Field (Union_Id (List_Containing
+ (First_Index (Old_Itype))),
+ Old_Itype);
+ end if;
+
+ if Is_Packed (Old_Itype) then
+ Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)),
+ Old_Itype);
+ end if;
+ end if;
+ end Visit_Itype;
+
+ ----------------
+ -- Visit_List --
+ ----------------
+
+ procedure Visit_List (L : List_Id) is
+ N : Node_Id;
+ begin
+ if L /= No_List then
+ N := First (L);
+
+ while Present (N) loop
+ Visit_Node (N);
+ Next (N);
+ end loop;
+ end if;
+ end Visit_List;
+
+ ----------------
+ -- Visit_Node --
+ ----------------
+
+ procedure Visit_Node (N : Node_Or_Entity_Id) is
+
+ -- Start of processing for Visit_Node
+
+ begin
+ -- Handle case of an Itype, which must be copied
+
+ if Has_Extension (N)
+ and then Is_Itype (N)
+ then
+ -- Nothing to do if already in the list. This can happen with an
+ -- Itype entity that appears more than once in the tree.
+ -- Note that we do not want to visit descendents in this case.
+
+ -- Test for already in list when hash table is used
+
+ if NCT_Hash_Tables_Used then
+ if Present (NCT_Assoc.Get (Entity_Id (N))) then
+ return;
+ end if;
+
+ -- Test for already in list when hash table not used
+
+ else
+ declare
+ E : Elmt_Id;
+ begin
+ if Present (Actual_Map) then
+ E := First_Elmt (Actual_Map);
+ while Present (E) loop
+ if Node (E) = N then
+ return;
+ else
+ E := Next_Elmt (Next_Elmt (E));
+ end if;
+ end loop;
+ end if;
+ end;
end if;
+
+ Visit_Itype (N);
end if;
- return OK;
- end Mark_Allocator;
+ -- Visit descendents
- procedure Mark_Allocators is new Traverse_Proc (Mark_Allocator);
+ Visit_Field (Field1 (N), N);
+ Visit_Field (Field2 (N), N);
+ Visit_Field (Field3 (N), N);
+ Visit_Field (Field4 (N), N);
+ Visit_Field (Field5 (N), N);
+ end Visit_Node;
- -- Start of processing Mark_Coextensions
+ -- Start of processing for New_Copy_Tree
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;
+ Actual_Map := Map;
- -- This routine should not be called for constructs which may not
- -- contain coextensions.
+ -- See if we should use hash table
- when others =>
- raise Program_Error;
- end case;
+ if No (Actual_Map) then
+ NCT_Hash_Tables_Used := False;
- Mark_Allocators (Root_Nod);
- end Mark_Coextensions;
+ else
+ declare
+ Elmt : Elmt_Id;
- ----------------------
- -- Needs_One_Actual --
- ----------------------
+ begin
+ NCT_Table_Entries := 0;
- function Needs_One_Actual (E : Entity_Id) return Boolean is
- Formal : Entity_Id;
+ Elmt := First_Elmt (Actual_Map);
+ while Present (Elmt) loop
+ NCT_Table_Entries := NCT_Table_Entries + 1;
+ Next_Elmt (Elmt);
+ Next_Elmt (Elmt);
+ end loop;
- 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;
+ if NCT_Table_Entries > NCT_Hash_Threshhold then
+ Build_NCT_Hash_Tables;
+ else
+ NCT_Hash_Tables_Used := False;
end if;
+ end;
+ end if;
- Next_Formal (Formal);
- end loop;
+ -- Hash table set up if required, now start phase one by visiting
+ -- top node (we will recursively visit the descendents).
- return True;
+ Visit_Node (Source);
- else
- return False;
+ -- Now the second phase of the copy can start. First we process
+ -- all the mapped entities, copying their descendents.
+
+ if Present (Actual_Map) then
+ declare
+ Elmt : Elmt_Id;
+ New_Itype : Entity_Id;
+ begin
+ Elmt := First_Elmt (Actual_Map);
+ while Present (Elmt) loop
+ Next_Elmt (Elmt);
+ New_Itype := Node (Elmt);
+ Copy_Itype_With_Replacement (New_Itype);
+ Next_Elmt (Elmt);
+ end loop;
+ end;
end if;
- end Needs_One_Actual;
+
+ -- Now we can copy the actual tree
+
+ return Copy_Node_With_Replacement (Source);
+ end New_Copy_Tree;
-------------------------
-- New_External_Entity --
N : Node_Id;
begin
- -- If we are pointing at a positional parameter, it is a member of
- -- a node list (the list of parameters), and the next parameter
- -- is the next node on the list, unless we hit a parameter
- -- association, in which case we shift to using the chain whose
- -- head is the First_Named_Actual in the parent, and then is
- -- threaded using the Next_Named_Actual of the Parameter_Association.
- -- All this fiddling is because the original node list is in the
- -- textual call order, and what we need is the declaration order.
+ -- If we are pointing at a positional parameter, it is a member of a
+ -- node list (the list of parameters), and the next parameter is the
+ -- next node on the list, unless we hit a parameter association, then
+ -- we shift to using the chain whose head is the First_Named_Actual in
+ -- the parent, and then is threaded using the Next_Named_Actual of the
+ -- Parameter_Association. All this fiddling is because the original node
+ -- list is in the textual call order, and what we need is the
+ -- declaration order.
if Is_List_Member (Actual_Id) then
N := Next (Actual_Id);
Formal := First_Formal (S);
while Present (Formal) loop
- -- Match the formals in order. If the corresponding actual
- -- is positional, nothing to do. Else scan the list of named
- -- actuals to find the one with the right name.
+ -- Match the formals in order. If the corresponding actual is
+ -- positional, nothing to do. Else scan the list of named actuals
+ -- to find the one with the right name.
if Present (Actual)
and then Nkind (Actual) /= N_Parameter_Association
-- Note_Possible_Modification --
--------------------------------
- procedure Note_Possible_Modification (N : Node_Id) is
+ procedure Note_Possible_Modification (N : Node_Id; Sure : Boolean) is
Modification_Comes_From_Source : constant Boolean :=
Comes_From_Source (Parent (N));
if Comes_From_Source (Exp)
or else Modification_Comes_From_Source
then
+ if Has_Pragma_Unmodified (Ent) then
+ Error_Msg_NE ("?pragma Unmodified given for &!", N, Ent);
+ end if;
+
Set_Never_Set_In_Source (Ent, False);
end if;
end if;
Kill_Checks (Ent);
+
+ -- If we are sure this is a modification from source, and we know
+ -- this modifies a constant, then give an appropriate warning.
+
+ if Overlays_Constant (Ent)
+ and then Modification_Comes_From_Source
+ and then Sure
+ then
+ declare
+ A : constant Node_Id := Address_Clause (Ent);
+ begin
+ if Present (A) then
+ declare
+ Exp : constant Node_Id := Expression (A);
+ begin
+ if Nkind (Exp) = N_Attribute_Reference
+ and then Attribute_Name (Exp) = Name_Address
+ and then Is_Entity_Name (Prefix (Exp))
+ then
+ Error_Msg_Sloc := Sloc (A);
+ Error_Msg_NE
+ ("constant& may be modified via address clause#?",
+ N, Entity (Prefix (Exp)));
+ end if;
+ end;
+ end if;
+ end;
+ end if;
+
return;
end if;
end loop;
function Object_Access_Level (Obj : Node_Id) return Uint is
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
- -- 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)).
+ -- Returns the static accessibility level of the view denoted by Obj. Note
+ -- that the value returned is the result of a call to Scope_Depth. Only
+ -- scope depths associated with dynamic scopes can actually be returned.
+ -- Since only relative levels matter for accessibility checking, the fact
+ -- that the distance between successive levels of accessibility is not
+ -- always one is immaterial (invariant: if level(E2) is deeper than
+ -- level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
function 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.
+ -- 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 --
if Is_Entity_Name (Obj) then
E := Entity (Obj);
- -- If E is a type then it denotes a current instance.
- -- For this case we add one to the normal accessibility
- -- level of the type to ensure that current instances
- -- are treated as always being deeper than than the level
- -- of any visible named access type (see 3.10.2(21)).
+ if Is_Prival (E) then
+ E := Prival_Link (E);
+ end if;
+
+ -- If E is a type then it denotes a current instance. For this case
+ -- we add one to the normal accessibility level of the type to ensure
+ -- that current instances are treated as always being deeper than
+ -- than the level of any visible named access type (see 3.10.2(21)).
if Is_Type (E) then
return Type_Access_Level (E) + 1;
elsif Nkind (Obj) = N_Explicit_Dereference then
- -- If the prefix is a selected access discriminant then
- -- we make a recursive call on the prefix, which will
- -- in turn check the level of the prefix object of
- -- the selected discriminant.
+ -- If the prefix is a selected access discriminant then we make a
+ -- recursive call on the prefix, which will in turn check the level
+ -- of the prefix object of the selected discriminant.
if Nkind (Prefix (Obj)) = N_Selected_Component
and then Ekind (Etype (Prefix (Obj))) = E_Anonymous_Access_Type
then
return Object_Access_Level (Expression (Obj));
- -- Function results are objects, so we get either the access level
- -- of the function or, in the case of an indirect call, the level of
- -- of the access-to-subprogram type.
+ -- Function results are objects, so we get either the access level of
+ -- the function or, in the case of an indirect call, the level of the
+ -- access-to-subprogram type.
elsif Nkind (Obj) = N_Function_Call then
if Is_Entity_Name (Name (Obj)) then
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.
+ -- 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);
return Trace_Components (Type_Id, False);
end Private_Component;
+ ---------------------------
+ -- Primitive_Names_Match --
+ ---------------------------
+
+ function Primitive_Names_Match (E1, E2 : Entity_Id) return Boolean is
+
+ function Non_Internal_Name (E : Entity_Id) return Name_Id;
+ -- Given an internal name, returns the corresponding non-internal name
+
+ ------------------------
+ -- Non_Internal_Name --
+ ------------------------
+
+ function Non_Internal_Name (E : Entity_Id) return Name_Id is
+ begin
+ Get_Name_String (Chars (E));
+ Name_Len := Name_Len - 1;
+ return Name_Find;
+ end Non_Internal_Name;
+
+ -- Start of processing for Primitive_Names_Match
+
+ begin
+ pragma Assert (Present (E1) and then Present (E2));
+
+ return Chars (E1) = Chars (E2)
+ or else
+ (not Is_Internal_Name (Chars (E1))
+ and then Is_Internal_Name (Chars (E2))
+ and then Non_Internal_Name (E2) = Chars (E1))
+ or else
+ (not Is_Internal_Name (Chars (E2))
+ and then Is_Internal_Name (Chars (E1))
+ and then Non_Internal_Name (E1) = Chars (E2))
+ or else
+ (Is_Predefined_Dispatching_Operation (E1)
+ and then Is_Predefined_Dispatching_Operation (E2)
+ and then Same_TSS (E1, E2))
+ or else
+ (Is_Init_Proc (E1) and then Is_Init_Proc (E2));
+ end Primitive_Names_Match;
+
-----------------------
-- Process_End_Label --
-----------------------
is
Loc : Source_Ptr;
Nam : Node_Id;
+ Scop : Entity_Id;
Label_Ref : Boolean;
-- Set True if reference to end label itself is required
Endl : Node_Id;
- -- Gets set to the operator symbol or identifier that references
- -- the entity Ent. For the child unit case, this is the identifier
- -- from the designator. For other cases, this is simply Endl.
+ -- Gets set to the operator symbol or identifier that references the
+ -- entity Ent. For the child unit case, this is the identifier from the
+ -- designator. For other cases, this is simply Endl.
- procedure Generate_Parent_Ref (N : Node_Id);
- -- N is an identifier node that appears as a parent unit reference
- -- in the case where Ent is a child unit. This procedure generates
- -- an appropriate cross-reference entry.
+ procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id);
+ -- N is an identifier node that appears as a parent unit reference in
+ -- the case where Ent is a child unit. This procedure generates an
+ -- appropriate cross-reference entry. E is the corresponding entity.
-------------------------
-- Generate_Parent_Ref --
-------------------------
- procedure Generate_Parent_Ref (N : Node_Id) is
- Parent_Ent : Entity_Id;
-
+ procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id) is
begin
- -- Search up scope stack. The reason we do this is that normal
- -- visibility analysis would not work for two reasons. First in
- -- some subunit cases, the entry for the parent unit may not be
- -- visible, and in any case there can be a local entity that
- -- hides the scope entity.
-
- Parent_Ent := Current_Scope;
- while Present (Parent_Ent) loop
- if Chars (Parent_Ent) = Chars (N) then
-
- -- Generate the reference. We do NOT consider this as a
- -- reference for unreferenced symbol purposes, but we do
- -- force a cross-reference even if the end line does not
- -- come from source (the caller already generated the
- -- appropriate Typ for this situation).
-
- Generate_Reference
- (Parent_Ent, N, 'r', Set_Ref => False, Force => True);
- Style.Check_Identifier (N, Parent_Ent);
- return;
- end if;
+ -- If names do not match, something weird, skip reference
- Parent_Ent := Scope (Parent_Ent);
- end loop;
+ if Chars (E) = Chars (N) then
- -- Fall through means entity was not found -- that's odd, but
- -- the appropriate thing is simply to ignore and not generate
- -- any cross-reference for this entry.
+ -- Generate the reference. We do NOT consider this as a reference
+ -- for unreferenced symbol purposes.
- return;
+ Generate_Reference (E, N, 'r', Set_Ref => False, Force => True);
+
+ if Style_Check then
+ Style.Check_Identifier (N, E);
+ end if;
+ end if;
end Generate_Parent_Ref;
-- Start of processing for Process_End_Label
begin
- -- If no node, ignore. This happens in some error situations,
- -- and also for some internally generated structures where no
- -- end label references are required in any case.
+ -- If no node, ignore. This happens in some error situations, and
+ -- also for some internally generated structures where no end label
+ -- references are required in any case.
if No (N) then
return;
end if;
-- Nothing to do if no End_Label, happens for internally generated
- -- constructs where we don't want an end label reference anyway.
- -- Also nothing to do if Endl is a string literal, which means
- -- there was some prior error (bad operator symbol)
+ -- constructs where we don't want an end label reference anyway. Also
+ -- nothing to do if Endl is a string literal, which means there was
+ -- some prior error (bad operator symbol)
Endl := End_Label (N);
if not In_Extended_Main_Source_Unit (N) then
- -- Generally we do not collect references except for the
- -- extended main source unit. The one exception is the 'e'
- -- entry for a package spec, where it is useful for a client
- -- to have the ending information to define scopes.
+ -- Generally we do not collect references except for the extended
+ -- main source unit. The one exception is the 'e' entry for a
+ -- package spec, where it is useful for a client to have the
+ -- ending information to define scopes.
if Typ /= 'e' then
return;
else
Label_Ref := False;
- -- For this case, we can ignore any parent references,
- -- but we need the package name itself for the 'e' entry.
+ -- For this case, we can ignore any parent references, but we
+ -- need the package name itself for the 'e' entry.
if Nkind (Endl) = N_Designator then
Endl := Identifier (Endl);
if Nkind (Endl) = N_Designator then
- -- Generate references for the prefix if the END line comes
- -- from source (otherwise we do not need these references)
+ -- Generate references for the prefix if the END line comes from
+ -- source (otherwise we do not need these references) We climb the
+ -- scope stack to find the expected entities.
if Comes_From_Source (Endl) then
- Nam := Name (Endl);
+ Nam := Name (Endl);
+ Scop := Current_Scope;
while Nkind (Nam) = N_Selected_Component loop
- Generate_Parent_Ref (Selector_Name (Nam));
+ Scop := Scope (Scop);
+ exit when No (Scop);
+ Generate_Parent_Ref (Selector_Name (Nam), Scop);
Nam := Prefix (Nam);
end loop;
- Generate_Parent_Ref (Nam);
+ if Present (Scop) then
+ Generate_Parent_Ref (Nam, Scope (Scop));
+ end if;
end if;
Endl := Identifier (Endl);
return;
end if;
- -- If label was really there, then generate a normal reference
- -- and then adjust the location in the end label to point past
- -- the name (which should almost always be the semicolon).
+ -- If label was really there, then generate a normal reference and then
+ -- adjust the location in the end label to point past the name (which
+ -- should almost always be the semicolon).
Loc := Sloc (Endl);
if Comes_From_Source (Endl) then
- -- If a label reference is required, then do the style check
- -- and generate an l-type cross-reference entry for the label
+ -- If a label reference is required, then do the style check and
+ -- generate an l-type cross-reference entry for the label
if Label_Ref then
if Style_Check then
Style.Check_Identifier (Endl, Ent);
end if;
+
Generate_Reference (Ent, Endl, 'l', Set_Ref => False);
end if;
return Token_Node;
end Real_Convert;
+ ------------------------------------
+ -- References_Generic_Formal_Type --
+ ------------------------------------
+
+ function References_Generic_Formal_Type (N : Node_Id) return Boolean is
+
+ function Process (N : Node_Id) return Traverse_Result;
+ -- Process one node in search for generic formal type
+
+ -------------
+ -- Process --
+ -------------
+
+ function Process (N : Node_Id) return Traverse_Result is
+ begin
+ if Nkind (N) in N_Has_Entity then
+ declare
+ E : constant Entity_Id := Entity (N);
+ begin
+ if Present (E) then
+ if Is_Generic_Type (E) then
+ return Abandon;
+ elsif Present (Etype (E))
+ and then Is_Generic_Type (Etype (E))
+ then
+ return Abandon;
+ end if;
+ end if;
+ end;
+ end if;
+
+ return Atree.OK;
+ end Process;
+
+ function Traverse is new Traverse_Func (Process);
+ -- Traverse tree to look for generic type
+
+ begin
+ if Inside_A_Generic then
+ return Traverse (N) = Abandon;
+ else
+ return False;
+ end if;
+ end References_Generic_Formal_Type;
+
+ --------------------
+ -- Remove_Homonym --
+ --------------------
+
+ procedure Remove_Homonym (E : Entity_Id) is
+ Prev : Entity_Id := Empty;
+ H : Entity_Id;
+
+ begin
+ if E = Current_Entity (E) then
+ if Present (Homonym (E)) then
+ Set_Current_Entity (Homonym (E));
+ else
+ Set_Name_Entity_Id (Chars (E), Empty);
+ end if;
+ else
+ H := Current_Entity (E);
+ while Present (H) and then H /= E loop
+ Prev := H;
+ H := Homonym (H);
+ end loop;
+
+ Set_Homonym (Prev, Homonym (E));
+ end if;
+ end Remove_Homonym;
+
---------------------
-- Rep_To_Pos_Flag --
---------------------
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
+ -- reanalyze entities, and indeed, it is wrong to do so, since it
-- can result in generating auxiliary stuff more than once.
--------------------
return OK;
end Clear_Analyzed;
- function Reset_Analyzed is
- new Traverse_Func (Clear_Analyzed);
-
- Discard : Traverse_Result;
- pragma Warnings (Off, Discard);
+ procedure Reset_Analyzed is new Traverse_Proc (Clear_Analyzed);
-- Start of processing for Reset_Analyzed_Flags
begin
- Discard := Reset_Analyzed (N);
+ Reset_Analyzed (N);
end Reset_Analyzed_Flags;
---------------------------
-- 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.
+ -- for which an address clause is given, or whose address is taken. Also
+ -- never capture value of library level variables (an attempt to do so
+ -- can occur in the case of package elaboration code).
if Treat_As_Volatile (Ent)
or else Is_Aliased (Ent)
or else Present (Address_Clause (Ent))
or else Address_Taken (Ent)
+ or else (Is_Library_Level_Entity (Ent)
+ and then Ekind (Ent) = E_Variable)
then
return False;
end if;
P := Parent (N);
while Present (P) loop
- if Nkind (P) = N_If_Statement
+ if Nkind (P) = N_If_Statement
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) in N_Short_Circuit
+ and then Desc = Right_Opnd (P))
+ or else (Nkind (P) = N_Conditional_Expression
+ and then Desc /= First (Expressions (P)))
or else Nkind (P) = N_Exception_Handler
or else Nkind (P) = N_Selective_Accept
or else Nkind (P) = N_Conditional_Entry_Call
-- Scope_Is_Transient --
------------------------
- function Scope_Is_Transient return Boolean is
+ function Scope_Is_Transient return Boolean is
begin
return Scope_Stack.Table (Scope_Stack.Last).Is_Transient;
end Scope_Is_Transient;
return False;
end Scope_Within_Or_Same;
+ --------------------
+ -- Set_Convention --
+ --------------------
+
+ procedure Set_Convention (E : Entity_Id; Val : Snames.Convention_Id) is
+ begin
+ Basic_Set_Convention (E, Val);
+
+ if Is_Type (E)
+ and then Is_Access_Subprogram_Type (Base_Type (E))
+ and then Has_Foreign_Convention (E)
+ then
+ Set_Can_Use_Internal_Rep (E, False);
+ end if;
+ end Set_Convention;
+
------------------------
-- Set_Current_Entity --
------------------------
Set_Name_Entity_Id (Chars (E), E);
end Set_Current_Entity;
+ ---------------------------
+ -- Set_Debug_Info_Needed --
+ ---------------------------
+
+ procedure Set_Debug_Info_Needed (T : Entity_Id) is
+
+ procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id);
+ pragma Inline (Set_Debug_Info_Needed_If_Not_Set);
+ -- Used to set debug info in a related node if not set already
+
+ --------------------------------------
+ -- Set_Debug_Info_Needed_If_Not_Set --
+ --------------------------------------
+
+ procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id) is
+ begin
+ if Present (E)
+ and then not Needs_Debug_Info (E)
+ then
+ Set_Debug_Info_Needed (E);
+
+ -- For a private type, indicate that the full view also needs
+ -- debug information.
+
+ if Is_Type (E)
+ and then Is_Private_Type (E)
+ and then Present (Full_View (E))
+ then
+ Set_Debug_Info_Needed (Full_View (E));
+ end if;
+ end if;
+ end Set_Debug_Info_Needed_If_Not_Set;
+
+ -- Start of processing for Set_Debug_Info_Needed
+
+ begin
+ -- Nothing to do if argument is Empty or has Debug_Info_Off set, which
+ -- indicates that Debug_Info_Needed is never required for the entity.
+
+ if No (T)
+ or else Debug_Info_Off (T)
+ then
+ return;
+ end if;
+
+ -- Set flag in entity itself. Note that we will go through the following
+ -- circuitry even if the flag is already set on T. That's intentional,
+ -- it makes sure that the flag will be set in subsidiary entities.
+
+ Set_Needs_Debug_Info (T);
+
+ -- Set flag on subsidiary entities if not set already
+
+ if Is_Object (T) then
+ Set_Debug_Info_Needed_If_Not_Set (Etype (T));
+
+ elsif Is_Type (T) then
+ Set_Debug_Info_Needed_If_Not_Set (Etype (T));
+
+ if Is_Record_Type (T) then
+ declare
+ Ent : Entity_Id := First_Entity (T);
+ begin
+ while Present (Ent) loop
+ Set_Debug_Info_Needed_If_Not_Set (Ent);
+ Next_Entity (Ent);
+ end loop;
+ end;
+
+ elsif Is_Array_Type (T) then
+ Set_Debug_Info_Needed_If_Not_Set (Component_Type (T));
+
+ declare
+ Indx : Node_Id := First_Index (T);
+ begin
+ while Present (Indx) loop
+ Set_Debug_Info_Needed_If_Not_Set (Etype (Indx));
+ Indx := Next_Index (Indx);
+ end loop;
+ end;
+
+ if Is_Packed (T) then
+ Set_Debug_Info_Needed_If_Not_Set (Packed_Array_Type (T));
+ end if;
+
+ elsif Is_Access_Type (T) then
+ Set_Debug_Info_Needed_If_Not_Set (Directly_Designated_Type (T));
+
+ elsif Is_Private_Type (T) then
+ Set_Debug_Info_Needed_If_Not_Set (Full_View (T));
+
+ elsif Is_Protected_Type (T) then
+ Set_Debug_Info_Needed_If_Not_Set (Corresponding_Record_Type (T));
+ end if;
+ end if;
+ end Set_Debug_Info_Needed;
+
---------------------------------
-- Set_Entity_With_Style_Check --
---------------------------------
end if;
end Set_Next_Actual;
+ ----------------------------------
+ -- Set_Optimize_Alignment_Flags --
+ ----------------------------------
+
+ procedure Set_Optimize_Alignment_Flags (E : Entity_Id) is
+ begin
+ if Optimize_Alignment = 'S' then
+ Set_Optimize_Alignment_Space (E);
+ elsif Optimize_Alignment = 'T' then
+ Set_Optimize_Alignment_Time (E);
+ end if;
+ end Set_Optimize_Alignment_Flags;
+
-----------------------
-- Set_Public_Status --
-----------------------
procedure Set_Public_Status (Id : Entity_Id) is
S : constant Entity_Id := Current_Scope;
+ function Within_HSS_Or_If (E : Entity_Id) return Boolean;
+ -- Determines if E is defined within handled statement sequence or
+ -- an if statement, returns True if so, False otherwise.
+
+ ----------------------
+ -- Within_HSS_Or_If --
+ ----------------------
+
+ function Within_HSS_Or_If (E : Entity_Id) return Boolean is
+ N : Node_Id;
+ begin
+ N := Declaration_Node (E);
+ loop
+ N := Parent (N);
+
+ if No (N) then
+ return False;
+
+ elsif Nkind_In (N, N_Handled_Sequence_Of_Statements,
+ N_If_Statement)
+ then
+ return True;
+ end if;
+ end loop;
+ end Within_HSS_Or_If;
+
+ -- Start of processing for Set_Public_Status
+
begin
-- Everything in the scope of Standard is public
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.
+ -- An object or function declaration that occurs in a handled sequence
+ -- of statements or within an if statement is the declaration for a
+ -- temporary object or local subprogram generated by the expander. It
+ -- never needs to be made public and furthermore, making it public can
+ -- cause back end problems.
- elsif Nkind (Parent (Id)) = N_Object_Declaration
- and then
- Nkind (Parent (Parent (Id))) = N_Handled_Sequence_Of_Statements
+ elsif Nkind_In (Parent (Id), N_Object_Declaration,
+ N_Function_Specification)
+ and then Within_HSS_Or_If (Id)
then
return;
end if;
end Set_Public_Status;
+ -----------------------------
+ -- Set_Referenced_Modified --
+ -----------------------------
+
+ procedure Set_Referenced_Modified (N : Node_Id; Out_Param : Boolean) is
+ Pref : Node_Id;
+
+ begin
+ -- Deal with indexed or selected component where prefix is modified
+
+ if Nkind_In (N, N_Indexed_Component, N_Selected_Component) then
+ Pref := Prefix (N);
+
+ -- If prefix is access type, then it is the designated object that is
+ -- being modified, which means we have no entity to set the flag on.
+
+ if No (Etype (Pref)) or else Is_Access_Type (Etype (Pref)) then
+ return;
+
+ -- Otherwise chase the prefix
+
+ else
+ Set_Referenced_Modified (Pref, Out_Param);
+ end if;
+
+ -- Otherwise see if we have an entity name (only other case to process)
+
+ elsif Is_Entity_Name (N) and then Present (Entity (N)) then
+ Set_Referenced_As_LHS (Entity (N), not Out_Param);
+ Set_Referenced_As_Out_Parameter (Entity (N), Out_Param);
+ end if;
+ end Set_Referenced_Modified;
+
----------------------------
-- Set_Scope_Is_Transient --
----------------------------
Write_Str (Msg);
Write_Name (Chars (E));
- Write_Str (" line ");
- Write_Int (Int (Get_Logical_Line_Number (Sloc (N))));
+ Write_Str (" from ");
+ Write_Location (Sloc (N));
Write_Eol;
end if;
end Trace_Scope;
Btyp := Root_Type (Btyp);
- -- The accessibility level of anonymous acccess types associated with
+ -- The accessibility level of anonymous access types associated with
-- discriminants is that of the current instance of the type, and
-- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
end Type_Access_Level;
+ --------------------
+ -- Ultimate_Alias --
+ --------------------
+ -- To do: add occurrences calling this new subprogram
+
+ function Ultimate_Alias (Prim : Entity_Id) return Entity_Id is
+ E : Entity_Id := Prim;
+
+ begin
+ while Present (Alias (E)) loop
+ E := Alias (E);
+ end loop;
+
+ return E;
+ end Ultimate_Alias;
+
--------------------------
-- Unit_Declaration_Node --
--------------------------
Error_Msg_NE ("\\found}!", Expr, Found_Type);
end if;
+ -- A special check for cases like M1 and M2 = 0 where M1 and M2 are
+ -- of the same modular type, and (M1 and M2) = 0 was intended.
+
+ if Expec_Type = Standard_Boolean
+ and then Is_Modular_Integer_Type (Found_Type)
+ and then Nkind_In (Parent (Expr), N_Op_And, N_Op_Or, N_Op_Xor)
+ and then Nkind (Right_Opnd (Parent (Expr))) in N_Op_Compare
+ then
+ declare
+ Op : constant Node_Id := Right_Opnd (Parent (Expr));
+ L : constant Node_Id := Left_Opnd (Op);
+ R : constant Node_Id := Right_Opnd (Op);
+ begin
+ if Etype (L) = Found_Type
+ and then Is_Integer_Type (Etype (R))
+ then
+ Error_Msg_N
+ ("\\possible missing parens for modular operation", Expr);
+ end if;
+ end;
+ end if;
+
+ -- Reset error message qualification indication
+
Error_Msg_Qual_Level := 0;
end if;
end Wrong_Type;
OSDN Git Service
