1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Checks; use Checks;
28 with Debug; use Debug;
29 with Einfo; use Einfo;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Exp_Aggr; use Exp_Aggr;
33 with Exp_Atag; use Exp_Atag;
34 with Exp_Ch3; use Exp_Ch3;
35 with Exp_Ch6; use Exp_Ch6;
36 with Exp_Ch7; use Exp_Ch7;
37 with Exp_Ch9; use Exp_Ch9;
38 with Exp_Disp; use Exp_Disp;
39 with Exp_Fixd; use Exp_Fixd;
40 with Exp_Pakd; use Exp_Pakd;
41 with Exp_Tss; use Exp_Tss;
42 with Exp_Util; use Exp_Util;
43 with Exp_VFpt; use Exp_VFpt;
44 with Freeze; use Freeze;
45 with Inline; use Inline;
46 with Namet; use Namet;
47 with Nlists; use Nlists;
48 with Nmake; use Nmake;
50 with Restrict; use Restrict;
51 with Rident; use Rident;
52 with Rtsfind; use Rtsfind;
54 with Sem_Aux; use Sem_Aux;
55 with Sem_Cat; use Sem_Cat;
56 with Sem_Ch3; use Sem_Ch3;
57 with Sem_Ch8; use Sem_Ch8;
58 with Sem_Ch13; use Sem_Ch13;
59 with Sem_Eval; use Sem_Eval;
60 with Sem_Res; use Sem_Res;
61 with Sem_SCIL; use Sem_SCIL;
62 with Sem_Type; use Sem_Type;
63 with Sem_Util; use Sem_Util;
64 with Sem_Warn; use Sem_Warn;
65 with Sinfo; use Sinfo;
66 with Snames; use Snames;
67 with Stand; use Stand;
68 with Targparm; use Targparm;
69 with Tbuild; use Tbuild;
70 with Ttypes; use Ttypes;
71 with Uintp; use Uintp;
72 with Urealp; use Urealp;
73 with Validsw; use Validsw;
75 package body Exp_Ch4 is
77 -----------------------
78 -- Local Subprograms --
79 -----------------------
81 procedure Binary_Op_Validity_Checks (N : Node_Id);
82 pragma Inline (Binary_Op_Validity_Checks);
83 -- Performs validity checks for a binary operator
85 procedure Build_Boolean_Array_Proc_Call
89 -- If a boolean array assignment can be done in place, build call to
90 -- corresponding library procedure.
92 procedure Displace_Allocator_Pointer (N : Node_Id);
93 -- Ada 2005 (AI-251): Subsidiary procedure to Expand_N_Allocator and
94 -- Expand_Allocator_Expression. Allocating class-wide interface objects
95 -- this routine displaces the pointer to the allocated object to reference
96 -- the component referencing the corresponding secondary dispatch table.
98 procedure Expand_Allocator_Expression (N : Node_Id);
99 -- Subsidiary to Expand_N_Allocator, for the case when the expression
100 -- is a qualified expression or an aggregate.
102 procedure Expand_Array_Comparison (N : Node_Id);
103 -- This routine handles expansion of the comparison operators (N_Op_Lt,
104 -- N_Op_Le, N_Op_Gt, N_Op_Ge) when operating on an array type. The basic
105 -- code for these operators is similar, differing only in the details of
106 -- the actual comparison call that is made. Special processing (call a
109 function Expand_Array_Equality
114 Typ : Entity_Id) return Node_Id;
115 -- Expand an array equality into a call to a function implementing this
116 -- equality, and a call to it. Loc is the location for the generated nodes.
117 -- Lhs and Rhs are the array expressions to be compared. Bodies is a list
118 -- on which to attach bodies of local functions that are created in the
119 -- process. It is the responsibility of the caller to insert those bodies
120 -- at the right place. Nod provides the Sloc value for the generated code.
121 -- Normally the types used for the generated equality routine are taken
122 -- from Lhs and Rhs. However, in some situations of generated code, the
123 -- Etype fields of Lhs and Rhs are not set yet. In such cases, Typ supplies
124 -- the type to be used for the formal parameters.
126 procedure Expand_Boolean_Operator (N : Node_Id);
127 -- Common expansion processing for Boolean operators (And, Or, Xor) for the
128 -- case of array type arguments.
130 function Expand_Composite_Equality
135 Bodies : List_Id) return Node_Id;
136 -- Local recursive function used to expand equality for nested composite
137 -- types. Used by Expand_Record/Array_Equality, Bodies is a list on which
138 -- to attach bodies of local functions that are created in the process.
139 -- This is the responsibility of the caller to insert those bodies at the
140 -- right place. Nod provides the Sloc value for generated code. Lhs and Rhs
141 -- are the left and right sides for the comparison, and Typ is the type of
142 -- the arrays to compare.
144 procedure Expand_Concatenate (Cnode : Node_Id; Opnds : List_Id);
145 -- Routine to expand concatenation of a sequence of two or more operands
146 -- (in the list Operands) and replace node Cnode with the result of the
147 -- concatenation. The operands can be of any appropriate type, and can
148 -- include both arrays and singleton elements.
150 procedure Fixup_Universal_Fixed_Operation (N : Node_Id);
151 -- N is a N_Op_Divide or N_Op_Multiply node whose result is universal
152 -- fixed. We do not have such a type at runtime, so the purpose of this
153 -- routine is to find the real type by looking up the tree. We also
154 -- determine if the operation must be rounded.
156 function Get_Allocator_Final_List
159 PtrT : Entity_Id) return Entity_Id;
160 -- If the designated type is controlled, build final_list expression for
161 -- created object. If context is an access parameter, create a local access
162 -- type to have a usable finalization list.
164 function Has_Inferable_Discriminants (N : Node_Id) return Boolean;
165 -- Ada 2005 (AI-216): A view of an Unchecked_Union object has inferable
166 -- discriminants if it has a constrained nominal type, unless the object
167 -- is a component of an enclosing Unchecked_Union object that is subject
168 -- to a per-object constraint and the enclosing object lacks inferable
171 -- An expression of an Unchecked_Union type has inferable discriminants
172 -- if it is either a name of an object with inferable discriminants or a
173 -- qualified expression whose subtype mark denotes a constrained subtype.
175 procedure Insert_Dereference_Action (N : Node_Id);
176 -- N is an expression whose type is an access. When the type of the
177 -- associated storage pool is derived from Checked_Pool, generate a
178 -- call to the 'Dereference' primitive operation.
180 function Make_Array_Comparison_Op
182 Nod : Node_Id) return Node_Id;
183 -- Comparisons between arrays are expanded in line. This function produces
184 -- the body of the implementation of (a > b), where a and b are one-
185 -- dimensional arrays of some discrete type. The original node is then
186 -- expanded into the appropriate call to this function. Nod provides the
187 -- Sloc value for the generated code.
189 function Make_Boolean_Array_Op
191 N : Node_Id) return Node_Id;
192 -- Boolean operations on boolean arrays are expanded in line. This function
193 -- produce the body for the node N, which is (a and b), (a or b), or (a xor
194 -- b). It is used only the normal case and not the packed case. The type
195 -- involved, Typ, is the Boolean array type, and the logical operations in
196 -- the body are simple boolean operations. Note that Typ is always a
197 -- constrained type (the caller has ensured this by using
198 -- Convert_To_Actual_Subtype if necessary).
200 procedure Rewrite_Comparison (N : Node_Id);
201 -- If N is the node for a comparison whose outcome can be determined at
202 -- compile time, then the node N can be rewritten with True or False. If
203 -- the outcome cannot be determined at compile time, the call has no
204 -- effect. If N is a type conversion, then this processing is applied to
205 -- its expression. If N is neither comparison nor a type conversion, the
206 -- call has no effect.
208 procedure Tagged_Membership
210 SCIL_Node : out Node_Id;
211 Result : out Node_Id);
212 -- Construct the expression corresponding to the tagged membership test.
213 -- Deals with a second operand being (or not) a class-wide type.
215 function Safe_In_Place_Array_Op
218 Op2 : Node_Id) return Boolean;
219 -- In the context of an assignment, where the right-hand side is a boolean
220 -- operation on arrays, check whether operation can be performed in place.
222 procedure Unary_Op_Validity_Checks (N : Node_Id);
223 pragma Inline (Unary_Op_Validity_Checks);
224 -- Performs validity checks for a unary operator
226 -------------------------------
227 -- Binary_Op_Validity_Checks --
228 -------------------------------
230 procedure Binary_Op_Validity_Checks (N : Node_Id) is
232 if Validity_Checks_On and Validity_Check_Operands then
233 Ensure_Valid (Left_Opnd (N));
234 Ensure_Valid (Right_Opnd (N));
236 end Binary_Op_Validity_Checks;
238 ------------------------------------
239 -- Build_Boolean_Array_Proc_Call --
240 ------------------------------------
242 procedure Build_Boolean_Array_Proc_Call
247 Loc : constant Source_Ptr := Sloc (N);
248 Kind : constant Node_Kind := Nkind (Expression (N));
249 Target : constant Node_Id :=
250 Make_Attribute_Reference (Loc,
252 Attribute_Name => Name_Address);
254 Arg1 : constant Node_Id := Op1;
255 Arg2 : Node_Id := Op2;
257 Proc_Name : Entity_Id;
260 if Kind = N_Op_Not then
261 if Nkind (Op1) in N_Binary_Op then
263 -- Use negated version of the binary operators
265 if Nkind (Op1) = N_Op_And then
266 Proc_Name := RTE (RE_Vector_Nand);
268 elsif Nkind (Op1) = N_Op_Or then
269 Proc_Name := RTE (RE_Vector_Nor);
271 else pragma Assert (Nkind (Op1) = N_Op_Xor);
272 Proc_Name := RTE (RE_Vector_Xor);
276 Make_Procedure_Call_Statement (Loc,
277 Name => New_Occurrence_Of (Proc_Name, Loc),
279 Parameter_Associations => New_List (
281 Make_Attribute_Reference (Loc,
282 Prefix => Left_Opnd (Op1),
283 Attribute_Name => Name_Address),
285 Make_Attribute_Reference (Loc,
286 Prefix => Right_Opnd (Op1),
287 Attribute_Name => Name_Address),
289 Make_Attribute_Reference (Loc,
290 Prefix => Left_Opnd (Op1),
291 Attribute_Name => Name_Length)));
294 Proc_Name := RTE (RE_Vector_Not);
297 Make_Procedure_Call_Statement (Loc,
298 Name => New_Occurrence_Of (Proc_Name, Loc),
299 Parameter_Associations => New_List (
302 Make_Attribute_Reference (Loc,
304 Attribute_Name => Name_Address),
306 Make_Attribute_Reference (Loc,
308 Attribute_Name => Name_Length)));
312 -- We use the following equivalences:
314 -- (not X) or (not Y) = not (X and Y) = Nand (X, Y)
315 -- (not X) and (not Y) = not (X or Y) = Nor (X, Y)
316 -- (not X) xor (not Y) = X xor Y
317 -- X xor (not Y) = not (X xor Y) = Nxor (X, Y)
319 if Nkind (Op1) = N_Op_Not then
320 if Kind = N_Op_And then
321 Proc_Name := RTE (RE_Vector_Nor);
323 elsif Kind = N_Op_Or then
324 Proc_Name := RTE (RE_Vector_Nand);
327 Proc_Name := RTE (RE_Vector_Xor);
331 if Kind = N_Op_And then
332 Proc_Name := RTE (RE_Vector_And);
334 elsif Kind = N_Op_Or then
335 Proc_Name := RTE (RE_Vector_Or);
337 elsif Nkind (Op2) = N_Op_Not then
338 Proc_Name := RTE (RE_Vector_Nxor);
339 Arg2 := Right_Opnd (Op2);
342 Proc_Name := RTE (RE_Vector_Xor);
347 Make_Procedure_Call_Statement (Loc,
348 Name => New_Occurrence_Of (Proc_Name, Loc),
349 Parameter_Associations => New_List (
351 Make_Attribute_Reference (Loc,
353 Attribute_Name => Name_Address),
354 Make_Attribute_Reference (Loc,
356 Attribute_Name => Name_Address),
357 Make_Attribute_Reference (Loc,
359 Attribute_Name => Name_Length)));
362 Rewrite (N, Call_Node);
366 when RE_Not_Available =>
368 end Build_Boolean_Array_Proc_Call;
370 --------------------------------
371 -- Displace_Allocator_Pointer --
372 --------------------------------
374 procedure Displace_Allocator_Pointer (N : Node_Id) is
375 Loc : constant Source_Ptr := Sloc (N);
376 Orig_Node : constant Node_Id := Original_Node (N);
382 -- Do nothing in case of VM targets: the virtual machine will handle
383 -- interfaces directly.
385 if not Tagged_Type_Expansion then
389 pragma Assert (Nkind (N) = N_Identifier
390 and then Nkind (Orig_Node) = N_Allocator);
392 PtrT := Etype (Orig_Node);
393 Dtyp := Available_View (Designated_Type (PtrT));
394 Etyp := Etype (Expression (Orig_Node));
396 if Is_Class_Wide_Type (Dtyp)
397 and then Is_Interface (Dtyp)
399 -- If the type of the allocator expression is not an interface type
400 -- we can generate code to reference the record component containing
401 -- the pointer to the secondary dispatch table.
403 if not Is_Interface (Etyp) then
405 Saved_Typ : constant Entity_Id := Etype (Orig_Node);
408 -- 1) Get access to the allocated object
411 Make_Explicit_Dereference (Loc,
416 -- 2) Add the conversion to displace the pointer to reference
417 -- the secondary dispatch table.
419 Rewrite (N, Convert_To (Dtyp, Relocate_Node (N)));
420 Analyze_And_Resolve (N, Dtyp);
422 -- 3) The 'access to the secondary dispatch table will be used
423 -- as the value returned by the allocator.
426 Make_Attribute_Reference (Loc,
427 Prefix => Relocate_Node (N),
428 Attribute_Name => Name_Access));
429 Set_Etype (N, Saved_Typ);
433 -- If the type of the allocator expression is an interface type we
434 -- generate a run-time call to displace "this" to reference the
435 -- component containing the pointer to the secondary dispatch table
436 -- or else raise Constraint_Error if the actual object does not
437 -- implement the target interface. This case corresponds with the
438 -- following example:
440 -- function Op (Obj : Iface_1'Class) return access Iface_2'Class is
442 -- return new Iface_2'Class'(Obj);
447 Unchecked_Convert_To (PtrT,
448 Make_Function_Call (Loc,
449 Name => New_Reference_To (RTE (RE_Displace), Loc),
450 Parameter_Associations => New_List (
451 Unchecked_Convert_To (RTE (RE_Address),
457 (Access_Disp_Table (Etype (Base_Type (Dtyp))))),
459 Analyze_And_Resolve (N, PtrT);
462 end Displace_Allocator_Pointer;
464 ---------------------------------
465 -- Expand_Allocator_Expression --
466 ---------------------------------
468 procedure Expand_Allocator_Expression (N : Node_Id) is
469 Loc : constant Source_Ptr := Sloc (N);
470 Exp : constant Node_Id := Expression (Expression (N));
471 PtrT : constant Entity_Id := Etype (N);
472 DesigT : constant Entity_Id := Designated_Type (PtrT);
474 procedure Apply_Accessibility_Check
476 Built_In_Place : Boolean := False);
477 -- Ada 2005 (AI-344): For an allocator with a class-wide designated
478 -- type, generate an accessibility check to verify that the level of the
479 -- type of the created object is not deeper than the level of the access
480 -- type. If the type of the qualified expression is class- wide, then
481 -- always generate the check (except in the case where it is known to be
482 -- unnecessary, see comment below). Otherwise, only generate the check
483 -- if the level of the qualified expression type is statically deeper
484 -- than the access type.
486 -- Although the static accessibility will generally have been performed
487 -- as a legality check, it won't have been done in cases where the
488 -- allocator appears in generic body, so a run-time check is needed in
489 -- general. One special case is when the access type is declared in the
490 -- same scope as the class-wide allocator, in which case the check can
491 -- never fail, so it need not be generated.
493 -- As an open issue, there seem to be cases where the static level
494 -- associated with the class-wide object's underlying type is not
495 -- sufficient to perform the proper accessibility check, such as for
496 -- allocators in nested subprograms or accept statements initialized by
497 -- class-wide formals when the actual originates outside at a deeper
498 -- static level. The nested subprogram case might require passing
499 -- accessibility levels along with class-wide parameters, and the task
500 -- case seems to be an actual gap in the language rules that needs to
501 -- be fixed by the ARG. ???
503 -------------------------------
504 -- Apply_Accessibility_Check --
505 -------------------------------
507 procedure Apply_Accessibility_Check
509 Built_In_Place : Boolean := False)
514 -- Note: we skip the accessibility check for the VM case, since
515 -- there does not seem to be any practical way of implementing it.
517 if Ada_Version >= Ada_05
518 and then Tagged_Type_Expansion
519 and then Is_Class_Wide_Type (DesigT)
520 and then not Scope_Suppress (Accessibility_Check)
522 (Type_Access_Level (Etype (Exp)) > Type_Access_Level (PtrT)
524 (Is_Class_Wide_Type (Etype (Exp))
525 and then Scope (PtrT) /= Current_Scope))
527 -- If the allocator was built in place Ref is already a reference
528 -- to the access object initialized to the result of the allocator
529 -- (see Exp_Ch6.Make_Build_In_Place_Call_In_Allocator). Otherwise
530 -- it is the entity associated with the object containing the
531 -- address of the allocated object.
533 if Built_In_Place then
534 Ref_Node := New_Copy (Ref);
536 Ref_Node := New_Reference_To (Ref, Loc);
540 Make_Raise_Program_Error (Loc,
544 Build_Get_Access_Level (Loc,
545 Make_Attribute_Reference (Loc,
547 Attribute_Name => Name_Tag)),
549 Make_Integer_Literal (Loc,
550 Type_Access_Level (PtrT))),
551 Reason => PE_Accessibility_Check_Failed));
553 end Apply_Accessibility_Check;
557 Indic : constant Node_Id := Subtype_Mark (Expression (N));
558 T : constant Entity_Id := Entity (Indic);
563 TagT : Entity_Id := Empty;
564 -- Type used as source for tag assignment
566 TagR : Node_Id := Empty;
567 -- Target reference for tag assignment
569 Aggr_In_Place : constant Boolean := Is_Delayed_Aggregate (Exp);
571 Tag_Assign : Node_Id;
574 -- Start of processing for Expand_Allocator_Expression
577 if Is_Tagged_Type (T) or else Needs_Finalization (T) then
579 if Is_CPP_Constructor_Call (Exp) then
582 -- Pnnn : constant ptr_T := new (T); Init (Pnnn.all,...); Pnnn
584 -- Allocate the object with no expression
586 Node := Relocate_Node (N);
587 Set_Expression (Node, New_Reference_To (Etype (Exp), Loc));
589 -- Avoid its expansion to avoid generating a call to the default
594 Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
597 Make_Object_Declaration (Loc,
598 Defining_Identifier => Temp,
599 Constant_Present => True,
600 Object_Definition => New_Reference_To (PtrT, Loc),
601 Expression => Node));
603 Apply_Accessibility_Check (Temp);
605 -- Locate the enclosing list and insert the C++ constructor call
612 while not Is_List_Member (P) loop
616 Insert_List_After_And_Analyze (P,
617 Build_Initialization_Call (Loc,
619 Make_Explicit_Dereference (Loc,
620 Prefix => New_Reference_To (Temp, Loc)),
622 Constructor_Ref => Exp));
625 Rewrite (N, New_Reference_To (Temp, Loc));
626 Analyze_And_Resolve (N, PtrT);
630 -- Ada 2005 (AI-318-02): If the initialization expression is a call
631 -- to a build-in-place function, then access to the allocated object
632 -- must be passed to the function. Currently we limit such functions
633 -- to those with constrained limited result subtypes, but eventually
634 -- we plan to expand the allowed forms of functions that are treated
635 -- as build-in-place.
637 if Ada_Version >= Ada_05
638 and then Is_Build_In_Place_Function_Call (Exp)
640 Make_Build_In_Place_Call_In_Allocator (N, Exp);
641 Apply_Accessibility_Check (N, Built_In_Place => True);
645 -- Actions inserted before:
646 -- Temp : constant ptr_T := new T'(Expression);
647 -- <no CW> Temp._tag := T'tag;
648 -- <CTRL> Adjust (Finalizable (Temp.all));
649 -- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
651 -- We analyze by hand the new internal allocator to avoid
652 -- any recursion and inappropriate call to Initialize
654 -- We don't want to remove side effects when the expression must be
655 -- built in place. In the case of a build-in-place function call,
656 -- that could lead to a duplication of the call, which was already
657 -- substituted for the allocator.
659 if not Aggr_In_Place then
660 Remove_Side_Effects (Exp);
664 Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
666 -- For a class wide allocation generate the following code:
668 -- type Equiv_Record is record ... end record;
669 -- implicit subtype CW is <Class_Wide_Subytpe>;
670 -- temp : PtrT := new CW'(CW!(expr));
672 if Is_Class_Wide_Type (T) then
673 Expand_Subtype_From_Expr (Empty, T, Indic, Exp);
675 -- Ada 2005 (AI-251): If the expression is a class-wide interface
676 -- object we generate code to move up "this" to reference the
677 -- base of the object before allocating the new object.
679 -- Note that Exp'Address is recursively expanded into a call
680 -- to Base_Address (Exp.Tag)
682 if Is_Class_Wide_Type (Etype (Exp))
683 and then Is_Interface (Etype (Exp))
684 and then Tagged_Type_Expansion
688 Unchecked_Convert_To (Entity (Indic),
689 Make_Explicit_Dereference (Loc,
690 Unchecked_Convert_To (RTE (RE_Tag_Ptr),
691 Make_Attribute_Reference (Loc,
693 Attribute_Name => Name_Address)))));
698 Unchecked_Convert_To (Entity (Indic), Exp));
701 Analyze_And_Resolve (Expression (N), Entity (Indic));
704 -- Keep separate the management of allocators returning interfaces
706 if not Is_Interface (Directly_Designated_Type (PtrT)) then
707 if Aggr_In_Place then
709 Make_Object_Declaration (Loc,
710 Defining_Identifier => Temp,
711 Object_Definition => New_Reference_To (PtrT, Loc),
714 New_Reference_To (Etype (Exp), Loc)));
716 -- Copy the Comes_From_Source flag for the allocator we just
717 -- built, since logically this allocator is a replacement of
718 -- the original allocator node. This is for proper handling of
719 -- restriction No_Implicit_Heap_Allocations.
721 Set_Comes_From_Source
722 (Expression (Tmp_Node), Comes_From_Source (N));
724 Set_No_Initialization (Expression (Tmp_Node));
725 Insert_Action (N, Tmp_Node);
727 if Needs_Finalization (T)
728 and then Ekind (PtrT) = E_Anonymous_Access_Type
730 -- Create local finalization list for access parameter
732 Flist := Get_Allocator_Final_List (N, Base_Type (T), PtrT);
735 Convert_Aggr_In_Allocator (N, Tmp_Node, Exp);
738 Node := Relocate_Node (N);
741 Make_Object_Declaration (Loc,
742 Defining_Identifier => Temp,
743 Constant_Present => True,
744 Object_Definition => New_Reference_To (PtrT, Loc),
745 Expression => Node));
748 -- Ada 2005 (AI-251): Handle allocators whose designated type is an
749 -- interface type. In this case we use the type of the qualified
750 -- expression to allocate the object.
754 Def_Id : constant Entity_Id :=
755 Make_Defining_Identifier (Loc,
756 New_Internal_Name ('T'));
761 Make_Full_Type_Declaration (Loc,
762 Defining_Identifier => Def_Id,
764 Make_Access_To_Object_Definition (Loc,
766 Null_Exclusion_Present => False,
767 Constant_Present => False,
768 Subtype_Indication =>
769 New_Reference_To (Etype (Exp), Loc)));
771 Insert_Action (N, New_Decl);
773 -- Inherit the final chain to ensure that the expansion of the
774 -- aggregate is correct in case of controlled types
776 if Needs_Finalization (Directly_Designated_Type (PtrT)) then
777 Set_Associated_Final_Chain (Def_Id,
778 Associated_Final_Chain (PtrT));
781 -- Declare the object using the previous type declaration
783 if Aggr_In_Place then
785 Make_Object_Declaration (Loc,
786 Defining_Identifier => Temp,
787 Object_Definition => New_Reference_To (Def_Id, Loc),
790 New_Reference_To (Etype (Exp), Loc)));
792 -- Copy the Comes_From_Source flag for the allocator we just
793 -- built, since logically this allocator is a replacement of
794 -- the original allocator node. This is for proper handling
795 -- of restriction No_Implicit_Heap_Allocations.
797 Set_Comes_From_Source
798 (Expression (Tmp_Node), Comes_From_Source (N));
800 Set_No_Initialization (Expression (Tmp_Node));
801 Insert_Action (N, Tmp_Node);
803 if Needs_Finalization (T)
804 and then Ekind (PtrT) = E_Anonymous_Access_Type
806 -- Create local finalization list for access parameter
809 Get_Allocator_Final_List (N, Base_Type (T), PtrT);
812 Convert_Aggr_In_Allocator (N, Tmp_Node, Exp);
814 Node := Relocate_Node (N);
817 Make_Object_Declaration (Loc,
818 Defining_Identifier => Temp,
819 Constant_Present => True,
820 Object_Definition => New_Reference_To (Def_Id, Loc),
821 Expression => Node));
824 -- Generate an additional object containing the address of the
825 -- returned object. The type of this second object declaration
826 -- is the correct type required for the common processing that
827 -- is still performed by this subprogram. The displacement of
828 -- this pointer to reference the component associated with the
829 -- interface type will be done at the end of common processing.
832 Make_Object_Declaration (Loc,
833 Defining_Identifier => Make_Defining_Identifier (Loc,
834 New_Internal_Name ('P')),
835 Object_Definition => New_Reference_To (PtrT, Loc),
836 Expression => Unchecked_Convert_To (PtrT,
837 New_Reference_To (Temp, Loc)));
839 Insert_Action (N, New_Decl);
841 Tmp_Node := New_Decl;
842 Temp := Defining_Identifier (New_Decl);
846 Apply_Accessibility_Check (Temp);
848 -- Generate the tag assignment
850 -- Suppress the tag assignment when VM_Target because VM tags are
851 -- represented implicitly in objects.
853 if not Tagged_Type_Expansion then
856 -- Ada 2005 (AI-251): Suppress the tag assignment with class-wide
857 -- interface objects because in this case the tag does not change.
859 elsif Is_Interface (Directly_Designated_Type (Etype (N))) then
860 pragma Assert (Is_Class_Wide_Type
861 (Directly_Designated_Type (Etype (N))));
864 elsif Is_Tagged_Type (T) and then not Is_Class_Wide_Type (T) then
866 TagR := New_Reference_To (Temp, Loc);
868 elsif Is_Private_Type (T)
869 and then Is_Tagged_Type (Underlying_Type (T))
871 TagT := Underlying_Type (T);
873 Unchecked_Convert_To (Underlying_Type (T),
874 Make_Explicit_Dereference (Loc,
875 Prefix => New_Reference_To (Temp, Loc)));
878 if Present (TagT) then
880 Make_Assignment_Statement (Loc,
882 Make_Selected_Component (Loc,
885 New_Reference_To (First_Tag_Component (TagT), Loc)),
888 Unchecked_Convert_To (RTE (RE_Tag),
890 (Elists.Node (First_Elmt (Access_Disp_Table (TagT))),
893 -- The previous assignment has to be done in any case
895 Set_Assignment_OK (Name (Tag_Assign));
896 Insert_Action (N, Tag_Assign);
899 if Needs_Finalization (DesigT)
900 and then Needs_Finalization (T)
904 Apool : constant Entity_Id :=
905 Associated_Storage_Pool (PtrT);
908 -- If it is an allocation on the secondary stack (i.e. a value
909 -- returned from a function), the object is attached on the
910 -- caller side as soon as the call is completed (see
911 -- Expand_Ctrl_Function_Call)
913 if Is_RTE (Apool, RE_SS_Pool) then
915 F : constant Entity_Id :=
916 Make_Defining_Identifier (Loc,
917 New_Internal_Name ('F'));
920 Make_Object_Declaration (Loc,
921 Defining_Identifier => F,
922 Object_Definition => New_Reference_To (RTE
923 (RE_Finalizable_Ptr), Loc)));
925 Flist := New_Reference_To (F, Loc);
926 Attach := Make_Integer_Literal (Loc, 1);
929 -- Normal case, not a secondary stack allocation
932 if Needs_Finalization (T)
933 and then Ekind (PtrT) = E_Anonymous_Access_Type
935 -- Create local finalization list for access parameter
938 Get_Allocator_Final_List (N, Base_Type (T), PtrT);
940 Flist := Find_Final_List (PtrT);
943 Attach := Make_Integer_Literal (Loc, 2);
946 -- Generate an Adjust call if the object will be moved. In Ada
947 -- 2005, the object may be inherently limited, in which case
948 -- there is no Adjust procedure, and the object is built in
949 -- place. In Ada 95, the object can be limited but not
950 -- inherently limited if this allocator came from a return
951 -- statement (we're allocating the result on the secondary
952 -- stack). In that case, the object will be moved, so we _do_
956 and then not Is_Inherently_Limited_Type (T)
962 -- An unchecked conversion is needed in the classwide
963 -- case because the designated type can be an ancestor of
964 -- the subtype mark of the allocator.
966 Unchecked_Convert_To (T,
967 Make_Explicit_Dereference (Loc,
968 Prefix => New_Reference_To (Temp, Loc))),
972 With_Attach => Attach,
978 Rewrite (N, New_Reference_To (Temp, Loc));
979 Analyze_And_Resolve (N, PtrT);
981 -- Ada 2005 (AI-251): Displace the pointer to reference the record
982 -- component containing the secondary dispatch table of the interface
985 if Is_Interface (Directly_Designated_Type (PtrT)) then
986 Displace_Allocator_Pointer (N);
989 elsif Aggr_In_Place then
991 Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
993 Make_Object_Declaration (Loc,
994 Defining_Identifier => Temp,
995 Object_Definition => New_Reference_To (PtrT, Loc),
996 Expression => Make_Allocator (Loc,
997 New_Reference_To (Etype (Exp), Loc)));
999 -- Copy the Comes_From_Source flag for the allocator we just built,
1000 -- since logically this allocator is a replacement of the original
1001 -- allocator node. This is for proper handling of restriction
1002 -- No_Implicit_Heap_Allocations.
1004 Set_Comes_From_Source
1005 (Expression (Tmp_Node), Comes_From_Source (N));
1007 Set_No_Initialization (Expression (Tmp_Node));
1008 Insert_Action (N, Tmp_Node);
1009 Convert_Aggr_In_Allocator (N, Tmp_Node, Exp);
1010 Rewrite (N, New_Reference_To (Temp, Loc));
1011 Analyze_And_Resolve (N, PtrT);
1013 elsif Is_Access_Type (T)
1014 and then Can_Never_Be_Null (T)
1016 Install_Null_Excluding_Check (Exp);
1018 elsif Is_Access_Type (DesigT)
1019 and then Nkind (Exp) = N_Allocator
1020 and then Nkind (Expression (Exp)) /= N_Qualified_Expression
1022 -- Apply constraint to designated subtype indication
1024 Apply_Constraint_Check (Expression (Exp),
1025 Designated_Type (DesigT),
1026 No_Sliding => True);
1028 if Nkind (Expression (Exp)) = N_Raise_Constraint_Error then
1030 -- Propagate constraint_error to enclosing allocator
1032 Rewrite (Exp, New_Copy (Expression (Exp)));
1036 -- type A is access T1;
1037 -- X : A := new T2'(...);
1038 -- T1 and T2 can be different subtypes, and we might need to check
1039 -- both constraints. First check against the type of the qualified
1042 Apply_Constraint_Check (Exp, T, No_Sliding => True);
1044 if Do_Range_Check (Exp) then
1045 Set_Do_Range_Check (Exp, False);
1046 Generate_Range_Check (Exp, DesigT, CE_Range_Check_Failed);
1049 -- A check is also needed in cases where the designated subtype is
1050 -- constrained and differs from the subtype given in the qualified
1051 -- expression. Note that the check on the qualified expression does
1052 -- not allow sliding, but this check does (a relaxation from Ada 83).
1054 if Is_Constrained (DesigT)
1055 and then not Subtypes_Statically_Match (T, DesigT)
1057 Apply_Constraint_Check
1058 (Exp, DesigT, No_Sliding => False);
1060 if Do_Range_Check (Exp) then
1061 Set_Do_Range_Check (Exp, False);
1062 Generate_Range_Check (Exp, DesigT, CE_Range_Check_Failed);
1066 -- For an access to unconstrained packed array, GIGI needs to see an
1067 -- expression with a constrained subtype in order to compute the
1068 -- proper size for the allocator.
1070 if Is_Array_Type (T)
1071 and then not Is_Constrained (T)
1072 and then Is_Packed (T)
1075 ConstrT : constant Entity_Id :=
1076 Make_Defining_Identifier (Loc,
1077 Chars => New_Internal_Name ('A'));
1078 Internal_Exp : constant Node_Id := Relocate_Node (Exp);
1081 Make_Subtype_Declaration (Loc,
1082 Defining_Identifier => ConstrT,
1083 Subtype_Indication =>
1084 Make_Subtype_From_Expr (Exp, T)));
1085 Freeze_Itype (ConstrT, Exp);
1086 Rewrite (Exp, OK_Convert_To (ConstrT, Internal_Exp));
1090 -- Ada 2005 (AI-318-02): If the initialization expression is a call
1091 -- to a build-in-place function, then access to the allocated object
1092 -- must be passed to the function. Currently we limit such functions
1093 -- to those with constrained limited result subtypes, but eventually
1094 -- we plan to expand the allowed forms of functions that are treated
1095 -- as build-in-place.
1097 if Ada_Version >= Ada_05
1098 and then Is_Build_In_Place_Function_Call (Exp)
1100 Make_Build_In_Place_Call_In_Allocator (N, Exp);
1105 when RE_Not_Available =>
1107 end Expand_Allocator_Expression;
1109 -----------------------------
1110 -- Expand_Array_Comparison --
1111 -----------------------------
1113 -- Expansion is only required in the case of array types. For the unpacked
1114 -- case, an appropriate runtime routine is called. For packed cases, and
1115 -- also in some other cases where a runtime routine cannot be called, the
1116 -- form of the expansion is:
1118 -- [body for greater_nn; boolean_expression]
1120 -- The body is built by Make_Array_Comparison_Op, and the form of the
1121 -- Boolean expression depends on the operator involved.
1123 procedure Expand_Array_Comparison (N : Node_Id) is
1124 Loc : constant Source_Ptr := Sloc (N);
1125 Op1 : Node_Id := Left_Opnd (N);
1126 Op2 : Node_Id := Right_Opnd (N);
1127 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
1128 Ctyp : constant Entity_Id := Component_Type (Typ1);
1131 Func_Body : Node_Id;
1132 Func_Name : Entity_Id;
1136 Byte_Addressable : constant Boolean := System_Storage_Unit = Byte'Size;
1137 -- True for byte addressable target
1139 function Length_Less_Than_4 (Opnd : Node_Id) return Boolean;
1140 -- Returns True if the length of the given operand is known to be less
1141 -- than 4. Returns False if this length is known to be four or greater
1142 -- or is not known at compile time.
1144 ------------------------
1145 -- Length_Less_Than_4 --
1146 ------------------------
1148 function Length_Less_Than_4 (Opnd : Node_Id) return Boolean is
1149 Otyp : constant Entity_Id := Etype (Opnd);
1152 if Ekind (Otyp) = E_String_Literal_Subtype then
1153 return String_Literal_Length (Otyp) < 4;
1157 Ityp : constant Entity_Id := Etype (First_Index (Otyp));
1158 Lo : constant Node_Id := Type_Low_Bound (Ityp);
1159 Hi : constant Node_Id := Type_High_Bound (Ityp);
1164 if Compile_Time_Known_Value (Lo) then
1165 Lov := Expr_Value (Lo);
1170 if Compile_Time_Known_Value (Hi) then
1171 Hiv := Expr_Value (Hi);
1176 return Hiv < Lov + 3;
1179 end Length_Less_Than_4;
1181 -- Start of processing for Expand_Array_Comparison
1184 -- Deal first with unpacked case, where we can call a runtime routine
1185 -- except that we avoid this for targets for which are not addressable
1186 -- by bytes, and for the JVM/CIL, since they do not support direct
1187 -- addressing of array components.
1189 if not Is_Bit_Packed_Array (Typ1)
1190 and then Byte_Addressable
1191 and then VM_Target = No_VM
1193 -- The call we generate is:
1195 -- Compare_Array_xn[_Unaligned]
1196 -- (left'address, right'address, left'length, right'length) <op> 0
1198 -- x = U for unsigned, S for signed
1199 -- n = 8,16,32,64 for component size
1200 -- Add _Unaligned if length < 4 and component size is 8.
1201 -- <op> is the standard comparison operator
1203 if Component_Size (Typ1) = 8 then
1204 if Length_Less_Than_4 (Op1)
1206 Length_Less_Than_4 (Op2)
1208 if Is_Unsigned_Type (Ctyp) then
1209 Comp := RE_Compare_Array_U8_Unaligned;
1211 Comp := RE_Compare_Array_S8_Unaligned;
1215 if Is_Unsigned_Type (Ctyp) then
1216 Comp := RE_Compare_Array_U8;
1218 Comp := RE_Compare_Array_S8;
1222 elsif Component_Size (Typ1) = 16 then
1223 if Is_Unsigned_Type (Ctyp) then
1224 Comp := RE_Compare_Array_U16;
1226 Comp := RE_Compare_Array_S16;
1229 elsif Component_Size (Typ1) = 32 then
1230 if Is_Unsigned_Type (Ctyp) then
1231 Comp := RE_Compare_Array_U32;
1233 Comp := RE_Compare_Array_S32;
1236 else pragma Assert (Component_Size (Typ1) = 64);
1237 if Is_Unsigned_Type (Ctyp) then
1238 Comp := RE_Compare_Array_U64;
1240 Comp := RE_Compare_Array_S64;
1244 Remove_Side_Effects (Op1, Name_Req => True);
1245 Remove_Side_Effects (Op2, Name_Req => True);
1248 Make_Function_Call (Sloc (Op1),
1249 Name => New_Occurrence_Of (RTE (Comp), Loc),
1251 Parameter_Associations => New_List (
1252 Make_Attribute_Reference (Loc,
1253 Prefix => Relocate_Node (Op1),
1254 Attribute_Name => Name_Address),
1256 Make_Attribute_Reference (Loc,
1257 Prefix => Relocate_Node (Op2),
1258 Attribute_Name => Name_Address),
1260 Make_Attribute_Reference (Loc,
1261 Prefix => Relocate_Node (Op1),
1262 Attribute_Name => Name_Length),
1264 Make_Attribute_Reference (Loc,
1265 Prefix => Relocate_Node (Op2),
1266 Attribute_Name => Name_Length))));
1269 Make_Integer_Literal (Sloc (Op2),
1272 Analyze_And_Resolve (Op1, Standard_Integer);
1273 Analyze_And_Resolve (Op2, Standard_Integer);
1277 -- Cases where we cannot make runtime call
1279 -- For (a <= b) we convert to not (a > b)
1281 if Chars (N) = Name_Op_Le then
1287 Right_Opnd => Op2)));
1288 Analyze_And_Resolve (N, Standard_Boolean);
1291 -- For < the Boolean expression is
1292 -- greater__nn (op2, op1)
1294 elsif Chars (N) = Name_Op_Lt then
1295 Func_Body := Make_Array_Comparison_Op (Typ1, N);
1299 Op1 := Right_Opnd (N);
1300 Op2 := Left_Opnd (N);
1302 -- For (a >= b) we convert to not (a < b)
1304 elsif Chars (N) = Name_Op_Ge then
1310 Right_Opnd => Op2)));
1311 Analyze_And_Resolve (N, Standard_Boolean);
1314 -- For > the Boolean expression is
1315 -- greater__nn (op1, op2)
1318 pragma Assert (Chars (N) = Name_Op_Gt);
1319 Func_Body := Make_Array_Comparison_Op (Typ1, N);
1322 Func_Name := Defining_Unit_Name (Specification (Func_Body));
1324 Make_Function_Call (Loc,
1325 Name => New_Reference_To (Func_Name, Loc),
1326 Parameter_Associations => New_List (Op1, Op2));
1328 Insert_Action (N, Func_Body);
1330 Analyze_And_Resolve (N, Standard_Boolean);
1333 when RE_Not_Available =>
1335 end Expand_Array_Comparison;
1337 ---------------------------
1338 -- Expand_Array_Equality --
1339 ---------------------------
1341 -- Expand an equality function for multi-dimensional arrays. Here is an
1342 -- example of such a function for Nb_Dimension = 2
1344 -- function Enn (A : atyp; B : btyp) return boolean is
1346 -- if (A'length (1) = 0 or else A'length (2) = 0)
1348 -- (B'length (1) = 0 or else B'length (2) = 0)
1350 -- return True; -- RM 4.5.2(22)
1353 -- if A'length (1) /= B'length (1)
1355 -- A'length (2) /= B'length (2)
1357 -- return False; -- RM 4.5.2(23)
1361 -- A1 : Index_T1 := A'first (1);
1362 -- B1 : Index_T1 := B'first (1);
1366 -- A2 : Index_T2 := A'first (2);
1367 -- B2 : Index_T2 := B'first (2);
1370 -- if A (A1, A2) /= B (B1, B2) then
1374 -- exit when A2 = A'last (2);
1375 -- A2 := Index_T2'succ (A2);
1376 -- B2 := Index_T2'succ (B2);
1380 -- exit when A1 = A'last (1);
1381 -- A1 := Index_T1'succ (A1);
1382 -- B1 := Index_T1'succ (B1);
1389 -- Note on the formal types used (atyp and btyp). If either of the arrays
1390 -- is of a private type, we use the underlying type, and do an unchecked
1391 -- conversion of the actual. If either of the arrays has a bound depending
1392 -- on a discriminant, then we use the base type since otherwise we have an
1393 -- escaped discriminant in the function.
1395 -- If both arrays are constrained and have the same bounds, we can generate
1396 -- a loop with an explicit iteration scheme using a 'Range attribute over
1399 function Expand_Array_Equality
1404 Typ : Entity_Id) return Node_Id
1406 Loc : constant Source_Ptr := Sloc (Nod);
1407 Decls : constant List_Id := New_List;
1408 Index_List1 : constant List_Id := New_List;
1409 Index_List2 : constant List_Id := New_List;
1413 Func_Name : Entity_Id;
1414 Func_Body : Node_Id;
1416 A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA);
1417 B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB);
1421 -- The parameter types to be used for the formals
1426 Num : Int) return Node_Id;
1427 -- This builds the attribute reference Arr'Nam (Expr)
1429 function Component_Equality (Typ : Entity_Id) return Node_Id;
1430 -- Create one statement to compare corresponding components, designated
1431 -- by a full set of indices.
1433 function Get_Arg_Type (N : Node_Id) return Entity_Id;
1434 -- Given one of the arguments, computes the appropriate type to be used
1435 -- for that argument in the corresponding function formal
1437 function Handle_One_Dimension
1439 Index : Node_Id) return Node_Id;
1440 -- This procedure returns the following code
1443 -- Bn : Index_T := B'First (N);
1447 -- exit when An = A'Last (N);
1448 -- An := Index_T'Succ (An)
1449 -- Bn := Index_T'Succ (Bn)
1453 -- If both indices are constrained and identical, the procedure
1454 -- returns a simpler loop:
1456 -- for An in A'Range (N) loop
1460 -- N is the dimension for which we are generating a loop. Index is the
1461 -- N'th index node, whose Etype is Index_Type_n in the above code. The
1462 -- xxx statement is either the loop or declare for the next dimension
1463 -- or if this is the last dimension the comparison of corresponding
1464 -- components of the arrays.
1466 -- The actual way the code works is to return the comparison of
1467 -- corresponding components for the N+1 call. That's neater!
1469 function Test_Empty_Arrays return Node_Id;
1470 -- This function constructs the test for both arrays being empty
1471 -- (A'length (1) = 0 or else A'length (2) = 0 or else ...)
1473 -- (B'length (1) = 0 or else B'length (2) = 0 or else ...)
1475 function Test_Lengths_Correspond return Node_Id;
1476 -- This function constructs the test for arrays having different lengths
1477 -- in at least one index position, in which case the resulting code is:
1479 -- A'length (1) /= B'length (1)
1481 -- A'length (2) /= B'length (2)
1492 Num : Int) return Node_Id
1496 Make_Attribute_Reference (Loc,
1497 Attribute_Name => Nam,
1498 Prefix => New_Reference_To (Arr, Loc),
1499 Expressions => New_List (Make_Integer_Literal (Loc, Num)));
1502 ------------------------
1503 -- Component_Equality --
1504 ------------------------
1506 function Component_Equality (Typ : Entity_Id) return Node_Id is
1511 -- if a(i1...) /= b(j1...) then return false; end if;
1514 Make_Indexed_Component (Loc,
1515 Prefix => Make_Identifier (Loc, Chars (A)),
1516 Expressions => Index_List1);
1519 Make_Indexed_Component (Loc,
1520 Prefix => Make_Identifier (Loc, Chars (B)),
1521 Expressions => Index_List2);
1523 Test := Expand_Composite_Equality
1524 (Nod, Component_Type (Typ), L, R, Decls);
1526 -- If some (sub)component is an unchecked_union, the whole operation
1527 -- will raise program error.
1529 if Nkind (Test) = N_Raise_Program_Error then
1531 -- This node is going to be inserted at a location where a
1532 -- statement is expected: clear its Etype so analysis will set
1533 -- it to the expected Standard_Void_Type.
1535 Set_Etype (Test, Empty);
1540 Make_Implicit_If_Statement (Nod,
1541 Condition => Make_Op_Not (Loc, Right_Opnd => Test),
1542 Then_Statements => New_List (
1543 Make_Simple_Return_Statement (Loc,
1544 Expression => New_Occurrence_Of (Standard_False, Loc))));
1546 end Component_Equality;
1552 function Get_Arg_Type (N : Node_Id) return Entity_Id is
1563 T := Underlying_Type (T);
1565 X := First_Index (T);
1566 while Present (X) loop
1567 if Denotes_Discriminant (Type_Low_Bound (Etype (X)))
1569 Denotes_Discriminant (Type_High_Bound (Etype (X)))
1582 --------------------------
1583 -- Handle_One_Dimension --
1584 ---------------------------
1586 function Handle_One_Dimension
1588 Index : Node_Id) return Node_Id
1590 Need_Separate_Indexes : constant Boolean :=
1592 or else not Is_Constrained (Ltyp);
1593 -- If the index types are identical, and we are working with
1594 -- constrained types, then we can use the same index for both
1597 An : constant Entity_Id := Make_Defining_Identifier (Loc,
1598 Chars => New_Internal_Name ('A'));
1601 Index_T : Entity_Id;
1606 if N > Number_Dimensions (Ltyp) then
1607 return Component_Equality (Ltyp);
1610 -- Case where we generate a loop
1612 Index_T := Base_Type (Etype (Index));
1614 if Need_Separate_Indexes then
1616 Make_Defining_Identifier (Loc,
1617 Chars => New_Internal_Name ('B'));
1622 Append (New_Reference_To (An, Loc), Index_List1);
1623 Append (New_Reference_To (Bn, Loc), Index_List2);
1625 Stm_List := New_List (
1626 Handle_One_Dimension (N + 1, Next_Index (Index)));
1628 if Need_Separate_Indexes then
1630 -- Generate guard for loop, followed by increments of indices
1632 Append_To (Stm_List,
1633 Make_Exit_Statement (Loc,
1636 Left_Opnd => New_Reference_To (An, Loc),
1637 Right_Opnd => Arr_Attr (A, Name_Last, N))));
1639 Append_To (Stm_List,
1640 Make_Assignment_Statement (Loc,
1641 Name => New_Reference_To (An, Loc),
1643 Make_Attribute_Reference (Loc,
1644 Prefix => New_Reference_To (Index_T, Loc),
1645 Attribute_Name => Name_Succ,
1646 Expressions => New_List (New_Reference_To (An, Loc)))));
1648 Append_To (Stm_List,
1649 Make_Assignment_Statement (Loc,
1650 Name => New_Reference_To (Bn, Loc),
1652 Make_Attribute_Reference (Loc,
1653 Prefix => New_Reference_To (Index_T, Loc),
1654 Attribute_Name => Name_Succ,
1655 Expressions => New_List (New_Reference_To (Bn, Loc)))));
1658 -- If separate indexes, we need a declare block for An and Bn, and a
1659 -- loop without an iteration scheme.
1661 if Need_Separate_Indexes then
1663 Make_Implicit_Loop_Statement (Nod, Statements => Stm_List);
1666 Make_Block_Statement (Loc,
1667 Declarations => New_List (
1668 Make_Object_Declaration (Loc,
1669 Defining_Identifier => An,
1670 Object_Definition => New_Reference_To (Index_T, Loc),
1671 Expression => Arr_Attr (A, Name_First, N)),
1673 Make_Object_Declaration (Loc,
1674 Defining_Identifier => Bn,
1675 Object_Definition => New_Reference_To (Index_T, Loc),
1676 Expression => Arr_Attr (B, Name_First, N))),
1678 Handled_Statement_Sequence =>
1679 Make_Handled_Sequence_Of_Statements (Loc,
1680 Statements => New_List (Loop_Stm)));
1682 -- If no separate indexes, return loop statement with explicit
1683 -- iteration scheme on its own
1687 Make_Implicit_Loop_Statement (Nod,
1688 Statements => Stm_List,
1690 Make_Iteration_Scheme (Loc,
1691 Loop_Parameter_Specification =>
1692 Make_Loop_Parameter_Specification (Loc,
1693 Defining_Identifier => An,
1694 Discrete_Subtype_Definition =>
1695 Arr_Attr (A, Name_Range, N))));
1698 end Handle_One_Dimension;
1700 -----------------------
1701 -- Test_Empty_Arrays --
1702 -----------------------
1704 function Test_Empty_Arrays return Node_Id is
1714 for J in 1 .. Number_Dimensions (Ltyp) loop
1717 Left_Opnd => Arr_Attr (A, Name_Length, J),
1718 Right_Opnd => Make_Integer_Literal (Loc, 0));
1722 Left_Opnd => Arr_Attr (B, Name_Length, J),
1723 Right_Opnd => Make_Integer_Literal (Loc, 0));
1732 Left_Opnd => Relocate_Node (Alist),
1733 Right_Opnd => Atest);
1737 Left_Opnd => Relocate_Node (Blist),
1738 Right_Opnd => Btest);
1745 Right_Opnd => Blist);
1746 end Test_Empty_Arrays;
1748 -----------------------------
1749 -- Test_Lengths_Correspond --
1750 -----------------------------
1752 function Test_Lengths_Correspond return Node_Id is
1758 for J in 1 .. Number_Dimensions (Ltyp) loop
1761 Left_Opnd => Arr_Attr (A, Name_Length, J),
1762 Right_Opnd => Arr_Attr (B, Name_Length, J));
1769 Left_Opnd => Relocate_Node (Result),
1770 Right_Opnd => Rtest);
1775 end Test_Lengths_Correspond;
1777 -- Start of processing for Expand_Array_Equality
1780 Ltyp := Get_Arg_Type (Lhs);
1781 Rtyp := Get_Arg_Type (Rhs);
1783 -- For now, if the argument types are not the same, go to the base type,
1784 -- since the code assumes that the formals have the same type. This is
1785 -- fixable in future ???
1787 if Ltyp /= Rtyp then
1788 Ltyp := Base_Type (Ltyp);
1789 Rtyp := Base_Type (Rtyp);
1790 pragma Assert (Ltyp = Rtyp);
1793 -- Build list of formals for function
1795 Formals := New_List (
1796 Make_Parameter_Specification (Loc,
1797 Defining_Identifier => A,
1798 Parameter_Type => New_Reference_To (Ltyp, Loc)),
1800 Make_Parameter_Specification (Loc,
1801 Defining_Identifier => B,
1802 Parameter_Type => New_Reference_To (Rtyp, Loc)));
1804 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('E'));
1806 -- Build statement sequence for function
1809 Make_Subprogram_Body (Loc,
1811 Make_Function_Specification (Loc,
1812 Defining_Unit_Name => Func_Name,
1813 Parameter_Specifications => Formals,
1814 Result_Definition => New_Reference_To (Standard_Boolean, Loc)),
1816 Declarations => Decls,
1818 Handled_Statement_Sequence =>
1819 Make_Handled_Sequence_Of_Statements (Loc,
1820 Statements => New_List (
1822 Make_Implicit_If_Statement (Nod,
1823 Condition => Test_Empty_Arrays,
1824 Then_Statements => New_List (
1825 Make_Simple_Return_Statement (Loc,
1827 New_Occurrence_Of (Standard_True, Loc)))),
1829 Make_Implicit_If_Statement (Nod,
1830 Condition => Test_Lengths_Correspond,
1831 Then_Statements => New_List (
1832 Make_Simple_Return_Statement (Loc,
1834 New_Occurrence_Of (Standard_False, Loc)))),
1836 Handle_One_Dimension (1, First_Index (Ltyp)),
1838 Make_Simple_Return_Statement (Loc,
1839 Expression => New_Occurrence_Of (Standard_True, Loc)))));
1841 Set_Has_Completion (Func_Name, True);
1842 Set_Is_Inlined (Func_Name);
1844 -- If the array type is distinct from the type of the arguments, it
1845 -- is the full view of a private type. Apply an unchecked conversion
1846 -- to insure that analysis of the call succeeds.
1856 or else Base_Type (Etype (Lhs)) /= Base_Type (Ltyp)
1858 L := OK_Convert_To (Ltyp, Lhs);
1862 or else Base_Type (Etype (Rhs)) /= Base_Type (Rtyp)
1864 R := OK_Convert_To (Rtyp, Rhs);
1867 Actuals := New_List (L, R);
1870 Append_To (Bodies, Func_Body);
1873 Make_Function_Call (Loc,
1874 Name => New_Reference_To (Func_Name, Loc),
1875 Parameter_Associations => Actuals);
1876 end Expand_Array_Equality;
1878 -----------------------------
1879 -- Expand_Boolean_Operator --
1880 -----------------------------
1882 -- Note that we first get the actual subtypes of the operands, since we
1883 -- always want to deal with types that have bounds.
1885 procedure Expand_Boolean_Operator (N : Node_Id) is
1886 Typ : constant Entity_Id := Etype (N);
1889 -- Special case of bit packed array where both operands are known to be
1890 -- properly aligned. In this case we use an efficient run time routine
1891 -- to carry out the operation (see System.Bit_Ops).
1893 if Is_Bit_Packed_Array (Typ)
1894 and then not Is_Possibly_Unaligned_Object (Left_Opnd (N))
1895 and then not Is_Possibly_Unaligned_Object (Right_Opnd (N))
1897 Expand_Packed_Boolean_Operator (N);
1901 -- For the normal non-packed case, the general expansion is to build
1902 -- function for carrying out the comparison (use Make_Boolean_Array_Op)
1903 -- and then inserting it into the tree. The original operator node is
1904 -- then rewritten as a call to this function. We also use this in the
1905 -- packed case if either operand is a possibly unaligned object.
1908 Loc : constant Source_Ptr := Sloc (N);
1909 L : constant Node_Id := Relocate_Node (Left_Opnd (N));
1910 R : constant Node_Id := Relocate_Node (Right_Opnd (N));
1911 Func_Body : Node_Id;
1912 Func_Name : Entity_Id;
1915 Convert_To_Actual_Subtype (L);
1916 Convert_To_Actual_Subtype (R);
1917 Ensure_Defined (Etype (L), N);
1918 Ensure_Defined (Etype (R), N);
1919 Apply_Length_Check (R, Etype (L));
1921 if Nkind (N) = N_Op_Xor then
1922 Silly_Boolean_Array_Xor_Test (N, Etype (L));
1925 if Nkind (Parent (N)) = N_Assignment_Statement
1926 and then Safe_In_Place_Array_Op (Name (Parent (N)), L, R)
1928 Build_Boolean_Array_Proc_Call (Parent (N), L, R);
1930 elsif Nkind (Parent (N)) = N_Op_Not
1931 and then Nkind (N) = N_Op_And
1933 Safe_In_Place_Array_Op (Name (Parent (Parent (N))), L, R)
1938 Func_Body := Make_Boolean_Array_Op (Etype (L), N);
1939 Func_Name := Defining_Unit_Name (Specification (Func_Body));
1940 Insert_Action (N, Func_Body);
1942 -- Now rewrite the expression with a call
1945 Make_Function_Call (Loc,
1946 Name => New_Reference_To (Func_Name, Loc),
1947 Parameter_Associations =>
1950 Make_Type_Conversion
1951 (Loc, New_Reference_To (Etype (L), Loc), R))));
1953 Analyze_And_Resolve (N, Typ);
1956 end Expand_Boolean_Operator;
1958 -------------------------------
1959 -- Expand_Composite_Equality --
1960 -------------------------------
1962 -- This function is only called for comparing internal fields of composite
1963 -- types when these fields are themselves composites. This is a special
1964 -- case because it is not possible to respect normal Ada visibility rules.
1966 function Expand_Composite_Equality
1971 Bodies : List_Id) return Node_Id
1973 Loc : constant Source_Ptr := Sloc (Nod);
1974 Full_Type : Entity_Id;
1979 if Is_Private_Type (Typ) then
1980 Full_Type := Underlying_Type (Typ);
1985 -- Defense against malformed private types with no completion the error
1986 -- will be diagnosed later by check_completion
1988 if No (Full_Type) then
1989 return New_Reference_To (Standard_False, Loc);
1992 Full_Type := Base_Type (Full_Type);
1994 if Is_Array_Type (Full_Type) then
1996 -- If the operand is an elementary type other than a floating-point
1997 -- type, then we can simply use the built-in block bitwise equality,
1998 -- since the predefined equality operators always apply and bitwise
1999 -- equality is fine for all these cases.
2001 if Is_Elementary_Type (Component_Type (Full_Type))
2002 and then not Is_Floating_Point_Type (Component_Type (Full_Type))
2004 return Make_Op_Eq (Loc, Left_Opnd => Lhs, Right_Opnd => Rhs);
2006 -- For composite component types, and floating-point types, use the
2007 -- expansion. This deals with tagged component types (where we use
2008 -- the applicable equality routine) and floating-point, (where we
2009 -- need to worry about negative zeroes), and also the case of any
2010 -- composite type recursively containing such fields.
2013 return Expand_Array_Equality (Nod, Lhs, Rhs, Bodies, Full_Type);
2016 elsif Is_Tagged_Type (Full_Type) then
2018 -- Call the primitive operation "=" of this type
2020 if Is_Class_Wide_Type (Full_Type) then
2021 Full_Type := Root_Type (Full_Type);
2024 -- If this is derived from an untagged private type completed with a
2025 -- tagged type, it does not have a full view, so we use the primitive
2026 -- operations of the private type. This check should no longer be
2027 -- necessary when these types receive their full views ???
2029 if Is_Private_Type (Typ)
2030 and then not Is_Tagged_Type (Typ)
2031 and then not Is_Controlled (Typ)
2032 and then Is_Derived_Type (Typ)
2033 and then No (Full_View (Typ))
2035 Prim := First_Elmt (Collect_Primitive_Operations (Typ));
2037 Prim := First_Elmt (Primitive_Operations (Full_Type));
2041 Eq_Op := Node (Prim);
2042 exit when Chars (Eq_Op) = Name_Op_Eq
2043 and then Etype (First_Formal (Eq_Op)) =
2044 Etype (Next_Formal (First_Formal (Eq_Op)))
2045 and then Base_Type (Etype (Eq_Op)) = Standard_Boolean;
2047 pragma Assert (Present (Prim));
2050 Eq_Op := Node (Prim);
2053 Make_Function_Call (Loc,
2054 Name => New_Reference_To (Eq_Op, Loc),
2055 Parameter_Associations =>
2057 (Unchecked_Convert_To (Etype (First_Formal (Eq_Op)), Lhs),
2058 Unchecked_Convert_To (Etype (First_Formal (Eq_Op)), Rhs)));
2060 elsif Is_Record_Type (Full_Type) then
2061 Eq_Op := TSS (Full_Type, TSS_Composite_Equality);
2063 if Present (Eq_Op) then
2064 if Etype (First_Formal (Eq_Op)) /= Full_Type then
2066 -- Inherited equality from parent type. Convert the actuals to
2067 -- match signature of operation.
2070 T : constant Entity_Id := Etype (First_Formal (Eq_Op));
2074 Make_Function_Call (Loc,
2075 Name => New_Reference_To (Eq_Op, Loc),
2076 Parameter_Associations =>
2077 New_List (OK_Convert_To (T, Lhs),
2078 OK_Convert_To (T, Rhs)));
2082 -- Comparison between Unchecked_Union components
2084 if Is_Unchecked_Union (Full_Type) then
2086 Lhs_Type : Node_Id := Full_Type;
2087 Rhs_Type : Node_Id := Full_Type;
2088 Lhs_Discr_Val : Node_Id;
2089 Rhs_Discr_Val : Node_Id;
2094 if Nkind (Lhs) = N_Selected_Component then
2095 Lhs_Type := Etype (Entity (Selector_Name (Lhs)));
2100 if Nkind (Rhs) = N_Selected_Component then
2101 Rhs_Type := Etype (Entity (Selector_Name (Rhs)));
2104 -- Lhs of the composite equality
2106 if Is_Constrained (Lhs_Type) then
2108 -- Since the enclosing record type can never be an
2109 -- Unchecked_Union (this code is executed for records
2110 -- that do not have variants), we may reference its
2113 if Nkind (Lhs) = N_Selected_Component
2114 and then Has_Per_Object_Constraint (
2115 Entity (Selector_Name (Lhs)))
2118 Make_Selected_Component (Loc,
2119 Prefix => Prefix (Lhs),
2122 Get_Discriminant_Value (
2123 First_Discriminant (Lhs_Type),
2125 Stored_Constraint (Lhs_Type))));
2128 Lhs_Discr_Val := New_Copy (
2129 Get_Discriminant_Value (
2130 First_Discriminant (Lhs_Type),
2132 Stored_Constraint (Lhs_Type)));
2136 -- It is not possible to infer the discriminant since
2137 -- the subtype is not constrained.
2140 Make_Raise_Program_Error (Loc,
2141 Reason => PE_Unchecked_Union_Restriction);
2144 -- Rhs of the composite equality
2146 if Is_Constrained (Rhs_Type) then
2147 if Nkind (Rhs) = N_Selected_Component
2148 and then Has_Per_Object_Constraint (
2149 Entity (Selector_Name (Rhs)))
2152 Make_Selected_Component (Loc,
2153 Prefix => Prefix (Rhs),
2156 Get_Discriminant_Value (
2157 First_Discriminant (Rhs_Type),
2159 Stored_Constraint (Rhs_Type))));
2162 Rhs_Discr_Val := New_Copy (
2163 Get_Discriminant_Value (
2164 First_Discriminant (Rhs_Type),
2166 Stored_Constraint (Rhs_Type)));
2171 Make_Raise_Program_Error (Loc,
2172 Reason => PE_Unchecked_Union_Restriction);
2175 -- Call the TSS equality function with the inferred
2176 -- discriminant values.
2179 Make_Function_Call (Loc,
2180 Name => New_Reference_To (Eq_Op, Loc),
2181 Parameter_Associations => New_List (
2189 -- Shouldn't this be an else, we can't fall through the above
2193 Make_Function_Call (Loc,
2194 Name => New_Reference_To (Eq_Op, Loc),
2195 Parameter_Associations => New_List (Lhs, Rhs));
2199 return Expand_Record_Equality (Nod, Full_Type, Lhs, Rhs, Bodies);
2203 -- It can be a simple record or the full view of a scalar private
2205 return Make_Op_Eq (Loc, Left_Opnd => Lhs, Right_Opnd => Rhs);
2207 end Expand_Composite_Equality;
2209 ------------------------
2210 -- Expand_Concatenate --
2211 ------------------------
2213 procedure Expand_Concatenate (Cnode : Node_Id; Opnds : List_Id) is
2214 Loc : constant Source_Ptr := Sloc (Cnode);
2216 Atyp : constant Entity_Id := Base_Type (Etype (Cnode));
2217 -- Result type of concatenation
2219 Ctyp : constant Entity_Id := Base_Type (Component_Type (Etype (Cnode)));
2220 -- Component type. Elements of this component type can appear as one
2221 -- of the operands of concatenation as well as arrays.
2223 Istyp : constant Entity_Id := Etype (First_Index (Atyp));
2226 Ityp : constant Entity_Id := Base_Type (Istyp);
2227 -- Index type. This is the base type of the index subtype, and is used
2228 -- for all computed bounds (which may be out of range of Istyp in the
2229 -- case of null ranges).
2232 -- This is the type we use to do arithmetic to compute the bounds and
2233 -- lengths of operands. The choice of this type is a little subtle and
2234 -- is discussed in a separate section at the start of the body code.
2236 Concatenation_Error : exception;
2237 -- Raised if concatenation is sure to raise a CE
2239 Result_May_Be_Null : Boolean := True;
2240 -- Reset to False if at least one operand is encountered which is known
2241 -- at compile time to be non-null. Used for handling the special case
2242 -- of setting the high bound to the last operand high bound for a null
2243 -- result, thus ensuring a proper high bound in the super-flat case.
2245 N : constant Nat := List_Length (Opnds);
2246 -- Number of concatenation operands including possibly null operands
2249 -- Number of operands excluding any known to be null, except that the
2250 -- last operand is always retained, in case it provides the bounds for
2254 -- Current operand being processed in the loop through operands. After
2255 -- this loop is complete, always contains the last operand (which is not
2256 -- the same as Operands (NN), since null operands are skipped).
2258 -- Arrays describing the operands, only the first NN entries of each
2259 -- array are set (NN < N when we exclude known null operands).
2261 Is_Fixed_Length : array (1 .. N) of Boolean;
2262 -- True if length of corresponding operand known at compile time
2264 Operands : array (1 .. N) of Node_Id;
2265 -- Set to the corresponding entry in the Opnds list (but note that null
2266 -- operands are excluded, so not all entries in the list are stored).
2268 Fixed_Length : array (1 .. N) of Uint;
2269 -- Set to length of operand. Entries in this array are set only if the
2270 -- corresponding entry in Is_Fixed_Length is True.
2272 Opnd_Low_Bound : array (1 .. N) of Node_Id;
2273 -- Set to lower bound of operand. Either an integer literal in the case
2274 -- where the bound is known at compile time, else actual lower bound.
2275 -- The operand low bound is of type Ityp.
2277 Var_Length : array (1 .. N) of Entity_Id;
2278 -- Set to an entity of type Natural that contains the length of an
2279 -- operand whose length is not known at compile time. Entries in this
2280 -- array are set only if the corresponding entry in Is_Fixed_Length
2281 -- is False. The entity is of type Artyp.
2283 Aggr_Length : array (0 .. N) of Node_Id;
2284 -- The J'th entry in an expression node that represents the total length
2285 -- of operands 1 through J. It is either an integer literal node, or a
2286 -- reference to a constant entity with the right value, so it is fine
2287 -- to just do a Copy_Node to get an appropriate copy. The extra zero'th
2288 -- entry always is set to zero. The length is of type Artyp.
2290 Low_Bound : Node_Id;
2291 -- A tree node representing the low bound of the result (of type Ityp).
2292 -- This is either an integer literal node, or an identifier reference to
2293 -- a constant entity initialized to the appropriate value.
2295 Last_Opnd_High_Bound : Node_Id;
2296 -- A tree node representing the high bound of the last operand. This
2297 -- need only be set if the result could be null. It is used for the
2298 -- special case of setting the right high bound for a null result.
2299 -- This is of type Ityp.
2301 High_Bound : Node_Id;
2302 -- A tree node representing the high bound of the result (of type Ityp)
2305 -- Result of the concatenation (of type Ityp)
2307 Actions : constant List_Id := New_List;
2308 -- Collect actions to be inserted if Save_Space is False
2310 Save_Space : Boolean;
2311 pragma Warnings (Off, Save_Space);
2312 -- Set to True if we are saving generated code space by calling routines
2313 -- in packages System.Concat_n.
2315 Known_Non_Null_Operand_Seen : Boolean;
2316 -- Set True during generation of the assignements of operands into
2317 -- result once an operand known to be non-null has been seen.
2319 function Make_Artyp_Literal (Val : Nat) return Node_Id;
2320 -- This function makes an N_Integer_Literal node that is returned in
2321 -- analyzed form with the type set to Artyp. Importantly this literal
2322 -- is not flagged as static, so that if we do computations with it that
2323 -- result in statically detected out of range conditions, we will not
2324 -- generate error messages but instead warning messages.
2326 function To_Artyp (X : Node_Id) return Node_Id;
2327 -- Given a node of type Ityp, returns the corresponding value of type
2328 -- Artyp. For non-enumeration types, this is a plain integer conversion.
2329 -- For enum types, the Pos of the value is returned.
2331 function To_Ityp (X : Node_Id) return Node_Id;
2332 -- The inverse function (uses Val in the case of enumeration types)
2334 ------------------------
2335 -- Make_Artyp_Literal --
2336 ------------------------
2338 function Make_Artyp_Literal (Val : Nat) return Node_Id is
2339 Result : constant Node_Id := Make_Integer_Literal (Loc, Val);
2341 Set_Etype (Result, Artyp);
2342 Set_Analyzed (Result, True);
2343 Set_Is_Static_Expression (Result, False);
2345 end Make_Artyp_Literal;
2351 function To_Artyp (X : Node_Id) return Node_Id is
2353 if Ityp = Base_Type (Artyp) then
2356 elsif Is_Enumeration_Type (Ityp) then
2358 Make_Attribute_Reference (Loc,
2359 Prefix => New_Occurrence_Of (Ityp, Loc),
2360 Attribute_Name => Name_Pos,
2361 Expressions => New_List (X));
2364 return Convert_To (Artyp, X);
2372 function To_Ityp (X : Node_Id) return Node_Id is
2374 if Is_Enumeration_Type (Ityp) then
2376 Make_Attribute_Reference (Loc,
2377 Prefix => New_Occurrence_Of (Ityp, Loc),
2378 Attribute_Name => Name_Val,
2379 Expressions => New_List (X));
2381 -- Case where we will do a type conversion
2384 if Ityp = Base_Type (Artyp) then
2387 return Convert_To (Ityp, X);
2392 -- Local Declarations
2394 Opnd_Typ : Entity_Id;
2402 -- Choose an appropriate computational type
2404 -- We will be doing calculations of lengths and bounds in this routine
2405 -- and computing one from the other in some cases, e.g. getting the high
2406 -- bound by adding the length-1 to the low bound.
2408 -- We can't just use the index type, or even its base type for this
2409 -- purpose for two reasons. First it might be an enumeration type which
2410 -- is not suitable fo computations of any kind, and second it may simply
2411 -- not have enough range. For example if the index type is -128..+127
2412 -- then lengths can be up to 256, which is out of range of the type.
2414 -- For enumeration types, we can simply use Standard_Integer, this is
2415 -- sufficient since the actual number of enumeration literals cannot
2416 -- possibly exceed the range of integer (remember we will be doing the
2417 -- arithmetic with POS values, not representation values).
2419 if Is_Enumeration_Type (Ityp) then
2420 Artyp := Standard_Integer;
2422 -- If index type is Positive, we use the standard unsigned type, to give
2423 -- more room on the top of the range, obviating the need for an overflow
2424 -- check when creating the upper bound. This is needed to avoid junk
2425 -- overflow checks in the common case of String types.
2427 -- ??? Disabled for now
2429 -- elsif Istyp = Standard_Positive then
2430 -- Artyp := Standard_Unsigned;
2432 -- For modular types, we use a 32-bit modular type for types whose size
2433 -- is in the range 1-31 bits. For 32-bit unsigned types, we use the
2434 -- identity type, and for larger unsigned types we use 64-bits.
2436 elsif Is_Modular_Integer_Type (Ityp) then
2437 if RM_Size (Ityp) < RM_Size (Standard_Unsigned) then
2438 Artyp := Standard_Unsigned;
2439 elsif RM_Size (Ityp) = RM_Size (Standard_Unsigned) then
2442 Artyp := RTE (RE_Long_Long_Unsigned);
2445 -- Similar treatment for signed types
2448 if RM_Size (Ityp) < RM_Size (Standard_Integer) then
2449 Artyp := Standard_Integer;
2450 elsif RM_Size (Ityp) = RM_Size (Standard_Integer) then
2453 Artyp := Standard_Long_Long_Integer;
2457 -- Supply dummy entry at start of length array
2459 Aggr_Length (0) := Make_Artyp_Literal (0);
2461 -- Go through operands setting up the above arrays
2465 Opnd := Remove_Head (Opnds);
2466 Opnd_Typ := Etype (Opnd);
2468 -- The parent got messed up when we put the operands in a list,
2469 -- so now put back the proper parent for the saved operand.
2471 Set_Parent (Opnd, Parent (Cnode));
2473 -- Set will be True when we have setup one entry in the array
2477 -- Singleton element (or character literal) case
2479 if Base_Type (Opnd_Typ) = Ctyp then
2481 Operands (NN) := Opnd;
2482 Is_Fixed_Length (NN) := True;
2483 Fixed_Length (NN) := Uint_1;
2484 Result_May_Be_Null := False;
2486 -- Set low bound of operand (no need to set Last_Opnd_High_Bound
2487 -- since we know that the result cannot be null).
2489 Opnd_Low_Bound (NN) :=
2490 Make_Attribute_Reference (Loc,
2491 Prefix => New_Reference_To (Istyp, Loc),
2492 Attribute_Name => Name_First);
2496 -- String literal case (can only occur for strings of course)
2498 elsif Nkind (Opnd) = N_String_Literal then
2499 Len := String_Literal_Length (Opnd_Typ);
2502 Result_May_Be_Null := False;
2505 -- Capture last operand high bound if result could be null
2507 if J = N and then Result_May_Be_Null then
2508 Last_Opnd_High_Bound :=
2511 New_Copy_Tree (String_Literal_Low_Bound (Opnd_Typ)),
2512 Right_Opnd => Make_Integer_Literal (Loc, 1));
2515 -- Skip null string literal
2517 if J < N and then Len = 0 then
2522 Operands (NN) := Opnd;
2523 Is_Fixed_Length (NN) := True;
2525 -- Set length and bounds
2527 Fixed_Length (NN) := Len;
2529 Opnd_Low_Bound (NN) :=
2530 New_Copy_Tree (String_Literal_Low_Bound (Opnd_Typ));
2537 -- Check constrained case with known bounds
2539 if Is_Constrained (Opnd_Typ) then
2541 Index : constant Node_Id := First_Index (Opnd_Typ);
2542 Indx_Typ : constant Entity_Id := Etype (Index);
2543 Lo : constant Node_Id := Type_Low_Bound (Indx_Typ);
2544 Hi : constant Node_Id := Type_High_Bound (Indx_Typ);
2547 -- Fixed length constrained array type with known at compile
2548 -- time bounds is last case of fixed length operand.
2550 if Compile_Time_Known_Value (Lo)
2552 Compile_Time_Known_Value (Hi)
2555 Loval : constant Uint := Expr_Value (Lo);
2556 Hival : constant Uint := Expr_Value (Hi);
2557 Len : constant Uint :=
2558 UI_Max (Hival - Loval + 1, Uint_0);
2562 Result_May_Be_Null := False;
2565 -- Capture last operand bound if result could be null
2567 if J = N and then Result_May_Be_Null then
2568 Last_Opnd_High_Bound :=
2570 Make_Integer_Literal (Loc,
2571 Intval => Expr_Value (Hi)));
2574 -- Exclude null length case unless last operand
2576 if J < N and then Len = 0 then
2581 Operands (NN) := Opnd;
2582 Is_Fixed_Length (NN) := True;
2583 Fixed_Length (NN) := Len;
2585 Opnd_Low_Bound (NN) := To_Ityp (
2586 Make_Integer_Literal (Loc,
2587 Intval => Expr_Value (Lo)));
2595 -- All cases where the length is not known at compile time, or the
2596 -- special case of an operand which is known to be null but has a
2597 -- lower bound other than 1 or is other than a string type.
2602 -- Capture operand bounds
2604 Opnd_Low_Bound (NN) :=
2605 Make_Attribute_Reference (Loc,
2607 Duplicate_Subexpr (Opnd, Name_Req => True),
2608 Attribute_Name => Name_First);
2610 if J = N and Result_May_Be_Null then
2611 Last_Opnd_High_Bound :=
2613 Make_Attribute_Reference (Loc,
2615 Duplicate_Subexpr (Opnd, Name_Req => True),
2616 Attribute_Name => Name_Last));
2619 -- Capture length of operand in entity
2621 Operands (NN) := Opnd;
2622 Is_Fixed_Length (NN) := False;
2625 Make_Defining_Identifier (Loc,
2626 Chars => New_Internal_Name ('L'));
2629 Make_Object_Declaration (Loc,
2630 Defining_Identifier => Var_Length (NN),
2631 Constant_Present => True,
2633 Object_Definition =>
2634 New_Occurrence_Of (Artyp, Loc),
2637 Make_Attribute_Reference (Loc,
2639 Duplicate_Subexpr (Opnd, Name_Req => True),
2640 Attribute_Name => Name_Length)));
2644 -- Set next entry in aggregate length array
2646 -- For first entry, make either integer literal for fixed length
2647 -- or a reference to the saved length for variable length.
2650 if Is_Fixed_Length (1) then
2652 Make_Integer_Literal (Loc,
2653 Intval => Fixed_Length (1));
2656 New_Reference_To (Var_Length (1), Loc);
2659 -- If entry is fixed length and only fixed lengths so far, make
2660 -- appropriate new integer literal adding new length.
2662 elsif Is_Fixed_Length (NN)
2663 and then Nkind (Aggr_Length (NN - 1)) = N_Integer_Literal
2666 Make_Integer_Literal (Loc,
2667 Intval => Fixed_Length (NN) + Intval (Aggr_Length (NN - 1)));
2669 -- All other cases, construct an addition node for the length and
2670 -- create an entity initialized to this length.
2674 Make_Defining_Identifier (Loc,
2675 Chars => New_Internal_Name ('L'));
2677 if Is_Fixed_Length (NN) then
2678 Clen := Make_Integer_Literal (Loc, Fixed_Length (NN));
2680 Clen := New_Reference_To (Var_Length (NN), Loc);
2684 Make_Object_Declaration (Loc,
2685 Defining_Identifier => Ent,
2686 Constant_Present => True,
2688 Object_Definition =>
2689 New_Occurrence_Of (Artyp, Loc),
2693 Left_Opnd => New_Copy (Aggr_Length (NN - 1)),
2694 Right_Opnd => Clen)));
2696 Aggr_Length (NN) := Make_Identifier (Loc, Chars => Chars (Ent));
2703 -- If we have only skipped null operands, return the last operand
2710 -- If we have only one non-null operand, return it and we are done.
2711 -- There is one case in which this cannot be done, and that is when
2712 -- the sole operand is of the element type, in which case it must be
2713 -- converted to an array, and the easiest way of doing that is to go
2714 -- through the normal general circuit.
2717 and then Base_Type (Etype (Operands (1))) /= Ctyp
2719 Result := Operands (1);
2723 -- Cases where we have a real concatenation
2725 -- Next step is to find the low bound for the result array that we
2726 -- will allocate. The rules for this are in (RM 4.5.6(5-7)).
2728 -- If the ultimate ancestor of the index subtype is a constrained array
2729 -- definition, then the lower bound is that of the index subtype as
2730 -- specified by (RM 4.5.3(6)).
2732 -- The right test here is to go to the root type, and then the ultimate
2733 -- ancestor is the first subtype of this root type.
2735 if Is_Constrained (First_Subtype (Root_Type (Atyp))) then
2737 Make_Attribute_Reference (Loc,
2739 New_Occurrence_Of (First_Subtype (Root_Type (Atyp)), Loc),
2740 Attribute_Name => Name_First);
2742 -- If the first operand in the list has known length we know that
2743 -- the lower bound of the result is the lower bound of this operand.
2745 elsif Is_Fixed_Length (1) then
2746 Low_Bound := Opnd_Low_Bound (1);
2748 -- OK, we don't know the lower bound, we have to build a horrible
2749 -- expression actions node of the form
2751 -- if Cond1'Length /= 0 then
2754 -- if Opnd2'Length /= 0 then
2759 -- The nesting ends either when we hit an operand whose length is known
2760 -- at compile time, or on reaching the last operand, whose low bound we
2761 -- take unconditionally whether or not it is null. It's easiest to do
2762 -- this with a recursive procedure:
2766 function Get_Known_Bound (J : Nat) return Node_Id;
2767 -- Returns the lower bound determined by operands J .. NN
2769 ---------------------
2770 -- Get_Known_Bound --
2771 ---------------------
2773 function Get_Known_Bound (J : Nat) return Node_Id is
2775 if Is_Fixed_Length (J) or else J = NN then
2776 return New_Copy (Opnd_Low_Bound (J));
2780 Make_Conditional_Expression (Loc,
2781 Expressions => New_List (
2784 Left_Opnd => New_Reference_To (Var_Length (J), Loc),
2785 Right_Opnd => Make_Integer_Literal (Loc, 0)),
2787 New_Copy (Opnd_Low_Bound (J)),
2788 Get_Known_Bound (J + 1)));
2790 end Get_Known_Bound;
2794 Make_Defining_Identifier (Loc, Chars => New_Internal_Name ('L'));
2797 Make_Object_Declaration (Loc,
2798 Defining_Identifier => Ent,
2799 Constant_Present => True,
2800 Object_Definition => New_Occurrence_Of (Ityp, Loc),
2801 Expression => Get_Known_Bound (1)));
2803 Low_Bound := New_Reference_To (Ent, Loc);
2807 -- Now we can safely compute the upper bound, normally
2808 -- Low_Bound + Length - 1.
2813 Left_Opnd => To_Artyp (New_Copy (Low_Bound)),
2815 Make_Op_Subtract (Loc,
2816 Left_Opnd => New_Copy (Aggr_Length (NN)),
2817 Right_Opnd => Make_Artyp_Literal (1))));
2819 -- Note that calculation of the high bound may cause overflow in some
2820 -- very weird cases, so in the general case we need an overflow check on
2821 -- the high bound. We can avoid this for the common case of string types
2822 -- and other types whose index is Positive, since we chose a wider range
2823 -- for the arithmetic type.
2825 if Istyp /= Standard_Positive then
2826 Activate_Overflow_Check (High_Bound);
2829 -- Handle the exceptional case where the result is null, in which case
2830 -- case the bounds come from the last operand (so that we get the proper
2831 -- bounds if the last operand is super-flat).
2833 if Result_May_Be_Null then
2835 Make_Conditional_Expression (Loc,
2836 Expressions => New_List (
2838 Left_Opnd => New_Copy (Aggr_Length (NN)),
2839 Right_Opnd => Make_Artyp_Literal (0)),
2840 Last_Opnd_High_Bound,
2844 -- Here is where we insert the saved up actions
2846 Insert_Actions (Cnode, Actions, Suppress => All_Checks);
2848 -- Now we construct an array object with appropriate bounds
2851 Make_Defining_Identifier (Loc,
2852 Chars => New_Internal_Name ('S'));
2854 -- If the bound is statically known to be out of range, we do not want
2855 -- to abort, we want a warning and a runtime constraint error. Note that
2856 -- we have arranged that the result will not be treated as a static
2857 -- constant, so we won't get an illegality during this insertion.
2859 Insert_Action (Cnode,
2860 Make_Object_Declaration (Loc,
2861 Defining_Identifier => Ent,
2862 Object_Definition =>
2863 Make_Subtype_Indication (Loc,
2864 Subtype_Mark => New_Occurrence_Of (Atyp, Loc),
2866 Make_Index_Or_Discriminant_Constraint (Loc,
2867 Constraints => New_List (
2869 Low_Bound => Low_Bound,
2870 High_Bound => High_Bound))))),
2871 Suppress => All_Checks);
2873 -- If the result of the concatenation appears as the initializing
2874 -- expression of an object declaration, we can just rename the
2875 -- result, rather than copying it.
2877 Set_OK_To_Rename (Ent);
2879 -- Catch the static out of range case now
2881 if Raises_Constraint_Error (High_Bound) then
2882 raise Concatenation_Error;
2885 -- Now we will generate the assignments to do the actual concatenation
2887 -- There is one case in which we will not do this, namely when all the
2888 -- following conditions are met:
2890 -- The result type is Standard.String
2892 -- There are nine or fewer retained (non-null) operands
2894 -- The optimization level is -O0
2896 -- The corresponding System.Concat_n.Str_Concat_n routine is
2897 -- available in the run time.
2899 -- The debug flag gnatd.c is not set
2901 -- If all these conditions are met then we generate a call to the
2902 -- relevant concatenation routine. The purpose of this is to avoid
2903 -- undesirable code bloat at -O0.
2905 if Atyp = Standard_String
2906 and then NN in 2 .. 9
2907 and then (Opt.Optimization_Level = 0 or else Debug_Flag_Dot_CC)
2908 and then not Debug_Flag_Dot_C
2911 RR : constant array (Nat range 2 .. 9) of RE_Id :=
2922 if RTE_Available (RR (NN)) then
2924 Opnds : constant List_Id :=
2925 New_List (New_Occurrence_Of (Ent, Loc));
2928 for J in 1 .. NN loop
2929 if Is_List_Member (Operands (J)) then
2930 Remove (Operands (J));
2933 if Base_Type (Etype (Operands (J))) = Ctyp then
2935 Make_Aggregate (Loc,
2936 Component_Associations => New_List (
2937 Make_Component_Association (Loc,
2938 Choices => New_List (
2939 Make_Integer_Literal (Loc, 1)),
2940 Expression => Operands (J)))));
2943 Append_To (Opnds, Operands (J));
2947 Insert_Action (Cnode,
2948 Make_Procedure_Call_Statement (Loc,
2949 Name => New_Reference_To (RTE (RR (NN)), Loc),
2950 Parameter_Associations => Opnds));
2952 Result := New_Reference_To (Ent, Loc);
2959 -- Not special case so generate the assignments
2961 Known_Non_Null_Operand_Seen := False;
2963 for J in 1 .. NN loop
2965 Lo : constant Node_Id :=
2967 Left_Opnd => To_Artyp (New_Copy (Low_Bound)),
2968 Right_Opnd => Aggr_Length (J - 1));
2970 Hi : constant Node_Id :=
2972 Left_Opnd => To_Artyp (New_Copy (Low_Bound)),
2974 Make_Op_Subtract (Loc,
2975 Left_Opnd => Aggr_Length (J),
2976 Right_Opnd => Make_Artyp_Literal (1)));
2979 -- Singleton case, simple assignment
2981 if Base_Type (Etype (Operands (J))) = Ctyp then
2982 Known_Non_Null_Operand_Seen := True;
2983 Insert_Action (Cnode,
2984 Make_Assignment_Statement (Loc,
2986 Make_Indexed_Component (Loc,
2987 Prefix => New_Occurrence_Of (Ent, Loc),
2988 Expressions => New_List (To_Ityp (Lo))),
2989 Expression => Operands (J)),
2990 Suppress => All_Checks);
2992 -- Array case, slice assignment, skipped when argument is fixed
2993 -- length and known to be null.
2995 elsif (not Is_Fixed_Length (J)) or else (Fixed_Length (J) > 0) then
2998 Make_Assignment_Statement (Loc,
3002 New_Occurrence_Of (Ent, Loc),
3005 Low_Bound => To_Ityp (Lo),
3006 High_Bound => To_Ityp (Hi))),
3007 Expression => Operands (J));
3009 if Is_Fixed_Length (J) then
3010 Known_Non_Null_Operand_Seen := True;
3012 elsif not Known_Non_Null_Operand_Seen then
3014 -- Here if operand length is not statically known and no
3015 -- operand known to be non-null has been processed yet.
3016 -- If operand length is 0, we do not need to perform the
3017 -- assignment, and we must avoid the evaluation of the
3018 -- high bound of the slice, since it may underflow if the
3019 -- low bound is Ityp'First.
3022 Make_Implicit_If_Statement (Cnode,
3026 New_Occurrence_Of (Var_Length (J), Loc),
3027 Right_Opnd => Make_Integer_Literal (Loc, 0)),
3032 Insert_Action (Cnode, Assign, Suppress => All_Checks);
3038 -- Finally we build the result, which is a reference to the array object
3040 Result := New_Reference_To (Ent, Loc);
3043 Rewrite (Cnode, Result);
3044 Analyze_And_Resolve (Cnode, Atyp);
3047 when Concatenation_Error =>
3049 -- Kill warning generated for the declaration of the static out of
3050 -- range high bound, and instead generate a Constraint_Error with
3051 -- an appropriate specific message.
3053 Kill_Dead_Code (Declaration_Node (Entity (High_Bound)));
3054 Apply_Compile_Time_Constraint_Error
3056 Msg => "concatenation result upper bound out of range?",
3057 Reason => CE_Range_Check_Failed);
3058 -- Set_Etype (Cnode, Atyp);
3059 end Expand_Concatenate;
3061 ------------------------
3062 -- Expand_N_Allocator --
3063 ------------------------
3065 procedure Expand_N_Allocator (N : Node_Id) is
3066 PtrT : constant Entity_Id := Etype (N);
3067 Dtyp : constant Entity_Id := Available_View (Designated_Type (PtrT));
3068 Etyp : constant Entity_Id := Etype (Expression (N));
3069 Loc : constant Source_Ptr := Sloc (N);
3074 procedure Complete_Coextension_Finalization;
3075 -- Generate finalization calls for all nested coextensions of N. This
3076 -- routine may allocate list controllers if necessary.
3078 procedure Rewrite_Coextension (N : Node_Id);
3079 -- Static coextensions have the same lifetime as the entity they
3080 -- constrain. Such occurrences can be rewritten as aliased objects
3081 -- and their unrestricted access used instead of the coextension.
3083 function Size_In_Storage_Elements (E : Entity_Id) return Node_Id;
3084 -- Given a constrained array type E, returns a node representing the
3085 -- code to compute the size in storage elements for the given type.
3086 -- This is done without using the attribute (which malfunctions for
3089 ---------------------------------------
3090 -- Complete_Coextension_Finalization --
3091 ---------------------------------------
3093 procedure Complete_Coextension_Finalization is
3095 Coext_Elmt : Elmt_Id;
3099 function Inside_A_Return_Statement (N : Node_Id) return Boolean;
3100 -- Determine whether node N is part of a return statement
3102 function Needs_Initialization_Call (N : Node_Id) return Boolean;
3103 -- Determine whether node N is a subtype indicator allocator which
3104 -- acts a coextension. Such coextensions need initialization.
3106 -------------------------------
3107 -- Inside_A_Return_Statement --
3108 -------------------------------
3110 function Inside_A_Return_Statement (N : Node_Id) return Boolean is
3115 while Present (P) loop
3117 (P, N_Extended_Return_Statement, N_Simple_Return_Statement)
3121 -- Stop the traversal when we reach a subprogram body
3123 elsif Nkind (P) = N_Subprogram_Body then
3131 end Inside_A_Return_Statement;
3133 -------------------------------
3134 -- Needs_Initialization_Call --
3135 -------------------------------
3137 function Needs_Initialization_Call (N : Node_Id) return Boolean is
3141 if Nkind (N) = N_Explicit_Dereference
3142 and then Nkind (Prefix (N)) = N_Identifier
3143 and then Nkind (Parent (Entity (Prefix (N)))) =
3144 N_Object_Declaration
3146 Obj_Decl := Parent (Entity (Prefix (N)));
3149 Present (Expression (Obj_Decl))
3150 and then Nkind (Expression (Obj_Decl)) = N_Allocator
3151 and then Nkind (Expression (Expression (Obj_Decl))) /=
3152 N_Qualified_Expression;
3156 end Needs_Initialization_Call;
3158 -- Start of processing for Complete_Coextension_Finalization
3161 -- When a coextension root is inside a return statement, we need to
3162 -- use the finalization chain of the function's scope. This does not
3163 -- apply for controlled named access types because in those cases we
3164 -- can use the finalization chain of the type itself.
3166 if Inside_A_Return_Statement (N)
3168 (Ekind (PtrT) = E_Anonymous_Access_Type
3170 (Ekind (PtrT) = E_Access_Type
3171 and then No (Associated_Final_Chain (PtrT))))
3175 Outer_S : Entity_Id;
3176 S : Entity_Id := Current_Scope;
3179 while Present (S) and then S /= Standard_Standard loop
3180 if Ekind (S) = E_Function then
3181 Outer_S := Scope (S);
3183 -- Retrieve the declaration of the body
3188 (Corresponding_Body (Parent (Parent (S)))));
3195 -- Push the scope of the function body since we are inserting
3196 -- the list before the body, but we are currently in the body
3197 -- itself. Override the finalization list of PtrT since the
3198 -- finalization context is now different.
3200 Push_Scope (Outer_S);
3201 Build_Final_List (Decl, PtrT);
3205 -- The root allocator may not be controlled, but it still needs a
3206 -- finalization list for all nested coextensions.
3208 elsif No (Associated_Final_Chain (PtrT)) then
3209 Build_Final_List (N, PtrT);
3213 Make_Selected_Component (Loc,
3215 New_Reference_To (Associated_Final_Chain (PtrT), Loc),
3217 Make_Identifier (Loc, Name_F));
3219 Coext_Elmt := First_Elmt (Coextensions (N));
3220 while Present (Coext_Elmt) loop
3221 Coext := Node (Coext_Elmt);
3226 if Nkind (Coext) = N_Identifier then
3228 Make_Unchecked_Type_Conversion (Loc,
3229 Subtype_Mark => New_Reference_To (Etype (Coext), Loc),
3231 Make_Explicit_Dereference (Loc,
3232 Prefix => New_Copy_Tree (Coext)));
3234 Ref := New_Copy_Tree (Coext);
3237 -- No initialization call if not allowed
3239 Check_Restriction (No_Default_Initialization, N);
3241 if not Restriction_Active (No_Default_Initialization) then
3245 -- attach_to_final_list (Ref, Flist, 2)
3247 if Needs_Initialization_Call (Coext) then
3251 Typ => Etype (Coext),
3253 With_Attach => Make_Integer_Literal (Loc, Uint_2)));
3256 -- attach_to_final_list (Ref, Flist, 2)
3262 Flist_Ref => New_Copy_Tree (Flist),
3263 With_Attach => Make_Integer_Literal (Loc, Uint_2)));
3267 Next_Elmt (Coext_Elmt);
3269 end Complete_Coextension_Finalization;
3271 -------------------------
3272 -- Rewrite_Coextension --
3273 -------------------------
3275 procedure Rewrite_Coextension (N : Node_Id) is
3276 Temp : constant Node_Id :=
3277 Make_Defining_Identifier (Loc,
3278 New_Internal_Name ('C'));
3281 -- Cnn : aliased Etyp;
3283 Decl : constant Node_Id :=
3284 Make_Object_Declaration (Loc,
3285 Defining_Identifier => Temp,
3286 Aliased_Present => True,
3287 Object_Definition =>
3288 New_Occurrence_Of (Etyp, Loc));
3292 if Nkind (Expression (N)) = N_Qualified_Expression then
3293 Set_Expression (Decl, Expression (Expression (N)));
3296 -- Find the proper insertion node for the declaration
3299 while Present (Nod) loop
3300 exit when Nkind (Nod) in N_Statement_Other_Than_Procedure_Call
3301 or else Nkind (Nod) = N_Procedure_Call_Statement
3302 or else Nkind (Nod) in N_Declaration;
3303 Nod := Parent (Nod);
3306 Insert_Before (Nod, Decl);
3310 Make_Attribute_Reference (Loc,
3311 Prefix => New_Occurrence_Of (Temp, Loc),
3312 Attribute_Name => Name_Unrestricted_Access));
3314 Analyze_And_Resolve (N, PtrT);
3315 end Rewrite_Coextension;
3317 ------------------------------
3318 -- Size_In_Storage_Elements --
3319 ------------------------------
3321 function Size_In_Storage_Elements (E : Entity_Id) return Node_Id is
3323 -- Logically this just returns E'Max_Size_In_Storage_Elements.
3324 -- However, the reason for the existence of this function is
3325 -- to construct a test for sizes too large, which means near the
3326 -- 32-bit limit on a 32-bit machine, and precisely the trouble
3327 -- is that we get overflows when sizes are greater than 2**31.
3329 -- So what we end up doing for array types is to use the expression:
3331 -- number-of-elements * component_type'Max_Size_In_Storage_Elements
3333 -- which avoids this problem. All this is a big bogus, but it does
3334 -- mean we catch common cases of trying to allocate arrays that
3335 -- are too large, and which in the absence of a check results in
3336 -- undetected chaos ???
3343 for J in 1 .. Number_Dimensions (E) loop
3345 Make_Attribute_Reference (Loc,
3346 Prefix => New_Occurrence_Of (E, Loc),
3347 Attribute_Name => Name_Length,
3348 Expressions => New_List (
3349 Make_Integer_Literal (Loc, J)));
3356 Make_Op_Multiply (Loc,
3363 Make_Op_Multiply (Loc,
3366 Make_Attribute_Reference (Loc,
3367 Prefix => New_Occurrence_Of (Component_Type (E), Loc),
3368 Attribute_Name => Name_Max_Size_In_Storage_Elements));
3370 end Size_In_Storage_Elements;
3372 -- Start of processing for Expand_N_Allocator
3375 -- RM E.2.3(22). We enforce that the expected type of an allocator
3376 -- shall not be a remote access-to-class-wide-limited-private type
3378 -- Why is this being done at expansion time, seems clearly wrong ???
3380 Validate_Remote_Access_To_Class_Wide_Type (N);
3382 -- Set the Storage Pool
3384 Set_Storage_Pool (N, Associated_Storage_Pool (Root_Type (PtrT)));
3386 if Present (Storage_Pool (N)) then
3387 if Is_RTE (Storage_Pool (N), RE_SS_Pool) then
3388 if VM_Target = No_VM then
3389 Set_Procedure_To_Call (N, RTE (RE_SS_Allocate));
3392 elsif Is_Class_Wide_Type (Etype (Storage_Pool (N))) then
3393 Set_Procedure_To_Call (N, RTE (RE_Allocate_Any));
3396 Set_Procedure_To_Call (N,
3397 Find_Prim_Op (Etype (Storage_Pool (N)), Name_Allocate));
3401 -- Under certain circumstances we can replace an allocator by an access
3402 -- to statically allocated storage. The conditions, as noted in AARM
3403 -- 3.10 (10c) are as follows:
3405 -- Size and initial value is known at compile time
3406 -- Access type is access-to-constant
3408 -- The allocator is not part of a constraint on a record component,
3409 -- because in that case the inserted actions are delayed until the
3410 -- record declaration is fully analyzed, which is too late for the
3411 -- analysis of the rewritten allocator.
3413 if Is_Access_Constant (PtrT)
3414 and then Nkind (Expression (N)) = N_Qualified_Expression
3415 and then Compile_Time_Known_Value (Expression (Expression (N)))
3416 and then Size_Known_At_Compile_Time (Etype (Expression
3418 and then not Is_Record_Type (Current_Scope)
3420 -- Here we can do the optimization. For the allocator
3424 -- We insert an object declaration
3426 -- Tnn : aliased x := y;
3428 -- and replace the allocator by Tnn'Unrestricted_Access. Tnn is
3429 -- marked as requiring static allocation.
3432 Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
3434 Desig := Subtype_Mark (Expression (N));
3436 -- If context is constrained, use constrained subtype directly,
3437 -- so that the constant is not labelled as having a nominally
3438 -- unconstrained subtype.
3440 if Entity (Desig) = Base_Type (Dtyp) then
3441 Desig := New_Occurrence_Of (Dtyp, Loc);
3445 Make_Object_Declaration (Loc,
3446 Defining_Identifier => Temp,
3447 Aliased_Present => True,
3448 Constant_Present => Is_Access_Constant (PtrT),
3449 Object_Definition => Desig,
3450 Expression => Expression (Expression (N))));
3453 Make_Attribute_Reference (Loc,
3454 Prefix => New_Occurrence_Of (Temp, Loc),
3455 Attribute_Name => Name_Unrestricted_Access));
3457 Analyze_And_Resolve (N, PtrT);
3459 -- We set the variable as statically allocated, since we don't want
3460 -- it going on the stack of the current procedure!
3462 Set_Is_Statically_Allocated (Temp);
3466 -- Same if the allocator is an access discriminant for a local object:
3467 -- instead of an allocator we create a local value and constrain the
3468 -- the enclosing object with the corresponding access attribute.
3470 if Is_Static_Coextension (N) then
3471 Rewrite_Coextension (N);
3475 -- The current allocator creates an object which may contain nested
3476 -- coextensions. Use the current allocator's finalization list to
3477 -- generate finalization call for all nested coextensions.
3479 if Is_Coextension_Root (N) then
3480 Complete_Coextension_Finalization;
3483 -- Check for size too large, we do this because the back end misses
3484 -- proper checks here and can generate rubbish allocation calls when
3485 -- we are near the limit. We only do this for the 32-bit address case
3486 -- since that is from a practical point of view where we see a problem.
3488 if System_Address_Size = 32
3489 and then not Storage_Checks_Suppressed (PtrT)
3490 and then not Storage_Checks_Suppressed (Dtyp)
3491 and then not Storage_Checks_Suppressed (Etyp)
3493 -- The check we want to generate should look like
3495 -- if Etyp'Max_Size_In_Storage_Elements > 3.5 gigabytes then
3496 -- raise Storage_Error;
3499 -- where 3.5 gigabytes is a constant large enough to accomodate any
3500 -- reasonable request for. But we can't do it this way because at
3501 -- least at the moment we don't compute this attribute right, and
3502 -- can silently give wrong results when the result gets large. Since
3503 -- this is all about large results, that's bad, so instead we only
3504 -- apply the check for constrained arrays, and manually compute the
3505 -- value of the attribute ???
3507 if Is_Array_Type (Etyp) and then Is_Constrained (Etyp) then
3509 Make_Raise_Storage_Error (Loc,
3512 Left_Opnd => Size_In_Storage_Elements (Etyp),
3514 Make_Integer_Literal (Loc,
3515 Intval => Uint_7 * (Uint_2 ** 29))),
3516 Reason => SE_Object_Too_Large));
3520 -- Handle case of qualified expression (other than optimization above)
3521 -- First apply constraint checks, because the bounds or discriminants
3522 -- in the aggregate might not match the subtype mark in the allocator.
3524 if Nkind (Expression (N)) = N_Qualified_Expression then
3525 Apply_Constraint_Check
3526 (Expression (Expression (N)), Etype (Expression (N)));
3528 Expand_Allocator_Expression (N);
3532 -- If the allocator is for a type which requires initialization, and
3533 -- there is no initial value (i.e. operand is a subtype indication
3534 -- rather than a qualified expression), then we must generate a call to
3535 -- the initialization routine using an expressions action node:
3537 -- [Pnnn : constant ptr_T := new (T); Init (Pnnn.all,...); Pnnn]
3539 -- Here ptr_T is the pointer type for the allocator, and T is the
3540 -- subtype of the allocator. A special case arises if the designated
3541 -- type of the access type is a task or contains tasks. In this case
3542 -- the call to Init (Temp.all ...) is replaced by code that ensures
3543 -- that tasks get activated (see Exp_Ch9.Build_Task_Allocate_Block
3544 -- for details). In addition, if the type T is a task T, then the
3545 -- first argument to Init must be converted to the task record type.
3548 T : constant Entity_Id := Entity (Expression (N));
3556 Temp_Decl : Node_Id;
3557 Temp_Type : Entity_Id;
3558 Attach_Level : Uint;
3561 if No_Initialization (N) then
3564 -- Case of no initialization procedure present
3566 elsif not Has_Non_Null_Base_Init_Proc (T) then
3568 -- Case of simple initialization required
3570 if Needs_Simple_Initialization (T) then
3571 Check_Restriction (No_Default_Initialization, N);
3572 Rewrite (Expression (N),
3573 Make_Qualified_Expression (Loc,
3574 Subtype_Mark => New_Occurrence_Of (T, Loc),
3575 Expression => Get_Simple_Init_Val (T, N)));
3577 Analyze_And_Resolve (Expression (Expression (N)), T);
3578 Analyze_And_Resolve (Expression (N), T);
3579 Set_Paren_Count (Expression (Expression (N)), 1);
3580 Expand_N_Allocator (N);
3582 -- No initialization required
3588 -- Case of initialization procedure present, must be called
3591 Check_Restriction (No_Default_Initialization, N);
3593 if not Restriction_Active (No_Default_Initialization) then
3594 Init := Base_Init_Proc (T);
3596 Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
3598 -- Construct argument list for the initialization routine call
3601 Make_Explicit_Dereference (Loc,
3602 Prefix => New_Reference_To (Temp, Loc));
3603 Set_Assignment_OK (Arg1);
3606 -- The initialization procedure expects a specific type. if the
3607 -- context is access to class wide, indicate that the object
3608 -- being allocated has the right specific type.
3610 if Is_Class_Wide_Type (Dtyp) then
3611 Arg1 := Unchecked_Convert_To (T, Arg1);
3614 -- If designated type is a concurrent type or if it is private
3615 -- type whose definition is a concurrent type, the first
3616 -- argument in the Init routine has to be unchecked conversion
3617 -- to the corresponding record type. If the designated type is
3618 -- a derived type, we also convert the argument to its root
3621 if Is_Concurrent_Type (T) then
3623 Unchecked_Convert_To (Corresponding_Record_Type (T), Arg1);
3625 elsif Is_Private_Type (T)
3626 and then Present (Full_View (T))
3627 and then Is_Concurrent_Type (Full_View (T))
3630 Unchecked_Convert_To
3631 (Corresponding_Record_Type (Full_View (T)), Arg1);
3633 elsif Etype (First_Formal (Init)) /= Base_Type (T) then
3635 Ftyp : constant Entity_Id := Etype (First_Formal (Init));
3637 Arg1 := OK_Convert_To (Etype (Ftyp), Arg1);
3638 Set_Etype (Arg1, Ftyp);
3642 Args := New_List (Arg1);
3644 -- For the task case, pass the Master_Id of the access type as
3645 -- the value of the _Master parameter, and _Chain as the value
3646 -- of the _Chain parameter (_Chain will be defined as part of
3647 -- the generated code for the allocator).
3649 -- In Ada 2005, the context may be a function that returns an
3650 -- anonymous access type. In that case the Master_Id has been
3651 -- created when expanding the function declaration.
3653 if Has_Task (T) then
3654 if No (Master_Id (Base_Type (PtrT))) then
3656 -- If we have a non-library level task with restriction
3657 -- No_Task_Hierarchy set, then no point in expanding.
3659 if not Is_Library_Level_Entity (T)
3660 and then Restriction_Active (No_Task_Hierarchy)
3665 -- The designated type was an incomplete type, and the
3666 -- access type did not get expanded. Salvage it now.
3668 pragma Assert (Present (Parent (Base_Type (PtrT))));
3669 Expand_N_Full_Type_Declaration
3670 (Parent (Base_Type (PtrT)));
3673 -- If the context of the allocator is a declaration or an
3674 -- assignment, we can generate a meaningful image for it,
3675 -- even though subsequent assignments might remove the
3676 -- connection between task and entity. We build this image
3677 -- when the left-hand side is a simple variable, a simple
3678 -- indexed assignment or a simple selected component.
3680 if Nkind (Parent (N)) = N_Assignment_Statement then
3682 Nam : constant Node_Id := Name (Parent (N));
3685 if Is_Entity_Name (Nam) then
3687 Build_Task_Image_Decls
3690 (Entity (Nam), Sloc (Nam)), T);
3693 (Nam, N_Indexed_Component, N_Selected_Component)
3694 and then Is_Entity_Name (Prefix (Nam))
3697 Build_Task_Image_Decls
3698 (Loc, Nam, Etype (Prefix (Nam)));
3700 Decls := Build_Task_Image_Decls (Loc, T, T);
3704 elsif Nkind (Parent (N)) = N_Object_Declaration then
3706 Build_Task_Image_Decls
3707 (Loc, Defining_Identifier (Parent (N)), T);
3710 Decls := Build_Task_Image_Decls (Loc, T, T);
3715 (Master_Id (Base_Type (Root_Type (PtrT))), Loc));
3716 Append_To (Args, Make_Identifier (Loc, Name_uChain));
3718 Decl := Last (Decls);
3720 New_Occurrence_Of (Defining_Identifier (Decl), Loc));
3722 -- Has_Task is false, Decls not used
3728 -- Add discriminants if discriminated type
3731 Dis : Boolean := False;
3735 if Has_Discriminants (T) then
3739 elsif Is_Private_Type (T)
3740 and then Present (Full_View (T))
3741 and then Has_Discriminants (Full_View (T))
3744 Typ := Full_View (T);
3749 -- If the allocated object will be constrained by the
3750 -- default values for discriminants, then build a subtype
3751 -- with those defaults, and change the allocated subtype
3752 -- to that. Note that this happens in fewer cases in Ada
3755 if not Is_Constrained (Typ)
3756 and then Present (Discriminant_Default_Value
3757 (First_Discriminant (Typ)))
3758 and then (Ada_Version < Ada_05
3760 not Has_Constrained_Partial_View (Typ))
3762 Typ := Build_Default_Subtype (Typ, N);
3763 Set_Expression (N, New_Reference_To (Typ, Loc));
3766 Discr := First_Elmt (Discriminant_Constraint (Typ));
3767 while Present (Discr) loop
3768 Nod := Node (Discr);
3769 Append (New_Copy_Tree (Node (Discr)), Args);
3771 -- AI-416: when the discriminant constraint is an
3772 -- anonymous access type make sure an accessibility
3773 -- check is inserted if necessary (3.10.2(22.q/2))
3775 if Ada_Version >= Ada_05
3777 Ekind (Etype (Nod)) = E_Anonymous_Access_Type
3779 Apply_Accessibility_Check
3780 (Nod, Typ, Insert_Node => Nod);
3788 -- We set the allocator as analyzed so that when we analyze the
3789 -- expression actions node, we do not get an unwanted recursive
3790 -- expansion of the allocator expression.
3792 Set_Analyzed (N, True);
3793 Nod := Relocate_Node (N);
3795 -- Here is the transformation:
3797 -- output: Temp : constant ptr_T := new T;
3798 -- Init (Temp.all, ...);
3799 -- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
3800 -- <CTRL> Initialize (Finalizable (Temp.all));
3802 -- Here ptr_T is the pointer type for the allocator, and is the
3803 -- subtype of the allocator.
3806 Make_Object_Declaration (Loc,
3807 Defining_Identifier => Temp,
3808 Constant_Present => True,
3809 Object_Definition => New_Reference_To (Temp_Type, Loc),
3812 Set_Assignment_OK (Temp_Decl);
3813 Insert_Action (N, Temp_Decl, Suppress => All_Checks);
3815 -- If the designated type is a task type or contains tasks,
3816 -- create block to activate created tasks, and insert
3817 -- declaration for Task_Image variable ahead of call.
3819 if Has_Task (T) then
3821 L : constant List_Id := New_List;
3824 Build_Task_Allocate_Block (L, Nod, Args);
3826 Insert_List_Before (First (Declarations (Blk)), Decls);
3827 Insert_Actions (N, L);
3832 Make_Procedure_Call_Statement (Loc,
3833 Name => New_Reference_To (Init, Loc),
3834 Parameter_Associations => Args));
3837 if Needs_Finalization (T) then
3839 -- Postpone the generation of a finalization call for the
3840 -- current allocator if it acts as a coextension.
3842 if Is_Dynamic_Coextension (N) then
3843 if No (Coextensions (N)) then
3844 Set_Coextensions (N, New_Elmt_List);
3847 Append_Elmt (New_Copy_Tree (Arg1), Coextensions (N));
3851 Get_Allocator_Final_List (N, Base_Type (T), PtrT);
3853 -- Anonymous access types created for access parameters
3854 -- are attached to an explicitly constructed controller,
3855 -- which ensures that they can be finalized properly,
3856 -- even if their deallocation might not happen. The list
3857 -- associated with the controller is doubly-linked. For
3858 -- other anonymous access types, the object may end up
3859 -- on the global final list which is singly-linked.
3860 -- Work needed for access discriminants in Ada 2005 ???
3862 if Ekind (PtrT) = E_Anonymous_Access_Type then
3863 Attach_Level := Uint_1;
3865 Attach_Level := Uint_2;
3870 Ref => New_Copy_Tree (Arg1),
3873 With_Attach => Make_Integer_Literal (Loc,
3874 Intval => Attach_Level)));
3878 Rewrite (N, New_Reference_To (Temp, Loc));
3879 Analyze_And_Resolve (N, PtrT);
3884 -- Ada 2005 (AI-251): If the allocator is for a class-wide interface
3885 -- object that has been rewritten as a reference, we displace "this"
3886 -- to reference properly its secondary dispatch table.
3888 if Nkind (N) = N_Identifier
3889 and then Is_Interface (Dtyp)
3891 Displace_Allocator_Pointer (N);
3895 when RE_Not_Available =>
3897 end Expand_N_Allocator;
3899 -----------------------
3900 -- Expand_N_And_Then --
3901 -----------------------
3903 -- Expand into conditional expression if Actions present, and also deal
3904 -- with optimizing case of arguments being True or False.
3906 procedure Expand_N_And_Then (N : Node_Id) is
3907 Loc : constant Source_Ptr := Sloc (N);
3908 Typ : constant Entity_Id := Etype (N);
3909 Left : constant Node_Id := Left_Opnd (N);
3910 Right : constant Node_Id := Right_Opnd (N);
3914 -- Deal with non-standard booleans
3916 if Is_Boolean_Type (Typ) then
3917 Adjust_Condition (Left);
3918 Adjust_Condition (Right);
3919 Set_Etype (N, Standard_Boolean);
3922 -- Check for cases where left argument is known to be True or False
3924 if Compile_Time_Known_Value (Left) then
3926 -- If left argument is True, change (True and then Right) to Right.
3927 -- Any actions associated with Right will be executed unconditionally
3928 -- and can thus be inserted into the tree unconditionally.
3930 if Expr_Value_E (Left) = Standard_True then
3931 if Present (Actions (N)) then
3932 Insert_Actions (N, Actions (N));
3937 -- If left argument is False, change (False and then Right) to False.
3938 -- In this case we can forget the actions associated with Right,
3939 -- since they will never be executed.
3941 else pragma Assert (Expr_Value_E (Left) = Standard_False);
3942 Kill_Dead_Code (Right);
3943 Kill_Dead_Code (Actions (N));
3944 Rewrite (N, New_Occurrence_Of (Standard_False, Loc));
3947 Adjust_Result_Type (N, Typ);
3951 -- If Actions are present, we expand
3953 -- left and then right
3957 -- if left then right else false end
3959 -- with the actions becoming the Then_Actions of the conditional
3960 -- expression. This conditional expression is then further expanded
3961 -- (and will eventually disappear)
3963 if Present (Actions (N)) then
3964 Actlist := Actions (N);
3966 Make_Conditional_Expression (Loc,
3967 Expressions => New_List (
3970 New_Occurrence_Of (Standard_False, Loc))));
3972 -- If the right part of the expression is a function call then it can
3973 -- be part of the expansion of the predefined equality operator of a
3974 -- tagged type and we may need to adjust its SCIL dispatching node.
3977 and then Nkind (Right) = N_Function_Call
3979 Adjust_SCIL_Node (N, Right);
3982 Set_Then_Actions (N, Actlist);
3983 Analyze_And_Resolve (N, Standard_Boolean);
3984 Adjust_Result_Type (N, Typ);
3988 -- No actions present, check for cases of right argument True/False
3990 if Compile_Time_Known_Value (Right) then
3992 -- Change (Left and then True) to Left. Note that we know there are
3993 -- no actions associated with the True operand, since we just checked
3994 -- for this case above.
3996 if Expr_Value_E (Right) = Standard_True then
3999 -- Change (Left and then False) to False, making sure to preserve any
4000 -- side effects associated with the Left operand.
4002 else pragma Assert (Expr_Value_E (Right) = Standard_False);
4003 Remove_Side_Effects (Left);
4004 Rewrite (N, New_Occurrence_Of (Standard_False, Loc));
4008 Adjust_Result_Type (N, Typ);
4009 end Expand_N_And_Then;
4011 -------------------------------------
4012 -- Expand_N_Conditional_Expression --
4013 -------------------------------------
4015 -- Expand into expression actions if then/else actions present
4017 procedure Expand_N_Conditional_Expression (N : Node_Id) is
4018 Loc : constant Source_Ptr := Sloc (N);
4019 Cond : constant Node_Id := First (Expressions (N));
4020 Thenx : constant Node_Id := Next (Cond);
4021 Elsex : constant Node_Id := Next (Thenx);
4022 Typ : constant Entity_Id := Etype (N);
4031 -- If either then or else actions are present, then given:
4033 -- if cond then then-expr else else-expr end
4035 -- we insert the following sequence of actions (using Insert_Actions):
4040 -- Cnn := then-expr;
4046 -- and replace the conditional expression by a reference to Cnn
4048 -- If the type is limited or unconstrained, the above expansion is
4049 -- not legal, because it involves either an uninitialized object
4050 -- or an illegal assignment. Instead, we generate:
4052 -- type Ptr is access all Typ;
4056 -- Cnn := then-expr'Unrestricted_Access;
4059 -- Cnn := else-expr'Unrestricted_Access;
4062 -- and replace the conditional expresion by a reference to Cnn.all.
4064 if Is_By_Reference_Type (Typ) then
4065 Cnn := Make_Temporary (Loc, 'C', N);
4068 Make_Full_Type_Declaration (Loc,
4069 Defining_Identifier =>
4070 Make_Defining_Identifier (Loc, New_Internal_Name ('A')),
4072 Make_Access_To_Object_Definition (Loc,
4073 All_Present => True,
4074 Subtype_Indication =>
4075 New_Reference_To (Typ, Loc)));
4077 Insert_Action (N, P_Decl);
4080 Make_Object_Declaration (Loc,
4081 Defining_Identifier => Cnn,
4082 Object_Definition =>
4083 New_Occurrence_Of (Defining_Identifier (P_Decl), Loc));
4086 Make_Implicit_If_Statement (N,
4087 Condition => Relocate_Node (Cond),
4089 Then_Statements => New_List (
4090 Make_Assignment_Statement (Sloc (Thenx),
4091 Name => New_Occurrence_Of (Cnn, Sloc (Thenx)),
4093 Make_Attribute_Reference (Loc,
4094 Attribute_Name => Name_Unrestricted_Access,
4095 Prefix => Relocate_Node (Thenx)))),
4097 Else_Statements => New_List (
4098 Make_Assignment_Statement (Sloc (Elsex),
4099 Name => New_Occurrence_Of (Cnn, Sloc (Elsex)),
4101 Make_Attribute_Reference (Loc,
4102 Attribute_Name => Name_Unrestricted_Access,
4103 Prefix => Relocate_Node (Elsex)))));
4106 Make_Explicit_Dereference (Loc,
4107 Prefix => New_Occurrence_Of (Cnn, Loc));
4109 -- For other types, we only need to expand if there are other actions
4110 -- associated with either branch.
4112 elsif Present (Then_Actions (N)) or else Present (Else_Actions (N)) then
4113 Cnn := Make_Temporary (Loc, 'C', N);
4116 Make_Object_Declaration (Loc,
4117 Defining_Identifier => Cnn,
4118 Object_Definition => New_Occurrence_Of (Typ, Loc));
4121 Make_Implicit_If_Statement (N,
4122 Condition => Relocate_Node (Cond),
4124 Then_Statements => New_List (
4125 Make_Assignment_Statement (Sloc (Thenx),
4126 Name => New_Occurrence_Of (Cnn, Sloc (Thenx)),
4127 Expression => Relocate_Node (Thenx))),
4129 Else_Statements => New_List (
4130 Make_Assignment_Statement (Sloc (Elsex),
4131 Name => New_Occurrence_Of (Cnn, Sloc (Elsex)),
4132 Expression => Relocate_Node (Elsex))));
4134 Set_Assignment_OK (Name (First (Then_Statements (New_If))));
4135 Set_Assignment_OK (Name (First (Else_Statements (New_If))));
4137 New_N := New_Occurrence_Of (Cnn, Loc);
4140 -- No expansion needed, gigi handles it like a C conditional
4146 -- Move the SLOC of the parent If statement to the newly created one and
4147 -- change it to the SLOC of the expression which, after expansion, will
4148 -- correspond to what is being evaluated.
4150 if Present (Parent (N))
4151 and then Nkind (Parent (N)) = N_If_Statement
4153 Set_Sloc (New_If, Sloc (Parent (N)));
4154 Set_Sloc (Parent (N), Loc);
4157 -- Make sure Then_Actions and Else_Actions are appropriately moved
4158 -- to the new if statement.
4160 if Present (Then_Actions (N)) then
4162 (First (Then_Statements (New_If)), Then_Actions (N));
4165 if Present (Else_Actions (N)) then
4167 (First (Else_Statements (New_If)), Else_Actions (N));
4170 Insert_Action (N, Decl);
4171 Insert_Action (N, New_If);
4173 Analyze_And_Resolve (N, Typ);
4174 end Expand_N_Conditional_Expression;
4176 -----------------------------------
4177 -- Expand_N_Explicit_Dereference --
4178 -----------------------------------
4180 procedure Expand_N_Explicit_Dereference (N : Node_Id) is
4182 -- Insert explicit dereference call for the checked storage pool case
4184 Insert_Dereference_Action (Prefix (N));
4185 end Expand_N_Explicit_Dereference;
4191 procedure Expand_N_In (N : Node_Id) is
4192 Loc : constant Source_Ptr := Sloc (N);
4193 Rtyp : constant Entity_Id := Etype (N);
4194 Lop : constant Node_Id := Left_Opnd (N);
4195 Rop : constant Node_Id := Right_Opnd (N);
4196 Static : constant Boolean := Is_OK_Static_Expression (N);
4198 procedure Expand_Set_Membership;
4199 -- For each disjunct we create a simple equality or membership test.
4200 -- The whole membership is rewritten as a short-circuit disjunction.
4202 ---------------------------
4203 -- Expand_Set_Membership --
4204 ---------------------------
4206 procedure Expand_Set_Membership is
4210 function Make_Cond (Alt : Node_Id) return Node_Id;
4211 -- If the alternative is a subtype mark, create a simple membership
4212 -- test. Otherwise create an equality test for it.
4218 function Make_Cond (Alt : Node_Id) return Node_Id is
4220 L : constant Node_Id := New_Copy (Lop);
4221 R : constant Node_Id := Relocate_Node (Alt);
4224 if Is_Entity_Name (Alt)
4225 and then Is_Type (Entity (Alt))
4228 Make_In (Sloc (Alt),
4232 Cond := Make_Op_Eq (Sloc (Alt),
4240 -- Start of proessing for Expand_N_In
4243 Alt := Last (Alternatives (N));
4244 Res := Make_Cond (Alt);
4247 while Present (Alt) loop
4249 Make_Or_Else (Sloc (Alt),
4250 Left_Opnd => Make_Cond (Alt),
4256 Analyze_And_Resolve (N, Standard_Boolean);
4257 end Expand_Set_Membership;
4259 procedure Substitute_Valid_Check;
4260 -- Replaces node N by Lop'Valid. This is done when we have an explicit
4261 -- test for the left operand being in range of its subtype.
4263 ----------------------------
4264 -- Substitute_Valid_Check --
4265 ----------------------------
4267 procedure Substitute_Valid_Check is
4270 Make_Attribute_Reference (Loc,
4271 Prefix => Relocate_Node (Lop),
4272 Attribute_Name => Name_Valid));
4274 Analyze_And_Resolve (N, Rtyp);
4276 Error_Msg_N ("?explicit membership test may be optimized away", N);
4277 Error_Msg_N ("\?use ''Valid attribute instead", N);
4279 end Substitute_Valid_Check;
4281 -- Start of processing for Expand_N_In
4285 if Present (Alternatives (N)) then
4286 Remove_Side_Effects (Lop);
4287 Expand_Set_Membership;
4291 -- Check case of explicit test for an expression in range of its
4292 -- subtype. This is suspicious usage and we replace it with a 'Valid
4293 -- test and give a warning.
4295 if Is_Scalar_Type (Etype (Lop))
4296 and then Nkind (Rop) in N_Has_Entity
4297 and then Etype (Lop) = Entity (Rop)
4298 and then Comes_From_Source (N)
4299 and then VM_Target = No_VM
4301 Substitute_Valid_Check;
4305 -- Do validity check on operands
4307 if Validity_Checks_On and Validity_Check_Operands then
4308 Ensure_Valid (Left_Opnd (N));
4309 Validity_Check_Range (Right_Opnd (N));
4312 -- Case of explicit range
4314 if Nkind (Rop) = N_Range then
4316 Lo : constant Node_Id := Low_Bound (Rop);
4317 Hi : constant Node_Id := High_Bound (Rop);
4319 Ltyp : constant Entity_Id := Etype (Lop);
4321 Lo_Orig : constant Node_Id := Original_Node (Lo);
4322 Hi_Orig : constant Node_Id := Original_Node (Hi);
4324 Lcheck : Compare_Result;
4325 Ucheck : Compare_Result;
4327 Warn1 : constant Boolean :=
4328 Constant_Condition_Warnings
4329 and then Comes_From_Source (N)
4330 and then not In_Instance;
4331 -- This must be true for any of the optimization warnings, we
4332 -- clearly want to give them only for source with the flag on.
4333 -- We also skip these warnings in an instance since it may be
4334 -- the case that different instantiations have different ranges.
4336 Warn2 : constant Boolean :=
4338 and then Nkind (Original_Node (Rop)) = N_Range
4339 and then Is_Integer_Type (Etype (Lo));
4340 -- For the case where only one bound warning is elided, we also
4341 -- insist on an explicit range and an integer type. The reason is
4342 -- that the use of enumeration ranges including an end point is
4343 -- common, as is the use of a subtype name, one of whose bounds
4344 -- is the same as the type of the expression.
4347 -- If test is explicit x'first .. x'last, replace by valid check
4349 if Is_Scalar_Type (Ltyp)
4350 and then Nkind (Lo_Orig) = N_Attribute_Reference
4351 and then Attribute_Name (Lo_Orig) = Name_First
4352 and then Nkind (Prefix (Lo_Orig)) in N_Has_Entity
4353 and then Entity (Prefix (Lo_Orig)) = Ltyp
4354 and then Nkind (Hi_Orig) = N_Attribute_Reference
4355 and then Attribute_Name (Hi_Orig) = Name_Last
4356 and then Nkind (Prefix (Hi_Orig)) in N_Has_Entity
4357 and then Entity (Prefix (Hi_Orig)) = Ltyp
4358 and then Comes_From_Source (N)
4359 and then VM_Target = No_VM
4361 Substitute_Valid_Check;
4365 -- If bounds of type are known at compile time, and the end points
4366 -- are known at compile time and identical, this is another case
4367 -- for substituting a valid test. We only do this for discrete
4368 -- types, since it won't arise in practice for float types.
4370 if Comes_From_Source (N)
4371 and then Is_Discrete_Type (Ltyp)
4372 and then Compile_Time_Known_Value (Type_High_Bound (Ltyp))
4373 and then Compile_Time_Known_Value (Type_Low_Bound (Ltyp))
4374 and then Compile_Time_Known_Value (Lo)
4375 and then Compile_Time_Known_Value (Hi)
4376 and then Expr_Value (Type_High_Bound (Ltyp)) = Expr_Value (Hi)
4377 and then Expr_Value (Type_Low_Bound (Ltyp)) = Expr_Value (Lo)
4379 -- Kill warnings in instances, since they may be cases where we
4380 -- have a test in the generic that makes sense with some types
4381 -- and not with other types.
4383 and then not In_Instance
4385 Substitute_Valid_Check;
4389 -- If we have an explicit range, do a bit of optimization based
4390 -- on range analysis (we may be able to kill one or both checks).
4392 Lcheck := Compile_Time_Compare (Lop, Lo, Assume_Valid => False);
4393 Ucheck := Compile_Time_Compare (Lop, Hi, Assume_Valid => False);
4395 -- If either check is known to fail, replace result by False since
4396 -- the other check does not matter. Preserve the static flag for
4397 -- legality checks, because we are constant-folding beyond RM 4.9.
4399 if Lcheck = LT or else Ucheck = GT then
4401 Error_Msg_N ("?range test optimized away", N);
4402 Error_Msg_N ("\?value is known to be out of range", N);
4406 New_Reference_To (Standard_False, Loc));
4407 Analyze_And_Resolve (N, Rtyp);
4408 Set_Is_Static_Expression (N, Static);
4412 -- If both checks are known to succeed, replace result by True,
4413 -- since we know we are in range.
4415 elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then
4417 Error_Msg_N ("?range test optimized away", N);
4418 Error_Msg_N ("\?value is known to be in range", N);
4422 New_Reference_To (Standard_True, Loc));
4423 Analyze_And_Resolve (N, Rtyp);
4424 Set_Is_Static_Expression (N, Static);
4428 -- If lower bound check succeeds and upper bound check is not
4429 -- known to succeed or fail, then replace the range check with
4430 -- a comparison against the upper bound.
4432 elsif Lcheck in Compare_GE then
4433 if Warn2 and then not In_Instance then
4434 Error_Msg_N ("?lower bound test optimized away", Lo);
4435 Error_Msg_N ("\?value is known to be in range", Lo);
4441 Right_Opnd => High_Bound (Rop)));
4442 Analyze_And_Resolve (N, Rtyp);
4446 -- If upper bound check succeeds and lower bound check is not
4447 -- known to succeed or fail, then replace the range check with
4448 -- a comparison against the lower bound.
4450 elsif Ucheck in Compare_LE then
4451 if Warn2 and then not In_Instance then
4452 Error_Msg_N ("?upper bound test optimized away", Hi);
4453 Error_Msg_N ("\?value is known to be in range", Hi);
4459 Right_Opnd => Low_Bound (Rop)));
4460 Analyze_And_Resolve (N, Rtyp);
4465 -- We couldn't optimize away the range check, but there is one
4466 -- more issue. If we are checking constant conditionals, then we
4467 -- see if we can determine the outcome assuming everything is
4468 -- valid, and if so give an appropriate warning.
4470 if Warn1 and then not Assume_No_Invalid_Values then
4471 Lcheck := Compile_Time_Compare (Lop, Lo, Assume_Valid => True);
4472 Ucheck := Compile_Time_Compare (Lop, Hi, Assume_Valid => True);
4474 -- Result is out of range for valid value
4476 if Lcheck = LT or else Ucheck = GT then
4478 ("?value can only be in range if it is invalid", N);
4480 -- Result is in range for valid value
4482 elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then
4484 ("?value can only be out of range if it is invalid", N);
4486 -- Lower bound check succeeds if value is valid
4488 elsif Warn2 and then Lcheck in Compare_GE then
4490 ("?lower bound check only fails if it is invalid", Lo);
4492 -- Upper bound check succeeds if value is valid
4494 elsif Warn2 and then Ucheck in Compare_LE then
4496 ("?upper bound check only fails for invalid values", Hi);
4501 -- For all other cases of an explicit range, nothing to be done
4505 -- Here right operand is a subtype mark
4509 Typ : Entity_Id := Etype (Rop);
4510 Is_Acc : constant Boolean := Is_Access_Type (Typ);
4511 Cond : Node_Id := Empty;
4513 Obj : Node_Id := Lop;
4514 SCIL_Node : Node_Id;
4517 Remove_Side_Effects (Obj);
4519 -- For tagged type, do tagged membership operation
4521 if Is_Tagged_Type (Typ) then
4523 -- No expansion will be performed when VM_Target, as the VM
4524 -- back-ends will handle the membership tests directly (tags
4525 -- are not explicitly represented in Java objects, so the
4526 -- normal tagged membership expansion is not what we want).
4528 if Tagged_Type_Expansion then
4529 Tagged_Membership (N, SCIL_Node, New_N);
4531 Analyze_And_Resolve (N, Rtyp);
4533 -- Update decoration of relocated node referenced by the
4537 and then Present (SCIL_Node)
4539 Set_SCIL_Related_Node (SCIL_Node, N);
4540 Insert_Action (N, SCIL_Node);
4546 -- If type is scalar type, rewrite as x in t'first .. t'last.
4547 -- This reason we do this is that the bounds may have the wrong
4548 -- type if they come from the original type definition. Also this
4549 -- way we get all the processing above for an explicit range.
4551 elsif Is_Scalar_Type (Typ) then
4555 Make_Attribute_Reference (Loc,
4556 Attribute_Name => Name_First,
4557 Prefix => New_Reference_To (Typ, Loc)),
4560 Make_Attribute_Reference (Loc,
4561 Attribute_Name => Name_Last,
4562 Prefix => New_Reference_To (Typ, Loc))));
4563 Analyze_And_Resolve (N, Rtyp);
4566 -- Ada 2005 (AI-216): Program_Error is raised when evaluating
4567 -- a membership test if the subtype mark denotes a constrained
4568 -- Unchecked_Union subtype and the expression lacks inferable
4571 elsif Is_Unchecked_Union (Base_Type (Typ))
4572 and then Is_Constrained (Typ)
4573 and then not Has_Inferable_Discriminants (Lop)
4576 Make_Raise_Program_Error (Loc,
4577 Reason => PE_Unchecked_Union_Restriction));
4579 -- Prevent Gigi from generating incorrect code by rewriting
4580 -- the test as a standard False.
4583 New_Occurrence_Of (Standard_False, Loc));
4588 -- Here we have a non-scalar type
4591 Typ := Designated_Type (Typ);
4594 if not Is_Constrained (Typ) then
4596 New_Reference_To (Standard_True, Loc));
4597 Analyze_And_Resolve (N, Rtyp);
4599 -- For the constrained array case, we have to check the subscripts
4600 -- for an exact match if the lengths are non-zero (the lengths
4601 -- must match in any case).
4603 elsif Is_Array_Type (Typ) then
4605 Check_Subscripts : declare
4606 function Construct_Attribute_Reference
4609 Dim : Nat) return Node_Id;
4610 -- Build attribute reference E'Nam(Dim)
4612 -----------------------------------
4613 -- Construct_Attribute_Reference --
4614 -----------------------------------
4616 function Construct_Attribute_Reference
4619 Dim : Nat) return Node_Id
4623 Make_Attribute_Reference (Loc,
4625 Attribute_Name => Nam,
4626 Expressions => New_List (
4627 Make_Integer_Literal (Loc, Dim)));
4628 end Construct_Attribute_Reference;
4630 -- Start of processing for Check_Subscripts
4633 for J in 1 .. Number_Dimensions (Typ) loop
4634 Evolve_And_Then (Cond,
4637 Construct_Attribute_Reference
4638 (Duplicate_Subexpr_No_Checks (Obj),
4641 Construct_Attribute_Reference
4642 (New_Occurrence_Of (Typ, Loc), Name_First, J)));
4644 Evolve_And_Then (Cond,
4647 Construct_Attribute_Reference
4648 (Duplicate_Subexpr_No_Checks (Obj),
4651 Construct_Attribute_Reference
4652 (New_Occurrence_Of (Typ, Loc), Name_Last, J)));
4661 Right_Opnd => Make_Null (Loc)),
4662 Right_Opnd => Cond);
4666 Analyze_And_Resolve (N, Rtyp);
4667 end Check_Subscripts;
4669 -- These are the cases where constraint checks may be required,
4670 -- e.g. records with possible discriminants
4673 -- Expand the test into a series of discriminant comparisons.
4674 -- The expression that is built is the negation of the one that
4675 -- is used for checking discriminant constraints.
4677 Obj := Relocate_Node (Left_Opnd (N));
4679 if Has_Discriminants (Typ) then
4680 Cond := Make_Op_Not (Loc,
4681 Right_Opnd => Build_Discriminant_Checks (Obj, Typ));
4684 Cond := Make_Or_Else (Loc,
4688 Right_Opnd => Make_Null (Loc)),
4689 Right_Opnd => Cond);
4693 Cond := New_Occurrence_Of (Standard_True, Loc);
4697 Analyze_And_Resolve (N, Rtyp);
4703 --------------------------------
4704 -- Expand_N_Indexed_Component --
4705 --------------------------------
4707 procedure Expand_N_Indexed_Component (N : Node_Id) is
4708 Loc : constant Source_Ptr := Sloc (N);
4709 Typ : constant Entity_Id := Etype (N);
4710 P : constant Node_Id := Prefix (N);
4711 T : constant Entity_Id := Etype (P);
4714 -- A special optimization, if we have an indexed component that is
4715 -- selecting from a slice, then we can eliminate the slice, since, for
4716 -- example, x (i .. j)(k) is identical to x(k). The only difference is
4717 -- the range check required by the slice. The range check for the slice
4718 -- itself has already been generated. The range check for the
4719 -- subscripting operation is ensured by converting the subject to
4720 -- the subtype of the slice.
4722 -- This optimization not only generates better code, avoiding slice
4723 -- messing especially in the packed case, but more importantly bypasses
4724 -- some problems in handling this peculiar case, for example, the issue
4725 -- of dealing specially with object renamings.
4727 if Nkind (P) = N_Slice then
4729 Make_Indexed_Component (Loc,
4730 Prefix => Prefix (P),
4731 Expressions => New_List (
4733 (Etype (First_Index (Etype (P))),
4734 First (Expressions (N))))));
4735 Analyze_And_Resolve (N, Typ);
4739 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
4740 -- function, then additional actuals must be passed.
4742 if Ada_Version >= Ada_05
4743 and then Is_Build_In_Place_Function_Call (P)
4745 Make_Build_In_Place_Call_In_Anonymous_Context (P);
4748 -- If the prefix is an access type, then we unconditionally rewrite if
4749 -- as an explicit dereference. This simplifies processing for several
4750 -- cases, including packed array cases and certain cases in which checks
4751 -- must be generated. We used to try to do this only when it was
4752 -- necessary, but it cleans up the code to do it all the time.
4754 if Is_Access_Type (T) then
4755 Insert_Explicit_Dereference (P);
4756 Analyze_And_Resolve (P, Designated_Type (T));
4759 -- Generate index and validity checks
4761 Generate_Index_Checks (N);
4763 if Validity_Checks_On and then Validity_Check_Subscripts then
4764 Apply_Subscript_Validity_Checks (N);
4767 -- All done for the non-packed case
4769 if not Is_Packed (Etype (Prefix (N))) then
4773 -- For packed arrays that are not bit-packed (i.e. the case of an array
4774 -- with one or more index types with a non-contiguous enumeration type),
4775 -- we can always use the normal packed element get circuit.
4777 if not Is_Bit_Packed_Array (Etype (Prefix (N))) then
4778 Expand_Packed_Element_Reference (N);
4782 -- For a reference to a component of a bit packed array, we have to
4783 -- convert it to a reference to the corresponding Packed_Array_Type.
4784 -- We only want to do this for simple references, and not for:
4786 -- Left side of assignment, or prefix of left side of assignment, or
4787 -- prefix of the prefix, to handle packed arrays of packed arrays,
4788 -- This case is handled in Exp_Ch5.Expand_N_Assignment_Statement
4790 -- Renaming objects in renaming associations
4791 -- This case is handled when a use of the renamed variable occurs
4793 -- Actual parameters for a procedure call
4794 -- This case is handled in Exp_Ch6.Expand_Actuals
4796 -- The second expression in a 'Read attribute reference
4798 -- The prefix of an address or size attribute reference
4800 -- The following circuit detects these exceptions
4803 Child : Node_Id := N;
4804 Parnt : Node_Id := Parent (N);
4808 if Nkind (Parnt) = N_Unchecked_Expression then
4811 elsif Nkind_In (Parnt, N_Object_Renaming_Declaration,
4812 N_Procedure_Call_Statement)
4813 or else (Nkind (Parnt) = N_Parameter_Association
4815 Nkind (Parent (Parnt)) = N_Procedure_Call_Statement)
4819 elsif Nkind (Parnt) = N_Attribute_Reference
4820 and then (Attribute_Name (Parnt) = Name_Address
4822 Attribute_Name (Parnt) = Name_Size)
4823 and then Prefix (Parnt) = Child
4827 elsif Nkind (Parnt) = N_Assignment_Statement
4828 and then Name (Parnt) = Child
4832 -- If the expression is an index of an indexed component, it must
4833 -- be expanded regardless of context.
4835 elsif Nkind (Parnt) = N_Indexed_Component
4836 and then Child /= Prefix (Parnt)
4838 Expand_Packed_Element_Reference (N);
4841 elsif Nkind (Parent (Parnt)) = N_Assignment_Statement
4842 and then Name (Parent (Parnt)) = Parnt
4846 elsif Nkind (Parnt) = N_Attribute_Reference
4847 and then Attribute_Name (Parnt) = Name_Read
4848 and then Next (First (Expressions (Parnt))) = Child
4852 elsif Nkind_In (Parnt, N_Indexed_Component, N_Selected_Component)
4853 and then Prefix (Parnt) = Child
4858 Expand_Packed_Element_Reference (N);
4862 -- Keep looking up tree for unchecked expression, or if we are the
4863 -- prefix of a possible assignment left side.
4866 Parnt := Parent (Child);
4869 end Expand_N_Indexed_Component;
4871 ---------------------
4872 -- Expand_N_Not_In --
4873 ---------------------
4875 -- Replace a not in b by not (a in b) so that the expansions for (a in b)
4876 -- can be done. This avoids needing to duplicate this expansion code.
4878 procedure Expand_N_Not_In (N : Node_Id) is
4879 Loc : constant Source_Ptr := Sloc (N);
4880 Typ : constant Entity_Id := Etype (N);
4881 Cfs : constant Boolean := Comes_From_Source (N);
4888 Left_Opnd => Left_Opnd (N),
4889 Right_Opnd => Right_Opnd (N))));
4891 -- If this is a set membership, preserve list of alternatives
4893 Set_Alternatives (Right_Opnd (N), Alternatives (Original_Node (N)));
4895 -- We want this to appear as coming from source if original does (see
4896 -- transformations in Expand_N_In).
4898 Set_Comes_From_Source (N, Cfs);
4899 Set_Comes_From_Source (Right_Opnd (N), Cfs);
4901 -- Now analyze transformed node
4903 Analyze_And_Resolve (N, Typ);
4904 end Expand_N_Not_In;
4910 -- The only replacement required is for the case of a null of type that is
4911 -- an access to protected subprogram. We represent such access values as a
4912 -- record, and so we must replace the occurrence of null by the equivalent
4913 -- record (with a null address and a null pointer in it), so that the
4914 -- backend creates the proper value.
4916 procedure Expand_N_Null (N : Node_Id) is
4917 Loc : constant Source_Ptr := Sloc (N);
4918 Typ : constant Entity_Id := Etype (N);
4922 if Is_Access_Protected_Subprogram_Type (Typ) then
4924 Make_Aggregate (Loc,
4925 Expressions => New_List (
4926 New_Occurrence_Of (RTE (RE_Null_Address), Loc),
4930 Analyze_And_Resolve (N, Equivalent_Type (Typ));
4932 -- For subsequent semantic analysis, the node must retain its type.
4933 -- Gigi in any case replaces this type by the corresponding record
4934 -- type before processing the node.
4940 when RE_Not_Available =>
4944 ---------------------
4945 -- Expand_N_Op_Abs --
4946 ---------------------
4948 procedure Expand_N_Op_Abs (N : Node_Id) is
4949 Loc : constant Source_Ptr := Sloc (N);
4950 Expr : constant Node_Id := Right_Opnd (N);
4953 Unary_Op_Validity_Checks (N);
4955 -- Deal with software overflow checking
4957 if not Backend_Overflow_Checks_On_Target
4958 and then Is_Signed_Integer_Type (Etype (N))
4959 and then Do_Overflow_Check (N)
4961 -- The only case to worry about is when the argument is equal to the
4962 -- largest negative number, so what we do is to insert the check:
4964 -- [constraint_error when Expr = typ'Base'First]
4966 -- with the usual Duplicate_Subexpr use coding for expr
4969 Make_Raise_Constraint_Error (Loc,
4972 Left_Opnd => Duplicate_Subexpr (Expr),
4974 Make_Attribute_Reference (Loc,
4976 New_Occurrence_Of (Base_Type (Etype (Expr)), Loc),
4977 Attribute_Name => Name_First)),
4978 Reason => CE_Overflow_Check_Failed));
4981 -- Vax floating-point types case
4983 if Vax_Float (Etype (N)) then
4984 Expand_Vax_Arith (N);
4986 end Expand_N_Op_Abs;
4988 ---------------------
4989 -- Expand_N_Op_Add --
4990 ---------------------
4992 procedure Expand_N_Op_Add (N : Node_Id) is
4993 Typ : constant Entity_Id := Etype (N);
4996 Binary_Op_Validity_Checks (N);
4998 -- N + 0 = 0 + N = N for integer types
5000 if Is_Integer_Type (Typ) then
5001 if Compile_Time_Known_Value (Right_Opnd (N))
5002 and then Expr_Value (Right_Opnd (N)) = Uint_0
5004 Rewrite (N, Left_Opnd (N));
5007 elsif Compile_Time_Known_Value (Left_Opnd (N))
5008 and then Expr_Value (Left_Opnd (N)) = Uint_0
5010 Rewrite (N, Right_Opnd (N));
5015 -- Arithmetic overflow checks for signed integer/fixed point types
5017 if Is_Signed_Integer_Type (Typ)
5018 or else Is_Fixed_Point_Type (Typ)
5020 Apply_Arithmetic_Overflow_Check (N);
5023 -- Vax floating-point types case
5025 elsif Vax_Float (Typ) then
5026 Expand_Vax_Arith (N);
5028 end Expand_N_Op_Add;
5030 ---------------------
5031 -- Expand_N_Op_And --
5032 ---------------------
5034 procedure Expand_N_Op_And (N : Node_Id) is
5035 Typ : constant Entity_Id := Etype (N);
5038 Binary_Op_Validity_Checks (N);
5040 if Is_Array_Type (Etype (N)) then
5041 Expand_Boolean_Operator (N);
5043 elsif Is_Boolean_Type (Etype (N)) then
5045 -- Replace AND by AND THEN if Short_Circuit_And_Or active and the
5046 -- type is standard Boolean (do not mess with AND that uses a non-
5047 -- standard Boolean type, because something strange is going on).
5049 if Short_Circuit_And_Or and then Typ = Standard_Boolean then
5051 Make_And_Then (Sloc (N),
5052 Left_Opnd => Relocate_Node (Left_Opnd (N)),
5053 Right_Opnd => Relocate_Node (Right_Opnd (N))));
5054 Analyze_And_Resolve (N, Typ);
5056 -- Otherwise, adjust conditions
5059 Adjust_Condition (Left_Opnd (N));
5060 Adjust_Condition (Right_Opnd (N));
5061 Set_Etype (N, Standard_Boolean);
5062 Adjust_Result_Type (N, Typ);
5065 end Expand_N_Op_And;
5067 ------------------------
5068 -- Expand_N_Op_Concat --
5069 ------------------------
5071 procedure Expand_N_Op_Concat (N : Node_Id) is
5073 -- List of operands to be concatenated
5076 -- Node which is to be replaced by the result of concatenating the nodes
5077 -- in the list Opnds.
5080 -- Ensure validity of both operands
5082 Binary_Op_Validity_Checks (N);
5084 -- If we are the left operand of a concatenation higher up the tree,
5085 -- then do nothing for now, since we want to deal with a series of
5086 -- concatenations as a unit.
5088 if Nkind (Parent (N)) = N_Op_Concat
5089 and then N = Left_Opnd (Parent (N))
5094 -- We get here with a concatenation whose left operand may be a
5095 -- concatenation itself with a consistent type. We need to process
5096 -- these concatenation operands from left to right, which means
5097 -- from the deepest node in the tree to the highest node.
5100 while Nkind (Left_Opnd (Cnode)) = N_Op_Concat loop
5101 Cnode := Left_Opnd (Cnode);
5104 -- Now Cnode is the deepest concatenation, and its parents are the
5105 -- concatenation nodes above, so now we process bottom up, doing the
5106 -- operations. We gather a string that is as long as possible up to five
5109 -- The outer loop runs more than once if more than one concatenation
5110 -- type is involved.
5113 Opnds := New_List (Left_Opnd (Cnode), Right_Opnd (Cnode));
5114 Set_Parent (Opnds, N);
5116 -- The inner loop gathers concatenation operands
5118 Inner : while Cnode /= N
5119 and then Base_Type (Etype (Cnode)) =
5120 Base_Type (Etype (Parent (Cnode)))
5122 Cnode := Parent (Cnode);
5123 Append (Right_Opnd (Cnode), Opnds);
5126 Expand_Concatenate (Cnode, Opnds);
5128 exit Outer when Cnode = N;
5129 Cnode := Parent (Cnode);
5131 end Expand_N_Op_Concat;
5133 ------------------------
5134 -- Expand_N_Op_Divide --
5135 ------------------------
5137 procedure Expand_N_Op_Divide (N : Node_Id) is
5138 Loc : constant Source_Ptr := Sloc (N);
5139 Lopnd : constant Node_Id := Left_Opnd (N);
5140 Ropnd : constant Node_Id := Right_Opnd (N);
5141 Ltyp : constant Entity_Id := Etype (Lopnd);
5142 Rtyp : constant Entity_Id := Etype (Ropnd);
5143 Typ : Entity_Id := Etype (N);
5144 Rknow : constant Boolean := Is_Integer_Type (Typ)
5146 Compile_Time_Known_Value (Ropnd);
5150 Binary_Op_Validity_Checks (N);
5153 Rval := Expr_Value (Ropnd);
5156 -- N / 1 = N for integer types
5158 if Rknow and then Rval = Uint_1 then
5163 -- Convert x / 2 ** y to Shift_Right (x, y). Note that the fact that
5164 -- Is_Power_Of_2_For_Shift is set means that we know that our left
5165 -- operand is an unsigned integer, as required for this to work.
5167 if Nkind (Ropnd) = N_Op_Expon
5168 and then Is_Power_Of_2_For_Shift (Ropnd)
5170 -- We cannot do this transformation in configurable run time mode if we
5171 -- have 64-bit -- integers and long shifts are not available.
5175 or else Support_Long_Shifts_On_Target)
5178 Make_Op_Shift_Right (Loc,
5181 Convert_To (Standard_Natural, Right_Opnd (Ropnd))));
5182 Analyze_And_Resolve (N, Typ);
5186 -- Do required fixup of universal fixed operation
5188 if Typ = Universal_Fixed then
5189 Fixup_Universal_Fixed_Operation (N);
5193 -- Divisions with fixed-point results
5195 if Is_Fixed_Point_Type (Typ) then
5197 -- No special processing if Treat_Fixed_As_Integer is set, since
5198 -- from a semantic point of view such operations are simply integer
5199 -- operations and will be treated that way.
5201 if not Treat_Fixed_As_Integer (N) then
5202 if Is_Integer_Type (Rtyp) then
5203 Expand_Divide_Fixed_By_Integer_Giving_Fixed (N);
5205 Expand_Divide_Fixed_By_Fixed_Giving_Fixed (N);
5209 -- Other cases of division of fixed-point operands. Again we exclude the
5210 -- case where Treat_Fixed_As_Integer is set.
5212 elsif (Is_Fixed_Point_Type (Ltyp) or else
5213 Is_Fixed_Point_Type (Rtyp))
5214 and then not Treat_Fixed_As_Integer (N)
5216 if Is_Integer_Type (Typ) then
5217 Expand_Divide_Fixed_By_Fixed_Giving_Integer (N);
5219 pragma Assert (Is_Floating_Point_Type (Typ));
5220 Expand_Divide_Fixed_By_Fixed_Giving_Float (N);
5223 -- Mixed-mode operations can appear in a non-static universal context,
5224 -- in which case the integer argument must be converted explicitly.
5226 elsif Typ = Universal_Real
5227 and then Is_Integer_Type (Rtyp)
5230 Convert_To (Universal_Real, Relocate_Node (Ropnd)));
5232 Analyze_And_Resolve (Ropnd, Universal_Real);
5234 elsif Typ = Universal_Real
5235 and then Is_Integer_Type (Ltyp)
5238 Convert_To (Universal_Real, Relocate_Node (Lopnd)));
5240 Analyze_And_Resolve (Lopnd, Universal_Real);
5242 -- Non-fixed point cases, do integer zero divide and overflow checks
5244 elsif Is_Integer_Type (Typ) then
5245 Apply_Divide_Check (N);
5247 -- Check for 64-bit division available, or long shifts if the divisor
5248 -- is a small power of 2 (since such divides will be converted into
5251 if Esize (Ltyp) > 32
5252 and then not Support_64_Bit_Divides_On_Target
5255 or else not Support_Long_Shifts_On_Target
5256 or else (Rval /= Uint_2 and then
5257 Rval /= Uint_4 and then
5258 Rval /= Uint_8 and then
5259 Rval /= Uint_16 and then
5260 Rval /= Uint_32 and then
5263 Error_Msg_CRT ("64-bit division", N);
5266 -- Deal with Vax_Float
5268 elsif Vax_Float (Typ) then
5269 Expand_Vax_Arith (N);
5272 end Expand_N_Op_Divide;
5274 --------------------
5275 -- Expand_N_Op_Eq --
5276 --------------------
5278 procedure Expand_N_Op_Eq (N : Node_Id) is
5279 Loc : constant Source_Ptr := Sloc (N);
5280 Typ : constant Entity_Id := Etype (N);
5281 Lhs : constant Node_Id := Left_Opnd (N);
5282 Rhs : constant Node_Id := Right_Opnd (N);
5283 Bodies : constant List_Id := New_List;
5284 A_Typ : constant Entity_Id := Etype (Lhs);
5286 Typl : Entity_Id := A_Typ;
5287 Op_Name : Entity_Id;
5290 procedure Build_Equality_Call (Eq : Entity_Id);
5291 -- If a constructed equality exists for the type or for its parent,
5292 -- build and analyze call, adding conversions if the operation is
5295 function Has_Unconstrained_UU_Component (Typ : Node_Id) return Boolean;
5296 -- Determines whether a type has a subcomponent of an unconstrained
5297 -- Unchecked_Union subtype. Typ is a record type.
5299 -------------------------
5300 -- Build_Equality_Call --
5301 -------------------------
5303 procedure Build_Equality_Call (Eq : Entity_Id) is
5304 Op_Type : constant Entity_Id := Etype (First_Formal (Eq));
5305 L_Exp : Node_Id := Relocate_Node (Lhs);
5306 R_Exp : Node_Id := Relocate_Node (Rhs);
5309 if Base_Type (Op_Type) /= Base_Type (A_Typ)
5310 and then not Is_Class_Wide_Type (A_Typ)
5312 L_Exp := OK_Convert_To (Op_Type, L_Exp);
5313 R_Exp := OK_Convert_To (Op_Type, R_Exp);
5316 -- If we have an Unchecked_Union, we need to add the inferred
5317 -- discriminant values as actuals in the function call. At this
5318 -- point, the expansion has determined that both operands have
5319 -- inferable discriminants.
5321 if Is_Unchecked_Union (Op_Type) then
5323 Lhs_Type : constant Node_Id := Etype (L_Exp);
5324 Rhs_Type : constant Node_Id := Etype (R_Exp);
5325 Lhs_Discr_Val : Node_Id;
5326 Rhs_Discr_Val : Node_Id;
5329 -- Per-object constrained selected components require special
5330 -- attention. If the enclosing scope of the component is an
5331 -- Unchecked_Union, we cannot reference its discriminants
5332 -- directly. This is why we use the two extra parameters of
5333 -- the equality function of the enclosing Unchecked_Union.
5335 -- type UU_Type (Discr : Integer := 0) is
5338 -- pragma Unchecked_Union (UU_Type);
5340 -- 1. Unchecked_Union enclosing record:
5342 -- type Enclosing_UU_Type (Discr : Integer := 0) is record
5344 -- Comp : UU_Type (Discr);
5346 -- end Enclosing_UU_Type;
5347 -- pragma Unchecked_Union (Enclosing_UU_Type);
5349 -- Obj1 : Enclosing_UU_Type;
5350 -- Obj2 : Enclosing_UU_Type (1);
5352 -- [. . .] Obj1 = Obj2 [. . .]
5356 -- if not (uu_typeEQ (obj1.comp, obj2.comp, a, b)) then
5358 -- A and B are the formal parameters of the equality function
5359 -- of Enclosing_UU_Type. The function always has two extra
5360 -- formals to capture the inferred discriminant values.
5362 -- 2. Non-Unchecked_Union enclosing record:
5365 -- Enclosing_Non_UU_Type (Discr : Integer := 0)
5368 -- Comp : UU_Type (Discr);
5370 -- end Enclosing_Non_UU_Type;
5372 -- Obj1 : Enclosing_Non_UU_Type;
5373 -- Obj2 : Enclosing_Non_UU_Type (1);
5375 -- ... Obj1 = Obj2 ...
5379 -- if not (uu_typeEQ (obj1.comp, obj2.comp,
5380 -- obj1.discr, obj2.discr)) then
5382 -- In this case we can directly reference the discriminants of
5383 -- the enclosing record.
5387 if Nkind (Lhs) = N_Selected_Component
5388 and then Has_Per_Object_Constraint
5389 (Entity (Selector_Name (Lhs)))
5391 -- Enclosing record is an Unchecked_Union, use formal A
5393 if Is_Unchecked_Union (Scope
5394 (Entity (Selector_Name (Lhs))))
5397 Make_Identifier (Loc,
5400 -- Enclosing record is of a non-Unchecked_Union type, it is
5401 -- possible to reference the discriminant.
5405 Make_Selected_Component (Loc,
5406 Prefix => Prefix (Lhs),
5409 (Get_Discriminant_Value
5410 (First_Discriminant (Lhs_Type),
5412 Stored_Constraint (Lhs_Type))));
5415 -- Comment needed here ???
5418 -- Infer the discriminant value
5422 (Get_Discriminant_Value
5423 (First_Discriminant (Lhs_Type),
5425 Stored_Constraint (Lhs_Type)));
5430 if Nkind (Rhs) = N_Selected_Component
5431 and then Has_Per_Object_Constraint
5432 (Entity (Selector_Name (Rhs)))
5434 if Is_Unchecked_Union
5435 (Scope (Entity (Selector_Name (Rhs))))
5438 Make_Identifier (Loc,
5443 Make_Selected_Component (Loc,
5444 Prefix => Prefix (Rhs),
5446 New_Copy (Get_Discriminant_Value (
5447 First_Discriminant (Rhs_Type),
5449 Stored_Constraint (Rhs_Type))));
5454 New_Copy (Get_Discriminant_Value (
5455 First_Discriminant (Rhs_Type),
5457 Stored_Constraint (Rhs_Type)));
5462 Make_Function_Call (Loc,
5463 Name => New_Reference_To (Eq, Loc),
5464 Parameter_Associations => New_List (
5471 -- Normal case, not an unchecked union
5475 Make_Function_Call (Loc,
5476 Name => New_Reference_To (Eq, Loc),
5477 Parameter_Associations => New_List (L_Exp, R_Exp)));
5480 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5481 end Build_Equality_Call;
5483 ------------------------------------
5484 -- Has_Unconstrained_UU_Component --
5485 ------------------------------------
5487 function Has_Unconstrained_UU_Component
5488 (Typ : Node_Id) return Boolean
5490 Tdef : constant Node_Id :=
5491 Type_Definition (Declaration_Node (Base_Type (Typ)));
5495 function Component_Is_Unconstrained_UU
5496 (Comp : Node_Id) return Boolean;
5497 -- Determines whether the subtype of the component is an
5498 -- unconstrained Unchecked_Union.
5500 function Variant_Is_Unconstrained_UU
5501 (Variant : Node_Id) return Boolean;
5502 -- Determines whether a component of the variant has an unconstrained
5503 -- Unchecked_Union subtype.
5505 -----------------------------------
5506 -- Component_Is_Unconstrained_UU --
5507 -----------------------------------
5509 function Component_Is_Unconstrained_UU
5510 (Comp : Node_Id) return Boolean
5513 if Nkind (Comp) /= N_Component_Declaration then
5518 Sindic : constant Node_Id :=
5519 Subtype_Indication (Component_Definition (Comp));
5522 -- Unconstrained nominal type. In the case of a constraint
5523 -- present, the node kind would have been N_Subtype_Indication.
5525 if Nkind (Sindic) = N_Identifier then
5526 return Is_Unchecked_Union (Base_Type (Etype (Sindic)));
5531 end Component_Is_Unconstrained_UU;
5533 ---------------------------------
5534 -- Variant_Is_Unconstrained_UU --
5535 ---------------------------------
5537 function Variant_Is_Unconstrained_UU
5538 (Variant : Node_Id) return Boolean
5540 Clist : constant Node_Id := Component_List (Variant);
5543 if Is_Empty_List (Component_Items (Clist)) then
5547 -- We only need to test one component
5550 Comp : Node_Id := First (Component_Items (Clist));
5553 while Present (Comp) loop
5554 if Component_Is_Unconstrained_UU (Comp) then
5562 -- None of the components withing the variant were of
5563 -- unconstrained Unchecked_Union type.
5566 end Variant_Is_Unconstrained_UU;
5568 -- Start of processing for Has_Unconstrained_UU_Component
5571 if Null_Present (Tdef) then
5575 Clist := Component_List (Tdef);
5576 Vpart := Variant_Part (Clist);
5578 -- Inspect available components
5580 if Present (Component_Items (Clist)) then
5582 Comp : Node_Id := First (Component_Items (Clist));
5585 while Present (Comp) loop
5587 -- One component is sufficient
5589 if Component_Is_Unconstrained_UU (Comp) then
5598 -- Inspect available components withing variants
5600 if Present (Vpart) then
5602 Variant : Node_Id := First (Variants (Vpart));
5605 while Present (Variant) loop
5607 -- One component within a variant is sufficient
5609 if Variant_Is_Unconstrained_UU (Variant) then
5618 -- Neither the available components, nor the components inside the
5619 -- variant parts were of an unconstrained Unchecked_Union subtype.
5622 end Has_Unconstrained_UU_Component;
5624 -- Start of processing for Expand_N_Op_Eq
5627 Binary_Op_Validity_Checks (N);
5629 if Ekind (Typl) = E_Private_Type then
5630 Typl := Underlying_Type (Typl);
5631 elsif Ekind (Typl) = E_Private_Subtype then
5632 Typl := Underlying_Type (Base_Type (Typl));
5637 -- It may happen in error situations that the underlying type is not
5638 -- set. The error will be detected later, here we just defend the
5645 Typl := Base_Type (Typl);
5647 -- Boolean types (requiring handling of non-standard case)
5649 if Is_Boolean_Type (Typl) then
5650 Adjust_Condition (Left_Opnd (N));
5651 Adjust_Condition (Right_Opnd (N));
5652 Set_Etype (N, Standard_Boolean);
5653 Adjust_Result_Type (N, Typ);
5657 elsif Is_Array_Type (Typl) then
5659 -- If we are doing full validity checking, and it is possible for the
5660 -- array elements to be invalid then expand out array comparisons to
5661 -- make sure that we check the array elements.
5663 if Validity_Check_Operands
5664 and then not Is_Known_Valid (Component_Type (Typl))
5667 Save_Force_Validity_Checks : constant Boolean :=
5668 Force_Validity_Checks;
5670 Force_Validity_Checks := True;
5672 Expand_Array_Equality
5674 Relocate_Node (Lhs),
5675 Relocate_Node (Rhs),
5678 Insert_Actions (N, Bodies);
5679 Analyze_And_Resolve (N, Standard_Boolean);
5680 Force_Validity_Checks := Save_Force_Validity_Checks;
5683 -- Packed case where both operands are known aligned
5685 elsif Is_Bit_Packed_Array (Typl)
5686 and then not Is_Possibly_Unaligned_Object (Lhs)
5687 and then not Is_Possibly_Unaligned_Object (Rhs)
5689 Expand_Packed_Eq (N);
5691 -- Where the component type is elementary we can use a block bit
5692 -- comparison (if supported on the target) exception in the case
5693 -- of floating-point (negative zero issues require element by
5694 -- element comparison), and atomic types (where we must be sure
5695 -- to load elements independently) and possibly unaligned arrays.
5697 elsif Is_Elementary_Type (Component_Type (Typl))
5698 and then not Is_Floating_Point_Type (Component_Type (Typl))
5699 and then not Is_Atomic (Component_Type (Typl))
5700 and then not Is_Possibly_Unaligned_Object (Lhs)
5701 and then not Is_Possibly_Unaligned_Object (Rhs)
5702 and then Support_Composite_Compare_On_Target
5706 -- For composite and floating-point cases, expand equality loop to
5707 -- make sure of using proper comparisons for tagged types, and
5708 -- correctly handling the floating-point case.
5712 Expand_Array_Equality
5714 Relocate_Node (Lhs),
5715 Relocate_Node (Rhs),
5718 Insert_Actions (N, Bodies, Suppress => All_Checks);
5719 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5724 elsif Is_Record_Type (Typl) then
5726 -- For tagged types, use the primitive "="
5728 if Is_Tagged_Type (Typl) then
5730 -- No need to do anything else compiling under restriction
5731 -- No_Dispatching_Calls. During the semantic analysis we
5732 -- already notified such violation.
5734 if Restriction_Active (No_Dispatching_Calls) then
5738 -- If this is derived from an untagged private type completed with
5739 -- a tagged type, it does not have a full view, so we use the
5740 -- primitive operations of the private type. This check should no
5741 -- longer be necessary when these types get their full views???
5743 if Is_Private_Type (A_Typ)
5744 and then not Is_Tagged_Type (A_Typ)
5745 and then Is_Derived_Type (A_Typ)
5746 and then No (Full_View (A_Typ))
5748 -- Search for equality operation, checking that the operands
5749 -- have the same type. Note that we must find a matching entry,
5750 -- or something is very wrong!
5752 Prim := First_Elmt (Collect_Primitive_Operations (A_Typ));
5754 while Present (Prim) loop
5755 exit when Chars (Node (Prim)) = Name_Op_Eq
5756 and then Etype (First_Formal (Node (Prim))) =
5757 Etype (Next_Formal (First_Formal (Node (Prim))))
5759 Base_Type (Etype (Node (Prim))) = Standard_Boolean;
5764 pragma Assert (Present (Prim));
5765 Op_Name := Node (Prim);
5767 -- Find the type's predefined equality or an overriding
5768 -- user- defined equality. The reason for not simply calling
5769 -- Find_Prim_Op here is that there may be a user-defined
5770 -- overloaded equality op that precedes the equality that we want,
5771 -- so we have to explicitly search (e.g., there could be an
5772 -- equality with two different parameter types).
5775 if Is_Class_Wide_Type (Typl) then
5776 Typl := Root_Type (Typl);
5779 Prim := First_Elmt (Primitive_Operations (Typl));
5780 while Present (Prim) loop
5781 exit when Chars (Node (Prim)) = Name_Op_Eq
5782 and then Etype (First_Formal (Node (Prim))) =
5783 Etype (Next_Formal (First_Formal (Node (Prim))))
5785 Base_Type (Etype (Node (Prim))) = Standard_Boolean;
5790 pragma Assert (Present (Prim));
5791 Op_Name := Node (Prim);
5794 Build_Equality_Call (Op_Name);
5796 -- Ada 2005 (AI-216): Program_Error is raised when evaluating the
5797 -- predefined equality operator for a type which has a subcomponent
5798 -- of an Unchecked_Union type whose nominal subtype is unconstrained.
5800 elsif Has_Unconstrained_UU_Component (Typl) then
5802 Make_Raise_Program_Error (Loc,
5803 Reason => PE_Unchecked_Union_Restriction));
5805 -- Prevent Gigi from generating incorrect code by rewriting the
5806 -- equality as a standard False.
5809 New_Occurrence_Of (Standard_False, Loc));
5811 elsif Is_Unchecked_Union (Typl) then
5813 -- If we can infer the discriminants of the operands, we make a
5814 -- call to the TSS equality function.
5816 if Has_Inferable_Discriminants (Lhs)
5818 Has_Inferable_Discriminants (Rhs)
5821 (TSS (Root_Type (Typl), TSS_Composite_Equality));
5824 -- Ada 2005 (AI-216): Program_Error is raised when evaluating
5825 -- the predefined equality operator for an Unchecked_Union type
5826 -- if either of the operands lack inferable discriminants.
5829 Make_Raise_Program_Error (Loc,
5830 Reason => PE_Unchecked_Union_Restriction));
5832 -- Prevent Gigi from generating incorrect code by rewriting
5833 -- the equality as a standard False.
5836 New_Occurrence_Of (Standard_False, Loc));
5840 -- If a type support function is present (for complex cases), use it
5842 elsif Present (TSS (Root_Type (Typl), TSS_Composite_Equality)) then
5844 (TSS (Root_Type (Typl), TSS_Composite_Equality));
5846 -- Otherwise expand the component by component equality. Note that
5847 -- we never use block-bit comparisons for records, because of the
5848 -- problems with gaps. The backend will often be able to recombine
5849 -- the separate comparisons that we generate here.
5852 Remove_Side_Effects (Lhs);
5853 Remove_Side_Effects (Rhs);
5855 Expand_Record_Equality (N, Typl, Lhs, Rhs, Bodies));
5857 Insert_Actions (N, Bodies, Suppress => All_Checks);
5858 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5862 -- Test if result is known at compile time
5864 Rewrite_Comparison (N);
5866 -- If we still have comparison for Vax_Float, process it
5868 if Vax_Float (Typl) and then Nkind (N) in N_Op_Compare then
5869 Expand_Vax_Comparison (N);
5874 -----------------------
5875 -- Expand_N_Op_Expon --
5876 -----------------------
5878 procedure Expand_N_Op_Expon (N : Node_Id) is
5879 Loc : constant Source_Ptr := Sloc (N);
5880 Typ : constant Entity_Id := Etype (N);
5881 Rtyp : constant Entity_Id := Root_Type (Typ);
5882 Base : constant Node_Id := Relocate_Node (Left_Opnd (N));
5883 Bastyp : constant Node_Id := Etype (Base);
5884 Exp : constant Node_Id := Relocate_Node (Right_Opnd (N));
5885 Exptyp : constant Entity_Id := Etype (Exp);
5886 Ovflo : constant Boolean := Do_Overflow_Check (N);
5895 Binary_Op_Validity_Checks (N);
5897 -- If either operand is of a private type, then we have the use of an
5898 -- intrinsic operator, and we get rid of the privateness, by using root
5899 -- types of underlying types for the actual operation. Otherwise the
5900 -- private types will cause trouble if we expand multiplications or
5901 -- shifts etc. We also do this transformation if the result type is
5902 -- different from the base type.
5904 if Is_Private_Type (Etype (Base))
5906 Is_Private_Type (Typ)
5908 Is_Private_Type (Exptyp)
5910 Rtyp /= Root_Type (Bastyp)
5913 Bt : constant Entity_Id := Root_Type (Underlying_Type (Bastyp));
5914 Et : constant Entity_Id := Root_Type (Underlying_Type (Exptyp));
5918 Unchecked_Convert_To (Typ,
5920 Left_Opnd => Unchecked_Convert_To (Bt, Base),
5921 Right_Opnd => Unchecked_Convert_To (Et, Exp))));
5922 Analyze_And_Resolve (N, Typ);
5927 -- Test for case of known right argument
5929 if Compile_Time_Known_Value (Exp) then
5930 Expv := Expr_Value (Exp);
5932 -- We only fold small non-negative exponents. You might think we
5933 -- could fold small negative exponents for the real case, but we
5934 -- can't because we are required to raise Constraint_Error for
5935 -- the case of 0.0 ** (negative) even if Machine_Overflows = False.
5936 -- See ACVC test C4A012B.
5938 if Expv >= 0 and then Expv <= 4 then
5940 -- X ** 0 = 1 (or 1.0)
5944 -- Call Remove_Side_Effects to ensure that any side effects
5945 -- in the ignored left operand (in particular function calls
5946 -- to user defined functions) are properly executed.
5948 Remove_Side_Effects (Base);
5950 if Ekind (Typ) in Integer_Kind then
5951 Xnode := Make_Integer_Literal (Loc, Intval => 1);
5953 Xnode := Make_Real_Literal (Loc, Ureal_1);
5965 Make_Op_Multiply (Loc,
5966 Left_Opnd => Duplicate_Subexpr (Base),
5967 Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
5969 -- X ** 3 = X * X * X
5973 Make_Op_Multiply (Loc,
5975 Make_Op_Multiply (Loc,
5976 Left_Opnd => Duplicate_Subexpr (Base),
5977 Right_Opnd => Duplicate_Subexpr_No_Checks (Base)),
5978 Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
5981 -- En : constant base'type := base * base;
5987 Make_Defining_Identifier (Loc, New_Internal_Name ('E'));
5989 Insert_Actions (N, New_List (
5990 Make_Object_Declaration (Loc,
5991 Defining_Identifier => Temp,
5992 Constant_Present => True,
5993 Object_Definition => New_Reference_To (Typ, Loc),
5995 Make_Op_Multiply (Loc,
5996 Left_Opnd => Duplicate_Subexpr (Base),
5997 Right_Opnd => Duplicate_Subexpr_No_Checks (Base)))));
6000 Make_Op_Multiply (Loc,
6001 Left_Opnd => New_Reference_To (Temp, Loc),
6002 Right_Opnd => New_Reference_To (Temp, Loc));
6006 Analyze_And_Resolve (N, Typ);
6011 -- Case of (2 ** expression) appearing as an argument of an integer
6012 -- multiplication, or as the right argument of a division of a non-
6013 -- negative integer. In such cases we leave the node untouched, setting
6014 -- the flag Is_Natural_Power_Of_2_for_Shift set, then the expansion
6015 -- of the higher level node converts it into a shift.
6017 -- Note: this transformation is not applicable for a modular type with
6018 -- a non-binary modulus in the multiplication case, since we get a wrong
6019 -- result if the shift causes an overflow before the modular reduction.
6021 if Nkind (Base) = N_Integer_Literal
6022 and then Intval (Base) = 2
6023 and then Is_Integer_Type (Root_Type (Exptyp))
6024 and then Esize (Root_Type (Exptyp)) <= Esize (Standard_Integer)
6025 and then Is_Unsigned_Type (Exptyp)
6027 and then Nkind (Parent (N)) in N_Binary_Op
6030 P : constant Node_Id := Parent (N);
6031 L : constant Node_Id := Left_Opnd (P);
6032 R : constant Node_Id := Right_Opnd (P);
6035 if (Nkind (P) = N_Op_Multiply
6036 and then not Non_Binary_Modulus (Typ)
6038 ((Is_Integer_Type (Etype (L)) and then R = N)
6040 (Is_Integer_Type (Etype (R)) and then L = N))
6041 and then not Do_Overflow_Check (P))
6044 (Nkind (P) = N_Op_Divide
6045 and then Is_Integer_Type (Etype (L))
6046 and then Is_Unsigned_Type (Etype (L))
6048 and then not Do_Overflow_Check (P))
6050 Set_Is_Power_Of_2_For_Shift (N);
6056 -- Fall through if exponentiation must be done using a runtime routine
6058 -- First deal with modular case
6060 if Is_Modular_Integer_Type (Rtyp) then
6062 -- Non-binary case, we call the special exponentiation routine for
6063 -- the non-binary case, converting the argument to Long_Long_Integer
6064 -- and passing the modulus value. Then the result is converted back
6065 -- to the base type.
6067 if Non_Binary_Modulus (Rtyp) then
6070 Make_Function_Call (Loc,
6071 Name => New_Reference_To (RTE (RE_Exp_Modular), Loc),
6072 Parameter_Associations => New_List (
6073 Convert_To (Standard_Integer, Base),
6074 Make_Integer_Literal (Loc, Modulus (Rtyp)),
6077 -- Binary case, in this case, we call one of two routines, either the
6078 -- unsigned integer case, or the unsigned long long integer case,
6079 -- with a final "and" operation to do the required mod.
6082 if UI_To_Int (Esize (Rtyp)) <= Standard_Integer_Size then
6083 Ent := RTE (RE_Exp_Unsigned);
6085 Ent := RTE (RE_Exp_Long_Long_Unsigned);
6092 Make_Function_Call (Loc,
6093 Name => New_Reference_To (Ent, Loc),
6094 Parameter_Associations => New_List (
6095 Convert_To (Etype (First_Formal (Ent)), Base),
6098 Make_Integer_Literal (Loc, Modulus (Rtyp) - 1))));
6102 -- Common exit point for modular type case
6104 Analyze_And_Resolve (N, Typ);
6107 -- Signed integer cases, done using either Integer or Long_Long_Integer.
6108 -- It is not worth having routines for Short_[Short_]Integer, since for
6109 -- most machines it would not help, and it would generate more code that
6110 -- might need certification when a certified run time is required.
6112 -- In the integer cases, we have two routines, one for when overflow
6113 -- checks are required, and one when they are not required, since there
6114 -- is a real gain in omitting checks on many machines.
6116 elsif Rtyp = Base_Type (Standard_Long_Long_Integer)
6117 or else (Rtyp = Base_Type (Standard_Long_Integer)
6119 Esize (Standard_Long_Integer) > Esize (Standard_Integer))
6120 or else (Rtyp = Universal_Integer)
6122 Etyp := Standard_Long_Long_Integer;
6125 Rent := RE_Exp_Long_Long_Integer;
6127 Rent := RE_Exn_Long_Long_Integer;
6130 elsif Is_Signed_Integer_Type (Rtyp) then
6131 Etyp := Standard_Integer;
6134 Rent := RE_Exp_Integer;
6136 Rent := RE_Exn_Integer;
6139 -- Floating-point cases, always done using Long_Long_Float. We do not
6140 -- need separate routines for the overflow case here, since in the case
6141 -- of floating-point, we generate infinities anyway as a rule (either
6142 -- that or we automatically trap overflow), and if there is an infinity
6143 -- generated and a range check is required, the check will fail anyway.
6146 pragma Assert (Is_Floating_Point_Type (Rtyp));
6147 Etyp := Standard_Long_Long_Float;
6148 Rent := RE_Exn_Long_Long_Float;
6151 -- Common processing for integer cases and floating-point cases.
6152 -- If we are in the right type, we can call runtime routine directly
6155 and then Rtyp /= Universal_Integer
6156 and then Rtyp /= Universal_Real
6159 Make_Function_Call (Loc,
6160 Name => New_Reference_To (RTE (Rent), Loc),
6161 Parameter_Associations => New_List (Base, Exp)));
6163 -- Otherwise we have to introduce conversions (conversions are also
6164 -- required in the universal cases, since the runtime routine is
6165 -- typed using one of the standard types).
6170 Make_Function_Call (Loc,
6171 Name => New_Reference_To (RTE (Rent), Loc),
6172 Parameter_Associations => New_List (
6173 Convert_To (Etyp, Base),
6177 Analyze_And_Resolve (N, Typ);
6181 when RE_Not_Available =>
6183 end Expand_N_Op_Expon;
6185 --------------------
6186 -- Expand_N_Op_Ge --
6187 --------------------
6189 procedure Expand_N_Op_Ge (N : Node_Id) is
6190 Typ : constant Entity_Id := Etype (N);
6191 Op1 : constant Node_Id := Left_Opnd (N);
6192 Op2 : constant Node_Id := Right_Opnd (N);
6193 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6196 Binary_Op_Validity_Checks (N);
6198 if Is_Array_Type (Typ1) then
6199 Expand_Array_Comparison (N);
6203 if Is_Boolean_Type (Typ1) then
6204 Adjust_Condition (Op1);
6205 Adjust_Condition (Op2);
6206 Set_Etype (N, Standard_Boolean);
6207 Adjust_Result_Type (N, Typ);
6210 Rewrite_Comparison (N);
6212 -- If we still have comparison, and Vax_Float type, process it
6214 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6215 Expand_Vax_Comparison (N);
6220 --------------------
6221 -- Expand_N_Op_Gt --
6222 --------------------
6224 procedure Expand_N_Op_Gt (N : Node_Id) is
6225 Typ : constant Entity_Id := Etype (N);
6226 Op1 : constant Node_Id := Left_Opnd (N);
6227 Op2 : constant Node_Id := Right_Opnd (N);
6228 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6231 Binary_Op_Validity_Checks (N);
6233 if Is_Array_Type (Typ1) then
6234 Expand_Array_Comparison (N);
6238 if Is_Boolean_Type (Typ1) then
6239 Adjust_Condition (Op1);
6240 Adjust_Condition (Op2);
6241 Set_Etype (N, Standard_Boolean);
6242 Adjust_Result_Type (N, Typ);
6245 Rewrite_Comparison (N);
6247 -- If we still have comparison, and Vax_Float type, process it
6249 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6250 Expand_Vax_Comparison (N);
6255 --------------------
6256 -- Expand_N_Op_Le --
6257 --------------------
6259 procedure Expand_N_Op_Le (N : Node_Id) is
6260 Typ : constant Entity_Id := Etype (N);
6261 Op1 : constant Node_Id := Left_Opnd (N);
6262 Op2 : constant Node_Id := Right_Opnd (N);
6263 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6266 Binary_Op_Validity_Checks (N);
6268 if Is_Array_Type (Typ1) then
6269 Expand_Array_Comparison (N);
6273 if Is_Boolean_Type (Typ1) then
6274 Adjust_Condition (Op1);
6275 Adjust_Condition (Op2);
6276 Set_Etype (N, Standard_Boolean);
6277 Adjust_Result_Type (N, Typ);
6280 Rewrite_Comparison (N);
6282 -- If we still have comparison, and Vax_Float type, process it
6284 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6285 Expand_Vax_Comparison (N);
6290 --------------------
6291 -- Expand_N_Op_Lt --
6292 --------------------
6294 procedure Expand_N_Op_Lt (N : Node_Id) is
6295 Typ : constant Entity_Id := Etype (N);
6296 Op1 : constant Node_Id := Left_Opnd (N);
6297 Op2 : constant Node_Id := Right_Opnd (N);
6298 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6301 Binary_Op_Validity_Checks (N);
6303 if Is_Array_Type (Typ1) then
6304 Expand_Array_Comparison (N);
6308 if Is_Boolean_Type (Typ1) then
6309 Adjust_Condition (Op1);
6310 Adjust_Condition (Op2);
6311 Set_Etype (N, Standard_Boolean);
6312 Adjust_Result_Type (N, Typ);
6315 Rewrite_Comparison (N);
6317 -- If we still have comparison, and Vax_Float type, process it
6319 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6320 Expand_Vax_Comparison (N);
6325 -----------------------
6326 -- Expand_N_Op_Minus --
6327 -----------------------
6329 procedure Expand_N_Op_Minus (N : Node_Id) is
6330 Loc : constant Source_Ptr := Sloc (N);
6331 Typ : constant Entity_Id := Etype (N);
6334 Unary_Op_Validity_Checks (N);
6336 if not Backend_Overflow_Checks_On_Target
6337 and then Is_Signed_Integer_Type (Etype (N))
6338 and then Do_Overflow_Check (N)
6340 -- Software overflow checking expands -expr into (0 - expr)
6343 Make_Op_Subtract (Loc,
6344 Left_Opnd => Make_Integer_Literal (Loc, 0),
6345 Right_Opnd => Right_Opnd (N)));
6347 Analyze_And_Resolve (N, Typ);
6349 -- Vax floating-point types case
6351 elsif Vax_Float (Etype (N)) then
6352 Expand_Vax_Arith (N);
6354 end Expand_N_Op_Minus;
6356 ---------------------
6357 -- Expand_N_Op_Mod --
6358 ---------------------
6360 procedure Expand_N_Op_Mod (N : Node_Id) is
6361 Loc : constant Source_Ptr := Sloc (N);
6362 Typ : constant Entity_Id := Etype (N);
6363 Left : constant Node_Id := Left_Opnd (N);
6364 Right : constant Node_Id := Right_Opnd (N);
6365 DOC : constant Boolean := Do_Overflow_Check (N);
6366 DDC : constant Boolean := Do_Division_Check (N);
6376 pragma Warnings (Off, Lhi);
6379 Binary_Op_Validity_Checks (N);
6381 Determine_Range (Right, ROK, Rlo, Rhi, Assume_Valid => True);
6382 Determine_Range (Left, LOK, Llo, Lhi, Assume_Valid => True);
6384 -- Convert mod to rem if operands are known non-negative. We do this
6385 -- since it is quite likely that this will improve the quality of code,
6386 -- (the operation now corresponds to the hardware remainder), and it
6387 -- does not seem likely that it could be harmful.
6389 if LOK and then Llo >= 0
6391 ROK and then Rlo >= 0
6394 Make_Op_Rem (Sloc (N),
6395 Left_Opnd => Left_Opnd (N),
6396 Right_Opnd => Right_Opnd (N)));
6398 -- Instead of reanalyzing the node we do the analysis manually. This
6399 -- avoids anomalies when the replacement is done in an instance and
6400 -- is epsilon more efficient.
6402 Set_Entity (N, Standard_Entity (S_Op_Rem));
6404 Set_Do_Overflow_Check (N, DOC);
6405 Set_Do_Division_Check (N, DDC);
6406 Expand_N_Op_Rem (N);
6409 -- Otherwise, normal mod processing
6412 if Is_Integer_Type (Etype (N)) then
6413 Apply_Divide_Check (N);
6416 -- Apply optimization x mod 1 = 0. We don't really need that with
6417 -- gcc, but it is useful with other back ends (e.g. AAMP), and is
6418 -- certainly harmless.
6420 if Is_Integer_Type (Etype (N))
6421 and then Compile_Time_Known_Value (Right)
6422 and then Expr_Value (Right) = Uint_1
6424 -- Call Remove_Side_Effects to ensure that any side effects in
6425 -- the ignored left operand (in particular function calls to
6426 -- user defined functions) are properly executed.
6428 Remove_Side_Effects (Left);
6430 Rewrite (N, Make_Integer_Literal (Loc, 0));
6431 Analyze_And_Resolve (N, Typ);
6435 -- Deal with annoying case of largest negative number remainder
6436 -- minus one. Gigi does not handle this case correctly, because
6437 -- it generates a divide instruction which may trap in this case.
6439 -- In fact the check is quite easy, if the right operand is -1, then
6440 -- the mod value is always 0, and we can just ignore the left operand
6441 -- completely in this case.
6443 -- The operand type may be private (e.g. in the expansion of an
6444 -- intrinsic operation) so we must use the underlying type to get the
6445 -- bounds, and convert the literals explicitly.
6449 (Type_Low_Bound (Base_Type (Underlying_Type (Etype (Left)))));
6451 if ((not ROK) or else (Rlo <= (-1) and then (-1) <= Rhi))
6453 ((not LOK) or else (Llo = LLB))
6456 Make_Conditional_Expression (Loc,
6457 Expressions => New_List (
6459 Left_Opnd => Duplicate_Subexpr (Right),
6461 Unchecked_Convert_To (Typ,
6462 Make_Integer_Literal (Loc, -1))),
6463 Unchecked_Convert_To (Typ,
6464 Make_Integer_Literal (Loc, Uint_0)),
6465 Relocate_Node (N))));
6467 Set_Analyzed (Next (Next (First (Expressions (N)))));
6468 Analyze_And_Resolve (N, Typ);
6471 end Expand_N_Op_Mod;
6473 --------------------------
6474 -- Expand_N_Op_Multiply --
6475 --------------------------
6477 procedure Expand_N_Op_Multiply (N : Node_Id) is
6478 Loc : constant Source_Ptr := Sloc (N);
6479 Lop : constant Node_Id := Left_Opnd (N);
6480 Rop : constant Node_Id := Right_Opnd (N);
6482 Lp2 : constant Boolean :=
6483 Nkind (Lop) = N_Op_Expon
6484 and then Is_Power_Of_2_For_Shift (Lop);
6486 Rp2 : constant Boolean :=
6487 Nkind (Rop) = N_Op_Expon
6488 and then Is_Power_Of_2_For_Shift (Rop);
6490 Ltyp : constant Entity_Id := Etype (Lop);
6491 Rtyp : constant Entity_Id := Etype (Rop);
6492 Typ : Entity_Id := Etype (N);
6495 Binary_Op_Validity_Checks (N);
6497 -- Special optimizations for integer types
6499 if Is_Integer_Type (Typ) then
6501 -- N * 0 = 0 for integer types
6503 if Compile_Time_Known_Value (Rop)
6504 and then Expr_Value (Rop) = Uint_0
6506 -- Call Remove_Side_Effects to ensure that any side effects in
6507 -- the ignored left operand (in particular function calls to
6508 -- user defined functions) are properly executed.
6510 Remove_Side_Effects (Lop);
6512 Rewrite (N, Make_Integer_Literal (Loc, Uint_0));
6513 Analyze_And_Resolve (N, Typ);
6517 -- Similar handling for 0 * N = 0
6519 if Compile_Time_Known_Value (Lop)
6520 and then Expr_Value (Lop) = Uint_0
6522 Remove_Side_Effects (Rop);
6523 Rewrite (N, Make_Integer_Literal (Loc, Uint_0));
6524 Analyze_And_Resolve (N, Typ);
6528 -- N * 1 = 1 * N = N for integer types
6530 -- This optimisation is not done if we are going to
6531 -- rewrite the product 1 * 2 ** N to a shift.
6533 if Compile_Time_Known_Value (Rop)
6534 and then Expr_Value (Rop) = Uint_1
6540 elsif Compile_Time_Known_Value (Lop)
6541 and then Expr_Value (Lop) = Uint_1
6549 -- Convert x * 2 ** y to Shift_Left (x, y). Note that the fact that
6550 -- Is_Power_Of_2_For_Shift is set means that we know that our left
6551 -- operand is an integer, as required for this to work.
6556 -- Convert 2 ** A * 2 ** B into 2 ** (A + B)
6560 Left_Opnd => Make_Integer_Literal (Loc, 2),
6563 Left_Opnd => Right_Opnd (Lop),
6564 Right_Opnd => Right_Opnd (Rop))));
6565 Analyze_And_Resolve (N, Typ);
6570 Make_Op_Shift_Left (Loc,
6573 Convert_To (Standard_Natural, Right_Opnd (Rop))));
6574 Analyze_And_Resolve (N, Typ);
6578 -- Same processing for the operands the other way round
6582 Make_Op_Shift_Left (Loc,
6585 Convert_To (Standard_Natural, Right_Opnd (Lop))));
6586 Analyze_And_Resolve (N, Typ);
6590 -- Do required fixup of universal fixed operation
6592 if Typ = Universal_Fixed then
6593 Fixup_Universal_Fixed_Operation (N);
6597 -- Multiplications with fixed-point results
6599 if Is_Fixed_Point_Type (Typ) then
6601 -- No special processing if Treat_Fixed_As_Integer is set, since from
6602 -- a semantic point of view such operations are simply integer
6603 -- operations and will be treated that way.
6605 if not Treat_Fixed_As_Integer (N) then
6607 -- Case of fixed * integer => fixed
6609 if Is_Integer_Type (Rtyp) then
6610 Expand_Multiply_Fixed_By_Integer_Giving_Fixed (N);
6612 -- Case of integer * fixed => fixed
6614 elsif Is_Integer_Type (Ltyp) then
6615 Expand_Multiply_Integer_By_Fixed_Giving_Fixed (N);
6617 -- Case of fixed * fixed => fixed
6620 Expand_Multiply_Fixed_By_Fixed_Giving_Fixed (N);
6624 -- Other cases of multiplication of fixed-point operands. Again we
6625 -- exclude the cases where Treat_Fixed_As_Integer flag is set.
6627 elsif (Is_Fixed_Point_Type (Ltyp) or else Is_Fixed_Point_Type (Rtyp))
6628 and then not Treat_Fixed_As_Integer (N)
6630 if Is_Integer_Type (Typ) then
6631 Expand_Multiply_Fixed_By_Fixed_Giving_Integer (N);
6633 pragma Assert (Is_Floating_Point_Type (Typ));
6634 Expand_Multiply_Fixed_By_Fixed_Giving_Float (N);
6637 -- Mixed-mode operations can appear in a non-static universal context,
6638 -- in which case the integer argument must be converted explicitly.
6640 elsif Typ = Universal_Real
6641 and then Is_Integer_Type (Rtyp)
6643 Rewrite (Rop, Convert_To (Universal_Real, Relocate_Node (Rop)));
6645 Analyze_And_Resolve (Rop, Universal_Real);
6647 elsif Typ = Universal_Real
6648 and then Is_Integer_Type (Ltyp)
6650 Rewrite (Lop, Convert_To (Universal_Real, Relocate_Node (Lop)));
6652 Analyze_And_Resolve (Lop, Universal_Real);
6654 -- Non-fixed point cases, check software overflow checking required
6656 elsif Is_Signed_Integer_Type (Etype (N)) then
6657 Apply_Arithmetic_Overflow_Check (N);
6659 -- Deal with VAX float case
6661 elsif Vax_Float (Typ) then
6662 Expand_Vax_Arith (N);
6665 end Expand_N_Op_Multiply;
6667 --------------------
6668 -- Expand_N_Op_Ne --
6669 --------------------
6671 procedure Expand_N_Op_Ne (N : Node_Id) is
6672 Typ : constant Entity_Id := Etype (Left_Opnd (N));
6675 -- Case of elementary type with standard operator
6677 if Is_Elementary_Type (Typ)
6678 and then Sloc (Entity (N)) = Standard_Location
6680 Binary_Op_Validity_Checks (N);
6682 -- Boolean types (requiring handling of non-standard case)
6684 if Is_Boolean_Type (Typ) then
6685 Adjust_Condition (Left_Opnd (N));
6686 Adjust_Condition (Right_Opnd (N));
6687 Set_Etype (N, Standard_Boolean);
6688 Adjust_Result_Type (N, Typ);
6691 Rewrite_Comparison (N);
6693 -- If we still have comparison for Vax_Float, process it
6695 if Vax_Float (Typ) and then Nkind (N) in N_Op_Compare then
6696 Expand_Vax_Comparison (N);
6700 -- For all cases other than elementary types, we rewrite node as the
6701 -- negation of an equality operation, and reanalyze. The equality to be
6702 -- used is defined in the same scope and has the same signature. This
6703 -- signature must be set explicitly since in an instance it may not have
6704 -- the same visibility as in the generic unit. This avoids duplicating
6705 -- or factoring the complex code for record/array equality tests etc.
6709 Loc : constant Source_Ptr := Sloc (N);
6711 Ne : constant Entity_Id := Entity (N);
6714 Binary_Op_Validity_Checks (N);
6720 Left_Opnd => Left_Opnd (N),
6721 Right_Opnd => Right_Opnd (N)));
6722 Set_Paren_Count (Right_Opnd (Neg), 1);
6724 if Scope (Ne) /= Standard_Standard then
6725 Set_Entity (Right_Opnd (Neg), Corresponding_Equality (Ne));
6728 -- For navigation purposes, the inequality is treated as an
6729 -- implicit reference to the corresponding equality. Preserve the
6730 -- Comes_From_ source flag so that the proper Xref entry is
6733 Preserve_Comes_From_Source (Neg, N);
6734 Preserve_Comes_From_Source (Right_Opnd (Neg), N);
6736 Analyze_And_Resolve (N, Standard_Boolean);
6741 ---------------------
6742 -- Expand_N_Op_Not --
6743 ---------------------
6745 -- If the argument is other than a Boolean array type, there is no special
6746 -- expansion required.
6748 -- For the packed case, we call the special routine in Exp_Pakd, except
6749 -- that if the component size is greater than one, we use the standard
6750 -- routine generating a gruesome loop (it is so peculiar to have packed
6751 -- arrays with non-standard Boolean representations anyway, so it does not
6752 -- matter that we do not handle this case efficiently).
6754 -- For the unpacked case (and for the special packed case where we have non
6755 -- standard Booleans, as discussed above), we generate and insert into the
6756 -- tree the following function definition:
6758 -- function Nnnn (A : arr) is
6761 -- for J in a'range loop
6762 -- B (J) := not A (J);
6767 -- Here arr is the actual subtype of the parameter (and hence always
6768 -- constrained). Then we replace the not with a call to this function.
6770 procedure Expand_N_Op_Not (N : Node_Id) is
6771 Loc : constant Source_Ptr := Sloc (N);
6772 Typ : constant Entity_Id := Etype (N);
6781 Func_Name : Entity_Id;
6782 Loop_Statement : Node_Id;
6785 Unary_Op_Validity_Checks (N);
6787 -- For boolean operand, deal with non-standard booleans
6789 if Is_Boolean_Type (Typ) then
6790 Adjust_Condition (Right_Opnd (N));
6791 Set_Etype (N, Standard_Boolean);
6792 Adjust_Result_Type (N, Typ);
6796 -- Only array types need any other processing
6798 if not Is_Array_Type (Typ) then
6802 -- Case of array operand. If bit packed with a component size of 1,
6803 -- handle it in Exp_Pakd if the operand is known to be aligned.
6805 if Is_Bit_Packed_Array (Typ)
6806 and then Component_Size (Typ) = 1
6807 and then not Is_Possibly_Unaligned_Object (Right_Opnd (N))
6809 Expand_Packed_Not (N);
6813 -- Case of array operand which is not bit-packed. If the context is
6814 -- a safe assignment, call in-place operation, If context is a larger
6815 -- boolean expression in the context of a safe assignment, expansion is
6816 -- done by enclosing operation.
6818 Opnd := Relocate_Node (Right_Opnd (N));
6819 Convert_To_Actual_Subtype (Opnd);
6820 Arr := Etype (Opnd);
6821 Ensure_Defined (Arr, N);
6822 Silly_Boolean_Array_Not_Test (N, Arr);
6824 if Nkind (Parent (N)) = N_Assignment_Statement then
6825 if Safe_In_Place_Array_Op (Name (Parent (N)), N, Empty) then
6826 Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
6829 -- Special case the negation of a binary operation
6831 elsif Nkind_In (Opnd, N_Op_And, N_Op_Or, N_Op_Xor)
6832 and then Safe_In_Place_Array_Op
6833 (Name (Parent (N)), Left_Opnd (Opnd), Right_Opnd (Opnd))
6835 Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
6839 elsif Nkind (Parent (N)) in N_Binary_Op
6840 and then Nkind (Parent (Parent (N))) = N_Assignment_Statement
6843 Op1 : constant Node_Id := Left_Opnd (Parent (N));
6844 Op2 : constant Node_Id := Right_Opnd (Parent (N));
6845 Lhs : constant Node_Id := Name (Parent (Parent (N)));
6848 if Safe_In_Place_Array_Op (Lhs, Op1, Op2) then
6850 and then Nkind (Op2) = N_Op_Not
6852 -- (not A) op (not B) can be reduced to a single call
6857 and then Nkind (Parent (N)) = N_Op_Xor
6859 -- A xor (not B) can also be special-cased
6867 A := Make_Defining_Identifier (Loc, Name_uA);
6868 B := Make_Defining_Identifier (Loc, Name_uB);
6869 J := Make_Defining_Identifier (Loc, Name_uJ);
6872 Make_Indexed_Component (Loc,
6873 Prefix => New_Reference_To (A, Loc),
6874 Expressions => New_List (New_Reference_To (J, Loc)));
6877 Make_Indexed_Component (Loc,
6878 Prefix => New_Reference_To (B, Loc),
6879 Expressions => New_List (New_Reference_To (J, Loc)));
6882 Make_Implicit_Loop_Statement (N,
6883 Identifier => Empty,
6886 Make_Iteration_Scheme (Loc,
6887 Loop_Parameter_Specification =>
6888 Make_Loop_Parameter_Specification (Loc,
6889 Defining_Identifier => J,
6890 Discrete_Subtype_Definition =>
6891 Make_Attribute_Reference (Loc,
6892 Prefix => Make_Identifier (Loc, Chars (A)),
6893 Attribute_Name => Name_Range))),
6895 Statements => New_List (
6896 Make_Assignment_Statement (Loc,
6898 Expression => Make_Op_Not (Loc, A_J))));
6900 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('N'));
6901 Set_Is_Inlined (Func_Name);
6904 Make_Subprogram_Body (Loc,
6906 Make_Function_Specification (Loc,
6907 Defining_Unit_Name => Func_Name,
6908 Parameter_Specifications => New_List (
6909 Make_Parameter_Specification (Loc,
6910 Defining_Identifier => A,
6911 Parameter_Type => New_Reference_To (Typ, Loc))),
6912 Result_Definition => New_Reference_To (Typ, Loc)),
6914 Declarations => New_List (
6915 Make_Object_Declaration (Loc,
6916 Defining_Identifier => B,
6917 Object_Definition => New_Reference_To (Arr, Loc))),
6919 Handled_Statement_Sequence =>
6920 Make_Handled_Sequence_Of_Statements (Loc,
6921 Statements => New_List (
6923 Make_Simple_Return_Statement (Loc,
6925 Make_Identifier (Loc, Chars (B)))))));
6928 Make_Function_Call (Loc,
6929 Name => New_Reference_To (Func_Name, Loc),
6930 Parameter_Associations => New_List (Opnd)));
6932 Analyze_And_Resolve (N, Typ);
6933 end Expand_N_Op_Not;
6935 --------------------
6936 -- Expand_N_Op_Or --
6937 --------------------
6939 procedure Expand_N_Op_Or (N : Node_Id) is
6940 Typ : constant Entity_Id := Etype (N);
6943 Binary_Op_Validity_Checks (N);
6945 if Is_Array_Type (Etype (N)) then
6946 Expand_Boolean_Operator (N);
6948 elsif Is_Boolean_Type (Etype (N)) then
6950 -- Replace OR by OR ELSE if Short_Circuit_And_Or active and the
6951 -- type is standard Boolean (do not mess with AND that uses a non-
6952 -- standard Boolean type, because something strange is going on).
6954 if Short_Circuit_And_Or and then Typ = Standard_Boolean then
6956 Make_Or_Else (Sloc (N),
6957 Left_Opnd => Relocate_Node (Left_Opnd (N)),
6958 Right_Opnd => Relocate_Node (Right_Opnd (N))));
6959 Analyze_And_Resolve (N, Typ);
6961 -- Otherwise, adjust conditions
6964 Adjust_Condition (Left_Opnd (N));
6965 Adjust_Condition (Right_Opnd (N));
6966 Set_Etype (N, Standard_Boolean);
6967 Adjust_Result_Type (N, Typ);
6972 ----------------------
6973 -- Expand_N_Op_Plus --
6974 ----------------------
6976 procedure Expand_N_Op_Plus (N : Node_Id) is
6978 Unary_Op_Validity_Checks (N);
6979 end Expand_N_Op_Plus;
6981 ---------------------
6982 -- Expand_N_Op_Rem --
6983 ---------------------
6985 procedure Expand_N_Op_Rem (N : Node_Id) is
6986 Loc : constant Source_Ptr := Sloc (N);
6987 Typ : constant Entity_Id := Etype (N);
6989 Left : constant Node_Id := Left_Opnd (N);
6990 Right : constant Node_Id := Right_Opnd (N);
6998 -- Set if corresponding operand can be negative
7000 pragma Unreferenced (Hi);
7003 Binary_Op_Validity_Checks (N);
7005 if Is_Integer_Type (Etype (N)) then
7006 Apply_Divide_Check (N);
7009 -- Apply optimization x rem 1 = 0. We don't really need that with gcc,
7010 -- but it is useful with other back ends (e.g. AAMP), and is certainly
7013 if Is_Integer_Type (Etype (N))
7014 and then Compile_Time_Known_Value (Right)
7015 and then Expr_Value (Right) = Uint_1
7017 -- Call Remove_Side_Effects to ensure that any side effects in the
7018 -- ignored left operand (in particular function calls to user defined
7019 -- functions) are properly executed.
7021 Remove_Side_Effects (Left);
7023 Rewrite (N, Make_Integer_Literal (Loc, 0));
7024 Analyze_And_Resolve (N, Typ);
7028 -- Deal with annoying case of largest negative number remainder minus
7029 -- one. Gigi does not handle this case correctly, because it generates
7030 -- a divide instruction which may trap in this case.
7032 -- In fact the check is quite easy, if the right operand is -1, then
7033 -- the remainder is always 0, and we can just ignore the left operand
7034 -- completely in this case.
7036 Determine_Range (Right, OK, Lo, Hi, Assume_Valid => True);
7037 Lneg := (not OK) or else Lo < 0;
7039 Determine_Range (Left, OK, Lo, Hi, Assume_Valid => True);
7040 Rneg := (not OK) or else Lo < 0;
7042 -- We won't mess with trying to find out if the left operand can really
7043 -- be the largest negative number (that's a pain in the case of private
7044 -- types and this is really marginal). We will just assume that we need
7045 -- the test if the left operand can be negative at all.
7047 if Lneg and Rneg then
7049 Make_Conditional_Expression (Loc,
7050 Expressions => New_List (
7052 Left_Opnd => Duplicate_Subexpr (Right),
7054 Unchecked_Convert_To (Typ,
7055 Make_Integer_Literal (Loc, -1))),
7057 Unchecked_Convert_To (Typ,
7058 Make_Integer_Literal (Loc, Uint_0)),
7060 Relocate_Node (N))));
7062 Set_Analyzed (Next (Next (First (Expressions (N)))));
7063 Analyze_And_Resolve (N, Typ);
7065 end Expand_N_Op_Rem;
7067 -----------------------------
7068 -- Expand_N_Op_Rotate_Left --
7069 -----------------------------
7071 procedure Expand_N_Op_Rotate_Left (N : Node_Id) is
7073 Binary_Op_Validity_Checks (N);
7074 end Expand_N_Op_Rotate_Left;
7076 ------------------------------
7077 -- Expand_N_Op_Rotate_Right --
7078 ------------------------------
7080 procedure Expand_N_Op_Rotate_Right (N : Node_Id) is
7082 Binary_Op_Validity_Checks (N);
7083 end Expand_N_Op_Rotate_Right;
7085 ----------------------------
7086 -- Expand_N_Op_Shift_Left --
7087 ----------------------------
7089 procedure Expand_N_Op_Shift_Left (N : Node_Id) is
7091 Binary_Op_Validity_Checks (N);
7092 end Expand_N_Op_Shift_Left;
7094 -----------------------------
7095 -- Expand_N_Op_Shift_Right --
7096 -----------------------------
7098 procedure Expand_N_Op_Shift_Right (N : Node_Id) is
7100 Binary_Op_Validity_Checks (N);
7101 end Expand_N_Op_Shift_Right;
7103 ----------------------------------------
7104 -- Expand_N_Op_Shift_Right_Arithmetic --
7105 ----------------------------------------
7107 procedure Expand_N_Op_Shift_Right_Arithmetic (N : Node_Id) is
7109 Binary_Op_Validity_Checks (N);
7110 end Expand_N_Op_Shift_Right_Arithmetic;
7112 --------------------------
7113 -- Expand_N_Op_Subtract --
7114 --------------------------
7116 procedure Expand_N_Op_Subtract (N : Node_Id) is
7117 Typ : constant Entity_Id := Etype (N);
7120 Binary_Op_Validity_Checks (N);
7122 -- N - 0 = N for integer types
7124 if Is_Integer_Type (Typ)
7125 and then Compile_Time_Known_Value (Right_Opnd (N))
7126 and then Expr_Value (Right_Opnd (N)) = 0
7128 Rewrite (N, Left_Opnd (N));
7132 -- Arithmetic overflow checks for signed integer/fixed point types
7134 if Is_Signed_Integer_Type (Typ)
7135 or else Is_Fixed_Point_Type (Typ)
7137 Apply_Arithmetic_Overflow_Check (N);
7139 -- Vax floating-point types case
7141 elsif Vax_Float (Typ) then
7142 Expand_Vax_Arith (N);
7144 end Expand_N_Op_Subtract;
7146 ---------------------
7147 -- Expand_N_Op_Xor --
7148 ---------------------
7150 procedure Expand_N_Op_Xor (N : Node_Id) is
7151 Typ : constant Entity_Id := Etype (N);
7154 Binary_Op_Validity_Checks (N);
7156 if Is_Array_Type (Etype (N)) then
7157 Expand_Boolean_Operator (N);
7159 elsif Is_Boolean_Type (Etype (N)) then
7160 Adjust_Condition (Left_Opnd (N));
7161 Adjust_Condition (Right_Opnd (N));
7162 Set_Etype (N, Standard_Boolean);
7163 Adjust_Result_Type (N, Typ);
7165 end Expand_N_Op_Xor;
7167 ----------------------
7168 -- Expand_N_Or_Else --
7169 ----------------------
7171 -- Expand into conditional expression if Actions present, and also
7172 -- deal with optimizing case of arguments being True or False.
7174 procedure Expand_N_Or_Else (N : Node_Id) is
7175 Loc : constant Source_Ptr := Sloc (N);
7176 Typ : constant Entity_Id := Etype (N);
7177 Left : constant Node_Id := Left_Opnd (N);
7178 Right : constant Node_Id := Right_Opnd (N);
7182 -- Deal with non-standard booleans
7184 if Is_Boolean_Type (Typ) then
7185 Adjust_Condition (Left);
7186 Adjust_Condition (Right);
7187 Set_Etype (N, Standard_Boolean);
7190 -- Check for cases where left argument is known to be True or False
7192 if Compile_Time_Known_Value (Left) then
7194 -- If left argument is False, change (False or else Right) to Right.
7195 -- Any actions associated with Right will be executed unconditionally
7196 -- and can thus be inserted into the tree unconditionally.
7198 if Expr_Value_E (Left) = Standard_False then
7199 if Present (Actions (N)) then
7200 Insert_Actions (N, Actions (N));
7205 -- If left argument is True, change (True and then Right) to True. In
7206 -- this case we can forget the actions associated with Right, since
7207 -- they will never be executed.
7209 else pragma Assert (Expr_Value_E (Left) = Standard_True);
7210 Kill_Dead_Code (Right);
7211 Kill_Dead_Code (Actions (N));
7212 Rewrite (N, New_Occurrence_Of (Standard_True, Loc));
7215 Adjust_Result_Type (N, Typ);
7219 -- If Actions are present, we expand
7221 -- left or else right
7225 -- if left then True else right end
7227 -- with the actions becoming the Else_Actions of the conditional
7228 -- expression. This conditional expression is then further expanded
7229 -- (and will eventually disappear)
7231 if Present (Actions (N)) then
7232 Actlist := Actions (N);
7234 Make_Conditional_Expression (Loc,
7235 Expressions => New_List (
7237 New_Occurrence_Of (Standard_True, Loc),
7240 Set_Else_Actions (N, Actlist);
7241 Analyze_And_Resolve (N, Standard_Boolean);
7242 Adjust_Result_Type (N, Typ);
7246 -- No actions present, check for cases of right argument True/False
7248 if Compile_Time_Known_Value (Right) then
7250 -- Change (Left or else False) to Left. Note that we know there are
7251 -- no actions associated with the True operand, since we just checked
7252 -- for this case above.
7254 if Expr_Value_E (Right) = Standard_False then
7257 -- Change (Left or else True) to True, making sure to preserve any
7258 -- side effects associated with the Left operand.
7260 else pragma Assert (Expr_Value_E (Right) = Standard_True);
7261 Remove_Side_Effects (Left);
7263 (N, New_Occurrence_Of (Standard_True, Loc));
7267 Adjust_Result_Type (N, Typ);
7268 end Expand_N_Or_Else;
7270 -----------------------------------
7271 -- Expand_N_Qualified_Expression --
7272 -----------------------------------
7274 procedure Expand_N_Qualified_Expression (N : Node_Id) is
7275 Operand : constant Node_Id := Expression (N);
7276 Target_Type : constant Entity_Id := Entity (Subtype_Mark (N));
7279 -- Do validity check if validity checking operands
7281 if Validity_Checks_On
7282 and then Validity_Check_Operands
7284 Ensure_Valid (Operand);
7287 -- Apply possible constraint check
7289 Apply_Constraint_Check (Operand, Target_Type, No_Sliding => True);
7291 if Do_Range_Check (Operand) then
7292 Set_Do_Range_Check (Operand, False);
7293 Generate_Range_Check (Operand, Target_Type, CE_Range_Check_Failed);
7295 end Expand_N_Qualified_Expression;
7297 ---------------------------------
7298 -- Expand_N_Selected_Component --
7299 ---------------------------------
7301 -- If the selector is a discriminant of a concurrent object, rewrite the
7302 -- prefix to denote the corresponding record type.
7304 procedure Expand_N_Selected_Component (N : Node_Id) is
7305 Loc : constant Source_Ptr := Sloc (N);
7306 Par : constant Node_Id := Parent (N);
7307 P : constant Node_Id := Prefix (N);
7308 Ptyp : Entity_Id := Underlying_Type (Etype (P));
7313 function In_Left_Hand_Side (Comp : Node_Id) return Boolean;
7314 -- Gigi needs a temporary for prefixes that depend on a discriminant,
7315 -- unless the context of an assignment can provide size information.
7316 -- Don't we have a general routine that does this???
7318 -----------------------
7319 -- In_Left_Hand_Side --
7320 -----------------------
7322 function In_Left_Hand_Side (Comp : Node_Id) return Boolean is
7324 return (Nkind (Parent (Comp)) = N_Assignment_Statement
7325 and then Comp = Name (Parent (Comp)))
7326 or else (Present (Parent (Comp))
7327 and then Nkind (Parent (Comp)) in N_Subexpr
7328 and then In_Left_Hand_Side (Parent (Comp)));
7329 end In_Left_Hand_Side;
7331 -- Start of processing for Expand_N_Selected_Component
7334 -- Insert explicit dereference if required
7336 if Is_Access_Type (Ptyp) then
7337 Insert_Explicit_Dereference (P);
7338 Analyze_And_Resolve (P, Designated_Type (Ptyp));
7340 if Ekind (Etype (P)) = E_Private_Subtype
7341 and then Is_For_Access_Subtype (Etype (P))
7343 Set_Etype (P, Base_Type (Etype (P)));
7349 -- Deal with discriminant check required
7351 if Do_Discriminant_Check (N) then
7353 -- Present the discriminant checking function to the backend, so that
7354 -- it can inline the call to the function.
7357 (Discriminant_Checking_Func
7358 (Original_Record_Component (Entity (Selector_Name (N)))));
7360 -- Now reset the flag and generate the call
7362 Set_Do_Discriminant_Check (N, False);
7363 Generate_Discriminant_Check (N);
7366 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
7367 -- function, then additional actuals must be passed.
7369 if Ada_Version >= Ada_05
7370 and then Is_Build_In_Place_Function_Call (P)
7372 Make_Build_In_Place_Call_In_Anonymous_Context (P);
7375 -- Gigi cannot handle unchecked conversions that are the prefix of a
7376 -- selected component with discriminants. This must be checked during
7377 -- expansion, because during analysis the type of the selector is not
7378 -- known at the point the prefix is analyzed. If the conversion is the
7379 -- target of an assignment, then we cannot force the evaluation.
7381 if Nkind (Prefix (N)) = N_Unchecked_Type_Conversion
7382 and then Has_Discriminants (Etype (N))
7383 and then not In_Left_Hand_Side (N)
7385 Force_Evaluation (Prefix (N));
7388 -- Remaining processing applies only if selector is a discriminant
7390 if Ekind (Entity (Selector_Name (N))) = E_Discriminant then
7392 -- If the selector is a discriminant of a constrained record type,
7393 -- we may be able to rewrite the expression with the actual value
7394 -- of the discriminant, a useful optimization in some cases.
7396 if Is_Record_Type (Ptyp)
7397 and then Has_Discriminants (Ptyp)
7398 and then Is_Constrained (Ptyp)
7400 -- Do this optimization for discrete types only, and not for
7401 -- access types (access discriminants get us into trouble!)
7403 if not Is_Discrete_Type (Etype (N)) then
7406 -- Don't do this on the left hand of an assignment statement.
7407 -- Normally one would think that references like this would
7408 -- not occur, but they do in generated code, and mean that
7409 -- we really do want to assign the discriminant!
7411 elsif Nkind (Par) = N_Assignment_Statement
7412 and then Name (Par) = N
7416 -- Don't do this optimization for the prefix of an attribute or
7417 -- the operand of an object renaming declaration since these are
7418 -- contexts where we do not want the value anyway.
7420 elsif (Nkind (Par) = N_Attribute_Reference
7421 and then Prefix (Par) = N)
7422 or else Is_Renamed_Object (N)
7426 -- Don't do this optimization if we are within the code for a
7427 -- discriminant check, since the whole point of such a check may
7428 -- be to verify the condition on which the code below depends!
7430 elsif Is_In_Discriminant_Check (N) then
7433 -- Green light to see if we can do the optimization. There is
7434 -- still one condition that inhibits the optimization below but
7435 -- now is the time to check the particular discriminant.
7438 -- Loop through discriminants to find the matching discriminant
7439 -- constraint to see if we can copy it.
7441 Disc := First_Discriminant (Ptyp);
7442 Dcon := First_Elmt (Discriminant_Constraint (Ptyp));
7443 Discr_Loop : while Present (Dcon) loop
7445 -- Check if this is the matching discriminant
7447 if Disc = Entity (Selector_Name (N)) then
7449 -- Here we have the matching discriminant. Check for
7450 -- the case of a discriminant of a component that is
7451 -- constrained by an outer discriminant, which cannot
7452 -- be optimized away.
7455 Denotes_Discriminant
7456 (Node (Dcon), Check_Concurrent => True)
7460 -- In the context of a case statement, the expression may
7461 -- have the base type of the discriminant, and we need to
7462 -- preserve the constraint to avoid spurious errors on
7465 elsif Nkind (Parent (N)) = N_Case_Statement
7466 and then Etype (Node (Dcon)) /= Etype (Disc)
7469 Make_Qualified_Expression (Loc,
7471 New_Occurrence_Of (Etype (Disc), Loc),
7473 New_Copy_Tree (Node (Dcon))));
7474 Analyze_And_Resolve (N, Etype (Disc));
7476 -- In case that comes out as a static expression,
7477 -- reset it (a selected component is never static).
7479 Set_Is_Static_Expression (N, False);
7482 -- Otherwise we can just copy the constraint, but the
7483 -- result is certainly not static! In some cases the
7484 -- discriminant constraint has been analyzed in the
7485 -- context of the original subtype indication, but for
7486 -- itypes the constraint might not have been analyzed
7487 -- yet, and this must be done now.
7490 Rewrite (N, New_Copy_Tree (Node (Dcon)));
7491 Analyze_And_Resolve (N);
7492 Set_Is_Static_Expression (N, False);
7498 Next_Discriminant (Disc);
7499 end loop Discr_Loop;
7501 -- Note: the above loop should always find a matching
7502 -- discriminant, but if it does not, we just missed an
7503 -- optimization due to some glitch (perhaps a previous error),
7509 -- The only remaining processing is in the case of a discriminant of
7510 -- a concurrent object, where we rewrite the prefix to denote the
7511 -- corresponding record type. If the type is derived and has renamed
7512 -- discriminants, use corresponding discriminant, which is the one
7513 -- that appears in the corresponding record.
7515 if not Is_Concurrent_Type (Ptyp) then
7519 Disc := Entity (Selector_Name (N));
7521 if Is_Derived_Type (Ptyp)
7522 and then Present (Corresponding_Discriminant (Disc))
7524 Disc := Corresponding_Discriminant (Disc);
7528 Make_Selected_Component (Loc,
7530 Unchecked_Convert_To (Corresponding_Record_Type (Ptyp),
7532 Selector_Name => Make_Identifier (Loc, Chars (Disc)));
7537 end Expand_N_Selected_Component;
7539 --------------------
7540 -- Expand_N_Slice --
7541 --------------------
7543 procedure Expand_N_Slice (N : Node_Id) is
7544 Loc : constant Source_Ptr := Sloc (N);
7545 Typ : constant Entity_Id := Etype (N);
7546 Pfx : constant Node_Id := Prefix (N);
7547 Ptp : Entity_Id := Etype (Pfx);
7549 function Is_Procedure_Actual (N : Node_Id) return Boolean;
7550 -- Check whether the argument is an actual for a procedure call, in
7551 -- which case the expansion of a bit-packed slice is deferred until the
7552 -- call itself is expanded. The reason this is required is that we might
7553 -- have an IN OUT or OUT parameter, and the copy out is essential, and
7554 -- that copy out would be missed if we created a temporary here in
7555 -- Expand_N_Slice. Note that we don't bother to test specifically for an
7556 -- IN OUT or OUT mode parameter, since it is a bit tricky to do, and it
7557 -- is harmless to defer expansion in the IN case, since the call
7558 -- processing will still generate the appropriate copy in operation,
7559 -- which will take care of the slice.
7561 procedure Make_Temporary_For_Slice;
7562 -- Create a named variable for the value of the slice, in cases where
7563 -- the back-end cannot handle it properly, e.g. when packed types or
7564 -- unaligned slices are involved.
7566 -------------------------
7567 -- Is_Procedure_Actual --
7568 -------------------------
7570 function Is_Procedure_Actual (N : Node_Id) return Boolean is
7571 Par : Node_Id := Parent (N);
7575 -- If our parent is a procedure call we can return
7577 if Nkind (Par) = N_Procedure_Call_Statement then
7580 -- If our parent is a type conversion, keep climbing the tree,
7581 -- since a type conversion can be a procedure actual. Also keep
7582 -- climbing if parameter association or a qualified expression,
7583 -- since these are additional cases that do can appear on
7584 -- procedure actuals.
7586 elsif Nkind_In (Par, N_Type_Conversion,
7587 N_Parameter_Association,
7588 N_Qualified_Expression)
7590 Par := Parent (Par);
7592 -- Any other case is not what we are looking for
7598 end Is_Procedure_Actual;
7600 ------------------------------
7601 -- Make_Temporary_For_Slice --
7602 ------------------------------
7604 procedure Make_Temporary_For_Slice is
7606 Ent : constant Entity_Id := Make_Temporary (Loc, 'T', N);
7609 Make_Object_Declaration (Loc,
7610 Defining_Identifier => Ent,
7611 Object_Definition => New_Occurrence_Of (Typ, Loc));
7613 Set_No_Initialization (Decl);
7615 Insert_Actions (N, New_List (
7617 Make_Assignment_Statement (Loc,
7618 Name => New_Occurrence_Of (Ent, Loc),
7619 Expression => Relocate_Node (N))));
7621 Rewrite (N, New_Occurrence_Of (Ent, Loc));
7622 Analyze_And_Resolve (N, Typ);
7623 end Make_Temporary_For_Slice;
7625 -- Start of processing for Expand_N_Slice
7628 -- Special handling for access types
7630 if Is_Access_Type (Ptp) then
7632 Ptp := Designated_Type (Ptp);
7635 Make_Explicit_Dereference (Sloc (N),
7636 Prefix => Relocate_Node (Pfx)));
7638 Analyze_And_Resolve (Pfx, Ptp);
7641 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
7642 -- function, then additional actuals must be passed.
7644 if Ada_Version >= Ada_05
7645 and then Is_Build_In_Place_Function_Call (Pfx)
7647 Make_Build_In_Place_Call_In_Anonymous_Context (Pfx);
7650 -- The remaining case to be handled is packed slices. We can leave
7651 -- packed slices as they are in the following situations:
7653 -- 1. Right or left side of an assignment (we can handle this
7654 -- situation correctly in the assignment statement expansion).
7656 -- 2. Prefix of indexed component (the slide is optimized away in this
7657 -- case, see the start of Expand_N_Slice.)
7659 -- 3. Object renaming declaration, since we want the name of the
7660 -- slice, not the value.
7662 -- 4. Argument to procedure call, since copy-in/copy-out handling may
7663 -- be required, and this is handled in the expansion of call
7666 -- 5. Prefix of an address attribute (this is an error which is caught
7667 -- elsewhere, and the expansion would interfere with generating the
7670 if not Is_Packed (Typ) then
7672 -- Apply transformation for actuals of a function call, where
7673 -- Expand_Actuals is not used.
7675 if Nkind (Parent (N)) = N_Function_Call
7676 and then Is_Possibly_Unaligned_Slice (N)
7678 Make_Temporary_For_Slice;
7681 elsif Nkind (Parent (N)) = N_Assignment_Statement
7682 or else (Nkind (Parent (Parent (N))) = N_Assignment_Statement
7683 and then Parent (N) = Name (Parent (Parent (N))))
7687 elsif Nkind (Parent (N)) = N_Indexed_Component
7688 or else Is_Renamed_Object (N)
7689 or else Is_Procedure_Actual (N)
7693 elsif Nkind (Parent (N)) = N_Attribute_Reference
7694 and then Attribute_Name (Parent (N)) = Name_Address
7699 Make_Temporary_For_Slice;
7703 ------------------------------
7704 -- Expand_N_Type_Conversion --
7705 ------------------------------
7707 procedure Expand_N_Type_Conversion (N : Node_Id) is
7708 Loc : constant Source_Ptr := Sloc (N);
7709 Operand : constant Node_Id := Expression (N);
7710 Target_Type : constant Entity_Id := Etype (N);
7711 Operand_Type : Entity_Id := Etype (Operand);
7713 procedure Handle_Changed_Representation;
7714 -- This is called in the case of record and array type conversions to
7715 -- see if there is a change of representation to be handled. Change of
7716 -- representation is actually handled at the assignment statement level,
7717 -- and what this procedure does is rewrite node N conversion as an
7718 -- assignment to temporary. If there is no change of representation,
7719 -- then the conversion node is unchanged.
7721 procedure Raise_Accessibility_Error;
7722 -- Called when we know that an accessibility check will fail. Rewrites
7723 -- node N to an appropriate raise statement and outputs warning msgs.
7724 -- The Etype of the raise node is set to Target_Type.
7726 procedure Real_Range_Check;
7727 -- Handles generation of range check for real target value
7729 -----------------------------------
7730 -- Handle_Changed_Representation --
7731 -----------------------------------
7733 procedure Handle_Changed_Representation is
7743 -- Nothing else to do if no change of representation
7745 if Same_Representation (Operand_Type, Target_Type) then
7748 -- The real change of representation work is done by the assignment
7749 -- statement processing. So if this type conversion is appearing as
7750 -- the expression of an assignment statement, nothing needs to be
7751 -- done to the conversion.
7753 elsif Nkind (Parent (N)) = N_Assignment_Statement then
7756 -- Otherwise we need to generate a temporary variable, and do the
7757 -- change of representation assignment into that temporary variable.
7758 -- The conversion is then replaced by a reference to this variable.
7763 -- If type is unconstrained we have to add a constraint, copied
7764 -- from the actual value of the left hand side.
7766 if not Is_Constrained (Target_Type) then
7767 if Has_Discriminants (Operand_Type) then
7768 Disc := First_Discriminant (Operand_Type);
7770 if Disc /= First_Stored_Discriminant (Operand_Type) then
7771 Disc := First_Stored_Discriminant (Operand_Type);
7775 while Present (Disc) loop
7777 Make_Selected_Component (Loc,
7778 Prefix => Duplicate_Subexpr_Move_Checks (Operand),
7780 Make_Identifier (Loc, Chars (Disc))));
7781 Next_Discriminant (Disc);
7784 elsif Is_Array_Type (Operand_Type) then
7785 N_Ix := First_Index (Target_Type);
7788 for J in 1 .. Number_Dimensions (Operand_Type) loop
7790 -- We convert the bounds explicitly. We use an unchecked
7791 -- conversion because bounds checks are done elsewhere.
7796 Unchecked_Convert_To (Etype (N_Ix),
7797 Make_Attribute_Reference (Loc,
7799 Duplicate_Subexpr_No_Checks
7800 (Operand, Name_Req => True),
7801 Attribute_Name => Name_First,
7802 Expressions => New_List (
7803 Make_Integer_Literal (Loc, J)))),
7806 Unchecked_Convert_To (Etype (N_Ix),
7807 Make_Attribute_Reference (Loc,
7809 Duplicate_Subexpr_No_Checks
7810 (Operand, Name_Req => True),
7811 Attribute_Name => Name_Last,
7812 Expressions => New_List (
7813 Make_Integer_Literal (Loc, J))))));
7820 Odef := New_Occurrence_Of (Target_Type, Loc);
7822 if Present (Cons) then
7824 Make_Subtype_Indication (Loc,
7825 Subtype_Mark => Odef,
7827 Make_Index_Or_Discriminant_Constraint (Loc,
7828 Constraints => Cons));
7831 Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('C'));
7833 Make_Object_Declaration (Loc,
7834 Defining_Identifier => Temp,
7835 Object_Definition => Odef);
7837 Set_No_Initialization (Decl, True);
7839 -- Insert required actions. It is essential to suppress checks
7840 -- since we have suppressed default initialization, which means
7841 -- that the variable we create may have no discriminants.
7846 Make_Assignment_Statement (Loc,
7847 Name => New_Occurrence_Of (Temp, Loc),
7848 Expression => Relocate_Node (N))),
7849 Suppress => All_Checks);
7851 Rewrite (N, New_Occurrence_Of (Temp, Loc));
7854 end Handle_Changed_Representation;
7856 -------------------------------
7857 -- Raise_Accessibility_Error --
7858 -------------------------------
7860 procedure Raise_Accessibility_Error is
7863 Make_Raise_Program_Error (Sloc (N),
7864 Reason => PE_Accessibility_Check_Failed));
7865 Set_Etype (N, Target_Type);
7867 Error_Msg_N ("?accessibility check failure", N);
7869 ("\?& will be raised at run time", N, Standard_Program_Error);
7870 end Raise_Accessibility_Error;
7872 ----------------------
7873 -- Real_Range_Check --
7874 ----------------------
7876 -- Case of conversions to floating-point or fixed-point. If range checks
7877 -- are enabled and the target type has a range constraint, we convert:
7883 -- Tnn : typ'Base := typ'Base (x);
7884 -- [constraint_error when Tnn < typ'First or else Tnn > typ'Last]
7887 -- This is necessary when there is a conversion of integer to float or
7888 -- to fixed-point to ensure that the correct checks are made. It is not
7889 -- necessary for float to float where it is enough to simply set the
7890 -- Do_Range_Check flag.
7892 procedure Real_Range_Check is
7893 Btyp : constant Entity_Id := Base_Type (Target_Type);
7894 Lo : constant Node_Id := Type_Low_Bound (Target_Type);
7895 Hi : constant Node_Id := Type_High_Bound (Target_Type);
7896 Xtyp : constant Entity_Id := Etype (Operand);
7901 -- Nothing to do if conversion was rewritten
7903 if Nkind (N) /= N_Type_Conversion then
7907 -- Nothing to do if range checks suppressed, or target has the same
7908 -- range as the base type (or is the base type).
7910 if Range_Checks_Suppressed (Target_Type)
7911 or else (Lo = Type_Low_Bound (Btyp)
7913 Hi = Type_High_Bound (Btyp))
7918 -- Nothing to do if expression is an entity on which checks have been
7921 if Is_Entity_Name (Operand)
7922 and then Range_Checks_Suppressed (Entity (Operand))
7927 -- Nothing to do if bounds are all static and we can tell that the
7928 -- expression is within the bounds of the target. Note that if the
7929 -- operand is of an unconstrained floating-point type, then we do
7930 -- not trust it to be in range (might be infinite)
7933 S_Lo : constant Node_Id := Type_Low_Bound (Xtyp);
7934 S_Hi : constant Node_Id := Type_High_Bound (Xtyp);
7937 if (not Is_Floating_Point_Type (Xtyp)
7938 or else Is_Constrained (Xtyp))
7939 and then Compile_Time_Known_Value (S_Lo)
7940 and then Compile_Time_Known_Value (S_Hi)
7941 and then Compile_Time_Known_Value (Hi)
7942 and then Compile_Time_Known_Value (Lo)
7945 D_Lov : constant Ureal := Expr_Value_R (Lo);
7946 D_Hiv : constant Ureal := Expr_Value_R (Hi);
7951 if Is_Real_Type (Xtyp) then
7952 S_Lov := Expr_Value_R (S_Lo);
7953 S_Hiv := Expr_Value_R (S_Hi);
7955 S_Lov := UR_From_Uint (Expr_Value (S_Lo));
7956 S_Hiv := UR_From_Uint (Expr_Value (S_Hi));
7960 and then S_Lov >= D_Lov
7961 and then S_Hiv <= D_Hiv
7963 Set_Do_Range_Check (Operand, False);
7970 -- For float to float conversions, we are done
7972 if Is_Floating_Point_Type (Xtyp)
7974 Is_Floating_Point_Type (Btyp)
7979 -- Otherwise rewrite the conversion as described above
7981 Conv := Relocate_Node (N);
7982 Rewrite (Subtype_Mark (Conv), New_Occurrence_Of (Btyp, Loc));
7983 Set_Etype (Conv, Btyp);
7985 -- Enable overflow except for case of integer to float conversions,
7986 -- where it is never required, since we can never have overflow in
7989 if not Is_Integer_Type (Etype (Operand)) then
7990 Enable_Overflow_Check (Conv);
7994 Make_Defining_Identifier (Loc,
7995 Chars => New_Internal_Name ('T'));
7997 Insert_Actions (N, New_List (
7998 Make_Object_Declaration (Loc,
7999 Defining_Identifier => Tnn,
8000 Object_Definition => New_Occurrence_Of (Btyp, Loc),
8001 Expression => Conv),
8003 Make_Raise_Constraint_Error (Loc,
8008 Left_Opnd => New_Occurrence_Of (Tnn, Loc),
8010 Make_Attribute_Reference (Loc,
8011 Attribute_Name => Name_First,
8013 New_Occurrence_Of (Target_Type, Loc))),
8017 Left_Opnd => New_Occurrence_Of (Tnn, Loc),
8019 Make_Attribute_Reference (Loc,
8020 Attribute_Name => Name_Last,
8022 New_Occurrence_Of (Target_Type, Loc)))),
8023 Reason => CE_Range_Check_Failed)));
8025 Rewrite (N, New_Occurrence_Of (Tnn, Loc));
8026 Analyze_And_Resolve (N, Btyp);
8027 end Real_Range_Check;
8029 -- Start of processing for Expand_N_Type_Conversion
8032 -- Nothing at all to do if conversion is to the identical type so remove
8033 -- the conversion completely, it is useless, except that it may carry
8034 -- an Assignment_OK attribute, which must be propagated to the operand.
8036 if Operand_Type = Target_Type then
8037 if Assignment_OK (N) then
8038 Set_Assignment_OK (Operand);
8041 Rewrite (N, Relocate_Node (Operand));
8045 -- Nothing to do if this is the second argument of read. This is a
8046 -- "backwards" conversion that will be handled by the specialized code
8047 -- in attribute processing.
8049 if Nkind (Parent (N)) = N_Attribute_Reference
8050 and then Attribute_Name (Parent (N)) = Name_Read
8051 and then Next (First (Expressions (Parent (N)))) = N
8056 -- Here if we may need to expand conversion
8058 -- If the operand of the type conversion is an arithmetic operation on
8059 -- signed integers, and the based type of the signed integer type in
8060 -- question is smaller than Standard.Integer, we promote both of the
8061 -- operands to type Integer.
8063 -- For example, if we have
8065 -- target-type (opnd1 + opnd2)
8067 -- and opnd1 and opnd2 are of type short integer, then we rewrite
8070 -- target-type (integer(opnd1) + integer(opnd2))
8072 -- We do this because we are always allowed to compute in a larger type
8073 -- if we do the right thing with the result, and in this case we are
8074 -- going to do a conversion which will do an appropriate check to make
8075 -- sure that things are in range of the target type in any case. This
8076 -- avoids some unnecessary intermediate overflows.
8078 -- We might consider a similar transformation in the case where the
8079 -- target is a real type or a 64-bit integer type, and the operand
8080 -- is an arithmetic operation using a 32-bit integer type. However,
8081 -- we do not bother with this case, because it could cause significant
8082 -- ineffiencies on 32-bit machines. On a 64-bit machine it would be
8083 -- much cheaper, but we don't want different behavior on 32-bit and
8084 -- 64-bit machines. Note that the exclusion of the 64-bit case also
8085 -- handles the configurable run-time cases where 64-bit arithmetic
8086 -- may simply be unavailable.
8088 -- Note: this circuit is partially redundant with respect to the circuit
8089 -- in Checks.Apply_Arithmetic_Overflow_Check, but we catch more cases in
8090 -- the processing here. Also we still need the Checks circuit, since we
8091 -- have to be sure not to generate junk overflow checks in the first
8092 -- place, since it would be trick to remove them here!
8094 if Integer_Promotion_Possible (N) then
8096 -- All conditions met, go ahead with transformation
8104 Make_Type_Conversion (Loc,
8105 Subtype_Mark => New_Reference_To (Standard_Integer, Loc),
8106 Expression => Relocate_Node (Right_Opnd (Operand)));
8108 Opnd := New_Op_Node (Nkind (Operand), Loc);
8109 Set_Right_Opnd (Opnd, R);
8111 if Nkind (Operand) in N_Binary_Op then
8113 Make_Type_Conversion (Loc,
8114 Subtype_Mark => New_Reference_To (Standard_Integer, Loc),
8115 Expression => Relocate_Node (Left_Opnd (Operand)));
8117 Set_Left_Opnd (Opnd, L);
8121 Make_Type_Conversion (Loc,
8122 Subtype_Mark => Relocate_Node (Subtype_Mark (N)),
8123 Expression => Opnd));
8125 Analyze_And_Resolve (N, Target_Type);
8130 -- Do validity check if validity checking operands
8132 if Validity_Checks_On
8133 and then Validity_Check_Operands
8135 Ensure_Valid (Operand);
8138 -- Special case of converting from non-standard boolean type
8140 if Is_Boolean_Type (Operand_Type)
8141 and then (Nonzero_Is_True (Operand_Type))
8143 Adjust_Condition (Operand);
8144 Set_Etype (Operand, Standard_Boolean);
8145 Operand_Type := Standard_Boolean;
8148 -- Case of converting to an access type
8150 if Is_Access_Type (Target_Type) then
8152 -- Apply an accessibility check when the conversion operand is an
8153 -- access parameter (or a renaming thereof), unless conversion was
8154 -- expanded from an Unchecked_ or Unrestricted_Access attribute.
8155 -- Note that other checks may still need to be applied below (such
8156 -- as tagged type checks).
8158 if Is_Entity_Name (Operand)
8160 (Is_Formal (Entity (Operand))
8162 (Present (Renamed_Object (Entity (Operand)))
8163 and then Is_Entity_Name (Renamed_Object (Entity (Operand)))
8165 (Entity (Renamed_Object (Entity (Operand))))))
8166 and then Ekind (Etype (Operand)) = E_Anonymous_Access_Type
8167 and then (Nkind (Original_Node (N)) /= N_Attribute_Reference
8168 or else Attribute_Name (Original_Node (N)) = Name_Access)
8170 Apply_Accessibility_Check
8171 (Operand, Target_Type, Insert_Node => Operand);
8173 -- If the level of the operand type is statically deeper than the
8174 -- level of the target type, then force Program_Error. Note that this
8175 -- can only occur for cases where the attribute is within the body of
8176 -- an instantiation (otherwise the conversion will already have been
8177 -- rejected as illegal). Note: warnings are issued by the analyzer
8178 -- for the instance cases.
8180 elsif In_Instance_Body
8181 and then Type_Access_Level (Operand_Type) >
8182 Type_Access_Level (Target_Type)
8184 Raise_Accessibility_Error;
8186 -- When the operand is a selected access discriminant the check needs
8187 -- to be made against the level of the object denoted by the prefix
8188 -- of the selected name. Force Program_Error for this case as well
8189 -- (this accessibility violation can only happen if within the body
8190 -- of an instantiation).
8192 elsif In_Instance_Body
8193 and then Ekind (Operand_Type) = E_Anonymous_Access_Type
8194 and then Nkind (Operand) = N_Selected_Component
8195 and then Object_Access_Level (Operand) >
8196 Type_Access_Level (Target_Type)
8198 Raise_Accessibility_Error;
8203 -- Case of conversions of tagged types and access to tagged types
8205 -- When needed, that is to say when the expression is class-wide, Add
8206 -- runtime a tag check for (strict) downward conversion by using the
8207 -- membership test, generating:
8209 -- [constraint_error when Operand not in Target_Type'Class]
8211 -- or in the access type case
8213 -- [constraint_error
8214 -- when Operand /= null
8215 -- and then Operand.all not in
8216 -- Designated_Type (Target_Type)'Class]
8218 if (Is_Access_Type (Target_Type)
8219 and then Is_Tagged_Type (Designated_Type (Target_Type)))
8220 or else Is_Tagged_Type (Target_Type)
8222 -- Do not do any expansion in the access type case if the parent is a
8223 -- renaming, since this is an error situation which will be caught by
8224 -- Sem_Ch8, and the expansion can interfere with this error check.
8226 if Is_Access_Type (Target_Type)
8227 and then Is_Renamed_Object (N)
8232 -- Otherwise, proceed with processing tagged conversion
8235 Actual_Op_Typ : Entity_Id;
8236 Actual_Targ_Typ : Entity_Id;
8237 Make_Conversion : Boolean := False;
8238 Root_Op_Typ : Entity_Id;
8240 procedure Make_Tag_Check (Targ_Typ : Entity_Id);
8241 -- Create a membership check to test whether Operand is a member
8242 -- of Targ_Typ. If the original Target_Type is an access, include
8243 -- a test for null value. The check is inserted at N.
8245 --------------------
8246 -- Make_Tag_Check --
8247 --------------------
8249 procedure Make_Tag_Check (Targ_Typ : Entity_Id) is
8254 -- [Constraint_Error
8255 -- when Operand /= null
8256 -- and then Operand.all not in Targ_Typ]
8258 if Is_Access_Type (Target_Type) then
8263 Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
8264 Right_Opnd => Make_Null (Loc)),
8269 Make_Explicit_Dereference (Loc,
8270 Prefix => Duplicate_Subexpr_No_Checks (Operand)),
8271 Right_Opnd => New_Reference_To (Targ_Typ, Loc)));
8274 -- [Constraint_Error when Operand not in Targ_Typ]
8279 Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
8280 Right_Opnd => New_Reference_To (Targ_Typ, Loc));
8284 Make_Raise_Constraint_Error (Loc,
8286 Reason => CE_Tag_Check_Failed));
8289 -- Start of processing
8292 if Is_Access_Type (Target_Type) then
8294 -- Handle entities from the limited view
8297 Available_View (Designated_Type (Operand_Type));
8299 Available_View (Designated_Type (Target_Type));
8301 Actual_Op_Typ := Operand_Type;
8302 Actual_Targ_Typ := Target_Type;
8305 Root_Op_Typ := Root_Type (Actual_Op_Typ);
8307 -- Ada 2005 (AI-251): Handle interface type conversion
8309 if Is_Interface (Actual_Op_Typ) then
8310 Expand_Interface_Conversion (N, Is_Static => False);
8314 if not Tag_Checks_Suppressed (Actual_Targ_Typ) then
8316 -- Create a runtime tag check for a downward class-wide type
8319 if Is_Class_Wide_Type (Actual_Op_Typ)
8320 and then Actual_Op_Typ /= Actual_Targ_Typ
8321 and then Root_Op_Typ /= Actual_Targ_Typ
8322 and then Is_Ancestor (Root_Op_Typ, Actual_Targ_Typ)
8324 Make_Tag_Check (Class_Wide_Type (Actual_Targ_Typ));
8325 Make_Conversion := True;
8328 -- AI05-0073: If the result subtype of the function is defined
8329 -- by an access_definition designating a specific tagged type
8330 -- T, a check is made that the result value is null or the tag
8331 -- of the object designated by the result value identifies T.
8332 -- Constraint_Error is raised if this check fails.
8334 if Nkind (Parent (N)) = Sinfo.N_Return_Statement then
8337 Func_Typ : Entity_Id;
8340 -- Climb scope stack looking for the enclosing function
8342 Func := Current_Scope;
8343 while Present (Func)
8344 and then Ekind (Func) /= E_Function
8346 Func := Scope (Func);
8349 -- The function's return subtype must be defined using
8350 -- an access definition.
8352 if Nkind (Result_Definition (Parent (Func))) =
8355 Func_Typ := Directly_Designated_Type (Etype (Func));
8357 -- The return subtype denotes a specific tagged type,
8358 -- in other words, a non class-wide type.
8360 if Is_Tagged_Type (Func_Typ)
8361 and then not Is_Class_Wide_Type (Func_Typ)
8363 Make_Tag_Check (Actual_Targ_Typ);
8364 Make_Conversion := True;
8370 -- We have generated a tag check for either a class-wide type
8371 -- conversion or for AI05-0073.
8373 if Make_Conversion then
8378 Make_Unchecked_Type_Conversion (Loc,
8379 Subtype_Mark => New_Occurrence_Of (Target_Type, Loc),
8380 Expression => Relocate_Node (Expression (N)));
8382 Analyze_And_Resolve (N, Target_Type);
8388 -- Case of other access type conversions
8390 elsif Is_Access_Type (Target_Type) then
8391 Apply_Constraint_Check (Operand, Target_Type);
8393 -- Case of conversions from a fixed-point type
8395 -- These conversions require special expansion and processing, found in
8396 -- the Exp_Fixd package. We ignore cases where Conversion_OK is set,
8397 -- since from a semantic point of view, these are simple integer
8398 -- conversions, which do not need further processing.
8400 elsif Is_Fixed_Point_Type (Operand_Type)
8401 and then not Conversion_OK (N)
8403 -- We should never see universal fixed at this case, since the
8404 -- expansion of the constituent divide or multiply should have
8405 -- eliminated the explicit mention of universal fixed.
8407 pragma Assert (Operand_Type /= Universal_Fixed);
8409 -- Check for special case of the conversion to universal real that
8410 -- occurs as a result of the use of a round attribute. In this case,
8411 -- the real type for the conversion is taken from the target type of
8412 -- the Round attribute and the result must be marked as rounded.
8414 if Target_Type = Universal_Real
8415 and then Nkind (Parent (N)) = N_Attribute_Reference
8416 and then Attribute_Name (Parent (N)) = Name_Round
8418 Set_Rounded_Result (N);
8419 Set_Etype (N, Etype (Parent (N)));
8422 -- Otherwise do correct fixed-conversion, but skip these if the
8423 -- Conversion_OK flag is set, because from a semantic point of
8424 -- view these are simple integer conversions needing no further
8425 -- processing (the backend will simply treat them as integers)
8427 if not Conversion_OK (N) then
8428 if Is_Fixed_Point_Type (Etype (N)) then
8429 Expand_Convert_Fixed_To_Fixed (N);
8432 elsif Is_Integer_Type (Etype (N)) then
8433 Expand_Convert_Fixed_To_Integer (N);
8436 pragma Assert (Is_Floating_Point_Type (Etype (N)));
8437 Expand_Convert_Fixed_To_Float (N);
8442 -- Case of conversions to a fixed-point type
8444 -- These conversions require special expansion and processing, found in
8445 -- the Exp_Fixd package. Again, ignore cases where Conversion_OK is set,
8446 -- since from a semantic point of view, these are simple integer
8447 -- conversions, which do not need further processing.
8449 elsif Is_Fixed_Point_Type (Target_Type)
8450 and then not Conversion_OK (N)
8452 if Is_Integer_Type (Operand_Type) then
8453 Expand_Convert_Integer_To_Fixed (N);
8456 pragma Assert (Is_Floating_Point_Type (Operand_Type));
8457 Expand_Convert_Float_To_Fixed (N);
8461 -- Case of float-to-integer conversions
8463 -- We also handle float-to-fixed conversions with Conversion_OK set
8464 -- since semantically the fixed-point target is treated as though it
8465 -- were an integer in such cases.
8467 elsif Is_Floating_Point_Type (Operand_Type)
8469 (Is_Integer_Type (Target_Type)
8471 (Is_Fixed_Point_Type (Target_Type) and then Conversion_OK (N)))
8473 -- One more check here, gcc is still not able to do conversions of
8474 -- this type with proper overflow checking, and so gigi is doing an
8475 -- approximation of what is required by doing floating-point compares
8476 -- with the end-point. But that can lose precision in some cases, and
8477 -- give a wrong result. Converting the operand to Universal_Real is
8478 -- helpful, but still does not catch all cases with 64-bit integers
8479 -- on targets with only 64-bit floats
8481 -- The above comment seems obsoleted by Apply_Float_Conversion_Check
8482 -- Can this code be removed ???
8484 if Do_Range_Check (Operand) then
8486 Make_Type_Conversion (Loc,
8488 New_Occurrence_Of (Universal_Real, Loc),
8490 Relocate_Node (Operand)));
8492 Set_Etype (Operand, Universal_Real);
8493 Enable_Range_Check (Operand);
8494 Set_Do_Range_Check (Expression (Operand), False);
8497 -- Case of array conversions
8499 -- Expansion of array conversions, add required length/range checks but
8500 -- only do this if there is no change of representation. For handling of
8501 -- this case, see Handle_Changed_Representation.
8503 elsif Is_Array_Type (Target_Type) then
8505 if Is_Constrained (Target_Type) then
8506 Apply_Length_Check (Operand, Target_Type);
8508 Apply_Range_Check (Operand, Target_Type);
8511 Handle_Changed_Representation;
8513 -- Case of conversions of discriminated types
8515 -- Add required discriminant checks if target is constrained. Again this
8516 -- change is skipped if we have a change of representation.
8518 elsif Has_Discriminants (Target_Type)
8519 and then Is_Constrained (Target_Type)
8521 Apply_Discriminant_Check (Operand, Target_Type);
8522 Handle_Changed_Representation;
8524 -- Case of all other record conversions. The only processing required
8525 -- is to check for a change of representation requiring the special
8526 -- assignment processing.
8528 elsif Is_Record_Type (Target_Type) then
8530 -- Ada 2005 (AI-216): Program_Error is raised when converting from
8531 -- a derived Unchecked_Union type to an unconstrained type that is
8532 -- not Unchecked_Union if the operand lacks inferable discriminants.
8534 if Is_Derived_Type (Operand_Type)
8535 and then Is_Unchecked_Union (Base_Type (Operand_Type))
8536 and then not Is_Constrained (Target_Type)
8537 and then not Is_Unchecked_Union (Base_Type (Target_Type))
8538 and then not Has_Inferable_Discriminants (Operand)
8540 -- To prevent Gigi from generating illegal code, we generate a
8541 -- Program_Error node, but we give it the target type of the
8545 PE : constant Node_Id := Make_Raise_Program_Error (Loc,
8546 Reason => PE_Unchecked_Union_Restriction);
8549 Set_Etype (PE, Target_Type);
8554 Handle_Changed_Representation;
8557 -- Case of conversions of enumeration types
8559 elsif Is_Enumeration_Type (Target_Type) then
8561 -- Special processing is required if there is a change of
8562 -- representation (from enumeration representation clauses)
8564 if not Same_Representation (Target_Type, Operand_Type) then
8566 -- Convert: x(y) to x'val (ytyp'val (y))
8569 Make_Attribute_Reference (Loc,
8570 Prefix => New_Occurrence_Of (Target_Type, Loc),
8571 Attribute_Name => Name_Val,
8572 Expressions => New_List (
8573 Make_Attribute_Reference (Loc,
8574 Prefix => New_Occurrence_Of (Operand_Type, Loc),
8575 Attribute_Name => Name_Pos,
8576 Expressions => New_List (Operand)))));
8578 Analyze_And_Resolve (N, Target_Type);
8581 -- Case of conversions to floating-point
8583 elsif Is_Floating_Point_Type (Target_Type) then
8587 -- At this stage, either the conversion node has been transformed into
8588 -- some other equivalent expression, or left as a conversion that can
8589 -- be handled by Gigi. The conversions that Gigi can handle are the
8592 -- Conversions with no change of representation or type
8594 -- Numeric conversions involving integer, floating- and fixed-point
8595 -- values. Fixed-point values are allowed only if Conversion_OK is
8596 -- set, i.e. if the fixed-point values are to be treated as integers.
8598 -- No other conversions should be passed to Gigi
8600 -- Check: are these rules stated in sinfo??? if so, why restate here???
8602 -- The only remaining step is to generate a range check if we still have
8603 -- a type conversion at this stage and Do_Range_Check is set. For now we
8604 -- do this only for conversions of discrete types.
8606 if Nkind (N) = N_Type_Conversion
8607 and then Is_Discrete_Type (Etype (N))
8610 Expr : constant Node_Id := Expression (N);
8615 if Do_Range_Check (Expr)
8616 and then Is_Discrete_Type (Etype (Expr))
8618 Set_Do_Range_Check (Expr, False);
8620 -- Before we do a range check, we have to deal with treating a
8621 -- fixed-point operand as an integer. The way we do this is
8622 -- simply to do an unchecked conversion to an appropriate
8623 -- integer type large enough to hold the result.
8625 -- This code is not active yet, because we are only dealing
8626 -- with discrete types so far ???
8628 if Nkind (Expr) in N_Has_Treat_Fixed_As_Integer
8629 and then Treat_Fixed_As_Integer (Expr)
8631 Ftyp := Base_Type (Etype (Expr));
8633 if Esize (Ftyp) >= Esize (Standard_Integer) then
8634 Ityp := Standard_Long_Long_Integer;
8636 Ityp := Standard_Integer;
8639 Rewrite (Expr, Unchecked_Convert_To (Ityp, Expr));
8642 -- Reset overflow flag, since the range check will include
8643 -- dealing with possible overflow, and generate the check If
8644 -- Address is either a source type or target type, suppress
8645 -- range check to avoid typing anomalies when it is a visible
8648 Set_Do_Overflow_Check (N, False);
8649 if not Is_Descendent_Of_Address (Etype (Expr))
8650 and then not Is_Descendent_Of_Address (Target_Type)
8652 Generate_Range_Check
8653 (Expr, Target_Type, CE_Range_Check_Failed);
8659 -- Final step, if the result is a type conversion involving Vax_Float
8660 -- types, then it is subject for further special processing.
8662 if Nkind (N) = N_Type_Conversion
8663 and then (Vax_Float (Operand_Type) or else Vax_Float (Target_Type))
8665 Expand_Vax_Conversion (N);
8668 end Expand_N_Type_Conversion;
8670 -----------------------------------
8671 -- Expand_N_Unchecked_Expression --
8672 -----------------------------------
8674 -- Remove the unchecked expression node from the tree. It's job was simply
8675 -- to make sure that its constituent expression was handled with checks
8676 -- off, and now that that is done, we can remove it from the tree, and
8677 -- indeed must, since gigi does not expect to see these nodes.
8679 procedure Expand_N_Unchecked_Expression (N : Node_Id) is
8680 Exp : constant Node_Id := Expression (N);
8683 Set_Assignment_OK (Exp, Assignment_OK (N) or Assignment_OK (Exp));
8685 end Expand_N_Unchecked_Expression;
8687 ----------------------------------------
8688 -- Expand_N_Unchecked_Type_Conversion --
8689 ----------------------------------------
8691 -- If this cannot be handled by Gigi and we haven't already made a
8692 -- temporary for it, do it now.
8694 procedure Expand_N_Unchecked_Type_Conversion (N : Node_Id) is
8695 Target_Type : constant Entity_Id := Etype (N);
8696 Operand : constant Node_Id := Expression (N);
8697 Operand_Type : constant Entity_Id := Etype (Operand);
8700 -- Nothing at all to do if conversion is to the identical type so remove
8701 -- the conversion completely, it is useless, except that it may carry
8702 -- an Assignment_OK indication which must be proprgated to the operand.
8704 if Operand_Type = Target_Type then
8705 if Assignment_OK (N) then
8706 Set_Assignment_OK (Operand);
8709 Rewrite (N, Relocate_Node (Operand));
8713 -- If we have a conversion of a compile time known value to a target
8714 -- type and the value is in range of the target type, then we can simply
8715 -- replace the construct by an integer literal of the correct type. We
8716 -- only apply this to integer types being converted. Possibly it may
8717 -- apply in other cases, but it is too much trouble to worry about.
8719 -- Note that we do not do this transformation if the Kill_Range_Check
8720 -- flag is set, since then the value may be outside the expected range.
8721 -- This happens in the Normalize_Scalars case.
8723 -- We also skip this if either the target or operand type is biased
8724 -- because in this case, the unchecked conversion is supposed to
8725 -- preserve the bit pattern, not the integer value.
8727 if Is_Integer_Type (Target_Type)
8728 and then not Has_Biased_Representation (Target_Type)
8729 and then Is_Integer_Type (Operand_Type)
8730 and then not Has_Biased_Representation (Operand_Type)
8731 and then Compile_Time_Known_Value (Operand)
8732 and then not Kill_Range_Check (N)
8735 Val : constant Uint := Expr_Value (Operand);
8738 if Compile_Time_Known_Value (Type_Low_Bound (Target_Type))
8740 Compile_Time_Known_Value (Type_High_Bound (Target_Type))
8742 Val >= Expr_Value (Type_Low_Bound (Target_Type))
8744 Val <= Expr_Value (Type_High_Bound (Target_Type))
8746 Rewrite (N, Make_Integer_Literal (Sloc (N), Val));
8748 -- If Address is the target type, just set the type to avoid a
8749 -- spurious type error on the literal when Address is a visible
8752 if Is_Descendent_Of_Address (Target_Type) then
8753 Set_Etype (N, Target_Type);
8755 Analyze_And_Resolve (N, Target_Type);
8763 -- Nothing to do if conversion is safe
8765 if Safe_Unchecked_Type_Conversion (N) then
8769 -- Otherwise force evaluation unless Assignment_OK flag is set (this
8770 -- flag indicates ??? -- more comments needed here)
8772 if Assignment_OK (N) then
8775 Force_Evaluation (N);
8777 end Expand_N_Unchecked_Type_Conversion;
8779 ----------------------------
8780 -- Expand_Record_Equality --
8781 ----------------------------
8783 -- For non-variant records, Equality is expanded when needed into:
8785 -- and then Lhs.Discr1 = Rhs.Discr1
8787 -- and then Lhs.Discrn = Rhs.Discrn
8788 -- and then Lhs.Cmp1 = Rhs.Cmp1
8790 -- and then Lhs.Cmpn = Rhs.Cmpn
8792 -- The expression is folded by the back-end for adjacent fields. This
8793 -- function is called for tagged record in only one occasion: for imple-
8794 -- menting predefined primitive equality (see Predefined_Primitives_Bodies)
8795 -- otherwise the primitive "=" is used directly.
8797 function Expand_Record_Equality
8802 Bodies : List_Id) return Node_Id
8804 Loc : constant Source_Ptr := Sloc (Nod);
8809 First_Time : Boolean := True;
8811 function Suitable_Element (C : Entity_Id) return Entity_Id;
8812 -- Return the first field to compare beginning with C, skipping the
8813 -- inherited components.
8815 ----------------------
8816 -- Suitable_Element --
8817 ----------------------
8819 function Suitable_Element (C : Entity_Id) return Entity_Id is
8824 elsif Ekind (C) /= E_Discriminant
8825 and then Ekind (C) /= E_Component
8827 return Suitable_Element (Next_Entity (C));
8829 elsif Is_Tagged_Type (Typ)
8830 and then C /= Original_Record_Component (C)
8832 return Suitable_Element (Next_Entity (C));
8834 elsif Chars (C) = Name_uController
8835 or else Chars (C) = Name_uTag
8837 return Suitable_Element (Next_Entity (C));
8839 elsif Is_Interface (Etype (C)) then
8840 return Suitable_Element (Next_Entity (C));
8845 end Suitable_Element;
8847 -- Start of processing for Expand_Record_Equality
8850 -- Generates the following code: (assuming that Typ has one Discr and
8851 -- component C2 is also a record)
8854 -- and then Lhs.Discr1 = Rhs.Discr1
8855 -- and then Lhs.C1 = Rhs.C1
8856 -- and then Lhs.C2.C1=Rhs.C2.C1 and then ... Lhs.C2.Cn=Rhs.C2.Cn
8858 -- and then Lhs.Cmpn = Rhs.Cmpn
8860 Result := New_Reference_To (Standard_True, Loc);
8861 C := Suitable_Element (First_Entity (Typ));
8863 while Present (C) loop
8871 First_Time := False;
8875 New_Lhs := New_Copy_Tree (Lhs);
8876 New_Rhs := New_Copy_Tree (Rhs);
8880 Expand_Composite_Equality (Nod, Etype (C),
8882 Make_Selected_Component (Loc,
8884 Selector_Name => New_Reference_To (C, Loc)),
8886 Make_Selected_Component (Loc,
8888 Selector_Name => New_Reference_To (C, Loc)),
8891 -- If some (sub)component is an unchecked_union, the whole
8892 -- operation will raise program error.
8894 if Nkind (Check) = N_Raise_Program_Error then
8896 Set_Etype (Result, Standard_Boolean);
8901 Left_Opnd => Result,
8902 Right_Opnd => Check);
8906 C := Suitable_Element (Next_Entity (C));
8910 end Expand_Record_Equality;
8912 -------------------------------------
8913 -- Fixup_Universal_Fixed_Operation --
8914 -------------------------------------
8916 procedure Fixup_Universal_Fixed_Operation (N : Node_Id) is
8917 Conv : constant Node_Id := Parent (N);
8920 -- We must have a type conversion immediately above us
8922 pragma Assert (Nkind (Conv) = N_Type_Conversion);
8924 -- Normally the type conversion gives our target type. The exception
8925 -- occurs in the case of the Round attribute, where the conversion
8926 -- will be to universal real, and our real type comes from the Round
8927 -- attribute (as well as an indication that we must round the result)
8929 if Nkind (Parent (Conv)) = N_Attribute_Reference
8930 and then Attribute_Name (Parent (Conv)) = Name_Round
8932 Set_Etype (N, Etype (Parent (Conv)));
8933 Set_Rounded_Result (N);
8935 -- Normal case where type comes from conversion above us
8938 Set_Etype (N, Etype (Conv));
8940 end Fixup_Universal_Fixed_Operation;
8942 ------------------------------
8943 -- Get_Allocator_Final_List --
8944 ------------------------------
8946 function Get_Allocator_Final_List
8949 PtrT : Entity_Id) return Entity_Id
8951 Loc : constant Source_Ptr := Sloc (N);
8953 Owner : Entity_Id := PtrT;
8954 -- The entity whose finalization list must be used to attach the
8955 -- allocated object.
8958 if Ekind (PtrT) = E_Anonymous_Access_Type then
8960 -- If the context is an access parameter, we need to create a
8961 -- non-anonymous access type in order to have a usable final list,
8962 -- because there is otherwise no pool to which the allocated object
8963 -- can belong. We create both the type and the finalization chain
8964 -- here, because freezing an internal type does not create such a
8965 -- chain. The Final_Chain that is thus created is shared by the
8966 -- access parameter. The access type is tested against the result
8967 -- type of the function to exclude allocators whose type is an
8968 -- anonymous access result type. We freeze the type at once to
8969 -- ensure that it is properly decorated for the back-end, even
8970 -- if the context and current scope is a loop.
8972 if Nkind (Associated_Node_For_Itype (PtrT))
8973 in N_Subprogram_Specification
8976 Etype (Defining_Unit_Name (Associated_Node_For_Itype (PtrT)))
8978 Owner := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
8980 Make_Full_Type_Declaration (Loc,
8981 Defining_Identifier => Owner,
8983 Make_Access_To_Object_Definition (Loc,
8984 Subtype_Indication =>
8985 New_Occurrence_Of (T, Loc))));
8987 Freeze_Before (N, Owner);
8988 Build_Final_List (N, Owner);
8989 Set_Associated_Final_Chain (PtrT, Associated_Final_Chain (Owner));
8991 -- Ada 2005 (AI-318-02): If the context is a return object
8992 -- declaration, then the anonymous return subtype is defined to have
8993 -- the same accessibility level as that of the function's result
8994 -- subtype, which means that we want the scope where the function is
8997 elsif Nkind (Associated_Node_For_Itype (PtrT)) = N_Object_Declaration
8998 and then Ekind (Scope (PtrT)) = E_Return_Statement
9000 Owner := Scope (Return_Applies_To (Scope (PtrT)));
9002 -- Case of an access discriminant, or (Ada 2005), of an anonymous
9003 -- access component or anonymous access function result: find the
9004 -- final list associated with the scope of the type. (In the
9005 -- anonymous access component kind, a list controller will have
9006 -- been allocated when freezing the record type, and PtrT has an
9007 -- Associated_Final_Chain attribute designating it.)
9009 elsif No (Associated_Final_Chain (PtrT)) then
9010 Owner := Scope (PtrT);
9014 return Find_Final_List (Owner);
9015 end Get_Allocator_Final_List;
9017 ---------------------------------
9018 -- Has_Inferable_Discriminants --
9019 ---------------------------------
9021 function Has_Inferable_Discriminants (N : Node_Id) return Boolean is
9023 function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean;
9024 -- Determines whether the left-most prefix of a selected component is a
9025 -- formal parameter in a subprogram. Assumes N is a selected component.
9027 --------------------------------
9028 -- Prefix_Is_Formal_Parameter --
9029 --------------------------------
9031 function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean is
9032 Sel_Comp : Node_Id := N;
9035 -- Move to the left-most prefix by climbing up the tree
9037 while Present (Parent (Sel_Comp))
9038 and then Nkind (Parent (Sel_Comp)) = N_Selected_Component
9040 Sel_Comp := Parent (Sel_Comp);
9043 return Ekind (Entity (Prefix (Sel_Comp))) in Formal_Kind;
9044 end Prefix_Is_Formal_Parameter;
9046 -- Start of processing for Has_Inferable_Discriminants
9049 -- For identifiers and indexed components, it is sufficient to have a
9050 -- constrained Unchecked_Union nominal subtype.
9052 if Nkind_In (N, N_Identifier, N_Indexed_Component) then
9053 return Is_Unchecked_Union (Base_Type (Etype (N)))
9055 Is_Constrained (Etype (N));
9057 -- For selected components, the subtype of the selector must be a
9058 -- constrained Unchecked_Union. If the component is subject to a
9059 -- per-object constraint, then the enclosing object must have inferable
9062 elsif Nkind (N) = N_Selected_Component then
9063 if Has_Per_Object_Constraint (Entity (Selector_Name (N))) then
9065 -- A small hack. If we have a per-object constrained selected
9066 -- component of a formal parameter, return True since we do not
9067 -- know the actual parameter association yet.
9069 if Prefix_Is_Formal_Parameter (N) then
9073 -- Otherwise, check the enclosing object and the selector
9075 return Has_Inferable_Discriminants (Prefix (N))
9077 Has_Inferable_Discriminants (Selector_Name (N));
9080 -- The call to Has_Inferable_Discriminants will determine whether
9081 -- the selector has a constrained Unchecked_Union nominal type.
9083 return Has_Inferable_Discriminants (Selector_Name (N));
9085 -- A qualified expression has inferable discriminants if its subtype
9086 -- mark is a constrained Unchecked_Union subtype.
9088 elsif Nkind (N) = N_Qualified_Expression then
9089 return Is_Unchecked_Union (Subtype_Mark (N))
9091 Is_Constrained (Subtype_Mark (N));
9096 end Has_Inferable_Discriminants;
9098 -------------------------------
9099 -- Insert_Dereference_Action --
9100 -------------------------------
9102 procedure Insert_Dereference_Action (N : Node_Id) is
9103 Loc : constant Source_Ptr := Sloc (N);
9104 Typ : constant Entity_Id := Etype (N);
9105 Pool : constant Entity_Id := Associated_Storage_Pool (Typ);
9106 Pnod : constant Node_Id := Parent (N);
9108 function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean;
9109 -- Return true if type of P is derived from Checked_Pool;
9111 -----------------------------
9112 -- Is_Checked_Storage_Pool --
9113 -----------------------------
9115 function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean is
9124 while T /= Etype (T) loop
9125 if Is_RTE (T, RE_Checked_Pool) then
9133 end Is_Checked_Storage_Pool;
9135 -- Start of processing for Insert_Dereference_Action
9138 pragma Assert (Nkind (Pnod) = N_Explicit_Dereference);
9140 if not (Is_Checked_Storage_Pool (Pool)
9141 and then Comes_From_Source (Original_Node (Pnod)))
9147 Make_Procedure_Call_Statement (Loc,
9148 Name => New_Reference_To (
9149 Find_Prim_Op (Etype (Pool), Name_Dereference), Loc),
9151 Parameter_Associations => New_List (
9155 New_Reference_To (Pool, Loc),
9157 -- Storage_Address. We use the attribute Pool_Address, which uses
9158 -- the pointer itself to find the address of the object, and which
9159 -- handles unconstrained arrays properly by computing the address
9160 -- of the template. i.e. the correct address of the corresponding
9163 Make_Attribute_Reference (Loc,
9164 Prefix => Duplicate_Subexpr_Move_Checks (N),
9165 Attribute_Name => Name_Pool_Address),
9167 -- Size_In_Storage_Elements
9169 Make_Op_Divide (Loc,
9171 Make_Attribute_Reference (Loc,
9173 Make_Explicit_Dereference (Loc,
9174 Duplicate_Subexpr_Move_Checks (N)),
9175 Attribute_Name => Name_Size),
9177 Make_Integer_Literal (Loc, System_Storage_Unit)),
9181 Make_Attribute_Reference (Loc,
9183 Make_Explicit_Dereference (Loc,
9184 Duplicate_Subexpr_Move_Checks (N)),
9185 Attribute_Name => Name_Alignment))));
9188 when RE_Not_Available =>
9190 end Insert_Dereference_Action;
9192 --------------------------------
9193 -- Integer_Promotion_Possible --
9194 --------------------------------
9196 function Integer_Promotion_Possible (N : Node_Id) return Boolean is
9197 Operand : constant Node_Id := Expression (N);
9198 Operand_Type : constant Entity_Id := Etype (Operand);
9199 Root_Operand_Type : constant Entity_Id := Root_Type (Operand_Type);
9202 pragma Assert (Nkind (N) = N_Type_Conversion);
9206 -- We only do the transformation for source constructs. We assume
9207 -- that the expander knows what it is doing when it generates code.
9209 Comes_From_Source (N)
9211 -- If the operand type is Short_Integer or Short_Short_Integer,
9212 -- then we will promote to Integer, which is available on all
9213 -- targets, and is sufficient to ensure no intermediate overflow.
9214 -- Furthermore it is likely to be as efficient or more efficient
9215 -- than using the smaller type for the computation so we do this
9219 (Root_Operand_Type = Base_Type (Standard_Short_Integer)
9221 Root_Operand_Type = Base_Type (Standard_Short_Short_Integer))
9223 -- Test for interesting operation, which includes addition,
9224 -- division, exponentiation, multiplication, subtraction, absolute
9225 -- value and unary negation. Unary "+" is omitted since it is a
9226 -- no-op and thus can't overflow.
9228 and then Nkind_In (Operand, N_Op_Abs,
9235 end Integer_Promotion_Possible;
9237 ------------------------------
9238 -- Make_Array_Comparison_Op --
9239 ------------------------------
9241 -- This is a hand-coded expansion of the following generic function:
9244 -- type elem is (<>);
9245 -- type index is (<>);
9246 -- type a is array (index range <>) of elem;
9248 -- function Gnnn (X : a; Y: a) return boolean is
9249 -- J : index := Y'first;
9252 -- if X'length = 0 then
9255 -- elsif Y'length = 0 then
9259 -- for I in X'range loop
9260 -- if X (I) = Y (J) then
9261 -- if J = Y'last then
9264 -- J := index'succ (J);
9268 -- return X (I) > Y (J);
9272 -- return X'length > Y'length;
9276 -- Note that since we are essentially doing this expansion by hand, we
9277 -- do not need to generate an actual or formal generic part, just the
9278 -- instantiated function itself.
9280 function Make_Array_Comparison_Op
9282 Nod : Node_Id) return Node_Id
9284 Loc : constant Source_Ptr := Sloc (Nod);
9286 X : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uX);
9287 Y : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uY);
9288 I : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uI);
9289 J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ);
9291 Index : constant Entity_Id := Base_Type (Etype (First_Index (Typ)));
9293 Loop_Statement : Node_Id;
9294 Loop_Body : Node_Id;
9297 Final_Expr : Node_Id;
9298 Func_Body : Node_Id;
9299 Func_Name : Entity_Id;
9305 -- if J = Y'last then
9308 -- J := index'succ (J);
9312 Make_Implicit_If_Statement (Nod,
9315 Left_Opnd => New_Reference_To (J, Loc),
9317 Make_Attribute_Reference (Loc,
9318 Prefix => New_Reference_To (Y, Loc),
9319 Attribute_Name => Name_Last)),
9321 Then_Statements => New_List (
9322 Make_Exit_Statement (Loc)),
9326 Make_Assignment_Statement (Loc,
9327 Name => New_Reference_To (J, Loc),
9329 Make_Attribute_Reference (Loc,
9330 Prefix => New_Reference_To (Index, Loc),
9331 Attribute_Name => Name_Succ,
9332 Expressions => New_List (New_Reference_To (J, Loc))))));
9334 -- if X (I) = Y (J) then
9337 -- return X (I) > Y (J);
9341 Make_Implicit_If_Statement (Nod,
9345 Make_Indexed_Component (Loc,
9346 Prefix => New_Reference_To (X, Loc),
9347 Expressions => New_List (New_Reference_To (I, Loc))),
9350 Make_Indexed_Component (Loc,
9351 Prefix => New_Reference_To (Y, Loc),
9352 Expressions => New_List (New_Reference_To (J, Loc)))),
9354 Then_Statements => New_List (Inner_If),
9356 Else_Statements => New_List (
9357 Make_Simple_Return_Statement (Loc,
9361 Make_Indexed_Component (Loc,
9362 Prefix => New_Reference_To (X, Loc),
9363 Expressions => New_List (New_Reference_To (I, Loc))),
9366 Make_Indexed_Component (Loc,
9367 Prefix => New_Reference_To (Y, Loc),
9368 Expressions => New_List (
9369 New_Reference_To (J, Loc)))))));
9371 -- for I in X'range loop
9376 Make_Implicit_Loop_Statement (Nod,
9377 Identifier => Empty,
9380 Make_Iteration_Scheme (Loc,
9381 Loop_Parameter_Specification =>
9382 Make_Loop_Parameter_Specification (Loc,
9383 Defining_Identifier => I,
9384 Discrete_Subtype_Definition =>
9385 Make_Attribute_Reference (Loc,
9386 Prefix => New_Reference_To (X, Loc),
9387 Attribute_Name => Name_Range))),
9389 Statements => New_List (Loop_Body));
9391 -- if X'length = 0 then
9393 -- elsif Y'length = 0 then
9396 -- for ... loop ... end loop;
9397 -- return X'length > Y'length;
9401 Make_Attribute_Reference (Loc,
9402 Prefix => New_Reference_To (X, Loc),
9403 Attribute_Name => Name_Length);
9406 Make_Attribute_Reference (Loc,
9407 Prefix => New_Reference_To (Y, Loc),
9408 Attribute_Name => Name_Length);
9412 Left_Opnd => Length1,
9413 Right_Opnd => Length2);
9416 Make_Implicit_If_Statement (Nod,
9420 Make_Attribute_Reference (Loc,
9421 Prefix => New_Reference_To (X, Loc),
9422 Attribute_Name => Name_Length),
9424 Make_Integer_Literal (Loc, 0)),
9428 Make_Simple_Return_Statement (Loc,
9429 Expression => New_Reference_To (Standard_False, Loc))),
9431 Elsif_Parts => New_List (
9432 Make_Elsif_Part (Loc,
9436 Make_Attribute_Reference (Loc,
9437 Prefix => New_Reference_To (Y, Loc),
9438 Attribute_Name => Name_Length),
9440 Make_Integer_Literal (Loc, 0)),
9444 Make_Simple_Return_Statement (Loc,
9445 Expression => New_Reference_To (Standard_True, Loc))))),
9447 Else_Statements => New_List (
9449 Make_Simple_Return_Statement (Loc,
9450 Expression => Final_Expr)));
9454 Formals := New_List (
9455 Make_Parameter_Specification (Loc,
9456 Defining_Identifier => X,
9457 Parameter_Type => New_Reference_To (Typ, Loc)),
9459 Make_Parameter_Specification (Loc,
9460 Defining_Identifier => Y,
9461 Parameter_Type => New_Reference_To (Typ, Loc)));
9463 -- function Gnnn (...) return boolean is
9464 -- J : index := Y'first;
9469 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('G'));
9472 Make_Subprogram_Body (Loc,
9474 Make_Function_Specification (Loc,
9475 Defining_Unit_Name => Func_Name,
9476 Parameter_Specifications => Formals,
9477 Result_Definition => New_Reference_To (Standard_Boolean, Loc)),
9479 Declarations => New_List (
9480 Make_Object_Declaration (Loc,
9481 Defining_Identifier => J,
9482 Object_Definition => New_Reference_To (Index, Loc),
9484 Make_Attribute_Reference (Loc,
9485 Prefix => New_Reference_To (Y, Loc),
9486 Attribute_Name => Name_First))),
9488 Handled_Statement_Sequence =>
9489 Make_Handled_Sequence_Of_Statements (Loc,
9490 Statements => New_List (If_Stat)));
9493 end Make_Array_Comparison_Op;
9495 ---------------------------
9496 -- Make_Boolean_Array_Op --
9497 ---------------------------
9499 -- For logical operations on boolean arrays, expand in line the following,
9500 -- replacing 'and' with 'or' or 'xor' where needed:
9502 -- function Annn (A : typ; B: typ) return typ is
9505 -- for J in A'range loop
9506 -- C (J) := A (J) op B (J);
9511 -- Here typ is the boolean array type
9513 function Make_Boolean_Array_Op
9515 N : Node_Id) return Node_Id
9517 Loc : constant Source_Ptr := Sloc (N);
9519 A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA);
9520 B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB);
9521 C : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uC);
9522 J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ);
9530 Func_Name : Entity_Id;
9531 Func_Body : Node_Id;
9532 Loop_Statement : Node_Id;
9536 Make_Indexed_Component (Loc,
9537 Prefix => New_Reference_To (A, Loc),
9538 Expressions => New_List (New_Reference_To (J, Loc)));
9541 Make_Indexed_Component (Loc,
9542 Prefix => New_Reference_To (B, Loc),
9543 Expressions => New_List (New_Reference_To (J, Loc)));
9546 Make_Indexed_Component (Loc,
9547 Prefix => New_Reference_To (C, Loc),
9548 Expressions => New_List (New_Reference_To (J, Loc)));
9550 if Nkind (N) = N_Op_And then
9556 elsif Nkind (N) = N_Op_Or then
9570 Make_Implicit_Loop_Statement (N,
9571 Identifier => Empty,
9574 Make_Iteration_Scheme (Loc,
9575 Loop_Parameter_Specification =>
9576 Make_Loop_Parameter_Specification (Loc,
9577 Defining_Identifier => J,
9578 Discrete_Subtype_Definition =>
9579 Make_Attribute_Reference (Loc,
9580 Prefix => New_Reference_To (A, Loc),
9581 Attribute_Name => Name_Range))),
9583 Statements => New_List (
9584 Make_Assignment_Statement (Loc,
9586 Expression => Op)));
9588 Formals := New_List (
9589 Make_Parameter_Specification (Loc,
9590 Defining_Identifier => A,
9591 Parameter_Type => New_Reference_To (Typ, Loc)),
9593 Make_Parameter_Specification (Loc,
9594 Defining_Identifier => B,
9595 Parameter_Type => New_Reference_To (Typ, Loc)));
9598 Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
9599 Set_Is_Inlined (Func_Name);
9602 Make_Subprogram_Body (Loc,
9604 Make_Function_Specification (Loc,
9605 Defining_Unit_Name => Func_Name,
9606 Parameter_Specifications => Formals,
9607 Result_Definition => New_Reference_To (Typ, Loc)),
9609 Declarations => New_List (
9610 Make_Object_Declaration (Loc,
9611 Defining_Identifier => C,
9612 Object_Definition => New_Reference_To (Typ, Loc))),
9614 Handled_Statement_Sequence =>
9615 Make_Handled_Sequence_Of_Statements (Loc,
9616 Statements => New_List (
9618 Make_Simple_Return_Statement (Loc,
9619 Expression => New_Reference_To (C, Loc)))));
9622 end Make_Boolean_Array_Op;
9624 ------------------------
9625 -- Rewrite_Comparison --
9626 ------------------------
9628 procedure Rewrite_Comparison (N : Node_Id) is
9629 Warning_Generated : Boolean := False;
9630 -- Set to True if first pass with Assume_Valid generates a warning in
9631 -- which case we skip the second pass to avoid warning overloaded.
9634 -- Set to Standard_True or Standard_False
9637 if Nkind (N) = N_Type_Conversion then
9638 Rewrite_Comparison (Expression (N));
9641 elsif Nkind (N) not in N_Op_Compare then
9645 -- Now start looking at the comparison in detail. We potentially go
9646 -- through this loop twice. The first time, Assume_Valid is set False
9647 -- in the call to Compile_Time_Compare. If this call results in a
9648 -- clear result of always True or Always False, that's decisive and
9649 -- we are done. Otherwise we repeat the processing with Assume_Valid
9650 -- set to True to generate additional warnings. We can stil that step
9651 -- if Constant_Condition_Warnings is False.
9653 for AV in False .. True loop
9655 Typ : constant Entity_Id := Etype (N);
9656 Op1 : constant Node_Id := Left_Opnd (N);
9657 Op2 : constant Node_Id := Right_Opnd (N);
9659 Res : constant Compare_Result :=
9660 Compile_Time_Compare (Op1, Op2, Assume_Valid => AV);
9661 -- Res indicates if compare outcome can be compile time determined
9663 True_Result : Boolean;
9664 False_Result : Boolean;
9667 case N_Op_Compare (Nkind (N)) is
9669 True_Result := Res = EQ;
9670 False_Result := Res = LT or else Res = GT or else Res = NE;
9673 True_Result := Res in Compare_GE;
9674 False_Result := Res = LT;
9677 and then Constant_Condition_Warnings
9678 and then Comes_From_Source (Original_Node (N))
9679 and then Nkind (Original_Node (N)) = N_Op_Ge
9680 and then not In_Instance
9681 and then Is_Integer_Type (Etype (Left_Opnd (N)))
9682 and then not Has_Warnings_Off (Etype (Left_Opnd (N)))
9685 ("can never be greater than, could replace by ""'=""?", N);
9686 Warning_Generated := True;
9690 True_Result := Res = GT;
9691 False_Result := Res in Compare_LE;
9694 True_Result := Res = LT;
9695 False_Result := Res in Compare_GE;
9698 True_Result := Res in Compare_LE;
9699 False_Result := Res = GT;
9702 and then Constant_Condition_Warnings
9703 and then Comes_From_Source (Original_Node (N))
9704 and then Nkind (Original_Node (N)) = N_Op_Le
9705 and then not In_Instance
9706 and then Is_Integer_Type (Etype (Left_Opnd (N)))
9707 and then not Has_Warnings_Off (Etype (Left_Opnd (N)))
9710 ("can never be less than, could replace by ""'=""?", N);
9711 Warning_Generated := True;
9715 True_Result := Res = NE or else Res = GT or else Res = LT;
9716 False_Result := Res = EQ;
9719 -- If this is the first iteration, then we actually convert the
9720 -- comparison into True or False, if the result is certain.
9723 if True_Result or False_Result then
9725 Result := Standard_True;
9727 Result := Standard_False;
9732 New_Occurrence_Of (Result, Sloc (N))));
9733 Analyze_And_Resolve (N, Typ);
9734 Warn_On_Known_Condition (N);
9738 -- If this is the second iteration (AV = True), and the original
9739 -- node comes from source and we are not in an instance, then
9740 -- give a warning if we know result would be True or False. Note
9741 -- we know Constant_Condition_Warnings is set if we get here.
9743 elsif Comes_From_Source (Original_Node (N))
9744 and then not In_Instance
9748 ("condition can only be False if invalid values present?",
9750 elsif False_Result then
9752 ("condition can only be True if invalid values present?",
9758 -- Skip second iteration if not warning on constant conditions or
9759 -- if the first iteration already generated a warning of some kind
9760 -- or if we are in any case assuming all values are valid (so that
9761 -- the first iteration took care of the valid case).
9763 exit when not Constant_Condition_Warnings;
9764 exit when Warning_Generated;
9765 exit when Assume_No_Invalid_Values;
9767 end Rewrite_Comparison;
9769 ----------------------------
9770 -- Safe_In_Place_Array_Op --
9771 ----------------------------
9773 function Safe_In_Place_Array_Op
9776 Op2 : Node_Id) return Boolean
9780 function Is_Safe_Operand (Op : Node_Id) return Boolean;
9781 -- Operand is safe if it cannot overlap part of the target of the
9782 -- operation. If the operand and the target are identical, the operand
9783 -- is safe. The operand can be empty in the case of negation.
9785 function Is_Unaliased (N : Node_Id) return Boolean;
9786 -- Check that N is a stand-alone entity
9792 function Is_Unaliased (N : Node_Id) return Boolean is
9796 and then No (Address_Clause (Entity (N)))
9797 and then No (Renamed_Object (Entity (N)));
9800 ---------------------
9801 -- Is_Safe_Operand --
9802 ---------------------
9804 function Is_Safe_Operand (Op : Node_Id) return Boolean is
9809 elsif Is_Entity_Name (Op) then
9810 return Is_Unaliased (Op);
9812 elsif Nkind_In (Op, N_Indexed_Component, N_Selected_Component) then
9813 return Is_Unaliased (Prefix (Op));
9815 elsif Nkind (Op) = N_Slice then
9817 Is_Unaliased (Prefix (Op))
9818 and then Entity (Prefix (Op)) /= Target;
9820 elsif Nkind (Op) = N_Op_Not then
9821 return Is_Safe_Operand (Right_Opnd (Op));
9826 end Is_Safe_Operand;
9828 -- Start of processing for Is_Safe_In_Place_Array_Op
9831 -- Skip this processing if the component size is different from system
9832 -- storage unit (since at least for NOT this would cause problems).
9834 if Component_Size (Etype (Lhs)) /= System_Storage_Unit then
9837 -- Cannot do in place stuff on VM_Target since cannot pass addresses
9839 elsif VM_Target /= No_VM then
9842 -- Cannot do in place stuff if non-standard Boolean representation
9844 elsif Has_Non_Standard_Rep (Component_Type (Etype (Lhs))) then
9847 elsif not Is_Unaliased (Lhs) then
9850 Target := Entity (Lhs);
9853 Is_Safe_Operand (Op1)
9854 and then Is_Safe_Operand (Op2);
9856 end Safe_In_Place_Array_Op;
9858 -----------------------
9859 -- Tagged_Membership --
9860 -----------------------
9862 -- There are two different cases to consider depending on whether the right
9863 -- operand is a class-wide type or not. If not we just compare the actual
9864 -- tag of the left expr to the target type tag:
9866 -- Left_Expr.Tag = Right_Type'Tag;
9868 -- If it is a class-wide type we use the RT function CW_Membership which is
9869 -- usually implemented by looking in the ancestor tables contained in the
9870 -- dispatch table pointed by Left_Expr.Tag for Typ'Tag
9872 -- Ada 2005 (AI-251): If it is a class-wide interface type we use the RT
9873 -- function IW_Membership which is usually implemented by looking in the
9874 -- table of abstract interface types plus the ancestor table contained in
9875 -- the dispatch table pointed by Left_Expr.Tag for Typ'Tag
9877 procedure Tagged_Membership
9879 SCIL_Node : out Node_Id;
9880 Result : out Node_Id)
9882 Left : constant Node_Id := Left_Opnd (N);
9883 Right : constant Node_Id := Right_Opnd (N);
9884 Loc : constant Source_Ptr := Sloc (N);
9886 Left_Type : Entity_Id;
9888 Right_Type : Entity_Id;
9894 -- Handle entities from the limited view
9896 Left_Type := Available_View (Etype (Left));
9897 Right_Type := Available_View (Etype (Right));
9899 if Is_Class_Wide_Type (Left_Type) then
9900 Left_Type := Root_Type (Left_Type);
9904 Make_Selected_Component (Loc,
9905 Prefix => Relocate_Node (Left),
9907 New_Reference_To (First_Tag_Component (Left_Type), Loc));
9909 if Is_Class_Wide_Type (Right_Type) then
9911 -- No need to issue a run-time check if we statically know that the
9912 -- result of this membership test is always true. For example,
9913 -- considering the following declarations:
9915 -- type Iface is interface;
9916 -- type T is tagged null record;
9917 -- type DT is new T and Iface with null record;
9922 -- These membership tests are always true:
9926 -- Obj2 in Iface'Class;
9928 -- We do not need to handle cases where the membership is illegal.
9931 -- Obj1 in DT'Class; -- Compile time error
9932 -- Obj1 in Iface'Class; -- Compile time error
9934 if not Is_Class_Wide_Type (Left_Type)
9935 and then (Is_Ancestor (Etype (Right_Type), Left_Type)
9936 or else (Is_Interface (Etype (Right_Type))
9937 and then Interface_Present_In_Ancestor
9939 Iface => Etype (Right_Type))))
9941 Result := New_Reference_To (Standard_True, Loc);
9945 -- Ada 2005 (AI-251): Class-wide applied to interfaces
9947 if Is_Interface (Etype (Class_Wide_Type (Right_Type)))
9949 -- Support to: "Iface_CW_Typ in Typ'Class"
9951 or else Is_Interface (Left_Type)
9953 -- Issue error if IW_Membership operation not available in a
9954 -- configurable run time setting.
9956 if not RTE_Available (RE_IW_Membership) then
9958 ("dynamic membership test on interface types", N);
9964 Make_Function_Call (Loc,
9965 Name => New_Occurrence_Of (RTE (RE_IW_Membership), Loc),
9966 Parameter_Associations => New_List (
9967 Make_Attribute_Reference (Loc,
9969 Attribute_Name => Name_Address),
9972 (Access_Disp_Table (Root_Type (Right_Type)))),
9975 -- Ada 95: Normal case
9978 Build_CW_Membership (Loc,
9979 Obj_Tag_Node => Obj_Tag,
9983 (Access_Disp_Table (Root_Type (Right_Type)))),
9986 New_Node => New_Node);
9988 -- Generate the SCIL node for this class-wide membership test.
9989 -- Done here because the previous call to Build_CW_Membership
9990 -- relocates Obj_Tag.
9992 if Generate_SCIL then
9993 SCIL_Node := Make_SCIL_Membership_Test (Sloc (N));
9994 Set_SCIL_Entity (SCIL_Node, Etype (Right_Type));
9995 Set_SCIL_Tag_Value (SCIL_Node, Obj_Tag);
10001 -- Right_Type is not a class-wide type
10004 -- No need to check the tag of the object if Right_Typ is abstract
10006 if Is_Abstract_Type (Right_Type) then
10007 Result := New_Reference_To (Standard_False, Loc);
10012 Left_Opnd => Obj_Tag,
10015 (Node (First_Elmt (Access_Disp_Table (Right_Type))), Loc));
10018 end Tagged_Membership;
10020 ------------------------------
10021 -- Unary_Op_Validity_Checks --
10022 ------------------------------
10024 procedure Unary_Op_Validity_Checks (N : Node_Id) is
10026 if Validity_Checks_On and Validity_Check_Operands then
10027 Ensure_Valid (Right_Opnd (N));
10029 end Unary_Op_Validity_Checks;
OSDN Git Service
