Skip to content

R
riscv-gcc-1
Commit 26bff3d9 by Javier Miranda Committed by Arnaud Charlet
Options

exp_ch4.adb (Complete_Coextension_Finalization): Add machinery to handle the… 

exp_ch4.adb (Complete_Coextension_Finalization): Add machinery to handle the creation of finalization lists and calls for nested...

2007-04-20  Javier Miranda  <miranda@adacore.com>
	    Hristian Kirtchev  <kirtchev@adacore.com>
	    Bob Duff  <duff@adacore.com>

	* exp_ch4.adb (Complete_Coextension_Finalization): Add machinery to
	handle the creation of finalization lists and calls for nested
	coextensions when the root of the chains is part of a return statement.
	(Inside_A_Return_Statement): New function inside Complete_Coextension_
	Finalization.
	(Expand_Record_Equality): Skip components that are interface types.
	(Displace_Allocator_Pointer): Add missing support for interface subtypes
	(Expand_N_Allocator): Replace invocation of Is_Local_Access_Discriminant
	with Rewrite_Coextension. Change the condition for detecting coextension
	root nodes.
	(Is_Local_Access_Discriminant): Removed.
	(Rewrite_Coextension): New routine which rewrites a static coextension
	as a temporary and uses its unrestricted access in the construction of
	the outer object.
	(Complete_Coextension_Finalization): New routine. Generate finalization
	attachment calls to all delayed coextensions.
	(Expand_N_Allocator): Call Complete_Coextension_Finalization whenever
	the allocator is not a coextension itself and has delayed coextensions.
	If the current allocator is controlled, but also a coextension, delay
	the generation of the finalization attachment call.
	Rename local variable "Node" to "Nod" in order to avoid confusion with
	"Elists.Node".
	(Expand_Allocator_Expression): Call Adjust for initialized allocators of
	limited types that are not inherently limited. Such an allocator is
	illegal, but is generated by the expander for a return statement, to
	copy the result onto the secondary stack. This is the only case where a
	limited object can be copied. Generate code to displace the pointer
	to the object if the qualified expression is a class-wide interface
	object. Such displacement was missing and hence the copy of the object
	was wrong.
	(Apply_Accessibility_Check): Handle allocated objects initialized in
	place.
	(Displace_Allocator_Pointer): Subsidiary procedure to Expand_N_Allocator
	and Expand_Allocator_Expression. Allocating class-wide interface objects
	this routine displaces the pointer to the allocated object to reference
	the component referencing the corresponding secondary dispatch table.
	Expand_Allocator_Expression): Add missing support to allocate class-wide
	interface objects initialized with a qualified expression.
	(Get_Allocator_Final_List): Test for an anonymous access type that is a
	function result type, and use the finalization list associated with the
	function scope in that case (such an anonymous type should not be
	treated like an access parameter's type).

From-SVN: r125397
parent 47cc8d6b
Showing with 941 additions and 460 deletions
gcc/ada/exp_ch4.adb
...@@ -6,7 +6,7 @@ ...@@ -6,7 +6,7 @@
-- -- -- --
-- B o d y -- -- B o d y --
-- -- -- --
-- Copyright (C) 1992-2006, Free Software Foundation, Inc. -- -- Copyright (C) 1992-2007, Free Software Foundation, Inc. --
-- -- -- --
-- GNAT is free software; you can redistribute it and/or modify it under -- -- 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- -- -- terms of the GNU General Public License as published by the Free Soft- --
...@@ -42,8 +42,8 @@ with Exp_Tss; use Exp_Tss; ...@@ -42,8 +42,8 @@ with Exp_Tss; use Exp_Tss;
with Exp_Util; use Exp_Util; with Exp_Util; use Exp_Util;
with Exp_VFpt; use Exp_VFpt; with Exp_VFpt; use Exp_VFpt;
with Freeze; use Freeze; with Freeze; use Freeze;
with Hostparm; use Hostparm;
with Inline; use Inline; with Inline; use Inline;
with Namet; use Namet;
with Nlists; use Nlists; with Nlists; use Nlists;
with Nmake; use Nmake; with Nmake; use Nmake;
with Opt; use Opt; with Opt; use Opt;
...@@ -53,6 +53,7 @@ with Rtsfind; use Rtsfind; ...@@ -53,6 +53,7 @@ with Rtsfind; use Rtsfind;
with Sem; use Sem; with Sem; use Sem;
with Sem_Cat; use Sem_Cat; with Sem_Cat; use Sem_Cat;
with Sem_Ch3; use Sem_Ch3; with Sem_Ch3; use Sem_Ch3;
with Sem_Ch8; use Sem_Ch8;
with Sem_Ch13; use Sem_Ch13; with Sem_Ch13; use Sem_Ch13;
with Sem_Eval; use Sem_Eval; with Sem_Eval; use Sem_Eval;
with Sem_Res; use Sem_Res; with Sem_Res; use Sem_Res;
...@@ -86,6 +87,12 @@ package body Exp_Ch4 is ...@@ -86,6 +87,12 @@ package body Exp_Ch4 is
-- If an boolean array assignment can be done in place, build call to -- If an boolean array assignment can be done in place, build call to
-- corresponding library procedure. -- corresponding library procedure.
procedure Displace_Allocator_Pointer (N : Node_Id);
-- Ada 2005 (AI-251): Subsidiary procedure to Expand_N_Allocator and
-- Expand_Allocator_Expression. Allocating class-wide interface objects
-- this routine displaces the pointer to the allocated object to reference
-- the component referencing the corresponding secondary dispatch table.
procedure Expand_Allocator_Expression (N : Node_Id); procedure Expand_Allocator_Expression (N : Node_Id);
-- Subsidiary to Expand_N_Allocator, for the case when the expression -- Subsidiary to Expand_N_Allocator, for the case when the expression
-- is a qualified expression or an aggregate. -- is a qualified expression or an aggregate.
...@@ -364,6 +371,93 @@ package body Exp_Ch4 is ...@@ -364,6 +371,93 @@ package body Exp_Ch4 is
return; return;
end Build_Boolean_Array_Proc_Call; end Build_Boolean_Array_Proc_Call;
--------------------------------
-- Displace_Allocator_Pointer --
--------------------------------
procedure Displace_Allocator_Pointer (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Orig_Node : constant Node_Id := Original_Node (N);
Dtyp : Entity_Id;
Etyp : Entity_Id;
PtrT : Entity_Id;
begin
pragma Assert (Nkind (N) = N_Identifier
and then Nkind (Orig_Node) = N_Allocator);
PtrT := Etype (Orig_Node);
Dtyp := Designated_Type (PtrT);
Etyp := Etype (Expression (Orig_Node));
if Is_Class_Wide_Type (Dtyp)
and then Is_Interface (Dtyp)
then
-- If the type of the allocator expression is not an interface type
-- we can generate code to reference the record component containing
-- the pointer to the secondary dispatch table.
if not Is_Interface (Etyp) then
declare
Saved_Typ : constant Entity_Id := Etype (Orig_Node);
begin
-- 1) Get access to the allocated object
Rewrite (N,
Make_Explicit_Dereference (Loc,
Relocate_Node (N)));
Set_Etype (N, Etyp);
Set_Analyzed (N);
-- 2) Add the conversion to displace the pointer to reference
-- the secondary dispatch table.
Rewrite (N, Convert_To (Dtyp, Relocate_Node (N)));
Analyze_And_Resolve (N, Dtyp);
-- 3) The 'access to the secondary dispatch table will be used
-- as the value returned by the allocator.
Rewrite (N,
Make_Attribute_Reference (Loc,
Prefix => Relocate_Node (N),
Attribute_Name => Name_Access));
Set_Etype (N, Saved_Typ);
Set_Analyzed (N);
end;
-- If the type of the allocator expression is an interface type we
-- generate a run-time call to displace "this" to reference the
-- component containing the pointer to the secondary dispatch table
-- or else raise Constraint_Error if the actual object does not
-- implement the target interface. This case corresponds with the
-- following example:
-- function Op (Obj : Iface_1'Class) return access Ifac_2e'Class is
-- begin
-- return new Iface_2'Class'(Obj);
-- end Op;
else
Rewrite (N,
Unchecked_Convert_To (PtrT,
Make_Function_Call (Loc,
Name => New_Reference_To (RTE (RE_Displace), Loc),
Parameter_Associations => New_List (
Unchecked_Convert_To (RTE (RE_Address),
Relocate_Node (N)),
New_Occurrence_Of
(Elists.Node
(First_Elmt
(Access_Disp_Table (Etype (Base_Type (Dtyp))))),
Loc)))));
Analyze_And_Resolve (N, PtrT);
end if;
end if;
end Displace_Allocator_Pointer;
--------------------------------- ---------------------------------
-- Expand_Allocator_Expression -- -- Expand_Allocator_Expression --
--------------------------------- ---------------------------------
...@@ -371,13 +465,95 @@ package body Exp_Ch4 is ...@@ -371,13 +465,95 @@ package body Exp_Ch4 is
procedure Expand_Allocator_Expression (N : Node_Id) is procedure Expand_Allocator_Expression (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N); Loc : constant Source_Ptr := Sloc (N);
Exp : constant Node_Id := Expression (Expression (N)); Exp : constant Node_Id := Expression (Expression (N));
Indic : constant Node_Id := Subtype_Mark (Expression (N));
PtrT : constant Entity_Id := Etype (N); PtrT : constant Entity_Id := Etype (N);
DesigT : constant Entity_Id := Designated_Type (PtrT); DesigT : constant Entity_Id := Designated_Type (PtrT);
T : constant Entity_Id := Entity (Indic);
Flist : Node_Id; procedure Apply_Accessibility_Check
Node : Node_Id; (Ref : Node_Id;
Temp : Entity_Id; Built_In_Place : Boolean := False);
-- Ada 2005 (AI-344): For an allocator with a class-wide designated
-- type, generate an accessibility check to verify that the level of
-- the type of the created object is not deeper than the level of the
-- access type. If the type of the qualified expression is class-
-- wide, then always generate the check (except in the case where it
-- is known to be unnecessary, see comment below). Otherwise, only
-- generate the check if the level of the qualified expression type
-- is statically deeper than the access type. Although the static
-- accessibility will generally have been performed as a legality
-- check, it won't have been done in cases where the allocator
-- appears in generic body, so a run-time check is needed in general.
-- One special case is when the access type is declared in the same
-- scope as the class-wide allocator, in which case the check can
-- never fail, so it need not be generated. As an open issue, there
-- seem to be cases where the static level associated with the
-- class-wide object's underlying type is not sufficient to perform
-- the proper accessibility check, such as for allocators in nested
-- subprograms or accept statements initialized by class-wide formals
-- when the actual originates outside at a deeper static level. The
-- nested subprogram case might require passing accessibility levels
-- along with class-wide parameters, and the task case seems to be
-- an actual gap in the language rules that needs to be fixed by the
-- ARG. ???
-------------------------------
-- Apply_Accessibility_Check --
-------------------------------
procedure Apply_Accessibility_Check
(Ref : Node_Id;
Built_In_Place : Boolean := False)
is
Ref_Node : Node_Id;
begin
-- Note: we skip the accessibility check for the VM case, since
-- there does not seem to be any practical way of implementing it.
if Ada_Version >= Ada_05
and then VM_Target = No_VM
and then Is_Class_Wide_Type (DesigT)
and then not Scope_Suppress (Accessibility_Check)
and then
(Type_Access_Level (Etype (Exp)) > Type_Access_Level (PtrT)
or else
(Is_Class_Wide_Type (Etype (Exp))
and then Scope (PtrT) /= Current_Scope))
then
-- If the allocator was built in place Ref is already a reference
-- to the access object initialized to the result of the allocator
-- (see Exp_Ch6.Make_Build_In_Place_Call_In_Allocator). Otherwise
-- it is the entity associated with the object containing the
-- address of the allocated object.
if Built_In_Place then
Ref_Node := New_Copy (Ref);
else
Ref_Node := New_Reference_To (Ref, Loc);
end if;
Insert_Action (N,
Make_Raise_Program_Error (Loc,
Condition =>
Make_Op_Gt (Loc,
Left_Opnd =>
Build_Get_Access_Level (Loc,
Make_Attribute_Reference (Loc,
Prefix => Ref_Node,
Attribute_Name => Name_Tag)),
Right_Opnd =>
Make_Integer_Literal (Loc,
Type_Access_Level (PtrT))),
Reason => PE_Accessibility_Check_Failed));
end if;
end Apply_Accessibility_Check;
-- Local variables
Indic : constant Node_Id := Subtype_Mark (Expression (N));
T : constant Entity_Id := Entity (Indic);
Flist : Node_Id;
Node : Node_Id;
Temp : Entity_Id;
TagT : Entity_Id := Empty; TagT : Entity_Id := Empty;
-- Type used as source for tag assignment -- Type used as source for tag assignment
...@@ -387,11 +563,11 @@ package body Exp_Ch4 is ...@@ -387,11 +563,11 @@ package body Exp_Ch4 is
Aggr_In_Place : constant Boolean := Is_Delayed_Aggregate (Exp); Aggr_In_Place : constant Boolean := Is_Delayed_Aggregate (Exp);
Call_In_Place : Boolean := False;
Tag_Assign : Node_Id; Tag_Assign : Node_Id;
Tmp_Node : Node_Id; Tmp_Node : Node_Id;
-- Start of processing for Expand_Allocator_Expression
begin begin
if Is_Tagged_Type (T) or else Controlled_Type (T) then if Is_Tagged_Type (T) or else Controlled_Type (T) then
...@@ -406,7 +582,8 @@ package body Exp_Ch4 is ...@@ -406,7 +582,8 @@ package body Exp_Ch4 is
and then Is_Build_In_Place_Function_Call (Exp) and then Is_Build_In_Place_Function_Call (Exp)
then then
Make_Build_In_Place_Call_In_Allocator (N, Exp); Make_Build_In_Place_Call_In_Allocator (N, Exp);
Call_In_Place := True; Apply_Accessibility_Check (N, Built_In_Place => True);
return;
end if; end if;
-- Actions inserted before: -- Actions inserted before:
...@@ -423,7 +600,7 @@ package body Exp_Ch4 is ...@@ -423,7 +600,7 @@ package body Exp_Ch4 is
-- that could lead to a duplication of the call, which was already -- that could lead to a duplication of the call, which was already
-- substituted for the allocator. -- substituted for the allocator.
if not Aggr_In_Place and then not Call_In_Place then if not Aggr_In_Place then
Remove_Side_Effects (Exp); Remove_Side_Effects (Exp);
end if; end if;
...@@ -439,100 +616,182 @@ package body Exp_Ch4 is ...@@ -439,100 +616,182 @@ package body Exp_Ch4 is
if Is_Class_Wide_Type (T) then if Is_Class_Wide_Type (T) then
Expand_Subtype_From_Expr (Empty, T, Indic, Exp); Expand_Subtype_From_Expr (Empty, T, Indic, Exp);
Set_Expression (Expression (N), -- Ada 2005 (AI-251): If the expression is a class-wide interface
Unchecked_Convert_To (Entity (Indic), Exp)); -- object we generate code to move up "this" to reference the
-- base of the object before allocating the new object.
-- Note that Exp'Address is recursively expanded into a call
-- to Base_Address (Exp.Tag)
if Is_Class_Wide_Type (Etype (Exp))
and then Is_Interface (Etype (Exp))
then
Set_Expression
(Expression (N),
Unchecked_Convert_To (Entity (Indic),
Make_Explicit_Dereference (Loc,
Unchecked_Convert_To (RTE (RE_Tag_Ptr),
Make_Attribute_Reference (Loc,
Prefix => Exp,
Attribute_Name => Name_Address)))));
else
Set_Expression
(Expression (N),
Unchecked_Convert_To (Entity (Indic), Exp));
end if;
Analyze_And_Resolve (Expression (N), Entity (Indic)); Analyze_And_Resolve (Expression (N), Entity (Indic));
end if; end if;
if Aggr_In_Place then -- Keep separate the management of allocators returning interfaces
Tmp_Node :=
Make_Object_Declaration (Loc,
Defining_Identifier => Temp,
Object_Definition => New_Reference_To (PtrT, Loc),
Expression =>
Make_Allocator (Loc,
New_Reference_To (Etype (Exp), Loc)));
Set_Comes_From_Source if not Is_Interface (Directly_Designated_Type (PtrT)) then
(Expression (Tmp_Node), Comes_From_Source (N)); if Aggr_In_Place then
Tmp_Node :=
Make_Object_Declaration (Loc,
Defining_Identifier => Temp,
Object_Definition => New_Reference_To (PtrT, Loc),
Expression =>
Make_Allocator (Loc,
New_Reference_To (Etype (Exp), Loc)));
Set_No_Initialization (Expression (Tmp_Node)); Set_Comes_From_Source
Insert_Action (N, Tmp_Node); (Expression (Tmp_Node), Comes_From_Source (N));
if Controlled_Type (T) Set_No_Initialization (Expression (Tmp_Node));
and then Ekind (PtrT) = E_Anonymous_Access_Type Insert_Action (N, Tmp_Node);
then
-- Create local finalization list for access parameter
Flist := Get_Allocator_Final_List (N, Base_Type (T), PtrT); if Controlled_Type (T)
and then Ekind (PtrT) = E_Anonymous_Access_Type
then
-- Create local finalization list for access parameter
Flist := Get_Allocator_Final_List (N, Base_Type (T), PtrT);
end if;
Convert_Aggr_In_Allocator (Tmp_Node, Exp);
else
Node := Relocate_Node (N);
Set_Analyzed (Node);
Insert_Action (N,
Make_Object_Declaration (Loc,
Defining_Identifier => Temp,
Constant_Present => True,
Object_Definition => New_Reference_To (PtrT, Loc),
Expression => Node));
end if; end if;
Convert_Aggr_In_Allocator (Tmp_Node, Exp); -- Ada 2005 (AI-251): Handle allocators whose designated type is an
-- interface type. In this case we use the type of the qualified
-- expression to allocate the object.
else else
Node := Relocate_Node (N); declare
Set_Analyzed (Node); Def_Id : constant Entity_Id :=
Insert_Action (N, Make_Defining_Identifier (Loc,
Make_Object_Declaration (Loc, New_Internal_Name ('T'));
Defining_Identifier => Temp, New_Decl : Node_Id;
Constant_Present => True,
Object_Definition => New_Reference_To (PtrT, Loc),
Expression => Node));
end if;
-- Ada 2005 (AI-344): For an allocator with a class-wide designated begin
-- type, generate an accessibility check to verify that the level of New_Decl :=
-- the type of the created object is not deeper than the level of the Make_Full_Type_Declaration (Loc,
-- access type. If the type of the qualified expression is class- Defining_Identifier => Def_Id,
-- wide, then always generate the check (except in the case where it Type_Definition =>
-- is known to be unnecessary, see comment below). Otherwise, only Make_Access_To_Object_Definition (Loc,
-- generate the check if the level of the qualified expression type All_Present => True,
-- is statically deeper than the access type. Although the static Null_Exclusion_Present => False,
-- accessibility will generally have been performed as a legality Constant_Present => False,
-- check, it won't have been done in cases where the allocator Subtype_Indication =>
-- appears in generic body, so a run-time check is needed in general. New_Reference_To (Etype (Exp), Loc)));
-- One special case is when the access type is declared in the same
-- scope as the class-wide allocator, in which case the check can Insert_Action (N, New_Decl);
-- never fail, so it need not be generated. As an open issue, there
-- seem to be cases where the static level associated with the -- Inherit the final chain to ensure that the expansion of the
-- class-wide object's underlying type is not sufficient to perform -- aggregate is correct in case of controlled types
-- the proper accessibility check, such as for allocators in nested
-- subprograms or accept statements initialized by class-wide formals if Controlled_Type (Directly_Designated_Type (PtrT)) then
-- when the actual originates outside at a deeper static level. The Set_Associated_Final_Chain (Def_Id,
-- nested subprogram case might require passing accessibility levels Associated_Final_Chain (PtrT));
-- along with class-wide parameters, and the task case seems to be end if;
-- an actual gap in the language rules that needs to be fixed by the
-- ARG. ???
if Ada_Version >= Ada_05 -- Declare the object using the previous type declaration
and then Is_Class_Wide_Type (DesigT)
and then not Scope_Suppress (Accessibility_Check) if Aggr_In_Place then
and then Tmp_Node :=
(Type_Access_Level (Etype (Exp)) > Type_Access_Level (PtrT) Make_Object_Declaration (Loc,
or else Defining_Identifier => Temp,
(Is_Class_Wide_Type (Etype (Exp)) Object_Definition => New_Reference_To (Def_Id, Loc),
and then Scope (PtrT) /= Current_Scope)) Expression =>
then Make_Allocator (Loc,
Insert_Action (N, New_Reference_To (Etype (Exp), Loc)));
Make_Raise_Program_Error (Loc,
Condition => Set_Comes_From_Source
Make_Op_Gt (Loc, (Expression (Tmp_Node), Comes_From_Source (N));
Left_Opnd =>
Build_Get_Access_Level (Loc, Set_No_Initialization (Expression (Tmp_Node));
Make_Attribute_Reference (Loc, Insert_Action (N, Tmp_Node);
Prefix => New_Reference_To (Temp, Loc),
Attribute_Name => Name_Tag)), if Controlled_Type (T)
Right_Opnd => and then Ekind (PtrT) = E_Anonymous_Access_Type
Make_Integer_Literal (Loc, then
Type_Access_Level (PtrT))), -- Create local finalization list for access parameter
Reason => PE_Accessibility_Check_Failed));
Flist :=
Get_Allocator_Final_List (N, Base_Type (T), PtrT);
end if;
Convert_Aggr_In_Allocator (Tmp_Node, Exp);
else
Node := Relocate_Node (N);
Set_Analyzed (Node);
Insert_Action (N,
Make_Object_Declaration (Loc,
Defining_Identifier => Temp,
Constant_Present => True,
Object_Definition => New_Reference_To (Def_Id, Loc),
Expression => Node));
end if;
-- Generate an additional object containing the address of the
-- returned object. The type of this second object declaration
-- is the correct type required for the common proceessing
-- that is still performed by this subprogram. The displacement
-- of this pointer to reference the component associated with
-- the interface type will be done at the end of the common
-- processing.
New_Decl :=
Make_Object_Declaration (Loc,
Defining_Identifier => Make_Defining_Identifier (Loc,
New_Internal_Name ('P')),
Object_Definition => New_Reference_To (PtrT, Loc),
Expression => Unchecked_Convert_To (PtrT,
New_Reference_To (Temp, Loc)));
Insert_Action (N, New_Decl);
Tmp_Node := New_Decl;
Temp := Defining_Identifier (New_Decl);
end;
end if; end if;
if Java_VM then Apply_Accessibility_Check (Temp);
-- Generate the tag assignment
-- Suppress the tag assignment when VM_Target because VM tags are
-- represented implicitly in objects.
if VM_Target /= No_VM then
null;
-- Suppress the tag assignment when Java_VM because JVM tags are -- Ada 2005 (AI-251): Suppress the tag assignment with class-wide
-- represented implicitly in objects. -- interface objects because in this case the tag does not change.
elsif Is_Interface (Directly_Designated_Type (Etype (N))) then
pragma Assert (Is_Class_Wide_Type
(Directly_Designated_Type (Etype (N))));
null; null;
elsif Is_Tagged_Type (T) and then not Is_Class_Wide_Type (T) then elsif Is_Tagged_Type (T) and then not Is_Class_Wide_Type (T) then
...@@ -617,7 +876,18 @@ package body Exp_Ch4 is ...@@ -617,7 +876,18 @@ package body Exp_Ch4 is
Attach := Make_Integer_Literal (Loc, 2); Attach := Make_Integer_Literal (Loc, 2);
end if; end if;
if not Aggr_In_Place then -- Generate an Adjust call if the object will be moved. In Ada
-- 2005, the object may be inherently limited, in which case
-- there is no Adjust procedure, and the object is built in
-- place. In Ada 95, the object can be limited but not
-- inherently limited if this allocator came from a return
-- statement (we're allocating the result on the secondary
-- stack). In that case, the object will be moved, so we _do_
-- want to Adjust.
if not Aggr_In_Place
and then not Is_Inherently_Limited_Type (T)
then
Insert_Actions (N, Insert_Actions (N,
Make_Adjust_Call ( Make_Adjust_Call (
Ref => Ref =>
...@@ -642,6 +912,14 @@ package body Exp_Ch4 is ...@@ -642,6 +912,14 @@ package body Exp_Ch4 is
Rewrite (N, New_Reference_To (Temp, Loc)); Rewrite (N, New_Reference_To (Temp, Loc));
Analyze_And_Resolve (N, PtrT); Analyze_And_Resolve (N, PtrT);
-- Ada 2005 (AI-251): Displace the pointer to reference the
-- record component containing the secondary dispatch table
-- of the interface type.
if Is_Interface (Directly_Designated_Type (PtrT)) then
Displace_Allocator_Pointer (N);
end if;
elsif Aggr_In_Place then elsif Aggr_In_Place then
Temp := Temp :=
Make_Defining_Identifier (Loc, New_Internal_Name ('P')); Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
...@@ -832,12 +1110,12 @@ package body Exp_Ch4 is ...@@ -832,12 +1110,12 @@ package body Exp_Ch4 is
begin begin
-- Deal first with unpacked case, where we can call a runtime routine -- Deal first with unpacked case, where we can call a runtime routine
-- except that we avoid this for targets for which are not addressable -- except that we avoid this for targets for which are not addressable
-- by bytes, and for the JVM, since the JVM does not support direct -- by bytes, and for the JVM/CIL, since they do not support direct
-- addressing of array components. -- addressing of array components.
if not Is_Bit_Packed_Array (Typ1) if not Is_Bit_Packed_Array (Typ1)
and then Byte_Addressable and then Byte_Addressable
and then not Java_VM and then VM_Target = No_VM
then then
-- The call we generate is: -- The call we generate is:
...@@ -2500,71 +2778,235 @@ package body Exp_Ch4 is ...@@ -2500,71 +2778,235 @@ package body Exp_Ch4 is
Loc : constant Source_Ptr := Sloc (N); Loc : constant Source_Ptr := Sloc (N);
Desig : Entity_Id; Desig : Entity_Id;
Temp : Entity_Id; Temp : Entity_Id;
Node : Node_Id; Nod : Node_Id;
function Is_Local_Access_Discriminant (N : Node_Id) return Boolean; procedure Complete_Coextension_Finalization;
-- If the allocator is for an access discriminant of a stack-allocated -- Generate finalization calls for all nested coextensions of N. This
-- object, the discriminant can be allocated locally as well, to ensure -- routine may allocate list controllers if necessary.
-- that its lifetime does not exceed that of the enclosing object.
-- This is an optimization mandated / suggested by Ada 2005 AI-162.
---------------------------------- procedure Rewrite_Coextension (N : Node_Id);
-- Is_Local_Access_Discriminant -- -- Static coextensions have the same lifetime as the entity they
---------------------------------- -- constrain. Such occurences can be rewritten as aliased objects
-- and their unrestricted access used instead of the coextension.
function Is_Local_Access_Discriminant (N : Node_Id) return Boolean is ---------------------------------------
Decl : Node_Id; -- Complete_Coextension_Finalization --
Temp : Entity_Id; ---------------------------------------
begin procedure Complete_Coextension_Finalization is
if Nkind (Parent (N)) = N_Index_Or_Discriminant_Constraint Coext : Node_Id;
and then not Is_Coextension (N) Coext_Elmt : Elmt_Id;
and then not Is_Record_Type (Current_Scope) Flist : Node_Id;
then Ref : Node_Id;
Temp :=
Make_Defining_Identifier (Loc,
Chars => New_Internal_Name ('T'));
Decl := function Inside_A_Return_Statement (N : Node_Id) return Boolean;
Make_Object_Declaration (Loc, -- Determine whether node N is part of a return statement
Defining_Identifier => Temp,
Aliased_Present => True, function Needs_Initialization_Call (N : Node_Id) return Boolean;
Object_Definition => New_Occurrence_Of (Etyp, Loc)); -- Determine whether node N is a subtype indicator allocator which
-- asts a coextension. Such coextensions need initialization.
-------------------------------
-- Inside_A_Return_Statement --
-------------------------------
function Inside_A_Return_Statement (N : Node_Id) return Boolean is
P : Node_Id;
begin
P := Parent (N);
while Present (P) loop
if Nkind (P) = N_Extended_Return_Statement
or else Nkind (P) = N_Return_Statement
then
return True;
-- Stop the traversal when we reach a subprogram body
elsif Nkind (P) = N_Subprogram_Body then
return False;
end if;
P := Parent (P);
end loop;
return False;
end Inside_A_Return_Statement;
-------------------------------
-- Needs_Initialization_Call --
-------------------------------
function Needs_Initialization_Call (N : Node_Id) return Boolean is
Obj_Decl : Node_Id;
begin
if Nkind (N) = N_Explicit_Dereference
and then Nkind (Prefix (N)) = N_Identifier
and then Nkind (Parent (Entity (Prefix (N)))) =
N_Object_Declaration
then
Obj_Decl := Parent (Entity (Prefix (N)));
if Nkind (Expression (N)) = N_Qualified_Expression then return
Set_Expression (Decl, Expression (Expression (N))); Present (Expression (Obj_Decl))
and then Nkind (Expression (Obj_Decl)) = N_Allocator
and then Nkind (Expression (Expression (Obj_Decl))) /=
N_Qualified_Expression;
end if; end if;
return False;
end Needs_Initialization_Call;
-- Start of processing for Complete_Coextension_Finalization
begin
-- When a coextension root is inside a return statement, we need to
-- use the finalization chain of the function's scope. This does not
-- apply for controlled named access types because in those cases we
-- can use the finalization chain of the type itself.
if Inside_A_Return_Statement (N)
and then
(Ekind (PtrT) = E_Anonymous_Access_Type
or else
(Ekind (PtrT) = E_Access_Type
and then No (Associated_Final_Chain (PtrT))))
then
declare declare
Nod : Node_Id; Decl : Node_Id;
Outer_S : Entity_Id;
S : Entity_Id := Current_Scope;
begin begin
Nod := Parent (N); while Present (S) and then S /= Standard_Standard loop
while Present (Nod) loop if Ekind (S) = E_Function then
exit when Outer_S := Scope (S);
Nkind (Nod) in N_Statement_Other_Than_Procedure_Call
or else Nkind (Nod) = N_Procedure_Call_Statement -- Retrieve the declaration of the body
or else Nkind (Nod) in N_Declaration;
Nod := Parent (Nod); Decl := Parent (Parent (
Corresponding_Body (Parent (Parent (S)))));
exit;
end if;
S := Scope (S);
end loop; end loop;
Insert_Before (Nod, Decl); -- Push the scope of the function body since we are inserting
Analyze (Decl); -- the list before the body, but we are currently in the body
-- itself. Override the finalization list of PtrT since the
-- finalization context is now different.
Push_Scope (Outer_S);
Build_Final_List (Decl, PtrT);
Pop_Scope;
end; end;
Rewrite (N, -- The root allocator may not be controlled, but it still needs a
Make_Attribute_Reference (Loc, -- finalization list for all nested coextensions.
Prefix => New_Occurrence_Of (Temp, Loc),
Attribute_Name => Name_Unrestricted_Access));
Analyze_And_Resolve (N, PtrT); elsif No (Associated_Final_Chain (PtrT)) then
Build_Final_List (N, PtrT);
end if;
return True; Flist :=
Make_Selected_Component (Loc,
Prefix =>
New_Reference_To (Associated_Final_Chain (PtrT), Loc),
Selector_Name =>
Make_Identifier (Loc, Name_F));
Coext_Elmt := First_Elmt (Coextensions (N));
while Present (Coext_Elmt) loop
Coext := Node (Coext_Elmt);
-- Generate:
-- typ! (coext.all)
if Nkind (Coext) = N_Identifier then
Ref := Make_Unchecked_Type_Conversion (Loc,
Subtype_Mark =>
New_Reference_To (Etype (Coext), Loc),
Expression =>
Make_Explicit_Dereference (Loc,
New_Copy_Tree (Coext)));
else
Ref := New_Copy_Tree (Coext);
end if;
else -- Generate:
return False; -- initialize (Ref)
-- attach_to_final_list (Ref, Flist, 2)
if Needs_Initialization_Call (Coext) then
Insert_Actions (N,
Make_Init_Call (
Ref => Ref,
Typ => Etype (Coext),
Flist_Ref => Flist,
With_Attach => Make_Integer_Literal (Loc, Uint_2)));
-- Generate:
-- attach_to_final_list (Ref, Flist, 2)
else
Insert_Action (N,
Make_Attach_Call (
Obj_Ref => Ref,
Flist_Ref => New_Copy_Tree (Flist),
With_Attach => Make_Integer_Literal (Loc, Uint_2)));
end if;
Next_Elmt (Coext_Elmt);
end loop;
end Complete_Coextension_Finalization;
-------------------------
-- Rewrite_Coextension --
-------------------------
procedure Rewrite_Coextension (N : Node_Id) is
Temp : constant Node_Id :=
Make_Defining_Identifier (Loc,
New_Internal_Name ('C'));
-- Generate:
-- Cnn : aliased Etyp;
Decl : constant Node_Id :=
Make_Object_Declaration (Loc,
Defining_Identifier => Temp,
Aliased_Present => True,
Object_Definition =>
New_Occurrence_Of (Etyp, Loc));
Nod : Node_Id;
begin
if Nkind (Expression (N)) = N_Qualified_Expression then
Set_Expression (Decl, Expression (Expression (N)));
end if; end if;
end Is_Local_Access_Discriminant;
-- Find the proper insertion node for the declaration
Nod := Parent (N);
while Present (Nod) loop
exit when Nkind (Nod) in N_Statement_Other_Than_Procedure_Call
or else Nkind (Nod) = N_Procedure_Call_Statement
or else Nkind (Nod) in N_Declaration;
Nod := Parent (Nod);
end loop;
Insert_Before (Nod, Decl);
Analyze (Decl);
Rewrite (N,
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (Temp, Loc),
Attribute_Name => Name_Unrestricted_Access));
Analyze_And_Resolve (N, PtrT);
end Rewrite_Coextension;
-- Start of processing for Expand_N_Allocator -- Start of processing for Expand_N_Allocator
...@@ -2582,7 +3024,7 @@ package body Exp_Ch4 is ...@@ -2582,7 +3024,7 @@ package body Exp_Ch4 is
if Present (Storage_Pool (N)) then if Present (Storage_Pool (N)) then
if Is_RTE (Storage_Pool (N), RE_SS_Pool) then if Is_RTE (Storage_Pool (N), RE_SS_Pool) then
if not Java_VM then if VM_Target = No_VM then
Set_Procedure_To_Call (N, RTE (RE_SS_Allocate)); Set_Procedure_To_Call (N, RTE (RE_SS_Allocate));
end if; end if;
...@@ -2664,324 +3106,349 @@ package body Exp_Ch4 is ...@@ -2664,324 +3106,349 @@ package body Exp_Ch4 is
-- instead of an allocator we create a local value and constrain the -- instead of an allocator we create a local value and constrain the
-- the enclosing object with the corresponding access attribute. -- the enclosing object with the corresponding access attribute.
if Is_Local_Access_Discriminant (N) then if Is_Static_Coextension (N) then
Rewrite_Coextension (N);
return; return;
end if; end if;
-- The current allocator creates an object which may contain nested
-- coextensions. Use the current allocator's finalization list to
-- generate finalization call for all nested coextensions.
if Is_Coextension_Root (N) then
Complete_Coextension_Finalization;
end if;
-- Handle case of qualified expression (other than optimization above) -- Handle case of qualified expression (other than optimization above)
if Nkind (Expression (N)) = N_Qualified_Expression then if Nkind (Expression (N)) = N_Qualified_Expression then
Expand_Allocator_Expression (N); Expand_Allocator_Expression (N);
return;
end if;
-- If the allocator is for a type which requires initialization, and -- If the allocator is for a type which requires initialization, and
-- there is no initial value (i.e. operand is a subtype indication -- there is no initial value (i.e. operand is a subtype indication
-- rather than a qualifed expression), then we must generate a call -- rather than a qualifed expression), then we must generate a call
-- to the initialization routine. This is done using an expression -- to the initialization routine. This is done using an expression
-- actions node: -- actions node:
--
-- [Pnnn : constant ptr_T := new (T); Init (Pnnn.all,...); Pnnn]
--
-- Here ptr_T is the pointer type for the allocator, and T is the
-- subtype of the allocator. A special case arises if the designated
-- type of the access type is a task or contains tasks. In this case
-- the call to Init (Temp.all ...) is replaced by code that ensures
-- that tasks get activated (see Exp_Ch9.Build_Task_Allocate_Block
-- for details). In addition, if the type T is a task T, then the
-- first argument to Init must be converted to the task record type.
else -- [Pnnn : constant ptr_T := new (T); Init (Pnnn.all,...); Pnnn]
declare
T : constant Entity_Id := Entity (Expression (N));
Init : Entity_Id;
Arg1 : Node_Id;
Args : List_Id;
Decls : List_Id;
Decl : Node_Id;
Discr : Elmt_Id;
Flist : Node_Id;
Temp_Decl : Node_Id;
Temp_Type : Entity_Id;
Attach_Level : Uint;
begin -- Here ptr_T is the pointer type for the allocator, and T is the
if No_Initialization (N) then -- subtype of the allocator. A special case arises if the designated
null; -- type of the access type is a task or contains tasks. In this case
-- the call to Init (Temp.all ...) is replaced by code that ensures
-- that tasks get activated (see Exp_Ch9.Build_Task_Allocate_Block
-- for details). In addition, if the type T is a task T, then the
-- first argument to Init must be converted to the task record type.
-- Case of no initialization procedure present declare
T : constant Entity_Id := Entity (Expression (N));
Init : Entity_Id;
Arg1 : Node_Id;
Args : List_Id;
Decls : List_Id;
Decl : Node_Id;
Discr : Elmt_Id;
Flist : Node_Id;
Temp_Decl : Node_Id;
Temp_Type : Entity_Id;
Attach_Level : Uint;
elsif not Has_Non_Null_Base_Init_Proc (T) then begin
if No_Initialization (N) then
null;
-- Case of simple initialization required -- Case of no initialization procedure present
if Needs_Simple_Initialization (T) then elsif not Has_Non_Null_Base_Init_Proc (T) then
Rewrite (Expression (N),
Make_Qualified_Expression (Loc,
Subtype_Mark => New_Occurrence_Of (T, Loc),
Expression => Get_Simple_Init_Val (T, Loc)));
Analyze_And_Resolve (Expression (Expression (N)), T); -- Case of simple initialization required
Analyze_And_Resolve (Expression (N), T);
Set_Paren_Count (Expression (Expression (N)), 1);
Expand_N_Allocator (N);
-- No initialization required if Needs_Simple_Initialization (T) then
Rewrite (Expression (N),
Make_Qualified_Expression (Loc,
Subtype_Mark => New_Occurrence_Of (T, Loc),
Expression => Get_Simple_Init_Val (T, Loc)));
else Analyze_And_Resolve (Expression (Expression (N)), T);
null; Analyze_And_Resolve (Expression (N), T);
end if; Set_Paren_Count (Expression (Expression (N)), 1);
Expand_N_Allocator (N);
-- Case of initialization procedure present, must be called -- No initialization required
else else
Init := Base_Init_Proc (T); null;
Node := N; end if;
Temp :=
Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
-- Construct argument list for the initialization routine call -- Case of initialization procedure present, must be called
-- The CPP constructor needs the address directly
if Is_CPP_Class (T) then else
Arg1 := New_Reference_To (Temp, Loc); Init := Base_Init_Proc (T);
Temp_Type := T; Nod := N;
Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
else -- Construct argument list for the initialization routine call.
Arg1 := -- The CPP constructor needs the address directly
Make_Explicit_Dereference (Loc,
Prefix => New_Reference_To (Temp, Loc));
Set_Assignment_OK (Arg1);
Temp_Type := PtrT;
-- The initialization procedure expects a specific type. if if Is_CPP_Class (T) then
-- the context is access to class wide, indicate that the Arg1 := New_Reference_To (Temp, Loc);
-- object being allocated has the right specific type. Temp_Type := T;
if Is_Class_Wide_Type (Dtyp) then else
Arg1 := Unchecked_Convert_To (T, Arg1); Arg1 := Make_Explicit_Dereference (Loc,
end if; Prefix => New_Reference_To (Temp, Loc));
end if; Set_Assignment_OK (Arg1);
Temp_Type := PtrT;
-- If designated type is a concurrent type or if it is private -- The initialization procedure expects a specific type. if
-- type whose definition is a concurrent type, the first -- the context is access to class wide, indicate that the
-- argument in the Init routine has to be unchecked conversion -- object being allocated has the right specific type.
-- to the corresponding record type. If the designated type is
-- a derived type, we also convert the argument to its root
-- type.
if Is_Concurrent_Type (T) then if Is_Class_Wide_Type (Dtyp) then
Arg1 := Arg1 := Unchecked_Convert_To (T, Arg1);
Unchecked_Convert_To (Corresponding_Record_Type (T), Arg1); end if;
end if;
elsif Is_Private_Type (T) -- If designated type is a concurrent type or if it is private
and then Present (Full_View (T)) -- type whose definition is a concurrent type, the first argument
and then Is_Concurrent_Type (Full_View (T)) -- in the Init routine has to be unchecked conversion to the
then -- corresponding record type. If the designated type is a derived
Arg1 := -- type, we also convert the argument to its root type.
Unchecked_Convert_To
(Corresponding_Record_Type (Full_View (T)), Arg1);
elsif Etype (First_Formal (Init)) /= Base_Type (T) then if Is_Concurrent_Type (T) then
Arg1 :=
Unchecked_Convert_To (Corresponding_Record_Type (T), Arg1);
declare elsif Is_Private_Type (T)
Ftyp : constant Entity_Id := Etype (First_Formal (Init)); and then Present (Full_View (T))
and then Is_Concurrent_Type (Full_View (T))
then
Arg1 :=
Unchecked_Convert_To
(Corresponding_Record_Type (Full_View (T)), Arg1);
begin elsif Etype (First_Formal (Init)) /= Base_Type (T) then
Arg1 := OK_Convert_To (Etype (Ftyp), Arg1); declare
Set_Etype (Arg1, Ftyp); Ftyp : constant Entity_Id := Etype (First_Formal (Init));
end;
end if; begin
Arg1 := OK_Convert_To (Etype (Ftyp), Arg1);
Set_Etype (Arg1, Ftyp);
end;
end if;
Args := New_List (Arg1); Args := New_List (Arg1);
-- For the task case, pass the Master_Id of the access type as -- For the task case, pass the Master_Id of the access type as
-- the value of the _Master parameter, and _Chain as the value -- the value of the _Master parameter, and _Chain as the value
-- of the _Chain parameter (_Chain will be defined as part of -- of the _Chain parameter (_Chain will be defined as part of
-- the generated code for the allocator). -- the generated code for the allocator).
-- In Ada 2005, the context may be a function that returns an -- In Ada 2005, the context may be a function that returns an
-- anonymous access type. In that case the Master_Id has been -- anonymous access type. In that case the Master_Id has been
-- created when expanding the function declaration. -- created when expanding the function declaration.
if Has_Task (T) then if Has_Task (T) then
if No (Master_Id (Base_Type (PtrT))) then if No (Master_Id (Base_Type (PtrT))) then
-- The designated type was an incomplete type, and the -- If we have a non-library level task with the restriction
-- access type did not get expanded. Salvage it now. -- No_Task_Hierarchy set, then no point in expanding.
pragma Assert (Present (Parent (Base_Type (PtrT)))); if not Is_Library_Level_Entity (T)
Expand_N_Full_Type_Declaration and then Restriction_Active (No_Task_Hierarchy)
(Parent (Base_Type (PtrT))); then
return;
end if; end if;
-- If the context of the allocator is a declaration or an -- The designated type was an incomplete type, and the
-- assignment, we can generate a meaningful image for it, -- access type did not get expanded. Salvage it now.
-- even though subsequent assignments might remove the
-- connection between task and entity. We build this image
-- when the left-hand side is a simple variable, a simple
-- indexed assignment or a simple selected component.
if Nkind (Parent (N)) = N_Assignment_Statement then
declare
Nam : constant Node_Id := Name (Parent (N));
begin
if Is_Entity_Name (Nam) then
Decls :=
Build_Task_Image_Decls (
Loc,
New_Occurrence_Of
(Entity (Nam), Sloc (Nam)), T);
elsif (Nkind (Nam) = N_Indexed_Component
or else Nkind (Nam) = N_Selected_Component)
and then Is_Entity_Name (Prefix (Nam))
then
Decls :=
Build_Task_Image_Decls
(Loc, Nam, Etype (Prefix (Nam)));
else
Decls := Build_Task_Image_Decls (Loc, T, T);
end if;
end;
elsif Nkind (Parent (N)) = N_Object_Declaration then pragma Assert (Present (Parent (Base_Type (PtrT))));
Decls := Expand_N_Full_Type_Declaration (Parent (Base_Type (PtrT)));
Build_Task_Image_Decls ( end if;
Loc, Defining_Identifier (Parent (N)), T);
else -- If the context of the allocator is a declaration or an
Decls := Build_Task_Image_Decls (Loc, T, T); -- assignment, we can generate a meaningful image for it,
end if; -- even though subsequent assignments might remove the
-- connection between task and entity. We build this image
-- when the left-hand side is a simple variable, a simple
-- indexed assignment or a simple selected component.
Append_To (Args, if Nkind (Parent (N)) = N_Assignment_Statement then
New_Reference_To declare
(Master_Id (Base_Type (Root_Type (PtrT))), Loc)); Nam : constant Node_Id := Name (Parent (N));
Append_To (Args, Make_Identifier (Loc, Name_uChain));
Decl := Last (Decls); begin
Append_To (Args, if Is_Entity_Name (Nam) then
New_Occurrence_Of (Defining_Identifier (Decl), Loc)); Decls :=
Build_Task_Image_Decls (
Loc,
New_Occurrence_Of
(Entity (Nam), Sloc (Nam)), T);
elsif (Nkind (Nam) = N_Indexed_Component
or else Nkind (Nam) = N_Selected_Component)
and then Is_Entity_Name (Prefix (Nam))
then
Decls :=
Build_Task_Image_Decls
(Loc, Nam, Etype (Prefix (Nam)));
else
Decls := Build_Task_Image_Decls (Loc, T, T);
end if;
end;
-- Has_Task is false, Decls not used elsif Nkind (Parent (N)) = N_Object_Declaration then
Decls :=
Build_Task_Image_Decls (
Loc, Defining_Identifier (Parent (N)), T);
else else
Decls := No_List; Decls := Build_Task_Image_Decls (Loc, T, T);
end if; end if;
-- Add discriminants if discriminated type Append_To (Args,
New_Reference_To
(Master_Id (Base_Type (Root_Type (PtrT))), Loc));
Append_To (Args, Make_Identifier (Loc, Name_uChain));
declare Decl := Last (Decls);
Dis : Boolean := False; Append_To (Args,
Typ : Entity_Id; New_Occurrence_Of (Defining_Identifier (Decl), Loc));
begin -- Has_Task is false, Decls not used
if Has_Discriminants (T) then
Dis := True;
Typ := T;
elsif Is_Private_Type (T) else
and then Present (Full_View (T)) Decls := No_List;
and then Has_Discriminants (Full_View (T)) end if;
-- Add discriminants if discriminated type
declare
Dis : Boolean := False;
Typ : Entity_Id;
begin
if Has_Discriminants (T) then
Dis := True;
Typ := T;
elsif Is_Private_Type (T)
and then Present (Full_View (T))
and then Has_Discriminants (Full_View (T))
then
Dis := True;
Typ := Full_View (T);
end if;
if Dis then
-- If the allocated object will be constrained by the
-- default values for discriminants, then build a
-- subtype with those defaults, and change the allocated
-- subtype to that. Note that this happens in fewer
-- cases in Ada 2005 (AI-363).
if not Is_Constrained (Typ)
and then Present (Discriminant_Default_Value
(First_Discriminant (Typ)))
and then (Ada_Version < Ada_05
or else not Has_Constrained_Partial_View (Typ))
then then
Dis := True; Typ := Build_Default_Subtype (Typ, N);
Typ := Full_View (T); Set_Expression (N, New_Reference_To (Typ, Loc));
end if; end if;
if Dis then Discr := First_Elmt (Discriminant_Constraint (Typ));
-- If the allocated object will be constrained by the while Present (Discr) loop
-- default values for discriminants, then build a Nod := Node (Discr);
-- subtype with those defaults, and change the allocated Append (New_Copy_Tree (Node (Discr)), Args);
-- subtype to that. Note that this happens in fewer
-- cases in Ada 2005 (AI-363). -- AI-416: when the discriminant constraint is an
-- anonymous access type make sure an accessibility
if not Is_Constrained (Typ) -- check is inserted if necessary (3.10.2(22.q/2))
and then Present (Discriminant_Default_Value
(First_Discriminant (Typ))) if Ada_Version >= Ada_05
and then (Ada_Version < Ada_05 and then Ekind (Etype (Nod)) = E_Anonymous_Access_Type
or else not Has_Constrained_Partial_View (Typ))
then then
Typ := Build_Default_Subtype (Typ, N); Apply_Accessibility_Check (Nod, Typ);
Set_Expression (N, New_Reference_To (Typ, Loc));
end if; end if;
Discr := First_Elmt (Discriminant_Constraint (Typ)); Next_Elmt (Discr);
while Present (Discr) loop end loop;
Node := Elists.Node (Discr); end if;
Append (New_Copy_Tree (Elists.Node (Discr)), Args); end;
-- AI-416: when the discriminant constraint is an -- We set the allocator as analyzed so that when we analyze the
-- anonymous access type make sure an accessibility -- expression actions node, we do not get an unwanted recursive
-- check is inserted if necessary (3.10.2(22.q/2)) -- expansion of the allocator expression.
if Ada_Version >= Ada_05 Set_Analyzed (N, True);
and then Nod := Relocate_Node (N);
Ekind (Etype (Node)) = E_Anonymous_Access_Type
then
Apply_Accessibility_Check (Node, Typ);
end if;
Next_Elmt (Discr); -- Here is the transformation:
end loop; -- input: new T
end if; -- output: Temp : constant ptr_T := new T;
end; -- Init (Temp.all, ...);
-- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
-- <CTRL> Initialize (Finalizable (Temp.all));
-- We set the allocator as analyzed so that when we analyze the -- Here ptr_T is the pointer type for the allocator, and is the
-- expression actions node, we do not get an unwanted recursive -- subtype of the allocator.
-- expansion of the allocator expression.
Set_Analyzed (N, True); Temp_Decl :=
Node := Relocate_Node (N); Make_Object_Declaration (Loc,
Defining_Identifier => Temp,
Constant_Present => True,
Object_Definition => New_Reference_To (Temp_Type, Loc),
Expression => Nod);
-- Here is the transformation: Set_Assignment_OK (Temp_Decl);
-- input: new T
-- output: Temp : constant ptr_T := new T;
-- Init (Temp.all, ...);
-- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
-- <CTRL> Initialize (Finalizable (Temp.all));
-- Here ptr_T is the pointer type for the allocator, and is the if Is_CPP_Class (T) then
-- subtype of the allocator. Set_Aliased_Present (Temp_Decl);
end if;
Temp_Decl := Insert_Action (N, Temp_Decl, Suppress => All_Checks);
Make_Object_Declaration (Loc,
Defining_Identifier => Temp,
Constant_Present => True,
Object_Definition => New_Reference_To (Temp_Type, Loc),
Expression => Node);
Set_Assignment_OK (Temp_Decl); -- If the designated type is a task type or contains tasks,
-- create block to activate created tasks, and insert
-- declaration for Task_Image variable ahead of call.
if Is_CPP_Class (T) then if Has_Task (T) then
Set_Aliased_Present (Temp_Decl); declare
end if; L : constant List_Id := New_List;
Blk : Node_Id;
Insert_Action (N, Temp_Decl, Suppress => All_Checks); begin
Build_Task_Allocate_Block (L, Nod, Args);
Blk := Last (L);
-- If the designated type is a task type or contains tasks, Insert_List_Before (First (Declarations (Blk)), Decls);
-- create block to activate created tasks, and insert Insert_Actions (N, L);
-- declaration for Task_Image variable ahead of call. end;
if Has_Task (T) then else
declare Insert_Action (N,
L : constant List_Id := New_List; Make_Procedure_Call_Statement (Loc,
Blk : Node_Id; Name => New_Reference_To (Init, Loc),
Parameter_Associations => Args));
end if;
begin if Controlled_Type (T) then
Build_Task_Allocate_Block (L, Node, Args);
Blk := Last (L);
Insert_List_Before (First (Declarations (Blk)), Decls); -- Postpone the generation of a finalization call for the
Insert_Actions (N, L); -- current allocator if it acts as a coextension.
end;
else if Is_Coextension (N) then
Insert_Action (N, if No (Coextensions (N)) then
Make_Procedure_Call_Statement (Loc, Set_Coextensions (N, New_Elmt_List);
Name => New_Reference_To (Init, Loc), end if;
Parameter_Associations => Args));
end if; Append_Elmt (New_Copy_Tree (Arg1), Coextensions (N));
if Controlled_Type (T) then else
Flist := Get_Allocator_Final_List (N, Base_Type (T), PtrT); Flist := Get_Allocator_Final_List (N, Base_Type (T), PtrT);
-- Anonymous access types created for access parameters -- Anonymous access types created for access parameters
...@@ -2994,9 +3461,9 @@ package body Exp_Ch4 is ...@@ -2994,9 +3461,9 @@ package body Exp_Ch4 is
-- Work needed for access discriminants in Ada 2005 ??? -- Work needed for access discriminants in Ada 2005 ???
if Ekind (PtrT) = E_Anonymous_Access_Type if Ekind (PtrT) = E_Anonymous_Access_Type
and then and then
Nkind (Associated_Node_For_Itype (PtrT)) Nkind (Associated_Node_For_Itype (PtrT))
not in N_Subprogram_Specification not in N_Subprogram_Specification
then then
Attach_Level := Uint_1; Attach_Level := Uint_1;
else else
...@@ -3008,60 +3475,32 @@ package body Exp_Ch4 is ...@@ -3008,60 +3475,32 @@ package body Exp_Ch4 is
Ref => New_Copy_Tree (Arg1), Ref => New_Copy_Tree (Arg1),
Typ => T, Typ => T,
Flist_Ref => Flist, Flist_Ref => Flist,
With_Attach => Make_Integer_Literal (Loc, With_Attach => Make_Integer_Literal
Attach_Level))); (Loc, Attach_Level)));
end if;
if Is_CPP_Class (T) then
Rewrite (N,
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Temp, Loc),
Attribute_Name => Name_Unchecked_Access));
else
Rewrite (N, New_Reference_To (Temp, Loc));
end if; end if;
end if;
Analyze_And_Resolve (N, PtrT); if Is_CPP_Class (T) then
Rewrite (N,
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Temp, Loc),
Attribute_Name => Name_Unchecked_Access));
else
Rewrite (N, New_Reference_To (Temp, Loc));
end if; end if;
end;
end if;
-- Ada 2005 (AI-251): If the allocated object is accessed through an Analyze_And_Resolve (N, PtrT);
-- access to class-wide interface we force the displacement of the end if;
-- pointer to the allocated object to reference the corresponding end;
-- secondary dispatch table.
if Is_Class_Wide_Type (Dtyp) -- Ada 2005 (AI-251): If the allocator is for a class-wide interface
-- object that has been rewritten as a reference, we displace "this"
-- to reference properly its secondary dispatch table.
if Nkind (N) = N_Identifier
and then Is_Interface (Dtyp) and then Is_Interface (Dtyp)
then then
declare Displace_Allocator_Pointer (N);
Saved_Typ : constant Entity_Id := Etype (N);
begin
-- 1) Get access to the allocated object
Rewrite (N,
Make_Explicit_Dereference (Loc,
Relocate_Node (N)));
Set_Etype (N, Etyp);
Set_Analyzed (N);
-- 2) Add the conversion to displace the pointer to reference
-- the secondary dispatch table.
Rewrite (N, Convert_To (Dtyp, Relocate_Node (N)));
Analyze_And_Resolve (N, Dtyp);
-- 3) The 'access to the secondary dispatch table will be used as
-- the value returned by the allocator.
Rewrite (N,
Make_Attribute_Reference (Loc,
Prefix => Relocate_Node (N),
Attribute_Name => Name_Access));
Set_Etype (N, Saved_Typ);
Set_Analyzed (N);
end;
end if; end if;
exception exception
...@@ -3303,6 +3742,7 @@ package body Exp_Ch4 is ...@@ -3303,6 +3742,7 @@ package body Exp_Ch4 is
and then Nkind (Rop) in N_Has_Entity and then Nkind (Rop) in N_Has_Entity
and then Etype (Lop) = Entity (Rop) and then Etype (Lop) = Entity (Rop)
and then Comes_From_Source (N) and then Comes_From_Source (N)
and then VM_Target = No_VM
then then
Substitute_Valid_Check; Substitute_Valid_Check;
return; return;
...@@ -3341,6 +3781,7 @@ package body Exp_Ch4 is ...@@ -3341,6 +3781,7 @@ package body Exp_Ch4 is
and then Nkind (Prefix (Hi_Orig)) in N_Has_Entity and then Nkind (Prefix (Hi_Orig)) in N_Has_Entity
and then Entity (Prefix (Hi_Orig)) = Etype (Lop) and then Entity (Prefix (Hi_Orig)) = Etype (Lop)
and then Comes_From_Source (N) and then Comes_From_Source (N)
and then VM_Target = No_VM
then then
Substitute_Valid_Check; Substitute_Valid_Check;
return; return;
...@@ -3416,12 +3857,12 @@ package body Exp_Ch4 is ...@@ -3416,12 +3857,12 @@ package body Exp_Ch4 is
if Is_Tagged_Type (Typ) then if Is_Tagged_Type (Typ) then
-- No expansion will be performed when Java_VM, as the JVM back -- No expansion will be performed when VM_Target, as the VM
-- end will handle the membership tests directly (tags are not -- back-ends will handle the membership tests directly (tags
-- explicitly represented in Java objects, so the normal tagged -- are not explicitly represented in Java objects, so the
-- membership expansion is not what we want). -- normal tagged membership expansion is not what we want).
if not Java_VM then if VM_Target = No_VM then
Rewrite (N, Tagged_Membership (N)); Rewrite (N, Tagged_Membership (N));
Analyze_And_Resolve (N, Rtyp); Analyze_And_Resolve (N, Rtyp);
end if; end if;
...@@ -3791,7 +4232,7 @@ package body Exp_Ch4 is ...@@ -3791,7 +4232,7 @@ package body Exp_Ch4 is
Agg : Node_Id; Agg : Node_Id;
begin begin
if Ekind (Typ) = E_Access_Protected_Subprogram_Type then if Is_Access_Protected_Subprogram_Type (Typ) then
Agg := Agg :=
Make_Aggregate (Loc, Make_Aggregate (Loc,
Expressions => New_List ( Expressions => New_List (
...@@ -3961,19 +4402,37 @@ package body Exp_Ch4 is ...@@ -3961,19 +4402,37 @@ package body Exp_Ch4 is
-- Initialize global variables showing run-time status -- Initialize global variables showing run-time status
if Max_Available_String_Operands < 1 then if Max_Available_String_Operands < 1 then
if not RTE_Available (RE_Str_Concat) then
-- In No_Run_Time mode, consider that no entities are available
-- This seems wrong, RTE_Available should return False for any entity
-- that is not in the special No_Run_Time list of allowed entities???
if No_Run_Time_Mode then
Max_Available_String_Operands := 0;
-- Otherwise see what routines are available and set max operand
-- count according to the highest count available in the run-time.
elsif not RTE_Available (RE_Str_Concat) then
Max_Available_String_Operands := 0; Max_Available_String_Operands := 0;
elsif not RTE_Available (RE_Str_Concat_3) then elsif not RTE_Available (RE_Str_Concat_3) then
Max_Available_String_Operands := 2; Max_Available_String_Operands := 2;
elsif not RTE_Available (RE_Str_Concat_4) then elsif not RTE_Available (RE_Str_Concat_4) then
Max_Available_String_Operands := 3; Max_Available_String_Operands := 3;
elsif not RTE_Available (RE_Str_Concat_5) then elsif not RTE_Available (RE_Str_Concat_5) then
Max_Available_String_Operands := 4; Max_Available_String_Operands := 4;
else else
Max_Available_String_Operands := 5; Max_Available_String_Operands := 5;
end if; end if;
Char_Concat_Available := Char_Concat_Available :=
not No_Run_Time_Mode
and then
RTE_Available (RE_Str_Concat_CC) RTE_Available (RE_Str_Concat_CC)
and then and then
RTE_Available (RE_Str_Concat_CS) RTE_Available (RE_Str_Concat_CS)
...@@ -6537,12 +6996,14 @@ package body Exp_Ch4 is ...@@ -6537,12 +6996,14 @@ package body Exp_Ch4 is
-- already loaded to avoid the addition of an undesired dependence -- already loaded to avoid the addition of an undesired dependence
-- on such run-time unit. -- on such run-time unit.
and then not and then
(RTU_Loaded (Ada_Tags) (VM_Target /= No_VM
and then Nkind (Prefix (N)) = N_Selected_Component or else not
and then Present (Entity (Selector_Name (Prefix (N)))) (RTU_Loaded (Ada_Tags)
and then Entity (Selector_Name (Prefix (N))) = and then Nkind (Prefix (N)) = N_Selected_Component
RTE_Record_Component (RE_Prims_Ptr)) and then Present (Entity (Selector_Name (Prefix (N))))
and then Entity (Selector_Name (Prefix (N))) =
RTE_Record_Component (RE_Prims_Ptr)))
then then
Enable_Range_Check (Discrete_Range (N)); Enable_Range_Check (Discrete_Range (N));
end if; end if;
...@@ -7549,6 +8010,9 @@ package body Exp_Ch4 is ...@@ -7549,6 +8010,9 @@ package body Exp_Ch4 is
then then
return Suitable_Element (Next_Entity (C)); return Suitable_Element (Next_Entity (C));
elsif Is_Interface (Etype (C)) then
return Suitable_Element (Next_Entity (C));
else else
return C; return C;
end if; end if;
...@@ -7661,22 +8125,28 @@ package body Exp_Ch4 is ...@@ -7661,22 +8125,28 @@ package body Exp_Ch4 is
Loc : constant Source_Ptr := Sloc (N); Loc : constant Source_Ptr := Sloc (N);
Owner : Entity_Id := PtrT; Owner : Entity_Id := PtrT;
-- The entity whose finalisation list must be used to attach the -- The entity whose finalization list must be used to attach the
-- allocated object. -- allocated object.
begin begin
if Ekind (PtrT) = E_Anonymous_Access_Type then if Ekind (PtrT) = E_Anonymous_Access_Type then
-- If the context is an access parameter, we need to create a
-- non-anonymous access type in order to have a usable final list,
-- because there is otherwise no pool to which the allocated object
-- can belong. We create both the type and the finalization chain
-- here, because freezing an internal type does not create such a
-- chain. The Final_Chain that is thus created is shared by the
-- access parameter. The access type is tested against the result
-- type of the function to exclude allocators whose type is an
-- anonymous access result type.
if Nkind (Associated_Node_For_Itype (PtrT)) if Nkind (Associated_Node_For_Itype (PtrT))
in N_Subprogram_Specification in N_Subprogram_Specification
and then
PtrT /=
Etype (Defining_Unit_Name (Associated_Node_For_Itype (PtrT)))
then then
-- If the context is an access parameter, we need to create
-- a non-anonymous access type in order to have a usable
-- final list, because there is otherwise no pool to which
-- the allocated object can belong. We create both the type
-- and the finalization chain here, because freezing an
-- internal type does not create such a chain. The Final_Chain
-- that is thus created is shared by the access parameter.
Owner := Make_Defining_Identifier (Loc, New_Internal_Name ('J')); Owner := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
Insert_Action (N, Insert_Action (N,
Make_Full_Type_Declaration (Loc, Make_Full_Type_Declaration (Loc,
...@@ -7689,11 +8159,22 @@ package body Exp_Ch4 is ...@@ -7689,11 +8159,22 @@ package body Exp_Ch4 is
Build_Final_List (N, Owner); Build_Final_List (N, Owner);
Set_Associated_Final_Chain (PtrT, Associated_Final_Chain (Owner)); Set_Associated_Final_Chain (PtrT, Associated_Final_Chain (Owner));
else -- Ada 2005 (AI-318-02): If the context is a return object
-- Case of an access discriminant, or (Ada 2005) of -- declaration, then the anonymous return subtype is defined to have
-- an anonymous access component: find the final list -- the same accessibility level as that of the function's result
-- associated with the scope of the type. -- subtype, which means that we want the scope where the function is
-- declared.
elsif Nkind (Associated_Node_For_Itype (PtrT)) = N_Object_Declaration
and then Ekind (Scope (PtrT)) = E_Return_Statement
then
Owner := Scope (Return_Applies_To (Scope (PtrT)));
-- Case of an access discriminant, or (Ada 2005), of an anonymous
-- access component or anonymous access function result: find the
-- final list associated with the scope of the type.
else
Owner := Scope (PtrT); Owner := Scope (PtrT);
end if; end if;
end if; end if;
...@@ -8430,9 +8911,9 @@ package body Exp_Ch4 is ...@@ -8430,9 +8911,9 @@ package body Exp_Ch4 is
if Component_Size (Etype (Lhs)) /= System_Storage_Unit then if Component_Size (Etype (Lhs)) /= System_Storage_Unit then
return False; return False;
-- Cannot do in place stuff on Java_VM since cannot pass addresses -- Cannot do in place stuff on VM_Target since cannot pass addresses
elsif Java_VM then elsif VM_Target /= No_VM then
return False; return False;
-- Cannot do in place stuff if non-standard Boolean representation -- Cannot do in place stuff if non-standard Boolean representation
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment