-- --
-- B o d y --
-- --
--- $Revision$
--- --
--- Copyright (C) 1992-2002, Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2005, 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- --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
--- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
+-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
-with Restrict; use Restrict;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Cat; use Sem_Cat;
+with Sem_Ch3; use Sem_Ch3;
with Sem_Ch13; use Sem_Ch13;
with Sem_Eval; use Sem_Eval;
with Sem_Res; use Sem_Res;
with Sem_Util; use Sem_Util;
with Sem_Warn; use Sem_Warn;
with Sinfo; use Sinfo;
-with Sinfo.CN; use Sinfo.CN;
with Snames; use Snames;
with Stand; use Stand;
with Targparm; use Targparm;
package body Exp_Ch4 is
- ------------------------
- -- Local Subprograms --
- ------------------------
+ -----------------------
+ -- Local Subprograms --
+ -----------------------
procedure Binary_Op_Validity_Checks (N : Node_Id);
pragma Inline (Binary_Op_Validity_Checks);
-- Performs validity checks for a binary operator
+ procedure Build_Boolean_Array_Proc_Call
+ (N : Node_Id;
+ Op1 : Node_Id;
+ Op2 : Node_Id);
+ -- If an boolean array assignment can be done in place, build call to
+ -- corresponding library procedure.
+
+ procedure Expand_Allocator_Expression (N : Node_Id);
+ -- Subsidiary to Expand_N_Allocator, for the case when the expression
+ -- is a qualified expression or an aggregate.
+
procedure Expand_Array_Comparison (N : Node_Id);
-- This routine handles expansion of the comparison operators (N_Op_Lt,
-- N_Op_Le, N_Op_Gt, N_Op_Ge) when operating on an array type. The basic
-- code for these operators is similar, differing only in the details of
- -- the actual comparison call that is made.
+ -- the actual comparison call that is made. Special processing (call a
+ -- run-time routine)
function Expand_Array_Equality
(Nod : Node_Id;
- Typ : Entity_Id;
- A_Typ : Entity_Id;
Lhs : Node_Id;
Rhs : Node_Id;
- Bodies : List_Id)
- return Node_Id;
+ Bodies : List_Id;
+ Typ : Entity_Id) return Node_Id;
-- Expand an array equality into a call to a function implementing this
-- equality, and a call to it. Loc is the location for the generated
- -- nodes. Typ is the type of the array, and Lhs, Rhs are the array
- -- expressions to be compared. A_Typ is the type of the arguments,
- -- which may be a private type, in which case Typ is its full view.
+ -- nodes. Lhs and Rhs are the array expressions to be compared.
-- Bodies is a list on which to attach bodies of local functions that
- -- are created in the process. This is the responsability of the
+ -- are created in the process. It is the responsibility of the
-- caller to insert those bodies at the right place. Nod provides
- -- the Sloc value for the generated code.
+ -- the Sloc value for the generated code. Normally the types used
+ -- for the generated equality routine are taken from Lhs and Rhs.
+ -- However, in some situations of generated code, the Etype fields
+ -- of Lhs and Rhs are not set yet. In such cases, Typ supplies the
+ -- type to be used for the formal parameters.
procedure Expand_Boolean_Operator (N : Node_Id);
-- Common expansion processing for Boolean operators (And, Or, Xor)
Typ : Entity_Id;
Lhs : Node_Id;
Rhs : Node_Id;
- Bodies : List_Id)
- return Node_Id;
+ Bodies : List_Id) return Node_Id;
-- Local recursive function used to expand equality for nested
-- composite types. Used by Expand_Record/Array_Equality, Bodies
-- is a list on which to attach bodies of local functions that are
-- created in the process. This is the responsability of the caller
-- to insert those bodies at the right place. Nod provides the Sloc
- -- value for generated code.
+ -- value for generated code. Lhs and Rhs are the left and right sides
+ -- for the comparison, and Typ is the type of the arrays to compare.
procedure Expand_Concatenate_Other (Cnode : Node_Id; Opnds : List_Id);
-- This routine handles expansion of concatenation operations, where
-- purpose of this routine is to find the real type by looking up
-- the tree. We also determine if the operation must be rounded.
+ function Get_Allocator_Final_List
+ (N : Node_Id;
+ T : Entity_Id;
+ PtrT : Entity_Id) return Entity_Id;
+ -- If the designated type is controlled, build final_list expression
+ -- for created object. If context is an access parameter, create a
+ -- local access type to have a usable finalization list.
+
+ function Has_Inferable_Discriminants (N : Node_Id) return Boolean;
+ -- Ada 2005 (AI-216): A view of an Unchecked_Union object has inferable
+ -- discriminants if it has a constrained nominal type, unless the object
+ -- is a component of an enclosing Unchecked_Union object that is subject
+ -- to a per-object constraint and the enclosing object lacks inferable
+ -- discriminants.
+ --
+ -- An expression of an Unchecked_Union type has inferable discriminants
+ -- if it is either a name of an object with inferable discriminants or a
+ -- qualified expression whose subtype mark denotes a constrained subtype.
+
procedure Insert_Dereference_Action (N : Node_Id);
- -- N is an expression whose type is an access. When the type is derived
- -- from Checked_Pool, expands a call to the primitive 'dereference'.
+ -- N is an expression whose type is an access. When the type of the
+ -- associated storage pool is derived from Checked_Pool, generate a
+ -- call to the 'Dereference' primitive operation.
function Make_Array_Comparison_Op
- (Typ : Entity_Id;
- Nod : Node_Id)
- return Node_Id;
+ (Typ : Entity_Id;
+ Nod : Node_Id) return Node_Id;
-- Comparisons between arrays are expanded in line. This function
-- produces the body of the implementation of (a > b), where a and b
-- are one-dimensional arrays of some discrete type. The original
-- Nod provides the Sloc value for the generated code.
function Make_Boolean_Array_Op
- (Typ : Entity_Id;
- N : Node_Id)
- return Node_Id;
+ (Typ : Entity_Id;
+ N : Node_Id) return Node_Id;
-- Boolean operations on boolean arrays are expanded in line. This
-- function produce the body for the node N, which is (a and b),
-- (a or b), or (a xor b). It is used only the normal case and not
-- Construct the expression corresponding to the tagged membership test.
-- Deals with a second operand being (or not) a class-wide type.
+ function Safe_In_Place_Array_Op
+ (Lhs : Node_Id;
+ Op1 : Node_Id;
+ Op2 : Node_Id) return Boolean;
+ -- In the context of an assignment, where the right-hand side is a
+ -- boolean operation on arrays, check whether operation can be performed
+ -- in place.
+
procedure Unary_Op_Validity_Checks (N : Node_Id);
pragma Inline (Unary_Op_Validity_Checks);
-- Performs validity checks for a unary operator
end if;
end Binary_Op_Validity_Checks;
+ ------------------------------------
+ -- Build_Boolean_Array_Proc_Call --
+ ------------------------------------
+
+ procedure Build_Boolean_Array_Proc_Call
+ (N : Node_Id;
+ Op1 : Node_Id;
+ Op2 : Node_Id)
+ is
+ Loc : constant Source_Ptr := Sloc (N);
+ Kind : constant Node_Kind := Nkind (Expression (N));
+ Target : constant Node_Id :=
+ Make_Attribute_Reference (Loc,
+ Prefix => Name (N),
+ Attribute_Name => Name_Address);
+
+ Arg1 : constant Node_Id := Op1;
+ Arg2 : Node_Id := Op2;
+ Call_Node : Node_Id;
+ Proc_Name : Entity_Id;
+
+ begin
+ if Kind = N_Op_Not then
+ if Nkind (Op1) in N_Binary_Op then
+
+ -- Use negated version of the binary operators
+
+ if Nkind (Op1) = N_Op_And then
+ Proc_Name := RTE (RE_Vector_Nand);
+
+ elsif Nkind (Op1) = N_Op_Or then
+ Proc_Name := RTE (RE_Vector_Nor);
+
+ else pragma Assert (Nkind (Op1) = N_Op_Xor);
+ Proc_Name := RTE (RE_Vector_Xor);
+ end if;
+
+ Call_Node :=
+ Make_Procedure_Call_Statement (Loc,
+ Name => New_Occurrence_Of (Proc_Name, Loc),
+
+ Parameter_Associations => New_List (
+ Target,
+ Make_Attribute_Reference (Loc,
+ Prefix => Left_Opnd (Op1),
+ Attribute_Name => Name_Address),
+
+ Make_Attribute_Reference (Loc,
+ Prefix => Right_Opnd (Op1),
+ Attribute_Name => Name_Address),
+
+ Make_Attribute_Reference (Loc,
+ Prefix => Left_Opnd (Op1),
+ Attribute_Name => Name_Length)));
+
+ else
+ Proc_Name := RTE (RE_Vector_Not);
+
+ Call_Node :=
+ Make_Procedure_Call_Statement (Loc,
+ Name => New_Occurrence_Of (Proc_Name, Loc),
+ Parameter_Associations => New_List (
+ Target,
+
+ Make_Attribute_Reference (Loc,
+ Prefix => Op1,
+ Attribute_Name => Name_Address),
+
+ Make_Attribute_Reference (Loc,
+ Prefix => Op1,
+ Attribute_Name => Name_Length)));
+ end if;
+
+ else
+ -- We use the following equivalences:
+
+ -- (not X) or (not Y) = not (X and Y) = Nand (X, Y)
+ -- (not X) and (not Y) = not (X or Y) = Nor (X, Y)
+ -- (not X) xor (not Y) = X xor Y
+ -- X xor (not Y) = not (X xor Y) = Nxor (X, Y)
+
+ if Nkind (Op1) = N_Op_Not then
+ if Kind = N_Op_And then
+ Proc_Name := RTE (RE_Vector_Nor);
+
+ elsif Kind = N_Op_Or then
+ Proc_Name := RTE (RE_Vector_Nand);
+
+ else
+ Proc_Name := RTE (RE_Vector_Xor);
+ end if;
+
+ else
+ if Kind = N_Op_And then
+ Proc_Name := RTE (RE_Vector_And);
+
+ elsif Kind = N_Op_Or then
+ Proc_Name := RTE (RE_Vector_Or);
+
+ elsif Nkind (Op2) = N_Op_Not then
+ Proc_Name := RTE (RE_Vector_Nxor);
+ Arg2 := Right_Opnd (Op2);
+
+ else
+ Proc_Name := RTE (RE_Vector_Xor);
+ end if;
+ end if;
+
+ Call_Node :=
+ Make_Procedure_Call_Statement (Loc,
+ Name => New_Occurrence_Of (Proc_Name, Loc),
+ Parameter_Associations => New_List (
+ Target,
+ Make_Attribute_Reference (Loc,
+ Prefix => Arg1,
+ Attribute_Name => Name_Address),
+ Make_Attribute_Reference (Loc,
+ Prefix => Arg2,
+ Attribute_Name => Name_Address),
+ Make_Attribute_Reference (Loc,
+ Prefix => Op1,
+ Attribute_Name => Name_Length)));
+ end if;
+
+ Rewrite (N, Call_Node);
+ Analyze (N);
+
+ exception
+ when RE_Not_Available =>
+ return;
+ end Build_Boolean_Array_Proc_Call;
+
+ ---------------------------------
+ -- Expand_Allocator_Expression --
+ ---------------------------------
+
+ procedure Expand_Allocator_Expression (N : Node_Id) is
+ Loc : constant Source_Ptr := Sloc (N);
+ Exp : constant Node_Id := Expression (Expression (N));
+ Indic : constant Node_Id := Subtype_Mark (Expression (N));
+ PtrT : constant Entity_Id := Etype (N);
+ T : constant Entity_Id := Entity (Indic);
+ Flist : Node_Id;
+ Node : Node_Id;
+ Temp : Entity_Id;
+
+ Aggr_In_Place : constant Boolean := Is_Delayed_Aggregate (Exp);
+
+ Tag_Assign : Node_Id;
+ Tmp_Node : Node_Id;
+
+ begin
+ if Is_Tagged_Type (T) or else Controlled_Type (T) then
+
+ -- Actions inserted before:
+ -- Temp : constant ptr_T := new T'(Expression);
+ -- <no CW> Temp._tag := T'tag;
+ -- <CTRL> Adjust (Finalizable (Temp.all));
+ -- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
+
+ -- We analyze by hand the new internal allocator to avoid
+ -- any recursion and inappropriate call to Initialize
+
+ if not Aggr_In_Place then
+ Remove_Side_Effects (Exp);
+ end if;
+
+ Temp :=
+ Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
+
+ -- For a class wide allocation generate the following code:
+
+ -- type Equiv_Record is record ... end record;
+ -- implicit subtype CW is <Class_Wide_Subytpe>;
+ -- temp : PtrT := new CW'(CW!(expr));
+
+ if Is_Class_Wide_Type (T) then
+ Expand_Subtype_From_Expr (Empty, T, Indic, Exp);
+
+ Set_Expression (Expression (N),
+ Unchecked_Convert_To (Entity (Indic), Exp));
+
+ Analyze_And_Resolve (Expression (N), Entity (Indic));
+ end if;
+
+ if Aggr_In_Place then
+ Tmp_Node :=
+ Make_Object_Declaration (Loc,
+ Defining_Identifier => Temp,
+ Object_Definition => New_Reference_To (PtrT, Loc),
+ Expression =>
+ Make_Allocator (Loc,
+ New_Reference_To (Etype (Exp), Loc)));
+
+ Set_Comes_From_Source
+ (Expression (Tmp_Node), Comes_From_Source (N));
+
+ Set_No_Initialization (Expression (Tmp_Node));
+ Insert_Action (N, Tmp_Node);
+
+ if Controlled_Type (T)
+ and then Ekind (PtrT) = E_Anonymous_Access_Type
+ then
+ -- Create local finalization list for access parameter
+
+ Flist := Get_Allocator_Final_List (N, Base_Type (T), PtrT);
+ end if;
+
+ Convert_Aggr_In_Allocator (Tmp_Node, Exp);
+ else
+ Node := Relocate_Node (N);
+ Set_Analyzed (Node);
+ Insert_Action (N,
+ Make_Object_Declaration (Loc,
+ Defining_Identifier => Temp,
+ Constant_Present => True,
+ Object_Definition => New_Reference_To (PtrT, Loc),
+ Expression => Node));
+ end if;
+
+ -- Suppress the tag assignment when Java_VM because JVM tags
+ -- are represented implicitly in objects.
+
+ if Is_Tagged_Type (T)
+ and then not Is_Class_Wide_Type (T)
+ and then not Java_VM
+ then
+ Tag_Assign :=
+ Make_Assignment_Statement (Loc,
+ Name =>
+ Make_Selected_Component (Loc,
+ Prefix => New_Reference_To (Temp, Loc),
+ Selector_Name =>
+ New_Reference_To (First_Tag_Component (T), Loc)),
+
+ Expression =>
+ Unchecked_Convert_To (RTE (RE_Tag),
+ New_Reference_To
+ (Elists.Node (First_Elmt (Access_Disp_Table (T))),
+ Loc)));
+
+ -- The previous assignment has to be done in any case
+
+ Set_Assignment_OK (Name (Tag_Assign));
+ Insert_Action (N, Tag_Assign);
+
+ elsif Is_Private_Type (T)
+ and then Is_Tagged_Type (Underlying_Type (T))
+ and then not Java_VM
+ then
+ declare
+ Utyp : constant Entity_Id := Underlying_Type (T);
+ Ref : constant Node_Id :=
+ Unchecked_Convert_To (Utyp,
+ Make_Explicit_Dereference (Loc,
+ New_Reference_To (Temp, Loc)));
+
+ begin
+ Tag_Assign :=
+ Make_Assignment_Statement (Loc,
+ Name =>
+ Make_Selected_Component (Loc,
+ Prefix => Ref,
+ Selector_Name =>
+ New_Reference_To (First_Tag_Component (Utyp), Loc)),
+
+ Expression =>
+ Unchecked_Convert_To (RTE (RE_Tag),
+ New_Reference_To (
+ Elists.Node (First_Elmt (Access_Disp_Table (Utyp))),
+ Loc)));
+
+ Set_Assignment_OK (Name (Tag_Assign));
+ Insert_Action (N, Tag_Assign);
+ end;
+ end if;
+
+ if Controlled_Type (Designated_Type (PtrT))
+ and then Controlled_Type (T)
+ then
+ declare
+ Attach : Node_Id;
+ Apool : constant Entity_Id :=
+ Associated_Storage_Pool (PtrT);
+
+ begin
+ -- If it is an allocation on the secondary stack
+ -- (i.e. a value returned from a function), the object
+ -- is attached on the caller side as soon as the call
+ -- is completed (see Expand_Ctrl_Function_Call)
+
+ if Is_RTE (Apool, RE_SS_Pool) then
+ declare
+ F : constant Entity_Id :=
+ Make_Defining_Identifier (Loc,
+ New_Internal_Name ('F'));
+ begin
+ Insert_Action (N,
+ Make_Object_Declaration (Loc,
+ Defining_Identifier => F,
+ Object_Definition => New_Reference_To (RTE
+ (RE_Finalizable_Ptr), Loc)));
+
+ Flist := New_Reference_To (F, Loc);
+ Attach := Make_Integer_Literal (Loc, 1);
+ end;
+
+ -- Normal case, not a secondary stack allocation
+
+ else
+ if Controlled_Type (T)
+ and then Ekind (PtrT) = E_Anonymous_Access_Type
+ then
+ -- Create local finalization list for access parameter
+
+ Flist :=
+ Get_Allocator_Final_List (N, Base_Type (T), PtrT);
+ else
+ Flist := Find_Final_List (PtrT);
+ end if;
+
+ Attach := Make_Integer_Literal (Loc, 2);
+ end if;
+
+ if not Aggr_In_Place then
+ Insert_Actions (N,
+ Make_Adjust_Call (
+ Ref =>
+
+ -- An unchecked conversion is needed in the
+ -- classwide case because the designated type
+ -- can be an ancestor of the subtype mark of
+ -- the allocator.
+
+ Unchecked_Convert_To (T,
+ Make_Explicit_Dereference (Loc,
+ New_Reference_To (Temp, Loc))),
+
+ Typ => T,
+ Flist_Ref => Flist,
+ With_Attach => Attach));
+ end if;
+ end;
+ end if;
+
+ Rewrite (N, New_Reference_To (Temp, Loc));
+ Analyze_And_Resolve (N, PtrT);
+
+ elsif Aggr_In_Place then
+ Temp :=
+ Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
+ Tmp_Node :=
+ Make_Object_Declaration (Loc,
+ Defining_Identifier => Temp,
+ Object_Definition => New_Reference_To (PtrT, Loc),
+ Expression => Make_Allocator (Loc,
+ New_Reference_To (Etype (Exp), Loc)));
+
+ Set_Comes_From_Source
+ (Expression (Tmp_Node), Comes_From_Source (N));
+
+ Set_No_Initialization (Expression (Tmp_Node));
+ Insert_Action (N, Tmp_Node);
+ Convert_Aggr_In_Allocator (Tmp_Node, Exp);
+ Rewrite (N, New_Reference_To (Temp, Loc));
+ Analyze_And_Resolve (N, PtrT);
+
+ elsif Is_Access_Type (Designated_Type (PtrT))
+ and then Nkind (Exp) = N_Allocator
+ and then Nkind (Expression (Exp)) /= N_Qualified_Expression
+ then
+ -- Apply constraint to designated subtype indication
+
+ Apply_Constraint_Check (Expression (Exp),
+ Designated_Type (Designated_Type (PtrT)),
+ No_Sliding => True);
+
+ if Nkind (Expression (Exp)) = N_Raise_Constraint_Error then
+
+ -- Propagate constraint_error to enclosing allocator
+
+ Rewrite (Exp, New_Copy (Expression (Exp)));
+ end if;
+ else
+ -- First check against the type of the qualified expression
+ --
+ -- NOTE: The commented call should be correct, but for
+ -- some reason causes the compiler to bomb (sigsegv) on
+ -- ACVC test c34007g, so for now we just perform the old
+ -- (incorrect) test against the designated subtype with
+ -- no sliding in the else part of the if statement below.
+ -- ???
+ --
+ -- Apply_Constraint_Check (Exp, T, No_Sliding => True);
+
+ -- A check is also needed in cases where the designated
+ -- subtype is constrained and differs from the subtype
+ -- given in the qualified expression. Note that the check
+ -- on the qualified expression does not allow sliding,
+ -- but this check does (a relaxation from Ada 83).
+
+ if Is_Constrained (Designated_Type (PtrT))
+ and then not Subtypes_Statically_Match
+ (T, Designated_Type (PtrT))
+ then
+ Apply_Constraint_Check
+ (Exp, Designated_Type (PtrT), No_Sliding => False);
+
+ -- The nonsliding check should really be performed
+ -- (unconditionally) against the subtype of the
+ -- qualified expression, but that causes a problem
+ -- with c34007g (see above), so for now we retain this.
+
+ else
+ Apply_Constraint_Check
+ (Exp, Designated_Type (PtrT), No_Sliding => True);
+ end if;
+ end if;
+
+ exception
+ when RE_Not_Available =>
+ return;
+ end Expand_Allocator_Expression;
+
-----------------------------
-- Expand_Array_Comparison --
-----------------------------
- -- Expansion is only required in the case of array types. The form of
- -- the expansion is:
+ -- Expansion is only required in the case of array types. For the
+ -- unpacked case, an appropriate runtime routine is called. For
+ -- packed cases, and also in some other cases where a runtime
+ -- routine cannot be called, the form of the expansion is:
-- [body for greater_nn; boolean_expression]
Op1 : Node_Id := Left_Opnd (N);
Op2 : Node_Id := Right_Opnd (N);
Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
+ Ctyp : constant Entity_Id := Component_Type (Typ1);
Expr : Node_Id;
Func_Body : Node_Id;
Func_Name : Entity_Id;
+ Comp : RE_Id;
+
+ Byte_Addressable : constant Boolean := System_Storage_Unit = Byte'Size;
+ -- True for byte addressable target
+
+ function Length_Less_Than_4 (Opnd : Node_Id) return Boolean;
+ -- Returns True if the length of the given operand is known to be
+ -- less than 4. Returns False if this length is known to be four
+ -- or greater or is not known at compile time.
+
+ ------------------------
+ -- Length_Less_Than_4 --
+ ------------------------
+
+ function Length_Less_Than_4 (Opnd : Node_Id) return Boolean is
+ Otyp : constant Entity_Id := Etype (Opnd);
+
+ begin
+ if Ekind (Otyp) = E_String_Literal_Subtype then
+ return String_Literal_Length (Otyp) < 4;
+
+ else
+ declare
+ Ityp : constant Entity_Id := Etype (First_Index (Otyp));
+ Lo : constant Node_Id := Type_Low_Bound (Ityp);
+ Hi : constant Node_Id := Type_High_Bound (Ityp);
+ Lov : Uint;
+ Hiv : Uint;
+
+ begin
+ if Compile_Time_Known_Value (Lo) then
+ Lov := Expr_Value (Lo);
+ else
+ return False;
+ end if;
+
+ if Compile_Time_Known_Value (Hi) then
+ Hiv := Expr_Value (Hi);
+ else
+ return False;
+ end if;
+
+ return Hiv < Lov + 3;
+ end;
+ end if;
+ end Length_Less_Than_4;
+
+ -- Start of processing for Expand_Array_Comparison
+
begin
+ -- Deal first with unpacked case, where we can call a runtime routine
+ -- except that we avoid this for targets for which are not addressable
+ -- by bytes, and for the JVM, since the JVM does not support direct
+ -- addressing of array components.
+
+ if not Is_Bit_Packed_Array (Typ1)
+ and then Byte_Addressable
+ and then not Java_VM
+ then
+ -- The call we generate is:
+
+ -- Compare_Array_xn[_Unaligned]
+ -- (left'address, right'address, left'length, right'length) <op> 0
+
+ -- x = U for unsigned, S for signed
+ -- n = 8,16,32,64 for component size
+ -- Add _Unaligned if length < 4 and component size is 8.
+ -- <op> is the standard comparison operator
+
+ if Component_Size (Typ1) = 8 then
+ if Length_Less_Than_4 (Op1)
+ or else
+ Length_Less_Than_4 (Op2)
+ then
+ if Is_Unsigned_Type (Ctyp) then
+ Comp := RE_Compare_Array_U8_Unaligned;
+ else
+ Comp := RE_Compare_Array_S8_Unaligned;
+ end if;
+
+ else
+ if Is_Unsigned_Type (Ctyp) then
+ Comp := RE_Compare_Array_U8;
+ else
+ Comp := RE_Compare_Array_S8;
+ end if;
+ end if;
+
+ elsif Component_Size (Typ1) = 16 then
+ if Is_Unsigned_Type (Ctyp) then
+ Comp := RE_Compare_Array_U16;
+ else
+ Comp := RE_Compare_Array_S16;
+ end if;
+
+ elsif Component_Size (Typ1) = 32 then
+ if Is_Unsigned_Type (Ctyp) then
+ Comp := RE_Compare_Array_U32;
+ else
+ Comp := RE_Compare_Array_S32;
+ end if;
+
+ else pragma Assert (Component_Size (Typ1) = 64);
+ if Is_Unsigned_Type (Ctyp) then
+ Comp := RE_Compare_Array_U64;
+ else
+ Comp := RE_Compare_Array_S64;
+ end if;
+ end if;
+
+ Remove_Side_Effects (Op1, Name_Req => True);
+ Remove_Side_Effects (Op2, Name_Req => True);
+
+ Rewrite (Op1,
+ Make_Function_Call (Sloc (Op1),
+ Name => New_Occurrence_Of (RTE (Comp), Loc),
+
+ Parameter_Associations => New_List (
+ Make_Attribute_Reference (Loc,
+ Prefix => Relocate_Node (Op1),
+ Attribute_Name => Name_Address),
+
+ Make_Attribute_Reference (Loc,
+ Prefix => Relocate_Node (Op2),
+ Attribute_Name => Name_Address),
+
+ Make_Attribute_Reference (Loc,
+ Prefix => Relocate_Node (Op1),
+ Attribute_Name => Name_Length),
+
+ Make_Attribute_Reference (Loc,
+ Prefix => Relocate_Node (Op2),
+ Attribute_Name => Name_Length))));
+
+ Rewrite (Op2,
+ Make_Integer_Literal (Sloc (Op2),
+ Intval => Uint_0));
+
+ Analyze_And_Resolve (Op1, Standard_Integer);
+ Analyze_And_Resolve (Op2, Standard_Integer);
+ return;
+ end if;
+
+ -- Cases where we cannot make runtime call
+
-- For (a <= b) we convert to not (a > b)
if Chars (N) = Name_Op_Le then
Rewrite (N, Expr);
Analyze_And_Resolve (N, Standard_Boolean);
+ exception
+ when RE_Not_Available =>
+ return;
end Expand_Array_Comparison;
---------------------------
-- Expand an equality function for multi-dimensional arrays. Here is
-- an example of such a function for Nb_Dimension = 2
- -- function Enn (A : arr; B : arr) return boolean is
- -- J1 : integer;
- -- J2 : integer;
- --
+ -- function Enn (A : atyp; B : btyp) return boolean is
-- begin
- -- if A'length (1) /= B'length (1) then
- -- return false;
- -- else
- -- J1 := B'first (1);
- -- for I1 in A'first (1) .. A'last (1) loop
- -- if A'length (2) /= B'length (2) then
- -- return false;
- -- else
- -- J2 := B'first (2);
- -- for I2 in A'first (2) .. A'last (2) loop
- -- if A (I1, I2) /= B (J1, J2) then
- -- return false;
+ -- if (A'length (1) = 0 or else A'length (2) = 0)
+ -- and then
+ -- (B'length (1) = 0 or else B'length (2) = 0)
+ -- then
+ -- return True; -- RM 4.5.2(22)
+ -- end if;
+
+ -- if A'length (1) /= B'length (1)
+ -- or else
+ -- A'length (2) /= B'length (2)
+ -- then
+ -- return False; -- RM 4.5.2(23)
+ -- end if;
+
+ -- declare
+ -- A1 : Index_T1 := A'first (1);
+ -- B1 : Index_T1 := B'first (1);
+ -- begin
+ -- loop
+ -- declare
+ -- A2 : Index_T2 := A'first (2);
+ -- B2 : Index_T2 := B'first (2);
+ -- begin
+ -- loop
+ -- if A (A1, A2) /= B (B1, B2) then
+ -- return False;
-- end if;
- -- J2 := Integer'succ (J2);
+
+ -- exit when A2 = A'last (2);
+ -- A2 := Index_T2'succ (A2);
+ -- B2 := Index_T2'succ (B2);
-- end loop;
- -- end if;
- -- J1 := Integer'succ (J1);
+ -- end;
+
+ -- exit when A1 = A'last (1);
+ -- A1 := Index_T1'succ (A1);
+ -- B1 := Index_T1'succ (B1);
-- end loop;
- -- end if;
+ -- end;
+
-- return true;
-- end Enn;
+ -- Note on the formal types used (atyp and btyp). If either of the
+ -- arrays is of a private type, we use the underlying type, and
+ -- do an unchecked conversion of the actual. If either of the arrays
+ -- has a bound depending on a discriminant, then we use the base type
+ -- since otherwise we have an escaped discriminant in the function.
+
+ -- If both arrays are constrained and have the same bounds, we can
+ -- generate a loop with an explicit iteration scheme using a 'Range
+ -- attribute over the first array.
+
function Expand_Array_Equality
(Nod : Node_Id;
- Typ : Entity_Id;
- A_Typ : Entity_Id;
Lhs : Node_Id;
Rhs : Node_Id;
- Bodies : List_Id)
- return Node_Id
+ Bodies : List_Id;
+ Typ : Entity_Id) return Node_Id
is
Loc : constant Source_Ptr := Sloc (Nod);
- Actuals : List_Id;
- Decls : List_Id := New_List;
- Index_List1 : List_Id := New_List;
- Index_List2 : List_Id := New_List;
- Formals : List_Id;
- Stats : Node_Id;
- Func_Name : Entity_Id;
- Func_Body : Node_Id;
+ Decls : constant List_Id := New_List;
+ Index_List1 : constant List_Id := New_List;
+ Index_List2 : constant List_Id := New_List;
+
+ Actuals : List_Id;
+ Formals : List_Id;
+ Func_Name : Entity_Id;
+ Func_Body : Node_Id;
A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA);
B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB);
- function Component_Equality (Typ : Entity_Id) return Node_Id;
- -- Create one statement to compare corresponding components, designated
- -- by a full set of indices.
+ Ltyp : Entity_Id;
+ Rtyp : Entity_Id;
+ -- The parameter types to be used for the formals
+
+ function Arr_Attr
+ (Arr : Entity_Id;
+ Nam : Name_Id;
+ Num : Int) return Node_Id;
+ -- This builds the attribute reference Arr'Nam (Expr)
+
+ function Component_Equality (Typ : Entity_Id) return Node_Id;
+ -- Create one statement to compare corresponding components,
+ -- designated by a full set of indices.
+
+ function Get_Arg_Type (N : Node_Id) return Entity_Id;
+ -- Given one of the arguments, computes the appropriate type to
+ -- be used for that argument in the corresponding function formal
+
+ function Handle_One_Dimension
+ (N : Int;
+ Index : Node_Id) return Node_Id;
+ -- This procedure returns the following code
+ --
+ -- declare
+ -- Bn : Index_T := B'First (N);
+ -- begin
+ -- loop
+ -- xxx
+ -- exit when An = A'Last (N);
+ -- An := Index_T'Succ (An)
+ -- Bn := Index_T'Succ (Bn)
+ -- end loop;
+ -- end;
+ --
+ -- If both indices are constrained and identical, the procedure
+ -- returns a simpler loop:
+ --
+ -- for An in A'Range (N) loop
+ -- xxx
+ -- end loop
+ --
+ -- N is the dimension for which we are generating a loop. Index is the
+ -- N'th index node, whose Etype is Index_Type_n in the above code.
+ -- The xxx statement is either the loop or declare for the next
+ -- dimension or if this is the last dimension the comparison
+ -- of corresponding components of the arrays.
+ --
+ -- The actual way the code works is to return the comparison
+ -- of corresponding components for the N+1 call. That's neater!
+
+ function Test_Empty_Arrays return Node_Id;
+ -- This function constructs the test for both arrays being empty
+ -- (A'length (1) = 0 or else A'length (2) = 0 or else ...)
+ -- and then
+ -- (B'length (1) = 0 or else B'length (2) = 0 or else ...)
+
+ function Test_Lengths_Correspond return Node_Id;
+ -- This function constructs the test for arrays having different
+ -- lengths in at least one index position, in which case resull
+
+ -- A'length (1) /= B'length (1)
+ -- or else
+ -- A'length (2) /= B'length (2)
+ -- or else
+ -- ...
+
+ --------------
+ -- Arr_Attr --
+ --------------
+
+ function Arr_Attr
+ (Arr : Entity_Id;
+ Nam : Name_Id;
+ Num : Int) return Node_Id
+ is
+ begin
+ return
+ Make_Attribute_Reference (Loc,
+ Attribute_Name => Nam,
+ Prefix => New_Reference_To (Arr, Loc),
+ Expressions => New_List (Make_Integer_Literal (Loc, Num)));
+ end Arr_Attr;
+
+ ------------------------
+ -- Component_Equality --
+ ------------------------
+
+ function Component_Equality (Typ : Entity_Id) return Node_Id is
+ Test : Node_Id;
+ L, R : Node_Id;
+
+ begin
+ -- if a(i1...) /= b(j1...) then return false; end if;
+
+ L :=
+ Make_Indexed_Component (Loc,
+ Prefix => Make_Identifier (Loc, Chars (A)),
+ Expressions => Index_List1);
+
+ R :=
+ Make_Indexed_Component (Loc,
+ Prefix => Make_Identifier (Loc, Chars (B)),
+ Expressions => Index_List2);
+
+ Test := Expand_Composite_Equality
+ (Nod, Component_Type (Typ), L, R, Decls);
+
+ -- If some (sub)component is an unchecked_union, the whole operation
+ -- will raise program error.
+
+ if Nkind (Test) = N_Raise_Program_Error then
+
+ -- This node is going to be inserted at a location where a
+ -- statement is expected: clear its Etype so analysis will
+ -- set it to the expected Standard_Void_Type.
+
+ Set_Etype (Test, Empty);
+ return Test;
+
+ else
+ return
+ Make_Implicit_If_Statement (Nod,
+ Condition => Make_Op_Not (Loc, Right_Opnd => Test),
+ Then_Statements => New_List (
+ Make_Return_Statement (Loc,
+ Expression => New_Occurrence_Of (Standard_False, Loc))));
+ end if;
+ end Component_Equality;
+
+ ------------------
+ -- Get_Arg_Type --
+ ------------------
+
+ function Get_Arg_Type (N : Node_Id) return Entity_Id is
+ T : Entity_Id;
+ X : Node_Id;
+
+ begin
+ T := Etype (N);
+
+ if No (T) then
+ return Typ;
+
+ else
+ T := Underlying_Type (T);
+
+ X := First_Index (T);
+ while Present (X) loop
+ if Denotes_Discriminant (Type_Low_Bound (Etype (X)))
+ or else
+ Denotes_Discriminant (Type_High_Bound (Etype (X)))
+ then
+ T := Base_Type (T);
+ exit;
+ end if;
+
+ Next_Index (X);
+ end loop;
+
+ return T;
+ end if;
+ end Get_Arg_Type;
+
+ --------------------------
+ -- Handle_One_Dimension --
+ ---------------------------
- function Loop_One_Dimension
+ function Handle_One_Dimension
(N : Int;
- Index : Node_Id)
- return Node_Id;
- -- Loop over the n'th dimension of the arrays. The single statement
- -- in the body of the loop is a loop over the next dimension, or
- -- the comparison of corresponding components.
+ Index : Node_Id) return Node_Id
+ is
+ Need_Separate_Indexes : constant Boolean :=
+ Ltyp /= Rtyp
+ or else not Is_Constrained (Ltyp);
+ -- If the index types are identical, and we are working with
+ -- constrained types, then we can use the same index for both of
+ -- the arrays.
- ------------------------
- -- Component_Equality --
- ------------------------
+ An : constant Entity_Id := Make_Defining_Identifier (Loc,
+ Chars => New_Internal_Name ('A'));
- function Component_Equality (Typ : Entity_Id) return Node_Id is
- Test : Node_Id;
- L, R : Node_Id;
+ Bn : Entity_Id;
+ Index_T : Entity_Id;
+ Stm_List : List_Id;
+ Loop_Stm : Node_Id;
begin
- -- if a(i1...) /= b(j1...) then return false; end if;
+ if N > Number_Dimensions (Ltyp) then
+ return Component_Equality (Ltyp);
+ end if;
- L :=
- Make_Indexed_Component (Loc,
- Prefix => Make_Identifier (Loc, Chars (A)),
- Expressions => Index_List1);
+ -- Case where we generate a loop
- R :=
- Make_Indexed_Component (Loc,
- Prefix => Make_Identifier (Loc, Chars (B)),
- Expressions => Index_List2);
+ Index_T := Base_Type (Etype (Index));
- Test := Expand_Composite_Equality
- (Nod, Component_Type (Typ), L, R, Decls);
+ if Need_Separate_Indexes then
+ Bn :=
+ Make_Defining_Identifier (Loc,
+ Chars => New_Internal_Name ('B'));
+ else
+ Bn := An;
+ end if;
- return
- Make_Implicit_If_Statement (Nod,
- Condition => Make_Op_Not (Loc, Right_Opnd => Test),
- Then_Statements => New_List (
- Make_Return_Statement (Loc,
- Expression => New_Occurrence_Of (Standard_False, Loc))));
+ Append (New_Reference_To (An, Loc), Index_List1);
+ Append (New_Reference_To (Bn, Loc), Index_List2);
- end Component_Equality;
+ Stm_List := New_List (
+ Handle_One_Dimension (N + 1, Next_Index (Index)));
- ------------------------
- -- Loop_One_Dimension --
- ------------------------
+ if Need_Separate_Indexes then
- function Loop_One_Dimension
- (N : Int;
- Index : Node_Id)
- return Node_Id
- is
- I : constant Entity_Id := Make_Defining_Identifier (Loc,
- New_Internal_Name ('I'));
- J : constant Entity_Id := Make_Defining_Identifier (Loc,
- New_Internal_Name ('J'));
- Index_Type : Entity_Id;
- Stats : Node_Id;
+ -- Generate guard for loop, followed by increments of indices
- begin
- if N > Number_Dimensions (Typ) then
- return Component_Equality (Typ);
+ Append_To (Stm_List,
+ Make_Exit_Statement (Loc,
+ Condition =>
+ Make_Op_Eq (Loc,
+ Left_Opnd => New_Reference_To (An, Loc),
+ Right_Opnd => Arr_Attr (A, Name_Last, N))));
+
+ Append_To (Stm_List,
+ Make_Assignment_Statement (Loc,
+ Name => New_Reference_To (An, Loc),
+ Expression =>
+ Make_Attribute_Reference (Loc,
+ Prefix => New_Reference_To (Index_T, Loc),
+ Attribute_Name => Name_Succ,
+ Expressions => New_List (New_Reference_To (An, Loc)))));
+
+ Append_To (Stm_List,
+ Make_Assignment_Statement (Loc,
+ Name => New_Reference_To (Bn, Loc),
+ Expression =>
+ Make_Attribute_Reference (Loc,
+ Prefix => New_Reference_To (Index_T, Loc),
+ Attribute_Name => Name_Succ,
+ Expressions => New_List (New_Reference_To (Bn, Loc)))));
+ end if;
+
+ -- If separate indexes, we need a declare block for An and Bn, and a
+ -- loop without an iteration scheme.
+
+ if Need_Separate_Indexes then
+ Loop_Stm :=
+ Make_Implicit_Loop_Statement (Nod, Statements => Stm_List);
+
+ return
+ Make_Block_Statement (Loc,
+ Declarations => New_List (
+ Make_Object_Declaration (Loc,
+ Defining_Identifier => An,
+ Object_Definition => New_Reference_To (Index_T, Loc),
+ Expression => Arr_Attr (A, Name_First, N)),
+
+ Make_Object_Declaration (Loc,
+ Defining_Identifier => Bn,
+ Object_Definition => New_Reference_To (Index_T, Loc),
+ Expression => Arr_Attr (B, Name_First, N))),
+
+ Handled_Statement_Sequence =>
+ Make_Handled_Sequence_Of_Statements (Loc,
+ Statements => New_List (Loop_Stm)));
+
+ -- If no separate indexes, return loop statement with explicit
+ -- iteration scheme on its own
else
- -- Generate the following:
+ Loop_Stm :=
+ Make_Implicit_Loop_Statement (Nod,
+ Statements => Stm_List,
+ Iteration_Scheme =>
+ Make_Iteration_Scheme (Loc,
+ Loop_Parameter_Specification =>
+ Make_Loop_Parameter_Specification (Loc,
+ Defining_Identifier => An,
+ Discrete_Subtype_Definition =>
+ Arr_Attr (A, Name_Range, N))));
+ return Loop_Stm;
+ end if;
+ end Handle_One_Dimension;
- -- j: index_type;
- -- ...
+ -----------------------
+ -- Test_Empty_Arrays --
+ -----------------------
- -- if a'length (n) /= b'length (n) then
- -- return false;
- -- else
- -- j := b'first (n);
- -- for i in a'range (n) loop
- -- -- loop over remaining dimensions.
- -- j := index_type'succ (j);
- -- end loop;
- -- end if;
+ function Test_Empty_Arrays return Node_Id is
+ Alist : Node_Id;
+ Blist : Node_Id;
- -- retrieve index type for current dimension.
+ Atest : Node_Id;
+ Btest : Node_Id;
- Index_Type := Base_Type (Etype (Index));
- Append (New_Reference_To (I, Loc), Index_List1);
- Append (New_Reference_To (J, Loc), Index_List2);
+ begin
+ Alist := Empty;
+ Blist := Empty;
+ for J in 1 .. Number_Dimensions (Ltyp) loop
+ Atest :=
+ Make_Op_Eq (Loc,
+ Left_Opnd => Arr_Attr (A, Name_Length, J),
+ Right_Opnd => Make_Integer_Literal (Loc, 0));
+
+ Btest :=
+ Make_Op_Eq (Loc,
+ Left_Opnd => Arr_Attr (B, Name_Length, J),
+ Right_Opnd => Make_Integer_Literal (Loc, 0));
+
+ if No (Alist) then
+ Alist := Atest;
+ Blist := Btest;
- -- Declare index for j as a local variable to the function.
- -- Index i is a loop variable.
+ else
+ Alist :=
+ Make_Or_Else (Loc,
+ Left_Opnd => Relocate_Node (Alist),
+ Right_Opnd => Atest);
+
+ Blist :=
+ Make_Or_Else (Loc,
+ Left_Opnd => Relocate_Node (Blist),
+ Right_Opnd => Btest);
+ end if;
+ end loop;
- Append_To (Decls,
- Make_Object_Declaration (Loc,
- Defining_Identifier => J,
- Object_Definition => New_Reference_To (Index_Type, Loc)));
+ return
+ Make_And_Then (Loc,
+ Left_Opnd => Alist,
+ Right_Opnd => Blist);
+ end Test_Empty_Arrays;
- Stats :=
- Make_Implicit_If_Statement (Nod,
- Condition =>
- Make_Op_Ne (Loc,
- Left_Opnd =>
- Make_Attribute_Reference (Loc,
- Prefix => New_Reference_To (A, Loc),
- Attribute_Name => Name_Length,
- Expressions => New_List (
- Make_Integer_Literal (Loc, N))),
- Right_Opnd =>
- Make_Attribute_Reference (Loc,
- Prefix => New_Reference_To (B, Loc),
- Attribute_Name => Name_Length,
- Expressions => New_List (
- Make_Integer_Literal (Loc, N)))),
+ -----------------------------
+ -- Test_Lengths_Correspond --
+ -----------------------------
- Then_Statements => New_List (
- Make_Return_Statement (Loc,
- Expression => New_Occurrence_Of (Standard_False, Loc))),
+ function Test_Lengths_Correspond return Node_Id is
+ Result : Node_Id;
+ Rtest : Node_Id;
- Else_Statements => New_List (
+ begin
+ Result := Empty;
+ for J in 1 .. Number_Dimensions (Ltyp) loop
+ Rtest :=
+ Make_Op_Ne (Loc,
+ Left_Opnd => Arr_Attr (A, Name_Length, J),
+ Right_Opnd => Arr_Attr (B, Name_Length, J));
+
+ if No (Result) then
+ Result := Rtest;
+ else
+ Result :=
+ Make_Or_Else (Loc,
+ Left_Opnd => Relocate_Node (Result),
+ Right_Opnd => Rtest);
+ end if;
+ end loop;
- Make_Assignment_Statement (Loc,
- Name => New_Reference_To (J, Loc),
- Expression =>
- Make_Attribute_Reference (Loc,
- Prefix => New_Reference_To (B, Loc),
- Attribute_Name => Name_First,
- Expressions => New_List (
- Make_Integer_Literal (Loc, N)))),
-
- Make_Implicit_Loop_Statement (Nod,
- Identifier => Empty,
- Iteration_Scheme =>
- Make_Iteration_Scheme (Loc,
- Loop_Parameter_Specification =>
- Make_Loop_Parameter_Specification (Loc,
- Defining_Identifier => I,
- Discrete_Subtype_Definition =>
- Make_Attribute_Reference (Loc,
- Prefix => New_Reference_To (A, Loc),
- Attribute_Name => Name_Range,
- Expressions => New_List (
- Make_Integer_Literal (Loc, N))))),
-
- Statements => New_List (
- Loop_One_Dimension (N + 1, Next_Index (Index)),
- Make_Assignment_Statement (Loc,
- Name => New_Reference_To (J, Loc),
- Expression =>
- Make_Attribute_Reference (Loc,
- Prefix => New_Reference_To (Index_Type, Loc),
- Attribute_Name => Name_Succ,
- Expressions => New_List (
- New_Reference_To (J, Loc))))))));
-
- return Stats;
- end if;
- end Loop_One_Dimension;
+ return Result;
+ end Test_Lengths_Correspond;
-- Start of processing for Expand_Array_Equality
begin
+ Ltyp := Get_Arg_Type (Lhs);
+ Rtyp := Get_Arg_Type (Rhs);
+
+ -- For now, if the argument types are not the same, go to the
+ -- base type, since the code assumes that the formals have the
+ -- same type. This is fixable in future ???
+
+ if Ltyp /= Rtyp then
+ Ltyp := Base_Type (Ltyp);
+ Rtyp := Base_Type (Rtyp);
+ pragma Assert (Ltyp = Rtyp);
+ end if;
+
+ -- Build list of formals for function
+
Formals := New_List (
Make_Parameter_Specification (Loc,
Defining_Identifier => A,
- Parameter_Type => New_Reference_To (Typ, Loc)),
+ Parameter_Type => New_Reference_To (Ltyp, Loc)),
Make_Parameter_Specification (Loc,
Defining_Identifier => B,
- Parameter_Type => New_Reference_To (Typ, Loc)));
+ Parameter_Type => New_Reference_To (Rtyp, Loc)));
Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('E'));
- Stats := Loop_One_Dimension (1, First_Index (Typ));
+ -- Build statement sequence for function
Func_Body :=
Make_Subprogram_Body (Loc,
Defining_Unit_Name => Func_Name,
Parameter_Specifications => Formals,
Subtype_Mark => New_Reference_To (Standard_Boolean, Loc)),
- Declarations => Decls,
+
+ Declarations => Decls,
+
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => New_List (
- Stats,
+
+ Make_Implicit_If_Statement (Nod,
+ Condition => Test_Empty_Arrays,
+ Then_Statements => New_List (
+ Make_Return_Statement (Loc,
+ Expression =>
+ New_Occurrence_Of (Standard_True, Loc)))),
+
+ Make_Implicit_If_Statement (Nod,
+ Condition => Test_Lengths_Correspond,
+ Then_Statements => New_List (
+ Make_Return_Statement (Loc,
+ Expression =>
+ New_Occurrence_Of (Standard_False, Loc)))),
+
+ Handle_One_Dimension (1, First_Index (Ltyp)),
+
Make_Return_Statement (Loc,
Expression => New_Occurrence_Of (Standard_True, Loc)))));
Set_Has_Completion (Func_Name, True);
+ Set_Is_Inlined (Func_Name);
-- If the array type is distinct from the type of the arguments,
-- it is the full view of a private type. Apply an unchecked
-- conversion to insure that analysis of the call succeeds.
- if Base_Type (A_Typ) /= Base_Type (Typ) then
- Actuals := New_List (
- OK_Convert_To (Typ, Lhs),
- OK_Convert_To (Typ, Rhs));
- else
- Actuals := New_List (Lhs, Rhs);
- end if;
+ declare
+ L, R : Node_Id;
+
+ begin
+ L := Lhs;
+ R := Rhs;
+
+ if No (Etype (Lhs))
+ or else Base_Type (Etype (Lhs)) /= Base_Type (Ltyp)
+ then
+ L := OK_Convert_To (Ltyp, Lhs);
+ end if;
+
+ if No (Etype (Rhs))
+ or else Base_Type (Etype (Rhs)) /= Base_Type (Rtyp)
+ then
+ R := OK_Convert_To (Rtyp, Rhs);
+ end if;
+
+ Actuals := New_List (L, R);
+ end;
Append_To (Bodies, Func_Body);
return
Make_Function_Call (Loc,
- Name => New_Reference_To (Func_Name, Loc),
+ Name => New_Reference_To (Func_Name, Loc),
Parameter_Associations => Actuals);
end Expand_Array_Equality;
-- since we always want to deal with types that have bounds.
procedure Expand_Boolean_Operator (N : Node_Id) is
- Typ : constant Entity_Id := Etype (N);
+ Typ : constant Entity_Id := Etype (N);
begin
- if Is_Bit_Packed_Array (Typ) then
+ -- Special case of bit packed array where both operands are known
+ -- to be properly aligned. In this case we use an efficient run time
+ -- routine to carry out the operation (see System.Bit_Ops).
+
+ if Is_Bit_Packed_Array (Typ)
+ and then not Is_Possibly_Unaligned_Object (Left_Opnd (N))
+ and then not Is_Possibly_Unaligned_Object (Right_Opnd (N))
+ then
Expand_Packed_Boolean_Operator (N);
+ return;
+ end if;
- else
+ -- For the normal non-packed case, the general expansion is to build
+ -- function for carrying out the comparison (use Make_Boolean_Array_Op)
+ -- and then inserting it into the tree. The original operator node is
+ -- then rewritten as a call to this function. We also use this in the
+ -- packed case if either operand is a possibly unaligned object.
- -- For the normal non-packed case, the expansion is
- -- to build a function for carrying out the comparison
- -- (using Make_Boolean_Array_Op) and then inserting it
- -- into the tree. The original operator node is then
- -- rewritten as a call to this function.
+ declare
+ Loc : constant Source_Ptr := Sloc (N);
+ L : constant Node_Id := Relocate_Node (Left_Opnd (N));
+ R : constant Node_Id := Relocate_Node (Right_Opnd (N));
+ Func_Body : Node_Id;
+ Func_Name : Entity_Id;
- declare
- Loc : constant Source_Ptr := Sloc (N);
- L : constant Node_Id := Relocate_Node (Left_Opnd (N));
- R : constant Node_Id := Relocate_Node (Right_Opnd (N));
- Func_Body : Node_Id;
- Func_Name : Entity_Id;
- begin
- Convert_To_Actual_Subtype (L);
- Convert_To_Actual_Subtype (R);
- Ensure_Defined (Etype (L), N);
- Ensure_Defined (Etype (R), N);
- Apply_Length_Check (R, Etype (L));
+ begin
+ Convert_To_Actual_Subtype (L);
+ Convert_To_Actual_Subtype (R);
+ Ensure_Defined (Etype (L), N);
+ Ensure_Defined (Etype (R), N);
+ Apply_Length_Check (R, Etype (L));
+
+ if Nkind (Parent (N)) = N_Assignment_Statement
+ and then Safe_In_Place_Array_Op (Name (Parent (N)), L, R)
+ then
+ Build_Boolean_Array_Proc_Call (Parent (N), L, R);
+
+ elsif Nkind (Parent (N)) = N_Op_Not
+ and then Nkind (N) = N_Op_And
+ and then
+ Safe_In_Place_Array_Op (Name (Parent (Parent (N))), L, R)
+ then
+ return;
+ else
Func_Body := Make_Boolean_Array_Op (Etype (L), N);
Func_Name := Defining_Unit_Name (Specification (Func_Body));
Rewrite (N,
Make_Function_Call (Loc,
- Name => New_Reference_To (Func_Name, Loc),
+ Name => New_Reference_To (Func_Name, Loc),
Parameter_Associations =>
- New_List
- (L, Make_Type_Conversion
- (Loc, New_Reference_To (Etype (L), Loc), R))));
+ New_List (
+ L,
+ Make_Type_Conversion
+ (Loc, New_Reference_To (Etype (L), Loc), R))));
Analyze_And_Resolve (N, Typ);
- end;
- end if;
+ end if;
+ end;
end Expand_Boolean_Operator;
-------------------------------
Typ : Entity_Id;
Lhs : Node_Id;
Rhs : Node_Id;
- Bodies : List_Id)
- return Node_Id
+ Bodies : List_Id) return Node_Id
is
Loc : constant Source_Ptr := Sloc (Nod);
Full_Type : Entity_Id;
-- case of any composite type recursively containing such fields.
else
- return Expand_Array_Equality
- (Nod, Full_Type, Typ, Lhs, Rhs, Bodies);
+ return Expand_Array_Equality (Nod, Lhs, Rhs, Bodies, Full_Type);
end if;
elsif Is_Tagged_Type (Full_Type) then
Eq_Op := Node (Prim);
exit when Chars (Eq_Op) = Name_Op_Eq
and then Etype (First_Formal (Eq_Op)) =
- Etype (Next_Formal (First_Formal (Eq_Op)));
+ Etype (Next_Formal (First_Formal (Eq_Op)))
+ and then Base_Type (Etype (Eq_Op)) = Standard_Boolean;
Next_Elmt (Prim);
pragma Assert (Present (Prim));
end loop;
Unchecked_Convert_To (Etype (First_Formal (Eq_Op)), Rhs)));
elsif Is_Record_Type (Full_Type) then
- Eq_Op := TSS (Full_Type, Name_uEquality);
+ Eq_Op := TSS (Full_Type, TSS_Composite_Equality);
if Present (Eq_Op) then
if Etype (First_Formal (Eq_Op)) /= Full_Type then
-- to match signature of operation.
declare
- T : Entity_Id := Etype (First_Formal (Eq_Op));
+ T : constant Entity_Id := Etype (First_Formal (Eq_Op));
begin
return
end;
else
+ -- Comparison between Unchecked_Union components
+
+ if Is_Unchecked_Union (Full_Type) then
+ declare
+ Lhs_Type : Node_Id := Full_Type;
+ Rhs_Type : Node_Id := Full_Type;
+ Lhs_Discr_Val : Node_Id;
+ Rhs_Discr_Val : Node_Id;
+
+ begin
+ -- Lhs subtype
+
+ if Nkind (Lhs) = N_Selected_Component then
+ Lhs_Type := Etype (Entity (Selector_Name (Lhs)));
+ end if;
+
+ -- Rhs subtype
+
+ if Nkind (Rhs) = N_Selected_Component then
+ Rhs_Type := Etype (Entity (Selector_Name (Rhs)));
+ end if;
+
+ -- Lhs of the composite equality
+
+ if Is_Constrained (Lhs_Type) then
+
+ -- Since the enclosing record can never be an
+ -- Unchecked_Union (this code is executed for records
+ -- that do not have variants), we may reference its
+ -- discriminant(s).
+
+ if Nkind (Lhs) = N_Selected_Component
+ and then Has_Per_Object_Constraint (
+ Entity (Selector_Name (Lhs)))
+ then
+ Lhs_Discr_Val :=
+ Make_Selected_Component (Loc,
+ Prefix => Prefix (Lhs),
+ Selector_Name =>
+ New_Copy (
+ Get_Discriminant_Value (
+ First_Discriminant (Lhs_Type),
+ Lhs_Type,
+ Stored_Constraint (Lhs_Type))));
+
+ else
+ Lhs_Discr_Val := New_Copy (
+ Get_Discriminant_Value (
+ First_Discriminant (Lhs_Type),
+ Lhs_Type,
+ Stored_Constraint (Lhs_Type)));
+
+ end if;
+ else
+ -- It is not possible to infer the discriminant since
+ -- the subtype is not constrained.
+
+ return
+ Make_Raise_Program_Error (Loc,
+ Reason => PE_Unchecked_Union_Restriction);
+ end if;
+
+ -- Rhs of the composite equality
+
+ if Is_Constrained (Rhs_Type) then
+ if Nkind (Rhs) = N_Selected_Component
+ and then Has_Per_Object_Constraint (
+ Entity (Selector_Name (Rhs)))
+ then
+ Rhs_Discr_Val :=
+ Make_Selected_Component (Loc,
+ Prefix => Prefix (Rhs),
+ Selector_Name =>
+ New_Copy (
+ Get_Discriminant_Value (
+ First_Discriminant (Rhs_Type),
+ Rhs_Type,
+ Stored_Constraint (Rhs_Type))));
+
+ else
+ Rhs_Discr_Val := New_Copy (
+ Get_Discriminant_Value (
+ First_Discriminant (Rhs_Type),
+ Rhs_Type,
+ Stored_Constraint (Rhs_Type)));
+
+ end if;
+ else
+ return
+ Make_Raise_Program_Error (Loc,
+ Reason => PE_Unchecked_Union_Restriction);
+ end if;
+
+ -- Call the TSS equality function with the inferred
+ -- discriminant values.
+
+ return
+ Make_Function_Call (Loc,
+ Name => New_Reference_To (Eq_Op, Loc),
+ Parameter_Associations => New_List (
+ Lhs,
+ Rhs,
+ Lhs_Discr_Val,
+ Rhs_Discr_Val));
+ end;
+ end if;
+
+ -- Shouldn't this be an else, we can't fall through
+ -- the above IF, right???
+
return
Make_Function_Call (Loc,
Name => New_Reference_To (Eq_Op, Loc),
-- their base type, Ind_Typ their index type, and Arr_Typ the original
-- array type to which the concatenantion operator applies, then the
-- following subprogram is constructed:
- --
+
-- [function Cnn (S1 : Base_Typ; ...; Sn : Base_Typ) return Base_Typ is
-- L : Ind_Typ;
-- begin
-- else
-- return Sn;
-- end if;
- --
+
-- declare
-- P : Ind_Typ;
-- H : Ind_Typ :=
-- P := Ind_Typ'Succ (P);
-- end loop;
-- end if;
- --
- -- ...
- --
+
+ -- . . .
+
-- if Sn'Length /= 0 then
-- P := Sn'First;
-- loop
-- P := Ind_Typ'Succ (P);
-- end loop;
-- end if;
- --
+
-- return R;
-- end;
-- end Cnn;]
Params : List_Id;
Operand : Node_Id;
- function Copy_Into_R_S (I : Nat) return List_Id;
+ function Copy_Into_R_S (I : Nat; Last : Boolean) return List_Id;
-- Builds the sequence of statement:
-- P := Si'First;
-- loop
-- end loop;
--
-- where i is the input parameter I given.
+ -- If the flag Last is true, the exit statement is emitted before
+ -- incrementing the lower bound, to prevent the creation out of
+ -- bound values.
function Init_L (I : Nat) return Node_Id;
-- Builds the statement:
-- L := Si'First; otherwise (where I is the input param given)
function H return Node_Id;
- -- Builds reference to identifier H.
+ -- Builds reference to identifier H
function Ind_Val (E : Node_Id) return Node_Id;
-- Builds expression Ind_Typ'Val (E);
function L return Node_Id;
- -- Builds reference to identifier L.
+ -- Builds reference to identifier L
function L_Pos return Node_Id;
- -- Builds expression Ind_Typ'Pos (L).
+ -- Builds expression Integer_Type'(Ind_Typ'Pos (L)). We qualify the
+ -- expression to avoid universal_integer computations whenever possible,
+ -- in the expression for the upper bound H.
function L_Succ return Node_Id;
- -- Builds expression Ind_Typ'Succ (L).
+ -- Builds expression Ind_Typ'Succ (L)
function One return Node_Id;
- -- Builds integer literal one.
+ -- Builds integer literal one
function P return Node_Id;
- -- Builds reference to identifier P.
+ -- Builds reference to identifier P
function P_Succ return Node_Id;
- -- Builds expression Ind_Typ'Succ (P).
+ -- Builds expression Ind_Typ'Succ (P)
function R return Node_Id;
- -- Builds reference to identifier R.
+ -- Builds reference to identifier R
function S (I : Nat) return Node_Id;
- -- Builds reference to identifier Si, where I is the value given.
+ -- Builds reference to identifier Si, where I is the value given
function S_First (I : Nat) return Node_Id;
- -- Builds expression Si'First, where I is the value given.
+ -- Builds expression Si'First, where I is the value given
function S_Last (I : Nat) return Node_Id;
- -- Builds expression Si'Last, where I is the value given.
+ -- Builds expression Si'Last, where I is the value given
function S_Length (I : Nat) return Node_Id;
- -- Builds expression Si'Length, where I is the value given.
+ -- Builds expression Si'Length, where I is the value given
function S_Length_Test (I : Nat) return Node_Id;
- -- Builds expression Si'Length /= 0, where I is the value given.
+ -- Builds expression Si'Length /= 0, where I is the value given
-------------------
-- Copy_Into_R_S --
-------------------
- function Copy_Into_R_S (I : Nat) return List_Id is
- Stmts : List_Id := New_List;
+ function Copy_Into_R_S (I : Nat; Last : Boolean) return List_Id is
+ Stmts : constant List_Id := New_List;
P_Start : Node_Id;
Loop_Stmt : Node_Id;
R_Copy : Node_Id;
Name => P,
Expression => P_Succ);
- Loop_Stmt :=
- Make_Implicit_Loop_Statement (Cnode,
- Statements => New_List (R_Copy, L_Inc, Exit_Stmt, P_Inc));
+ if Last then
+ Loop_Stmt :=
+ Make_Implicit_Loop_Statement (Cnode,
+ Statements => New_List (R_Copy, Exit_Stmt, L_Inc, P_Inc));
+ else
+ Loop_Stmt :=
+ Make_Implicit_Loop_Statement (Cnode,
+ Statements => New_List (R_Copy, L_Inc, Exit_Stmt, P_Inc));
+ end if;
Append_To (Stmts, Loop_Stmt);
-----------
function L_Pos return Node_Id is
+ Target_Type : Entity_Id;
+
begin
+ -- If the index type is an enumeration type, the computation
+ -- can be done in standard integer. Otherwise, choose a large
+ -- enough integer type.
+
+ if Is_Enumeration_Type (Ind_Typ)
+ or else Root_Type (Ind_Typ) = Standard_Integer
+ or else Root_Type (Ind_Typ) = Standard_Short_Integer
+ or else Root_Type (Ind_Typ) = Standard_Short_Short_Integer
+ then
+ Target_Type := Standard_Integer;
+ else
+ Target_Type := Root_Type (Ind_Typ);
+ end if;
+
return
- Make_Attribute_Reference (Loc,
- Prefix => New_Reference_To (Ind_Typ, Loc),
- Attribute_Name => Name_Pos,
- Expressions => New_List (L));
+ Make_Qualified_Expression (Loc,
+ Subtype_Mark => New_Reference_To (Target_Type, Loc),
+ Expression =>
+ Make_Attribute_Reference (Loc,
+ Prefix => New_Reference_To (Ind_Typ, Loc),
+ Attribute_Name => Name_Pos,
+ Expressions => New_List (L)));
end L_Pos;
------------
Append_To (Declare_Stmts,
Make_Implicit_If_Statement (Cnode,
Condition => S_Length_Test (I),
- Then_Statements => Copy_Into_R_S (I)));
+ Then_Statements => Copy_Into_R_S (I, I = Nb_Opnds)));
end loop;
Append_To (Declare_Stmts, Make_Return_Statement (Loc, Expression => R));
Parameter_Associations => Opnds));
Analyze_And_Resolve (Cnode, Standard_String);
+
+ exception
+ when RE_Not_Available =>
+ return;
end Expand_Concatenate_String;
------------------------
procedure Expand_N_Allocator (N : Node_Id) is
PtrT : constant Entity_Id := Etype (N);
+ Dtyp : constant Entity_Id := Designated_Type (PtrT);
Desig : Entity_Id;
Loc : constant Source_Ptr := Sloc (N);
Temp : Entity_Id;
if not Java_VM then
Set_Procedure_To_Call (N, RTE (RE_SS_Allocate));
end if;
+
+ elsif Is_Class_Wide_Type (Etype (Storage_Pool (N))) then
+ Set_Procedure_To_Call (N, RTE (RE_Allocate_Any));
+
else
Set_Procedure_To_Call (N,
Find_Prim_Op (Etype (Storage_Pool (N)), Name_Allocate));
-- Size and initial value is known at compile time
-- Access type is access-to-constant
+ -- The allocator is not part of a constraint on a record component,
+ -- because in that case the inserted actions are delayed until the
+ -- record declaration is fully analyzed, which is too late for the
+ -- analysis of the rewritten allocator.
+
if Is_Access_Constant (PtrT)
and then Nkind (Expression (N)) = N_Qualified_Expression
and then Compile_Time_Known_Value (Expression (Expression (N)))
and then Size_Known_At_Compile_Time (Etype (Expression
(Expression (N))))
+ and then not Is_Record_Type (Current_Scope)
then
-- Here we can do the optimization. For the allocator
-- so that the constant is not labelled as having a nomimally
-- unconstrained subtype.
- if Entity (Desig) = Base_Type (Designated_Type (PtrT)) then
- Desig := New_Occurrence_Of (Designated_Type (PtrT), Loc);
+ if Entity (Desig) = Base_Type (Dtyp) then
+ Desig := New_Occurrence_Of (Dtyp, Loc);
end if;
Insert_Action (N,
-- want it going on the stack of the current procedure!
Set_Is_Statically_Allocated (Temp);
- return;
- end if;
-
- -- If the allocator is for a type which requires initialization, and
- -- there is no initial value (i.e. the operand is a subtype indication
- -- rather than a qualifed expression), then we must generate a call to
- -- the initialization routine. This is done using an expression actions
- -- node:
- --
- -- [Pnnn : constant ptr_T := new (T); Init (Pnnn.all,...); Pnnn]
- --
- -- Here ptr_T is the pointer type for the allocator, and T is the
- -- subtype of the allocator. A special case arises if the designated
- -- type of the access type is a task or contains tasks. In this case
- -- the call to Init (Temp.all ...) is replaced by code that ensures
- -- that the tasks get activated (see Exp_Ch9.Build_Task_Allocate_Block
- -- for details). In addition, if the type T is a task T, then the first
- -- argument to Init must be converted to the task record type.
-
- if Nkind (Expression (N)) = N_Qualified_Expression then
- declare
- Indic : constant Node_Id := Subtype_Mark (Expression (N));
- T : constant Entity_Id := Entity (Indic);
- Exp : constant Node_Id := Expression (Expression (N));
-
- Aggr_In_Place : constant Boolean := Is_Delayed_Aggregate (Exp);
-
- Tag_Assign : Node_Id;
- Tmp_Node : Node_Id;
-
- begin
- if Is_Tagged_Type (T) or else Controlled_Type (T) then
-
- -- Actions inserted before:
- -- Temp : constant ptr_T := new T'(Expression);
- -- <no CW> Temp._tag := T'tag;
- -- <CTRL> Adjust (Finalizable (Temp.all));
- -- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
-
- -- We analyze by hand the new internal allocator to avoid
- -- any recursion and inappropriate call to Initialize
- if not Aggr_In_Place then
- Remove_Side_Effects (Exp);
- end if;
-
- Temp :=
- Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
-
- -- For a class wide allocation generate the following code:
-
- -- type Equiv_Record is record ... end record;
- -- implicit subtype CW is <Class_Wide_Subytpe>;
- -- temp : PtrT := new CW'(CW!(expr));
-
- if Is_Class_Wide_Type (T) then
- Expand_Subtype_From_Expr (Empty, T, Indic, Exp);
-
- Set_Expression (Expression (N),
- Unchecked_Convert_To (Entity (Indic), Exp));
-
- Analyze_And_Resolve (Expression (N), Entity (Indic));
- end if;
-
- if Aggr_In_Place then
- Tmp_Node :=
- Make_Object_Declaration (Loc,
- Defining_Identifier => Temp,
- Object_Definition => New_Reference_To (PtrT, Loc),
- Expression => Make_Allocator (Loc,
- New_Reference_To (Etype (Exp), Loc)));
-
- Set_No_Initialization (Expression (Tmp_Node));
- Insert_Action (N, Tmp_Node);
- Convert_Aggr_In_Allocator (Tmp_Node, Exp);
- else
- Node := Relocate_Node (N);
- Set_Analyzed (Node);
- Insert_Action (N,
- Make_Object_Declaration (Loc,
- Defining_Identifier => Temp,
- Constant_Present => True,
- Object_Definition => New_Reference_To (PtrT, Loc),
- Expression => Node));
- end if;
-
- -- Suppress the tag assignment when Java_VM because JVM tags
- -- are represented implicitly in objects.
-
- if Is_Tagged_Type (T)
- and then not Is_Class_Wide_Type (T)
- and then not Java_VM
- then
- Tag_Assign :=
- Make_Assignment_Statement (Loc,
- Name =>
- Make_Selected_Component (Loc,
- Prefix => New_Reference_To (Temp, Loc),
- Selector_Name =>
- New_Reference_To (Tag_Component (T), Loc)),
-
- Expression =>
- Unchecked_Convert_To (RTE (RE_Tag),
- New_Reference_To (Access_Disp_Table (T), Loc)));
-
- -- The previous assignment has to be done in any case
-
- Set_Assignment_OK (Name (Tag_Assign));
- Insert_Action (N, Tag_Assign);
-
- elsif Is_Private_Type (T)
- and then Is_Tagged_Type (Underlying_Type (T))
- and then not Java_VM
- then
- declare
- Utyp : constant Entity_Id := Underlying_Type (T);
- Ref : constant Node_Id :=
- Unchecked_Convert_To (Utyp,
- Make_Explicit_Dereference (Loc,
- New_Reference_To (Temp, Loc)));
-
- begin
- Tag_Assign :=
- Make_Assignment_Statement (Loc,
- Name =>
- Make_Selected_Component (Loc,
- Prefix => Ref,
- Selector_Name =>
- New_Reference_To (Tag_Component (Utyp), Loc)),
-
- Expression =>
- Unchecked_Convert_To (RTE (RE_Tag),
- New_Reference_To (
- Access_Disp_Table (Utyp), Loc)));
-
- Set_Assignment_OK (Name (Tag_Assign));
- Insert_Action (N, Tag_Assign);
- end;
- end if;
-
- if Controlled_Type (Designated_Type (PtrT))
- and then Controlled_Type (T)
- then
- declare
- Flist : Node_Id;
- Attach : Node_Id;
- Apool : constant Entity_Id :=
- Associated_Storage_Pool (PtrT);
-
- begin
- -- If it is an allocation on the secondary stack
- -- (i.e. a value returned from a function), the object
- -- is attached on the caller side as soon as the call
- -- is completed (see Expand_Ctrl_Function_Call)
-
- if Is_RTE (Apool, RE_SS_Pool) then
- declare
- F : constant Entity_Id :=
- Make_Defining_Identifier (Loc,
- New_Internal_Name ('F'));
- begin
- Insert_Action (N,
- Make_Object_Declaration (Loc,
- Defining_Identifier => F,
- Object_Definition => New_Reference_To (RTE
- (RE_Finalizable_Ptr), Loc)));
-
- Flist := New_Reference_To (F, Loc);
- Attach := Make_Integer_Literal (Loc, 1);
- end;
-
- -- Normal case, not a secondary stack allocation
-
- else
- Flist := Find_Final_List (PtrT);
- Attach := Make_Integer_Literal (Loc, 2);
- end if;
-
- if not Aggr_In_Place then
- Insert_Actions (N,
- Make_Adjust_Call (
- Ref =>
-
- -- An unchecked conversion is needed in the
- -- classwide case because the designated type
- -- can be an ancestor of the subtype mark of
- -- the allocator.
-
- Unchecked_Convert_To (T,
- Make_Explicit_Dereference (Loc,
- New_Reference_To (Temp, Loc))),
-
- Typ => T,
- Flist_Ref => Flist,
- With_Attach => Attach));
- end if;
- end;
- end if;
-
- Rewrite (N, New_Reference_To (Temp, Loc));
- Analyze_And_Resolve (N, PtrT);
-
- elsif Aggr_In_Place then
- Temp :=
- Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
- Tmp_Node :=
- Make_Object_Declaration (Loc,
- Defining_Identifier => Temp,
- Object_Definition => New_Reference_To (PtrT, Loc),
- Expression => Make_Allocator (Loc,
- New_Reference_To (Etype (Exp), Loc)));
-
- Set_No_Initialization (Expression (Tmp_Node));
- Insert_Action (N, Tmp_Node);
- Convert_Aggr_In_Allocator (Tmp_Node, Exp);
- Rewrite (N, New_Reference_To (Temp, Loc));
- Analyze_And_Resolve (N, PtrT);
-
- elsif Is_Access_Type (Designated_Type (PtrT))
- and then Nkind (Exp) = N_Allocator
- and then Nkind (Expression (Exp)) /= N_Qualified_Expression
- then
- -- Apply constraint to designated subtype indication.
-
- Apply_Constraint_Check (Expression (Exp),
- Designated_Type (Designated_Type (PtrT)),
- No_Sliding => True);
-
- if Nkind (Expression (Exp)) = N_Raise_Constraint_Error then
-
- -- Propagate constraint_error to enclosing allocator
-
- Rewrite (Exp, New_Copy (Expression (Exp)));
- end if;
- else
- -- First check against the type of the qualified expression
- --
- -- NOTE: The commented call should be correct, but for
- -- some reason causes the compiler to bomb (sigsegv) on
- -- ACVC test c34007g, so for now we just perform the old
- -- (incorrect) test against the designated subtype with
- -- no sliding in the else part of the if statement below.
- -- ???
- --
- -- Apply_Constraint_Check (Exp, T, No_Sliding => True);
-
- -- A check is also needed in cases where the designated
- -- subtype is constrained and differs from the subtype
- -- given in the qualified expression. Note that the check
- -- on the qualified expression does not allow sliding,
- -- but this check does (a relaxation from Ada 83).
-
- if Is_Constrained (Designated_Type (PtrT))
- and then not Subtypes_Statically_Match
- (T, Designated_Type (PtrT))
- then
- Apply_Constraint_Check
- (Exp, Designated_Type (PtrT), No_Sliding => False);
-
- -- The nonsliding check should really be performed
- -- (unconditionally) against the subtype of the
- -- qualified expression, but that causes a problem
- -- with c34007g (see above), so for now we retain this.
+ return;
+ end if;
- else
- Apply_Constraint_Check
- (Exp, Designated_Type (PtrT), No_Sliding => True);
- end if;
- end if;
- end;
+ -- Handle case of qualified expression (other than optimization above)
- -- Here if not qualified expression case.
- -- In this case, an initialization routine may be required
+ if Nkind (Expression (N)) = N_Qualified_Expression then
+ Expand_Allocator_Expression (N);
+
+ -- If the allocator is for a type which requires initialization, and
+ -- there is no initial value (i.e. operand is a subtype indication
+ -- rather than a qualifed expression), then we must generate a call
+ -- to the initialization routine. This is done using an expression
+ -- actions node:
+ --
+ -- [Pnnn : constant ptr_T := new (T); Init (Pnnn.all,...); Pnnn]
+ --
+ -- Here ptr_T is the pointer type for the allocator, and T is the
+ -- subtype of the allocator. A special case arises if the designated
+ -- type of the access type is a task or contains tasks. In this case
+ -- the call to Init (Temp.all ...) is replaced by code that ensures
+ -- that tasks get activated (see Exp_Ch9.Build_Task_Allocate_Block
+ -- for details). In addition, if the type T is a task T, then the
+ -- first argument to Init must be converted to the task record type.
else
declare
- T : constant Entity_Id := Entity (Expression (N));
- Init : Entity_Id;
- Arg1 : Node_Id;
- Args : List_Id;
- Decls : List_Id;
- Decl : Node_Id;
- Discr : Elmt_Id;
- Flist : Node_Id;
- Temp_Decl : Node_Id;
- Temp_Type : Entity_Id;
+ T : constant Entity_Id := Entity (Expression (N));
+ Init : Entity_Id;
+ Arg1 : Node_Id;
+ Args : List_Id;
+ Decls : List_Id;
+ Decl : Node_Id;
+ Discr : Elmt_Id;
+ Flist : Node_Id;
+ Temp_Decl : Node_Id;
+ Temp_Type : Entity_Id;
+ Attach_Level : Uint;
begin
-
if No_Initialization (N) then
null;
-- if the context is access to class wide, indicate that
-- the object being allocated has the right specific type.
- if Is_Class_Wide_Type (Designated_Type (PtrT)) then
+ if Is_Class_Wide_Type (Dtyp) then
Arg1 := Unchecked_Convert_To (T, Arg1);
end if;
end if;
-- part of the generated code for the allocator).
if Has_Task (T) then
-
if No (Master_Id (Base_Type (PtrT))) then
-- The designated type was an incomplete type, and
Discr := First_Elmt (Discriminant_Constraint (T));
while Present (Discr) loop
- Append (New_Copy (Elists.Node (Discr)), Args);
+ Append (New_Copy_Tree (Elists.Node (Discr)), Args);
Next_Elmt (Discr);
end loop;
First_Elmt (Discriminant_Constraint (Full_View (T)));
while Present (Discr) loop
- Append (New_Copy (Elists.Node (Discr)), Args);
+ Append (New_Copy_Tree (Elists.Node (Discr)), Args);
Next_Elmt (Discr);
end loop;
end if;
Insert_Action (N, Temp_Decl, Suppress => All_Checks);
- -- Case of designated type is task or contains task
+ -- If the designated type is task type or contains tasks,
-- Create block to activate created tasks, and insert
-- declaration for Task_Image variable ahead of call.
if Has_Task (T) then
declare
- L : List_Id := New_List;
+ L : constant List_Id := New_List;
Blk : Node_Id;
begin
end if;
if Controlled_Type (T) then
-
- -- If the context is an access parameter, we need to create
- -- a non-anonymous access type in order to have a usable
- -- final list, because there is otherwise no pool to which
- -- the allocated object can belong. We create both the type
- -- and the finalization chain here, because freezing an
- -- internal type does not create such a chain.
-
+ Flist := Get_Allocator_Final_List (N, Base_Type (T), PtrT);
if Ekind (PtrT) = E_Anonymous_Access_Type then
- declare
- Acc : Entity_Id :=
- Make_Defining_Identifier (Loc,
- New_Internal_Name ('I'));
- begin
- Insert_Action (N,
- Make_Full_Type_Declaration (Loc,
- Defining_Identifier => Acc,
- Type_Definition =>
- Make_Access_To_Object_Definition (Loc,
- Subtype_Indication =>
- New_Occurrence_Of (T, Loc))));
-
- Build_Final_List (N, Acc);
- Flist := Find_Final_List (Acc);
- end;
-
+ Attach_Level := Uint_1;
else
- Flist := Find_Final_List (PtrT);
+ Attach_Level := Uint_2;
end if;
-
Insert_Actions (N,
Make_Init_Call (
Ref => New_Copy_Tree (Arg1),
Typ => T,
Flist_Ref => Flist,
- With_Attach => Make_Integer_Literal (Loc, 2)));
+ With_Attach => Make_Integer_Literal (Loc,
+ Attach_Level)));
end if;
if Is_CPP_Class (T) then
end if;
end;
end if;
+
+ exception
+ when RE_Not_Available =>
+ return;
end Expand_N_Allocator;
-----------------------
-- Cnn := else-expr
-- end if;
- -- and replace the conditional expression by a reference to Cnn.
+ -- and replace the conditional expression by a reference to Cnn
if Present (Then_Actions (N)) or else Present (Else_Actions (N)) then
Cnn := Make_Defining_Identifier (Loc, New_Internal_Name ('C'));
Name => New_Occurrence_Of (Cnn, Sloc (Elsex)),
Expression => Relocate_Node (Elsex))));
+ Set_Assignment_OK (Name (First (Then_Statements (New_If))));
+ Set_Assignment_OK (Name (First (Else_Statements (New_If))));
+
if Present (Then_Actions (N)) then
Insert_List_Before
(First (Then_Statements (New_If)), Then_Actions (N));
-----------------
procedure Expand_N_In (N : Node_Id) is
- Loc : constant Source_Ptr := Sloc (N);
- Rtyp : constant Entity_Id := Etype (N);
+ Loc : constant Source_Ptr := Sloc (N);
+ Rtyp : constant Entity_Id := Etype (N);
+ Lop : constant Node_Id := Left_Opnd (N);
+ Rop : constant Node_Id := Right_Opnd (N);
+ Static : constant Boolean := Is_OK_Static_Expression (N);
begin
- -- No expansion is required if we have an explicit range
+ -- If we have an explicit range, do a bit of optimization based
+ -- on range analysis (we may be able to kill one or both checks).
+
+ if Nkind (Rop) = N_Range then
+ declare
+ Lcheck : constant Compare_Result :=
+ Compile_Time_Compare (Lop, Low_Bound (Rop));
+ Ucheck : constant Compare_Result :=
+ Compile_Time_Compare (Lop, High_Bound (Rop));
+
+ begin
+ -- If either check is known to fail, replace result
+ -- by False, since the other check does not matter.
+ -- Preserve the static flag for legality checks, because
+ -- we are constant-folding beyond RM 4.9.
+
+ if Lcheck = LT or else Ucheck = GT then
+ Rewrite (N,
+ New_Reference_To (Standard_False, Loc));
+ Analyze_And_Resolve (N, Rtyp);
+ Set_Is_Static_Expression (N, Static);
+ return;
+
+ -- If both checks are known to succeed, replace result
+ -- by True, since we know we are in range.
+
+ elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then
+ Rewrite (N,
+ New_Reference_To (Standard_True, Loc));
+ Analyze_And_Resolve (N, Rtyp);
+ Set_Is_Static_Expression (N, Static);
+ return;
+
+ -- If lower bound check succeeds and upper bound check is
+ -- not known to succeed or fail, then replace the range check
+ -- with a comparison against the upper bound.
+
+ elsif Lcheck in Compare_GE then
+ Rewrite (N,
+ Make_Op_Le (Loc,
+ Left_Opnd => Lop,
+ Right_Opnd => High_Bound (Rop)));
+ Analyze_And_Resolve (N, Rtyp);
+ return;
+
+ -- If upper bound check succeeds and lower bound check is
+ -- not known to succeed or fail, then replace the range check
+ -- with a comparison against the lower bound.
+
+ elsif Ucheck in Compare_LE then
+ Rewrite (N,
+ Make_Op_Ge (Loc,
+ Left_Opnd => Lop,
+ Right_Opnd => Low_Bound (Rop)));
+ Analyze_And_Resolve (N, Rtyp);
+ return;
+ end if;
+ end;
+
+ -- For all other cases of an explicit range, nothing to be done
- if Nkind (Right_Opnd (N)) = N_Range then
return;
-- Here right operand is a subtype mark
else
declare
- Typ : Entity_Id := Etype (Right_Opnd (N));
- Obj : Node_Id := Left_Opnd (N);
- Cond : Node_Id := Empty;
- Is_Acc : Boolean := Is_Access_Type (Typ);
+ Typ : Entity_Id := Etype (Rop);
+ Is_Acc : constant Boolean := Is_Access_Type (Typ);
+ Obj : Node_Id := Lop;
+ Cond : Node_Id := Empty;
begin
Remove_Side_Effects (Obj);
-- For tagged type, do tagged membership operation
if Is_Tagged_Type (Typ) then
+
-- No expansion will be performed when Java_VM, as the
-- JVM back end will handle the membership tests directly
-- (tags are not explicitly represented in Java objects,
-- type if they come from the original type definition.
elsif Is_Scalar_Type (Typ) then
- Rewrite (Right_Opnd (N),
+ Rewrite (Rop,
Make_Range (Loc,
Low_Bound =>
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Typ, Loc))));
Analyze_And_Resolve (N, Rtyp);
return;
+
+ -- Ada 2005 (AI-216): Program_Error is raised when evaluating
+ -- a membership test if the subtype mark denotes a constrained
+ -- Unchecked_Union subtype and the expression lacks inferable
+ -- discriminants.
+
+ elsif Is_Unchecked_Union (Base_Type (Typ))
+ and then Is_Constrained (Typ)
+ and then not Has_Inferable_Discriminants (Lop)
+ then
+ Insert_Action (N,
+ Make_Raise_Program_Error (Loc,
+ Reason => PE_Unchecked_Union_Restriction));
+
+ -- Prevent Gigi from generating incorrect code by rewriting
+ -- the test as a standard False.
+
+ Rewrite (N,
+ New_Occurrence_Of (Standard_False, Loc));
+
+ return;
end if;
+ -- Here we have a non-scalar type
+
if Is_Acc then
Typ := Designated_Type (Typ);
end if;
elsif Is_Array_Type (Typ) then
- declare
+ Check_Subscripts : declare
function Construct_Attribute_Reference
- (E : Node_Id;
- Nam : Name_Id;
- Dim : Nat)
- return Node_Id;
+ (E : Node_Id;
+ Nam : Name_Id;
+ Dim : Nat) return Node_Id;
-- Build attribute reference E'Nam(Dim)
+ -----------------------------------
+ -- Construct_Attribute_Reference --
+ -----------------------------------
+
function Construct_Attribute_Reference
- (E : Node_Id;
- Nam : Name_Id;
- Dim : Nat)
- return Node_Id
+ (E : Node_Id;
+ Nam : Name_Id;
+ Dim : Nat) return Node_Id
is
begin
return
Make_Integer_Literal (Loc, Dim)));
end Construct_Attribute_Reference;
+ -- Start processing for Check_Subscripts
+
begin
for J in 1 .. Number_Dimensions (Typ) loop
Evolve_And_Then (Cond,
Make_Op_Eq (Loc,
Left_Opnd =>
Construct_Attribute_Reference
- (Duplicate_Subexpr (Obj), Name_First, J),
+ (Duplicate_Subexpr_No_Checks (Obj),
+ Name_First, J),
Right_Opnd =>
Construct_Attribute_Reference
(New_Occurrence_Of (Typ, Loc), Name_First, J)));
Make_Op_Eq (Loc,
Left_Opnd =>
Construct_Attribute_Reference
- (Duplicate_Subexpr (Obj), Name_Last, J),
+ (Duplicate_Subexpr_No_Checks (Obj),
+ Name_Last, J),
Right_Opnd =>
Construct_Attribute_Reference
(New_Occurrence_Of (Typ, Loc), Name_Last, J)));
end loop;
if Is_Acc then
- Cond := Make_Or_Else (Loc,
- Left_Opnd =>
- Make_Op_Eq (Loc,
- Left_Opnd => Obj,
- Right_Opnd => Make_Null (Loc)),
- Right_Opnd => Cond);
+ Cond :=
+ Make_Or_Else (Loc,
+ Left_Opnd =>
+ Make_Op_Eq (Loc,
+ Left_Opnd => Obj,
+ Right_Opnd => Make_Null (Loc)),
+ Right_Opnd => Cond);
end if;
Rewrite (N, Cond);
Analyze_And_Resolve (N, Rtyp);
- end;
+ end Check_Subscripts;
-- These are the cases where constraint checks may be
-- required, e.g. records with possible discriminants
-- was necessary, but it cleans up the code to do it all the time.
if Is_Access_Type (T) then
- Rewrite (P,
- Make_Explicit_Dereference (Sloc (N),
- Prefix => Relocate_Node (P)));
+ Insert_Explicit_Dereference (P);
Analyze_And_Resolve (P, Designated_Type (T));
end if;
+ -- Generate index and validity checks
+
+ Generate_Index_Checks (N);
+
if Validity_Checks_On and then Validity_Check_Subscripts then
Apply_Subscript_Validity_Checks (N);
end if;
-- convert it to a reference to the corresponding Packed_Array_Type.
-- We only want to do this for simple references, and not for:
- -- Left side of assignment (or prefix of left side of assignment)
+ -- Left side of assignment, or prefix of left side of assignment,
+ -- or prefix of the prefix, to handle packed arrays of packed arrays,
-- This case is handled in Exp_Ch5.Expand_N_Assignment_Statement
-- Renaming objects in renaming associations
then
return;
+ -- If the expression is an index of an indexed component,
+ -- it must be expanded regardless of context.
+
+ elsif Nkind (Parnt) = N_Indexed_Component
+ and then Child /= Prefix (Parnt)
+ then
+ Expand_Packed_Element_Reference (N);
+ return;
+
+ elsif Nkind (Parent (Parnt)) = N_Assignment_Statement
+ and then Name (Parent (Parnt)) = Parnt
+ then
+ return;
+
elsif Nkind (Parnt) = N_Attribute_Reference
and then Attribute_Name (Parnt) = Name_Read
and then Next (First (Expressions (Parnt))) = Child
Set_Etype (N, Typ);
end if;
+
+ exception
+ when RE_Not_Available =>
+ return;
end Expand_N_Null;
---------------------
and then Is_Signed_Integer_Type (Etype (N))
and then Do_Overflow_Check (N)
then
- -- Software overflow checking expands abs (expr) into
+ -- The only case to worry about is when the argument is
+ -- equal to the largest negative number, so what we do is
+ -- to insert the check:
- -- (if expr >= 0 then expr else -expr)
+ -- [constraint_error when Expr = typ'Base'First]
-- with the usual Duplicate_Subexpr use coding for expr
- Rewrite (N,
- Make_Conditional_Expression (Loc,
- Expressions => New_List (
- Make_Op_Ge (Loc,
+ Insert_Action (N,
+ Make_Raise_Constraint_Error (Loc,
+ Condition =>
+ Make_Op_Eq (Loc,
Left_Opnd => Duplicate_Subexpr (Expr),
- Right_Opnd => Make_Integer_Literal (Loc, 0)),
-
- Duplicate_Subexpr (Expr),
-
- Make_Op_Minus (Loc,
- Right_Opnd => Duplicate_Subexpr (Expr)))));
-
- Analyze_And_Resolve (N);
+ Right_Opnd =>
+ Make_Attribute_Reference (Loc,
+ Prefix =>
+ New_Occurrence_Of (Base_Type (Etype (Expr)), Loc),
+ Attribute_Name => Name_First)),
+ Reason => CE_Overflow_Check_Failed));
+ end if;
-- Vax floating-point types case
- elsif Vax_Float (Etype (N)) then
+ if Vax_Float (Etype (N)) then
Expand_Vax_Arith (N);
end if;
end Expand_N_Op_Abs;
end if;
end if;
- -- Arithemtic overflow checks for signed integer/fixed point types
+ -- Arithmetic overflow checks for signed integer/fixed point types
if Is_Signed_Integer_Type (Typ)
or else Is_Fixed_Point_Type (Typ)
-- Expand_N_Op_Concat --
------------------------
- procedure Expand_N_Op_Concat (N : Node_Id) is
+ Max_Available_String_Operands : Int := -1;
+ -- This is initialized the first time this routine is called. It records
+ -- a value of 0,2,3,4,5 depending on what Str_Concat_n procedures are
+ -- available in the run-time:
+ --
+ -- 0 None available
+ -- 2 RE_Str_Concat available, RE_Str_Concat_3 not available
+ -- 3 RE_Str_Concat/Concat_2 available, RE_Str_Concat_4 not available
+ -- 4 RE_Str_Concat/Concat_2/3 available, RE_Str_Concat_5 not available
+ -- 5 All routines including RE_Str_Concat_5 available
+ Char_Concat_Available : Boolean;
+ -- Records if the routines RE_Str_Concat_CC/CS/SC are available. True if
+ -- all three are available, False if any one of these is unavailable.
+
+ procedure Expand_N_Op_Concat (N : Node_Id) is
Opnds : List_Id;
-- List of operands to be concatenated
-- Component type of concatenation represented by Cnode
begin
+ -- Initialize global variables showing run-time status
+
+ if Max_Available_String_Operands < 1 then
+ if not RTE_Available (RE_Str_Concat) then
+ Max_Available_String_Operands := 0;
+ elsif not RTE_Available (RE_Str_Concat_3) then
+ Max_Available_String_Operands := 2;
+ elsif not RTE_Available (RE_Str_Concat_4) then
+ Max_Available_String_Operands := 3;
+ elsif not RTE_Available (RE_Str_Concat_5) then
+ Max_Available_String_Operands := 4;
+ else
+ Max_Available_String_Operands := 5;
+ end if;
+
+ Char_Concat_Available :=
+ RTE_Available (RE_Str_Concat_CC)
+ and then
+ RTE_Available (RE_Str_Concat_CS)
+ and then
+ RTE_Available (RE_Str_Concat_SC);
+ end if;
+
+ -- Ensure validity of both operands
+
Binary_Op_Validity_Checks (N);
-- If we are the left operand of a concatenation higher up the
Opnds := New_List (Left_Opnd (Cnode), Right_Opnd (Cnode));
Set_Parent (Opnds, N);
- -- The inner loop gathers concatenation operands
+ -- The inner loop gathers concatenation operands. We gather any
+ -- number of these in the non-string case, or if no concatenation
+ -- routines are available for string (since in that case we will
+ -- treat string like any other non-string case). Otherwise we only
+ -- gather as many operands as can be handled by the available
+ -- procedures in the run-time library (normally 5, but may be
+ -- less for the configurable run-time case).
Inner : while Cnode /= N
and then (Base_Type (Etype (Cnode)) /= Standard_String
or else
- List_Length (Opnds) < 5)
+ Max_Available_String_Operands = 0
+ or else
+ List_Length (Opnds) <
+ Max_Available_String_Operands)
and then Base_Type (Etype (Cnode)) =
Base_Type (Etype (Parent (Cnode)))
loop
Atyp := Base_Type (Etype (Cnode));
Ctyp := Base_Type (Component_Type (Etype (Cnode)));
- if List_Length (Opnds) > 2 or else Atyp /= Standard_String then
+ if (List_Length (Opnds) > 2 or else Atyp /= Standard_String)
+ or else not Char_Concat_Available
+ then
Opnd := First (Opnds);
loop
if Base_Type (Etype (Opnd)) = Ctyp then
-- Now call appropriate continuation routine
- if Atyp = Standard_String then
+ if Atyp = Standard_String
+ and then Max_Available_String_Operands > 0
+ then
Expand_Concatenate_String (Cnode, Opnds);
else
Expand_Concatenate_Other (Cnode, Opnds);
if Nkind (Right_Opnd (N)) = N_Op_Expon
and then Is_Power_Of_2_For_Shift (Right_Opnd (N))
+
+ -- We cannot do this transformation in configurable run time mode if we
+ -- have 64-bit -- integers and long shifts are not available.
+
+ and then
+ (Esize (Ltyp) <= 32
+ or else Support_Long_Shifts_On_Target)
then
Rewrite (N,
Make_Op_Shift_Right (Loc,
elsif Is_Integer_Type (Typ) then
Apply_Divide_Check (N);
+
+ -- Check for 64-bit division available
+
+ if Esize (Ltyp) > 32
+ and then not Support_64_Bit_Divides_On_Target
+ then
+ Error_Msg_CRT ("64-bit division", N);
+ end if;
end if;
end Expand_N_Op_Divide;
- --------------------
- -- Expand_N_Op_Eq --
- --------------------
+ --------------------
+ -- Expand_N_Op_Eq --
+ --------------------
+
+ procedure Expand_N_Op_Eq (N : Node_Id) is
+ Loc : constant Source_Ptr := Sloc (N);
+ Typ : constant Entity_Id := Etype (N);
+ Lhs : constant Node_Id := Left_Opnd (N);
+ Rhs : constant Node_Id := Right_Opnd (N);
+ Bodies : constant List_Id := New_List;
+ A_Typ : constant Entity_Id := Etype (Lhs);
+
+ Typl : Entity_Id := A_Typ;
+ Op_Name : Entity_Id;
+ Prim : Elmt_Id;
+
+ procedure Build_Equality_Call (Eq : Entity_Id);
+ -- If a constructed equality exists for the type or for its parent,
+ -- build and analyze call, adding conversions if the operation is
+ -- inherited.
+
+ function Has_Unconstrained_UU_Component (Typ : Node_Id) return Boolean;
+ -- Determines whether a type has a subcompoment of an unconstrained
+ -- Unchecked_Union subtype. Typ is a record type.
+
+ -------------------------
+ -- Build_Equality_Call --
+ -------------------------
+
+ procedure Build_Equality_Call (Eq : Entity_Id) is
+ Op_Type : constant Entity_Id := Etype (First_Formal (Eq));
+ L_Exp : Node_Id := Relocate_Node (Lhs);
+ R_Exp : Node_Id := Relocate_Node (Rhs);
+
+ begin
+ if Base_Type (Op_Type) /= Base_Type (A_Typ)
+ and then not Is_Class_Wide_Type (A_Typ)
+ then
+ L_Exp := OK_Convert_To (Op_Type, L_Exp);
+ R_Exp := OK_Convert_To (Op_Type, R_Exp);
+ end if;
+
+ -- If we have an Unchecked_Union, we need to add the inferred
+ -- discriminant values as actuals in the function call. At this
+ -- point, the expansion has determined that both operands have
+ -- inferable discriminants.
+
+ if Is_Unchecked_Union (Op_Type) then
+ declare
+ Lhs_Type : constant Node_Id := Etype (L_Exp);
+ Rhs_Type : constant Node_Id := Etype (R_Exp);
+ Lhs_Discr_Val : Node_Id;
+ Rhs_Discr_Val : Node_Id;
+
+ begin
+ -- Per-object constrained selected components require special
+ -- attention. If the enclosing scope of the component is an
+ -- Unchecked_Union, we can not reference its discriminants
+ -- directly. This is why we use the two extra parameters of
+ -- the equality function of the enclosing Unchecked_Union.
+
+ -- type UU_Type (Discr : Integer := 0) is
+ -- . . .
+ -- end record;
+ -- pragma Unchecked_Union (UU_Type);
+
+ -- 1. Unchecked_Union enclosing record:
+
+ -- type Enclosing_UU_Type (Discr : Integer := 0) is record
+ -- . . .
+ -- Comp : UU_Type (Discr);
+ -- . . .
+ -- end Enclosing_UU_Type;
+ -- pragma Unchecked_Union (Enclosing_UU_Type);
+
+ -- Obj1 : Enclosing_UU_Type;
+ -- Obj2 : Enclosing_UU_Type (1);
+
+ -- [. . .] Obj1 = Obj2 [. . .]
+
+ -- Generated code:
+
+ -- if not (uu_typeEQ (obj1.comp, obj2.comp, a, b)) then
+
+ -- A and B are the formal parameters of the equality function
+ -- of Enclosing_UU_Type. The function always has two extra
+ -- formals to capture the inferred discriminant values.
+
+ -- 2. Non-Unchecked_Union enclosing record:
+
+ -- type
+ -- Enclosing_Non_UU_Type (Discr : Integer := 0)
+ -- is record
+ -- . . .
+ -- Comp : UU_Type (Discr);
+ -- . . .
+ -- end Enclosing_Non_UU_Type;
+
+ -- Obj1 : Enclosing_Non_UU_Type;
+ -- Obj2 : Enclosing_Non_UU_Type (1);
+
+ -- . . . Obj1 = Obj2 . . .
+
+ -- Generated code:
+
+ -- if not (uu_typeEQ (obj1.comp, obj2.comp,
+ -- obj1.discr, obj2.discr)) then
+
+ -- In this case we can directly reference the discriminants of
+ -- the enclosing record.
+
+ -- Lhs of equality
+
+ if Nkind (Lhs) = N_Selected_Component
+ and then Has_Per_Object_Constraint
+ (Entity (Selector_Name (Lhs)))
+ then
+ -- Enclosing record is an Unchecked_Union, use formal A
+
+ if Is_Unchecked_Union (Scope
+ (Entity (Selector_Name (Lhs))))
+ then
+ Lhs_Discr_Val :=
+ Make_Identifier (Loc,
+ Chars => Name_A);
+
+ -- Enclosing record is of a non-Unchecked_Union type, it is
+ -- possible to reference the discriminant.
+
+ else
+ Lhs_Discr_Val :=
+ Make_Selected_Component (Loc,
+ Prefix => Prefix (Lhs),
+ Selector_Name =>
+ New_Copy
+ (Get_Discriminant_Value
+ (First_Discriminant (Lhs_Type),
+ Lhs_Type,
+ Stored_Constraint (Lhs_Type))));
+ end if;
+
+ -- Comment needed here ???
+
+ else
+ -- Infer the discriminant value
+
+ Lhs_Discr_Val :=
+ New_Copy
+ (Get_Discriminant_Value
+ (First_Discriminant (Lhs_Type),
+ Lhs_Type,
+ Stored_Constraint (Lhs_Type)));
+ end if;
+
+ -- Rhs of equality
+
+ if Nkind (Rhs) = N_Selected_Component
+ and then Has_Per_Object_Constraint
+ (Entity (Selector_Name (Rhs)))
+ then
+ if Is_Unchecked_Union
+ (Scope (Entity (Selector_Name (Rhs))))
+ then
+ Rhs_Discr_Val :=
+ Make_Identifier (Loc,
+ Chars => Name_B);
+
+ else
+ Rhs_Discr_Val :=
+ Make_Selected_Component (Loc,
+ Prefix => Prefix (Rhs),
+ Selector_Name =>
+ New_Copy (Get_Discriminant_Value (
+ First_Discriminant (Rhs_Type),
+ Rhs_Type,
+ Stored_Constraint (Rhs_Type))));
+
+ end if;
+ else
+ Rhs_Discr_Val :=
+ New_Copy (Get_Discriminant_Value (
+ First_Discriminant (Rhs_Type),
+ Rhs_Type,
+ Stored_Constraint (Rhs_Type)));
+
+ end if;
+
+ Rewrite (N,
+ Make_Function_Call (Loc,
+ Name => New_Reference_To (Eq, Loc),
+ Parameter_Associations => New_List (
+ L_Exp,
+ R_Exp,
+ Lhs_Discr_Val,
+ Rhs_Discr_Val)));
+ end;
+
+ -- Normal case, not an unchecked union
+
+ else
+ Rewrite (N,
+ Make_Function_Call (Loc,
+ Name => New_Reference_To (Eq, Loc),
+ Parameter_Associations => New_List (L_Exp, R_Exp)));
+ end if;
+
+ Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
+ end Build_Equality_Call;
+
+ ------------------------------------
+ -- Has_Unconstrained_UU_Component --
+ ------------------------------------
+
+ function Has_Unconstrained_UU_Component
+ (Typ : Node_Id) return Boolean
+ is
+ Tdef : constant Node_Id :=
+ Type_Definition (Declaration_Node (Base_Type (Typ)));
+ Clist : Node_Id;
+ Vpart : Node_Id;
+
+ function Component_Is_Unconstrained_UU
+ (Comp : Node_Id) return Boolean;
+ -- Determines whether the subtype of the component is an
+ -- unconstrained Unchecked_Union.
+
+ function Variant_Is_Unconstrained_UU
+ (Variant : Node_Id) return Boolean;
+ -- Determines whether a component of the variant has an unconstrained
+ -- Unchecked_Union subtype.
+
+ -----------------------------------
+ -- Component_Is_Unconstrained_UU --
+ -----------------------------------
+
+ function Component_Is_Unconstrained_UU
+ (Comp : Node_Id) return Boolean
+ is
+ begin
+ if Nkind (Comp) /= N_Component_Declaration then
+ return False;
+ end if;
+
+ declare
+ Sindic : constant Node_Id :=
+ Subtype_Indication (Component_Definition (Comp));
+
+ begin
+ -- Unconstrained nominal type. In the case of a constraint
+ -- present, the node kind would have been N_Subtype_Indication.
+
+ if Nkind (Sindic) = N_Identifier then
+ return Is_Unchecked_Union (Base_Type (Etype (Sindic)));
+ end if;
+
+ return False;
+ end;
+ end Component_Is_Unconstrained_UU;
+
+ ---------------------------------
+ -- Variant_Is_Unconstrained_UU --
+ ---------------------------------
+
+ function Variant_Is_Unconstrained_UU
+ (Variant : Node_Id) return Boolean
+ is
+ Clist : constant Node_Id := Component_List (Variant);
+
+ begin
+ if Is_Empty_List (Component_Items (Clist)) then
+ return False;
+ end if;
+
+ declare
+ Comp : Node_Id := First (Component_Items (Clist));
+
+ begin
+ while Present (Comp) loop
+
+ -- One component is sufficent
+
+ if Component_Is_Unconstrained_UU (Comp) then
+ return True;
+ end if;
+
+ Next (Comp);
+ end loop;
+ end;
+
+ -- None of the components withing the variant were of
+ -- unconstrained Unchecked_Union type.
+
+ return False;
+ end Variant_Is_Unconstrained_UU;
+
+ -- Start of processing for Has_Unconstrained_UU_Component
+
+ begin
+ if Null_Present (Tdef) then
+ return False;
+ end if;
+
+ Clist := Component_List (Tdef);
+ Vpart := Variant_Part (Clist);
+
+ -- Inspect available components
+
+ if Present (Component_Items (Clist)) then
+ declare
+ Comp : Node_Id := First (Component_Items (Clist));
+
+ begin
+ while Present (Comp) loop
+
+ -- One component is sufficent
+
+ if Component_Is_Unconstrained_UU (Comp) then
+ return True;
+ end if;
+
+ Next (Comp);
+ end loop;
+ end;
+ end if;
- procedure Expand_N_Op_Eq (N : Node_Id) is
- Loc : constant Source_Ptr := Sloc (N);
- Typ : constant Entity_Id := Etype (N);
- Lhs : constant Node_Id := Left_Opnd (N);
- Rhs : constant Node_Id := Right_Opnd (N);
- A_Typ : Entity_Id := Etype (Lhs);
- Typl : Entity_Id := A_Typ;
- Op_Name : Entity_Id;
- Prim : Elmt_Id;
- Bodies : List_Id := New_List;
+ -- Inspect available components withing variants
- procedure Build_Equality_Call (Eq : Entity_Id);
- -- If a constructed equality exists for the type or for its parent,
- -- build and analyze call, adding conversions if the operation is
- -- inherited.
+ if Present (Vpart) then
+ declare
+ Variant : Node_Id := First (Variants (Vpart));
- -------------------------
- -- Build_Equality_Call --
- -------------------------
+ begin
+ while Present (Variant) loop
- procedure Build_Equality_Call (Eq : Entity_Id) is
- Op_Type : constant Entity_Id := Etype (First_Formal (Eq));
- L_Exp : Node_Id := Relocate_Node (Lhs);
- R_Exp : Node_Id := Relocate_Node (Rhs);
+ -- One component within a variant is sufficent
- begin
- if Base_Type (Op_Type) /= Base_Type (A_Typ)
- and then not Is_Class_Wide_Type (A_Typ)
- then
- L_Exp := OK_Convert_To (Op_Type, L_Exp);
- R_Exp := OK_Convert_To (Op_Type, R_Exp);
+ if Variant_Is_Unconstrained_UU (Variant) then
+ return True;
+ end if;
+
+ Next (Variant);
+ end loop;
+ end;
end if;
- Rewrite (N,
- Make_Function_Call (Loc,
- Name => New_Reference_To (Eq, Loc),
- Parameter_Associations => New_List (L_Exp, R_Exp)));
+ -- Neither the available components, nor the components inside the
+ -- variant parts were of an unconstrained Unchecked_Union subtype.
- Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
- end Build_Equality_Call;
+ return False;
+ end Has_Unconstrained_UU_Component;
-- Start of processing for Expand_N_Op_Eq
elsif Is_Array_Type (Typl) then
- -- Packed case
+ -- If we are doing full validity checking, then expand out array
+ -- comparisons to make sure that we check the array elements.
- if Is_Bit_Packed_Array (Typl) then
- Expand_Packed_Eq (N);
+ if Validity_Check_Operands then
+ declare
+ Save_Force_Validity_Checks : constant Boolean :=
+ Force_Validity_Checks;
+ begin
+ Force_Validity_Checks := True;
+ Rewrite (N,
+ Expand_Array_Equality
+ (N,
+ Relocate_Node (Lhs),
+ Relocate_Node (Rhs),
+ Bodies,
+ Typl));
+ Insert_Actions (N, Bodies);
+ Analyze_And_Resolve (N, Standard_Boolean);
+ Force_Validity_Checks := Save_Force_Validity_Checks;
+ end;
- -- For non-floating-point elementary types, the primitive equality
- -- always applies, and block-bit comparison is fine. Floating-point
- -- is an exception because of negative zeroes.
+ -- Packed case where both operands are known aligned
+
+ elsif Is_Bit_Packed_Array (Typl)
+ and then not Is_Possibly_Unaligned_Object (Lhs)
+ and then not Is_Possibly_Unaligned_Object (Rhs)
+ then
+ Expand_Packed_Eq (N);
- -- However, we never use block bit comparison in No_Run_Time mode,
- -- since this may result in a call to a run time routine
+ -- Where the component type is elementary we can use a block bit
+ -- comparison (if supported on the target) exception in the case
+ -- of floating-point (negative zero issues require element by
+ -- element comparison), and atomic types (where we must be sure
+ -- to load elements independently) and possibly unaligned arrays.
elsif Is_Elementary_Type (Component_Type (Typl))
and then not Is_Floating_Point_Type (Component_Type (Typl))
- and then not No_Run_Time
+ and then not Is_Atomic (Component_Type (Typl))
+ and then not Is_Possibly_Unaligned_Object (Lhs)
+ and then not Is_Possibly_Unaligned_Object (Rhs)
+ and then Support_Composite_Compare_On_Target
then
null;
else
Rewrite (N,
- Expand_Array_Equality (N, Typl, A_Typ,
- Relocate_Node (Lhs), Relocate_Node (Rhs), Bodies));
-
+ Expand_Array_Equality
+ (N,
+ Relocate_Node (Lhs),
+ Relocate_Node (Rhs),
+ Bodies,
+ Typl));
Insert_Actions (N, Bodies, Suppress => All_Checks);
Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
end if;
and then Is_Derived_Type (A_Typ)
and then No (Full_View (A_Typ))
then
+ -- Search for equality operation, checking that the
+ -- operands have the same type. Note that we must find
+ -- a matching entry, or something is very wrong!
+
Prim := First_Elmt (Collect_Primitive_Operations (A_Typ));
- while Chars (Node (Prim)) /= Name_Op_Eq loop
+ while Present (Prim) loop
+ exit when Chars (Node (Prim)) = Name_Op_Eq
+ and then Etype (First_Formal (Node (Prim))) =
+ Etype (Next_Formal (First_Formal (Node (Prim))))
+ and then
+ Base_Type (Etype (Node (Prim))) = Standard_Boolean;
+
Next_Elmt (Prim);
- pragma Assert (Present (Prim));
end loop;
+ pragma Assert (Present (Prim));
Op_Name := Node (Prim);
+
+ -- Find the type's predefined equality or an overriding
+ -- user-defined equality. The reason for not simply calling
+ -- Find_Prim_Op here is that there may be a user-defined
+ -- overloaded equality op that precedes the equality that
+ -- we want, so we have to explicitly search (e.g., there
+ -- could be an equality with two different parameter types).
+
else
- Op_Name := Find_Prim_Op (Typl, Name_Op_Eq);
+ if Is_Class_Wide_Type (Typl) then
+ Typl := Root_Type (Typl);
+ end if;
+
+ Prim := First_Elmt (Primitive_Operations (Typl));
+ while Present (Prim) loop
+ exit when Chars (Node (Prim)) = Name_Op_Eq
+ and then Etype (First_Formal (Node (Prim))) =
+ Etype (Next_Formal (First_Formal (Node (Prim))))
+ and then
+ Base_Type (Etype (Node (Prim))) = Standard_Boolean;
+
+ Next_Elmt (Prim);
+ end loop;
+
+ pragma Assert (Present (Prim));
+ Op_Name := Node (Prim);
end if;
Build_Equality_Call (Op_Name);
+ -- Ada 2005 (AI-216): Program_Error is raised when evaluating the
+ -- predefined equality operator for a type which has a subcomponent
+ -- of an Unchecked_Union type whose nominal subtype is unconstrained.
+
+ elsif Has_Unconstrained_UU_Component (Typl) then
+ Insert_Action (N,
+ Make_Raise_Program_Error (Loc,
+ Reason => PE_Unchecked_Union_Restriction));
+
+ -- Prevent Gigi from generating incorrect code by rewriting the
+ -- equality as a standard False.
+
+ Rewrite (N,
+ New_Occurrence_Of (Standard_False, Loc));
+
+ elsif Is_Unchecked_Union (Typl) then
+
+ -- If we can infer the discriminants of the operands, we make a
+ -- call to the TSS equality function.
+
+ if Has_Inferable_Discriminants (Lhs)
+ and then
+ Has_Inferable_Discriminants (Rhs)
+ then
+ Build_Equality_Call
+ (TSS (Root_Type (Typl), TSS_Composite_Equality));
+
+ else
+ -- Ada 2005 (AI-216): Program_Error is raised when evaluating
+ -- the predefined equality operator for an Unchecked_Union type
+ -- if either of the operands lack inferable discriminants.
+
+ Insert_Action (N,
+ Make_Raise_Program_Error (Loc,
+ Reason => PE_Unchecked_Union_Restriction));
+
+ -- Prevent Gigi from generating incorrect code by rewriting
+ -- the equality as a standard False.
+
+ Rewrite (N,
+ New_Occurrence_Of (Standard_False, Loc));
+
+ end if;
+
-- If a type support function is present (for complex cases), use it
- elsif Present (TSS (Root_Type (Typl), Name_uEquality)) then
- Build_Equality_Call (TSS (Root_Type (Typl), Name_uEquality));
+ elsif Present (TSS (Root_Type (Typl), TSS_Composite_Equality)) then
+ Build_Equality_Call
+ (TSS (Root_Type (Typl), TSS_Composite_Equality));
-- Otherwise expand the component by component equality. Note that
-- we never use block-bit coparisons for records, because of the
Temp : Node_Id;
Rent : RE_Id;
Ent : Entity_Id;
+ Etyp : Entity_Id;
begin
Binary_Op_Validity_Checks (N);
end;
end if;
- -- At this point the exponentiation must be dynamic since the static
- -- case has already been folded after Resolve by Eval_Op_Expon.
-
- -- Test for case of literal right argument
+ -- Test for case of known right argument
if Compile_Time_Known_Value (Exp) then
Expv := Expr_Value (Exp);
Xnode :=
Make_Op_Multiply (Loc,
Left_Opnd => Duplicate_Subexpr (Base),
- Right_Opnd => Duplicate_Subexpr (Base));
+ Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
-- X ** 3 = X * X * X
Left_Opnd =>
Make_Op_Multiply (Loc,
Left_Opnd => Duplicate_Subexpr (Base),
- Right_Opnd => Duplicate_Subexpr (Base)),
- Right_Opnd => Duplicate_Subexpr (Base));
+ Right_Opnd => Duplicate_Subexpr_No_Checks (Base)),
+ Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
-- X ** 4 ->
-- En : constant base'type := base * base;
Expression =>
Make_Op_Multiply (Loc,
Left_Opnd => Duplicate_Subexpr (Base),
- Right_Opnd => Duplicate_Subexpr (Base)))));
+ Right_Opnd => Duplicate_Subexpr_No_Checks (Base)))));
Xnode :=
Make_Op_Multiply (Loc,
-- Case of (2 ** expression) appearing as an argument of an integer
-- multiplication, or as the right argument of a division of a non-
- -- negative integer. In such cases we lave the node untouched, setting
+ -- negative integer. In such cases we leave the node untouched, setting
-- the flag Is_Natural_Power_Of_2_for_Shift set, then the expansion
-- of the higher level node converts it into a shift.
-- Fall through if exponentiation must be done using a runtime routine
- if No_Run_Time then
- Disallow_In_No_Run_Time_Mode (N);
- return;
- end if;
-
-- First deal with modular case
if Is_Modular_Integer_Type (Rtyp) then
-- to the base type.
if Non_Binary_Modulus (Rtyp) then
-
Rewrite (N,
Convert_To (Typ,
Make_Function_Call (Loc,
Analyze_And_Resolve (N, Typ);
return;
- -- Signed integer cases
-
- elsif Rtyp = Base_Type (Standard_Integer) then
- if Ovflo then
- Rent := RE_Exp_Integer;
- else
- Rent := RE_Exn_Integer;
- end if;
-
- elsif Rtyp = Base_Type (Standard_Short_Integer) then
- if Ovflo then
- Rent := RE_Exp_Short_Integer;
- else
- Rent := RE_Exn_Short_Integer;
- end if;
-
- elsif Rtyp = Base_Type (Standard_Short_Short_Integer) then
- if Ovflo then
- Rent := RE_Exp_Short_Short_Integer;
- else
- Rent := RE_Exn_Short_Short_Integer;
- end if;
+ -- Signed integer cases, done using either Integer or Long_Long_Integer.
+ -- It is not worth having routines for Short_[Short_]Integer, since for
+ -- most machines it would not help, and it would generate more code that
+ -- might need certification in the HI-E case.
- elsif Rtyp = Base_Type (Standard_Long_Integer) then
- if Ovflo then
- Rent := RE_Exp_Long_Integer;
- else
- Rent := RE_Exn_Long_Integer;
- end if;
+ -- In the integer cases, we have two routines, one for when overflow
+ -- checks are required, and one when they are not required, since
+ -- there is a real gain in ommitting checks on many machines.
- elsif (Rtyp = Base_Type (Standard_Long_Long_Integer)
- or else Rtyp = Universal_Integer)
+ elsif Rtyp = Base_Type (Standard_Long_Long_Integer)
+ or else (Rtyp = Base_Type (Standard_Long_Integer)
+ and then
+ Esize (Standard_Long_Integer) > Esize (Standard_Integer))
+ or else (Rtyp = Universal_Integer)
then
+ Etyp := Standard_Long_Long_Integer;
+
if Ovflo then
Rent := RE_Exp_Long_Long_Integer;
else
Rent := RE_Exn_Long_Long_Integer;
end if;
- -- Floating-point cases
-
- elsif Rtyp = Standard_Float then
- if Ovflo then
- Rent := RE_Exp_Float;
- else
- Rent := RE_Exn_Float;
- end if;
+ elsif Is_Signed_Integer_Type (Rtyp) then
+ Etyp := Standard_Integer;
- elsif Rtyp = Standard_Short_Float then
if Ovflo then
- Rent := RE_Exp_Short_Float;
+ Rent := RE_Exp_Integer;
else
- Rent := RE_Exn_Short_Float;
+ Rent := RE_Exn_Integer;
end if;
- elsif Rtyp = Standard_Long_Float then
- if Ovflo then
- Rent := RE_Exp_Long_Float;
- else
- Rent := RE_Exn_Long_Float;
- end if;
+ -- Floating-point cases, always done using Long_Long_Float. We do not
+ -- need separate routines for the overflow case here, since in the case
+ -- of floating-point, we generate infinities anyway as a rule (either
+ -- that or we automatically trap overflow), and if there is an infinity
+ -- generated and a range check is required, the check will fail anyway.
else
- pragma Assert
- (Rtyp = Standard_Long_Long_Float or else Rtyp = Universal_Real);
-
- if Ovflo then
- Rent := RE_Exp_Long_Long_Float;
- else
- Rent := RE_Exn_Long_Long_Float;
- end if;
+ pragma Assert (Is_Floating_Point_Type (Rtyp));
+ Etyp := Standard_Long_Long_Float;
+ Rent := RE_Exn_Long_Long_Float;
end if;
-- Common processing for integer cases and floating-point cases.
- -- If we are in the base type, we can call runtime routine directly
+ -- If we are in the right type, we can call runtime routine directly
- if Typ = Rtyp
+ if Typ = Etyp
and then Rtyp /= Universal_Integer
and then Rtyp /= Universal_Real
then
Parameter_Associations => New_List (Base, Exp)));
-- Otherwise we have to introduce conversions (conversions are also
- -- required in the universal cases, since the runtime routine was
- -- typed using the largest integer or real case.
+ -- required in the universal cases, since the runtime routine is
+ -- typed using one of the standard types.
else
Rewrite (N,
Make_Function_Call (Loc,
Name => New_Reference_To (RTE (Rent), Loc),
Parameter_Associations => New_List (
- Convert_To (Rtyp, Base),
+ Convert_To (Etyp, Base),
Exp))));
end if;
Analyze_And_Resolve (N, Typ);
return;
+ exception
+ when RE_Not_Available =>
+ return;
end Expand_N_Op_Expon;
--------------------
procedure Expand_N_Op_Mod (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
- T : constant Entity_Id := Etype (N);
+ Typ : constant Entity_Id := Etype (N);
Left : constant Node_Id := Left_Opnd (N);
Right : constant Node_Id := Right_Opnd (N);
DOC : constant Boolean := Do_Overflow_Check (N);
-- instance and is epsilon more efficient.
Set_Entity (N, Standard_Entity (S_Op_Rem));
- Set_Etype (N, T);
+ Set_Etype (N, Typ);
Set_Do_Overflow_Check (N, DOC);
Set_Do_Division_Check (N, DDC);
Expand_N_Op_Rem (N);
Apply_Divide_Check (N);
end if;
+ -- Apply optimization x mod 1 = 0. We don't really need that with
+ -- gcc, but it is useful with other back ends (e.g. AAMP), and is
+ -- certainly harmless.
+
+ if Is_Integer_Type (Etype (N))
+ and then Compile_Time_Known_Value (Right)
+ and then Expr_Value (Right) = Uint_1
+ then
+ Rewrite (N, Make_Integer_Literal (Loc, 0));
+ Analyze_And_Resolve (N, Typ);
+ return;
+ end if;
+
-- Deal with annoying case of largest negative number remainder
-- minus one. Gigi does not handle this case correctly, because
-- it generates a divide instruction which may trap in this case.
-- then the mod value is always 0, and we can just ignore the
-- left operand completely in this case.
- LLB := Expr_Value (Type_Low_Bound (Base_Type (Etype (Left))));
+ -- The operand type may be private (e.g. in the expansion of an
+ -- an intrinsic operation) so we must use the underlying type to
+ -- get the bounds, and convert the literals explicitly.
+
+ LLB :=
+ Expr_Value
+ (Type_Low_Bound (Base_Type (Underlying_Type (Etype (Left)))));
if ((not ROK) or else (Rlo <= (-1) and then (-1) <= Rhi))
and then
Make_Op_Eq (Loc,
Left_Opnd => Duplicate_Subexpr (Right),
Right_Opnd =>
- Make_Integer_Literal (Loc, -1)),
- Make_Integer_Literal (Loc, Uint_0),
+ Unchecked_Convert_To (Typ,
+ Make_Integer_Literal (Loc, -1))),
+ Unchecked_Convert_To (Typ,
+ Make_Integer_Literal (Loc, Uint_0)),
Relocate_Node (N))));
Set_Analyzed (Next (Next (First (Expressions (N)))));
- Analyze_And_Resolve (N, T);
+ Analyze_And_Resolve (N, Typ);
end if;
end if;
end Expand_N_Op_Mod;
Loc : constant Source_Ptr := Sloc (N);
Lop : constant Node_Id := Left_Opnd (N);
Rop : constant Node_Id := Right_Opnd (N);
+
+ Lp2 : constant Boolean :=
+ Nkind (Lop) = N_Op_Expon
+ and then Is_Power_Of_2_For_Shift (Lop);
+
+ Rp2 : constant Boolean :=
+ Nkind (Rop) = N_Op_Expon
+ and then Is_Power_Of_2_For_Shift (Rop);
+
Ltyp : constant Entity_Id := Etype (Lop);
Rtyp : constant Entity_Id := Etype (Rop);
Typ : Entity_Id := Etype (N);
-- N * 0 = 0 * N = 0 for integer types
- if (Compile_Time_Known_Value (Right_Opnd (N))
- and then Expr_Value (Right_Opnd (N)) = Uint_0)
+ if (Compile_Time_Known_Value (Rop)
+ and then Expr_Value (Rop) = Uint_0)
or else
- (Compile_Time_Known_Value (Left_Opnd (N))
- and then Expr_Value (Left_Opnd (N)) = Uint_0)
+ (Compile_Time_Known_Value (Lop)
+ and then Expr_Value (Lop) = Uint_0)
then
Rewrite (N, Make_Integer_Literal (Loc, Uint_0));
Analyze_And_Resolve (N, Typ);
-- N * 1 = 1 * N = N for integer types
- if Compile_Time_Known_Value (Right_Opnd (N))
- and then Expr_Value (Right_Opnd (N)) = Uint_1
+ -- This optimisation is not done if we are going to
+ -- rewrite the product 1 * 2 ** N to a shift.
+
+ if Compile_Time_Known_Value (Rop)
+ and then Expr_Value (Rop) = Uint_1
+ and then not Lp2
then
- Rewrite (N, Left_Opnd (N));
+ Rewrite (N, Lop);
return;
- elsif Compile_Time_Known_Value (Left_Opnd (N))
- and then Expr_Value (Left_Opnd (N)) = Uint_1
+ elsif Compile_Time_Known_Value (Lop)
+ and then Expr_Value (Lop) = Uint_1
+ and then not Rp2
then
- Rewrite (N, Right_Opnd (N));
+ Rewrite (N, Rop);
return;
end if;
end if;
-- Is_Power_Of_2_For_Shift is set means that we know that our left
-- operand is an integer, as required for this to work.
- if Nkind (Rop) = N_Op_Expon
- and then Is_Power_Of_2_For_Shift (Rop)
- then
- if Nkind (Lop) = N_Op_Expon
- and then Is_Power_Of_2_For_Shift (Lop)
- then
+ if Rp2 then
+ if Lp2 then
- -- convert 2 ** A * 2 ** B into 2 ** (A + B)
+ -- Convert 2 ** A * 2 ** B into 2 ** (A + B)
Rewrite (N,
Make_Op_Expon (Loc,
-- Same processing for the operands the other way round
- elsif Nkind (Lop) = N_Op_Expon
- and then Is_Power_Of_2_For_Shift (Lop)
- then
+ elsif Lp2 then
Rewrite (N,
Make_Op_Shift_Left (Loc,
Left_Opnd => Rop,
Set_Entity (Right_Opnd (Neg), Corresponding_Equality (Ne));
end if;
+ -- For navigation purposes, the inequality is treated as an implicit
+ -- reference to the corresponding equality. Preserve the Comes_From_
+ -- source flag so that the proper Xref entry is generated.
+
+ Preserve_Comes_From_Source (Neg, N);
+ Preserve_Comes_From_Source (Right_Opnd (Neg), N);
Rewrite (N, Neg);
Analyze_And_Resolve (N, Standard_Boolean);
end Expand_N_Op_Ne;
return;
end if;
- -- Case of array operand. If bit packed, handle it in Exp_Pakd
+ -- Case of array operand. If bit packed with a component size of 1,
+ -- handle it in Exp_Pakd if the operand is known to be aligned.
- if Is_Bit_Packed_Array (Typ) and then Component_Size (Typ) = 1 then
+ if Is_Bit_Packed_Array (Typ)
+ and then Component_Size (Typ) = 1
+ and then not Is_Possibly_Unaligned_Object (Right_Opnd (N))
+ then
Expand_Packed_Not (N);
return;
end if;
- -- Case of array operand which is not bit-packed
+ -- Case of array operand which is not bit-packed. If the context is
+ -- a safe assignment, call in-place operation, If context is a larger
+ -- boolean expression in the context of a safe assignment, expansion is
+ -- done by enclosing operation.
Opnd := Relocate_Node (Right_Opnd (N));
Convert_To_Actual_Subtype (Opnd);
Arr := Etype (Opnd);
Ensure_Defined (Arr, N);
+ if Nkind (Parent (N)) = N_Assignment_Statement then
+ if Safe_In_Place_Array_Op (Name (Parent (N)), N, Empty) then
+ Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
+ return;
+
+ -- Special case the negation of a binary operation
+
+ elsif (Nkind (Opnd) = N_Op_And
+ or else Nkind (Opnd) = N_Op_Or
+ or else Nkind (Opnd) = N_Op_Xor)
+ and then Safe_In_Place_Array_Op
+ (Name (Parent (N)), Left_Opnd (Opnd), Right_Opnd (Opnd))
+ then
+ Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
+ return;
+ end if;
+
+ elsif Nkind (Parent (N)) in N_Binary_Op
+ and then Nkind (Parent (Parent (N))) = N_Assignment_Statement
+ then
+ declare
+ Op1 : constant Node_Id := Left_Opnd (Parent (N));
+ Op2 : constant Node_Id := Right_Opnd (Parent (N));
+ Lhs : constant Node_Id := Name (Parent (Parent (N)));
+
+ begin
+ if Safe_In_Place_Array_Op (Lhs, Op1, Op2) then
+ if N = Op1
+ and then Nkind (Op2) = N_Op_Not
+ then
+ -- (not A) op (not B) can be reduced to a single call
+
+ return;
+
+ elsif N = Op2
+ and then Nkind (Parent (N)) = N_Op_Xor
+ then
+ -- A xor (not B) can also be special-cased
+
+ return;
+ end if;
+ end if;
+ end;
+ end if;
+
A := Make_Defining_Identifier (Loc, Name_uA);
B := Make_Defining_Identifier (Loc, Name_uB);
J := Make_Defining_Identifier (Loc, Name_uJ);
procedure Expand_N_Op_Rem (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
+ Typ : constant Entity_Id := Etype (N);
Left : constant Node_Id := Left_Opnd (N);
Right : constant Node_Id := Right_Opnd (N);
Rlo : Uint;
Rhi : Uint;
ROK : Boolean;
- Typ : Entity_Id;
begin
Binary_Op_Validity_Checks (N);
Apply_Divide_Check (N);
end if;
+ -- Apply optimization x rem 1 = 0. We don't really need that with
+ -- gcc, but it is useful with other back ends (e.g. AAMP), and is
+ -- certainly harmless.
+
+ if Is_Integer_Type (Etype (N))
+ and then Compile_Time_Known_Value (Right)
+ and then Expr_Value (Right) = Uint_1
+ then
+ Rewrite (N, Make_Integer_Literal (Loc, 0));
+ Analyze_And_Resolve (N, Typ);
+ return;
+ end if;
+
-- Deal with annoying case of largest negative number remainder
-- minus one. Gigi does not handle this case correctly, because
-- it generates a divide instruction which may trap in this case.
Determine_Range (Right, ROK, Rlo, Rhi);
Determine_Range (Left, LOK, Llo, Lhi);
- LLB := Expr_Value (Type_Low_Bound (Base_Type (Etype (Left))));
- Typ := Etype (N);
+
+ -- The operand type may be private (e.g. in the expansion of an
+ -- an intrinsic operation) so we must use the underlying type to
+ -- get the bounds, and convert the literals explicitly.
+
+ LLB :=
+ Expr_Value
+ (Type_Low_Bound (Base_Type (Underlying_Type (Etype (Left)))));
+
+ -- Now perform the test, generating code only if needed
if ((not ROK) or else (Rlo <= (-1) and then (-1) <= Rhi))
and then
Make_Op_Eq (Loc,
Left_Opnd => Duplicate_Subexpr (Right),
Right_Opnd =>
- Make_Integer_Literal (Loc, -1)),
+ Unchecked_Convert_To (Typ,
+ Make_Integer_Literal (Loc, -1))),
- Make_Integer_Literal (Loc, Uint_0),
+ Unchecked_Convert_To (Typ,
+ Make_Integer_Literal (Loc, Uint_0)),
Relocate_Node (N))));
Adjust_Condition (Left);
Adjust_Condition (Right);
Set_Etype (N, Standard_Boolean);
+ end if;
-- Check for cases of left argument is True or False
- elsif Nkind (Left) = N_Identifier then
+ if Nkind (Left) = N_Identifier then
-- If left argument is False, change (False or else Right) to Right.
-- Any actions associated with Right will be executed unconditionally
Loc : constant Source_Ptr := Sloc (N);
Par : constant Node_Id := Parent (N);
P : constant Node_Id := Prefix (N);
+ Ptyp : Entity_Id := Underlying_Type (Etype (P));
Disc : Entity_Id;
- Ptyp : Entity_Id := Underlying_Type (Etype (P));
New_N : Node_Id;
+ Dcon : Elmt_Id;
function In_Left_Hand_Side (Comp : Node_Id) return Boolean;
-- Gigi needs a temporary for prefixes that depend on a discriminant,
-- unless the context of an assignment can provide size information.
+ -- Don't we have a general routine that does this???
+
+ -----------------------
+ -- In_Left_Hand_Side --
+ -----------------------
function In_Left_Hand_Side (Comp : Node_Id) return Boolean is
begin
- return
- (Nkind (Parent (Comp)) = N_Assignment_Statement
- and then Comp = Name (Parent (Comp)))
- or else
- (Present (Parent (Comp))
- and then Nkind (Parent (Comp)) in N_Subexpr
- and then In_Left_Hand_Side (Parent (Comp)));
+ return (Nkind (Parent (Comp)) = N_Assignment_Statement
+ and then Comp = Name (Parent (Comp)))
+ or else (Present (Parent (Comp))
+ and then Nkind (Parent (Comp)) in N_Subexpr
+ and then In_Left_Hand_Side (Parent (Comp)));
end In_Left_Hand_Side;
+ -- Start of processing for Expand_N_Selected_Component
+
begin
+ -- Insert explicit dereference if required
+
+ if Is_Access_Type (Ptyp) then
+ Insert_Explicit_Dereference (P);
+ Analyze_And_Resolve (P, Designated_Type (Ptyp));
+
+ if Ekind (Etype (P)) = E_Private_Subtype
+ and then Is_For_Access_Subtype (Etype (P))
+ then
+ Set_Etype (P, Base_Type (Etype (P)));
+ end if;
+
+ Ptyp := Etype (P);
+ end if;
+
+ -- Deal with discriminant check required
+
if Do_Discriminant_Check (N) then
-- Present the discrminant checking function to the backend,
Add_Inlined_Body
(Discriminant_Checking_Func
(Original_Record_Component (Entity (Selector_Name (N)))));
- end if;
- -- Insert explicit dereference call for the checked storage pool case
+ -- Now reset the flag and generate the call
- if Is_Access_Type (Ptyp) then
- Insert_Dereference_Action (P);
- return;
+ Set_Do_Discriminant_Check (N, False);
+ Generate_Discriminant_Check (N);
end if;
- -- Gigi cannot handle unchecked conversions that are the prefix of
- -- a selected component with discriminants. This must be checked
- -- during expansion, because during analysis the type of the selector
- -- is not known at the point the prefix is analyzed. If the conversion
- -- is the target of an assignment, we cannot force the evaluation, of
- -- course.
+ -- Gigi cannot handle unchecked conversions that are the prefix of a
+ -- selected component with discriminants. This must be checked during
+ -- expansion, because during analysis the type of the selector is not
+ -- known at the point the prefix is analyzed. If the conversion is the
+ -- target of an assignment, then we cannot force the evaluation.
if Nkind (Prefix (N)) = N_Unchecked_Type_Conversion
and then Has_Discriminants (Etype (N))
if Ekind (Entity (Selector_Name (N))) = E_Discriminant then
-- If the selector is a discriminant of a constrained record type,
- -- rewrite the expression with the actual value of the discriminant.
- -- Don't do this on the left hand of an assignment statement (this
- -- happens in generated code, and means we really want to set it!)
- -- We also only do this optimization for discrete types, and not
- -- for access types (access discriminants get us into trouble!)
- -- We also do not expand the prefix of an attribute or the
- -- operand of an object renaming declaration.
+ -- we may be able to rewrite the expression with the actual value
+ -- of the discriminant, a useful optimization in some cases.
if Is_Record_Type (Ptyp)
and then Has_Discriminants (Ptyp)
and then Is_Constrained (Ptyp)
- and then Is_Discrete_Type (Etype (N))
- and then (Nkind (Par) /= N_Assignment_Statement
- or else Name (Par) /= N)
- and then (Nkind (Par) /= N_Attribute_Reference
- or else Prefix (Par) /= N)
- and then not Is_Renamed_Object (N)
then
- declare
- D : Entity_Id;
- E : Elmt_Id;
+ -- Do this optimization for discrete types only, and not for
+ -- access types (access discriminants get us into trouble!)
- begin
- D := First_Discriminant (Ptyp);
- E := First_Elmt (Discriminant_Constraint (Ptyp));
+ if not Is_Discrete_Type (Etype (N)) then
+ null;
- while Present (E) loop
- if D = Entity (Selector_Name (N)) then
+ -- Don't do this on the left hand of an assignment statement.
+ -- Normally one would think that references like this would
+ -- not occur, but they do in generated code, and mean that
+ -- we really do want to assign the discriminant!
+
+ elsif Nkind (Par) = N_Assignment_Statement
+ and then Name (Par) = N
+ then
+ null;
+
+ -- Don't do this optimization for the prefix of an attribute
+ -- or the operand of an object renaming declaration since these
+ -- are contexts where we do not want the value anyway.
+
+ elsif (Nkind (Par) = N_Attribute_Reference
+ and then Prefix (Par) = N)
+ or else Is_Renamed_Object (N)
+ then
+ null;
+
+ -- Don't do this optimization if we are within the code for a
+ -- discriminant check, since the whole point of such a check may
+ -- be to verify the condition on which the code below depends!
+
+ elsif Is_In_Discriminant_Check (N) then
+ null;
+
+ -- Green light to see if we can do the optimization. There is
+ -- still one condition that inhibits the optimization below
+ -- but now is the time to check the particular discriminant.
+
+ else
+ -- Loop through discriminants to find the matching
+ -- discriminant constraint to see if we can copy it.
+
+ Disc := First_Discriminant (Ptyp);
+ Dcon := First_Elmt (Discriminant_Constraint (Ptyp));
+ Discr_Loop : while Present (Dcon) loop
+
+ -- Check if this is the matching discriminant
+
+ if Disc = Entity (Selector_Name (N)) then
+
+ -- Here we have the matching discriminant. Check for
+ -- the case of a discriminant of a component that is
+ -- constrained by an outer discriminant, which cannot
+ -- be optimized away.
+
+ if
+ Denotes_Discriminant
+ (Node (Dcon), Check_Protected => True)
+ then
+ exit Discr_Loop;
-- In the context of a case statement, the expression
-- may have the base type of the discriminant, and we
-- need to preserve the constraint to avoid spurious
-- errors on missing cases.
- if Nkind (Parent (N)) = N_Case_Statement
- and then Etype (Node (E)) /= Etype (D)
+ elsif Nkind (Parent (N)) = N_Case_Statement
+ and then Etype (Node (Dcon)) /= Etype (Disc)
then
Rewrite (N,
Make_Qualified_Expression (Loc,
- Subtype_Mark => New_Occurrence_Of (Etype (D), Loc),
- Expression => New_Copy (Node (E))));
- Analyze (N);
+ Subtype_Mark =>
+ New_Occurrence_Of (Etype (Disc), Loc),
+ Expression =>
+ New_Copy_Tree (Node (Dcon))));
+ Analyze_And_Resolve (N, Etype (Disc));
+
+ -- In case that comes out as a static expression,
+ -- reset it (a selected component is never static).
+
+ Set_Is_Static_Expression (N, False);
+ return;
+
+ -- Otherwise we can just copy the constraint, but the
+ -- result is certainly not static! In some cases the
+ -- discriminant constraint has been analyzed in the
+ -- context of the original subtype indication, but for
+ -- itypes the constraint might not have been analyzed
+ -- yet, and this must be done now.
+
else
- Rewrite (N, New_Copy (Node (E)));
+ Rewrite (N, New_Copy_Tree (Node (Dcon)));
+ Analyze_And_Resolve (N);
+ Set_Is_Static_Expression (N, False);
+ return;
end if;
-
- Set_Is_Static_Expression (N, False);
- return;
end if;
- Next_Elmt (E);
- Next_Discriminant (D);
- end loop;
+ Next_Elmt (Dcon);
+ Next_Discriminant (Disc);
+ end loop Discr_Loop;
- -- Note: the above loop should always terminate, but if
- -- it does not, we just missed an optimization due to
- -- some glitch (perhaps a previous error), so ignore!
- end;
+ -- Note: the above loop should always find a matching
+ -- discriminant, but if it does not, we just missed an
+ -- optimization due to some glitch (perhaps a previous
+ -- error), so ignore.
+
+ end if;
end if;
-- The only remaining processing is in the case of a discriminant of
New_Copy_Tree (P)),
Selector_Name => Make_Identifier (Loc, Chars (Disc)));
- Rewrite (N, New_N);
- Analyze (N);
- end if;
+ Rewrite (N, New_N);
+ Analyze (N);
+ end if;
+ end Expand_N_Selected_Component;
+
+ --------------------
+ -- Expand_N_Slice --
+ --------------------
+
+ procedure Expand_N_Slice (N : Node_Id) is
+ Loc : constant Source_Ptr := Sloc (N);
+ Typ : constant Entity_Id := Etype (N);
+ Pfx : constant Node_Id := Prefix (N);
+ Ptp : Entity_Id := Etype (Pfx);
+
+ function Is_Procedure_Actual (N : Node_Id) return Boolean;
+ -- Check whether the argument is an actual for a procedure call,
+ -- in which case the expansion of a bit-packed slice is deferred
+ -- until the call itself is expanded. The reason this is required
+ -- is that we might have an IN OUT or OUT parameter, and the copy out
+ -- is essential, and that copy out would be missed if we created a
+ -- temporary here in Expand_N_Slice. Note that we don't bother
+ -- to test specifically for an IN OUT or OUT mode parameter, since it
+ -- is a bit tricky to do, and it is harmless to defer expansion
+ -- in the IN case, since the call processing will still generate the
+ -- appropriate copy in operation, which will take care of the slice.
+
+ procedure Make_Temporary;
+ -- Create a named variable for the value of the slice, in
+ -- cases where the back-end cannot handle it properly, e.g.
+ -- when packed types or unaligned slices are involved.
+
+ -------------------------
+ -- Is_Procedure_Actual --
+ -------------------------
+
+ function Is_Procedure_Actual (N : Node_Id) return Boolean is
+ Par : Node_Id := Parent (N);
+
+ begin
+ loop
+ -- If our parent is a procedure call we can return
+
+ if Nkind (Par) = N_Procedure_Call_Statement then
+ return True;
+
+ -- If our parent is a type conversion, keep climbing the
+ -- tree, since a type conversion can be a procedure actual.
+ -- Also keep climbing if parameter association or a qualified
+ -- expression, since these are additional cases that do can
+ -- appear on procedure actuals.
+
+ elsif Nkind (Par) = N_Type_Conversion
+ or else Nkind (Par) = N_Parameter_Association
+ or else Nkind (Par) = N_Qualified_Expression
+ then
+ Par := Parent (Par);
+
+ -- Any other case is not what we are looking for
+
+ else
+ return False;
+ end if;
+ end loop;
+ end Is_Procedure_Actual;
+
+ --------------------
+ -- Make_Temporary --
+ --------------------
+
+ procedure Make_Temporary is
+ Decl : Node_Id;
+ Ent : constant Entity_Id :=
+ Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
+ begin
+ Decl :=
+ Make_Object_Declaration (Loc,
+ Defining_Identifier => Ent,
+ Object_Definition => New_Occurrence_Of (Typ, Loc));
+
+ Set_No_Initialization (Decl);
- end Expand_N_Selected_Component;
+ Insert_Actions (N, New_List (
+ Decl,
+ Make_Assignment_Statement (Loc,
+ Name => New_Occurrence_Of (Ent, Loc),
+ Expression => Relocate_Node (N))));
- --------------------
- -- Expand_N_Slice --
- --------------------
+ Rewrite (N, New_Occurrence_Of (Ent, Loc));
+ Analyze_And_Resolve (N, Typ);
+ end Make_Temporary;
- procedure Expand_N_Slice (N : Node_Id) is
- Loc : constant Source_Ptr := Sloc (N);
- Typ : constant Entity_Id := Etype (N);
- Pfx : constant Node_Id := Prefix (N);
- Ptp : Entity_Id := Etype (Pfx);
- Ent : Entity_Id;
- Decl : Node_Id;
+ -- Start of processing for Expand_N_Slice
begin
-- Special handling for access types
if Is_Access_Type (Ptp) then
- -- Check for explicit dereference required for checked pool
-
- Insert_Dereference_Action (Pfx);
-
- -- If we have an access to a packed array type, then put in an
- -- explicit dereference. We do this in case the slice must be
- -- expanded, and we want to make sure we get an access check.
-
Ptp := Designated_Type (Ptp);
- if Is_Array_Type (Ptp) and then Is_Packed (Ptp) then
- Rewrite (Pfx,
- Make_Explicit_Dereference (Sloc (N),
- Prefix => Relocate_Node (Pfx)));
-
- Analyze_And_Resolve (Pfx, Ptp);
-
- -- The prefix will now carry the Access_Check flag for the back
- -- end, remove it from slice itself.
+ Rewrite (Pfx,
+ Make_Explicit_Dereference (Sloc (N),
+ Prefix => Relocate_Node (Pfx)));
- Set_Do_Access_Check (N, False);
- end if;
+ Analyze_And_Resolve (Pfx, Ptp);
end if;
-- Range checks are potentially also needed for cases involving
-- is caught elsewhere, and the expansion would intefere
-- with generating the error message).
- if Is_Packed (Typ)
- and then Nkind (Parent (N)) /= N_Assignment_Statement
- and then Nkind (Parent (N)) /= N_Indexed_Component
- and then not Is_Renamed_Object (N)
- and then Nkind (Parent (N)) /= N_Procedure_Call_Statement
- and then (Nkind (Parent (N)) /= N_Attribute_Reference
- or else
- Attribute_Name (Parent (N)) /= Name_Address)
- then
- Ent :=
- Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
+ if not Is_Packed (Typ) then
- Decl :=
- Make_Object_Declaration (Loc,
- Defining_Identifier => Ent,
- Object_Definition => New_Occurrence_Of (Typ, Loc));
+ -- Apply transformation for actuals of a function call,
+ -- where Expand_Actuals is not used.
- Set_No_Initialization (Decl);
+ if Nkind (Parent (N)) = N_Function_Call
+ and then Is_Possibly_Unaligned_Slice (N)
+ then
+ Make_Temporary;
+ end if;
- Insert_Actions (N, New_List (
- Decl,
- Make_Assignment_Statement (Loc,
- Name => New_Occurrence_Of (Ent, Loc),
- Expression => Relocate_Node (N))));
+ elsif Nkind (Parent (N)) = N_Assignment_Statement
+ or else (Nkind (Parent (Parent (N))) = N_Assignment_Statement
+ and then Parent (N) = Name (Parent (Parent (N))))
+ then
+ return;
- Rewrite (N, New_Occurrence_Of (Ent, Loc));
- Analyze_And_Resolve (N, Typ);
+ elsif Nkind (Parent (N)) = N_Indexed_Component
+ or else Is_Renamed_Object (N)
+ or else Is_Procedure_Actual (N)
+ then
+ return;
+
+ elsif Nkind (Parent (N)) = N_Attribute_Reference
+ and then Attribute_Name (Parent (N)) = Name_Address
+ then
+ return;
+
+ else
+ Make_Temporary;
end if;
end Expand_N_Slice;
if not Is_Constrained (Target_Type) then
if Has_Discriminants (Operand_Type) then
Disc := First_Discriminant (Operand_Type);
+
+ if Disc /= First_Stored_Discriminant (Operand_Type) then
+ Disc := First_Stored_Discriminant (Operand_Type);
+ end if;
+
Cons := New_List;
while Present (Disc) loop
Append_To (Cons,
Make_Selected_Component (Loc,
- Prefix => Duplicate_Subexpr (Operand),
+ Prefix => Duplicate_Subexpr_Move_Checks (Operand),
Selector_Name =>
Make_Identifier (Loc, Chars (Disc))));
Next_Discriminant (Disc);
Unchecked_Convert_To (Etype (N_Ix),
Make_Attribute_Reference (Loc,
Prefix =>
- Duplicate_Subexpr
+ Duplicate_Subexpr_No_Checks
(Operand, Name_Req => True),
Attribute_Name => Name_First,
Expressions => New_List (
Unchecked_Convert_To (Etype (N_Ix),
Make_Attribute_Reference (Loc,
Prefix =>
- Duplicate_Subexpr
+ Duplicate_Subexpr_No_Checks
(Operand, Name_Req => True),
Attribute_Name => Name_Last,
Expressions => New_List (
-- [constraint_error when Tnn < typ'First or else Tnn > typ'Last]
-- Tnn
+ -- This is necessary when there is a conversion of integer to float
+ -- or to fixed-point to ensure that the correct checks are made. It
+ -- is not necessary for float to float where it is enough to simply
+ -- set the Do_Range_Check flag.
+
procedure Real_Range_Check is
Btyp : constant Entity_Id := Base_Type (Target_Type);
Lo : constant Node_Id := Type_Low_Bound (Target_Type);
Hi : constant Node_Id := Type_High_Bound (Target_Type);
+ Xtyp : constant Entity_Id := Etype (Operand);
Conv : Node_Id;
Tnn : Entity_Id;
-- Nothing to do if expression is an entity on which checks
-- have been suppressed.
- if Is_Entity_Name (Expression (N))
- and then Range_Checks_Suppressed (Entity (Expression (N)))
+ if Is_Entity_Name (Operand)
+ and then Range_Checks_Suppressed (Entity (Operand))
+ then
+ return;
+ end if;
+
+ -- Nothing to do if bounds are all static and we can tell that
+ -- the expression is within the bounds of the target. Note that
+ -- if the operand is of an unconstrained floating-point type,
+ -- then we do not trust it to be in range (might be infinite)
+
+ declare
+ S_Lo : constant Node_Id := Type_Low_Bound (Xtyp);
+ S_Hi : constant Node_Id := Type_High_Bound (Xtyp);
+
+ begin
+ if (not Is_Floating_Point_Type (Xtyp)
+ or else Is_Constrained (Xtyp))
+ and then Compile_Time_Known_Value (S_Lo)
+ and then Compile_Time_Known_Value (S_Hi)
+ and then Compile_Time_Known_Value (Hi)
+ and then Compile_Time_Known_Value (Lo)
+ then
+ declare
+ D_Lov : constant Ureal := Expr_Value_R (Lo);
+ D_Hiv : constant Ureal := Expr_Value_R (Hi);
+ S_Lov : Ureal;
+ S_Hiv : Ureal;
+
+ begin
+ if Is_Real_Type (Xtyp) then
+ S_Lov := Expr_Value_R (S_Lo);
+ S_Hiv := Expr_Value_R (S_Hi);
+ else
+ S_Lov := UR_From_Uint (Expr_Value (S_Lo));
+ S_Hiv := UR_From_Uint (Expr_Value (S_Hi));
+ end if;
+
+ if D_Hiv > D_Lov
+ and then S_Lov >= D_Lov
+ and then S_Hiv <= D_Hiv
+ then
+ Set_Do_Range_Check (Operand, False);
+ return;
+ end if;
+ end;
+ end if;
+ end;
+
+ -- For float to float conversions, we are done
+
+ if Is_Floating_Point_Type (Xtyp)
+ and then
+ Is_Floating_Point_Type (Btyp)
then
return;
end if;
- -- Here we rewrite the conversion as described above
+ -- Otherwise rewrite the conversion as described above
Conv := Relocate_Node (N);
Rewrite
(Subtype_Mark (Conv), New_Occurrence_Of (Btyp, Loc));
Set_Etype (Conv, Btyp);
- -- Skip overflow check for integer to float conversions,
- -- since it is not needed, and in any case gigi generates
- -- incorrect code for such overflow checks ???
+ -- Enable overflow except in the case of integer to float
+ -- conversions, where it is never required, since we can
+ -- never have overflow in this case.
- if not Is_Integer_Type (Etype (Expression (N))) then
- Set_Do_Overflow_Check (Conv, True);
+ if not Is_Integer_Type (Etype (Operand)) then
+ Enable_Overflow_Check (Conv);
end if;
Tnn :=
-- so remove the conversion completely, it is useless.
if Operand_Type = Target_Type then
- Rewrite (N, Relocate_Node (Expression (N)));
+ Rewrite (N, Relocate_Node (Operand));
return;
end if;
Make_And_Then (Loc,
Left_Opnd =>
Make_Op_Ne (Loc,
- Left_Opnd => Duplicate_Subexpr (Operand),
+ Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
Right_Opnd => Make_Null (Loc)),
Right_Opnd =>
Make_Not_In (Loc,
Left_Opnd =>
Make_Explicit_Dereference (Loc,
- Prefix => Duplicate_Subexpr (Operand)),
+ Prefix =>
+ Duplicate_Subexpr_No_Checks (Operand)),
Right_Opnd =>
New_Reference_To (Actual_Target_Type, Loc)));
else
Cond :=
Make_Not_In (Loc,
- Left_Opnd => Duplicate_Subexpr (Operand),
+ Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
Right_Opnd =>
New_Reference_To (Actual_Target_Type, Loc));
end if;
Condition => Cond,
Reason => CE_Tag_Check_Failed));
- Change_Conversion_To_Unchecked (N);
- Analyze_And_Resolve (N, Target_Type);
+ declare
+ Conv : Node_Id;
+ begin
+ Conv :=
+ Make_Unchecked_Type_Conversion (Loc,
+ Subtype_Mark => New_Occurrence_Of (Target_Type, Loc),
+ Expression => Relocate_Node (Expression (N)));
+ Rewrite (N, Conv);
+ Analyze_And_Resolve (N, Target_Type);
+ end;
end if;
end;
-- ityp (x)
- -- with the Float_Truncate flag set. This is clearly more efficient.
+ -- with the Float_Truncate flag set. This is clearly more efficient
if Nkind (Operand) = N_Attribute_Reference
and then Attribute_Name (Operand) = Name_Truncation
-- helpful, but still does not catch all cases with 64-bit integers
-- on targets with only 64-bit floats ???
- if Do_Range_Check (Expression (N)) then
- Rewrite (Expression (N),
+ if Do_Range_Check (Operand) then
+ Rewrite (Operand,
Make_Type_Conversion (Loc,
Subtype_Mark =>
New_Occurrence_Of (Standard_Long_Long_Float, Loc),
Expression =>
- Relocate_Node (Expression (N))));
+ Relocate_Node (Operand)));
- Set_Etype (Expression (N), Standard_Long_Long_Float);
- Enable_Range_Check (Expression (N));
- Set_Do_Range_Check (Expression (Expression (N)), False);
+ Set_Etype (Operand, Standard_Long_Long_Float);
+ Enable_Range_Check (Operand);
+ Set_Do_Range_Check (Expression (Operand), False);
end if;
-- Case of array conversions
-- assignment processing.
elsif Is_Record_Type (Target_Type) then
- Handle_Changed_Representation;
+
+ -- Ada 2005 (AI-216): Program_Error is raised when converting from
+ -- a derived Unchecked_Union type to an unconstrained non-Unchecked_
+ -- Union type if the operand lacks inferable discriminants.
+
+ if Is_Derived_Type (Operand_Type)
+ and then Is_Unchecked_Union (Base_Type (Operand_Type))
+ and then not Is_Constrained (Target_Type)
+ and then not Is_Unchecked_Union (Base_Type (Target_Type))
+ and then not Has_Inferable_Discriminants (Operand)
+ then
+ -- To prevent Gigi from generating illegal code, we make a
+ -- Program_Error node, but we give it the target type of the
+ -- conversion.
+
+ declare
+ PE : constant Node_Id := Make_Raise_Program_Error (Loc,
+ Reason => PE_Unchecked_Union_Restriction);
+
+ begin
+ Set_Etype (PE, Target_Type);
+ Rewrite (N, PE);
+
+ end;
+ else
+ Handle_Changed_Representation;
+ end if;
-- Case of conversions of enumeration types
-- only if Conversion_OK is set, i.e. if the fixed-point values
-- are to be treated as integers.
- -- No other conversions should be passed to Gigi.
+ -- No other conversions should be passed to Gigi
+
+ -- Check: are these rules stated in sinfo??? if so, why restate here???
+
+ -- The only remaining step is to generate a range check if we still
+ -- have a type conversion at this stage and Do_Range_Check is set.
+ -- For now we do this only for conversions of discrete types.
+
+ if Nkind (N) = N_Type_Conversion
+ and then Is_Discrete_Type (Etype (N))
+ then
+ declare
+ Expr : constant Node_Id := Expression (N);
+ Ftyp : Entity_Id;
+ Ityp : Entity_Id;
+
+ begin
+ if Do_Range_Check (Expr)
+ and then Is_Discrete_Type (Etype (Expr))
+ then
+ Set_Do_Range_Check (Expr, False);
+
+ -- Before we do a range check, we have to deal with treating
+ -- a fixed-point operand as an integer. The way we do this
+ -- is simply to do an unchecked conversion to an appropriate
+ -- integer type large enough to hold the result.
+
+ -- This code is not active yet, because we are only dealing
+ -- with discrete types so far ???
+ if Nkind (Expr) in N_Has_Treat_Fixed_As_Integer
+ and then Treat_Fixed_As_Integer (Expr)
+ then
+ Ftyp := Base_Type (Etype (Expr));
+
+ if Esize (Ftyp) >= Esize (Standard_Integer) then
+ Ityp := Standard_Long_Long_Integer;
+ else
+ Ityp := Standard_Integer;
+ end if;
+
+ Rewrite (Expr, Unchecked_Convert_To (Ityp, Expr));
+ end if;
+
+ -- Reset overflow flag, since the range check will include
+ -- dealing with possible overflow, and generate the check
+ -- If Address is either source or target type, suppress
+ -- range check to avoid typing anomalies when it is a visible
+ -- integer type.
+
+ Set_Do_Overflow_Check (N, False);
+ if not Is_Descendent_Of_Address (Etype (Expr))
+ and then not Is_Descendent_Of_Address (Target_Type)
+ then
+ Generate_Range_Check
+ (Expr, Target_Type, CE_Range_Check_Failed);
+ end if;
+ end if;
+ end;
+ end if;
end Expand_N_Type_Conversion;
-----------------------------------
Val <= Expr_Value (Type_High_Bound (Target_Type))
then
Rewrite (N, Make_Integer_Literal (Sloc (N), Val));
- Analyze_And_Resolve (N, Target_Type);
+
+ -- If Address is the target type, just set the type
+ -- to avoid a spurious type error on the literal when
+ -- Address is a visible integer type.
+
+ if Is_Descendent_Of_Address (Target_Type) then
+ Set_Etype (N, Target_Type);
+ else
+ Analyze_And_Resolve (N, Target_Type);
+ end if;
+
return;
end if;
end;
Typ : Entity_Id;
Lhs : Node_Id;
Rhs : Node_Id;
- Bodies : List_Id)
- return Node_Id
+ Bodies : List_Id) return Node_Id
is
Loc : constant Source_Ptr := Sloc (Nod);
+ Result : Node_Id;
+ C : Entity_Id;
+
+ First_Time : Boolean := True;
+
function Suitable_Element (C : Entity_Id) return Entity_Id;
-- Return the first field to compare beginning with C, skipping the
- -- inherited components
+ -- inherited components.
+
+ ----------------------
+ -- Suitable_Element --
+ ----------------------
function Suitable_Element (C : Entity_Id) return Entity_Id is
begin
end if;
end Suitable_Element;
- Result : Node_Id;
- C : Entity_Id;
-
- First_Time : Boolean := True;
-
-- Start of processing for Expand_Record_Equality
begin
- -- Special processing for the unchecked union case, which will occur
- -- only in the context of tagged types and dynamic dispatching, since
- -- other cases are handled statically. We return True, but insert a
- -- raise Program_Error statement.
-
- if Is_Unchecked_Union (Typ) then
-
- -- If this is a component of an enclosing record, return the Raise
- -- statement directly.
-
- if No (Parent (Lhs)) then
- Result :=
- Make_Raise_Program_Error (Loc,
- Reason => PE_Unchecked_Union_Restriction);
- Set_Etype (Result, Standard_Boolean);
- return Result;
-
- else
- Insert_Action (Lhs,
- Make_Raise_Program_Error (Loc,
- Reason => PE_Unchecked_Union_Restriction));
- return New_Occurrence_Of (Standard_True, Loc);
- end if;
- end if;
-
-- Generates the following code: (assuming that Typ has one Discr and
-- component C2 is also a record)
C := Suitable_Element (First_Entity (Typ));
while Present (C) loop
-
declare
New_Lhs : Node_Id;
New_Rhs : Node_Id;
+ Check : Node_Id;
begin
if First_Time then
First_Time := False;
New_Lhs := Lhs;
New_Rhs := Rhs;
-
else
New_Lhs := New_Copy_Tree (Lhs);
New_Rhs := New_Copy_Tree (Rhs);
end if;
- Result :=
- Make_And_Then (Loc,
- Left_Opnd => Result,
- Right_Opnd =>
- Expand_Composite_Equality (Nod, Etype (C),
- Lhs =>
- Make_Selected_Component (Loc,
- Prefix => New_Lhs,
- Selector_Name => New_Reference_To (C, Loc)),
- Rhs =>
- Make_Selected_Component (Loc,
- Prefix => New_Rhs,
- Selector_Name => New_Reference_To (C, Loc)),
- Bodies => Bodies));
+ Check :=
+ Expand_Composite_Equality (Nod, Etype (C),
+ Lhs =>
+ Make_Selected_Component (Loc,
+ Prefix => New_Lhs,
+ Selector_Name => New_Reference_To (C, Loc)),
+ Rhs =>
+ Make_Selected_Component (Loc,
+ Prefix => New_Rhs,
+ Selector_Name => New_Reference_To (C, Loc)),
+ Bodies => Bodies);
+
+ -- If some (sub)component is an unchecked_union, the whole
+ -- operation will raise program error.
+
+ if Nkind (Check) = N_Raise_Program_Error then
+ Result := Check;
+ Set_Etype (Result, Standard_Boolean);
+ exit;
+ else
+ Result :=
+ Make_And_Then (Loc,
+ Left_Opnd => Result,
+ Right_Opnd => Check);
+ end if;
end;
C := Suitable_Element (Next_Entity (C));
end if;
end Fixup_Universal_Fixed_Operation;
+ ------------------------------
+ -- Get_Allocator_Final_List --
+ ------------------------------
+
+ function Get_Allocator_Final_List
+ (N : Node_Id;
+ T : Entity_Id;
+ PtrT : Entity_Id) return Entity_Id
+ is
+ Loc : constant Source_Ptr := Sloc (N);
+
+ Owner : Entity_Id := PtrT;
+ -- The entity whose finalisation list must be used to attach the
+ -- allocated object.
+
+ begin
+ if Ekind (PtrT) = E_Anonymous_Access_Type then
+ if Nkind (Associated_Node_For_Itype (PtrT))
+ in N_Subprogram_Specification
+ then
+ -- If the context is an access parameter, we need to create
+ -- a non-anonymous access type in order to have a usable
+ -- final list, because there is otherwise no pool to which
+ -- the allocated object can belong. We create both the type
+ -- and the finalization chain here, because freezing an
+ -- internal type does not create such a chain. The Final_Chain
+ -- that is thus created is shared by the access parameter.
+
+ Owner := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
+ Insert_Action (N,
+ Make_Full_Type_Declaration (Loc,
+ Defining_Identifier => Owner,
+ Type_Definition =>
+ Make_Access_To_Object_Definition (Loc,
+ Subtype_Indication =>
+ New_Occurrence_Of (T, Loc))));
+
+ Build_Final_List (N, Owner);
+ Set_Associated_Final_Chain (PtrT, Associated_Final_Chain (Owner));
+
+ else
+ -- Case of an access discriminant, or (Ada 2005) of
+ -- an anonymous access component: find the final list
+ -- associated with the scope of the type.
+
+ Owner := Scope (PtrT);
+ end if;
+ end if;
+
+ return Find_Final_List (Owner);
+ end Get_Allocator_Final_List;
+
+ ---------------------------------
+ -- Has_Inferable_Discriminants --
+ ---------------------------------
+
+ function Has_Inferable_Discriminants (N : Node_Id) return Boolean is
+
+ function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean;
+ -- Determines whether the left-most prefix of a selected component is a
+ -- formal parameter in a subprogram. Assumes N is a selected component.
+
+ --------------------------------
+ -- Prefix_Is_Formal_Parameter --
+ --------------------------------
+
+ function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean is
+ Sel_Comp : Node_Id := N;
+
+ begin
+ -- Move to the left-most prefix by climbing up the tree
+
+ while Present (Parent (Sel_Comp))
+ and then Nkind (Parent (Sel_Comp)) = N_Selected_Component
+ loop
+ Sel_Comp := Parent (Sel_Comp);
+ end loop;
+
+ return Ekind (Entity (Prefix (Sel_Comp))) in Formal_Kind;
+ end Prefix_Is_Formal_Parameter;
+
+ -- Start of processing for Has_Inferable_Discriminants
+
+ begin
+ -- For identifiers and indexed components, it is sufficent to have a
+ -- constrained Unchecked_Union nominal subtype.
+
+ if Nkind (N) = N_Identifier
+ or else
+ Nkind (N) = N_Indexed_Component
+ then
+ return Is_Unchecked_Union (Base_Type (Etype (N)))
+ and then
+ Is_Constrained (Etype (N));
+
+ -- For selected components, the subtype of the selector must be a
+ -- constrained Unchecked_Union. If the component is subject to a
+ -- per-object constraint, then the enclosing object must have inferable
+ -- discriminants.
+
+ elsif Nkind (N) = N_Selected_Component then
+ if Has_Per_Object_Constraint (Entity (Selector_Name (N))) then
+
+ -- A small hack. If we have a per-object constrained selected
+ -- component of a formal parameter, return True since we do not
+ -- know the actual parameter association yet.
+
+ if Prefix_Is_Formal_Parameter (N) then
+ return True;
+ end if;
+
+ -- Otherwise, check the enclosing object and the selector
+
+ return Has_Inferable_Discriminants (Prefix (N))
+ and then
+ Has_Inferable_Discriminants (Selector_Name (N));
+ end if;
+
+ -- The call to Has_Inferable_Discriminants will determine whether
+ -- the selector has a constrained Unchecked_Union nominal type.
+
+ return Has_Inferable_Discriminants (Selector_Name (N));
+
+ -- A qualified expression has inferable discriminants if its subtype
+ -- mark is a constrained Unchecked_Union subtype.
+
+ elsif Nkind (N) = N_Qualified_Expression then
+ return Is_Unchecked_Union (Subtype_Mark (N))
+ and then
+ Is_Constrained (Subtype_Mark (N));
+
+ end if;
+
+ return False;
+ end Has_Inferable_Discriminants;
+
-------------------------------
-- Insert_Dereference_Action --
-------------------------------
Loc : constant Source_Ptr := Sloc (N);
Typ : constant Entity_Id := Etype (N);
Pool : constant Entity_Id := Associated_Storage_Pool (Typ);
+ Pnod : constant Node_Id := Parent (N);
function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean;
- -- return true if type of P is derived from Checked_Pool;
+ -- Return true if type of P is derived from Checked_Pool;
+
+ -----------------------------
+ -- Is_Checked_Storage_Pool --
+ -----------------------------
function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean is
T : Entity_Id;
-- Start of processing for Insert_Dereference_Action
begin
- if not Comes_From_Source (Parent (N)) then
- return;
+ pragma Assert (Nkind (Pnod) = N_Explicit_Dereference);
- elsif not Is_Checked_Storage_Pool (Pool) then
+ if not (Is_Checked_Storage_Pool (Pool)
+ and then Comes_From_Source (Original_Node (Pnod)))
+ then
return;
end if;
New_Reference_To (Pool, Loc),
- -- Storage_Address
+ -- Storage_Address. We use the attribute Pool_Address,
+ -- which uses the pointer itself to find the address of
+ -- the object, and which handles unconstrained arrays
+ -- properly by computing the address of the template.
+ -- i.e. the correct address of the corresponding allocation.
Make_Attribute_Reference (Loc,
- Prefix =>
- Make_Explicit_Dereference (Loc, Duplicate_Subexpr (N)),
- Attribute_Name => Name_Address),
+ Prefix => Duplicate_Subexpr_Move_Checks (N),
+ Attribute_Name => Name_Pool_Address),
-- Size_In_Storage_Elements
Left_Opnd =>
Make_Attribute_Reference (Loc,
Prefix =>
- Make_Explicit_Dereference (Loc, Duplicate_Subexpr (N)),
+ Make_Explicit_Dereference (Loc,
+ Duplicate_Subexpr_Move_Checks (N)),
Attribute_Name => Name_Size),
Right_Opnd =>
Make_Integer_Literal (Loc, System_Storage_Unit)),
Make_Attribute_Reference (Loc,
Prefix =>
- Make_Explicit_Dereference (Loc, Duplicate_Subexpr (N)),
+ Make_Explicit_Dereference (Loc,
+ Duplicate_Subexpr_Move_Checks (N)),
Attribute_Name => Name_Alignment))));
+ exception
+ when RE_Not_Available =>
+ return;
end Insert_Dereference_Action;
------------------------------
-- instantiated function itself.
function Make_Array_Comparison_Op
- (Typ : Entity_Id;
- Nod : Node_Id)
- return Node_Id
+ (Typ : Entity_Id;
+ Nod : Node_Id) return Node_Id
is
Loc : constant Source_Ptr := Sloc (Nod);
-- Here typ is the boolean array type
function Make_Boolean_Array_Op
- (Typ : Entity_Id;
- N : Node_Id)
- return Node_Id
+ (Typ : Entity_Id;
+ N : Node_Id) return Node_Id
is
Loc : constant Source_Ptr := Sloc (N);
end if;
end Rewrite_Comparison;
+ ----------------------------
+ -- Safe_In_Place_Array_Op --
+ ----------------------------
+
+ function Safe_In_Place_Array_Op
+ (Lhs : Node_Id;
+ Op1 : Node_Id;
+ Op2 : Node_Id) return Boolean
+ is
+ Target : Entity_Id;
+
+ function Is_Safe_Operand (Op : Node_Id) return Boolean;
+ -- Operand is safe if it cannot overlap part of the target of the
+ -- operation. If the operand and the target are identical, the operand
+ -- is safe. The operand can be empty in the case of negation.
+
+ function Is_Unaliased (N : Node_Id) return Boolean;
+ -- Check that N is a stand-alone entity
+
+ ------------------
+ -- Is_Unaliased --
+ ------------------
+
+ function Is_Unaliased (N : Node_Id) return Boolean is
+ begin
+ return
+ Is_Entity_Name (N)
+ and then No (Address_Clause (Entity (N)))
+ and then No (Renamed_Object (Entity (N)));
+ end Is_Unaliased;
+
+ ---------------------
+ -- Is_Safe_Operand --
+ ---------------------
+
+ function Is_Safe_Operand (Op : Node_Id) return Boolean is
+ begin
+ if No (Op) then
+ return True;
+
+ elsif Is_Entity_Name (Op) then
+ return Is_Unaliased (Op);
+
+ elsif Nkind (Op) = N_Indexed_Component
+ or else Nkind (Op) = N_Selected_Component
+ then
+ return Is_Unaliased (Prefix (Op));
+
+ elsif Nkind (Op) = N_Slice then
+ return
+ Is_Unaliased (Prefix (Op))
+ and then Entity (Prefix (Op)) /= Target;
+
+ elsif Nkind (Op) = N_Op_Not then
+ return Is_Safe_Operand (Right_Opnd (Op));
+
+ else
+ return False;
+ end if;
+ end Is_Safe_Operand;
+
+ -- Start of processing for Is_Safe_In_Place_Array_Op
+
+ begin
+ -- We skip this processing if the component size is not the
+ -- same as a system storage unit (since at least for NOT
+ -- this would cause problems).
+
+ if Component_Size (Etype (Lhs)) /= System_Storage_Unit then
+ return False;
+
+ -- Cannot do in place stuff on Java_VM since cannot pass addresses
+
+ elsif Java_VM then
+ return False;
+
+ -- Cannot do in place stuff if non-standard Boolean representation
+
+ elsif Has_Non_Standard_Rep (Component_Type (Etype (Lhs))) then
+ return False;
+
+ elsif not Is_Unaliased (Lhs) then
+ return False;
+ else
+ Target := Entity (Lhs);
+
+ return
+ Is_Safe_Operand (Op1)
+ and then Is_Safe_Operand (Op2);
+ end if;
+ end Safe_In_Place_Array_Op;
+
-----------------------
-- Tagged_Membership --
-----------------------
Obj_Tag :=
Make_Selected_Component (Loc,
Prefix => Relocate_Node (Left),
- Selector_Name => New_Reference_To (Tag_Component (Left_Type), Loc));
+ Selector_Name =>
+ New_Reference_To (First_Tag_Component (Left_Type), Loc));
if Is_Class_Wide_Type (Right_Type) then
return
Action => CW_Membership,
Args => New_List (
Obj_Tag,
- New_Reference_To (
- Access_Disp_Table (Root_Type (Right_Type)), Loc)));
+ New_Reference_To
+ (Node (First_Elmt
+ (Access_Disp_Table (Root_Type (Right_Type)))),
+ Loc)));
else
return
Make_Op_Eq (Loc,
Left_Opnd => Obj_Tag,
Right_Opnd =>
- New_Reference_To (Access_Disp_Table (Right_Type), Loc));
+ New_Reference_To
+ (Node (First_Elmt (Access_Disp_Table (Right_Type))), Loc));
end if;
end Tagged_Membership;
OSDN Git Service
