-- --
-- B o d y --
-- --
--- Copyright (C) 1992-2007, Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2012, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
--- ware Foundation; either version 2, or (at your option) any later ver- --
+-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
--- Public License distributed with GNAT; see file COPYING. If not, write --
--- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
--- Boston, MA 02110-1301, USA. --
+-- Public License distributed with GNAT; see file COPYING3. If not, go to --
+-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
with Elists; use Elists;
with Exp_Atag; use Exp_Atag;
with Exp_Ch2; use Exp_Ch2;
+with Exp_Ch3; use Exp_Ch3;
+with Exp_Ch6; use Exp_Ch6;
with Exp_Ch9; use Exp_Ch9;
+with Exp_Dist; use Exp_Dist;
with Exp_Imgv; use Exp_Imgv;
with Exp_Pakd; use Exp_Pakd;
with Exp_Strm; use Exp_Strm;
with Exp_Tss; use Exp_Tss;
with Exp_Util; use Exp_Util;
with Exp_VFpt; use Exp_VFpt;
+with Fname; use Fname;
with Freeze; use Freeze;
with Gnatvsn; use Gnatvsn;
with Itypes; use Itypes;
with Rident; use Rident;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
+with Sem_Aux; use Sem_Aux;
+with Sem_Ch6; use Sem_Ch6;
with Sem_Ch7; use Sem_Ch7;
with Sem_Ch8; use Sem_Ch8;
with Sem_Eval; use Sem_Eval;
Check : Boolean);
-- The body for a stream subprogram may be generated outside of the scope
-- of the type. If the type is fully private, it may depend on the full
- -- view of other types (e.g. indices) that are currently private as well.
+ -- view of other types (e.g. indexes) that are currently private as well.
-- We install the declarations of the package in which the type is declared
-- before compiling the body in what is its proper environment. The Check
-- parameter indicates if checks are to be suppressed for the stream body.
(N : Node_Id;
Pref : Node_Id;
Typ : Entity_Id);
-
-- An attribute reference to a protected subprogram is transformed into
-- a pair of pointers: one to the object, and one to the operations.
-- This expansion is performed for 'Access and for 'Unrestricted_Access.
-- defining it, is returned. In both cases, inheritance of representation
-- aspects is thus taken into account.
+ function Full_Base (T : Entity_Id) return Entity_Id;
+ -- The stream functions need to examine the underlying representation of
+ -- composite types. In some cases T may be non-private but its base type
+ -- is, in which case the function returns the corresponding full view.
+
function Get_Stream_Convert_Pragma (T : Entity_Id) return Node_Id;
-- Given a type, find a corresponding stream convert pragma that applies to
-- the implementation base type of this type (Typ). If found, return the
Agg : Node_Id;
Btyp : constant Entity_Id := Base_Type (Typ);
Sub : Entity_Id;
+ Sub_Ref : Node_Id;
E_T : constant Entity_Id := Equivalent_Type (Btyp);
Acc : constant Entity_Id :=
Etype (Next_Component (First_Component (E_T)));
function May_Be_External_Call return Boolean is
Subp : Entity_Id;
+ Par : Node_Id := Parent (N);
+
begin
- if (Nkind (Parent (N)) = N_Procedure_Call_Statement
- or else Nkind (Parent (N)) = N_Function_Call)
- and then Is_Entity_Name (Name (Parent (N)))
+ -- Account for the case where the Access attribute is part of a
+ -- named parameter association.
+
+ if Nkind (Par) = N_Parameter_Association then
+ Par := Parent (Par);
+ end if;
+
+ if Nkind_In (Par, N_Procedure_Call_Statement, N_Function_Call)
+ and then Is_Entity_Name (Name (Par))
then
- Subp := Entity (Name (Parent (N)));
+ Subp := Entity (Name (Par));
return not In_Open_Scopes (Scope (Subp));
else
return False;
-- Start of processing for Expand_Access_To_Protected_Op
begin
- -- Within the body of the protected type, the prefix
- -- designates a local operation, and the object is the first
- -- parameter of the corresponding protected body of the
- -- current enclosing operation.
+ -- Within the body of the protected type, the prefix designates a local
+ -- operation, and the object is the first parameter of the corresponding
+ -- protected body of the current enclosing operation.
if Is_Entity_Name (Pref) then
- pragma Assert (In_Open_Scopes (Scope (Entity (Pref))));
-
if May_Be_External_Call then
Sub :=
- New_Occurrence_Of
- (External_Subprogram (Entity (Pref)), Loc);
+ New_Occurrence_Of (External_Subprogram (Entity (Pref)), Loc);
else
Sub :=
New_Occurrence_Of
(Protected_Body_Subprogram (Entity (Pref)), Loc);
end if;
+ -- Don't traverse the scopes when the attribute occurs within an init
+ -- proc, because we directly use the _init formal of the init proc in
+ -- that case.
+
Curr := Current_Scope;
- while Scope (Curr) /= Scope (Entity (Pref)) loop
- Curr := Scope (Curr);
- end loop;
+ if not Is_Init_Proc (Curr) then
+ pragma Assert (In_Open_Scopes (Scope (Entity (Pref))));
+
+ while Scope (Curr) /= Scope (Entity (Pref)) loop
+ Curr := Scope (Curr);
+ end loop;
+ end if;
-- In case of protected entries the first formal of its Protected_
-- Body_Subprogram is the address of the object.
(First_Formal
(Protected_Body_Subprogram (Curr)), Loc);
+ -- If the current scope is an init proc, then use the address of the
+ -- _init formal as the object reference.
+
+ elsif Is_Init_Proc (Curr) then
+ Obj_Ref :=
+ Make_Attribute_Reference (Loc,
+ Prefix => New_Occurrence_Of (First_Formal (Curr), Loc),
+ Attribute_Name => Name_Address);
+
-- In case of protected subprograms the first formal of its
-- Protected_Body_Subprogram is the object and we get its address.
Attribute_Name => Name_Address);
end if;
+ Sub_Ref :=
+ Make_Attribute_Reference (Loc,
+ Prefix => Sub,
+ Attribute_Name => Name_Access);
+
+ -- We set the type of the access reference to the already generated
+ -- access_to_subprogram type, and declare the reference analyzed, to
+ -- prevent further expansion when the enclosing aggregate is analyzed.
+
+ Set_Etype (Sub_Ref, Acc);
+ Set_Analyzed (Sub_Ref);
+
Agg :=
Make_Aggregate (Loc,
- Expressions =>
- New_List (
- Obj_Ref,
- Unchecked_Convert_To (Acc,
- Make_Attribute_Reference (Loc,
- Prefix => Sub,
- Attribute_Name => Name_Address))));
+ Expressions => New_List (Obj_Ref, Sub_Ref));
- Rewrite (N, Agg);
+ -- Sub_Ref has been marked as analyzed, but we still need to make sure
+ -- Sub is correctly frozen.
+ Freeze_Before (N, Entity (Sub));
+
+ Rewrite (N, Agg);
Analyze_And_Resolve (N, E_T);
- -- For subsequent analysis, the node must retain its type.
- -- The backend will replace it with the equivalent type where
- -- needed.
+ -- For subsequent analysis, the node must retain its type. The backend
+ -- will replace it with the equivalent type where needed.
Set_Etype (N, Typ);
end Expand_Access_To_Protected_Op;
Typ : constant Entity_Id := Etype (N);
Btyp : constant Entity_Id := Base_Type (Typ);
Pref : constant Node_Id := Prefix (N);
+ Ptyp : constant Entity_Id := Etype (Pref);
Exprs : constant List_Id := Expressions (N);
Id : constant Attribute_Id := Get_Attribute_Id (Attribute_Name (N));
and then Is_Written
then
declare
- Temp : constant Entity_Id :=
- Make_Defining_Identifier
- (Loc, New_Internal_Name ('V'));
+ Temp : constant Entity_Id := Make_Temporary (Loc, 'V');
Decl : Node_Id;
Assn : Node_Id;
end if;
end if;
+ -- The stream operation to call maybe a renaming created by
+ -- an attribute definition clause, and may not be frozen yet.
+ -- Ensure that it has the necessary extra formals.
+
+ if not Is_Frozen (Pname) then
+ Create_Extra_Formals (Pname);
+ end if;
+
-- And now rewrite the call
Rewrite (N,
begin
-- Do required validity checking, if enabled. Do not apply check to
-- output parameters of an Asm instruction, since the value of this
- -- is not set till after the attribute has been elaborated.
+ -- is not set till after the attribute has been elaborated, and do
+ -- not apply the check to the arguments of a 'Read or 'Input attribute
+ -- reference since the scalar argument is an OUT scalar.
if Validity_Checks_On and then Validity_Check_Operands
and then Id /= Attribute_Asm_Output
+ and then Id /= Attribute_Read
+ and then Id /= Attribute_Input
then
declare
Expr : Node_Id;
end;
end if;
+ -- Ada 2005 (AI-318-02): If attribute prefix is a call to a build-in-
+ -- place function, then a temporary return object needs to be created
+ -- and access to it must be passed to the function. Currently we limit
+ -- such functions to those with inherently limited result subtypes, but
+ -- eventually we plan to expand the functions that are treated as
+ -- build-in-place to include other composite result types.
+
+ if Ada_Version >= Ada_2005
+ and then Is_Build_In_Place_Function_Call (Pref)
+ then
+ Make_Build_In_Place_Call_In_Anonymous_Context (Pref);
+ end if;
+
+ -- If prefix is a protected type name, this is a reference to the
+ -- current instance of the type. For a component definition, nothing
+ -- to do (expansion will occur in the init proc). In other contexts,
+ -- rewrite into reference to current instance.
+
+ if Is_Protected_Self_Reference (Pref)
+ and then not
+ (Nkind_In (Parent (N), N_Index_Or_Discriminant_Constraint,
+ N_Discriminant_Association)
+ and then Nkind (Parent (Parent (Parent (Parent (N))))) =
+ N_Component_Definition)
+ then
+ Rewrite (Pref, Concurrent_Ref (Pref));
+ Analyze (Pref);
+ end if;
+
-- Remaining processing depends on specific attribute
case Id is
+ -- Attributes related to Ada 2012 iterators (placeholder ???)
+
+ when Attribute_Constant_Indexing => null;
+ when Attribute_Default_Iterator => null;
+ when Attribute_Implicit_Dereference => null;
+ when Attribute_Iterator_Element => null;
+ when Attribute_Variable_Indexing => null;
+
------------
-- Access --
------------
Attribute_Unrestricted_Access =>
Access_Cases : declare
- Btyp_DDT : constant Entity_Id := Directly_Designated_Type (Btyp);
Ref_Object : constant Node_Id := Get_Referenced_Object (Pref);
+ Btyp_DDT : Entity_Id;
+
+ function Enclosing_Object (N : Node_Id) return Node_Id;
+ -- If N denotes a compound name (selected component, indexed
+ -- component, or slice), returns the name of the outermost such
+ -- enclosing object. Otherwise returns N. If the object is a
+ -- renaming, then the renamed object is returned.
+
+ ----------------------
+ -- Enclosing_Object --
+ ----------------------
+
+ function Enclosing_Object (N : Node_Id) return Node_Id is
+ Obj_Name : Node_Id;
+
+ begin
+ Obj_Name := N;
+ while Nkind_In (Obj_Name, N_Selected_Component,
+ N_Indexed_Component,
+ N_Slice)
+ loop
+ Obj_Name := Prefix (Obj_Name);
+ end loop;
+
+ return Get_Referenced_Object (Obj_Name);
+ end Enclosing_Object;
+
+ -- Local declarations
+
+ Enc_Object : constant Node_Id := Enclosing_Object (Ref_Object);
+
+ -- Start of processing for Access_Cases
begin
+ Btyp_DDT := Designated_Type (Btyp);
+
+ -- Handle designated types that come from the limited view
+
+ if Ekind (Btyp_DDT) = E_Incomplete_Type
+ and then From_With_Type (Btyp_DDT)
+ and then Present (Non_Limited_View (Btyp_DDT))
+ then
+ Btyp_DDT := Non_Limited_View (Btyp_DDT);
+
+ elsif Is_Class_Wide_Type (Btyp_DDT)
+ and then Ekind (Etype (Btyp_DDT)) = E_Incomplete_Type
+ and then From_With_Type (Etype (Btyp_DDT))
+ and then Present (Non_Limited_View (Etype (Btyp_DDT)))
+ and then Present (Class_Wide_Type
+ (Non_Limited_View (Etype (Btyp_DDT))))
+ then
+ Btyp_DDT :=
+ Class_Wide_Type (Non_Limited_View (Etype (Btyp_DDT)));
+ end if;
+
+ -- In order to improve the text of error messages, the designated
+ -- type of access-to-subprogram itypes is set by the semantics as
+ -- the associated subprogram entity (see sem_attr). Now we replace
+ -- such node with the proper E_Subprogram_Type itype.
+
+ if Id = Attribute_Unrestricted_Access
+ and then Is_Subprogram (Directly_Designated_Type (Typ))
+ then
+ -- The following conditions ensure that this special management
+ -- is done only for "Address!(Prim'Unrestricted_Access)" nodes.
+ -- At this stage other cases in which the designated type is
+ -- still a subprogram (instead of an E_Subprogram_Type) are
+ -- wrong because the semantics must have overridden the type of
+ -- the node with the type imposed by the context.
+
+ if Nkind (Parent (N)) = N_Unchecked_Type_Conversion
+ and then Etype (Parent (N)) = RTE (RE_Prim_Ptr)
+ then
+ Set_Etype (N, RTE (RE_Prim_Ptr));
+
+ else
+ declare
+ Subp : constant Entity_Id :=
+ Directly_Designated_Type (Typ);
+ Etyp : Entity_Id;
+ Extra : Entity_Id := Empty;
+ New_Formal : Entity_Id;
+ Old_Formal : Entity_Id := First_Formal (Subp);
+ Subp_Typ : Entity_Id;
+
+ begin
+ Subp_Typ := Create_Itype (E_Subprogram_Type, N);
+ Set_Etype (Subp_Typ, Etype (Subp));
+ Set_Returns_By_Ref (Subp_Typ, Returns_By_Ref (Subp));
+
+ if Present (Old_Formal) then
+ New_Formal := New_Copy (Old_Formal);
+ Set_First_Entity (Subp_Typ, New_Formal);
+
+ loop
+ Set_Scope (New_Formal, Subp_Typ);
+ Etyp := Etype (New_Formal);
+
+ -- Handle itypes. There is no need to duplicate
+ -- here the itypes associated with record types
+ -- (i.e the implicit full view of private types).
+
+ if Is_Itype (Etyp)
+ and then Ekind (Base_Type (Etyp)) /= E_Record_Type
+ then
+ Extra := New_Copy (Etyp);
+ Set_Parent (Extra, New_Formal);
+ Set_Etype (New_Formal, Extra);
+ Set_Scope (Extra, Subp_Typ);
+ end if;
+
+ Extra := New_Formal;
+ Next_Formal (Old_Formal);
+ exit when No (Old_Formal);
+
+ Set_Next_Entity (New_Formal,
+ New_Copy (Old_Formal));
+ Next_Entity (New_Formal);
+ end loop;
+
+ Set_Next_Entity (New_Formal, Empty);
+ Set_Last_Entity (Subp_Typ, Extra);
+ end if;
+
+ -- Now that the explicit formals have been duplicated,
+ -- any extra formals needed by the subprogram must be
+ -- created.
+
+ if Present (Extra) then
+ Set_Extra_Formal (Extra, Empty);
+ end if;
+
+ Create_Extra_Formals (Subp_Typ);
+ Set_Directly_Designated_Type (Typ, Subp_Typ);
+ end;
+ end if;
+ end if;
+
if Is_Access_Protected_Subprogram_Type (Btyp) then
Expand_Access_To_Protected_Op (N, Pref, Typ);
end;
-- If the prefix of an Access attribute is a dereference of an
- -- access parameter (or a renaming of such a dereference) and
- -- the context is a general access type (but not an anonymous
- -- access type), then rewrite the attribute as a conversion of
- -- the access parameter to the context access type. This will
- -- result in an accessibility check being performed, if needed.
-
- -- (X.all'Access => Acc_Type (X))
-
- -- Note: Limit the expansion of an attribute applied to a
- -- dereference of an access parameter so that it's only done
- -- for 'Access. This fixes a problem with 'Unrestricted_Access
- -- that leads to errors in the case where the attribute type
- -- is access-to-variable and the access parameter is
- -- access-to-constant. The conversion is only done to get
- -- accessibility checks, so it makes sense to limit it to
- -- 'Access.
-
- elsif Nkind (Ref_Object) = N_Explicit_Dereference
- and then Is_Entity_Name (Prefix (Ref_Object))
- and then Ekind (Btyp) = E_General_Access_Type
- and then Ekind (Entity (Prefix (Ref_Object))) in Formal_Kind
- and then Ekind (Etype (Entity (Prefix (Ref_Object))))
+ -- access parameter (or a renaming of such a dereference, or a
+ -- subcomponent of such a dereference) and the context is a
+ -- general access type (including the type of an object or
+ -- component with an access_definition, but not the anonymous
+ -- type of an access parameter or access discriminant), then
+ -- apply an accessibility check to the access parameter. We used
+ -- to rewrite the access parameter as a type conversion, but that
+ -- could only be done if the immediate prefix of the Access
+ -- attribute was the dereference, and didn't handle cases where
+ -- the attribute is applied to a subcomponent of the dereference,
+ -- since there's generally no available, appropriate access type
+ -- to convert to in that case. The attribute is passed as the
+ -- point to insert the check, because the access parameter may
+ -- come from a renaming, possibly in a different scope, and the
+ -- check must be associated with the attribute itself.
+
+ elsif Id = Attribute_Access
+ and then Nkind (Enc_Object) = N_Explicit_Dereference
+ and then Is_Entity_Name (Prefix (Enc_Object))
+ and then (Ekind (Btyp) = E_General_Access_Type
+ or else Is_Local_Anonymous_Access (Btyp))
+ and then Ekind (Entity (Prefix (Enc_Object))) in Formal_Kind
+ and then Ekind (Etype (Entity (Prefix (Enc_Object))))
= E_Anonymous_Access_Type
and then Present (Extra_Accessibility
- (Entity (Prefix (Ref_Object))))
+ (Entity (Prefix (Enc_Object))))
then
- Rewrite (N,
- Convert_To (Typ, New_Copy_Tree (Prefix (Ref_Object))));
- Analyze_And_Resolve (N, Typ);
+ Apply_Accessibility_Check (Prefix (Enc_Object), Typ, N);
-- Ada 2005 (AI-251): If the designated type is an interface we
-- add an implicit conversion to force the displacement of the
then
if Nkind (Ref_Object) /= N_Explicit_Dereference then
- -- No implicit conversion required if types match
+ -- No implicit conversion required if types match, or if
+ -- the prefix is the class_wide_type of the interface. In
+ -- either case passing an object of the interface type has
+ -- already set the pointer correctly.
- if Btyp_DDT /= Etype (Ref_Object) then
+ if Btyp_DDT = Etype (Ref_Object)
+ or else (Is_Class_Wide_Type (Etype (Ref_Object))
+ and then
+ Class_Wide_Type (Btyp_DDT) = Etype (Ref_Object))
+ then
+ null;
+
+ else
Rewrite (Prefix (N),
- Convert_To (Directly_Designated_Type (Typ),
+ Convert_To (Btyp_DDT,
New_Copy_Tree (Prefix (N))));
- Analyze_And_Resolve (Prefix (N),
- Directly_Designated_Type (Typ));
+ Analyze_And_Resolve (Prefix (N), Btyp_DDT);
end if;
-- When the object is an explicit dereference, convert the
(Etype (Prefix (Ref_Object))));
begin
-- No implicit conversion required if designated types
- -- match.
+ -- match, or if we have an unrestricted access.
if Obj_DDT /= Btyp_DDT
+ and then Id /= Attribute_Unrestricted_Access
and then not (Is_Class_Wide_Type (Obj_DDT)
- and then Etype (Obj_DDT) = Btyp_DDT)
+ and then Etype (Obj_DDT) = Btyp_DDT)
then
Rewrite (N,
Convert_To (Typ,
if Is_Entity_Name (Pref)
and then Is_Task_Type (Entity (Pref))
then
- Task_Proc := Next_Entity (Root_Type (Etype (Pref)));
+ Task_Proc := Next_Entity (Root_Type (Ptyp));
while Present (Task_Proc) loop
exit when Ekind (Task_Proc) = E_Procedure
and then Etype (First_Formal (Task_Proc)) =
- Corresponding_Record_Type (Etype (Pref));
+ Corresponding_Record_Type (Ptyp);
Next_Entity (Task_Proc);
end loop;
External_Subprogram (Entity (Selector_Name (Pref))), Loc));
elsif Nkind (Pref) = N_Explicit_Dereference
- and then Ekind (Etype (Pref)) = E_Subprogram_Type
- and then Convention (Etype (Pref)) = Convention_Protected
+ and then Ekind (Ptyp) = E_Subprogram_Type
+ and then Convention (Ptyp) = Convention_Protected
then
-- The prefix is be a dereference of an access_to_protected_
-- subprogram. The desired address is the second component of
-- This processing is not needed in the VM case, where dispatching
-- issues are taken care of by the virtual machine.
- elsif Is_Class_Wide_Type (Etype (Pref))
- and then Is_Interface (Etype (Pref))
- and then VM_Target = No_VM
+ elsif Is_Class_Wide_Type (Ptyp)
+ and then Is_Interface (Ptyp)
+ and then Tagged_Type_Expansion
and then not (Nkind (Pref) in N_Has_Entity
and then Is_Subprogram (Entity (Pref)))
then
return;
end if;
- -- Deal with packed array reference, other cases are handled by gigi
+ -- Deal with packed array reference, other cases are handled by
+ -- the back end.
if Involves_Packed_Array_Reference (Pref) then
Expand_Packed_Address_Reference (N);
---------------
when Attribute_Alignment => Alignment : declare
- Ptyp : constant Entity_Id := Etype (Pref);
New_Node : Node_Id;
begin
-- operation _Alignment applied to X.
elsif Is_Class_Wide_Type (Ptyp) then
+ New_Node :=
+ Make_Attribute_Reference (Loc,
+ Prefix => Pref,
+ Attribute_Name => Name_Tag);
- -- No need to do anything else compiling under restriction
- -- No_Dispatching_Calls. During the semantic analysis we
- -- already notified such violation.
-
- if Restriction_Active (No_Dispatching_Calls) then
- return;
+ if VM_Target = No_VM then
+ New_Node := Build_Get_Alignment (Loc, New_Node);
+ else
+ New_Node :=
+ Make_Function_Call (Loc,
+ Name => New_Reference_To (RTE (RE_Get_Alignment), Loc),
+ Parameter_Associations => New_List (New_Node));
end if;
- New_Node :=
- Make_Function_Call (Loc,
- Name => New_Reference_To
- (Find_Prim_Op (Ptyp, Name_uAlignment), Loc),
- Parameter_Associations => New_List (Pref));
+ -- Case where the context is a specific integer type with which
+ -- the original attribute was compatible. The function has a
+ -- specific type as well, so to preserve the compatibility we
+ -- must convert explicitly.
if Typ /= Standard_Integer then
-
- -- The context is a specific integer type with which the
- -- original attribute was compatible. The function has a
- -- specific type as well, so to preserve the compatibility
- -- we must convert explicitly.
-
New_Node := Convert_To (Typ, New_Node);
end if;
Analyze_And_Resolve (N, RTE (RE_AST_Handler));
end AST_Entry;
+ ---------
+ -- Bit --
+ ---------
+
+ -- We compute this if a packed array reference was present, otherwise we
+ -- leave the computation up to the back end.
+
+ when Attribute_Bit =>
+ if Involves_Packed_Array_Reference (Pref) then
+ Expand_Packed_Bit_Reference (N);
+ else
+ Apply_Universal_Integer_Attribute_Checks (N);
+ end if;
+
------------------
-- Bit_Position --
------------------
- -- We compute this if a component clause was present, otherwise
- -- we leave the computation up to Gigi, since we don't know what
- -- layout will be chosen.
+ -- We compute this if a component clause was present, otherwise we leave
+ -- the computation up to the back end, since we don't know what layout
+ -- will be chosen.
-- Note that the attribute can apply to a naked record component
-- in generated code (i.e. the prefix is an identifier that
-- references the component or discriminant entity).
- when Attribute_Bit_Position => Bit_Position :
- declare
+ when Attribute_Bit_Position => Bit_Position : declare
CE : Entity_Id;
begin
-- A reference to P'Body_Version or P'Version is expanded to
-- Vnn : Unsigned;
- -- pragma Import (C, Vnn, "uuuuT";
+ -- pragma Import (C, Vnn, "uuuuT");
-- ...
-- Get_Version_String (Vnn)
-- and T is B for the cases of Body_Version, or Version applied to a
-- subprogram acting as its own spec, and S for Version applied to a
-- subprogram spec or package. This sequence of code references the
- -- the unsigned constant created in the main program by the binder.
+ -- unsigned constant created in the main program by the binder.
- -- A special exception occurs for Standard, where the string
- -- returned is a copy of the library string in gnatvsn.ads.
+ -- A special exception occurs for Standard, where the string returned
+ -- is a copy of the library string in gnatvsn.ads.
when Attribute_Body_Version | Attribute_Version => Version : declare
- E : constant Entity_Id :=
- Make_Defining_Identifier (Loc, New_Internal_Name ('V'));
+ E : constant Entity_Id := Make_Temporary (Loc, 'V');
Pent : Entity_Id;
S : String_Id;
begin
-- We have an object of a task interface class-wide type as a prefix
-- to Callable. Generate:
-
-- callable (Task_Id (Pref._disp_get_task_id));
- if Ada_Version >= Ada_05
- and then Ekind (Etype (Pref)) = E_Class_Wide_Type
- and then Is_Interface (Etype (Pref))
- and then Is_Task_Interface (Etype (Pref))
+ if Ada_Version >= Ada_2005
+ and then Ekind (Ptyp) = E_Class_Wide_Type
+ and then Is_Interface (Ptyp)
+ and then Is_Task_Interface (Ptyp)
then
Rewrite (N,
Make_Function_Call (Loc,
-- Protected case
if Is_Protected_Type (Conctype) then
- if Abort_Allowed
- or else Restriction_Active (No_Entry_Queue) = False
- or else Number_Entries (Conctype) > 1
- then
- Name :=
- New_Reference_To
- (RTE (RE_Protected_Entry_Caller), Loc);
- else
- Name :=
- New_Reference_To
- (RTE (RE_Protected_Single_Entry_Caller), Loc);
- end if;
+ case Corresponding_Runtime_Package (Conctype) is
+ when System_Tasking_Protected_Objects_Entries =>
+ Name :=
+ New_Reference_To
+ (RTE (RE_Protected_Entry_Caller), Loc);
+
+ when System_Tasking_Protected_Objects_Single_Entry =>
+ Name :=
+ New_Reference_To
+ (RTE (RE_Protected_Single_Entry_Caller), Loc);
+
+ when others =>
+ raise Program_Error;
+ end case;
Rewrite (N,
Unchecked_Convert_To (Id_Kind,
Make_Function_Call (Loc,
Name => Name,
- Parameter_Associations => New_List
- (New_Reference_To (
- Object_Ref
- (Corresponding_Body (Parent (Conctype))), Loc)))));
+ Parameter_Associations => New_List (
+ New_Reference_To
+ (Find_Protection_Object (Current_Scope), Loc)))));
-- Task case
Rewrite (N,
Unchecked_Convert_To (Id_Kind,
Make_Function_Call (Loc,
- Name => New_Reference_To (
- RTE (RE_Task_Entry_Caller), Loc),
+ Name =>
+ New_Reference_To (RTE (RE_Task_Entry_Caller), Loc),
Parameter_Associations => New_List (
Make_Integer_Literal (Loc,
Intval => Int (Nest_Depth))))));
when Attribute_Constrained => Constrained : declare
Formal_Ent : constant Entity_Id := Param_Entity (Pref);
- Typ : constant Entity_Id := Etype (Pref);
function Is_Constrained_Aliased_View (Obj : Node_Id) return Boolean;
-- Ada 2005 (AI-363): Returns True if the object name Obj denotes a
if Present (Renamed_Object (E)) then
return Is_Constrained_Aliased_View (Renamed_Object (E));
-
else
return Is_Aliased (E) and then Is_Constrained (Etype (E));
end if;
return Is_Aliased_View (Obj)
and then
(Is_Constrained (Etype (Obj))
- or else (Nkind (Obj) = N_Explicit_Dereference
- and then
- not Has_Constrained_Partial_View
- (Base_Type (Etype (Obj)))));
+ or else
+ (Nkind (Obj) = N_Explicit_Dereference
+ and then
+ not Effectively_Has_Constrained_Partial_View
+ (Typ => Base_Type (Etype (Obj)),
+ Scop => Current_Scope)));
end if;
end Is_Constrained_Aliased_View;
end if;
-- If the prefix is not a variable or is aliased, then
- -- definitely true; if it's a formal parameter without
- -- an associated extra formal, then treat it as constrained.
+ -- definitely true; if it's a formal parameter without an
+ -- associated extra formal, then treat it as constrained.
-- Ada 2005 (AI-363): An aliased prefix must be known to be
-- constrained in order to set the attribute to True.
elsif not Is_Variable (Pref)
or else Present (Formal_Ent)
- or else (Ada_Version < Ada_05
+ or else (Ada_Version < Ada_2005
and then Is_Aliased_View (Pref))
- or else (Ada_Version >= Ada_05
+ or else (Ada_Version >= Ada_2005
and then Is_Constrained_Aliased_View (Pref))
then
Res := True;
- -- Variable case, just look at type to see if it is
- -- constrained. Note that the one case where this is
- -- not accurate (the procedure formal case), has been
- -- handled above.
+ -- Variable case, look at type to see if it is constrained.
+ -- Note that the one case where this is not accurate (the
+ -- procedure formal case), has been handled above.
-- We use the Underlying_Type here (and below) in case the
-- type is private without discriminants, but the full type
-- internally for passing to the Extra_Constrained parameter.
else
- Res := Is_Constrained (Underlying_Type (Etype (Ent)));
+ -- In Ada 2012, test for case of a limited tagged type, in
+ -- which case the attribute is always required to return
+ -- True. The underlying type is tested, to make sure we also
+ -- return True for cases where there is an unconstrained
+ -- object with an untagged limited partial view which has
+ -- defaulted discriminants (such objects always produce a
+ -- False in earlier versions of Ada). (Ada 2012: AI05-0214)
+
+ Res := Is_Constrained (Underlying_Type (Etype (Ent)))
+ or else
+ (Ada_Version >= Ada_2012
+ and then Is_Tagged_Type (Underlying_Type (Ptyp))
+ and then Is_Limited_Type (Ptyp));
end if;
- Rewrite (N,
- New_Reference_To (Boolean_Literals (Res), Loc));
+ Rewrite (N, New_Reference_To (Boolean_Literals (Res), Loc));
end;
- -- Prefix is not an entity name. These are also cases where
- -- we can always tell at compile time by looking at the form
- -- and type of the prefix. If an explicit dereference of an
- -- object with constrained partial view, this is unconstrained
- -- (Ada 2005 AI-363).
+ -- Prefix is not an entity name. These are also cases where we can
+ -- always tell at compile time by looking at the form and type of the
+ -- prefix. If an explicit dereference of an object with constrained
+ -- partial view, this is unconstrained (Ada 2005: AI95-0363). If the
+ -- underlying type is a limited tagged type, then Constrained is
+ -- required to always return True (Ada 2012: AI05-0214).
else
Rewrite (N,
not Is_Variable (Pref)
or else
(Nkind (Pref) = N_Explicit_Dereference
- and then
- not Has_Constrained_Partial_View (Base_Type (Typ)))
- or else Is_Constrained (Underlying_Type (Typ))),
+ and then
+ not Effectively_Has_Constrained_Partial_View
+ (Typ => Base_Type (Ptyp),
+ Scop => Current_Scope))
+ or else Is_Constrained (Underlying_Type (Ptyp))
+ or else (Ada_Version >= Ada_2012
+ and then Is_Tagged_Type (Underlying_Type (Ptyp))
+ and then Is_Limited_Type (Ptyp))),
Loc));
end if;
-- Transforms 'Count attribute into a call to the Count function
- when Attribute_Count => Count :
- declare
- Entnam : Node_Id;
- Index : Node_Id;
- Name : Node_Id;
- Call : Node_Id;
- Conctyp : Entity_Id;
+ when Attribute_Count => Count : declare
+ Call : Node_Id;
+ Conctyp : Entity_Id;
+ Entnam : Node_Id;
+ Entry_Id : Entity_Id;
+ Index : Node_Id;
+ Name : Node_Id;
begin
-- If the prefix is a member of an entry family, retrieve both
Index := Empty;
end if;
+ Entry_Id := Entity (Entnam);
+
-- Find the concurrent type in which this attribute is referenced
-- (there had better be one).
-- Protected case
if Is_Protected_Type (Conctyp) then
-
- if Abort_Allowed
- or else Restriction_Active (No_Entry_Queue) = False
- or else Number_Entries (Conctyp) > 1
- then
- Name := New_Reference_To (RTE (RE_Protected_Count), Loc);
-
- Call :=
- Make_Function_Call (Loc,
- Name => Name,
- Parameter_Associations => New_List (
- New_Reference_To (
- Object_Ref (
- Corresponding_Body (Parent (Conctyp))), Loc),
- Entry_Index_Expression (
- Loc, Entity (Entnam), Index, Scope (Entity (Entnam)))));
- else
- Name := New_Reference_To (RTE (RE_Protected_Count_Entry), Loc);
-
- Call := Make_Function_Call (Loc,
- Name => Name,
- Parameter_Associations => New_List (
- New_Reference_To (
- Object_Ref (
- Corresponding_Body (Parent (Conctyp))), Loc)));
- end if;
+ case Corresponding_Runtime_Package (Conctyp) is
+ when System_Tasking_Protected_Objects_Entries =>
+ Name := New_Reference_To (RTE (RE_Protected_Count), Loc);
+
+ Call :=
+ Make_Function_Call (Loc,
+ Name => Name,
+ Parameter_Associations => New_List (
+ New_Reference_To
+ (Find_Protection_Object (Current_Scope), Loc),
+ Entry_Index_Expression
+ (Loc, Entry_Id, Index, Scope (Entry_Id))));
+
+ when System_Tasking_Protected_Objects_Single_Entry =>
+ Name :=
+ New_Reference_To (RTE (RE_Protected_Count_Entry), Loc);
+
+ Call :=
+ Make_Function_Call (Loc,
+ Name => Name,
+ Parameter_Associations => New_List (
+ New_Reference_To
+ (Find_Protection_Object (Current_Scope), Loc)));
+
+ when others =>
+ raise Program_Error;
+ end case;
-- Task case
Make_Function_Call (Loc,
Name => New_Reference_To (RTE (RE_Task_Count), Loc),
Parameter_Associations => New_List (
- Entry_Index_Expression
- (Loc, Entity (Entnam), Index, Scope (Entity (Entnam)))));
+ Entry_Index_Expression (Loc,
+ Entry_Id, Index, Scope (Entry_Id))));
end if;
-- The call returns type Natural but the context is universal integer
Analyze_And_Resolve (N, Typ);
end Count;
+ ---------------------
+ -- Descriptor_Size --
+ ---------------------
+
+ when Attribute_Descriptor_Size =>
+
+ -- Attribute Descriptor_Size is handled by the back end when applied
+ -- to an unconstrained array type.
+
+ if Is_Array_Type (Ptyp)
+ and then not Is_Constrained (Ptyp)
+ then
+ Apply_Universal_Integer_Attribute_Checks (N);
+
+ -- For any other type, the descriptor size is 0 because there is no
+ -- actual descriptor, but the result is not formally static.
+
+ else
+ Rewrite (N, Make_Integer_Literal (Loc, 0));
+ Analyze (N);
+ Set_Is_Static_Expression (N, False);
+ end if;
+
---------------
-- Elab_Body --
---------------
-- and then the Elab_Body/Spec attribute is replaced by a reference
-- to this defining identifier.
- when Attribute_Elab_Body |
- Attribute_Elab_Spec =>
+ when Attribute_Elab_Body |
+ Attribute_Elab_Spec =>
+
+ -- Leave attribute unexpanded in CodePeer mode: the gnat2scil
+ -- back-end knows how to handle these attributes directly.
+
+ if CodePeer_Mode then
+ return;
+ end if;
Elab_Body : declare
- Ent : constant Entity_Id :=
- Make_Defining_Identifier (Loc,
- New_Internal_Name ('E'));
+ Ent : constant Entity_Id := Make_Temporary (Loc, 'E');
Str : String_Id;
Lang : Node_Id;
Make_Pragma (Loc,
Chars => Name_Import,
Pragma_Argument_Associations => New_List (
- Make_Pragma_Argument_Association (Loc,
- Expression => Lang),
+ Make_Pragma_Argument_Association (Loc, Expression => Lang),
Make_Pragma_Argument_Association (Loc,
- Expression =>
- Make_Identifier (Loc, Chars (Ent))),
+ Expression => Make_Identifier (Loc, Chars (Ent))),
Make_Pragma_Argument_Association (Loc,
- Expression =>
- Make_String_Literal (Loc, Str))))));
+ Expression => Make_String_Literal (Loc, Str))))));
Set_Entity (N, Ent);
Rewrite (N, New_Occurrence_Of (Ent, Loc));
end Elab_Body;
+ --------------------
+ -- Elab_Subp_Body --
+ --------------------
+
+ -- Always ignored. In CodePeer mode, gnat2scil knows how to handle
+ -- this attribute directly, and if we are not in CodePeer mode it is
+ -- entirely ignored ???
+
+ when Attribute_Elab_Subp_Body =>
+ return;
+
----------------
-- Elaborated --
----------------
- -- Elaborated is always True for preelaborated units, predefined
- -- units, pure units and units which have Elaborate_Body pragmas.
- -- These units have no elaboration entity.
+ -- Elaborated is always True for preelaborated units, predefined units,
+ -- pure units and units which have Elaborate_Body pragmas. These units
+ -- have no elaboration entity.
- -- Note: The Elaborated attribute is never passed through to Gigi
+ -- Note: The Elaborated attribute is never passed to the back end
when Attribute_Elaborated => Elaborated : declare
Ent : constant Entity_Id := Entity (Pref);
begin
if Present (Elaboration_Entity (Ent)) then
Rewrite (N,
- New_Occurrence_Of (Elaboration_Entity (Ent), Loc));
+ Make_Op_Ne (Loc,
+ Left_Opnd =>
+ New_Occurrence_Of (Elaboration_Entity (Ent), Loc),
+ Right_Opnd =>
+ Make_Integer_Literal (Loc, Uint_0)));
+ Analyze_And_Resolve (N, Typ);
else
Rewrite (N, New_Occurrence_Of (Standard_True, Loc));
end if;
-- target-type (Y)
- -- This is simply a direct conversion from the enumeration type
- -- to the target integer type, which is treated by Gigi as a normal
- -- integer conversion, treating the enumeration type as an integer,
- -- which is exactly what we want! We set Conversion_OK to make sure
- -- that the analyzer does not complain about what otherwise might
- -- be an illegal conversion.
+ -- This is simply a direct conversion from the enumeration type to
+ -- the target integer type, which is treated by the back end as a
+ -- normal integer conversion, treating the enumeration type as an
+ -- integer, which is exactly what we want! We set Conversion_OK to
+ -- make sure that the analyzer does not complain about what otherwise
+ -- might be an illegal conversion.
if Is_Non_Empty_List (Exprs) then
Rewrite (N,
Set_Etype (N, Typ);
Analyze_And_Resolve (N, Typ);
-
end Enum_Rep;
--------------
+ -- Enum_Val --
+ --------------
+
+ when Attribute_Enum_Val => Enum_Val : declare
+ Expr : Node_Id;
+ Btyp : constant Entity_Id := Base_Type (Ptyp);
+
+ begin
+ -- X'Enum_Val (Y) expands to
+
+ -- [constraint_error when _rep_to_pos (Y, False) = -1, msg]
+ -- X!(Y);
+
+ Expr := Unchecked_Convert_To (Ptyp, First (Exprs));
+
+ Insert_Action (N,
+ Make_Raise_Constraint_Error (Loc,
+ Condition =>
+ Make_Op_Eq (Loc,
+ Left_Opnd =>
+ Make_Function_Call (Loc,
+ Name =>
+ New_Reference_To (TSS (Btyp, TSS_Rep_To_Pos), Loc),
+ Parameter_Associations => New_List (
+ Relocate_Node (Duplicate_Subexpr (Expr)),
+ New_Occurrence_Of (Standard_False, Loc))),
+
+ Right_Opnd => Make_Integer_Literal (Loc, -1)),
+ Reason => CE_Range_Check_Failed));
+
+ Rewrite (N, Expr);
+ Analyze_And_Resolve (N, Ptyp);
+ end Enum_Val;
+
+ --------------
-- Exponent --
--------------
-- First --
-----------
- when Attribute_First => declare
- Ptyp : constant Entity_Id := Etype (Pref);
+ when Attribute_First =>
- begin
-- If the prefix type is a constrained packed array type which
-- already has a Packed_Array_Type representation defined, then
-- replace this attribute with a direct reference to 'First of the
- -- appropriate index subtype (since otherwise Gigi will try to give
- -- us the value of 'First for this implementation type).
+ -- appropriate index subtype (since otherwise the back end will try
+ -- to give us the value of 'First for this implementation type).
if Is_Constrained_Packed_Array (Ptyp) then
Rewrite (N,
elsif Is_Access_Type (Ptyp) then
Apply_Access_Check (N);
end if;
- end;
---------------
-- First_Bit --
---------------
- -- We compute this if a component clause was present, otherwise
- -- we leave the computation up to Gigi, since we don't know what
+ -- Compute this if component clause was present, otherwise we leave the
+ -- computation to be completed in the back-end, since we don't know what
-- layout will be chosen.
- when Attribute_First_Bit => First_Bit :
- declare
+ when Attribute_First_Bit => First_Bit_Attr : declare
CE : constant Entity_Id := Entity (Selector_Name (Pref));
begin
- if Known_Static_Component_Bit_Offset (CE) then
+ -- In Ada 2005 (or later) if we have the standard nondefault
+ -- bit order, then we return the original value as given in
+ -- the component clause (RM 2005 13.5.2(3/2)).
+
+ if Present (Component_Clause (CE))
+ and then Ada_Version >= Ada_2005
+ and then not Reverse_Bit_Order (Scope (CE))
+ then
Rewrite (N,
Make_Integer_Literal (Loc,
- Component_Bit_Offset (CE) mod System_Storage_Unit));
+ Intval => Expr_Value (First_Bit (Component_Clause (CE)))));
+ Analyze_And_Resolve (N, Typ);
+ -- Otherwise (Ada 83/95 or Ada 2005 or later with reverse bit order),
+ -- rewrite with normalized value if we know it statically.
+
+ elsif Known_Static_Component_Bit_Offset (CE) then
+ Rewrite (N,
+ Make_Integer_Literal (Loc,
+ Component_Bit_Offset (CE) mod System_Storage_Unit));
Analyze_And_Resolve (N, Typ);
+ -- Otherwise left to back end, just do universal integer checks
+
else
Apply_Universal_Integer_Attribute_Checks (N);
end if;
- end First_Bit;
+ end First_Bit_Attr;
-----------------
-- Fixed_Value --
-- fixtype(integer-value)
- -- we do all the required analysis of the conversion here, because
- -- we do not want this to go through the fixed-point conversion
- -- circuits. Note that gigi always treats fixed-point as equivalent
- -- to the corresponding integer type anyway.
+ -- We do all the required analysis of the conversion here, because we do
+ -- not want this to go through the fixed-point conversion circuits. Note
+ -- that the back end always treats fixed-point as equivalent to the
+ -- corresponding integer type anyway.
when Attribute_Fixed_Value => Fixed_Value :
begin
-- Note that we know that the type is a non-static subtype, or Fore
-- would have itself been computed dynamically in Eval_Attribute.
- when Attribute_Fore => Fore :
- declare
- Ptyp : constant Entity_Id := Etype (Pref);
-
- begin
+ when Attribute_Fore => Fore : begin
Rewrite (N,
Convert_To (Typ,
Make_Function_Call (Loc,
Expand_Fpt_Attribute_R (N);
--------------
+ -- From_Any --
+ --------------
+
+ when Attribute_From_Any => From_Any : declare
+ P_Type : constant Entity_Id := Etype (Pref);
+ Decls : constant List_Id := New_List;
+ begin
+ Rewrite (N,
+ Build_From_Any_Call (P_Type,
+ Relocate_Node (First (Exprs)),
+ Decls));
+ Insert_Actions (N, Decls);
+ Analyze_And_Resolve (N, P_Type);
+ end From_Any;
+
+ --------------
-- Identity --
--------------
Id_Kind : Entity_Id;
begin
- if Etype (Pref) = Standard_Exception_Type then
+ if Ptyp = Standard_Exception_Type then
Id_Kind := RTE (RE_Exception_Id);
if Present (Renamed_Object (Entity (Pref))) then
-- dynamically through a dispatching call, as for other task
-- attributes applied to interfaces.
- if Ada_Version >= Ada_05
- and then Ekind (Etype (Pref)) = E_Class_Wide_Type
- and then Is_Interface (Etype (Pref))
- and then Is_Task_Interface (Etype (Pref))
+ if Ada_Version >= Ada_2005
+ and then Ekind (Ptyp) = E_Class_Wide_Type
+ and then Is_Interface (Ptyp)
+ and then Is_Task_Interface (Ptyp)
then
Rewrite (N,
Unchecked_Convert_To (Id_Kind,
begin
Rewrite (N,
Make_Attribute_Reference (Loc,
- Prefix => New_Reference_To (Etype (Pref), Loc),
+ Prefix => New_Reference_To (Ptyp, Loc),
Attribute_Name => Name_Image,
Expressions => New_List (Relocate_Node (Pref))));
-- sourcetyp (streamread (strmtyp'Input (stream)));
- -- where stmrearead is the given Read function that converts
- -- an argument of type strmtyp to type sourcetyp or a type
- -- from which it is derived. The extra conversion is required
- -- for the derived case.
+ -- where streamread is the given Read function that converts an
+ -- argument of type strmtyp to type sourcetyp or a type from which
+ -- it is derived (extra conversion required for the derived case).
Prag := Get_Stream_Convert_Pragma (P_Type);
Rtyp : constant Entity_Id := Root_Type (P_Type);
Dnn : Entity_Id;
Decl : Node_Id;
+ Expr : Node_Id;
begin
-- Read the internal tag (RM 13.13.2(34)) and use it to
-- initialize a dummy tag object:
- -- Dnn : Ada.Tags.Tag
- -- := Descendant_Tag (String'Input (Strm), P_Type);
+ -- Dnn : Ada.Tags.Tag :=
+ -- Descendant_Tag (String'Input (Strm), P_Type);
-- This dummy object is used only to provide a controlling
-- argument for the eventual _Input call. Descendant_Tag is
-- required for Ada 2005 because tagged types can be
-- extended in nested scopes (AI-344).
- Dnn :=
- Make_Defining_Identifier (Loc,
- Chars => New_Internal_Name ('D'));
+ Expr :=
+ Make_Function_Call (Loc,
+ Name =>
+ New_Occurrence_Of (RTE (RE_Descendant_Tag), Loc),
+ Parameter_Associations => New_List (
+ Make_Attribute_Reference (Loc,
+ Prefix => New_Occurrence_Of (Standard_String, Loc),
+ Attribute_Name => Name_Input,
+ Expressions => New_List (
+ Relocate_Node (Duplicate_Subexpr (Strm)))),
+ Make_Attribute_Reference (Loc,
+ Prefix => New_Reference_To (P_Type, Loc),
+ Attribute_Name => Name_Tag)));
+
+ Dnn := Make_Temporary (Loc, 'D', Expr);
Decl :=
Make_Object_Declaration (Loc,
Defining_Identifier => Dnn,
- Object_Definition =>
+ Object_Definition =>
New_Occurrence_Of (RTE (RE_Tag), Loc),
- Expression =>
- Make_Function_Call (Loc,
- Name =>
- New_Occurrence_Of (RTE (RE_Descendant_Tag), Loc),
- Parameter_Associations => New_List (
- Make_Attribute_Reference (Loc,
- Prefix =>
- New_Occurrence_Of (Standard_String, Loc),
- Attribute_Name => Name_Input,
- Expressions => New_List (
- Relocate_Node
- (Duplicate_Subexpr (Strm)))),
- Make_Attribute_Reference (Loc,
- Prefix => New_Reference_To (P_Type, Loc),
- Attribute_Name => Name_Tag))));
+ Expression => Expr);
Insert_Action (N, Decl);
-- tagged object).
Fname := Find_Prim_Op (Rtyp, TSS_Stream_Input);
- Cntrl := Unchecked_Convert_To (P_Type,
- New_Occurrence_Of (Dnn, Loc));
+ Cntrl :=
+ Unchecked_Convert_To (P_Type,
+ New_Occurrence_Of (Dnn, Loc));
Set_Etype (Cntrl, P_Type);
Set_Parent (Cntrl, N);
end;
pragma Assert
(Is_Record_Type (U_Type) or else Is_Protected_Type (U_Type));
- -- Ada 2005 (AI-216): Program_Error is raised when executing
- -- the default implementation of the Input attribute of an
- -- unchecked union type if the type lacks default discriminant
- -- values.
+ -- Ada 2005 (AI-216): Program_Error is raised executing default
+ -- implementation of the Input attribute of an unchecked union
+ -- type if the type lacks default discriminant values.
if Is_Unchecked_Union (Base_Type (U_Type))
and then No (Discriminant_Constraint (U_Type))
return;
end if;
+ -- Build the type's Input function, passing the subtype rather
+ -- than its base type, because checks are needed in the case of
+ -- constrained discriminants (see Ada 2012 AI05-0192).
+
Build_Record_Or_Elementary_Input_Function
- (Loc, Base_Type (U_Type), Decl, Fname);
+ (Loc, U_Type, Decl, Fname);
Insert_Action (N, Decl);
if Nkind (Parent (N)) = N_Object_Declaration
-- inttype(integer-value))
- -- we do all the required analysis of the conversion here, because
- -- we do not want this to go through the fixed-point conversion
- -- circuits. Note that gigi always treats fixed-point as equivalent
- -- to the corresponding integer type anyway.
+ -- we do all the required analysis of the conversion here, because we do
+ -- not want this to go through the fixed-point conversion circuits. Note
+ -- that the back end always treats fixed-point as equivalent to the
+ -- corresponding integer type anyway.
when Attribute_Integer_Value => Integer_Value :
begin
Apply_Type_Conversion_Checks (N);
end Integer_Value;
+ -------------------
+ -- Invalid_Value --
+ -------------------
+
+ when Attribute_Invalid_Value =>
+ Rewrite (N, Get_Simple_Init_Val (Ptyp, N));
+
----------
-- Last --
----------
- when Attribute_Last => declare
- Ptyp : constant Entity_Id := Etype (Pref);
+ when Attribute_Last =>
- begin
-- If the prefix type is a constrained packed array type which
-- already has a Packed_Array_Type representation defined, then
-- replace this attribute with a direct reference to 'Last of the
- -- appropriate index subtype (since otherwise Gigi will try to give
- -- us the value of 'Last for this implementation type).
+ -- appropriate index subtype (since otherwise the back end will try
+ -- to give us the value of 'Last for this implementation type).
if Is_Constrained_Packed_Array (Ptyp) then
Rewrite (N,
elsif Is_Access_Type (Ptyp) then
Apply_Access_Check (N);
end if;
- end;
--------------
-- Last_Bit --
--------------
- -- We compute this if a component clause was present, otherwise
- -- we leave the computation up to Gigi, since we don't know what
- -- layout will be chosen.
+ -- We compute this if a component clause was present, otherwise we leave
+ -- the computation up to the back end, since we don't know what layout
+ -- will be chosen.
- when Attribute_Last_Bit => Last_Bit :
- declare
+ when Attribute_Last_Bit => Last_Bit_Attr : declare
CE : constant Entity_Id := Entity (Selector_Name (Pref));
begin
- if Known_Static_Component_Bit_Offset (CE)
+ -- In Ada 2005 (or later) if we have the standard nondefault
+ -- bit order, then we return the original value as given in
+ -- the component clause (RM 2005 13.5.2(4/2)).
+
+ if Present (Component_Clause (CE))
+ and then Ada_Version >= Ada_2005
+ and then not Reverse_Bit_Order (Scope (CE))
+ then
+ Rewrite (N,
+ Make_Integer_Literal (Loc,
+ Intval => Expr_Value (Last_Bit (Component_Clause (CE)))));
+ Analyze_And_Resolve (N, Typ);
+
+ -- Otherwise (Ada 83/95 or Ada 2005 or later with reverse bit order),
+ -- rewrite with normalized value if we know it statically.
+
+ elsif Known_Static_Component_Bit_Offset (CE)
and then Known_Static_Esize (CE)
then
Rewrite (N,
Make_Integer_Literal (Loc,
Intval => (Component_Bit_Offset (CE) mod System_Storage_Unit)
+ Esize (CE) - 1));
-
Analyze_And_Resolve (N, Typ);
+ -- Otherwise leave to back end, just apply universal integer checks
+
else
Apply_Universal_Integer_Attribute_Checks (N);
end if;
- end Last_Bit;
+ end Last_Bit_Attr;
------------------
-- Leading_Part --
-- Transforms 'Leading_Part into a call to the floating-point attribute
-- function Leading_Part in Fat_xxx (where xxx is the root type)
- -- Note: strictly, we should have special case code to deal with
+ -- Note: strictly, we should generate special case code to deal with
-- absurdly large positive arguments (greater than Integer'Last), which
-- result in returning the first argument unchanged, but it hardly seems
-- worth the effort. We raise constraint error for absurdly negative
------------
when Attribute_Length => declare
- Ptyp : constant Entity_Id := Etype (Pref);
Ityp : Entity_Id;
Xnum : Uint;
if Is_Array_Type (Ptyp) and then Is_Packed (Ptyp) then
Ityp := Get_Index_Subtype (N);
- -- If the index type, Ityp, is an enumeration type with
- -- holes, then we calculate X'Length explicitly using
+ -- If the index type, Ityp, is an enumeration type with holes,
+ -- then we calculate X'Length explicitly using
-- Typ'Max
-- (0, Ityp'Pos (X'Last (N)) -
-- Ityp'Pos (X'First (N)) + 1);
- -- Since the bounds in the template are the representation
- -- values and gigi would get the wrong value.
+ -- Since the bounds in the template are the representation values
+ -- and the back end would get the wrong value.
if Is_Enumeration_Type (Ityp)
and then Present (Enum_Pos_To_Rep (Base_Type (Ityp)))
-- If the prefix type is a constrained packed array type which
-- already has a Packed_Array_Type representation defined, then
-- replace this attribute with a direct reference to 'Range_Length
- -- of the appropriate index subtype (since otherwise Gigi will try
- -- to give us the value of 'Length for this implementation type).
+ -- of the appropriate index subtype (since otherwise the back end
+ -- will try to give us the value of 'Length for this
+ -- implementation type).
elsif Is_Constrained (Ptyp) then
Rewrite (N,
Analyze_And_Resolve (N, Typ);
end if;
- -- If we have a packed array that is not bit packed, which was
-
-- Access type case
elsif Is_Access_Type (Ptyp) then
Apply_Access_Check (N);
- -- If the designated type is a packed array type, then we
- -- convert the reference to:
+ -- If the designated type is a packed array type, then we convert
+ -- the reference to:
-- typ'Max (0, 1 +
-- xtyp'Pos (Pref'Last (Expr)) -
-- xtyp'Pos (Pref'First (Expr)));
- -- This is a bit complex, but it is the easiest thing to do
- -- that works in all cases including enum types with holes
- -- xtyp here is the appropriate index type.
+ -- This is a bit complex, but it is the easiest thing to do that
+ -- works in all cases including enum types with holes xtyp here
+ -- is the appropriate index type.
declare
Dtyp : constant Entity_Id := Designated_Type (Ptyp);
end if;
end;
- -- Otherwise leave it to gigi
+ -- Otherwise leave it to the back end
else
Apply_Universal_Integer_Attribute_Checks (N);
------------------
-- Machine_Size is equivalent to Object_Size, so transform it into
- -- Object_Size and that way Gigi never sees Machine_Size.
+ -- Object_Size and that way the back end never sees Machine_Size.
when Attribute_Machine_Size =>
Rewrite (N,
--------------
-- The only case that can get this far is the dynamic case of the old
- -- Ada 83 Mantissa attribute for the fixed-point case. For this case, we
- -- expand:
+ -- Ada 83 Mantissa attribute for the fixed-point case. For this case,
+ -- we expand:
-- typ'Mantissa
-- (Integer'Integer_Value (typ'First),
-- Integer'Integer_Value (typ'Last)));
- when Attribute_Mantissa => Mantissa : declare
- Ptyp : constant Entity_Id := Etype (Pref);
-
- begin
+ when Attribute_Mantissa => Mantissa : begin
Rewrite (N,
Convert_To (Typ,
Make_Function_Call (Loc,
Analyze_And_Resolve (N, Typ);
end Mantissa;
+ ----------------------------------
+ -- Max_Size_In_Storage_Elements --
+ ----------------------------------
+
+ when Attribute_Max_Size_In_Storage_Elements =>
+ Apply_Universal_Integer_Attribute_Checks (N);
+
+ -- Heap-allocated controlled objects contain two extra pointers which
+ -- are not part of the actual type. Transform the attribute reference
+ -- into a runtime expression to add the size of the hidden header.
+
+ -- Do not perform this expansion on .NET/JVM targets because the
+ -- two pointers are already present in the type.
+
+ if VM_Target = No_VM
+ and then Nkind (N) = N_Attribute_Reference
+ and then Needs_Finalization (Ptyp)
+ and then not Header_Size_Added (N)
+ then
+ Set_Header_Size_Added (N);
+
+ -- Generate:
+ -- P'Max_Size_In_Storage_Elements +
+ -- Universal_Integer
+ -- (Header_Size_With_Padding (Ptyp'Alignment))
+
+ Rewrite (N,
+ Make_Op_Add (Loc,
+ Left_Opnd => Relocate_Node (N),
+ Right_Opnd =>
+ Convert_To (Universal_Integer,
+ Make_Function_Call (Loc,
+ Name =>
+ New_Reference_To
+ (RTE (RE_Header_Size_With_Padding), Loc),
+
+ Parameter_Associations => New_List (
+ Make_Attribute_Reference (Loc,
+ Prefix =>
+ New_Reference_To (Ptyp, Loc),
+ Attribute_Name => Name_Alignment))))));
+
+ Analyze (N);
+ return;
+ end if;
+
--------------------
-- Mechanism_Code --
--------------------
-- result is modulus + value, where the value might be as small as
-- -modulus. The trouble is what type do we use to do the subtract.
-- No type will do, since modulus can be as big as 2**64, and no
- -- integer type accomodates this value. Let's do bit of algebra
+ -- integer type accommodates this value. Let's do bit of algebra
-- modulus + value
-- = modulus - (-value)
-- The processing for Object_Size shares the processing for Size
- ------------
- -- Output --
- ------------
+ ---------
+ -- Old --
+ ---------
- when Attribute_Output => Output : declare
- P_Type : constant Entity_Id := Entity (Pref);
- U_Type : constant Entity_Id := Underlying_Type (P_Type);
- Pname : Entity_Id;
- Decl : Node_Id;
+ when Attribute_Old => Old : declare
+ Tnn : constant Entity_Id := Make_Temporary (Loc, 'T', Pref);
+ Subp : Node_Id;
+ Asn_Stm : Node_Id;
+
+ begin
+ -- Find the nearest subprogram body, ignoring _Preconditions
+
+ Subp := N;
+ loop
+ Subp := Parent (Subp);
+ exit when Nkind (Subp) = N_Subprogram_Body
+ and then Chars (Defining_Entity (Subp)) /= Name_uPostconditions;
+ end loop;
+
+ -- Insert the initialized object declaration at the start of the
+ -- subprogram's declarations.
+
+ Asn_Stm :=
+ Make_Object_Declaration (Loc,
+ Defining_Identifier => Tnn,
+ Constant_Present => True,
+ Object_Definition => New_Occurrence_Of (Etype (N), Loc),
+ Expression => Pref);
+
+ -- Push the subprogram's scope, so that the object will be analyzed
+ -- in that context (rather than the context of the Precondition
+ -- subprogram) and will have its Scope set properly.
+
+ if Present (Corresponding_Spec (Subp)) then
+ Push_Scope (Corresponding_Spec (Subp));
+ else
+ Push_Scope (Defining_Entity (Subp));
+ end if;
+
+ if Is_Empty_List (Declarations (Subp)) then
+ Set_Declarations (Subp, New_List (Asn_Stm));
+ Analyze (Asn_Stm);
+ else
+ Insert_Action (First (Declarations (Subp)), Asn_Stm);
+ end if;
+
+ Pop_Scope;
+
+ Rewrite (N, New_Occurrence_Of (Tnn, Loc));
+ end Old;
+
+ ----------------------
+ -- Overlaps_Storage --
+ ----------------------
+
+ when Attribute_Overlaps_Storage => Overlaps_Storage : declare
+ Loc : constant Source_Ptr := Sloc (N);
+
+ X : constant Node_Id := Prefix (N);
+ Y : constant Node_Id := First (Expressions (N));
+ -- The argumens
+
+ X_Addr, Y_Addr : Node_Id;
+ -- the expressions for their integer addresses
+
+ X_Size, Y_Size : Node_Id;
+ -- the expressions for their sizes
+
+ Cond : Node_Id;
+
+ begin
+ -- Attribute expands into:
+
+ -- if X'Address < Y'address then
+ -- (X'address + X'Size - 1) >= Y'address
+ -- else
+ -- (Y'address + Y'size - 1) >= X'Address
+ -- end if;
+
+ -- with the proper address operations. We convert addresses to
+ -- integer addresses to use predefined arithmetic. The size is
+ -- expressed in storage units.
+
+ X_Addr :=
+ Unchecked_Convert_To (RTE (RE_Integer_Address),
+ Make_Attribute_Reference (Loc,
+ Attribute_Name => Name_Address,
+ Prefix => New_Copy_Tree (X)));
+
+ Y_Addr :=
+ Unchecked_Convert_To (RTE (RE_Integer_Address),
+ Make_Attribute_Reference (Loc,
+ Attribute_Name => Name_Address,
+ Prefix => New_Copy_Tree (Y)));
+
+ X_Size :=
+ Make_Op_Divide (Loc,
+ Left_Opnd =>
+ Make_Attribute_Reference (Loc,
+ Attribute_Name => Name_Size,
+ Prefix => New_Copy_Tree (X)),
+ Right_Opnd =>
+ Make_Integer_Literal (Loc, System_Storage_Unit));
+
+ Y_Size :=
+ Make_Op_Divide (Loc,
+ Left_Opnd =>
+ Make_Attribute_Reference (Loc,
+ Attribute_Name => Name_Size,
+ Prefix => New_Copy_Tree (Y)),
+ Right_Opnd =>
+ Make_Integer_Literal (Loc, System_Storage_Unit));
+
+ Cond :=
+ Make_Op_Le (Loc,
+ Left_Opnd => X_Addr,
+ Right_Opnd => Y_Addr);
+
+ Rewrite (N,
+ Make_Conditional_Expression (Loc,
+ New_List (
+ Cond,
+
+ Make_Op_Ge (Loc,
+ Left_Opnd =>
+ Make_Op_Add (Loc,
+ Left_Opnd => X_Addr,
+ Right_Opnd =>
+ Make_Op_Subtract (Loc,
+ Left_Opnd => X_Size,
+ Right_Opnd => Make_Integer_Literal (Loc, 1))),
+ Right_Opnd => Y_Addr),
+
+ Make_Op_Ge (Loc,
+ Make_Op_Add (Loc,
+ Left_Opnd => Y_Addr,
+ Right_Opnd =>
+ Make_Op_Subtract (Loc,
+ Left_Opnd => Y_Size,
+ Right_Opnd => Make_Integer_Literal (Loc, 1))),
+ Right_Opnd => X_Addr))));
+
+ Analyze_And_Resolve (N, Standard_Boolean);
+ end Overlaps_Storage;
+
+ ------------
+ -- Output --
+ ------------
+
+ when Attribute_Output => Output : declare
+ P_Type : constant Entity_Id := Entity (Pref);
+ U_Type : constant Entity_Id := Underlying_Type (P_Type);
+ Pname : Entity_Id;
+ Decl : Node_Id;
Prag : Node_Id;
Arg3 : Node_Id;
Wfunc : Node_Id;
-- We cannot figure out a practical way to implement this
-- accessibility check on virtual machines, so we omit it.
- if Ada_Version >= Ada_05
- and then VM_Target = No_VM
+ if Ada_Version >= Ada_2005
+ and then Tagged_Type_Expansion
then
Insert_Action (N,
Make_Implicit_If_Statement (N,
---------
-- For enumeration types with a standard representation, Pos is
- -- handled by Gigi.
+ -- handled by the back end.
- -- For enumeration types, with a non-standard representation we
- -- generate a call to the _Rep_To_Pos function created when the
- -- type was frozen. The call has the form
+ -- For enumeration types, with a non-standard representation we generate
+ -- a call to the _Rep_To_Pos function created when the type was frozen.
+ -- The call has the form
-- _rep_to_pos (expr, flag)
-- Position --
--------------
- -- We compute this if a component clause was present, otherwise
- -- we leave the computation up to Gigi, since we don't know what
- -- layout will be chosen.
+ -- We compute this if a component clause was present, otherwise we leave
+ -- the computation up to the back end, since we don't know what layout
+ -- will be chosen.
- when Attribute_Position => Position :
+ when Attribute_Position => Position_Attr :
declare
CE : constant Entity_Id := Entity (Selector_Name (Pref));
begin
if Present (Component_Clause (CE)) then
- Rewrite (N,
- Make_Integer_Literal (Loc,
- Intval => Component_Bit_Offset (CE) / System_Storage_Unit));
+
+ -- In Ada 2005 (or later) if we have the standard nondefault
+ -- bit order, then we return the original value as given in
+ -- the component clause (RM 2005 13.5.2(2/2)).
+
+ if Ada_Version >= Ada_2005
+ and then not Reverse_Bit_Order (Scope (CE))
+ then
+ Rewrite (N,
+ Make_Integer_Literal (Loc,
+ Intval => Expr_Value (Position (Component_Clause (CE)))));
+
+ -- Otherwise (Ada 83 or 95, or reverse bit order specified in
+ -- later Ada version), return the normalized value.
+
+ else
+ Rewrite (N,
+ Make_Integer_Literal (Loc,
+ Intval => Component_Bit_Offset (CE) / System_Storage_Unit));
+ end if;
+
Analyze_And_Resolve (N, Typ);
+ -- If back end is doing things, just apply universal integer checks
+
else
Apply_Universal_Integer_Attribute_Checks (N);
end if;
- end Position;
+ end Position_Attr;
----------
-- Pred --
when Attribute_Pred => Pred :
declare
- Ptyp : constant Entity_Id := Base_Type (Etype (Pref));
+ Etyp : constant Entity_Id := Base_Type (Ptyp);
begin
+
-- For enumeration types with non-standard representations, we
-- expand typ'Pred (x) into
-- If the representation is contiguous, we compute instead
-- Lit1 + Rep_to_Pos (x -1), to catch invalid representations.
+ -- The conversion function Enum_Pos_To_Rep is defined on the
+ -- base type, not the subtype, so we have to use the base type
+ -- explicitly for this and other enumeration attributes.
if Is_Enumeration_Type (Ptyp)
- and then Present (Enum_Pos_To_Rep (Ptyp))
+ and then Present (Enum_Pos_To_Rep (Etyp))
then
- if Has_Contiguous_Rep (Ptyp) then
+ if Has_Contiguous_Rep (Etyp) then
Rewrite (N,
Unchecked_Convert_To (Ptyp,
Make_Op_Add (Loc,
Make_Function_Call (Loc,
Name =>
New_Reference_To
- (TSS (Ptyp, TSS_Rep_To_Pos), Loc),
+ (TSS (Etyp, TSS_Rep_To_Pos), Loc),
Parameter_Associations =>
New_List (
Append_To (Exprs, Rep_To_Pos_Flag (Ptyp, Loc));
Rewrite (N,
Make_Indexed_Component (Loc,
- Prefix => New_Reference_To (Enum_Pos_To_Rep (Ptyp), Loc),
+ Prefix =>
+ New_Reference_To
+ (Enum_Pos_To_Rep (Etyp), Loc),
Expressions => New_List (
Make_Op_Subtract (Loc,
Left_Opnd =>
Make_Function_Call (Loc,
Name =>
- New_Reference_To (TSS (Ptyp, TSS_Rep_To_Pos), Loc),
+ New_Reference_To
+ (TSS (Etyp, TSS_Rep_To_Pos), Loc),
Parameter_Associations => Exprs),
Right_Opnd => Make_Integer_Literal (Loc, 1)))));
end if;
elsif Is_Modular_Integer_Type (Ptyp) then
null;
- -- For other types, if range checking is enabled, we must generate
- -- a check if overflow checking is enabled.
+ -- For other types, if argument is marked as needing a range check or
+ -- overflow checking is enabled, we must generate a check.
- elsif not Overflow_Checks_Suppressed (Ptyp) then
+ elsif not Overflow_Checks_Suppressed (Ptyp)
+ or else Do_Range_Check (First (Exprs))
+ then
+ Set_Do_Range_Check (First (Exprs), False);
Expand_Pred_Succ (N);
end if;
end Pred;
New_Itype := Create_Itype (E_Access_Type, N);
Set_Etype (New_Itype, New_Itype);
- Init_Esize (New_Itype);
- Init_Size_Align (New_Itype);
Set_Directly_Designated_Type (New_Itype,
Corresponding_Record_Type (Conctyp));
Freeze_Itype (New_Itype, N);
Object_Parm :=
Make_Attribute_Reference (Loc,
- Prefix =>
- Make_Selected_Component (Loc,
- Prefix =>
- Unchecked_Convert_To (New_Itype,
- New_Reference_To
- (First_Entity
- (Protected_Body_Subprogram (Subprg)),
- Loc)),
- Selector_Name =>
- Make_Identifier (Loc, Name_uObject)),
+ Prefix =>
+ Make_Selected_Component (Loc,
+ Prefix =>
+ Unchecked_Convert_To (New_Itype,
+ New_Reference_To
+ (First_Entity
+ (Protected_Body_Subprogram (Subprg)),
+ Loc)),
+ Selector_Name =>
+ Make_Identifier (Loc, Name_uObject)),
Attribute_Name => Name_Unchecked_Access);
end;
(First_Entity
(Protected_Body_Subprogram (Subprg)),
Loc),
- Selector_Name =>
- Make_Identifier (Loc, Name_uObject)),
+ Selector_Name => Make_Identifier (Loc, Name_uObject)),
Attribute_Name => Name_Unchecked_Access);
end if;
-- Range_Length --
------------------
- when Attribute_Range_Length => Range_Length : declare
- P_Type : constant Entity_Id := Etype (Pref);
+ when Attribute_Range_Length => Range_Length : begin
- begin
-- The only special processing required is for the case where
-- Range_Length is applied to an enumeration type with holes.
-- In this case we transform
-- So that the result reflects the proper Pos values instead
-- of the underlying representations.
- if Is_Enumeration_Type (P_Type)
- and then Has_Non_Standard_Rep (P_Type)
+ if Is_Enumeration_Type (Ptyp)
+ and then Has_Non_Standard_Rep (Ptyp)
then
Rewrite (N,
Make_Op_Add (Loc,
Left_Opnd =>
Make_Attribute_Reference (Loc,
Attribute_Name => Name_Pos,
- Prefix => New_Occurrence_Of (P_Type, Loc),
+ Prefix => New_Occurrence_Of (Ptyp, Loc),
Expressions => New_List (
Make_Attribute_Reference (Loc,
Attribute_Name => Name_Last,
- Prefix => New_Occurrence_Of (P_Type, Loc)))),
+ Prefix => New_Occurrence_Of (Ptyp, Loc)))),
Right_Opnd =>
Make_Attribute_Reference (Loc,
Attribute_Name => Name_Pos,
- Prefix => New_Occurrence_Of (P_Type, Loc),
+ Prefix => New_Occurrence_Of (Ptyp, Loc),
Expressions => New_List (
Make_Attribute_Reference (Loc,
Attribute_Name => Name_First,
- Prefix => New_Occurrence_Of (P_Type, Loc))))),
+ Prefix => New_Occurrence_Of (Ptyp, Loc))))),
- Right_Opnd =>
- Make_Integer_Literal (Loc, 1)));
+ Right_Opnd => Make_Integer_Literal (Loc, 1)));
Analyze_And_Resolve (N, Typ);
- -- For all other cases, attribute is handled by Gigi, but we need
- -- to deal with the case of the range check on a universal integer.
+ -- For all other cases, the attribute is handled by the back end, but
+ -- we need to deal with the case of the range check on a universal
+ -- integer.
else
Apply_Universal_Integer_Attribute_Checks (N);
Rewrite (N,
Make_Assignment_Statement (Loc,
- Name => Lhs,
+ Name => Lhs,
Expression => Rhs));
Analyze (N);
(Discriminant_Default_Value (First_Discriminant (U_Type)))
then
Build_Mutable_Record_Read_Procedure
- (Loc, Base_Type (U_Type), Decl, Pname);
+ (Loc, Full_Base (U_Type), Decl, Pname);
else
Build_Record_Read_Procedure
- (Loc, Base_Type (U_Type), Decl, Pname);
+ (Loc, Full_Base (U_Type), Decl, Pname);
end if;
-- Suppress checks, uninitialized or otherwise invalid
Rewrite_Stream_Proc_Call (Pname);
end Read;
+ ---------
+ -- Ref --
+ ---------
+
+ -- Ref is identical to To_Address, see To_Address for processing
+
---------------
-- Remainder --
---------------
when Attribute_Remainder =>
Expand_Fpt_Attribute_RR (N);
+ ------------
+ -- Result --
+ ------------
+
+ -- Transform 'Result into reference to _Result formal. At the point
+ -- where a legal 'Result attribute is expanded, we know that we are in
+ -- the context of a _Postcondition function with a _Result parameter.
+
+ when Attribute_Result =>
+ Rewrite (N, Make_Identifier (Loc, Chars => Name_uResult));
+ Analyze_And_Resolve (N, Typ);
+
-----------
-- Round --
-----------
when Attribute_Rounding =>
Expand_Fpt_Attribute_R (N);
+ ------------------
+ -- Same_Storage --
+ ------------------
+
+ when Attribute_Same_Storage => Same_Storage : declare
+ Loc : constant Source_Ptr := Sloc (N);
+
+ X : constant Node_Id := Prefix (N);
+ Y : constant Node_Id := First (Expressions (N));
+ -- The arguments
+
+ X_Addr, Y_Addr : Node_Id;
+ -- Rhe expressions for their addresses
+
+ X_Size, Y_Size : Node_Id;
+ -- Rhe expressions for their sizes
+
+ begin
+ -- The attribute is expanded as:
+
+ -- (X'address = Y'address)
+ -- and then (X'Size = Y'Size)
+
+ -- If both arguments have the same Etype the second conjunct can be
+ -- omitted.
+
+ X_Addr :=
+ Make_Attribute_Reference (Loc,
+ Attribute_Name => Name_Address,
+ Prefix => New_Copy_Tree (X));
+
+ Y_Addr :=
+ Make_Attribute_Reference (Loc,
+ Attribute_Name => Name_Address,
+ Prefix => New_Copy_Tree (Y));
+
+ X_Size :=
+ Make_Attribute_Reference (Loc,
+ Attribute_Name => Name_Size,
+ Prefix => New_Copy_Tree (X));
+
+ Y_Size :=
+ Make_Attribute_Reference (Loc,
+ Attribute_Name => Name_Size,
+ Prefix => New_Copy_Tree (Y));
+
+ if Etype (X) = Etype (Y) then
+ Rewrite (N,
+ (Make_Op_Eq (Loc,
+ Left_Opnd => X_Addr,
+ Right_Opnd => Y_Addr)));
+ else
+ Rewrite (N,
+ Make_Op_And (Loc,
+ Left_Opnd =>
+ Make_Op_Eq (Loc,
+ Left_Opnd => X_Addr,
+ Right_Opnd => Y_Addr),
+ Right_Opnd =>
+ Make_Op_Eq (Loc,
+ Left_Opnd => X_Size,
+ Right_Opnd => Y_Size)));
+ end if;
+
+ Analyze_And_Resolve (N, Standard_Boolean);
+ end Same_Storage;
+
-------------
-- Scaling --
-------------
when Attribute_Scaling =>
Expand_Fpt_Attribute_RI (N);
+ -------------------------
+ -- Simple_Storage_Pool --
+ -------------------------
+
+ when Attribute_Simple_Storage_Pool =>
+ Rewrite (N,
+ Make_Type_Conversion (Loc,
+ Subtype_Mark => New_Reference_To (Etype (N), Loc),
+ Expression => New_Reference_To (Entity (N), Loc)));
+ Analyze_And_Resolve (N, Typ);
+
----------
-- Size --
----------
Attribute_VADS_Size => Size :
declare
- Ptyp : constant Entity_Id := Etype (Pref);
Siz : Uint;
New_Node : Node_Id;
else
if (not Is_Entity_Name (Pref)
or else not Is_Type (Entity (Pref)))
- and then (Is_Scalar_Type (Etype (Pref))
- or else Is_Constrained (Etype (Pref)))
+ and then (Is_Scalar_Type (Ptyp) or else Is_Constrained (Ptyp))
then
- Rewrite (Pref, New_Occurrence_Of (Etype (Pref), Loc));
+ Rewrite (Pref, New_Occurrence_Of (Ptyp, Loc));
end if;
-- For a scalar type for which no size was explicitly given,
-- VADS_Size means Object_Size. This is the other respect in
-- which VADS_Size differs from Size.
- if Is_Scalar_Type (Etype (Pref))
- and then No (Size_Clause (Etype (Pref)))
- then
+ if Is_Scalar_Type (Ptyp) and then No (Size_Clause (Ptyp)) then
Set_Attribute_Name (N, Name_Object_Size);
-- In all other cases, Size and VADS_Size are the sane
end if;
end if;
- -- For class-wide types, X'Class'Size is transformed into a
- -- direct reference to the Size of the class type, so that gigi
- -- does not have to deal with the X'Class'Size reference.
+ -- For class-wide types, X'Class'Size is transformed into a direct
+ -- reference to the Size of the class type, so that the back end does
+ -- not have to deal with the X'Class'Size reference.
if Is_Entity_Name (Pref)
and then Is_Class_Wide_Type (Entity (Pref))
-- For X'Size applied to an object of a class-wide type, transform
-- X'Size into a call to the primitive operation _Size applied to X.
- elsif Is_Class_Wide_Type (Ptyp) then
-
+ elsif Is_Class_Wide_Type (Ptyp)
+ or else (Id = Attribute_Size
+ and then Is_Tagged_Type (Ptyp)
+ and then Has_Unknown_Discriminants (Ptyp))
+ then
-- No need to do anything else compiling under restriction
-- No_Dispatching_Calls. During the semantic analysis we
-- already notified such violation.
Rewrite (N, New_Node);
Analyze_And_Resolve (N, Typ);
- return;
+ return;
-- Case of known RM_Size of a type
end if;
end;
- -- All other cases are handled by Gigi
+ -- All other cases are handled by the back end
else
Apply_Universal_Integer_Attribute_Checks (N);
if Is_Entity_Name (Pref)
and then Is_Formal (Entity (Pref))
- and then Is_Array_Type (Etype (Pref))
- and then Is_Packed (Etype (Pref))
+ and then Is_Array_Type (Ptyp)
+ and then Is_Packed (Ptyp)
then
Rewrite (N,
Make_Attribute_Reference (Loc,
end if;
-- If Size applies to a dereference of an access to unconstrained
- -- packed array, GIGI needs to see its unconstrained nominal type,
- -- but also a hint to the actual constrained type.
+ -- packed array, the back end needs to see its unconstrained
+ -- nominal type, but also a hint to the actual constrained type.
if Nkind (Pref) = N_Explicit_Dereference
- and then Is_Array_Type (Etype (Pref))
- and then not Is_Constrained (Etype (Pref))
- and then Is_Packed (Etype (Pref))
+ and then Is_Array_Type (Ptyp)
+ and then not Is_Constrained (Ptyp)
+ and then Is_Packed (Ptyp)
then
Set_Actual_Designated_Subtype (Pref,
Get_Actual_Subtype (Pref));
-- Storage_Size --
------------------
- when Attribute_Storage_Size => Storage_Size :
- declare
- Ptyp : constant Entity_Id := Etype (Pref);
+ when Attribute_Storage_Size => Storage_Size : declare
+ Alloc_Op : Entity_Id := Empty;
begin
+
-- Access type case, always go to the root type
-- The case of access types results in a value of zero for the case
(Storage_Size_Variable (Root_Type (Ptyp)), Loc)))));
elsif Present (Associated_Storage_Pool (Root_Type (Ptyp))) then
- Rewrite (N,
- OK_Convert_To (Typ,
- Make_Function_Call (Loc,
- Name =>
- New_Reference_To
- (Find_Prim_Op
- (Etype (Associated_Storage_Pool (Root_Type (Ptyp))),
- Attribute_Name (N)),
- Loc),
- Parameter_Associations => New_List (
- New_Reference_To
- (Associated_Storage_Pool (Root_Type (Ptyp)), Loc)))));
+ -- If the access type is associated with a simple storage pool
+ -- object, then attempt to locate the optional Storage_Size
+ -- function of the simple storage pool type. If not found,
+ -- then the result will default to zero.
+
+ if Present (Get_Rep_Pragma (Root_Type (Ptyp),
+ Name_Simple_Storage_Pool_Type))
+ then
+ declare
+ Pool_Type : constant Entity_Id :=
+ Base_Type (Etype (Entity (N)));
+
+ begin
+ Alloc_Op := Get_Name_Entity_Id (Name_Storage_Size);
+ while Present (Alloc_Op) loop
+ if Scope (Alloc_Op) = Scope (Pool_Type)
+ and then Present (First_Formal (Alloc_Op))
+ and then Etype (First_Formal (Alloc_Op)) = Pool_Type
+ then
+ exit;
+ end if;
+
+ Alloc_Op := Homonym (Alloc_Op);
+ end loop;
+ end;
+
+ -- In the normal Storage_Pool case, retrieve the primitive
+ -- function associated with the pool type.
+
+ else
+ Alloc_Op :=
+ Find_Prim_Op
+ (Etype (Associated_Storage_Pool (Root_Type (Ptyp))),
+ Attribute_Name (N));
+ end if;
+
+ -- If Storage_Size wasn't found (can only occur in the simple
+ -- storage pool case), then simply use zero for the result.
+
+ if not Present (Alloc_Op) then
+ Rewrite (N, Make_Integer_Literal (Loc, 0));
+
+ -- Otherwise, rewrite the allocator as a call to pool type's
+ -- Storage_Size function.
+
+ else
+ Rewrite (N,
+ OK_Convert_To (Typ,
+ Make_Function_Call (Loc,
+ Name =>
+ New_Reference_To (Alloc_Op, Loc),
+
+ Parameter_Associations => New_List (
+ New_Reference_To
+ (Associated_Storage_Pool
+ (Root_Type (Ptyp)), Loc)))));
+ end if;
else
Rewrite (N, Make_Integer_Literal (Loc, 0));
-- Stream_Size --
-----------------
- when Attribute_Stream_Size => Stream_Size : declare
- Ptyp : constant Entity_Id := Etype (Pref);
- Size : Int;
-
- begin
- -- If we have a Stream_Size clause for this type use it, otherwise
- -- the Stream_Size if the size of the type.
-
- if Has_Stream_Size_Clause (Ptyp) then
- Size :=
- UI_To_Int
- (Static_Integer (Expression (Stream_Size_Clause (Ptyp))));
- else
- Size := UI_To_Int (Esize (Ptyp));
- end if;
-
- Rewrite (N, Make_Integer_Literal (Loc, Intval => Size));
+ when Attribute_Stream_Size =>
+ Rewrite (N,
+ Make_Integer_Literal (Loc, Intval => Get_Stream_Size (Ptyp)));
Analyze_And_Resolve (N, Typ);
- end Stream_Size;
----------
-- Succ --
-- 2. For floating-point, generate call to attribute function
-- 3. For other cases, deal with constraint checking
- when Attribute_Succ => Succ :
- declare
- Ptyp : constant Entity_Id := Base_Type (Etype (Pref));
+ when Attribute_Succ => Succ : declare
+ Etyp : constant Entity_Id := Base_Type (Ptyp);
begin
+
-- For enumeration types with non-standard representations, we
-- expand typ'Succ (x) into
-- Lit1 + Rep_to_Pos (x+1), to catch invalid representations.
if Is_Enumeration_Type (Ptyp)
- and then Present (Enum_Pos_To_Rep (Ptyp))
+ and then Present (Enum_Pos_To_Rep (Etyp))
then
- if Has_Contiguous_Rep (Ptyp) then
+ if Has_Contiguous_Rep (Etyp) then
Rewrite (N,
Unchecked_Convert_To (Ptyp,
Make_Op_Add (Loc,
Make_Function_Call (Loc,
Name =>
New_Reference_To
- (TSS (Ptyp, TSS_Rep_To_Pos), Loc),
+ (TSS (Etyp, TSS_Rep_To_Pos), Loc),
Parameter_Associations =>
New_List (
Append_To (Exprs, Rep_To_Pos_Flag (Ptyp, Loc));
Rewrite (N,
Make_Indexed_Component (Loc,
- Prefix => New_Reference_To (Enum_Pos_To_Rep (Ptyp), Loc),
+ Prefix =>
+ New_Reference_To
+ (Enum_Pos_To_Rep (Etyp), Loc),
Expressions => New_List (
Make_Op_Add (Loc,
Left_Opnd =>
Make_Function_Call (Loc,
Name =>
New_Reference_To
- (TSS (Ptyp, TSS_Rep_To_Pos), Loc),
+ (TSS (Etyp, TSS_Rep_To_Pos), Loc),
Parameter_Associations => Exprs),
Right_Opnd => Make_Integer_Literal (Loc, 1)))));
end if;
elsif Is_Modular_Integer_Type (Ptyp) then
null;
- -- For other types, if range checking is enabled, we must generate
- -- a check if overflow checking is enabled.
+ -- For other types, if argument is marked as needing a range check or
+ -- overflow checking is enabled, we must generate a check.
- elsif not Overflow_Checks_Suppressed (Ptyp) then
+ elsif not Overflow_Checks_Suppressed (Ptyp)
+ or else Do_Range_Check (First (Exprs))
+ then
+ Set_Do_Range_Check (First (Exprs), False);
Expand_Pred_Succ (N);
end if;
end Succ;
-- Transforms X'Tag into a direct reference to the tag of X
- when Attribute_Tag => Tag :
- declare
+ when Attribute_Tag => Tag : declare
Ttyp : Entity_Id;
Prefix_Is_Type : Boolean;
Ttyp := Entity (Pref);
Prefix_Is_Type := True;
else
- Ttyp := Etype (Pref);
+ Ttyp := Ptyp;
Prefix_Is_Type := False;
end if;
Ttyp := Underlying_Type (Ttyp);
+ -- Ada 2005: The type may be a synchronized tagged type, in which
+ -- case the tag information is stored in the corresponding record.
+
+ if Is_Concurrent_Type (Ttyp) then
+ Ttyp := Corresponding_Record_Type (Ttyp);
+ end if;
+
if Prefix_Is_Type then
-- For VMs we leave the type attribute unexpanded because
-- there's not a dispatching table to reference.
- if VM_Target = No_VM then
+ if Tagged_Type_Expansion then
Rewrite (N,
Unchecked_Convert_To (RTE (RE_Tag),
New_Reference_To
Analyze_And_Resolve (N, RTE (RE_Tag));
end if;
- -- (Ada 2005 (AI-251): The use of 'Tag in the sources always
+ -- Ada 2005 (AI-251): The use of 'Tag in the sources always
-- references the primary tag of the actual object. If 'Tag is
-- applied to class-wide interface objects we generate code that
-- displaces "this" to reference the base of the object.
-- Not needed for VM targets, since all handled by the VM
- if VM_Target = No_VM then
+ if Tagged_Type_Expansion then
Rewrite (N,
Make_Explicit_Dereference (Loc,
Unchecked_Convert_To (RTE (RE_Tag_Ptr),
begin
-- The prefix of Terminated is of a task interface class-wide type.
-- Generate:
-
-- terminated (Task_Id (Pref._disp_get_task_id));
- if Ada_Version >= Ada_05
- and then Ekind (Etype (Pref)) = E_Class_Wide_Type
- and then Is_Interface (Etype (Pref))
- and then Is_Task_Interface (Etype (Pref))
+ if Ada_Version >= Ada_2005
+ and then Ekind (Ptyp) = E_Class_Wide_Type
+ and then Is_Interface (Ptyp)
+ and then Is_Task_Interface (Ptyp)
then
Rewrite (N,
Make_Function_Call (Loc,
-- To_Address --
----------------
- -- Transforms System'To_Address (X) into unchecked conversion
- -- from (integral) type of X to type address.
+ -- Transforms System'To_Address (X) and System.Address'Ref (X) into
+ -- unchecked conversion from (integral) type of X to type address.
- when Attribute_To_Address =>
+ when Attribute_To_Address | Attribute_Ref =>
Rewrite (N,
Unchecked_Convert_To (RTE (RE_Address),
Relocate_Node (First (Exprs))));
Analyze_And_Resolve (N, RTE (RE_Address));
+ ------------
+ -- To_Any --
+ ------------
+
+ when Attribute_To_Any => To_Any : declare
+ P_Type : constant Entity_Id := Etype (Pref);
+ Decls : constant List_Id := New_List;
+ begin
+ Rewrite (N,
+ Build_To_Any_Call
+ (Convert_To (P_Type,
+ Relocate_Node (First (Exprs))), Decls));
+ Insert_Actions (N, Decls);
+ Analyze_And_Resolve (N, RTE (RE_Any));
+ end To_Any;
+
----------------
-- Truncation --
----------------
Expand_Fpt_Attribute_R (N);
end if;
+ --------------
+ -- TypeCode --
+ --------------
+
+ when Attribute_TypeCode => TypeCode : declare
+ P_Type : constant Entity_Id := Etype (Pref);
+ Decls : constant List_Id := New_List;
+ begin
+ Rewrite (N, Build_TypeCode_Call (Loc, P_Type, Decls));
+ Insert_Actions (N, Decls);
+ Analyze_And_Resolve (N, RTE (RE_TypeCode));
+ end TypeCode;
+
-----------------------
-- Unbiased_Rounding --
-----------------------
-----------------
when Attribute_UET_Address => UET_Address : declare
- Ent : constant Entity_Id :=
- Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
+ Ent : constant Entity_Id := Make_Temporary (Loc, 'T');
begin
Insert_Action (N,
---------
-- For enumeration types with a standard representation, and for all
- -- other types, Val is handled by Gigi. For enumeration types with
- -- a non-standard representation we use the _Pos_To_Rep array that
+ -- other types, Val is handled by the back end. For enumeration types
+ -- with a non-standard representation we use the _Pos_To_Rep array that
-- was created when the type was frozen.
- when Attribute_Val => Val :
- declare
+ when Attribute_Val => Val : declare
Etyp : constant Entity_Id := Base_Type (Entity (Pref));
begin
end if;
Analyze_And_Resolve (N, Typ);
+
+ -- If the argument is marked as requiring a range check then generate
+ -- it here.
+
+ elsif Do_Range_Check (First (Exprs)) then
+ Set_Do_Range_Check (First (Exprs), False);
+ Generate_Range_Check (First (Exprs), Etyp, CE_Range_Check_Failed);
end if;
end Val;
-- The code for valid is dependent on the particular types involved.
-- See separate sections below for the generated code in each case.
- when Attribute_Valid => Valid :
- declare
- Ptyp : constant Entity_Id := Etype (Pref);
- Btyp : Entity_Id := Base_Type (Ptyp);
+ when Attribute_Valid => Valid : declare
+ Btyp : Entity_Id := Base_Type (Ptyp);
Tst : Node_Id;
Save_Validity_Checks_On : constant Boolean := Validity_Checks_On;
function Make_Range_Test return Node_Id;
-- Build the code for a range test of the form
- -- Btyp!(Pref) >= Btyp!(Ptyp'First)
- -- and then
- -- Btyp!(Pref) <= Btyp!(Ptyp'Last)
+ -- Btyp!(Pref) in Btyp!(Ptyp'First) .. Btyp!(Ptyp'Last)
---------------------
-- Make_Range_Test --
---------------------
function Make_Range_Test return Node_Id is
+ Temp : constant Node_Id := Duplicate_Subexpr (Pref);
+
begin
- return
- Make_And_Then (Loc,
- Left_Opnd =>
- Make_Op_Ge (Loc,
- Left_Opnd =>
- Unchecked_Convert_To (Btyp, Duplicate_Subexpr (Pref)),
+ -- The value whose validity is being checked has been captured in
+ -- an object declaration. We certainly don't want this object to
+ -- appear valid because the declaration initializes it!
- Right_Opnd =>
- Unchecked_Convert_To (Btyp,
- Make_Attribute_Reference (Loc,
- Prefix => New_Occurrence_Of (Ptyp, Loc),
- Attribute_Name => Name_First))),
+ if Is_Entity_Name (Temp) then
+ Set_Is_Known_Valid (Entity (Temp), False);
+ end if;
+ return
+ Make_In (Loc,
+ Left_Opnd =>
+ Unchecked_Convert_To (Btyp, Temp),
Right_Opnd =>
- Make_Op_Le (Loc,
- Left_Opnd =>
+ Make_Range (Loc,
+ Low_Bound =>
Unchecked_Convert_To (Btyp,
- Duplicate_Subexpr_No_Checks (Pref)),
-
- Right_Opnd =>
+ Make_Attribute_Reference (Loc,
+ Prefix => New_Occurrence_Of (Ptyp, Loc),
+ Attribute_Name => Name_First)),
+ High_Bound =>
Unchecked_Convert_To (Btyp,
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (Ptyp, Loc),
-- Start of processing for Attribute_Valid
begin
+ -- Do not expand sourced code 'Valid reference in CodePeer mode,
+ -- will be handled by the back-end directly.
+
+ if CodePeer_Mode and then Comes_From_Source (N) then
+ return;
+ end if;
+
-- Turn off validity checks. We do not want any implicit validity
-- checks to intefere with the explicit check from the attribute
Ftp : Entity_Id;
begin
- -- For vax fpt types, call appropriate routine in special vax
- -- floating point unit. We do not have to worry about loads in
- -- this case, since these types have no signalling NaN's.
- if Vax_Float (Btyp) then
- Expand_Vax_Valid (N);
+ case Float_Rep (Btyp) is
- -- The AAMP back end handles Valid for floating-point types
+ -- For vax fpt types, call appropriate routine in special
+ -- vax floating point unit. No need to worry about loads in
+ -- this case, since these types have no signalling NaN's.
- elsif Is_AAMP_Float (Btyp) then
- Analyze_And_Resolve (Pref, Ptyp);
- Set_Etype (N, Standard_Boolean);
- Set_Analyzed (N);
+ when VAX_Native => Expand_Vax_Valid (N);
- -- Non VAX float case
+ -- The AAMP back end handles Valid for floating-point types
- else
- Find_Fat_Info (Etype (Pref), Ftp, Pkg);
-
- -- If the floating-point object might be unaligned, we need
- -- to call the special routine Unaligned_Valid, which makes
- -- the needed copy, being careful not to load the value into
- -- any floating-point register. The argument in this case is
- -- obj'Address (see Unaligned_Valid routine in Fat_Gen).
-
- if Is_Possibly_Unaligned_Object (Pref) then
- Expand_Fpt_Attribute
- (N, Pkg, Name_Unaligned_Valid,
- New_List (
- Make_Attribute_Reference (Loc,
- Prefix => Relocate_Node (Pref),
- Attribute_Name => Name_Address)));
+ when AAMP =>
+ Analyze_And_Resolve (Pref, Ptyp);
+ Set_Etype (N, Standard_Boolean);
+ Set_Analyzed (N);
- -- In the normal case where we are sure the object is
- -- aligned, we generate a call to Valid, and the argument in
- -- this case is obj'Unrestricted_Access (after converting
- -- obj to the right floating-point type).
+ when IEEE_Binary =>
+ Find_Fat_Info (Ptyp, Ftp, Pkg);
- else
- Expand_Fpt_Attribute
- (N, Pkg, Name_Valid,
- New_List (
- Make_Attribute_Reference (Loc,
- Prefix => Unchecked_Convert_To (Ftp, Pref),
- Attribute_Name => Name_Unrestricted_Access)));
- end if;
- end if;
+ -- If the floating-point object might be unaligned, we
+ -- need to call the special routine Unaligned_Valid,
+ -- which makes the needed copy, being careful not to
+ -- load the value into any floating-point register.
+ -- The argument in this case is obj'Address (see
+ -- Unaligned_Valid routine in Fat_Gen).
+
+ if Is_Possibly_Unaligned_Object (Pref) then
+ Expand_Fpt_Attribute
+ (N, Pkg, Name_Unaligned_Valid,
+ New_List (
+ Make_Attribute_Reference (Loc,
+ Prefix => Relocate_Node (Pref),
+ Attribute_Name => Name_Address)));
+
+ -- In the normal case where we are sure the object is
+ -- aligned, we generate a call to Valid, and the argument
+ -- in this case is obj'Unrestricted_Access (after
+ -- converting obj to the right floating-point type).
+
+ else
+ Expand_Fpt_Attribute
+ (N, Pkg, Name_Valid,
+ New_List (
+ Make_Attribute_Reference (Loc,
+ Prefix => Unchecked_Convert_To (Ftp, Pref),
+ Attribute_Name => Name_Unrestricted_Access)));
+ end if;
+ end case;
-- One more task, we still need a range check. Required
-- only if we have a constraint, since the Valid routine
-- Value --
-----------
- -- Value attribute is handled in separate unti Exp_Imgv
+ -- Value attribute is handled in separate unit Exp_Imgv
when Attribute_Value =>
Exp_Imgv.Expand_Value_Attribute (N);
(Discriminant_Default_Value (First_Discriminant (U_Type)))
then
Build_Mutable_Record_Write_Procedure
- (Loc, Base_Type (U_Type), Decl, Pname);
+ (Loc, Full_Base (U_Type), Decl, Pname);
else
Build_Record_Write_Procedure
- (Loc, Base_Type (U_Type), Decl, Pname);
+ (Loc, Full_Base (U_Type), Decl, Pname);
end if;
Insert_Action (N, Decl);
Rewrite_Stream_Proc_Call (Pname);
end Write;
- -- Component_Size is handled by Gigi, unless the component size is known
- -- at compile time, which is always true in the packed array case. It is
- -- important that the packed array case is handled in the front end (see
- -- Eval_Attribute) since Gigi would otherwise get confused by the
- -- equivalent packed array type.
+ -- Component_Size is handled by the back end, unless the component size
+ -- is known at compile time, which is always true in the packed array
+ -- case. It is important that the packed array case is handled in the
+ -- front end (see Eval_Attribute) since the back end would otherwise get
+ -- confused by the equivalent packed array type.
when Attribute_Component_Size =>
null;
-- static cases have already been evaluated during semantic processing,
-- but in any case the back end should not count on this).
- -- Gigi also handles the non-class-wide cases of Size
+ -- The back end also handles the non-class-wide cases of Size
when Attribute_Bit_Order |
Attribute_Code_Address |
Attribute_Pool_Address =>
null;
- -- The following attributes are also handled by Gigi, but return a
- -- universal integer result, so may need a conversion for checking
+ -- The following attributes are also handled by the back end, but return
+ -- a universal integer result, so may need a conversion for checking
-- that the result is in range.
when Attribute_Aft |
- Attribute_Bit |
- Attribute_Max_Size_In_Storage_Elements
- =>
+ Attribute_Max_Alignment_For_Allocation =>
Apply_Universal_Integer_Attribute_Checks (N);
-- The following attributes should not appear at this stage, since they
Attribute_Address_Size |
Attribute_Base |
Attribute_Class |
+ Attribute_Compiler_Version |
Attribute_Default_Bit_Order |
Attribute_Delta |
Attribute_Denorm |
Attribute_Fast_Math |
Attribute_Has_Access_Values |
Attribute_Has_Discriminants |
+ Attribute_Has_Tagged_Values |
Attribute_Large |
Attribute_Machine_Emax |
Attribute_Machine_Emin |
Attribute_Small |
Attribute_Storage_Unit |
Attribute_Stub_Type |
+ Attribute_System_Allocator_Alignment |
Attribute_Target_Name |
Attribute_Type_Class |
+ Attribute_Type_Key |
Attribute_Unconstrained_Array |
Attribute_Universal_Literal_String |
Attribute_Wchar_T_Size |
Attribute_Word_Size =>
-
raise Program_Error;
-- The Asm_Input and Asm_Output attributes are not expanded at this
- -- stage, but will be eliminated in the expansion of the Asm call,
- -- see Exp_Intr for details. So Gigi will never see these either.
+ -- stage, but will be eliminated in the expansion of the Asm call, see
+ -- Exp_Intr for details. So the back end will never see these either.
when Attribute_Asm_Input |
Attribute_Asm_Output =>
-
null;
-
end case;
exception
-- These checks are not generated for modular types, since the proper
-- semantics for Succ and Pred on modular types is to wrap, not raise CE.
+ -- We also suppress these checks if we are the right side of an assignment
+ -- statement or the expression of an object declaration, where the flag
+ -- Suppress_Assignment_Checks is set for the assignment/declaration.
procedure Expand_Pred_Succ (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
+ P : constant Node_Id := Parent (N);
Cnam : Name_Id;
begin
Cnam := Name_Last;
end if;
- Insert_Action (N,
- Make_Raise_Constraint_Error (Loc,
- Condition =>
- Make_Op_Eq (Loc,
- Left_Opnd =>
- Duplicate_Subexpr_Move_Checks (First (Expressions (N))),
- Right_Opnd =>
- Make_Attribute_Reference (Loc,
- Prefix =>
- New_Reference_To (Base_Type (Etype (Prefix (N))), Loc),
- Attribute_Name => Cnam)),
- Reason => CE_Overflow_Check_Failed));
+ if not Nkind_In (P, N_Assignment_Statement, N_Object_Declaration)
+ or else not Suppress_Assignment_Checks (P)
+ then
+ Insert_Action (N,
+ Make_Raise_Constraint_Error (Loc,
+ Condition =>
+ Make_Op_Eq (Loc,
+ Left_Opnd =>
+ Duplicate_Subexpr_Move_Checks (First (Expressions (N))),
+ Right_Opnd =>
+ Make_Attribute_Reference (Loc,
+ Prefix =>
+ New_Reference_To (Base_Type (Etype (Prefix (N))), Loc),
+ Attribute_Name => Cnam)),
+ Reason => CE_Overflow_Check_Failed));
+ end if;
end Expand_Pred_Succ;
-------------------
raise Program_Error;
end case;
- -- If neither the base type nor the root type is VAX_Float then VAX
+ -- If neither the base type nor the root type is VAX_Native then VAX
-- float is out of the picture, and we can just use the root type.
else
(Typ : Entity_Id;
Nam : TSS_Name_Type) return Entity_Id
is
- Ent : constant Entity_Id := TSS (Typ, Nam);
+ Base_Typ : constant Entity_Id := Base_Type (Typ);
+ Ent : constant Entity_Id := TSS (Typ, Nam);
+
+ function Is_Available (Entity : RE_Id) return Boolean;
+ pragma Inline (Is_Available);
+ -- Function to check whether the specified run-time call is available
+ -- in the run time used. In the case of a configurable run time, it
+ -- is normal that some subprograms are not there.
+
+ -- I don't understand this routine at all, why is this not just a
+ -- call to RTE_Available? And if for some reason we need a different
+ -- routine with different semantics, why is not in Rtsfind ???
+
+ ------------------
+ -- Is_Available --
+ ------------------
+
+ function Is_Available (Entity : RE_Id) return Boolean is
+ begin
+ -- Assume that the unit will always be available when using a
+ -- "normal" (not configurable) run time.
+
+ return not Configurable_Run_Time_Mode
+ or else RTE_Available (Entity);
+ end Is_Available;
+
+ -- Start of processing for Find_Stream_Subprogram
+
begin
if Present (Ent) then
return Ent;
end if;
+ -- Stream attributes for strings are expanded into library calls. The
+ -- following checks are disabled when the run-time is not available or
+ -- when compiling predefined types due to bootstrap issues. As a result,
+ -- the compiler will generate in-place stream routines for string types
+ -- that appear in GNAT's library, but will generate calls via rtsfind
+ -- to library routines for user code.
+
+ -- ??? For now, disable this code for JVM, since this generates a
+ -- VerifyError exception at run time on e.g. c330001.
+
+ -- This is disabled for AAMP, to avoid creating dependences on files not
+ -- supported in the AAMP library (such as s-fileio.adb).
+
+ -- Note: In the case of using a configurable run time, it is very likely
+ -- that stream routines for string types are not present (they require
+ -- file system support). In this case, the specific stream routines for
+ -- strings are not used, relying on the regular stream mechanism
+ -- instead. That is why we include the test Is_Available when dealing
+ -- with these cases.
+
+ if VM_Target /= JVM_Target
+ and then not AAMP_On_Target
+ and then
+ not Is_Predefined_File_Name (Unit_File_Name (Current_Sem_Unit))
+ then
+ -- String as defined in package Ada
+
+ if Base_Typ = Standard_String then
+ if Restriction_Active (No_Stream_Optimizations) then
+ if Nam = TSS_Stream_Input
+ and then Is_Available (RE_String_Input)
+ then
+ return RTE (RE_String_Input);
+
+ elsif Nam = TSS_Stream_Output
+ and then Is_Available (RE_String_Output)
+ then
+ return RTE (RE_String_Output);
+
+ elsif Nam = TSS_Stream_Read
+ and then Is_Available (RE_String_Read)
+ then
+ return RTE (RE_String_Read);
+
+ elsif Nam = TSS_Stream_Write
+ and then Is_Available (RE_String_Write)
+ then
+ return RTE (RE_String_Write);
+
+ elsif Nam /= TSS_Stream_Input and then
+ Nam /= TSS_Stream_Output and then
+ Nam /= TSS_Stream_Read and then
+ Nam /= TSS_Stream_Write
+ then
+ raise Program_Error;
+ end if;
+
+ else
+ if Nam = TSS_Stream_Input
+ and then Is_Available (RE_String_Input_Blk_IO)
+ then
+ return RTE (RE_String_Input_Blk_IO);
+
+ elsif Nam = TSS_Stream_Output
+ and then Is_Available (RE_String_Output_Blk_IO)
+ then
+ return RTE (RE_String_Output_Blk_IO);
+
+ elsif Nam = TSS_Stream_Read
+ and then Is_Available (RE_String_Read_Blk_IO)
+ then
+ return RTE (RE_String_Read_Blk_IO);
+
+ elsif Nam = TSS_Stream_Write
+ and then Is_Available (RE_String_Write_Blk_IO)
+ then
+ return RTE (RE_String_Write_Blk_IO);
+
+ elsif Nam /= TSS_Stream_Input and then
+ Nam /= TSS_Stream_Output and then
+ Nam /= TSS_Stream_Read and then
+ Nam /= TSS_Stream_Write
+ then
+ raise Program_Error;
+ end if;
+ end if;
+
+ -- Wide_String as defined in package Ada
+
+ elsif Base_Typ = Standard_Wide_String then
+ if Restriction_Active (No_Stream_Optimizations) then
+ if Nam = TSS_Stream_Input
+ and then Is_Available (RE_Wide_String_Input)
+ then
+ return RTE (RE_Wide_String_Input);
+
+ elsif Nam = TSS_Stream_Output
+ and then Is_Available (RE_Wide_String_Output)
+ then
+ return RTE (RE_Wide_String_Output);
+
+ elsif Nam = TSS_Stream_Read
+ and then Is_Available (RE_Wide_String_Read)
+ then
+ return RTE (RE_Wide_String_Read);
+
+ elsif Nam = TSS_Stream_Write
+ and then Is_Available (RE_Wide_String_Write)
+ then
+ return RTE (RE_Wide_String_Write);
+
+ elsif Nam /= TSS_Stream_Input and then
+ Nam /= TSS_Stream_Output and then
+ Nam /= TSS_Stream_Read and then
+ Nam /= TSS_Stream_Write
+ then
+ raise Program_Error;
+ end if;
+
+ else
+ if Nam = TSS_Stream_Input
+ and then Is_Available (RE_Wide_String_Input_Blk_IO)
+ then
+ return RTE (RE_Wide_String_Input_Blk_IO);
+
+ elsif Nam = TSS_Stream_Output
+ and then Is_Available (RE_Wide_String_Output_Blk_IO)
+ then
+ return RTE (RE_Wide_String_Output_Blk_IO);
+
+ elsif Nam = TSS_Stream_Read
+ and then Is_Available (RE_Wide_String_Read_Blk_IO)
+ then
+ return RTE (RE_Wide_String_Read_Blk_IO);
+
+ elsif Nam = TSS_Stream_Write
+ and then Is_Available (RE_Wide_String_Write_Blk_IO)
+ then
+ return RTE (RE_Wide_String_Write_Blk_IO);
+
+ elsif Nam /= TSS_Stream_Input and then
+ Nam /= TSS_Stream_Output and then
+ Nam /= TSS_Stream_Read and then
+ Nam /= TSS_Stream_Write
+ then
+ raise Program_Error;
+ end if;
+ end if;
+
+ -- Wide_Wide_String as defined in package Ada
+
+ elsif Base_Typ = Standard_Wide_Wide_String then
+ if Restriction_Active (No_Stream_Optimizations) then
+ if Nam = TSS_Stream_Input
+ and then Is_Available (RE_Wide_Wide_String_Input)
+ then
+ return RTE (RE_Wide_Wide_String_Input);
+
+ elsif Nam = TSS_Stream_Output
+ and then Is_Available (RE_Wide_Wide_String_Output)
+ then
+ return RTE (RE_Wide_Wide_String_Output);
+
+ elsif Nam = TSS_Stream_Read
+ and then Is_Available (RE_Wide_Wide_String_Read)
+ then
+ return RTE (RE_Wide_Wide_String_Read);
+
+ elsif Nam = TSS_Stream_Write
+ and then Is_Available (RE_Wide_Wide_String_Write)
+ then
+ return RTE (RE_Wide_Wide_String_Write);
+
+ elsif Nam /= TSS_Stream_Input and then
+ Nam /= TSS_Stream_Output and then
+ Nam /= TSS_Stream_Read and then
+ Nam /= TSS_Stream_Write
+ then
+ raise Program_Error;
+ end if;
+
+ else
+ if Nam = TSS_Stream_Input
+ and then Is_Available (RE_Wide_Wide_String_Input_Blk_IO)
+ then
+ return RTE (RE_Wide_Wide_String_Input_Blk_IO);
+
+ elsif Nam = TSS_Stream_Output
+ and then Is_Available (RE_Wide_Wide_String_Output_Blk_IO)
+ then
+ return RTE (RE_Wide_Wide_String_Output_Blk_IO);
+
+ elsif Nam = TSS_Stream_Read
+ and then Is_Available (RE_Wide_Wide_String_Read_Blk_IO)
+ then
+ return RTE (RE_Wide_Wide_String_Read_Blk_IO);
+
+ elsif Nam = TSS_Stream_Write
+ and then Is_Available (RE_Wide_Wide_String_Write_Blk_IO)
+ then
+ return RTE (RE_Wide_Wide_String_Write_Blk_IO);
+
+ elsif Nam /= TSS_Stream_Input and then
+ Nam /= TSS_Stream_Output and then
+ Nam /= TSS_Stream_Read and then
+ Nam /= TSS_Stream_Write
+ then
+ raise Program_Error;
+ end if;
+ end if;
+ end if;
+ end if;
+
if Is_Tagged_Type (Typ)
and then Is_Derived_Type (Typ)
then
end if;
end Find_Stream_Subprogram;
+ ---------------
+ -- Full_Base --
+ ---------------
+
+ function Full_Base (T : Entity_Id) return Entity_Id is
+ BT : Entity_Id;
+
+ begin
+ BT := Base_Type (T);
+
+ if Is_Private_Type (BT)
+ and then Present (Full_View (BT))
+ then
+ BT := Full_View (BT);
+ end if;
+
+ return BT;
+ end Full_Base;
+
-----------------------
-- Get_Index_Subtype --
-----------------------
N := First_Rep_Item (Implementation_Base_Type (T));
while Present (N) loop
- if Nkind (N) = N_Pragma and then Chars (N) = Name_Stream_Convert then
-
+ if Nkind (N) = N_Pragma
+ and then Pragma_Name (N) = Name_Stream_Convert
+ then
-- For tagged types this pragma is not inherited, so we
-- must verify that it is defined for the given type and
-- not an ancestor.
OSDN Git Service
