1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2010, 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 Par_SCO; use Par_SCO;
51 with Restrict; use Restrict;
52 with Rident; use Rident;
53 with Rtsfind; use Rtsfind;
55 with Sem_Aux; use Sem_Aux;
56 with Sem_Cat; use Sem_Cat;
57 with Sem_Ch3; use Sem_Ch3;
58 with Sem_Ch8; use Sem_Ch8;
59 with Sem_Ch13; use Sem_Ch13;
60 with Sem_Eval; use Sem_Eval;
61 with Sem_Res; use Sem_Res;
62 with Sem_SCIL; use Sem_SCIL;
63 with Sem_Type; use Sem_Type;
64 with Sem_Util; use Sem_Util;
65 with Sem_Warn; use Sem_Warn;
66 with Sinfo; use Sinfo;
67 with Snames; use Snames;
68 with Stand; use Stand;
69 with Targparm; use Targparm;
70 with Tbuild; use Tbuild;
71 with Ttypes; use Ttypes;
72 with Uintp; use Uintp;
73 with Urealp; use Urealp;
74 with Validsw; use Validsw;
76 package body Exp_Ch4 is
78 -----------------------
79 -- Local Subprograms --
80 -----------------------
82 procedure Binary_Op_Validity_Checks (N : Node_Id);
83 pragma Inline (Binary_Op_Validity_Checks);
84 -- Performs validity checks for a binary operator
86 procedure Build_Boolean_Array_Proc_Call
90 -- If a boolean array assignment can be done in place, build call to
91 -- corresponding library procedure.
93 procedure Displace_Allocator_Pointer (N : Node_Id);
94 -- Ada 2005 (AI-251): Subsidiary procedure to Expand_N_Allocator and
95 -- Expand_Allocator_Expression. Allocating class-wide interface objects
96 -- this routine displaces the pointer to the allocated object to reference
97 -- the component referencing the corresponding secondary dispatch table.
99 procedure Expand_Allocator_Expression (N : Node_Id);
100 -- Subsidiary to Expand_N_Allocator, for the case when the expression
101 -- is a qualified expression or an aggregate.
103 procedure Expand_Array_Comparison (N : Node_Id);
104 -- This routine handles expansion of the comparison operators (N_Op_Lt,
105 -- N_Op_Le, N_Op_Gt, N_Op_Ge) when operating on an array type. The basic
106 -- code for these operators is similar, differing only in the details of
107 -- the actual comparison call that is made. Special processing (call a
110 function Expand_Array_Equality
115 Typ : Entity_Id) return Node_Id;
116 -- Expand an array equality into a call to a function implementing this
117 -- equality, and a call to it. Loc is the location for the generated nodes.
118 -- Lhs and Rhs are the array expressions to be compared. Bodies is a list
119 -- on which to attach bodies of local functions that are created in the
120 -- process. It is the responsibility of the caller to insert those bodies
121 -- at the right place. Nod provides the Sloc value for the generated code.
122 -- Normally the types used for the generated equality routine are taken
123 -- from Lhs and Rhs. However, in some situations of generated code, the
124 -- Etype fields of Lhs and Rhs are not set yet. In such cases, Typ supplies
125 -- the type to be used for the formal parameters.
127 procedure Expand_Boolean_Operator (N : Node_Id);
128 -- Common expansion processing for Boolean operators (And, Or, Xor) for the
129 -- case of array type arguments.
131 procedure Expand_Short_Circuit_Operator (N : Node_Id);
132 -- Common expansion processing for short-circuit boolean operators
134 function Expand_Composite_Equality
139 Bodies : List_Id) return Node_Id;
140 -- Local recursive function used to expand equality for nested composite
141 -- types. Used by Expand_Record/Array_Equality, Bodies is a list on which
142 -- to attach bodies of local functions that are created in the process.
143 -- This is the responsibility of the caller to insert those bodies at the
144 -- right place. Nod provides the Sloc value for generated code. Lhs and Rhs
145 -- are the left and right sides for the comparison, and Typ is the type of
146 -- the arrays to compare.
148 procedure Expand_Concatenate (Cnode : Node_Id; Opnds : List_Id);
149 -- Routine to expand concatenation of a sequence of two or more operands
150 -- (in the list Operands) and replace node Cnode with the result of the
151 -- concatenation. The operands can be of any appropriate type, and can
152 -- include both arrays and singleton elements.
154 procedure Fixup_Universal_Fixed_Operation (N : Node_Id);
155 -- N is a N_Op_Divide or N_Op_Multiply node whose result is universal
156 -- fixed. We do not have such a type at runtime, so the purpose of this
157 -- routine is to find the real type by looking up the tree. We also
158 -- determine if the operation must be rounded.
160 function Get_Allocator_Final_List
163 PtrT : Entity_Id) return Entity_Id;
164 -- If the designated type is controlled, build final_list expression for
165 -- created object. If context is an access parameter, create a local access
166 -- type to have a usable finalization list.
168 function Has_Inferable_Discriminants (N : Node_Id) return Boolean;
169 -- Ada 2005 (AI-216): A view of an Unchecked_Union object has inferable
170 -- discriminants if it has a constrained nominal type, unless the object
171 -- is a component of an enclosing Unchecked_Union object that is subject
172 -- to a per-object constraint and the enclosing object lacks inferable
175 -- An expression of an Unchecked_Union type has inferable discriminants
176 -- if it is either a name of an object with inferable discriminants or a
177 -- qualified expression whose subtype mark denotes a constrained subtype.
179 procedure Insert_Dereference_Action (N : Node_Id);
180 -- N is an expression whose type is an access. When the type of the
181 -- associated storage pool is derived from Checked_Pool, generate a
182 -- call to the 'Dereference' primitive operation.
184 function Make_Array_Comparison_Op
186 Nod : Node_Id) return Node_Id;
187 -- Comparisons between arrays are expanded in line. This function produces
188 -- the body of the implementation of (a > b), where a and b are one-
189 -- dimensional arrays of some discrete type. The original node is then
190 -- expanded into the appropriate call to this function. Nod provides the
191 -- Sloc value for the generated code.
193 function Make_Boolean_Array_Op
195 N : Node_Id) return Node_Id;
196 -- Boolean operations on boolean arrays are expanded in line. This function
197 -- produce the body for the node N, which is (a and b), (a or b), or (a xor
198 -- b). It is used only the normal case and not the packed case. The type
199 -- involved, Typ, is the Boolean array type, and the logical operations in
200 -- the body are simple boolean operations. Note that Typ is always a
201 -- constrained type (the caller has ensured this by using
202 -- Convert_To_Actual_Subtype if necessary).
204 procedure Rewrite_Comparison (N : Node_Id);
205 -- If N is the node for a comparison whose outcome can be determined at
206 -- compile time, then the node N can be rewritten with True or False. If
207 -- the outcome cannot be determined at compile time, the call has no
208 -- effect. If N is a type conversion, then this processing is applied to
209 -- its expression. If N is neither comparison nor a type conversion, the
210 -- call has no effect.
212 procedure Tagged_Membership
214 SCIL_Node : out Node_Id;
215 Result : out Node_Id);
216 -- Construct the expression corresponding to the tagged membership test.
217 -- Deals with a second operand being (or not) a class-wide type.
219 function Safe_In_Place_Array_Op
222 Op2 : Node_Id) return Boolean;
223 -- In the context of an assignment, where the right-hand side is a boolean
224 -- operation on arrays, check whether operation can be performed in place.
226 procedure Unary_Op_Validity_Checks (N : Node_Id);
227 pragma Inline (Unary_Op_Validity_Checks);
228 -- Performs validity checks for a unary operator
230 -------------------------------
231 -- Binary_Op_Validity_Checks --
232 -------------------------------
234 procedure Binary_Op_Validity_Checks (N : Node_Id) is
236 if Validity_Checks_On and Validity_Check_Operands then
237 Ensure_Valid (Left_Opnd (N));
238 Ensure_Valid (Right_Opnd (N));
240 end Binary_Op_Validity_Checks;
242 ------------------------------------
243 -- Build_Boolean_Array_Proc_Call --
244 ------------------------------------
246 procedure Build_Boolean_Array_Proc_Call
251 Loc : constant Source_Ptr := Sloc (N);
252 Kind : constant Node_Kind := Nkind (Expression (N));
253 Target : constant Node_Id :=
254 Make_Attribute_Reference (Loc,
256 Attribute_Name => Name_Address);
258 Arg1 : constant Node_Id := Op1;
259 Arg2 : Node_Id := Op2;
261 Proc_Name : Entity_Id;
264 if Kind = N_Op_Not then
265 if Nkind (Op1) in N_Binary_Op then
267 -- Use negated version of the binary operators
269 if Nkind (Op1) = N_Op_And then
270 Proc_Name := RTE (RE_Vector_Nand);
272 elsif Nkind (Op1) = N_Op_Or then
273 Proc_Name := RTE (RE_Vector_Nor);
275 else pragma Assert (Nkind (Op1) = N_Op_Xor);
276 Proc_Name := RTE (RE_Vector_Xor);
280 Make_Procedure_Call_Statement (Loc,
281 Name => New_Occurrence_Of (Proc_Name, Loc),
283 Parameter_Associations => New_List (
285 Make_Attribute_Reference (Loc,
286 Prefix => Left_Opnd (Op1),
287 Attribute_Name => Name_Address),
289 Make_Attribute_Reference (Loc,
290 Prefix => Right_Opnd (Op1),
291 Attribute_Name => Name_Address),
293 Make_Attribute_Reference (Loc,
294 Prefix => Left_Opnd (Op1),
295 Attribute_Name => Name_Length)));
298 Proc_Name := RTE (RE_Vector_Not);
301 Make_Procedure_Call_Statement (Loc,
302 Name => New_Occurrence_Of (Proc_Name, Loc),
303 Parameter_Associations => New_List (
306 Make_Attribute_Reference (Loc,
308 Attribute_Name => Name_Address),
310 Make_Attribute_Reference (Loc,
312 Attribute_Name => Name_Length)));
316 -- We use the following equivalences:
318 -- (not X) or (not Y) = not (X and Y) = Nand (X, Y)
319 -- (not X) and (not Y) = not (X or Y) = Nor (X, Y)
320 -- (not X) xor (not Y) = X xor Y
321 -- X xor (not Y) = not (X xor Y) = Nxor (X, Y)
323 if Nkind (Op1) = N_Op_Not then
324 if Kind = N_Op_And then
325 Proc_Name := RTE (RE_Vector_Nor);
326 elsif Kind = N_Op_Or then
327 Proc_Name := RTE (RE_Vector_Nand);
329 Proc_Name := RTE (RE_Vector_Xor);
333 if Kind = N_Op_And then
334 Proc_Name := RTE (RE_Vector_And);
335 elsif Kind = N_Op_Or then
336 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);
341 Proc_Name := RTE (RE_Vector_Xor);
346 Make_Procedure_Call_Statement (Loc,
347 Name => New_Occurrence_Of (Proc_Name, Loc),
348 Parameter_Associations => New_List (
350 Make_Attribute_Reference (Loc,
352 Attribute_Name => Name_Address),
353 Make_Attribute_Reference (Loc,
355 Attribute_Name => Name_Address),
356 Make_Attribute_Reference (Loc,
358 Attribute_Name => Name_Length)));
361 Rewrite (N, Call_Node);
365 when RE_Not_Available =>
367 end Build_Boolean_Array_Proc_Call;
369 --------------------------------
370 -- Displace_Allocator_Pointer --
371 --------------------------------
373 procedure Displace_Allocator_Pointer (N : Node_Id) is
374 Loc : constant Source_Ptr := Sloc (N);
375 Orig_Node : constant Node_Id := Original_Node (N);
381 -- Do nothing in case of VM targets: the virtual machine will handle
382 -- interfaces directly.
384 if not Tagged_Type_Expansion then
388 pragma Assert (Nkind (N) = N_Identifier
389 and then Nkind (Orig_Node) = N_Allocator);
391 PtrT := Etype (Orig_Node);
392 Dtyp := Available_View (Designated_Type (PtrT));
393 Etyp := Etype (Expression (Orig_Node));
395 if Is_Class_Wide_Type (Dtyp)
396 and then Is_Interface (Dtyp)
398 -- If the type of the allocator expression is not an interface type
399 -- we can generate code to reference the record component containing
400 -- the pointer to the secondary dispatch table.
402 if not Is_Interface (Etyp) then
404 Saved_Typ : constant Entity_Id := Etype (Orig_Node);
407 -- 1) Get access to the allocated object
410 Make_Explicit_Dereference (Loc,
415 -- 2) Add the conversion to displace the pointer to reference
416 -- the secondary dispatch table.
418 Rewrite (N, Convert_To (Dtyp, Relocate_Node (N)));
419 Analyze_And_Resolve (N, Dtyp);
421 -- 3) The 'access to the secondary dispatch table will be used
422 -- as the value returned by the allocator.
425 Make_Attribute_Reference (Loc,
426 Prefix => Relocate_Node (N),
427 Attribute_Name => Name_Access));
428 Set_Etype (N, Saved_Typ);
432 -- If the type of the allocator expression is an interface type we
433 -- generate a run-time call to displace "this" to reference the
434 -- component containing the pointer to the secondary dispatch table
435 -- or else raise Constraint_Error if the actual object does not
436 -- implement the target interface. This case corresponds with the
437 -- following example:
439 -- function Op (Obj : Iface_1'Class) return access Iface_2'Class is
441 -- return new Iface_2'Class'(Obj);
446 Unchecked_Convert_To (PtrT,
447 Make_Function_Call (Loc,
448 Name => New_Reference_To (RTE (RE_Displace), Loc),
449 Parameter_Associations => New_List (
450 Unchecked_Convert_To (RTE (RE_Address),
456 (Access_Disp_Table (Etype (Base_Type (Dtyp))))),
458 Analyze_And_Resolve (N, PtrT);
461 end Displace_Allocator_Pointer;
463 ---------------------------------
464 -- Expand_Allocator_Expression --
465 ---------------------------------
467 procedure Expand_Allocator_Expression (N : Node_Id) is
468 Loc : constant Source_Ptr := Sloc (N);
469 Exp : constant Node_Id := Expression (Expression (N));
470 PtrT : constant Entity_Id := Etype (N);
471 DesigT : constant Entity_Id := Designated_Type (PtrT);
473 procedure Apply_Accessibility_Check
475 Built_In_Place : Boolean := False);
476 -- Ada 2005 (AI-344): For an allocator with a class-wide designated
477 -- type, generate an accessibility check to verify that the level of the
478 -- type of the created object is not deeper than the level of the access
479 -- type. If the type of the qualified expression is class- wide, then
480 -- always generate the check (except in the case where it is known to be
481 -- unnecessary, see comment below). Otherwise, only generate the check
482 -- if the level of the qualified expression type is statically deeper
483 -- than the access type.
485 -- Although the static accessibility will generally have been performed
486 -- as a legality check, it won't have been done in cases where the
487 -- allocator appears in generic body, so a run-time check is needed in
488 -- general. One special case is when the access type is declared in the
489 -- same scope as the class-wide allocator, in which case the check can
490 -- never fail, so it need not be generated.
492 -- As an open issue, there seem to be cases where the static level
493 -- associated with the class-wide object's underlying type is not
494 -- sufficient to perform the proper accessibility check, such as for
495 -- allocators in nested subprograms or accept statements initialized by
496 -- class-wide formals when the actual originates outside at a deeper
497 -- static level. The nested subprogram case might require passing
498 -- accessibility levels along with class-wide parameters, and the task
499 -- case seems to be an actual gap in the language rules that needs to
500 -- be fixed by the ARG. ???
502 -------------------------------
503 -- Apply_Accessibility_Check --
504 -------------------------------
506 procedure Apply_Accessibility_Check
508 Built_In_Place : Boolean := False)
513 -- Note: we skip the accessibility check for the VM case, since
514 -- there does not seem to be any practical way of implementing it.
516 if Ada_Version >= Ada_05
517 and then Tagged_Type_Expansion
518 and then Is_Class_Wide_Type (DesigT)
519 and then not Scope_Suppress (Accessibility_Check)
521 (Type_Access_Level (Etype (Exp)) > Type_Access_Level (PtrT)
523 (Is_Class_Wide_Type (Etype (Exp))
524 and then Scope (PtrT) /= Current_Scope))
526 -- If the allocator was built in place Ref is already a reference
527 -- to the access object initialized to the result of the allocator
528 -- (see Exp_Ch6.Make_Build_In_Place_Call_In_Allocator). Otherwise
529 -- it is the entity associated with the object containing the
530 -- address of the allocated object.
532 if Built_In_Place then
533 Ref_Node := New_Copy (Ref);
535 Ref_Node := New_Reference_To (Ref, Loc);
539 Make_Raise_Program_Error (Loc,
543 Build_Get_Access_Level (Loc,
544 Make_Attribute_Reference (Loc,
546 Attribute_Name => Name_Tag)),
548 Make_Integer_Literal (Loc,
549 Type_Access_Level (PtrT))),
550 Reason => PE_Accessibility_Check_Failed));
552 end Apply_Accessibility_Check;
556 Indic : constant Node_Id := Subtype_Mark (Expression (N));
557 T : constant Entity_Id := Entity (Indic);
562 TagT : Entity_Id := Empty;
563 -- Type used as source for tag assignment
565 TagR : Node_Id := Empty;
566 -- Target reference for tag assignment
568 Aggr_In_Place : constant Boolean := Is_Delayed_Aggregate (Exp);
570 Tag_Assign : Node_Id;
573 -- Start of processing for Expand_Allocator_Expression
576 if Is_Tagged_Type (T) or else Needs_Finalization (T) then
578 if Is_CPP_Constructor_Call (Exp) then
581 -- Pnnn : constant ptr_T := new (T); Init (Pnnn.all,...); Pnnn
583 -- Allocate the object with no expression
585 Node := Relocate_Node (N);
586 Set_Expression (Node, New_Reference_To (Etype (Exp), Loc));
588 -- Avoid its expansion to avoid generating a call to the default
593 Temp := Make_Temporary (Loc, 'P', N);
596 Make_Object_Declaration (Loc,
597 Defining_Identifier => Temp,
598 Constant_Present => True,
599 Object_Definition => New_Reference_To (PtrT, Loc),
600 Expression => Node));
602 Apply_Accessibility_Check (Temp);
604 -- Locate the enclosing list and insert the C++ constructor call
611 while not Is_List_Member (P) loop
615 Insert_List_After_And_Analyze (P,
616 Build_Initialization_Call (Loc,
618 Make_Explicit_Dereference (Loc,
619 Prefix => New_Reference_To (Temp, Loc)),
621 Constructor_Ref => Exp));
624 Rewrite (N, New_Reference_To (Temp, Loc));
625 Analyze_And_Resolve (N, PtrT);
629 -- Ada 2005 (AI-318-02): If the initialization expression is a call
630 -- to a build-in-place function, then access to the allocated object
631 -- must be passed to the function. Currently we limit such functions
632 -- to those with constrained limited result subtypes, but eventually
633 -- we plan to expand the allowed forms of functions that are treated
634 -- as build-in-place.
636 if Ada_Version >= Ada_05
637 and then Is_Build_In_Place_Function_Call (Exp)
639 Make_Build_In_Place_Call_In_Allocator (N, Exp);
640 Apply_Accessibility_Check (N, Built_In_Place => True);
644 -- Actions inserted before:
645 -- Temp : constant ptr_T := new T'(Expression);
646 -- <no CW> Temp._tag := T'tag;
647 -- <CTRL> Adjust (Finalizable (Temp.all));
648 -- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
650 -- We analyze by hand the new internal allocator to avoid
651 -- any recursion and inappropriate call to Initialize
653 -- We don't want to remove side effects when the expression must be
654 -- built in place. In the case of a build-in-place function call,
655 -- that could lead to a duplication of the call, which was already
656 -- substituted for the allocator.
658 if not Aggr_In_Place then
659 Remove_Side_Effects (Exp);
662 Temp := Make_Temporary (Loc, 'P', N);
664 -- For a class wide allocation generate the following code:
666 -- type Equiv_Record is record ... end record;
667 -- implicit subtype CW is <Class_Wide_Subytpe>;
668 -- temp : PtrT := new CW'(CW!(expr));
670 if Is_Class_Wide_Type (T) then
671 Expand_Subtype_From_Expr (Empty, T, Indic, Exp);
673 -- Ada 2005 (AI-251): If the expression is a class-wide interface
674 -- object we generate code to move up "this" to reference the
675 -- base of the object before allocating the new object.
677 -- Note that Exp'Address is recursively expanded into a call
678 -- to Base_Address (Exp.Tag)
680 if Is_Class_Wide_Type (Etype (Exp))
681 and then Is_Interface (Etype (Exp))
682 and then Tagged_Type_Expansion
686 Unchecked_Convert_To (Entity (Indic),
687 Make_Explicit_Dereference (Loc,
688 Unchecked_Convert_To (RTE (RE_Tag_Ptr),
689 Make_Attribute_Reference (Loc,
691 Attribute_Name => Name_Address)))));
696 Unchecked_Convert_To (Entity (Indic), Exp));
699 Analyze_And_Resolve (Expression (N), Entity (Indic));
702 -- Keep separate the management of allocators returning interfaces
704 if not Is_Interface (Directly_Designated_Type (PtrT)) then
705 if Aggr_In_Place then
707 Make_Object_Declaration (Loc,
708 Defining_Identifier => Temp,
709 Object_Definition => New_Reference_To (PtrT, Loc),
712 New_Reference_To (Etype (Exp), Loc)));
714 -- Copy the Comes_From_Source flag for the allocator we just
715 -- built, since logically this allocator is a replacement of
716 -- the original allocator node. This is for proper handling of
717 -- restriction No_Implicit_Heap_Allocations.
719 Set_Comes_From_Source
720 (Expression (Tmp_Node), Comes_From_Source (N));
722 Set_No_Initialization (Expression (Tmp_Node));
723 Insert_Action (N, Tmp_Node);
725 if Needs_Finalization (T)
726 and then Ekind (PtrT) = E_Anonymous_Access_Type
728 -- Create local finalization list for access parameter
730 Flist := Get_Allocator_Final_List (N, Base_Type (T), PtrT);
733 Convert_Aggr_In_Allocator (N, Tmp_Node, Exp);
736 Node := Relocate_Node (N);
739 Make_Object_Declaration (Loc,
740 Defining_Identifier => Temp,
741 Constant_Present => True,
742 Object_Definition => New_Reference_To (PtrT, Loc),
743 Expression => Node));
746 -- Ada 2005 (AI-251): Handle allocators whose designated type is an
747 -- interface type. In this case we use the type of the qualified
748 -- expression to allocate the object.
752 Def_Id : constant Entity_Id := Make_Temporary (Loc, 'T');
757 Make_Full_Type_Declaration (Loc,
758 Defining_Identifier => Def_Id,
760 Make_Access_To_Object_Definition (Loc,
762 Null_Exclusion_Present => False,
763 Constant_Present => False,
764 Subtype_Indication =>
765 New_Reference_To (Etype (Exp), Loc)));
767 Insert_Action (N, New_Decl);
769 -- Inherit the final chain to ensure that the expansion of the
770 -- aggregate is correct in case of controlled types
772 if Needs_Finalization (Directly_Designated_Type (PtrT)) then
773 Set_Associated_Final_Chain (Def_Id,
774 Associated_Final_Chain (PtrT));
777 -- Declare the object using the previous type declaration
779 if Aggr_In_Place then
781 Make_Object_Declaration (Loc,
782 Defining_Identifier => Temp,
783 Object_Definition => New_Reference_To (Def_Id, Loc),
786 New_Reference_To (Etype (Exp), Loc)));
788 -- Copy the Comes_From_Source flag for the allocator we just
789 -- built, since logically this allocator is a replacement of
790 -- the original allocator node. This is for proper handling
791 -- of restriction No_Implicit_Heap_Allocations.
793 Set_Comes_From_Source
794 (Expression (Tmp_Node), Comes_From_Source (N));
796 Set_No_Initialization (Expression (Tmp_Node));
797 Insert_Action (N, Tmp_Node);
799 if Needs_Finalization (T)
800 and then Ekind (PtrT) = E_Anonymous_Access_Type
802 -- Create local finalization list for access parameter
805 Get_Allocator_Final_List (N, Base_Type (T), PtrT);
808 Convert_Aggr_In_Allocator (N, Tmp_Node, Exp);
810 Node := Relocate_Node (N);
813 Make_Object_Declaration (Loc,
814 Defining_Identifier => Temp,
815 Constant_Present => True,
816 Object_Definition => New_Reference_To (Def_Id, Loc),
817 Expression => Node));
820 -- Generate an additional object containing the address of the
821 -- returned object. The type of this second object declaration
822 -- is the correct type required for the common processing that
823 -- is still performed by this subprogram. The displacement of
824 -- this pointer to reference the component associated with the
825 -- interface type will be done at the end of common processing.
828 Make_Object_Declaration (Loc,
829 Defining_Identifier => Make_Temporary (Loc, 'P'),
830 Object_Definition => New_Reference_To (PtrT, Loc),
831 Expression => Unchecked_Convert_To (PtrT,
832 New_Reference_To (Temp, Loc)));
834 Insert_Action (N, New_Decl);
836 Tmp_Node := New_Decl;
837 Temp := Defining_Identifier (New_Decl);
841 Apply_Accessibility_Check (Temp);
843 -- Generate the tag assignment
845 -- Suppress the tag assignment when VM_Target because VM tags are
846 -- represented implicitly in objects.
848 if not Tagged_Type_Expansion then
851 -- Ada 2005 (AI-251): Suppress the tag assignment with class-wide
852 -- interface objects because in this case the tag does not change.
854 elsif Is_Interface (Directly_Designated_Type (Etype (N))) then
855 pragma Assert (Is_Class_Wide_Type
856 (Directly_Designated_Type (Etype (N))));
859 elsif Is_Tagged_Type (T) and then not Is_Class_Wide_Type (T) then
861 TagR := New_Reference_To (Temp, Loc);
863 elsif Is_Private_Type (T)
864 and then Is_Tagged_Type (Underlying_Type (T))
866 TagT := Underlying_Type (T);
868 Unchecked_Convert_To (Underlying_Type (T),
869 Make_Explicit_Dereference (Loc,
870 Prefix => New_Reference_To (Temp, Loc)));
873 if Present (TagT) then
875 Make_Assignment_Statement (Loc,
877 Make_Selected_Component (Loc,
880 New_Reference_To (First_Tag_Component (TagT), Loc)),
883 Unchecked_Convert_To (RTE (RE_Tag),
885 (Elists.Node (First_Elmt (Access_Disp_Table (TagT))),
888 -- The previous assignment has to be done in any case
890 Set_Assignment_OK (Name (Tag_Assign));
891 Insert_Action (N, Tag_Assign);
894 if Needs_Finalization (DesigT)
895 and then Needs_Finalization (T)
899 Apool : constant Entity_Id :=
900 Associated_Storage_Pool (PtrT);
903 -- If it is an allocation on the secondary stack (i.e. a value
904 -- returned from a function), the object is attached on the
905 -- caller side as soon as the call is completed (see
906 -- Expand_Ctrl_Function_Call)
908 if Is_RTE (Apool, RE_SS_Pool) then
910 F : constant Entity_Id := Make_Temporary (Loc, 'F');
913 Make_Object_Declaration (Loc,
914 Defining_Identifier => F,
916 New_Reference_To (RTE (RE_Finalizable_Ptr), Loc)));
917 Flist := New_Reference_To (F, Loc);
918 Attach := Make_Integer_Literal (Loc, 1);
921 -- Normal case, not a secondary stack allocation
924 if Needs_Finalization (T)
925 and then Ekind (PtrT) = E_Anonymous_Access_Type
927 -- Create local finalization list for access parameter
930 Get_Allocator_Final_List (N, Base_Type (T), PtrT);
932 Flist := Find_Final_List (PtrT);
935 Attach := Make_Integer_Literal (Loc, 2);
938 -- Generate an Adjust call if the object will be moved. In Ada
939 -- 2005, the object may be inherently limited, in which case
940 -- there is no Adjust procedure, and the object is built in
941 -- place. In Ada 95, the object can be limited but not
942 -- inherently limited if this allocator came from a return
943 -- statement (we're allocating the result on the secondary
944 -- stack). In that case, the object will be moved, so we _do_
948 and then not Is_Inherently_Limited_Type (T)
954 -- An unchecked conversion is needed in the classwide
955 -- case because the designated type can be an ancestor of
956 -- the subtype mark of the allocator.
958 Unchecked_Convert_To (T,
959 Make_Explicit_Dereference (Loc,
960 Prefix => New_Reference_To (Temp, Loc))),
964 With_Attach => Attach,
970 Rewrite (N, New_Reference_To (Temp, Loc));
971 Analyze_And_Resolve (N, PtrT);
973 -- Ada 2005 (AI-251): Displace the pointer to reference the record
974 -- component containing the secondary dispatch table of the interface
977 if Is_Interface (Directly_Designated_Type (PtrT)) then
978 Displace_Allocator_Pointer (N);
981 elsif Aggr_In_Place then
982 Temp := Make_Temporary (Loc, 'P', N);
984 Make_Object_Declaration (Loc,
985 Defining_Identifier => Temp,
986 Object_Definition => New_Reference_To (PtrT, Loc),
987 Expression => Make_Allocator (Loc,
988 New_Reference_To (Etype (Exp), Loc)));
990 -- Copy the Comes_From_Source flag for the allocator we just built,
991 -- since logically this allocator is a replacement of the original
992 -- allocator node. This is for proper handling of restriction
993 -- No_Implicit_Heap_Allocations.
995 Set_Comes_From_Source
996 (Expression (Tmp_Node), Comes_From_Source (N));
998 Set_No_Initialization (Expression (Tmp_Node));
999 Insert_Action (N, Tmp_Node);
1000 Convert_Aggr_In_Allocator (N, Tmp_Node, Exp);
1001 Rewrite (N, New_Reference_To (Temp, Loc));
1002 Analyze_And_Resolve (N, PtrT);
1004 elsif Is_Access_Type (T)
1005 and then Can_Never_Be_Null (T)
1007 Install_Null_Excluding_Check (Exp);
1009 elsif Is_Access_Type (DesigT)
1010 and then Nkind (Exp) = N_Allocator
1011 and then Nkind (Expression (Exp)) /= N_Qualified_Expression
1013 -- Apply constraint to designated subtype indication
1015 Apply_Constraint_Check (Expression (Exp),
1016 Designated_Type (DesigT),
1017 No_Sliding => True);
1019 if Nkind (Expression (Exp)) = N_Raise_Constraint_Error then
1021 -- Propagate constraint_error to enclosing allocator
1023 Rewrite (Exp, New_Copy (Expression (Exp)));
1027 -- type A is access T1;
1028 -- X : A := new T2'(...);
1029 -- T1 and T2 can be different subtypes, and we might need to check
1030 -- both constraints. First check against the type of the qualified
1033 Apply_Constraint_Check (Exp, T, No_Sliding => True);
1035 if Do_Range_Check (Exp) then
1036 Set_Do_Range_Check (Exp, False);
1037 Generate_Range_Check (Exp, DesigT, CE_Range_Check_Failed);
1040 -- A check is also needed in cases where the designated subtype is
1041 -- constrained and differs from the subtype given in the qualified
1042 -- expression. Note that the check on the qualified expression does
1043 -- not allow sliding, but this check does (a relaxation from Ada 83).
1045 if Is_Constrained (DesigT)
1046 and then not Subtypes_Statically_Match (T, DesigT)
1048 Apply_Constraint_Check
1049 (Exp, DesigT, No_Sliding => False);
1051 if Do_Range_Check (Exp) then
1052 Set_Do_Range_Check (Exp, False);
1053 Generate_Range_Check (Exp, DesigT, CE_Range_Check_Failed);
1057 -- For an access to unconstrained packed array, GIGI needs to see an
1058 -- expression with a constrained subtype in order to compute the
1059 -- proper size for the allocator.
1061 if Is_Array_Type (T)
1062 and then not Is_Constrained (T)
1063 and then Is_Packed (T)
1066 ConstrT : constant Entity_Id := Make_Temporary (Loc, 'A');
1067 Internal_Exp : constant Node_Id := Relocate_Node (Exp);
1070 Make_Subtype_Declaration (Loc,
1071 Defining_Identifier => ConstrT,
1072 Subtype_Indication =>
1073 Make_Subtype_From_Expr (Exp, T)));
1074 Freeze_Itype (ConstrT, Exp);
1075 Rewrite (Exp, OK_Convert_To (ConstrT, Internal_Exp));
1079 -- Ada 2005 (AI-318-02): If the initialization expression is a call
1080 -- to a build-in-place function, then access to the allocated object
1081 -- must be passed to the function. Currently we limit such functions
1082 -- to those with constrained limited result subtypes, but eventually
1083 -- we plan to expand the allowed forms of functions that are treated
1084 -- as build-in-place.
1086 if Ada_Version >= Ada_05
1087 and then Is_Build_In_Place_Function_Call (Exp)
1089 Make_Build_In_Place_Call_In_Allocator (N, Exp);
1094 when RE_Not_Available =>
1096 end Expand_Allocator_Expression;
1098 -----------------------------
1099 -- Expand_Array_Comparison --
1100 -----------------------------
1102 -- Expansion is only required in the case of array types. For the unpacked
1103 -- case, an appropriate runtime routine is called. For packed cases, and
1104 -- also in some other cases where a runtime routine cannot be called, the
1105 -- form of the expansion is:
1107 -- [body for greater_nn; boolean_expression]
1109 -- The body is built by Make_Array_Comparison_Op, and the form of the
1110 -- Boolean expression depends on the operator involved.
1112 procedure Expand_Array_Comparison (N : Node_Id) is
1113 Loc : constant Source_Ptr := Sloc (N);
1114 Op1 : Node_Id := Left_Opnd (N);
1115 Op2 : Node_Id := Right_Opnd (N);
1116 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
1117 Ctyp : constant Entity_Id := Component_Type (Typ1);
1120 Func_Body : Node_Id;
1121 Func_Name : Entity_Id;
1125 Byte_Addressable : constant Boolean := System_Storage_Unit = Byte'Size;
1126 -- True for byte addressable target
1128 function Length_Less_Than_4 (Opnd : Node_Id) return Boolean;
1129 -- Returns True if the length of the given operand is known to be less
1130 -- than 4. Returns False if this length is known to be four or greater
1131 -- or is not known at compile time.
1133 ------------------------
1134 -- Length_Less_Than_4 --
1135 ------------------------
1137 function Length_Less_Than_4 (Opnd : Node_Id) return Boolean is
1138 Otyp : constant Entity_Id := Etype (Opnd);
1141 if Ekind (Otyp) = E_String_Literal_Subtype then
1142 return String_Literal_Length (Otyp) < 4;
1146 Ityp : constant Entity_Id := Etype (First_Index (Otyp));
1147 Lo : constant Node_Id := Type_Low_Bound (Ityp);
1148 Hi : constant Node_Id := Type_High_Bound (Ityp);
1153 if Compile_Time_Known_Value (Lo) then
1154 Lov := Expr_Value (Lo);
1159 if Compile_Time_Known_Value (Hi) then
1160 Hiv := Expr_Value (Hi);
1165 return Hiv < Lov + 3;
1168 end Length_Less_Than_4;
1170 -- Start of processing for Expand_Array_Comparison
1173 -- Deal first with unpacked case, where we can call a runtime routine
1174 -- except that we avoid this for targets for which are not addressable
1175 -- by bytes, and for the JVM/CIL, since they do not support direct
1176 -- addressing of array components.
1178 if not Is_Bit_Packed_Array (Typ1)
1179 and then Byte_Addressable
1180 and then VM_Target = No_VM
1182 -- The call we generate is:
1184 -- Compare_Array_xn[_Unaligned]
1185 -- (left'address, right'address, left'length, right'length) <op> 0
1187 -- x = U for unsigned, S for signed
1188 -- n = 8,16,32,64 for component size
1189 -- Add _Unaligned if length < 4 and component size is 8.
1190 -- <op> is the standard comparison operator
1192 if Component_Size (Typ1) = 8 then
1193 if Length_Less_Than_4 (Op1)
1195 Length_Less_Than_4 (Op2)
1197 if Is_Unsigned_Type (Ctyp) then
1198 Comp := RE_Compare_Array_U8_Unaligned;
1200 Comp := RE_Compare_Array_S8_Unaligned;
1204 if Is_Unsigned_Type (Ctyp) then
1205 Comp := RE_Compare_Array_U8;
1207 Comp := RE_Compare_Array_S8;
1211 elsif Component_Size (Typ1) = 16 then
1212 if Is_Unsigned_Type (Ctyp) then
1213 Comp := RE_Compare_Array_U16;
1215 Comp := RE_Compare_Array_S16;
1218 elsif Component_Size (Typ1) = 32 then
1219 if Is_Unsigned_Type (Ctyp) then
1220 Comp := RE_Compare_Array_U32;
1222 Comp := RE_Compare_Array_S32;
1225 else pragma Assert (Component_Size (Typ1) = 64);
1226 if Is_Unsigned_Type (Ctyp) then
1227 Comp := RE_Compare_Array_U64;
1229 Comp := RE_Compare_Array_S64;
1233 Remove_Side_Effects (Op1, Name_Req => True);
1234 Remove_Side_Effects (Op2, Name_Req => True);
1237 Make_Function_Call (Sloc (Op1),
1238 Name => New_Occurrence_Of (RTE (Comp), Loc),
1240 Parameter_Associations => New_List (
1241 Make_Attribute_Reference (Loc,
1242 Prefix => Relocate_Node (Op1),
1243 Attribute_Name => Name_Address),
1245 Make_Attribute_Reference (Loc,
1246 Prefix => Relocate_Node (Op2),
1247 Attribute_Name => Name_Address),
1249 Make_Attribute_Reference (Loc,
1250 Prefix => Relocate_Node (Op1),
1251 Attribute_Name => Name_Length),
1253 Make_Attribute_Reference (Loc,
1254 Prefix => Relocate_Node (Op2),
1255 Attribute_Name => Name_Length))));
1258 Make_Integer_Literal (Sloc (Op2),
1261 Analyze_And_Resolve (Op1, Standard_Integer);
1262 Analyze_And_Resolve (Op2, Standard_Integer);
1266 -- Cases where we cannot make runtime call
1268 -- For (a <= b) we convert to not (a > b)
1270 if Chars (N) = Name_Op_Le then
1276 Right_Opnd => Op2)));
1277 Analyze_And_Resolve (N, Standard_Boolean);
1280 -- For < the Boolean expression is
1281 -- greater__nn (op2, op1)
1283 elsif Chars (N) = Name_Op_Lt then
1284 Func_Body := Make_Array_Comparison_Op (Typ1, N);
1288 Op1 := Right_Opnd (N);
1289 Op2 := Left_Opnd (N);
1291 -- For (a >= b) we convert to not (a < b)
1293 elsif Chars (N) = Name_Op_Ge then
1299 Right_Opnd => Op2)));
1300 Analyze_And_Resolve (N, Standard_Boolean);
1303 -- For > the Boolean expression is
1304 -- greater__nn (op1, op2)
1307 pragma Assert (Chars (N) = Name_Op_Gt);
1308 Func_Body := Make_Array_Comparison_Op (Typ1, N);
1311 Func_Name := Defining_Unit_Name (Specification (Func_Body));
1313 Make_Function_Call (Loc,
1314 Name => New_Reference_To (Func_Name, Loc),
1315 Parameter_Associations => New_List (Op1, Op2));
1317 Insert_Action (N, Func_Body);
1319 Analyze_And_Resolve (N, Standard_Boolean);
1322 when RE_Not_Available =>
1324 end Expand_Array_Comparison;
1326 ---------------------------
1327 -- Expand_Array_Equality --
1328 ---------------------------
1330 -- Expand an equality function for multi-dimensional arrays. Here is an
1331 -- example of such a function for Nb_Dimension = 2
1333 -- function Enn (A : atyp; B : btyp) return boolean is
1335 -- if (A'length (1) = 0 or else A'length (2) = 0)
1337 -- (B'length (1) = 0 or else B'length (2) = 0)
1339 -- return True; -- RM 4.5.2(22)
1342 -- if A'length (1) /= B'length (1)
1344 -- A'length (2) /= B'length (2)
1346 -- return False; -- RM 4.5.2(23)
1350 -- A1 : Index_T1 := A'first (1);
1351 -- B1 : Index_T1 := B'first (1);
1355 -- A2 : Index_T2 := A'first (2);
1356 -- B2 : Index_T2 := B'first (2);
1359 -- if A (A1, A2) /= B (B1, B2) then
1363 -- exit when A2 = A'last (2);
1364 -- A2 := Index_T2'succ (A2);
1365 -- B2 := Index_T2'succ (B2);
1369 -- exit when A1 = A'last (1);
1370 -- A1 := Index_T1'succ (A1);
1371 -- B1 := Index_T1'succ (B1);
1378 -- Note on the formal types used (atyp and btyp). If either of the arrays
1379 -- is of a private type, we use the underlying type, and do an unchecked
1380 -- conversion of the actual. If either of the arrays has a bound depending
1381 -- on a discriminant, then we use the base type since otherwise we have an
1382 -- escaped discriminant in the function.
1384 -- If both arrays are constrained and have the same bounds, we can generate
1385 -- a loop with an explicit iteration scheme using a 'Range attribute over
1388 function Expand_Array_Equality
1393 Typ : Entity_Id) return Node_Id
1395 Loc : constant Source_Ptr := Sloc (Nod);
1396 Decls : constant List_Id := New_List;
1397 Index_List1 : constant List_Id := New_List;
1398 Index_List2 : constant List_Id := New_List;
1402 Func_Name : Entity_Id;
1403 Func_Body : Node_Id;
1405 A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA);
1406 B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB);
1410 -- The parameter types to be used for the formals
1415 Num : Int) return Node_Id;
1416 -- This builds the attribute reference Arr'Nam (Expr)
1418 function Component_Equality (Typ : Entity_Id) return Node_Id;
1419 -- Create one statement to compare corresponding components, designated
1420 -- by a full set of indices.
1422 function Get_Arg_Type (N : Node_Id) return Entity_Id;
1423 -- Given one of the arguments, computes the appropriate type to be used
1424 -- for that argument in the corresponding function formal
1426 function Handle_One_Dimension
1428 Index : Node_Id) return Node_Id;
1429 -- This procedure returns the following code
1432 -- Bn : Index_T := B'First (N);
1436 -- exit when An = A'Last (N);
1437 -- An := Index_T'Succ (An)
1438 -- Bn := Index_T'Succ (Bn)
1442 -- If both indices are constrained and identical, the procedure
1443 -- returns a simpler loop:
1445 -- for An in A'Range (N) loop
1449 -- N is the dimension for which we are generating a loop. Index is the
1450 -- N'th index node, whose Etype is Index_Type_n in the above code. The
1451 -- xxx statement is either the loop or declare for the next dimension
1452 -- or if this is the last dimension the comparison of corresponding
1453 -- components of the arrays.
1455 -- The actual way the code works is to return the comparison of
1456 -- corresponding components for the N+1 call. That's neater!
1458 function Test_Empty_Arrays return Node_Id;
1459 -- This function constructs the test for both arrays being empty
1460 -- (A'length (1) = 0 or else A'length (2) = 0 or else ...)
1462 -- (B'length (1) = 0 or else B'length (2) = 0 or else ...)
1464 function Test_Lengths_Correspond return Node_Id;
1465 -- This function constructs the test for arrays having different lengths
1466 -- in at least one index position, in which case the resulting code is:
1468 -- A'length (1) /= B'length (1)
1470 -- A'length (2) /= B'length (2)
1481 Num : Int) return Node_Id
1485 Make_Attribute_Reference (Loc,
1486 Attribute_Name => Nam,
1487 Prefix => New_Reference_To (Arr, Loc),
1488 Expressions => New_List (Make_Integer_Literal (Loc, Num)));
1491 ------------------------
1492 -- Component_Equality --
1493 ------------------------
1495 function Component_Equality (Typ : Entity_Id) return Node_Id is
1500 -- if a(i1...) /= b(j1...) then return false; end if;
1503 Make_Indexed_Component (Loc,
1504 Prefix => Make_Identifier (Loc, Chars (A)),
1505 Expressions => Index_List1);
1508 Make_Indexed_Component (Loc,
1509 Prefix => Make_Identifier (Loc, Chars (B)),
1510 Expressions => Index_List2);
1512 Test := Expand_Composite_Equality
1513 (Nod, Component_Type (Typ), L, R, Decls);
1515 -- If some (sub)component is an unchecked_union, the whole operation
1516 -- will raise program error.
1518 if Nkind (Test) = N_Raise_Program_Error then
1520 -- This node is going to be inserted at a location where a
1521 -- statement is expected: clear its Etype so analysis will set
1522 -- it to the expected Standard_Void_Type.
1524 Set_Etype (Test, Empty);
1529 Make_Implicit_If_Statement (Nod,
1530 Condition => Make_Op_Not (Loc, Right_Opnd => Test),
1531 Then_Statements => New_List (
1532 Make_Simple_Return_Statement (Loc,
1533 Expression => New_Occurrence_Of (Standard_False, Loc))));
1535 end Component_Equality;
1541 function Get_Arg_Type (N : Node_Id) return Entity_Id is
1552 T := Underlying_Type (T);
1554 X := First_Index (T);
1555 while Present (X) loop
1556 if Denotes_Discriminant (Type_Low_Bound (Etype (X)))
1558 Denotes_Discriminant (Type_High_Bound (Etype (X)))
1571 --------------------------
1572 -- Handle_One_Dimension --
1573 ---------------------------
1575 function Handle_One_Dimension
1577 Index : Node_Id) return Node_Id
1579 Need_Separate_Indexes : constant Boolean :=
1581 or else not Is_Constrained (Ltyp);
1582 -- If the index types are identical, and we are working with
1583 -- constrained types, then we can use the same index for both
1586 An : constant Entity_Id := Make_Temporary (Loc, 'A');
1589 Index_T : Entity_Id;
1594 if N > Number_Dimensions (Ltyp) then
1595 return Component_Equality (Ltyp);
1598 -- Case where we generate a loop
1600 Index_T := Base_Type (Etype (Index));
1602 if Need_Separate_Indexes then
1603 Bn := Make_Temporary (Loc, 'B');
1608 Append (New_Reference_To (An, Loc), Index_List1);
1609 Append (New_Reference_To (Bn, Loc), Index_List2);
1611 Stm_List := New_List (
1612 Handle_One_Dimension (N + 1, Next_Index (Index)));
1614 if Need_Separate_Indexes then
1616 -- Generate guard for loop, followed by increments of indices
1618 Append_To (Stm_List,
1619 Make_Exit_Statement (Loc,
1622 Left_Opnd => New_Reference_To (An, Loc),
1623 Right_Opnd => Arr_Attr (A, Name_Last, N))));
1625 Append_To (Stm_List,
1626 Make_Assignment_Statement (Loc,
1627 Name => New_Reference_To (An, Loc),
1629 Make_Attribute_Reference (Loc,
1630 Prefix => New_Reference_To (Index_T, Loc),
1631 Attribute_Name => Name_Succ,
1632 Expressions => New_List (New_Reference_To (An, Loc)))));
1634 Append_To (Stm_List,
1635 Make_Assignment_Statement (Loc,
1636 Name => New_Reference_To (Bn, Loc),
1638 Make_Attribute_Reference (Loc,
1639 Prefix => New_Reference_To (Index_T, Loc),
1640 Attribute_Name => Name_Succ,
1641 Expressions => New_List (New_Reference_To (Bn, Loc)))));
1644 -- If separate indexes, we need a declare block for An and Bn, and a
1645 -- loop without an iteration scheme.
1647 if Need_Separate_Indexes then
1649 Make_Implicit_Loop_Statement (Nod, Statements => Stm_List);
1652 Make_Block_Statement (Loc,
1653 Declarations => New_List (
1654 Make_Object_Declaration (Loc,
1655 Defining_Identifier => An,
1656 Object_Definition => New_Reference_To (Index_T, Loc),
1657 Expression => Arr_Attr (A, Name_First, N)),
1659 Make_Object_Declaration (Loc,
1660 Defining_Identifier => Bn,
1661 Object_Definition => New_Reference_To (Index_T, Loc),
1662 Expression => Arr_Attr (B, Name_First, N))),
1664 Handled_Statement_Sequence =>
1665 Make_Handled_Sequence_Of_Statements (Loc,
1666 Statements => New_List (Loop_Stm)));
1668 -- If no separate indexes, return loop statement with explicit
1669 -- iteration scheme on its own
1673 Make_Implicit_Loop_Statement (Nod,
1674 Statements => Stm_List,
1676 Make_Iteration_Scheme (Loc,
1677 Loop_Parameter_Specification =>
1678 Make_Loop_Parameter_Specification (Loc,
1679 Defining_Identifier => An,
1680 Discrete_Subtype_Definition =>
1681 Arr_Attr (A, Name_Range, N))));
1684 end Handle_One_Dimension;
1686 -----------------------
1687 -- Test_Empty_Arrays --
1688 -----------------------
1690 function Test_Empty_Arrays return Node_Id is
1700 for J in 1 .. Number_Dimensions (Ltyp) loop
1703 Left_Opnd => Arr_Attr (A, Name_Length, J),
1704 Right_Opnd => Make_Integer_Literal (Loc, 0));
1708 Left_Opnd => Arr_Attr (B, Name_Length, J),
1709 Right_Opnd => Make_Integer_Literal (Loc, 0));
1718 Left_Opnd => Relocate_Node (Alist),
1719 Right_Opnd => Atest);
1723 Left_Opnd => Relocate_Node (Blist),
1724 Right_Opnd => Btest);
1731 Right_Opnd => Blist);
1732 end Test_Empty_Arrays;
1734 -----------------------------
1735 -- Test_Lengths_Correspond --
1736 -----------------------------
1738 function Test_Lengths_Correspond return Node_Id is
1744 for J in 1 .. Number_Dimensions (Ltyp) loop
1747 Left_Opnd => Arr_Attr (A, Name_Length, J),
1748 Right_Opnd => Arr_Attr (B, Name_Length, J));
1755 Left_Opnd => Relocate_Node (Result),
1756 Right_Opnd => Rtest);
1761 end Test_Lengths_Correspond;
1763 -- Start of processing for Expand_Array_Equality
1766 Ltyp := Get_Arg_Type (Lhs);
1767 Rtyp := Get_Arg_Type (Rhs);
1769 -- For now, if the argument types are not the same, go to the base type,
1770 -- since the code assumes that the formals have the same type. This is
1771 -- fixable in future ???
1773 if Ltyp /= Rtyp then
1774 Ltyp := Base_Type (Ltyp);
1775 Rtyp := Base_Type (Rtyp);
1776 pragma Assert (Ltyp = Rtyp);
1779 -- Build list of formals for function
1781 Formals := New_List (
1782 Make_Parameter_Specification (Loc,
1783 Defining_Identifier => A,
1784 Parameter_Type => New_Reference_To (Ltyp, Loc)),
1786 Make_Parameter_Specification (Loc,
1787 Defining_Identifier => B,
1788 Parameter_Type => New_Reference_To (Rtyp, Loc)));
1790 Func_Name := Make_Temporary (Loc, 'E');
1792 -- Build statement sequence for function
1795 Make_Subprogram_Body (Loc,
1797 Make_Function_Specification (Loc,
1798 Defining_Unit_Name => Func_Name,
1799 Parameter_Specifications => Formals,
1800 Result_Definition => New_Reference_To (Standard_Boolean, Loc)),
1802 Declarations => Decls,
1804 Handled_Statement_Sequence =>
1805 Make_Handled_Sequence_Of_Statements (Loc,
1806 Statements => New_List (
1808 Make_Implicit_If_Statement (Nod,
1809 Condition => Test_Empty_Arrays,
1810 Then_Statements => New_List (
1811 Make_Simple_Return_Statement (Loc,
1813 New_Occurrence_Of (Standard_True, Loc)))),
1815 Make_Implicit_If_Statement (Nod,
1816 Condition => Test_Lengths_Correspond,
1817 Then_Statements => New_List (
1818 Make_Simple_Return_Statement (Loc,
1820 New_Occurrence_Of (Standard_False, Loc)))),
1822 Handle_One_Dimension (1, First_Index (Ltyp)),
1824 Make_Simple_Return_Statement (Loc,
1825 Expression => New_Occurrence_Of (Standard_True, Loc)))));
1827 Set_Has_Completion (Func_Name, True);
1828 Set_Is_Inlined (Func_Name);
1830 -- If the array type is distinct from the type of the arguments, it
1831 -- is the full view of a private type. Apply an unchecked conversion
1832 -- to insure that analysis of the call succeeds.
1842 or else Base_Type (Etype (Lhs)) /= Base_Type (Ltyp)
1844 L := OK_Convert_To (Ltyp, Lhs);
1848 or else Base_Type (Etype (Rhs)) /= Base_Type (Rtyp)
1850 R := OK_Convert_To (Rtyp, Rhs);
1853 Actuals := New_List (L, R);
1856 Append_To (Bodies, Func_Body);
1859 Make_Function_Call (Loc,
1860 Name => New_Reference_To (Func_Name, Loc),
1861 Parameter_Associations => Actuals);
1862 end Expand_Array_Equality;
1864 -----------------------------
1865 -- Expand_Boolean_Operator --
1866 -----------------------------
1868 -- Note that we first get the actual subtypes of the operands, since we
1869 -- always want to deal with types that have bounds.
1871 procedure Expand_Boolean_Operator (N : Node_Id) is
1872 Typ : constant Entity_Id := Etype (N);
1875 -- Special case of bit packed array where both operands are known to be
1876 -- properly aligned. In this case we use an efficient run time routine
1877 -- to carry out the operation (see System.Bit_Ops).
1879 if Is_Bit_Packed_Array (Typ)
1880 and then not Is_Possibly_Unaligned_Object (Left_Opnd (N))
1881 and then not Is_Possibly_Unaligned_Object (Right_Opnd (N))
1883 Expand_Packed_Boolean_Operator (N);
1887 -- For the normal non-packed case, the general expansion is to build
1888 -- function for carrying out the comparison (use Make_Boolean_Array_Op)
1889 -- and then inserting it into the tree. The original operator node is
1890 -- then rewritten as a call to this function. We also use this in the
1891 -- packed case if either operand is a possibly unaligned object.
1894 Loc : constant Source_Ptr := Sloc (N);
1895 L : constant Node_Id := Relocate_Node (Left_Opnd (N));
1896 R : constant Node_Id := Relocate_Node (Right_Opnd (N));
1897 Func_Body : Node_Id;
1898 Func_Name : Entity_Id;
1901 Convert_To_Actual_Subtype (L);
1902 Convert_To_Actual_Subtype (R);
1903 Ensure_Defined (Etype (L), N);
1904 Ensure_Defined (Etype (R), N);
1905 Apply_Length_Check (R, Etype (L));
1907 if Nkind (N) = N_Op_Xor then
1908 Silly_Boolean_Array_Xor_Test (N, Etype (L));
1911 if Nkind (Parent (N)) = N_Assignment_Statement
1912 and then Safe_In_Place_Array_Op (Name (Parent (N)), L, R)
1914 Build_Boolean_Array_Proc_Call (Parent (N), L, R);
1916 elsif Nkind (Parent (N)) = N_Op_Not
1917 and then Nkind (N) = N_Op_And
1919 Safe_In_Place_Array_Op (Name (Parent (Parent (N))), L, R)
1924 Func_Body := Make_Boolean_Array_Op (Etype (L), N);
1925 Func_Name := Defining_Unit_Name (Specification (Func_Body));
1926 Insert_Action (N, Func_Body);
1928 -- Now rewrite the expression with a call
1931 Make_Function_Call (Loc,
1932 Name => New_Reference_To (Func_Name, Loc),
1933 Parameter_Associations =>
1936 Make_Type_Conversion
1937 (Loc, New_Reference_To (Etype (L), Loc), R))));
1939 Analyze_And_Resolve (N, Typ);
1942 end Expand_Boolean_Operator;
1944 -------------------------------
1945 -- Expand_Composite_Equality --
1946 -------------------------------
1948 -- This function is only called for comparing internal fields of composite
1949 -- types when these fields are themselves composites. This is a special
1950 -- case because it is not possible to respect normal Ada visibility rules.
1952 function Expand_Composite_Equality
1957 Bodies : List_Id) return Node_Id
1959 Loc : constant Source_Ptr := Sloc (Nod);
1960 Full_Type : Entity_Id;
1965 if Is_Private_Type (Typ) then
1966 Full_Type := Underlying_Type (Typ);
1971 -- Defense against malformed private types with no completion the error
1972 -- will be diagnosed later by check_completion
1974 if No (Full_Type) then
1975 return New_Reference_To (Standard_False, Loc);
1978 Full_Type := Base_Type (Full_Type);
1980 if Is_Array_Type (Full_Type) then
1982 -- If the operand is an elementary type other than a floating-point
1983 -- type, then we can simply use the built-in block bitwise equality,
1984 -- since the predefined equality operators always apply and bitwise
1985 -- equality is fine for all these cases.
1987 if Is_Elementary_Type (Component_Type (Full_Type))
1988 and then not Is_Floating_Point_Type (Component_Type (Full_Type))
1990 return Make_Op_Eq (Loc, Left_Opnd => Lhs, Right_Opnd => Rhs);
1992 -- For composite component types, and floating-point types, use the
1993 -- expansion. This deals with tagged component types (where we use
1994 -- the applicable equality routine) and floating-point, (where we
1995 -- need to worry about negative zeroes), and also the case of any
1996 -- composite type recursively containing such fields.
1999 return Expand_Array_Equality (Nod, Lhs, Rhs, Bodies, Full_Type);
2002 elsif Is_Tagged_Type (Full_Type) then
2004 -- Call the primitive operation "=" of this type
2006 if Is_Class_Wide_Type (Full_Type) then
2007 Full_Type := Root_Type (Full_Type);
2010 -- If this is derived from an untagged private type completed with a
2011 -- tagged type, it does not have a full view, so we use the primitive
2012 -- operations of the private type. This check should no longer be
2013 -- necessary when these types receive their full views ???
2015 if Is_Private_Type (Typ)
2016 and then not Is_Tagged_Type (Typ)
2017 and then not Is_Controlled (Typ)
2018 and then Is_Derived_Type (Typ)
2019 and then No (Full_View (Typ))
2021 Prim := First_Elmt (Collect_Primitive_Operations (Typ));
2023 Prim := First_Elmt (Primitive_Operations (Full_Type));
2027 Eq_Op := Node (Prim);
2028 exit when Chars (Eq_Op) = Name_Op_Eq
2029 and then Etype (First_Formal (Eq_Op)) =
2030 Etype (Next_Formal (First_Formal (Eq_Op)))
2031 and then Base_Type (Etype (Eq_Op)) = Standard_Boolean;
2033 pragma Assert (Present (Prim));
2036 Eq_Op := Node (Prim);
2039 Make_Function_Call (Loc,
2040 Name => New_Reference_To (Eq_Op, Loc),
2041 Parameter_Associations =>
2043 (Unchecked_Convert_To (Etype (First_Formal (Eq_Op)), Lhs),
2044 Unchecked_Convert_To (Etype (First_Formal (Eq_Op)), Rhs)));
2046 elsif Is_Record_Type (Full_Type) then
2047 Eq_Op := TSS (Full_Type, TSS_Composite_Equality);
2049 if Present (Eq_Op) then
2050 if Etype (First_Formal (Eq_Op)) /= Full_Type then
2052 -- Inherited equality from parent type. Convert the actuals to
2053 -- match signature of operation.
2056 T : constant Entity_Id := Etype (First_Formal (Eq_Op));
2060 Make_Function_Call (Loc,
2061 Name => New_Reference_To (Eq_Op, Loc),
2062 Parameter_Associations =>
2063 New_List (OK_Convert_To (T, Lhs),
2064 OK_Convert_To (T, Rhs)));
2068 -- Comparison between Unchecked_Union components
2070 if Is_Unchecked_Union (Full_Type) then
2072 Lhs_Type : Node_Id := Full_Type;
2073 Rhs_Type : Node_Id := Full_Type;
2074 Lhs_Discr_Val : Node_Id;
2075 Rhs_Discr_Val : Node_Id;
2080 if Nkind (Lhs) = N_Selected_Component then
2081 Lhs_Type := Etype (Entity (Selector_Name (Lhs)));
2086 if Nkind (Rhs) = N_Selected_Component then
2087 Rhs_Type := Etype (Entity (Selector_Name (Rhs)));
2090 -- Lhs of the composite equality
2092 if Is_Constrained (Lhs_Type) then
2094 -- Since the enclosing record type can never be an
2095 -- Unchecked_Union (this code is executed for records
2096 -- that do not have variants), we may reference its
2099 if Nkind (Lhs) = N_Selected_Component
2100 and then Has_Per_Object_Constraint (
2101 Entity (Selector_Name (Lhs)))
2104 Make_Selected_Component (Loc,
2105 Prefix => Prefix (Lhs),
2108 Get_Discriminant_Value (
2109 First_Discriminant (Lhs_Type),
2111 Stored_Constraint (Lhs_Type))));
2114 Lhs_Discr_Val := New_Copy (
2115 Get_Discriminant_Value (
2116 First_Discriminant (Lhs_Type),
2118 Stored_Constraint (Lhs_Type)));
2122 -- It is not possible to infer the discriminant since
2123 -- the subtype is not constrained.
2126 Make_Raise_Program_Error (Loc,
2127 Reason => PE_Unchecked_Union_Restriction);
2130 -- Rhs of the composite equality
2132 if Is_Constrained (Rhs_Type) then
2133 if Nkind (Rhs) = N_Selected_Component
2134 and then Has_Per_Object_Constraint (
2135 Entity (Selector_Name (Rhs)))
2138 Make_Selected_Component (Loc,
2139 Prefix => Prefix (Rhs),
2142 Get_Discriminant_Value (
2143 First_Discriminant (Rhs_Type),
2145 Stored_Constraint (Rhs_Type))));
2148 Rhs_Discr_Val := New_Copy (
2149 Get_Discriminant_Value (
2150 First_Discriminant (Rhs_Type),
2152 Stored_Constraint (Rhs_Type)));
2157 Make_Raise_Program_Error (Loc,
2158 Reason => PE_Unchecked_Union_Restriction);
2161 -- Call the TSS equality function with the inferred
2162 -- discriminant values.
2165 Make_Function_Call (Loc,
2166 Name => New_Reference_To (Eq_Op, Loc),
2167 Parameter_Associations => New_List (
2175 -- Shouldn't this be an else, we can't fall through the above
2179 Make_Function_Call (Loc,
2180 Name => New_Reference_To (Eq_Op, Loc),
2181 Parameter_Associations => New_List (Lhs, Rhs));
2185 return Expand_Record_Equality (Nod, Full_Type, Lhs, Rhs, Bodies);
2189 -- It can be a simple record or the full view of a scalar private
2191 return Make_Op_Eq (Loc, Left_Opnd => Lhs, Right_Opnd => Rhs);
2193 end Expand_Composite_Equality;
2195 ------------------------
2196 -- Expand_Concatenate --
2197 ------------------------
2199 procedure Expand_Concatenate (Cnode : Node_Id; Opnds : List_Id) is
2200 Loc : constant Source_Ptr := Sloc (Cnode);
2202 Atyp : constant Entity_Id := Base_Type (Etype (Cnode));
2203 -- Result type of concatenation
2205 Ctyp : constant Entity_Id := Base_Type (Component_Type (Etype (Cnode)));
2206 -- Component type. Elements of this component type can appear as one
2207 -- of the operands of concatenation as well as arrays.
2209 Istyp : constant Entity_Id := Etype (First_Index (Atyp));
2212 Ityp : constant Entity_Id := Base_Type (Istyp);
2213 -- Index type. This is the base type of the index subtype, and is used
2214 -- for all computed bounds (which may be out of range of Istyp in the
2215 -- case of null ranges).
2218 -- This is the type we use to do arithmetic to compute the bounds and
2219 -- lengths of operands. The choice of this type is a little subtle and
2220 -- is discussed in a separate section at the start of the body code.
2222 Concatenation_Error : exception;
2223 -- Raised if concatenation is sure to raise a CE
2225 Result_May_Be_Null : Boolean := True;
2226 -- Reset to False if at least one operand is encountered which is known
2227 -- at compile time to be non-null. Used for handling the special case
2228 -- of setting the high bound to the last operand high bound for a null
2229 -- result, thus ensuring a proper high bound in the super-flat case.
2231 N : constant Nat := List_Length (Opnds);
2232 -- Number of concatenation operands including possibly null operands
2235 -- Number of operands excluding any known to be null, except that the
2236 -- last operand is always retained, in case it provides the bounds for
2240 -- Current operand being processed in the loop through operands. After
2241 -- this loop is complete, always contains the last operand (which is not
2242 -- the same as Operands (NN), since null operands are skipped).
2244 -- Arrays describing the operands, only the first NN entries of each
2245 -- array are set (NN < N when we exclude known null operands).
2247 Is_Fixed_Length : array (1 .. N) of Boolean;
2248 -- True if length of corresponding operand known at compile time
2250 Operands : array (1 .. N) of Node_Id;
2251 -- Set to the corresponding entry in the Opnds list (but note that null
2252 -- operands are excluded, so not all entries in the list are stored).
2254 Fixed_Length : array (1 .. N) of Uint;
2255 -- Set to length of operand. Entries in this array are set only if the
2256 -- corresponding entry in Is_Fixed_Length is True.
2258 Opnd_Low_Bound : array (1 .. N) of Node_Id;
2259 -- Set to lower bound of operand. Either an integer literal in the case
2260 -- where the bound is known at compile time, else actual lower bound.
2261 -- The operand low bound is of type Ityp.
2263 Var_Length : array (1 .. N) of Entity_Id;
2264 -- Set to an entity of type Natural that contains the length of an
2265 -- operand whose length is not known at compile time. Entries in this
2266 -- array are set only if the corresponding entry in Is_Fixed_Length
2267 -- is False. The entity is of type Artyp.
2269 Aggr_Length : array (0 .. N) of Node_Id;
2270 -- The J'th entry in an expression node that represents the total length
2271 -- of operands 1 through J. It is either an integer literal node, or a
2272 -- reference to a constant entity with the right value, so it is fine
2273 -- to just do a Copy_Node to get an appropriate copy. The extra zero'th
2274 -- entry always is set to zero. The length is of type Artyp.
2276 Low_Bound : Node_Id;
2277 -- A tree node representing the low bound of the result (of type Ityp).
2278 -- This is either an integer literal node, or an identifier reference to
2279 -- a constant entity initialized to the appropriate value.
2281 Last_Opnd_High_Bound : Node_Id;
2282 -- A tree node representing the high bound of the last operand. This
2283 -- need only be set if the result could be null. It is used for the
2284 -- special case of setting the right high bound for a null result.
2285 -- This is of type Ityp.
2287 High_Bound : Node_Id;
2288 -- A tree node representing the high bound of the result (of type Ityp)
2291 -- Result of the concatenation (of type Ityp)
2293 Actions : constant List_Id := New_List;
2294 -- Collect actions to be inserted if Save_Space is False
2296 Save_Space : Boolean;
2297 pragma Warnings (Off, Save_Space);
2298 -- Set to True if we are saving generated code space by calling routines
2299 -- in packages System.Concat_n.
2301 Known_Non_Null_Operand_Seen : Boolean;
2302 -- Set True during generation of the assignements of operands into
2303 -- result once an operand known to be non-null has been seen.
2305 function Make_Artyp_Literal (Val : Nat) return Node_Id;
2306 -- This function makes an N_Integer_Literal node that is returned in
2307 -- analyzed form with the type set to Artyp. Importantly this literal
2308 -- is not flagged as static, so that if we do computations with it that
2309 -- result in statically detected out of range conditions, we will not
2310 -- generate error messages but instead warning messages.
2312 function To_Artyp (X : Node_Id) return Node_Id;
2313 -- Given a node of type Ityp, returns the corresponding value of type
2314 -- Artyp. For non-enumeration types, this is a plain integer conversion.
2315 -- For enum types, the Pos of the value is returned.
2317 function To_Ityp (X : Node_Id) return Node_Id;
2318 -- The inverse function (uses Val in the case of enumeration types)
2320 ------------------------
2321 -- Make_Artyp_Literal --
2322 ------------------------
2324 function Make_Artyp_Literal (Val : Nat) return Node_Id is
2325 Result : constant Node_Id := Make_Integer_Literal (Loc, Val);
2327 Set_Etype (Result, Artyp);
2328 Set_Analyzed (Result, True);
2329 Set_Is_Static_Expression (Result, False);
2331 end Make_Artyp_Literal;
2337 function To_Artyp (X : Node_Id) return Node_Id is
2339 if Ityp = Base_Type (Artyp) then
2342 elsif Is_Enumeration_Type (Ityp) then
2344 Make_Attribute_Reference (Loc,
2345 Prefix => New_Occurrence_Of (Ityp, Loc),
2346 Attribute_Name => Name_Pos,
2347 Expressions => New_List (X));
2350 return Convert_To (Artyp, X);
2358 function To_Ityp (X : Node_Id) return Node_Id is
2360 if Is_Enumeration_Type (Ityp) then
2362 Make_Attribute_Reference (Loc,
2363 Prefix => New_Occurrence_Of (Ityp, Loc),
2364 Attribute_Name => Name_Val,
2365 Expressions => New_List (X));
2367 -- Case where we will do a type conversion
2370 if Ityp = Base_Type (Artyp) then
2373 return Convert_To (Ityp, X);
2378 -- Local Declarations
2380 Opnd_Typ : Entity_Id;
2388 -- Choose an appropriate computational type
2390 -- We will be doing calculations of lengths and bounds in this routine
2391 -- and computing one from the other in some cases, e.g. getting the high
2392 -- bound by adding the length-1 to the low bound.
2394 -- We can't just use the index type, or even its base type for this
2395 -- purpose for two reasons. First it might be an enumeration type which
2396 -- is not suitable fo computations of any kind, and second it may simply
2397 -- not have enough range. For example if the index type is -128..+127
2398 -- then lengths can be up to 256, which is out of range of the type.
2400 -- For enumeration types, we can simply use Standard_Integer, this is
2401 -- sufficient since the actual number of enumeration literals cannot
2402 -- possibly exceed the range of integer (remember we will be doing the
2403 -- arithmetic with POS values, not representation values).
2405 if Is_Enumeration_Type (Ityp) then
2406 Artyp := Standard_Integer;
2408 -- If index type is Positive, we use the standard unsigned type, to give
2409 -- more room on the top of the range, obviating the need for an overflow
2410 -- check when creating the upper bound. This is needed to avoid junk
2411 -- overflow checks in the common case of String types.
2413 -- ??? Disabled for now
2415 -- elsif Istyp = Standard_Positive then
2416 -- Artyp := Standard_Unsigned;
2418 -- For modular types, we use a 32-bit modular type for types whose size
2419 -- is in the range 1-31 bits. For 32-bit unsigned types, we use the
2420 -- identity type, and for larger unsigned types we use 64-bits.
2422 elsif Is_Modular_Integer_Type (Ityp) then
2423 if RM_Size (Ityp) < RM_Size (Standard_Unsigned) then
2424 Artyp := Standard_Unsigned;
2425 elsif RM_Size (Ityp) = RM_Size (Standard_Unsigned) then
2428 Artyp := RTE (RE_Long_Long_Unsigned);
2431 -- Similar treatment for signed types
2434 if RM_Size (Ityp) < RM_Size (Standard_Integer) then
2435 Artyp := Standard_Integer;
2436 elsif RM_Size (Ityp) = RM_Size (Standard_Integer) then
2439 Artyp := Standard_Long_Long_Integer;
2443 -- Supply dummy entry at start of length array
2445 Aggr_Length (0) := Make_Artyp_Literal (0);
2447 -- Go through operands setting up the above arrays
2451 Opnd := Remove_Head (Opnds);
2452 Opnd_Typ := Etype (Opnd);
2454 -- The parent got messed up when we put the operands in a list,
2455 -- so now put back the proper parent for the saved operand.
2457 Set_Parent (Opnd, Parent (Cnode));
2459 -- Set will be True when we have setup one entry in the array
2463 -- Singleton element (or character literal) case
2465 if Base_Type (Opnd_Typ) = Ctyp then
2467 Operands (NN) := Opnd;
2468 Is_Fixed_Length (NN) := True;
2469 Fixed_Length (NN) := Uint_1;
2470 Result_May_Be_Null := False;
2472 -- Set low bound of operand (no need to set Last_Opnd_High_Bound
2473 -- since we know that the result cannot be null).
2475 Opnd_Low_Bound (NN) :=
2476 Make_Attribute_Reference (Loc,
2477 Prefix => New_Reference_To (Istyp, Loc),
2478 Attribute_Name => Name_First);
2482 -- String literal case (can only occur for strings of course)
2484 elsif Nkind (Opnd) = N_String_Literal then
2485 Len := String_Literal_Length (Opnd_Typ);
2488 Result_May_Be_Null := False;
2491 -- Capture last operand high bound if result could be null
2493 if J = N and then Result_May_Be_Null then
2494 Last_Opnd_High_Bound :=
2497 New_Copy_Tree (String_Literal_Low_Bound (Opnd_Typ)),
2498 Right_Opnd => Make_Integer_Literal (Loc, 1));
2501 -- Skip null string literal
2503 if J < N and then Len = 0 then
2508 Operands (NN) := Opnd;
2509 Is_Fixed_Length (NN) := True;
2511 -- Set length and bounds
2513 Fixed_Length (NN) := Len;
2515 Opnd_Low_Bound (NN) :=
2516 New_Copy_Tree (String_Literal_Low_Bound (Opnd_Typ));
2523 -- Check constrained case with known bounds
2525 if Is_Constrained (Opnd_Typ) then
2527 Index : constant Node_Id := First_Index (Opnd_Typ);
2528 Indx_Typ : constant Entity_Id := Etype (Index);
2529 Lo : constant Node_Id := Type_Low_Bound (Indx_Typ);
2530 Hi : constant Node_Id := Type_High_Bound (Indx_Typ);
2533 -- Fixed length constrained array type with known at compile
2534 -- time bounds is last case of fixed length operand.
2536 if Compile_Time_Known_Value (Lo)
2538 Compile_Time_Known_Value (Hi)
2541 Loval : constant Uint := Expr_Value (Lo);
2542 Hival : constant Uint := Expr_Value (Hi);
2543 Len : constant Uint :=
2544 UI_Max (Hival - Loval + 1, Uint_0);
2548 Result_May_Be_Null := False;
2551 -- Capture last operand bound if result could be null
2553 if J = N and then Result_May_Be_Null then
2554 Last_Opnd_High_Bound :=
2556 Make_Integer_Literal (Loc,
2557 Intval => Expr_Value (Hi)));
2560 -- Exclude null length case unless last operand
2562 if J < N and then Len = 0 then
2567 Operands (NN) := Opnd;
2568 Is_Fixed_Length (NN) := True;
2569 Fixed_Length (NN) := Len;
2571 Opnd_Low_Bound (NN) := To_Ityp (
2572 Make_Integer_Literal (Loc,
2573 Intval => Expr_Value (Lo)));
2581 -- All cases where the length is not known at compile time, or the
2582 -- special case of an operand which is known to be null but has a
2583 -- lower bound other than 1 or is other than a string type.
2588 -- Capture operand bounds
2590 Opnd_Low_Bound (NN) :=
2591 Make_Attribute_Reference (Loc,
2593 Duplicate_Subexpr (Opnd, Name_Req => True),
2594 Attribute_Name => Name_First);
2596 if J = N and Result_May_Be_Null then
2597 Last_Opnd_High_Bound :=
2599 Make_Attribute_Reference (Loc,
2601 Duplicate_Subexpr (Opnd, Name_Req => True),
2602 Attribute_Name => Name_Last));
2605 -- Capture length of operand in entity
2607 Operands (NN) := Opnd;
2608 Is_Fixed_Length (NN) := False;
2610 Var_Length (NN) := Make_Temporary (Loc, 'L');
2613 Make_Object_Declaration (Loc,
2614 Defining_Identifier => Var_Length (NN),
2615 Constant_Present => True,
2617 Object_Definition =>
2618 New_Occurrence_Of (Artyp, Loc),
2621 Make_Attribute_Reference (Loc,
2623 Duplicate_Subexpr (Opnd, Name_Req => True),
2624 Attribute_Name => Name_Length)));
2628 -- Set next entry in aggregate length array
2630 -- For first entry, make either integer literal for fixed length
2631 -- or a reference to the saved length for variable length.
2634 if Is_Fixed_Length (1) then
2636 Make_Integer_Literal (Loc,
2637 Intval => Fixed_Length (1));
2640 New_Reference_To (Var_Length (1), Loc);
2643 -- If entry is fixed length and only fixed lengths so far, make
2644 -- appropriate new integer literal adding new length.
2646 elsif Is_Fixed_Length (NN)
2647 and then Nkind (Aggr_Length (NN - 1)) = N_Integer_Literal
2650 Make_Integer_Literal (Loc,
2651 Intval => Fixed_Length (NN) + Intval (Aggr_Length (NN - 1)));
2653 -- All other cases, construct an addition node for the length and
2654 -- create an entity initialized to this length.
2657 Ent := Make_Temporary (Loc, 'L');
2659 if Is_Fixed_Length (NN) then
2660 Clen := Make_Integer_Literal (Loc, Fixed_Length (NN));
2662 Clen := New_Reference_To (Var_Length (NN), Loc);
2666 Make_Object_Declaration (Loc,
2667 Defining_Identifier => Ent,
2668 Constant_Present => True,
2670 Object_Definition =>
2671 New_Occurrence_Of (Artyp, Loc),
2675 Left_Opnd => New_Copy (Aggr_Length (NN - 1)),
2676 Right_Opnd => Clen)));
2678 Aggr_Length (NN) := Make_Identifier (Loc, Chars => Chars (Ent));
2685 -- If we have only skipped null operands, return the last operand
2692 -- If we have only one non-null operand, return it and we are done.
2693 -- There is one case in which this cannot be done, and that is when
2694 -- the sole operand is of the element type, in which case it must be
2695 -- converted to an array, and the easiest way of doing that is to go
2696 -- through the normal general circuit.
2699 and then Base_Type (Etype (Operands (1))) /= Ctyp
2701 Result := Operands (1);
2705 -- Cases where we have a real concatenation
2707 -- Next step is to find the low bound for the result array that we
2708 -- will allocate. The rules for this are in (RM 4.5.6(5-7)).
2710 -- If the ultimate ancestor of the index subtype is a constrained array
2711 -- definition, then the lower bound is that of the index subtype as
2712 -- specified by (RM 4.5.3(6)).
2714 -- The right test here is to go to the root type, and then the ultimate
2715 -- ancestor is the first subtype of this root type.
2717 if Is_Constrained (First_Subtype (Root_Type (Atyp))) then
2719 Make_Attribute_Reference (Loc,
2721 New_Occurrence_Of (First_Subtype (Root_Type (Atyp)), Loc),
2722 Attribute_Name => Name_First);
2724 -- If the first operand in the list has known length we know that
2725 -- the lower bound of the result is the lower bound of this operand.
2727 elsif Is_Fixed_Length (1) then
2728 Low_Bound := Opnd_Low_Bound (1);
2730 -- OK, we don't know the lower bound, we have to build a horrible
2731 -- expression actions node of the form
2733 -- if Cond1'Length /= 0 then
2736 -- if Opnd2'Length /= 0 then
2741 -- The nesting ends either when we hit an operand whose length is known
2742 -- at compile time, or on reaching the last operand, whose low bound we
2743 -- take unconditionally whether or not it is null. It's easiest to do
2744 -- this with a recursive procedure:
2748 function Get_Known_Bound (J : Nat) return Node_Id;
2749 -- Returns the lower bound determined by operands J .. NN
2751 ---------------------
2752 -- Get_Known_Bound --
2753 ---------------------
2755 function Get_Known_Bound (J : Nat) return Node_Id is
2757 if Is_Fixed_Length (J) or else J = NN then
2758 return New_Copy (Opnd_Low_Bound (J));
2762 Make_Conditional_Expression (Loc,
2763 Expressions => New_List (
2766 Left_Opnd => New_Reference_To (Var_Length (J), Loc),
2767 Right_Opnd => Make_Integer_Literal (Loc, 0)),
2769 New_Copy (Opnd_Low_Bound (J)),
2770 Get_Known_Bound (J + 1)));
2772 end Get_Known_Bound;
2775 Ent := Make_Temporary (Loc, 'L');
2778 Make_Object_Declaration (Loc,
2779 Defining_Identifier => Ent,
2780 Constant_Present => True,
2781 Object_Definition => New_Occurrence_Of (Ityp, Loc),
2782 Expression => Get_Known_Bound (1)));
2784 Low_Bound := New_Reference_To (Ent, Loc);
2788 -- Now we can safely compute the upper bound, normally
2789 -- Low_Bound + Length - 1.
2794 Left_Opnd => To_Artyp (New_Copy (Low_Bound)),
2796 Make_Op_Subtract (Loc,
2797 Left_Opnd => New_Copy (Aggr_Length (NN)),
2798 Right_Opnd => Make_Artyp_Literal (1))));
2800 -- Note that calculation of the high bound may cause overflow in some
2801 -- very weird cases, so in the general case we need an overflow check on
2802 -- the high bound. We can avoid this for the common case of string types
2803 -- and other types whose index is Positive, since we chose a wider range
2804 -- for the arithmetic type.
2806 if Istyp /= Standard_Positive then
2807 Activate_Overflow_Check (High_Bound);
2810 -- Handle the exceptional case where the result is null, in which case
2811 -- case the bounds come from the last operand (so that we get the proper
2812 -- bounds if the last operand is super-flat).
2814 if Result_May_Be_Null then
2816 Make_Conditional_Expression (Loc,
2817 Expressions => New_List (
2819 Left_Opnd => New_Copy (Aggr_Length (NN)),
2820 Right_Opnd => Make_Artyp_Literal (0)),
2821 Last_Opnd_High_Bound,
2825 -- Here is where we insert the saved up actions
2827 Insert_Actions (Cnode, Actions, Suppress => All_Checks);
2829 -- Now we construct an array object with appropriate bounds. We mark
2830 -- the target as internal to prevent useless initialization when
2831 -- Initialize_Scalars is enabled.
2833 Ent := Make_Temporary (Loc, 'S');
2834 Set_Is_Internal (Ent);
2836 -- If the bound is statically known to be out of range, we do not want
2837 -- to abort, we want a warning and a runtime constraint error. Note that
2838 -- we have arranged that the result will not be treated as a static
2839 -- constant, so we won't get an illegality during this insertion.
2841 Insert_Action (Cnode,
2842 Make_Object_Declaration (Loc,
2843 Defining_Identifier => Ent,
2844 Object_Definition =>
2845 Make_Subtype_Indication (Loc,
2846 Subtype_Mark => New_Occurrence_Of (Atyp, Loc),
2848 Make_Index_Or_Discriminant_Constraint (Loc,
2849 Constraints => New_List (
2851 Low_Bound => Low_Bound,
2852 High_Bound => High_Bound))))),
2853 Suppress => All_Checks);
2855 -- If the result of the concatenation appears as the initializing
2856 -- expression of an object declaration, we can just rename the
2857 -- result, rather than copying it.
2859 Set_OK_To_Rename (Ent);
2861 -- Catch the static out of range case now
2863 if Raises_Constraint_Error (High_Bound) then
2864 raise Concatenation_Error;
2867 -- Now we will generate the assignments to do the actual concatenation
2869 -- There is one case in which we will not do this, namely when all the
2870 -- following conditions are met:
2872 -- The result type is Standard.String
2874 -- There are nine or fewer retained (non-null) operands
2876 -- The optimization level is -O0
2878 -- The corresponding System.Concat_n.Str_Concat_n routine is
2879 -- available in the run time.
2881 -- The debug flag gnatd.c is not set
2883 -- If all these conditions are met then we generate a call to the
2884 -- relevant concatenation routine. The purpose of this is to avoid
2885 -- undesirable code bloat at -O0.
2887 if Atyp = Standard_String
2888 and then NN in 2 .. 9
2889 and then (Opt.Optimization_Level = 0 or else Debug_Flag_Dot_CC)
2890 and then not Debug_Flag_Dot_C
2893 RR : constant array (Nat range 2 .. 9) of RE_Id :=
2904 if RTE_Available (RR (NN)) then
2906 Opnds : constant List_Id :=
2907 New_List (New_Occurrence_Of (Ent, Loc));
2910 for J in 1 .. NN loop
2911 if Is_List_Member (Operands (J)) then
2912 Remove (Operands (J));
2915 if Base_Type (Etype (Operands (J))) = Ctyp then
2917 Make_Aggregate (Loc,
2918 Component_Associations => New_List (
2919 Make_Component_Association (Loc,
2920 Choices => New_List (
2921 Make_Integer_Literal (Loc, 1)),
2922 Expression => Operands (J)))));
2925 Append_To (Opnds, Operands (J));
2929 Insert_Action (Cnode,
2930 Make_Procedure_Call_Statement (Loc,
2931 Name => New_Reference_To (RTE (RR (NN)), Loc),
2932 Parameter_Associations => Opnds));
2934 Result := New_Reference_To (Ent, Loc);
2941 -- Not special case so generate the assignments
2943 Known_Non_Null_Operand_Seen := False;
2945 for J in 1 .. NN loop
2947 Lo : constant Node_Id :=
2949 Left_Opnd => To_Artyp (New_Copy (Low_Bound)),
2950 Right_Opnd => Aggr_Length (J - 1));
2952 Hi : constant Node_Id :=
2954 Left_Opnd => To_Artyp (New_Copy (Low_Bound)),
2956 Make_Op_Subtract (Loc,
2957 Left_Opnd => Aggr_Length (J),
2958 Right_Opnd => Make_Artyp_Literal (1)));
2961 -- Singleton case, simple assignment
2963 if Base_Type (Etype (Operands (J))) = Ctyp then
2964 Known_Non_Null_Operand_Seen := True;
2965 Insert_Action (Cnode,
2966 Make_Assignment_Statement (Loc,
2968 Make_Indexed_Component (Loc,
2969 Prefix => New_Occurrence_Of (Ent, Loc),
2970 Expressions => New_List (To_Ityp (Lo))),
2971 Expression => Operands (J)),
2972 Suppress => All_Checks);
2974 -- Array case, slice assignment, skipped when argument is fixed
2975 -- length and known to be null.
2977 elsif (not Is_Fixed_Length (J)) or else (Fixed_Length (J) > 0) then
2980 Make_Assignment_Statement (Loc,
2984 New_Occurrence_Of (Ent, Loc),
2987 Low_Bound => To_Ityp (Lo),
2988 High_Bound => To_Ityp (Hi))),
2989 Expression => Operands (J));
2991 if Is_Fixed_Length (J) then
2992 Known_Non_Null_Operand_Seen := True;
2994 elsif not Known_Non_Null_Operand_Seen then
2996 -- Here if operand length is not statically known and no
2997 -- operand known to be non-null has been processed yet.
2998 -- If operand length is 0, we do not need to perform the
2999 -- assignment, and we must avoid the evaluation of the
3000 -- high bound of the slice, since it may underflow if the
3001 -- low bound is Ityp'First.
3004 Make_Implicit_If_Statement (Cnode,
3008 New_Occurrence_Of (Var_Length (J), Loc),
3009 Right_Opnd => Make_Integer_Literal (Loc, 0)),
3014 Insert_Action (Cnode, Assign, Suppress => All_Checks);
3020 -- Finally we build the result, which is a reference to the array object
3022 Result := New_Reference_To (Ent, Loc);
3025 Rewrite (Cnode, Result);
3026 Analyze_And_Resolve (Cnode, Atyp);
3029 when Concatenation_Error =>
3031 -- Kill warning generated for the declaration of the static out of
3032 -- range high bound, and instead generate a Constraint_Error with
3033 -- an appropriate specific message.
3035 Kill_Dead_Code (Declaration_Node (Entity (High_Bound)));
3036 Apply_Compile_Time_Constraint_Error
3038 Msg => "concatenation result upper bound out of range?",
3039 Reason => CE_Range_Check_Failed);
3040 -- Set_Etype (Cnode, Atyp);
3041 end Expand_Concatenate;
3043 ------------------------
3044 -- Expand_N_Allocator --
3045 ------------------------
3047 procedure Expand_N_Allocator (N : Node_Id) is
3048 PtrT : constant Entity_Id := Etype (N);
3049 Dtyp : constant Entity_Id := Available_View (Designated_Type (PtrT));
3050 Etyp : constant Entity_Id := Etype (Expression (N));
3051 Loc : constant Source_Ptr := Sloc (N);
3056 procedure Complete_Coextension_Finalization;
3057 -- Generate finalization calls for all nested coextensions of N. This
3058 -- routine may allocate list controllers if necessary.
3060 procedure Rewrite_Coextension (N : Node_Id);
3061 -- Static coextensions have the same lifetime as the entity they
3062 -- constrain. Such occurrences can be rewritten as aliased objects
3063 -- and their unrestricted access used instead of the coextension.
3065 function Size_In_Storage_Elements (E : Entity_Id) return Node_Id;
3066 -- Given a constrained array type E, returns a node representing the
3067 -- code to compute the size in storage elements for the given type.
3068 -- This is done without using the attribute (which malfunctions for
3071 ---------------------------------------
3072 -- Complete_Coextension_Finalization --
3073 ---------------------------------------
3075 procedure Complete_Coextension_Finalization is
3077 Coext_Elmt : Elmt_Id;
3081 function Inside_A_Return_Statement (N : Node_Id) return Boolean;
3082 -- Determine whether node N is part of a return statement
3084 function Needs_Initialization_Call (N : Node_Id) return Boolean;
3085 -- Determine whether node N is a subtype indicator allocator which
3086 -- acts a coextension. Such coextensions need initialization.
3088 -------------------------------
3089 -- Inside_A_Return_Statement --
3090 -------------------------------
3092 function Inside_A_Return_Statement (N : Node_Id) return Boolean is
3097 while Present (P) loop
3099 (P, N_Extended_Return_Statement, N_Simple_Return_Statement)
3103 -- Stop the traversal when we reach a subprogram body
3105 elsif Nkind (P) = N_Subprogram_Body then
3113 end Inside_A_Return_Statement;
3115 -------------------------------
3116 -- Needs_Initialization_Call --
3117 -------------------------------
3119 function Needs_Initialization_Call (N : Node_Id) return Boolean is
3123 if Nkind (N) = N_Explicit_Dereference
3124 and then Nkind (Prefix (N)) = N_Identifier
3125 and then Nkind (Parent (Entity (Prefix (N)))) =
3126 N_Object_Declaration
3128 Obj_Decl := Parent (Entity (Prefix (N)));
3131 Present (Expression (Obj_Decl))
3132 and then Nkind (Expression (Obj_Decl)) = N_Allocator
3133 and then Nkind (Expression (Expression (Obj_Decl))) /=
3134 N_Qualified_Expression;
3138 end Needs_Initialization_Call;
3140 -- Start of processing for Complete_Coextension_Finalization
3143 -- When a coextension root is inside a return statement, we need to
3144 -- use the finalization chain of the function's scope. This does not
3145 -- apply for controlled named access types because in those cases we
3146 -- can use the finalization chain of the type itself.
3148 if Inside_A_Return_Statement (N)
3150 (Ekind (PtrT) = E_Anonymous_Access_Type
3152 (Ekind (PtrT) = E_Access_Type
3153 and then No (Associated_Final_Chain (PtrT))))
3157 Outer_S : Entity_Id;
3158 S : Entity_Id := Current_Scope;
3161 while Present (S) and then S /= Standard_Standard loop
3162 if Ekind (S) = E_Function then
3163 Outer_S := Scope (S);
3165 -- Retrieve the declaration of the body
3170 (Corresponding_Body (Parent (Parent (S)))));
3177 -- Push the scope of the function body since we are inserting
3178 -- the list before the body, but we are currently in the body
3179 -- itself. Override the finalization list of PtrT since the
3180 -- finalization context is now different.
3182 Push_Scope (Outer_S);
3183 Build_Final_List (Decl, PtrT);
3187 -- The root allocator may not be controlled, but it still needs a
3188 -- finalization list for all nested coextensions.
3190 elsif No (Associated_Final_Chain (PtrT)) then
3191 Build_Final_List (N, PtrT);
3195 Make_Selected_Component (Loc,
3197 New_Reference_To (Associated_Final_Chain (PtrT), Loc),
3199 Make_Identifier (Loc, Name_F));
3201 Coext_Elmt := First_Elmt (Coextensions (N));
3202 while Present (Coext_Elmt) loop
3203 Coext := Node (Coext_Elmt);
3208 if Nkind (Coext) = N_Identifier then
3210 Make_Unchecked_Type_Conversion (Loc,
3211 Subtype_Mark => New_Reference_To (Etype (Coext), Loc),
3213 Make_Explicit_Dereference (Loc,
3214 Prefix => New_Copy_Tree (Coext)));
3216 Ref := New_Copy_Tree (Coext);
3219 -- No initialization call if not allowed
3221 Check_Restriction (No_Default_Initialization, N);
3223 if not Restriction_Active (No_Default_Initialization) then
3227 -- attach_to_final_list (Ref, Flist, 2)
3229 if Needs_Initialization_Call (Coext) then
3233 Typ => Etype (Coext),
3235 With_Attach => Make_Integer_Literal (Loc, Uint_2)));
3238 -- attach_to_final_list (Ref, Flist, 2)
3244 Flist_Ref => New_Copy_Tree (Flist),
3245 With_Attach => Make_Integer_Literal (Loc, Uint_2)));
3249 Next_Elmt (Coext_Elmt);
3251 end Complete_Coextension_Finalization;
3253 -------------------------
3254 -- Rewrite_Coextension --
3255 -------------------------
3257 procedure Rewrite_Coextension (N : Node_Id) is
3258 Temp : constant Node_Id := Make_Temporary (Loc, 'C');
3261 -- Cnn : aliased Etyp;
3263 Decl : constant Node_Id :=
3264 Make_Object_Declaration (Loc,
3265 Defining_Identifier => Temp,
3266 Aliased_Present => True,
3267 Object_Definition =>
3268 New_Occurrence_Of (Etyp, Loc));
3272 if Nkind (Expression (N)) = N_Qualified_Expression then
3273 Set_Expression (Decl, Expression (Expression (N)));
3276 -- Find the proper insertion node for the declaration
3279 while Present (Nod) loop
3280 exit when Nkind (Nod) in N_Statement_Other_Than_Procedure_Call
3281 or else Nkind (Nod) = N_Procedure_Call_Statement
3282 or else Nkind (Nod) in N_Declaration;
3283 Nod := Parent (Nod);
3286 Insert_Before (Nod, Decl);
3290 Make_Attribute_Reference (Loc,
3291 Prefix => New_Occurrence_Of (Temp, Loc),
3292 Attribute_Name => Name_Unrestricted_Access));
3294 Analyze_And_Resolve (N, PtrT);
3295 end Rewrite_Coextension;
3297 ------------------------------
3298 -- Size_In_Storage_Elements --
3299 ------------------------------
3301 function Size_In_Storage_Elements (E : Entity_Id) return Node_Id is
3303 -- Logically this just returns E'Max_Size_In_Storage_Elements.
3304 -- However, the reason for the existence of this function is
3305 -- to construct a test for sizes too large, which means near the
3306 -- 32-bit limit on a 32-bit machine, and precisely the trouble
3307 -- is that we get overflows when sizes are greater than 2**31.
3309 -- So what we end up doing for array types is to use the expression:
3311 -- number-of-elements * component_type'Max_Size_In_Storage_Elements
3313 -- which avoids this problem. All this is a big bogus, but it does
3314 -- mean we catch common cases of trying to allocate arrays that
3315 -- are too large, and which in the absence of a check results in
3316 -- undetected chaos ???
3323 for J in 1 .. Number_Dimensions (E) loop
3325 Make_Attribute_Reference (Loc,
3326 Prefix => New_Occurrence_Of (E, Loc),
3327 Attribute_Name => Name_Length,
3328 Expressions => New_List (
3329 Make_Integer_Literal (Loc, J)));
3336 Make_Op_Multiply (Loc,
3343 Make_Op_Multiply (Loc,
3346 Make_Attribute_Reference (Loc,
3347 Prefix => New_Occurrence_Of (Component_Type (E), Loc),
3348 Attribute_Name => Name_Max_Size_In_Storage_Elements));
3350 end Size_In_Storage_Elements;
3352 -- Start of processing for Expand_N_Allocator
3355 -- RM E.2.3(22). We enforce that the expected type of an allocator
3356 -- shall not be a remote access-to-class-wide-limited-private type
3358 -- Why is this being done at expansion time, seems clearly wrong ???
3360 Validate_Remote_Access_To_Class_Wide_Type (N);
3362 -- Set the Storage Pool
3364 Set_Storage_Pool (N, Associated_Storage_Pool (Root_Type (PtrT)));
3366 if Present (Storage_Pool (N)) then
3367 if Is_RTE (Storage_Pool (N), RE_SS_Pool) then
3368 if VM_Target = No_VM then
3369 Set_Procedure_To_Call (N, RTE (RE_SS_Allocate));
3372 elsif Is_Class_Wide_Type (Etype (Storage_Pool (N))) then
3373 Set_Procedure_To_Call (N, RTE (RE_Allocate_Any));
3376 Set_Procedure_To_Call (N,
3377 Find_Prim_Op (Etype (Storage_Pool (N)), Name_Allocate));
3381 -- Under certain circumstances we can replace an allocator by an access
3382 -- to statically allocated storage. The conditions, as noted in AARM
3383 -- 3.10 (10c) are as follows:
3385 -- Size and initial value is known at compile time
3386 -- Access type is access-to-constant
3388 -- The allocator is not part of a constraint on a record component,
3389 -- because in that case the inserted actions are delayed until the
3390 -- record declaration is fully analyzed, which is too late for the
3391 -- analysis of the rewritten allocator.
3393 if Is_Access_Constant (PtrT)
3394 and then Nkind (Expression (N)) = N_Qualified_Expression
3395 and then Compile_Time_Known_Value (Expression (Expression (N)))
3396 and then Size_Known_At_Compile_Time (Etype (Expression
3398 and then not Is_Record_Type (Current_Scope)
3400 -- Here we can do the optimization. For the allocator
3404 -- We insert an object declaration
3406 -- Tnn : aliased x := y;
3408 -- and replace the allocator by Tnn'Unrestricted_Access. Tnn is
3409 -- marked as requiring static allocation.
3411 Temp := Make_Temporary (Loc, 'T', Expression (Expression (N)));
3412 Desig := Subtype_Mark (Expression (N));
3414 -- If context is constrained, use constrained subtype directly,
3415 -- so that the constant is not labelled as having a nominally
3416 -- unconstrained subtype.
3418 if Entity (Desig) = Base_Type (Dtyp) then
3419 Desig := New_Occurrence_Of (Dtyp, Loc);
3423 Make_Object_Declaration (Loc,
3424 Defining_Identifier => Temp,
3425 Aliased_Present => True,
3426 Constant_Present => Is_Access_Constant (PtrT),
3427 Object_Definition => Desig,
3428 Expression => Expression (Expression (N))));
3431 Make_Attribute_Reference (Loc,
3432 Prefix => New_Occurrence_Of (Temp, Loc),
3433 Attribute_Name => Name_Unrestricted_Access));
3435 Analyze_And_Resolve (N, PtrT);
3437 -- We set the variable as statically allocated, since we don't want
3438 -- it going on the stack of the current procedure!
3440 Set_Is_Statically_Allocated (Temp);
3444 -- Same if the allocator is an access discriminant for a local object:
3445 -- instead of an allocator we create a local value and constrain the
3446 -- the enclosing object with the corresponding access attribute.
3448 if Is_Static_Coextension (N) then
3449 Rewrite_Coextension (N);
3453 -- The current allocator creates an object which may contain nested
3454 -- coextensions. Use the current allocator's finalization list to
3455 -- generate finalization call for all nested coextensions.
3457 if Is_Coextension_Root (N) then
3458 Complete_Coextension_Finalization;
3461 -- Check for size too large, we do this because the back end misses
3462 -- proper checks here and can generate rubbish allocation calls when
3463 -- we are near the limit. We only do this for the 32-bit address case
3464 -- since that is from a practical point of view where we see a problem.
3466 if System_Address_Size = 32
3467 and then not Storage_Checks_Suppressed (PtrT)
3468 and then not Storage_Checks_Suppressed (Dtyp)
3469 and then not Storage_Checks_Suppressed (Etyp)
3471 -- The check we want to generate should look like
3473 -- if Etyp'Max_Size_In_Storage_Elements > 3.5 gigabytes then
3474 -- raise Storage_Error;
3477 -- where 3.5 gigabytes is a constant large enough to accomodate any
3478 -- reasonable request for. But we can't do it this way because at
3479 -- least at the moment we don't compute this attribute right, and
3480 -- can silently give wrong results when the result gets large. Since
3481 -- this is all about large results, that's bad, so instead we only
3482 -- apply the check for constrained arrays, and manually compute the
3483 -- value of the attribute ???
3485 if Is_Array_Type (Etyp) and then Is_Constrained (Etyp) then
3487 Make_Raise_Storage_Error (Loc,
3490 Left_Opnd => Size_In_Storage_Elements (Etyp),
3492 Make_Integer_Literal (Loc,
3493 Intval => Uint_7 * (Uint_2 ** 29))),
3494 Reason => SE_Object_Too_Large));
3498 -- Handle case of qualified expression (other than optimization above)
3499 -- First apply constraint checks, because the bounds or discriminants
3500 -- in the aggregate might not match the subtype mark in the allocator.
3502 if Nkind (Expression (N)) = N_Qualified_Expression then
3503 Apply_Constraint_Check
3504 (Expression (Expression (N)), Etype (Expression (N)));
3506 Expand_Allocator_Expression (N);
3510 -- If the allocator is for a type which requires initialization, and
3511 -- there is no initial value (i.e. operand is a subtype indication
3512 -- rather than a qualified expression), then we must generate a call to
3513 -- the initialization routine using an expressions action node:
3515 -- [Pnnn : constant ptr_T := new (T); Init (Pnnn.all,...); Pnnn]
3517 -- Here ptr_T is the pointer type for the allocator, and T is the
3518 -- subtype of the allocator. A special case arises if the designated
3519 -- type of the access type is a task or contains tasks. In this case
3520 -- the call to Init (Temp.all ...) is replaced by code that ensures
3521 -- that tasks get activated (see Exp_Ch9.Build_Task_Allocate_Block
3522 -- for details). In addition, if the type T is a task T, then the
3523 -- first argument to Init must be converted to the task record type.
3526 T : constant Entity_Id := Entity (Expression (N));
3534 Temp_Decl : Node_Id;
3535 Temp_Type : Entity_Id;
3536 Attach_Level : Uint;
3539 if No_Initialization (N) then
3542 -- Case of no initialization procedure present
3544 elsif not Has_Non_Null_Base_Init_Proc (T) then
3546 -- Case of simple initialization required
3548 if Needs_Simple_Initialization (T) then
3549 Check_Restriction (No_Default_Initialization, N);
3550 Rewrite (Expression (N),
3551 Make_Qualified_Expression (Loc,
3552 Subtype_Mark => New_Occurrence_Of (T, Loc),
3553 Expression => Get_Simple_Init_Val (T, N)));
3555 Analyze_And_Resolve (Expression (Expression (N)), T);
3556 Analyze_And_Resolve (Expression (N), T);
3557 Set_Paren_Count (Expression (Expression (N)), 1);
3558 Expand_N_Allocator (N);
3560 -- No initialization required
3566 -- Case of initialization procedure present, must be called
3569 Check_Restriction (No_Default_Initialization, N);
3571 if not Restriction_Active (No_Default_Initialization) then
3572 Init := Base_Init_Proc (T);
3574 Temp := Make_Temporary (Loc, 'P');
3576 -- Construct argument list for the initialization routine call
3579 Make_Explicit_Dereference (Loc,
3580 Prefix => New_Reference_To (Temp, Loc));
3581 Set_Assignment_OK (Arg1);
3584 -- The initialization procedure expects a specific type. if the
3585 -- context is access to class wide, indicate that the object
3586 -- being allocated has the right specific type.
3588 if Is_Class_Wide_Type (Dtyp) then
3589 Arg1 := Unchecked_Convert_To (T, Arg1);
3592 -- If designated type is a concurrent type or if it is private
3593 -- type whose definition is a concurrent type, the first
3594 -- argument in the Init routine has to be unchecked conversion
3595 -- to the corresponding record type. If the designated type is
3596 -- a derived type, we also convert the argument to its root
3599 if Is_Concurrent_Type (T) then
3601 Unchecked_Convert_To (Corresponding_Record_Type (T), Arg1);
3603 elsif Is_Private_Type (T)
3604 and then Present (Full_View (T))
3605 and then Is_Concurrent_Type (Full_View (T))
3608 Unchecked_Convert_To
3609 (Corresponding_Record_Type (Full_View (T)), Arg1);
3611 elsif Etype (First_Formal (Init)) /= Base_Type (T) then
3613 Ftyp : constant Entity_Id := Etype (First_Formal (Init));
3615 Arg1 := OK_Convert_To (Etype (Ftyp), Arg1);
3616 Set_Etype (Arg1, Ftyp);
3620 Args := New_List (Arg1);
3622 -- For the task case, pass the Master_Id of the access type as
3623 -- the value of the _Master parameter, and _Chain as the value
3624 -- of the _Chain parameter (_Chain will be defined as part of
3625 -- the generated code for the allocator).
3627 -- In Ada 2005, the context may be a function that returns an
3628 -- anonymous access type. In that case the Master_Id has been
3629 -- created when expanding the function declaration.
3631 if Has_Task (T) then
3632 if No (Master_Id (Base_Type (PtrT))) then
3634 -- If we have a non-library level task with restriction
3635 -- No_Task_Hierarchy set, then no point in expanding.
3637 if not Is_Library_Level_Entity (T)
3638 and then Restriction_Active (No_Task_Hierarchy)
3643 -- The designated type was an incomplete type, and the
3644 -- access type did not get expanded. Salvage it now.
3646 pragma Assert (Present (Parent (Base_Type (PtrT))));
3647 Expand_N_Full_Type_Declaration
3648 (Parent (Base_Type (PtrT)));
3651 -- If the context of the allocator is a declaration or an
3652 -- assignment, we can generate a meaningful image for it,
3653 -- even though subsequent assignments might remove the
3654 -- connection between task and entity. We build this image
3655 -- when the left-hand side is a simple variable, a simple
3656 -- indexed assignment or a simple selected component.
3658 if Nkind (Parent (N)) = N_Assignment_Statement then
3660 Nam : constant Node_Id := Name (Parent (N));
3663 if Is_Entity_Name (Nam) then
3665 Build_Task_Image_Decls
3668 (Entity (Nam), Sloc (Nam)), T);
3671 (Nam, N_Indexed_Component, N_Selected_Component)
3672 and then Is_Entity_Name (Prefix (Nam))
3675 Build_Task_Image_Decls
3676 (Loc, Nam, Etype (Prefix (Nam)));
3678 Decls := Build_Task_Image_Decls (Loc, T, T);
3682 elsif Nkind (Parent (N)) = N_Object_Declaration then
3684 Build_Task_Image_Decls
3685 (Loc, Defining_Identifier (Parent (N)), T);
3688 Decls := Build_Task_Image_Decls (Loc, T, T);
3693 (Master_Id (Base_Type (Root_Type (PtrT))), Loc));
3694 Append_To (Args, Make_Identifier (Loc, Name_uChain));
3696 Decl := Last (Decls);
3698 New_Occurrence_Of (Defining_Identifier (Decl), Loc));
3700 -- Has_Task is false, Decls not used
3706 -- Add discriminants if discriminated type
3709 Dis : Boolean := False;
3713 if Has_Discriminants (T) then
3717 elsif Is_Private_Type (T)
3718 and then Present (Full_View (T))
3719 and then Has_Discriminants (Full_View (T))
3722 Typ := Full_View (T);
3727 -- If the allocated object will be constrained by the
3728 -- default values for discriminants, then build a subtype
3729 -- with those defaults, and change the allocated subtype
3730 -- to that. Note that this happens in fewer cases in Ada
3733 if not Is_Constrained (Typ)
3734 and then Present (Discriminant_Default_Value
3735 (First_Discriminant (Typ)))
3736 and then (Ada_Version < Ada_05
3738 not Has_Constrained_Partial_View (Typ))
3740 Typ := Build_Default_Subtype (Typ, N);
3741 Set_Expression (N, New_Reference_To (Typ, Loc));
3744 Discr := First_Elmt (Discriminant_Constraint (Typ));
3745 while Present (Discr) loop
3746 Nod := Node (Discr);
3747 Append (New_Copy_Tree (Node (Discr)), Args);
3749 -- AI-416: when the discriminant constraint is an
3750 -- anonymous access type make sure an accessibility
3751 -- check is inserted if necessary (3.10.2(22.q/2))
3753 if Ada_Version >= Ada_05
3755 Ekind (Etype (Nod)) = E_Anonymous_Access_Type
3757 Apply_Accessibility_Check
3758 (Nod, Typ, Insert_Node => Nod);
3766 -- We set the allocator as analyzed so that when we analyze the
3767 -- expression actions node, we do not get an unwanted recursive
3768 -- expansion of the allocator expression.
3770 Set_Analyzed (N, True);
3771 Nod := Relocate_Node (N);
3773 -- Here is the transformation:
3775 -- output: Temp : constant ptr_T := new T;
3776 -- Init (Temp.all, ...);
3777 -- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
3778 -- <CTRL> Initialize (Finalizable (Temp.all));
3780 -- Here ptr_T is the pointer type for the allocator, and is the
3781 -- subtype of the allocator.
3784 Make_Object_Declaration (Loc,
3785 Defining_Identifier => Temp,
3786 Constant_Present => True,
3787 Object_Definition => New_Reference_To (Temp_Type, Loc),
3790 Set_Assignment_OK (Temp_Decl);
3791 Insert_Action (N, Temp_Decl, Suppress => All_Checks);
3793 -- If the designated type is a task type or contains tasks,
3794 -- create block to activate created tasks, and insert
3795 -- declaration for Task_Image variable ahead of call.
3797 if Has_Task (T) then
3799 L : constant List_Id := New_List;
3802 Build_Task_Allocate_Block (L, Nod, Args);
3804 Insert_List_Before (First (Declarations (Blk)), Decls);
3805 Insert_Actions (N, L);
3810 Make_Procedure_Call_Statement (Loc,
3811 Name => New_Reference_To (Init, Loc),
3812 Parameter_Associations => Args));
3815 if Needs_Finalization (T) then
3817 -- Postpone the generation of a finalization call for the
3818 -- current allocator if it acts as a coextension.
3820 if Is_Dynamic_Coextension (N) then
3821 if No (Coextensions (N)) then
3822 Set_Coextensions (N, New_Elmt_List);
3825 Append_Elmt (New_Copy_Tree (Arg1), Coextensions (N));
3829 Get_Allocator_Final_List (N, Base_Type (T), PtrT);
3831 -- Anonymous access types created for access parameters
3832 -- are attached to an explicitly constructed controller,
3833 -- which ensures that they can be finalized properly,
3834 -- even if their deallocation might not happen. The list
3835 -- associated with the controller is doubly-linked. For
3836 -- other anonymous access types, the object may end up
3837 -- on the global final list which is singly-linked.
3838 -- Work needed for access discriminants in Ada 2005 ???
3840 if Ekind (PtrT) = E_Anonymous_Access_Type then
3841 Attach_Level := Uint_1;
3843 Attach_Level := Uint_2;
3848 Ref => New_Copy_Tree (Arg1),
3851 With_Attach => Make_Integer_Literal (Loc,
3852 Intval => Attach_Level)));
3856 Rewrite (N, New_Reference_To (Temp, Loc));
3857 Analyze_And_Resolve (N, PtrT);
3862 -- Ada 2005 (AI-251): If the allocator is for a class-wide interface
3863 -- object that has been rewritten as a reference, we displace "this"
3864 -- to reference properly its secondary dispatch table.
3866 if Nkind (N) = N_Identifier
3867 and then Is_Interface (Dtyp)
3869 Displace_Allocator_Pointer (N);
3873 when RE_Not_Available =>
3875 end Expand_N_Allocator;
3877 -----------------------
3878 -- Expand_N_And_Then --
3879 -----------------------
3881 procedure Expand_N_And_Then (N : Node_Id)
3882 renames Expand_Short_Circuit_Operator;
3884 ------------------------------
3885 -- Expand_N_Case_Expression --
3886 ------------------------------
3888 procedure Expand_N_Case_Expression (N : Node_Id) is
3889 Loc : constant Source_Ptr := Sloc (N);
3890 Typ : constant Entity_Id := Etype (N);
3902 -- case X is when A => AX, when B => BX ...
3917 -- However, this expansion is wrong for limited types, and also
3918 -- wrong for unconstrained types (since the bounds may not be the
3919 -- same in all branches). Furthermore it involves an extra copy
3920 -- for large objects. So we take care of this by using the following
3921 -- modified expansion for non-scalar types:
3924 -- type Pnn is access all typ;
3928 -- T := AX'Unrestricted_Access;
3930 -- T := BX'Unrestricted_Access;
3936 Make_Case_Statement (Loc,
3937 Expression => Expression (N),
3938 Alternatives => New_List);
3940 Actions := New_List;
3944 if Is_Scalar_Type (Typ) then
3948 Pnn := Make_Temporary (Loc, 'P');
3950 Make_Full_Type_Declaration (Loc,
3951 Defining_Identifier => Pnn,
3953 Make_Access_To_Object_Definition (Loc,
3954 All_Present => True,
3955 Subtype_Indication =>
3956 New_Reference_To (Typ, Loc))));
3960 Tnn := Make_Temporary (Loc, 'T');
3962 Make_Object_Declaration (Loc,
3963 Defining_Identifier => Tnn,
3964 Object_Definition => New_Occurrence_Of (Ttyp, Loc)));
3966 -- Now process the alternatives
3968 Alt := First (Alternatives (N));
3969 while Present (Alt) loop
3971 Aexp : Node_Id := Expression (Alt);
3972 Aloc : constant Source_Ptr := Sloc (Aexp);
3975 if not Is_Scalar_Type (Typ) then
3977 Make_Attribute_Reference (Aloc,
3978 Prefix => Relocate_Node (Aexp),
3979 Attribute_Name => Name_Unrestricted_Access);
3983 (Alternatives (Cstmt),
3984 Make_Case_Statement_Alternative (Sloc (Alt),
3985 Discrete_Choices => Discrete_Choices (Alt),
3986 Statements => New_List (
3987 Make_Assignment_Statement (Aloc,
3988 Name => New_Occurrence_Of (Tnn, Loc),
3989 Expression => Aexp))));
3995 Append_To (Actions, Cstmt);
3997 -- Construct and return final expression with actions
3999 if Is_Scalar_Type (Typ) then
4000 Fexp := New_Occurrence_Of (Tnn, Loc);
4003 Make_Explicit_Dereference (Loc,
4004 Prefix => New_Occurrence_Of (Tnn, Loc));
4008 Make_Expression_With_Actions (Loc,
4010 Actions => Actions));
4012 Analyze_And_Resolve (N, Typ);
4013 end Expand_N_Case_Expression;
4015 -------------------------------------
4016 -- Expand_N_Conditional_Expression --
4017 -------------------------------------
4019 -- Deal with limited types and expression actions
4021 procedure Expand_N_Conditional_Expression (N : Node_Id) is
4022 Loc : constant Source_Ptr := Sloc (N);
4023 Cond : constant Node_Id := First (Expressions (N));
4024 Thenx : constant Node_Id := Next (Cond);
4025 Elsex : constant Node_Id := Next (Thenx);
4026 Typ : constant Entity_Id := Etype (N);
4037 -- Fold at compile time if condition known. We have already folded
4038 -- static conditional expressions, but it is possible to fold any
4039 -- case in which the condition is known at compile time, even though
4040 -- the result is non-static.
4042 -- Note that we don't do the fold of such cases in Sem_Elab because
4043 -- it can cause infinite loops with the expander adding a conditional
4044 -- expression, and Sem_Elab circuitry removing it repeatedly.
4046 if Compile_Time_Known_Value (Cond) then
4047 if Is_True (Expr_Value (Cond)) then
4049 Actions := Then_Actions (N);
4052 Actions := Else_Actions (N);
4057 if Present (Actions) then
4059 -- If we are not allowed to use Expression_With_Actions, just
4060 -- skip the optimization, it is not critical for correctness.
4062 if not Use_Expression_With_Actions then
4063 goto Skip_Optimization;
4067 Make_Expression_With_Actions (Loc,
4068 Expression => Relocate_Node (Expr),
4069 Actions => Actions));
4070 Analyze_And_Resolve (N, Typ);
4073 Rewrite (N, Relocate_Node (Expr));
4076 -- Note that the result is never static (legitimate cases of static
4077 -- conditional expressions were folded in Sem_Eval).
4079 Set_Is_Static_Expression (N, False);
4083 <<Skip_Optimization>>
4085 -- If the type is limited or unconstrained, we expand as follows to
4086 -- avoid any possibility of improper copies.
4088 -- Note: it may be possible to avoid this special processing if the
4089 -- back end uses its own mechanisms for handling by-reference types ???
4091 -- type Ptr is access all Typ;
4095 -- Cnn := then-expr'Unrestricted_Access;
4098 -- Cnn := else-expr'Unrestricted_Access;
4101 -- and replace the conditional expresion by a reference to Cnn.all.
4103 -- This special case can be skipped if the back end handles limited
4104 -- types properly and ensures that no incorrect copies are made.
4106 if Is_By_Reference_Type (Typ)
4107 and then not Back_End_Handles_Limited_Types
4109 Cnn := Make_Temporary (Loc, 'C', N);
4112 Make_Full_Type_Declaration (Loc,
4113 Defining_Identifier => Make_Temporary (Loc, 'A'),
4115 Make_Access_To_Object_Definition (Loc,
4116 All_Present => True,
4117 Subtype_Indication =>
4118 New_Reference_To (Typ, Loc)));
4120 Insert_Action (N, P_Decl);
4123 Make_Object_Declaration (Loc,
4124 Defining_Identifier => Cnn,
4125 Object_Definition =>
4126 New_Occurrence_Of (Defining_Identifier (P_Decl), Loc));
4129 Make_Implicit_If_Statement (N,
4130 Condition => Relocate_Node (Cond),
4132 Then_Statements => New_List (
4133 Make_Assignment_Statement (Sloc (Thenx),
4134 Name => New_Occurrence_Of (Cnn, Sloc (Thenx)),
4136 Make_Attribute_Reference (Loc,
4137 Attribute_Name => Name_Unrestricted_Access,
4138 Prefix => Relocate_Node (Thenx)))),
4140 Else_Statements => New_List (
4141 Make_Assignment_Statement (Sloc (Elsex),
4142 Name => New_Occurrence_Of (Cnn, Sloc (Elsex)),
4144 Make_Attribute_Reference (Loc,
4145 Attribute_Name => Name_Unrestricted_Access,
4146 Prefix => Relocate_Node (Elsex)))));
4149 Make_Explicit_Dereference (Loc,
4150 Prefix => New_Occurrence_Of (Cnn, Loc));
4152 -- For other types, we only need to expand if there are other actions
4153 -- associated with either branch.
4155 elsif Present (Then_Actions (N)) or else Present (Else_Actions (N)) then
4157 -- We have two approaches to handling this. If we are allowed to use
4158 -- N_Expression_With_Actions, then we can just wrap the actions into
4159 -- the appropriate expression.
4161 if Use_Expression_With_Actions then
4162 if Present (Then_Actions (N)) then
4164 Make_Expression_With_Actions (Sloc (Thenx),
4165 Actions => Then_Actions (N),
4166 Expression => Relocate_Node (Thenx)));
4167 Set_Then_Actions (N, No_List);
4168 Analyze_And_Resolve (Thenx, Typ);
4171 if Present (Else_Actions (N)) then
4173 Make_Expression_With_Actions (Sloc (Elsex),
4174 Actions => Else_Actions (N),
4175 Expression => Relocate_Node (Elsex)));
4176 Set_Else_Actions (N, No_List);
4177 Analyze_And_Resolve (Elsex, Typ);
4182 -- if we can't use N_Expression_With_Actions nodes, then we insert
4183 -- the following sequence of actions (using Insert_Actions):
4188 -- Cnn := then-expr;
4194 -- and replace the conditional expression by a reference to Cnn
4197 Cnn := Make_Temporary (Loc, 'C', N);
4200 Make_Object_Declaration (Loc,
4201 Defining_Identifier => Cnn,
4202 Object_Definition => New_Occurrence_Of (Typ, Loc));
4205 Make_Implicit_If_Statement (N,
4206 Condition => Relocate_Node (Cond),
4208 Then_Statements => New_List (
4209 Make_Assignment_Statement (Sloc (Thenx),
4210 Name => New_Occurrence_Of (Cnn, Sloc (Thenx)),
4211 Expression => Relocate_Node (Thenx))),
4213 Else_Statements => New_List (
4214 Make_Assignment_Statement (Sloc (Elsex),
4215 Name => New_Occurrence_Of (Cnn, Sloc (Elsex)),
4216 Expression => Relocate_Node (Elsex))));
4218 Set_Assignment_OK (Name (First (Then_Statements (New_If))));
4219 Set_Assignment_OK (Name (First (Else_Statements (New_If))));
4221 New_N := New_Occurrence_Of (Cnn, Loc);
4224 -- If no actions then no expansion needed, gigi will handle it using
4225 -- the same approach as a C conditional expression.
4231 -- Fall through here for either the limited expansion, or the case of
4232 -- inserting actions for non-limited types. In both these cases, we must
4233 -- move the SLOC of the parent If statement to the newly created one and
4234 -- change it to the SLOC of the expression which, after expansion, will
4235 -- correspond to what is being evaluated.
4237 if Present (Parent (N))
4238 and then Nkind (Parent (N)) = N_If_Statement
4240 Set_Sloc (New_If, Sloc (Parent (N)));
4241 Set_Sloc (Parent (N), Loc);
4244 -- Make sure Then_Actions and Else_Actions are appropriately moved
4245 -- to the new if statement.
4247 if Present (Then_Actions (N)) then
4249 (First (Then_Statements (New_If)), Then_Actions (N));
4252 if Present (Else_Actions (N)) then
4254 (First (Else_Statements (New_If)), Else_Actions (N));
4257 Insert_Action (N, Decl);
4258 Insert_Action (N, New_If);
4260 Analyze_And_Resolve (N, Typ);
4261 end Expand_N_Conditional_Expression;
4263 -----------------------------------
4264 -- Expand_N_Explicit_Dereference --
4265 -----------------------------------
4267 procedure Expand_N_Explicit_Dereference (N : Node_Id) is
4269 -- Insert explicit dereference call for the checked storage pool case
4271 Insert_Dereference_Action (Prefix (N));
4272 end Expand_N_Explicit_Dereference;
4278 procedure Expand_N_In (N : Node_Id) is
4279 Loc : constant Source_Ptr := Sloc (N);
4280 Rtyp : constant Entity_Id := Etype (N);
4281 Lop : constant Node_Id := Left_Opnd (N);
4282 Rop : constant Node_Id := Right_Opnd (N);
4283 Static : constant Boolean := Is_OK_Static_Expression (N);
4285 procedure Expand_Set_Membership;
4286 -- For each disjunct we create a simple equality or membership test.
4287 -- The whole membership is rewritten as a short-circuit disjunction.
4289 ---------------------------
4290 -- Expand_Set_Membership --
4291 ---------------------------
4293 procedure Expand_Set_Membership is
4297 function Make_Cond (Alt : Node_Id) return Node_Id;
4298 -- If the alternative is a subtype mark, create a simple membership
4299 -- test. Otherwise create an equality test for it.
4305 function Make_Cond (Alt : Node_Id) return Node_Id is
4307 L : constant Node_Id := New_Copy (Lop);
4308 R : constant Node_Id := Relocate_Node (Alt);
4311 if Is_Entity_Name (Alt)
4312 and then Is_Type (Entity (Alt))
4315 Make_In (Sloc (Alt),
4319 Cond := Make_Op_Eq (Sloc (Alt),
4327 -- Start of proessing for Expand_N_In
4330 Alt := Last (Alternatives (N));
4331 Res := Make_Cond (Alt);
4334 while Present (Alt) loop
4336 Make_Or_Else (Sloc (Alt),
4337 Left_Opnd => Make_Cond (Alt),
4343 Analyze_And_Resolve (N, Standard_Boolean);
4344 end Expand_Set_Membership;
4346 procedure Substitute_Valid_Check;
4347 -- Replaces node N by Lop'Valid. This is done when we have an explicit
4348 -- test for the left operand being in range of its subtype.
4350 ----------------------------
4351 -- Substitute_Valid_Check --
4352 ----------------------------
4354 procedure Substitute_Valid_Check is
4357 Make_Attribute_Reference (Loc,
4358 Prefix => Relocate_Node (Lop),
4359 Attribute_Name => Name_Valid));
4361 Analyze_And_Resolve (N, Rtyp);
4363 Error_Msg_N ("?explicit membership test may be optimized away", N);
4364 Error_Msg_N -- CODEFIX
4365 ("\?use ''Valid attribute instead", N);
4367 end Substitute_Valid_Check;
4369 -- Start of processing for Expand_N_In
4373 if Present (Alternatives (N)) then
4374 Remove_Side_Effects (Lop);
4375 Expand_Set_Membership;
4379 -- Check case of explicit test for an expression in range of its
4380 -- subtype. This is suspicious usage and we replace it with a 'Valid
4381 -- test and give a warning.
4383 if Is_Scalar_Type (Etype (Lop))
4384 and then Nkind (Rop) in N_Has_Entity
4385 and then Etype (Lop) = Entity (Rop)
4386 and then Comes_From_Source (N)
4387 and then VM_Target = No_VM
4389 Substitute_Valid_Check;
4393 -- Do validity check on operands
4395 if Validity_Checks_On and Validity_Check_Operands then
4396 Ensure_Valid (Left_Opnd (N));
4397 Validity_Check_Range (Right_Opnd (N));
4400 -- Case of explicit range
4402 if Nkind (Rop) = N_Range then
4404 Lo : constant Node_Id := Low_Bound (Rop);
4405 Hi : constant Node_Id := High_Bound (Rop);
4407 Ltyp : constant Entity_Id := Etype (Lop);
4409 Lo_Orig : constant Node_Id := Original_Node (Lo);
4410 Hi_Orig : constant Node_Id := Original_Node (Hi);
4412 Lcheck : Compare_Result;
4413 Ucheck : Compare_Result;
4415 Warn1 : constant Boolean :=
4416 Constant_Condition_Warnings
4417 and then Comes_From_Source (N)
4418 and then not In_Instance;
4419 -- This must be true for any of the optimization warnings, we
4420 -- clearly want to give them only for source with the flag on.
4421 -- We also skip these warnings in an instance since it may be
4422 -- the case that different instantiations have different ranges.
4424 Warn2 : constant Boolean :=
4426 and then Nkind (Original_Node (Rop)) = N_Range
4427 and then Is_Integer_Type (Etype (Lo));
4428 -- For the case where only one bound warning is elided, we also
4429 -- insist on an explicit range and an integer type. The reason is
4430 -- that the use of enumeration ranges including an end point is
4431 -- common, as is the use of a subtype name, one of whose bounds
4432 -- is the same as the type of the expression.
4435 -- If test is explicit x'first .. x'last, replace by valid check
4437 if Is_Scalar_Type (Ltyp)
4438 and then Nkind (Lo_Orig) = N_Attribute_Reference
4439 and then Attribute_Name (Lo_Orig) = Name_First
4440 and then Nkind (Prefix (Lo_Orig)) in N_Has_Entity
4441 and then Entity (Prefix (Lo_Orig)) = Ltyp
4442 and then Nkind (Hi_Orig) = N_Attribute_Reference
4443 and then Attribute_Name (Hi_Orig) = Name_Last
4444 and then Nkind (Prefix (Hi_Orig)) in N_Has_Entity
4445 and then Entity (Prefix (Hi_Orig)) = Ltyp
4446 and then Comes_From_Source (N)
4447 and then VM_Target = No_VM
4449 Substitute_Valid_Check;
4453 -- If bounds of type are known at compile time, and the end points
4454 -- are known at compile time and identical, this is another case
4455 -- for substituting a valid test. We only do this for discrete
4456 -- types, since it won't arise in practice for float types.
4458 if Comes_From_Source (N)
4459 and then Is_Discrete_Type (Ltyp)
4460 and then Compile_Time_Known_Value (Type_High_Bound (Ltyp))
4461 and then Compile_Time_Known_Value (Type_Low_Bound (Ltyp))
4462 and then Compile_Time_Known_Value (Lo)
4463 and then Compile_Time_Known_Value (Hi)
4464 and then Expr_Value (Type_High_Bound (Ltyp)) = Expr_Value (Hi)
4465 and then Expr_Value (Type_Low_Bound (Ltyp)) = Expr_Value (Lo)
4467 -- Kill warnings in instances, since they may be cases where we
4468 -- have a test in the generic that makes sense with some types
4469 -- and not with other types.
4471 and then not In_Instance
4473 Substitute_Valid_Check;
4477 -- If we have an explicit range, do a bit of optimization based
4478 -- on range analysis (we may be able to kill one or both checks).
4480 Lcheck := Compile_Time_Compare (Lop, Lo, Assume_Valid => False);
4481 Ucheck := Compile_Time_Compare (Lop, Hi, Assume_Valid => False);
4483 -- If either check is known to fail, replace result by False since
4484 -- the other check does not matter. Preserve the static flag for
4485 -- legality checks, because we are constant-folding beyond RM 4.9.
4487 if Lcheck = LT or else Ucheck = GT then
4489 Error_Msg_N ("?range test optimized away", N);
4490 Error_Msg_N ("\?value is known to be out of range", N);
4494 New_Reference_To (Standard_False, Loc));
4495 Analyze_And_Resolve (N, Rtyp);
4496 Set_Is_Static_Expression (N, Static);
4500 -- If both checks are known to succeed, replace result by True,
4501 -- since we know we are in range.
4503 elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then
4505 Error_Msg_N ("?range test optimized away", N);
4506 Error_Msg_N ("\?value is known to be in range", N);
4510 New_Reference_To (Standard_True, Loc));
4511 Analyze_And_Resolve (N, Rtyp);
4512 Set_Is_Static_Expression (N, Static);
4516 -- If lower bound check succeeds and upper bound check is not
4517 -- known to succeed or fail, then replace the range check with
4518 -- a comparison against the upper bound.
4520 elsif Lcheck in Compare_GE then
4521 if Warn2 and then not In_Instance then
4522 Error_Msg_N ("?lower bound test optimized away", Lo);
4523 Error_Msg_N ("\?value is known to be in range", Lo);
4529 Right_Opnd => High_Bound (Rop)));
4530 Analyze_And_Resolve (N, Rtyp);
4534 -- If upper bound check succeeds and lower bound check is not
4535 -- known to succeed or fail, then replace the range check with
4536 -- a comparison against the lower bound.
4538 elsif Ucheck in Compare_LE then
4539 if Warn2 and then not In_Instance then
4540 Error_Msg_N ("?upper bound test optimized away", Hi);
4541 Error_Msg_N ("\?value is known to be in range", Hi);
4547 Right_Opnd => Low_Bound (Rop)));
4548 Analyze_And_Resolve (N, Rtyp);
4553 -- We couldn't optimize away the range check, but there is one
4554 -- more issue. If we are checking constant conditionals, then we
4555 -- see if we can determine the outcome assuming everything is
4556 -- valid, and if so give an appropriate warning.
4558 if Warn1 and then not Assume_No_Invalid_Values then
4559 Lcheck := Compile_Time_Compare (Lop, Lo, Assume_Valid => True);
4560 Ucheck := Compile_Time_Compare (Lop, Hi, Assume_Valid => True);
4562 -- Result is out of range for valid value
4564 if Lcheck = LT or else Ucheck = GT then
4566 ("?value can only be in range if it is invalid", N);
4568 -- Result is in range for valid value
4570 elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then
4572 ("?value can only be out of range if it is invalid", N);
4574 -- Lower bound check succeeds if value is valid
4576 elsif Warn2 and then Lcheck in Compare_GE then
4578 ("?lower bound check only fails if it is invalid", Lo);
4580 -- Upper bound check succeeds if value is valid
4582 elsif Warn2 and then Ucheck in Compare_LE then
4584 ("?upper bound check only fails for invalid values", Hi);
4589 -- For all other cases of an explicit range, nothing to be done
4593 -- Here right operand is a subtype mark
4597 Typ : Entity_Id := Etype (Rop);
4598 Is_Acc : constant Boolean := Is_Access_Type (Typ);
4599 Cond : Node_Id := Empty;
4601 Obj : Node_Id := Lop;
4602 SCIL_Node : Node_Id;
4605 Remove_Side_Effects (Obj);
4607 -- For tagged type, do tagged membership operation
4609 if Is_Tagged_Type (Typ) then
4611 -- No expansion will be performed when VM_Target, as the VM
4612 -- back-ends will handle the membership tests directly (tags
4613 -- are not explicitly represented in Java objects, so the
4614 -- normal tagged membership expansion is not what we want).
4616 if Tagged_Type_Expansion then
4617 Tagged_Membership (N, SCIL_Node, New_N);
4619 Analyze_And_Resolve (N, Rtyp);
4621 -- Update decoration of relocated node referenced by the
4625 and then Present (SCIL_Node)
4627 Set_SCIL_Related_Node (SCIL_Node, N);
4628 Insert_Action (N, SCIL_Node);
4634 -- If type is scalar type, rewrite as x in t'first .. t'last.
4635 -- This reason we do this is that the bounds may have the wrong
4636 -- type if they come from the original type definition. Also this
4637 -- way we get all the processing above for an explicit range.
4639 elsif Is_Scalar_Type (Typ) then
4643 Make_Attribute_Reference (Loc,
4644 Attribute_Name => Name_First,
4645 Prefix => New_Reference_To (Typ, Loc)),
4648 Make_Attribute_Reference (Loc,
4649 Attribute_Name => Name_Last,
4650 Prefix => New_Reference_To (Typ, Loc))));
4651 Analyze_And_Resolve (N, Rtyp);
4654 -- Ada 2005 (AI-216): Program_Error is raised when evaluating
4655 -- a membership test if the subtype mark denotes a constrained
4656 -- Unchecked_Union subtype and the expression lacks inferable
4659 elsif Is_Unchecked_Union (Base_Type (Typ))
4660 and then Is_Constrained (Typ)
4661 and then not Has_Inferable_Discriminants (Lop)
4664 Make_Raise_Program_Error (Loc,
4665 Reason => PE_Unchecked_Union_Restriction));
4667 -- Prevent Gigi from generating incorrect code by rewriting
4668 -- the test as a standard False.
4671 New_Occurrence_Of (Standard_False, Loc));
4676 -- Here we have a non-scalar type
4679 Typ := Designated_Type (Typ);
4682 if not Is_Constrained (Typ) then
4684 New_Reference_To (Standard_True, Loc));
4685 Analyze_And_Resolve (N, Rtyp);
4687 -- For the constrained array case, we have to check the subscripts
4688 -- for an exact match if the lengths are non-zero (the lengths
4689 -- must match in any case).
4691 elsif Is_Array_Type (Typ) then
4693 Check_Subscripts : declare
4694 function Construct_Attribute_Reference
4697 Dim : Nat) return Node_Id;
4698 -- Build attribute reference E'Nam(Dim)
4700 -----------------------------------
4701 -- Construct_Attribute_Reference --
4702 -----------------------------------
4704 function Construct_Attribute_Reference
4707 Dim : Nat) return Node_Id
4711 Make_Attribute_Reference (Loc,
4713 Attribute_Name => Nam,
4714 Expressions => New_List (
4715 Make_Integer_Literal (Loc, Dim)));
4716 end Construct_Attribute_Reference;
4718 -- Start of processing for Check_Subscripts
4721 for J in 1 .. Number_Dimensions (Typ) loop
4722 Evolve_And_Then (Cond,
4725 Construct_Attribute_Reference
4726 (Duplicate_Subexpr_No_Checks (Obj),
4729 Construct_Attribute_Reference
4730 (New_Occurrence_Of (Typ, Loc), Name_First, J)));
4732 Evolve_And_Then (Cond,
4735 Construct_Attribute_Reference
4736 (Duplicate_Subexpr_No_Checks (Obj),
4739 Construct_Attribute_Reference
4740 (New_Occurrence_Of (Typ, Loc), Name_Last, J)));
4749 Right_Opnd => Make_Null (Loc)),
4750 Right_Opnd => Cond);
4754 Analyze_And_Resolve (N, Rtyp);
4755 end Check_Subscripts;
4757 -- These are the cases where constraint checks may be required,
4758 -- e.g. records with possible discriminants
4761 -- Expand the test into a series of discriminant comparisons.
4762 -- The expression that is built is the negation of the one that
4763 -- is used for checking discriminant constraints.
4765 Obj := Relocate_Node (Left_Opnd (N));
4767 if Has_Discriminants (Typ) then
4768 Cond := Make_Op_Not (Loc,
4769 Right_Opnd => Build_Discriminant_Checks (Obj, Typ));
4772 Cond := Make_Or_Else (Loc,
4776 Right_Opnd => Make_Null (Loc)),
4777 Right_Opnd => Cond);
4781 Cond := New_Occurrence_Of (Standard_True, Loc);
4785 Analyze_And_Resolve (N, Rtyp);
4791 --------------------------------
4792 -- Expand_N_Indexed_Component --
4793 --------------------------------
4795 procedure Expand_N_Indexed_Component (N : Node_Id) is
4796 Loc : constant Source_Ptr := Sloc (N);
4797 Typ : constant Entity_Id := Etype (N);
4798 P : constant Node_Id := Prefix (N);
4799 T : constant Entity_Id := Etype (P);
4802 -- A special optimization, if we have an indexed component that is
4803 -- selecting from a slice, then we can eliminate the slice, since, for
4804 -- example, x (i .. j)(k) is identical to x(k). The only difference is
4805 -- the range check required by the slice. The range check for the slice
4806 -- itself has already been generated. The range check for the
4807 -- subscripting operation is ensured by converting the subject to
4808 -- the subtype of the slice.
4810 -- This optimization not only generates better code, avoiding slice
4811 -- messing especially in the packed case, but more importantly bypasses
4812 -- some problems in handling this peculiar case, for example, the issue
4813 -- of dealing specially with object renamings.
4815 if Nkind (P) = N_Slice then
4817 Make_Indexed_Component (Loc,
4818 Prefix => Prefix (P),
4819 Expressions => New_List (
4821 (Etype (First_Index (Etype (P))),
4822 First (Expressions (N))))));
4823 Analyze_And_Resolve (N, Typ);
4827 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
4828 -- function, then additional actuals must be passed.
4830 if Ada_Version >= Ada_05
4831 and then Is_Build_In_Place_Function_Call (P)
4833 Make_Build_In_Place_Call_In_Anonymous_Context (P);
4836 -- If the prefix is an access type, then we unconditionally rewrite if
4837 -- as an explicit dereference. This simplifies processing for several
4838 -- cases, including packed array cases and certain cases in which checks
4839 -- must be generated. We used to try to do this only when it was
4840 -- necessary, but it cleans up the code to do it all the time.
4842 if Is_Access_Type (T) then
4843 Insert_Explicit_Dereference (P);
4844 Analyze_And_Resolve (P, Designated_Type (T));
4847 -- Generate index and validity checks
4849 Generate_Index_Checks (N);
4851 if Validity_Checks_On and then Validity_Check_Subscripts then
4852 Apply_Subscript_Validity_Checks (N);
4855 -- All done for the non-packed case
4857 if not Is_Packed (Etype (Prefix (N))) then
4861 -- For packed arrays that are not bit-packed (i.e. the case of an array
4862 -- with one or more index types with a non-contiguous enumeration type),
4863 -- we can always use the normal packed element get circuit.
4865 if not Is_Bit_Packed_Array (Etype (Prefix (N))) then
4866 Expand_Packed_Element_Reference (N);
4870 -- For a reference to a component of a bit packed array, we have to
4871 -- convert it to a reference to the corresponding Packed_Array_Type.
4872 -- We only want to do this for simple references, and not for:
4874 -- Left side of assignment, or prefix of left side of assignment, or
4875 -- prefix of the prefix, to handle packed arrays of packed arrays,
4876 -- This case is handled in Exp_Ch5.Expand_N_Assignment_Statement
4878 -- Renaming objects in renaming associations
4879 -- This case is handled when a use of the renamed variable occurs
4881 -- Actual parameters for a procedure call
4882 -- This case is handled in Exp_Ch6.Expand_Actuals
4884 -- The second expression in a 'Read attribute reference
4886 -- The prefix of an address or bit or size attribute reference
4888 -- The following circuit detects these exceptions
4891 Child : Node_Id := N;
4892 Parnt : Node_Id := Parent (N);
4896 if Nkind (Parnt) = N_Unchecked_Expression then
4899 elsif Nkind_In (Parnt, N_Object_Renaming_Declaration,
4900 N_Procedure_Call_Statement)
4901 or else (Nkind (Parnt) = N_Parameter_Association
4903 Nkind (Parent (Parnt)) = N_Procedure_Call_Statement)
4907 elsif Nkind (Parnt) = N_Attribute_Reference
4908 and then (Attribute_Name (Parnt) = Name_Address
4910 Attribute_Name (Parnt) = Name_Bit
4912 Attribute_Name (Parnt) = Name_Size)
4913 and then Prefix (Parnt) = Child
4917 elsif Nkind (Parnt) = N_Assignment_Statement
4918 and then Name (Parnt) = Child
4922 -- If the expression is an index of an indexed component, it must
4923 -- be expanded regardless of context.
4925 elsif Nkind (Parnt) = N_Indexed_Component
4926 and then Child /= Prefix (Parnt)
4928 Expand_Packed_Element_Reference (N);
4931 elsif Nkind (Parent (Parnt)) = N_Assignment_Statement
4932 and then Name (Parent (Parnt)) = Parnt
4936 elsif Nkind (Parnt) = N_Attribute_Reference
4937 and then Attribute_Name (Parnt) = Name_Read
4938 and then Next (First (Expressions (Parnt))) = Child
4942 elsif Nkind_In (Parnt, N_Indexed_Component, N_Selected_Component)
4943 and then Prefix (Parnt) = Child
4948 Expand_Packed_Element_Reference (N);
4952 -- Keep looking up tree for unchecked expression, or if we are the
4953 -- prefix of a possible assignment left side.
4956 Parnt := Parent (Child);
4959 end Expand_N_Indexed_Component;
4961 ---------------------
4962 -- Expand_N_Not_In --
4963 ---------------------
4965 -- Replace a not in b by not (a in b) so that the expansions for (a in b)
4966 -- can be done. This avoids needing to duplicate this expansion code.
4968 procedure Expand_N_Not_In (N : Node_Id) is
4969 Loc : constant Source_Ptr := Sloc (N);
4970 Typ : constant Entity_Id := Etype (N);
4971 Cfs : constant Boolean := Comes_From_Source (N);
4978 Left_Opnd => Left_Opnd (N),
4979 Right_Opnd => Right_Opnd (N))));
4981 -- If this is a set membership, preserve list of alternatives
4983 Set_Alternatives (Right_Opnd (N), Alternatives (Original_Node (N)));
4985 -- We want this to appear as coming from source if original does (see
4986 -- transformations in Expand_N_In).
4988 Set_Comes_From_Source (N, Cfs);
4989 Set_Comes_From_Source (Right_Opnd (N), Cfs);
4991 -- Now analyze transformed node
4993 Analyze_And_Resolve (N, Typ);
4994 end Expand_N_Not_In;
5000 -- The only replacement required is for the case of a null of type that is
5001 -- an access to protected subprogram. We represent such access values as a
5002 -- record, and so we must replace the occurrence of null by the equivalent
5003 -- record (with a null address and a null pointer in it), so that the
5004 -- backend creates the proper value.
5006 procedure Expand_N_Null (N : Node_Id) is
5007 Loc : constant Source_Ptr := Sloc (N);
5008 Typ : constant Entity_Id := Etype (N);
5012 if Is_Access_Protected_Subprogram_Type (Typ) then
5014 Make_Aggregate (Loc,
5015 Expressions => New_List (
5016 New_Occurrence_Of (RTE (RE_Null_Address), Loc),
5020 Analyze_And_Resolve (N, Equivalent_Type (Typ));
5022 -- For subsequent semantic analysis, the node must retain its type.
5023 -- Gigi in any case replaces this type by the corresponding record
5024 -- type before processing the node.
5030 when RE_Not_Available =>
5034 ---------------------
5035 -- Expand_N_Op_Abs --
5036 ---------------------
5038 procedure Expand_N_Op_Abs (N : Node_Id) is
5039 Loc : constant Source_Ptr := Sloc (N);
5040 Expr : constant Node_Id := Right_Opnd (N);
5043 Unary_Op_Validity_Checks (N);
5045 -- Deal with software overflow checking
5047 if not Backend_Overflow_Checks_On_Target
5048 and then Is_Signed_Integer_Type (Etype (N))
5049 and then Do_Overflow_Check (N)
5051 -- The only case to worry about is when the argument is equal to the
5052 -- largest negative number, so what we do is to insert the check:
5054 -- [constraint_error when Expr = typ'Base'First]
5056 -- with the usual Duplicate_Subexpr use coding for expr
5059 Make_Raise_Constraint_Error (Loc,
5062 Left_Opnd => Duplicate_Subexpr (Expr),
5064 Make_Attribute_Reference (Loc,
5066 New_Occurrence_Of (Base_Type (Etype (Expr)), Loc),
5067 Attribute_Name => Name_First)),
5068 Reason => CE_Overflow_Check_Failed));
5071 -- Vax floating-point types case
5073 if Vax_Float (Etype (N)) then
5074 Expand_Vax_Arith (N);
5076 end Expand_N_Op_Abs;
5078 ---------------------
5079 -- Expand_N_Op_Add --
5080 ---------------------
5082 procedure Expand_N_Op_Add (N : Node_Id) is
5083 Typ : constant Entity_Id := Etype (N);
5086 Binary_Op_Validity_Checks (N);
5088 -- N + 0 = 0 + N = N for integer types
5090 if Is_Integer_Type (Typ) then
5091 if Compile_Time_Known_Value (Right_Opnd (N))
5092 and then Expr_Value (Right_Opnd (N)) = Uint_0
5094 Rewrite (N, Left_Opnd (N));
5097 elsif Compile_Time_Known_Value (Left_Opnd (N))
5098 and then Expr_Value (Left_Opnd (N)) = Uint_0
5100 Rewrite (N, Right_Opnd (N));
5105 -- Arithmetic overflow checks for signed integer/fixed point types
5107 if Is_Signed_Integer_Type (Typ)
5108 or else Is_Fixed_Point_Type (Typ)
5110 Apply_Arithmetic_Overflow_Check (N);
5113 -- Vax floating-point types case
5115 elsif Vax_Float (Typ) then
5116 Expand_Vax_Arith (N);
5118 end Expand_N_Op_Add;
5120 ---------------------
5121 -- Expand_N_Op_And --
5122 ---------------------
5124 procedure Expand_N_Op_And (N : Node_Id) is
5125 Typ : constant Entity_Id := Etype (N);
5128 Binary_Op_Validity_Checks (N);
5130 if Is_Array_Type (Etype (N)) then
5131 Expand_Boolean_Operator (N);
5133 elsif Is_Boolean_Type (Etype (N)) then
5135 -- Replace AND by AND THEN if Short_Circuit_And_Or active and the
5136 -- type is standard Boolean (do not mess with AND that uses a non-
5137 -- standard Boolean type, because something strange is going on).
5139 if Short_Circuit_And_Or and then Typ = Standard_Boolean then
5141 Make_And_Then (Sloc (N),
5142 Left_Opnd => Relocate_Node (Left_Opnd (N)),
5143 Right_Opnd => Relocate_Node (Right_Opnd (N))));
5144 Analyze_And_Resolve (N, Typ);
5146 -- Otherwise, adjust conditions
5149 Adjust_Condition (Left_Opnd (N));
5150 Adjust_Condition (Right_Opnd (N));
5151 Set_Etype (N, Standard_Boolean);
5152 Adjust_Result_Type (N, Typ);
5155 end Expand_N_Op_And;
5157 ------------------------
5158 -- Expand_N_Op_Concat --
5159 ------------------------
5161 procedure Expand_N_Op_Concat (N : Node_Id) is
5163 -- List of operands to be concatenated
5166 -- Node which is to be replaced by the result of concatenating the nodes
5167 -- in the list Opnds.
5170 -- Ensure validity of both operands
5172 Binary_Op_Validity_Checks (N);
5174 -- If we are the left operand of a concatenation higher up the tree,
5175 -- then do nothing for now, since we want to deal with a series of
5176 -- concatenations as a unit.
5178 if Nkind (Parent (N)) = N_Op_Concat
5179 and then N = Left_Opnd (Parent (N))
5184 -- We get here with a concatenation whose left operand may be a
5185 -- concatenation itself with a consistent type. We need to process
5186 -- these concatenation operands from left to right, which means
5187 -- from the deepest node in the tree to the highest node.
5190 while Nkind (Left_Opnd (Cnode)) = N_Op_Concat loop
5191 Cnode := Left_Opnd (Cnode);
5194 -- Now Cnode is the deepest concatenation, and its parents are the
5195 -- concatenation nodes above, so now we process bottom up, doing the
5196 -- operations. We gather a string that is as long as possible up to five
5199 -- The outer loop runs more than once if more than one concatenation
5200 -- type is involved.
5203 Opnds := New_List (Left_Opnd (Cnode), Right_Opnd (Cnode));
5204 Set_Parent (Opnds, N);
5206 -- The inner loop gathers concatenation operands
5208 Inner : while Cnode /= N
5209 and then Base_Type (Etype (Cnode)) =
5210 Base_Type (Etype (Parent (Cnode)))
5212 Cnode := Parent (Cnode);
5213 Append (Right_Opnd (Cnode), Opnds);
5216 Expand_Concatenate (Cnode, Opnds);
5218 exit Outer when Cnode = N;
5219 Cnode := Parent (Cnode);
5221 end Expand_N_Op_Concat;
5223 ------------------------
5224 -- Expand_N_Op_Divide --
5225 ------------------------
5227 procedure Expand_N_Op_Divide (N : Node_Id) is
5228 Loc : constant Source_Ptr := Sloc (N);
5229 Lopnd : constant Node_Id := Left_Opnd (N);
5230 Ropnd : constant Node_Id := Right_Opnd (N);
5231 Ltyp : constant Entity_Id := Etype (Lopnd);
5232 Rtyp : constant Entity_Id := Etype (Ropnd);
5233 Typ : Entity_Id := Etype (N);
5234 Rknow : constant Boolean := Is_Integer_Type (Typ)
5236 Compile_Time_Known_Value (Ropnd);
5240 Binary_Op_Validity_Checks (N);
5243 Rval := Expr_Value (Ropnd);
5246 -- N / 1 = N for integer types
5248 if Rknow and then Rval = Uint_1 then
5253 -- Convert x / 2 ** y to Shift_Right (x, y). Note that the fact that
5254 -- Is_Power_Of_2_For_Shift is set means that we know that our left
5255 -- operand is an unsigned integer, as required for this to work.
5257 if Nkind (Ropnd) = N_Op_Expon
5258 and then Is_Power_Of_2_For_Shift (Ropnd)
5260 -- We cannot do this transformation in configurable run time mode if we
5261 -- have 64-bit integers and long shifts are not available.
5265 or else Support_Long_Shifts_On_Target)
5268 Make_Op_Shift_Right (Loc,
5271 Convert_To (Standard_Natural, Right_Opnd (Ropnd))));
5272 Analyze_And_Resolve (N, Typ);
5276 -- Do required fixup of universal fixed operation
5278 if Typ = Universal_Fixed then
5279 Fixup_Universal_Fixed_Operation (N);
5283 -- Divisions with fixed-point results
5285 if Is_Fixed_Point_Type (Typ) then
5287 -- No special processing if Treat_Fixed_As_Integer is set, since
5288 -- from a semantic point of view such operations are simply integer
5289 -- operations and will be treated that way.
5291 if not Treat_Fixed_As_Integer (N) then
5292 if Is_Integer_Type (Rtyp) then
5293 Expand_Divide_Fixed_By_Integer_Giving_Fixed (N);
5295 Expand_Divide_Fixed_By_Fixed_Giving_Fixed (N);
5299 -- Other cases of division of fixed-point operands. Again we exclude the
5300 -- case where Treat_Fixed_As_Integer is set.
5302 elsif (Is_Fixed_Point_Type (Ltyp) or else
5303 Is_Fixed_Point_Type (Rtyp))
5304 and then not Treat_Fixed_As_Integer (N)
5306 if Is_Integer_Type (Typ) then
5307 Expand_Divide_Fixed_By_Fixed_Giving_Integer (N);
5309 pragma Assert (Is_Floating_Point_Type (Typ));
5310 Expand_Divide_Fixed_By_Fixed_Giving_Float (N);
5313 -- Mixed-mode operations can appear in a non-static universal context,
5314 -- in which case the integer argument must be converted explicitly.
5316 elsif Typ = Universal_Real
5317 and then Is_Integer_Type (Rtyp)
5320 Convert_To (Universal_Real, Relocate_Node (Ropnd)));
5322 Analyze_And_Resolve (Ropnd, Universal_Real);
5324 elsif Typ = Universal_Real
5325 and then Is_Integer_Type (Ltyp)
5328 Convert_To (Universal_Real, Relocate_Node (Lopnd)));
5330 Analyze_And_Resolve (Lopnd, Universal_Real);
5332 -- Non-fixed point cases, do integer zero divide and overflow checks
5334 elsif Is_Integer_Type (Typ) then
5335 Apply_Divide_Check (N);
5337 -- Check for 64-bit division available, or long shifts if the divisor
5338 -- is a small power of 2 (since such divides will be converted into
5341 if Esize (Ltyp) > 32
5342 and then not Support_64_Bit_Divides_On_Target
5345 or else not Support_Long_Shifts_On_Target
5346 or else (Rval /= Uint_2 and then
5347 Rval /= Uint_4 and then
5348 Rval /= Uint_8 and then
5349 Rval /= Uint_16 and then
5350 Rval /= Uint_32 and then
5353 Error_Msg_CRT ("64-bit division", N);
5356 -- Deal with Vax_Float
5358 elsif Vax_Float (Typ) then
5359 Expand_Vax_Arith (N);
5362 end Expand_N_Op_Divide;
5364 --------------------
5365 -- Expand_N_Op_Eq --
5366 --------------------
5368 procedure Expand_N_Op_Eq (N : Node_Id) is
5369 Loc : constant Source_Ptr := Sloc (N);
5370 Typ : constant Entity_Id := Etype (N);
5371 Lhs : constant Node_Id := Left_Opnd (N);
5372 Rhs : constant Node_Id := Right_Opnd (N);
5373 Bodies : constant List_Id := New_List;
5374 A_Typ : constant Entity_Id := Etype (Lhs);
5376 Typl : Entity_Id := A_Typ;
5377 Op_Name : Entity_Id;
5380 procedure Build_Equality_Call (Eq : Entity_Id);
5381 -- If a constructed equality exists for the type or for its parent,
5382 -- build and analyze call, adding conversions if the operation is
5385 function Has_Unconstrained_UU_Component (Typ : Node_Id) return Boolean;
5386 -- Determines whether a type has a subcomponent of an unconstrained
5387 -- Unchecked_Union subtype. Typ is a record type.
5389 -------------------------
5390 -- Build_Equality_Call --
5391 -------------------------
5393 procedure Build_Equality_Call (Eq : Entity_Id) is
5394 Op_Type : constant Entity_Id := Etype (First_Formal (Eq));
5395 L_Exp : Node_Id := Relocate_Node (Lhs);
5396 R_Exp : Node_Id := Relocate_Node (Rhs);
5399 if Base_Type (Op_Type) /= Base_Type (A_Typ)
5400 and then not Is_Class_Wide_Type (A_Typ)
5402 L_Exp := OK_Convert_To (Op_Type, L_Exp);
5403 R_Exp := OK_Convert_To (Op_Type, R_Exp);
5406 -- If we have an Unchecked_Union, we need to add the inferred
5407 -- discriminant values as actuals in the function call. At this
5408 -- point, the expansion has determined that both operands have
5409 -- inferable discriminants.
5411 if Is_Unchecked_Union (Op_Type) then
5413 Lhs_Type : constant Node_Id := Etype (L_Exp);
5414 Rhs_Type : constant Node_Id := Etype (R_Exp);
5415 Lhs_Discr_Val : Node_Id;
5416 Rhs_Discr_Val : Node_Id;
5419 -- Per-object constrained selected components require special
5420 -- attention. If the enclosing scope of the component is an
5421 -- Unchecked_Union, we cannot reference its discriminants
5422 -- directly. This is why we use the two extra parameters of
5423 -- the equality function of the enclosing Unchecked_Union.
5425 -- type UU_Type (Discr : Integer := 0) is
5428 -- pragma Unchecked_Union (UU_Type);
5430 -- 1. Unchecked_Union enclosing record:
5432 -- type Enclosing_UU_Type (Discr : Integer := 0) is record
5434 -- Comp : UU_Type (Discr);
5436 -- end Enclosing_UU_Type;
5437 -- pragma Unchecked_Union (Enclosing_UU_Type);
5439 -- Obj1 : Enclosing_UU_Type;
5440 -- Obj2 : Enclosing_UU_Type (1);
5442 -- [. . .] Obj1 = Obj2 [. . .]
5446 -- if not (uu_typeEQ (obj1.comp, obj2.comp, a, b)) then
5448 -- A and B are the formal parameters of the equality function
5449 -- of Enclosing_UU_Type. The function always has two extra
5450 -- formals to capture the inferred discriminant values.
5452 -- 2. Non-Unchecked_Union enclosing record:
5455 -- Enclosing_Non_UU_Type (Discr : Integer := 0)
5458 -- Comp : UU_Type (Discr);
5460 -- end Enclosing_Non_UU_Type;
5462 -- Obj1 : Enclosing_Non_UU_Type;
5463 -- Obj2 : Enclosing_Non_UU_Type (1);
5465 -- ... Obj1 = Obj2 ...
5469 -- if not (uu_typeEQ (obj1.comp, obj2.comp,
5470 -- obj1.discr, obj2.discr)) then
5472 -- In this case we can directly reference the discriminants of
5473 -- the enclosing record.
5477 if Nkind (Lhs) = N_Selected_Component
5478 and then Has_Per_Object_Constraint
5479 (Entity (Selector_Name (Lhs)))
5481 -- Enclosing record is an Unchecked_Union, use formal A
5483 if Is_Unchecked_Union (Scope
5484 (Entity (Selector_Name (Lhs))))
5487 Make_Identifier (Loc,
5490 -- Enclosing record is of a non-Unchecked_Union type, it is
5491 -- possible to reference the discriminant.
5495 Make_Selected_Component (Loc,
5496 Prefix => Prefix (Lhs),
5499 (Get_Discriminant_Value
5500 (First_Discriminant (Lhs_Type),
5502 Stored_Constraint (Lhs_Type))));
5505 -- Comment needed here ???
5508 -- Infer the discriminant value
5512 (Get_Discriminant_Value
5513 (First_Discriminant (Lhs_Type),
5515 Stored_Constraint (Lhs_Type)));
5520 if Nkind (Rhs) = N_Selected_Component
5521 and then Has_Per_Object_Constraint
5522 (Entity (Selector_Name (Rhs)))
5524 if Is_Unchecked_Union
5525 (Scope (Entity (Selector_Name (Rhs))))
5528 Make_Identifier (Loc,
5533 Make_Selected_Component (Loc,
5534 Prefix => Prefix (Rhs),
5536 New_Copy (Get_Discriminant_Value (
5537 First_Discriminant (Rhs_Type),
5539 Stored_Constraint (Rhs_Type))));
5544 New_Copy (Get_Discriminant_Value (
5545 First_Discriminant (Rhs_Type),
5547 Stored_Constraint (Rhs_Type)));
5552 Make_Function_Call (Loc,
5553 Name => New_Reference_To (Eq, Loc),
5554 Parameter_Associations => New_List (
5561 -- Normal case, not an unchecked union
5565 Make_Function_Call (Loc,
5566 Name => New_Reference_To (Eq, Loc),
5567 Parameter_Associations => New_List (L_Exp, R_Exp)));
5570 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5571 end Build_Equality_Call;
5573 ------------------------------------
5574 -- Has_Unconstrained_UU_Component --
5575 ------------------------------------
5577 function Has_Unconstrained_UU_Component
5578 (Typ : Node_Id) return Boolean
5580 Tdef : constant Node_Id :=
5581 Type_Definition (Declaration_Node (Base_Type (Typ)));
5585 function Component_Is_Unconstrained_UU
5586 (Comp : Node_Id) return Boolean;
5587 -- Determines whether the subtype of the component is an
5588 -- unconstrained Unchecked_Union.
5590 function Variant_Is_Unconstrained_UU
5591 (Variant : Node_Id) return Boolean;
5592 -- Determines whether a component of the variant has an unconstrained
5593 -- Unchecked_Union subtype.
5595 -----------------------------------
5596 -- Component_Is_Unconstrained_UU --
5597 -----------------------------------
5599 function Component_Is_Unconstrained_UU
5600 (Comp : Node_Id) return Boolean
5603 if Nkind (Comp) /= N_Component_Declaration then
5608 Sindic : constant Node_Id :=
5609 Subtype_Indication (Component_Definition (Comp));
5612 -- Unconstrained nominal type. In the case of a constraint
5613 -- present, the node kind would have been N_Subtype_Indication.
5615 if Nkind (Sindic) = N_Identifier then
5616 return Is_Unchecked_Union (Base_Type (Etype (Sindic)));
5621 end Component_Is_Unconstrained_UU;
5623 ---------------------------------
5624 -- Variant_Is_Unconstrained_UU --
5625 ---------------------------------
5627 function Variant_Is_Unconstrained_UU
5628 (Variant : Node_Id) return Boolean
5630 Clist : constant Node_Id := Component_List (Variant);
5633 if Is_Empty_List (Component_Items (Clist)) then
5637 -- We only need to test one component
5640 Comp : Node_Id := First (Component_Items (Clist));
5643 while Present (Comp) loop
5644 if Component_Is_Unconstrained_UU (Comp) then
5652 -- None of the components withing the variant were of
5653 -- unconstrained Unchecked_Union type.
5656 end Variant_Is_Unconstrained_UU;
5658 -- Start of processing for Has_Unconstrained_UU_Component
5661 if Null_Present (Tdef) then
5665 Clist := Component_List (Tdef);
5666 Vpart := Variant_Part (Clist);
5668 -- Inspect available components
5670 if Present (Component_Items (Clist)) then
5672 Comp : Node_Id := First (Component_Items (Clist));
5675 while Present (Comp) loop
5677 -- One component is sufficient
5679 if Component_Is_Unconstrained_UU (Comp) then
5688 -- Inspect available components withing variants
5690 if Present (Vpart) then
5692 Variant : Node_Id := First (Variants (Vpart));
5695 while Present (Variant) loop
5697 -- One component within a variant is sufficient
5699 if Variant_Is_Unconstrained_UU (Variant) then
5708 -- Neither the available components, nor the components inside the
5709 -- variant parts were of an unconstrained Unchecked_Union subtype.
5712 end Has_Unconstrained_UU_Component;
5714 -- Start of processing for Expand_N_Op_Eq
5717 Binary_Op_Validity_Checks (N);
5719 if Ekind (Typl) = E_Private_Type then
5720 Typl := Underlying_Type (Typl);
5721 elsif Ekind (Typl) = E_Private_Subtype then
5722 Typl := Underlying_Type (Base_Type (Typl));
5727 -- It may happen in error situations that the underlying type is not
5728 -- set. The error will be detected later, here we just defend the
5735 Typl := Base_Type (Typl);
5737 -- Boolean types (requiring handling of non-standard case)
5739 if Is_Boolean_Type (Typl) then
5740 Adjust_Condition (Left_Opnd (N));
5741 Adjust_Condition (Right_Opnd (N));
5742 Set_Etype (N, Standard_Boolean);
5743 Adjust_Result_Type (N, Typ);
5747 elsif Is_Array_Type (Typl) then
5749 -- If we are doing full validity checking, and it is possible for the
5750 -- array elements to be invalid then expand out array comparisons to
5751 -- make sure that we check the array elements.
5753 if Validity_Check_Operands
5754 and then not Is_Known_Valid (Component_Type (Typl))
5757 Save_Force_Validity_Checks : constant Boolean :=
5758 Force_Validity_Checks;
5760 Force_Validity_Checks := True;
5762 Expand_Array_Equality
5764 Relocate_Node (Lhs),
5765 Relocate_Node (Rhs),
5768 Insert_Actions (N, Bodies);
5769 Analyze_And_Resolve (N, Standard_Boolean);
5770 Force_Validity_Checks := Save_Force_Validity_Checks;
5773 -- Packed case where both operands are known aligned
5775 elsif Is_Bit_Packed_Array (Typl)
5776 and then not Is_Possibly_Unaligned_Object (Lhs)
5777 and then not Is_Possibly_Unaligned_Object (Rhs)
5779 Expand_Packed_Eq (N);
5781 -- Where the component type is elementary we can use a block bit
5782 -- comparison (if supported on the target) exception in the case
5783 -- of floating-point (negative zero issues require element by
5784 -- element comparison), and atomic types (where we must be sure
5785 -- to load elements independently) and possibly unaligned arrays.
5787 elsif Is_Elementary_Type (Component_Type (Typl))
5788 and then not Is_Floating_Point_Type (Component_Type (Typl))
5789 and then not Is_Atomic (Component_Type (Typl))
5790 and then not Is_Possibly_Unaligned_Object (Lhs)
5791 and then not Is_Possibly_Unaligned_Object (Rhs)
5792 and then Support_Composite_Compare_On_Target
5796 -- For composite and floating-point cases, expand equality loop to
5797 -- make sure of using proper comparisons for tagged types, and
5798 -- correctly handling the floating-point case.
5802 Expand_Array_Equality
5804 Relocate_Node (Lhs),
5805 Relocate_Node (Rhs),
5808 Insert_Actions (N, Bodies, Suppress => All_Checks);
5809 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5814 elsif Is_Record_Type (Typl) then
5816 -- For tagged types, use the primitive "="
5818 if Is_Tagged_Type (Typl) then
5820 -- No need to do anything else compiling under restriction
5821 -- No_Dispatching_Calls. During the semantic analysis we
5822 -- already notified such violation.
5824 if Restriction_Active (No_Dispatching_Calls) then
5828 -- If this is derived from an untagged private type completed with
5829 -- a tagged type, it does not have a full view, so we use the
5830 -- primitive operations of the private type. This check should no
5831 -- longer be necessary when these types get their full views???
5833 if Is_Private_Type (A_Typ)
5834 and then not Is_Tagged_Type (A_Typ)
5835 and then Is_Derived_Type (A_Typ)
5836 and then No (Full_View (A_Typ))
5838 -- Search for equality operation, checking that the operands
5839 -- have the same type. Note that we must find a matching entry,
5840 -- or something is very wrong!
5842 Prim := First_Elmt (Collect_Primitive_Operations (A_Typ));
5844 while Present (Prim) loop
5845 exit when Chars (Node (Prim)) = Name_Op_Eq
5846 and then Etype (First_Formal (Node (Prim))) =
5847 Etype (Next_Formal (First_Formal (Node (Prim))))
5849 Base_Type (Etype (Node (Prim))) = Standard_Boolean;
5854 pragma Assert (Present (Prim));
5855 Op_Name := Node (Prim);
5857 -- Find the type's predefined equality or an overriding
5858 -- user- defined equality. The reason for not simply calling
5859 -- Find_Prim_Op here is that there may be a user-defined
5860 -- overloaded equality op that precedes the equality that we want,
5861 -- so we have to explicitly search (e.g., there could be an
5862 -- equality with two different parameter types).
5865 if Is_Class_Wide_Type (Typl) then
5866 Typl := Root_Type (Typl);
5869 Prim := First_Elmt (Primitive_Operations (Typl));
5870 while Present (Prim) loop
5871 exit when Chars (Node (Prim)) = Name_Op_Eq
5872 and then Etype (First_Formal (Node (Prim))) =
5873 Etype (Next_Formal (First_Formal (Node (Prim))))
5875 Base_Type (Etype (Node (Prim))) = Standard_Boolean;
5880 pragma Assert (Present (Prim));
5881 Op_Name := Node (Prim);
5884 Build_Equality_Call (Op_Name);
5886 -- Ada 2005 (AI-216): Program_Error is raised when evaluating the
5887 -- predefined equality operator for a type which has a subcomponent
5888 -- of an Unchecked_Union type whose nominal subtype is unconstrained.
5890 elsif Has_Unconstrained_UU_Component (Typl) then
5892 Make_Raise_Program_Error (Loc,
5893 Reason => PE_Unchecked_Union_Restriction));
5895 -- Prevent Gigi from generating incorrect code by rewriting the
5896 -- equality as a standard False.
5899 New_Occurrence_Of (Standard_False, Loc));
5901 elsif Is_Unchecked_Union (Typl) then
5903 -- If we can infer the discriminants of the operands, we make a
5904 -- call to the TSS equality function.
5906 if Has_Inferable_Discriminants (Lhs)
5908 Has_Inferable_Discriminants (Rhs)
5911 (TSS (Root_Type (Typl), TSS_Composite_Equality));
5914 -- Ada 2005 (AI-216): Program_Error is raised when evaluating
5915 -- the predefined equality operator for an Unchecked_Union type
5916 -- if either of the operands lack inferable discriminants.
5919 Make_Raise_Program_Error (Loc,
5920 Reason => PE_Unchecked_Union_Restriction));
5922 -- Prevent Gigi from generating incorrect code by rewriting
5923 -- the equality as a standard False.
5926 New_Occurrence_Of (Standard_False, Loc));
5930 -- If a type support function is present (for complex cases), use it
5932 elsif Present (TSS (Root_Type (Typl), TSS_Composite_Equality)) then
5934 (TSS (Root_Type (Typl), TSS_Composite_Equality));
5936 -- Otherwise expand the component by component equality. Note that
5937 -- we never use block-bit comparisons for records, because of the
5938 -- problems with gaps. The backend will often be able to recombine
5939 -- the separate comparisons that we generate here.
5942 Remove_Side_Effects (Lhs);
5943 Remove_Side_Effects (Rhs);
5945 Expand_Record_Equality (N, Typl, Lhs, Rhs, Bodies));
5947 Insert_Actions (N, Bodies, Suppress => All_Checks);
5948 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5952 -- Test if result is known at compile time
5954 Rewrite_Comparison (N);
5956 -- If we still have comparison for Vax_Float, process it
5958 if Vax_Float (Typl) and then Nkind (N) in N_Op_Compare then
5959 Expand_Vax_Comparison (N);
5964 -----------------------
5965 -- Expand_N_Op_Expon --
5966 -----------------------
5968 procedure Expand_N_Op_Expon (N : Node_Id) is
5969 Loc : constant Source_Ptr := Sloc (N);
5970 Typ : constant Entity_Id := Etype (N);
5971 Rtyp : constant Entity_Id := Root_Type (Typ);
5972 Base : constant Node_Id := Relocate_Node (Left_Opnd (N));
5973 Bastyp : constant Node_Id := Etype (Base);
5974 Exp : constant Node_Id := Relocate_Node (Right_Opnd (N));
5975 Exptyp : constant Entity_Id := Etype (Exp);
5976 Ovflo : constant Boolean := Do_Overflow_Check (N);
5985 Binary_Op_Validity_Checks (N);
5987 -- If either operand is of a private type, then we have the use of an
5988 -- intrinsic operator, and we get rid of the privateness, by using root
5989 -- types of underlying types for the actual operation. Otherwise the
5990 -- private types will cause trouble if we expand multiplications or
5991 -- shifts etc. We also do this transformation if the result type is
5992 -- different from the base type.
5994 if Is_Private_Type (Etype (Base))
5996 Is_Private_Type (Typ)
5998 Is_Private_Type (Exptyp)
6000 Rtyp /= Root_Type (Bastyp)
6003 Bt : constant Entity_Id := Root_Type (Underlying_Type (Bastyp));
6004 Et : constant Entity_Id := Root_Type (Underlying_Type (Exptyp));
6008 Unchecked_Convert_To (Typ,
6010 Left_Opnd => Unchecked_Convert_To (Bt, Base),
6011 Right_Opnd => Unchecked_Convert_To (Et, Exp))));
6012 Analyze_And_Resolve (N, Typ);
6017 -- Test for case of known right argument
6019 if Compile_Time_Known_Value (Exp) then
6020 Expv := Expr_Value (Exp);
6022 -- We only fold small non-negative exponents. You might think we
6023 -- could fold small negative exponents for the real case, but we
6024 -- can't because we are required to raise Constraint_Error for
6025 -- the case of 0.0 ** (negative) even if Machine_Overflows = False.
6026 -- See ACVC test C4A012B.
6028 if Expv >= 0 and then Expv <= 4 then
6030 -- X ** 0 = 1 (or 1.0)
6034 -- Call Remove_Side_Effects to ensure that any side effects
6035 -- in the ignored left operand (in particular function calls
6036 -- to user defined functions) are properly executed.
6038 Remove_Side_Effects (Base);
6040 if Ekind (Typ) in Integer_Kind then
6041 Xnode := Make_Integer_Literal (Loc, Intval => 1);
6043 Xnode := Make_Real_Literal (Loc, Ureal_1);
6055 Make_Op_Multiply (Loc,
6056 Left_Opnd => Duplicate_Subexpr (Base),
6057 Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
6059 -- X ** 3 = X * X * X
6063 Make_Op_Multiply (Loc,
6065 Make_Op_Multiply (Loc,
6066 Left_Opnd => Duplicate_Subexpr (Base),
6067 Right_Opnd => Duplicate_Subexpr_No_Checks (Base)),
6068 Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
6071 -- En : constant base'type := base * base;
6076 Temp := Make_Temporary (Loc, 'E', Base);
6078 Insert_Actions (N, New_List (
6079 Make_Object_Declaration (Loc,
6080 Defining_Identifier => Temp,
6081 Constant_Present => True,
6082 Object_Definition => New_Reference_To (Typ, Loc),
6084 Make_Op_Multiply (Loc,
6085 Left_Opnd => Duplicate_Subexpr (Base),
6086 Right_Opnd => Duplicate_Subexpr_No_Checks (Base)))));
6089 Make_Op_Multiply (Loc,
6090 Left_Opnd => New_Reference_To (Temp, Loc),
6091 Right_Opnd => New_Reference_To (Temp, Loc));
6095 Analyze_And_Resolve (N, Typ);
6100 -- Case of (2 ** expression) appearing as an argument of an integer
6101 -- multiplication, or as the right argument of a division of a non-
6102 -- negative integer. In such cases we leave the node untouched, setting
6103 -- the flag Is_Natural_Power_Of_2_for_Shift set, then the expansion
6104 -- of the higher level node converts it into a shift.
6106 -- Another case is 2 ** N in any other context. We simply convert
6107 -- this to 1 * 2 ** N, and then the above transformation applies.
6109 -- Note: this transformation is not applicable for a modular type with
6110 -- a non-binary modulus in the multiplication case, since we get a wrong
6111 -- result if the shift causes an overflow before the modular reduction.
6113 if Nkind (Base) = N_Integer_Literal
6114 and then Intval (Base) = 2
6115 and then Is_Integer_Type (Root_Type (Exptyp))
6116 and then Esize (Root_Type (Exptyp)) <= Esize (Standard_Integer)
6117 and then Is_Unsigned_Type (Exptyp)
6120 -- First the multiply and divide cases
6122 if Nkind_In (Parent (N), N_Op_Divide, N_Op_Multiply) then
6124 P : constant Node_Id := Parent (N);
6125 L : constant Node_Id := Left_Opnd (P);
6126 R : constant Node_Id := Right_Opnd (P);
6129 if (Nkind (P) = N_Op_Multiply
6130 and then not Non_Binary_Modulus (Typ)
6132 ((Is_Integer_Type (Etype (L)) and then R = N)
6134 (Is_Integer_Type (Etype (R)) and then L = N))
6135 and then not Do_Overflow_Check (P))
6137 (Nkind (P) = N_Op_Divide
6138 and then Is_Integer_Type (Etype (L))
6139 and then Is_Unsigned_Type (Etype (L))
6141 and then not Do_Overflow_Check (P))
6143 Set_Is_Power_Of_2_For_Shift (N);
6148 -- Now the other cases
6150 elsif not Non_Binary_Modulus (Typ) then
6152 Make_Op_Multiply (Loc,
6153 Left_Opnd => Make_Integer_Literal (Loc, 1),
6154 Right_Opnd => Relocate_Node (N)));
6155 Analyze_And_Resolve (N, Typ);
6160 -- Fall through if exponentiation must be done using a runtime routine
6162 -- First deal with modular case
6164 if Is_Modular_Integer_Type (Rtyp) then
6166 -- Non-binary case, we call the special exponentiation routine for
6167 -- the non-binary case, converting the argument to Long_Long_Integer
6168 -- and passing the modulus value. Then the result is converted back
6169 -- to the base type.
6171 if Non_Binary_Modulus (Rtyp) then
6174 Make_Function_Call (Loc,
6175 Name => New_Reference_To (RTE (RE_Exp_Modular), Loc),
6176 Parameter_Associations => New_List (
6177 Convert_To (Standard_Integer, Base),
6178 Make_Integer_Literal (Loc, Modulus (Rtyp)),
6181 -- Binary case, in this case, we call one of two routines, either the
6182 -- unsigned integer case, or the unsigned long long integer case,
6183 -- with a final "and" operation to do the required mod.
6186 if UI_To_Int (Esize (Rtyp)) <= Standard_Integer_Size then
6187 Ent := RTE (RE_Exp_Unsigned);
6189 Ent := RTE (RE_Exp_Long_Long_Unsigned);
6196 Make_Function_Call (Loc,
6197 Name => New_Reference_To (Ent, Loc),
6198 Parameter_Associations => New_List (
6199 Convert_To (Etype (First_Formal (Ent)), Base),
6202 Make_Integer_Literal (Loc, Modulus (Rtyp) - 1))));
6206 -- Common exit point for modular type case
6208 Analyze_And_Resolve (N, Typ);
6211 -- Signed integer cases, done using either Integer or Long_Long_Integer.
6212 -- It is not worth having routines for Short_[Short_]Integer, since for
6213 -- most machines it would not help, and it would generate more code that
6214 -- might need certification when a certified run time is required.
6216 -- In the integer cases, we have two routines, one for when overflow
6217 -- checks are required, and one when they are not required, since there
6218 -- is a real gain in omitting checks on many machines.
6220 elsif Rtyp = Base_Type (Standard_Long_Long_Integer)
6221 or else (Rtyp = Base_Type (Standard_Long_Integer)
6223 Esize (Standard_Long_Integer) > Esize (Standard_Integer))
6224 or else (Rtyp = Universal_Integer)
6226 Etyp := Standard_Long_Long_Integer;
6229 Rent := RE_Exp_Long_Long_Integer;
6231 Rent := RE_Exn_Long_Long_Integer;
6234 elsif Is_Signed_Integer_Type (Rtyp) then
6235 Etyp := Standard_Integer;
6238 Rent := RE_Exp_Integer;
6240 Rent := RE_Exn_Integer;
6243 -- Floating-point cases, always done using Long_Long_Float. We do not
6244 -- need separate routines for the overflow case here, since in the case
6245 -- of floating-point, we generate infinities anyway as a rule (either
6246 -- that or we automatically trap overflow), and if there is an infinity
6247 -- generated and a range check is required, the check will fail anyway.
6250 pragma Assert (Is_Floating_Point_Type (Rtyp));
6251 Etyp := Standard_Long_Long_Float;
6252 Rent := RE_Exn_Long_Long_Float;
6255 -- Common processing for integer cases and floating-point cases.
6256 -- If we are in the right type, we can call runtime routine directly
6259 and then Rtyp /= Universal_Integer
6260 and then Rtyp /= Universal_Real
6263 Make_Function_Call (Loc,
6264 Name => New_Reference_To (RTE (Rent), Loc),
6265 Parameter_Associations => New_List (Base, Exp)));
6267 -- Otherwise we have to introduce conversions (conversions are also
6268 -- required in the universal cases, since the runtime routine is
6269 -- typed using one of the standard types).
6274 Make_Function_Call (Loc,
6275 Name => New_Reference_To (RTE (Rent), Loc),
6276 Parameter_Associations => New_List (
6277 Convert_To (Etyp, Base),
6281 Analyze_And_Resolve (N, Typ);
6285 when RE_Not_Available =>
6287 end Expand_N_Op_Expon;
6289 --------------------
6290 -- Expand_N_Op_Ge --
6291 --------------------
6293 procedure Expand_N_Op_Ge (N : Node_Id) is
6294 Typ : constant Entity_Id := Etype (N);
6295 Op1 : constant Node_Id := Left_Opnd (N);
6296 Op2 : constant Node_Id := Right_Opnd (N);
6297 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6300 Binary_Op_Validity_Checks (N);
6302 if Is_Array_Type (Typ1) then
6303 Expand_Array_Comparison (N);
6307 if Is_Boolean_Type (Typ1) then
6308 Adjust_Condition (Op1);
6309 Adjust_Condition (Op2);
6310 Set_Etype (N, Standard_Boolean);
6311 Adjust_Result_Type (N, Typ);
6314 Rewrite_Comparison (N);
6316 -- If we still have comparison, and Vax_Float type, process it
6318 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6319 Expand_Vax_Comparison (N);
6324 --------------------
6325 -- Expand_N_Op_Gt --
6326 --------------------
6328 procedure Expand_N_Op_Gt (N : Node_Id) is
6329 Typ : constant Entity_Id := Etype (N);
6330 Op1 : constant Node_Id := Left_Opnd (N);
6331 Op2 : constant Node_Id := Right_Opnd (N);
6332 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6335 Binary_Op_Validity_Checks (N);
6337 if Is_Array_Type (Typ1) then
6338 Expand_Array_Comparison (N);
6342 if Is_Boolean_Type (Typ1) then
6343 Adjust_Condition (Op1);
6344 Adjust_Condition (Op2);
6345 Set_Etype (N, Standard_Boolean);
6346 Adjust_Result_Type (N, Typ);
6349 Rewrite_Comparison (N);
6351 -- If we still have comparison, and Vax_Float type, process it
6353 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6354 Expand_Vax_Comparison (N);
6359 --------------------
6360 -- Expand_N_Op_Le --
6361 --------------------
6363 procedure Expand_N_Op_Le (N : Node_Id) is
6364 Typ : constant Entity_Id := Etype (N);
6365 Op1 : constant Node_Id := Left_Opnd (N);
6366 Op2 : constant Node_Id := Right_Opnd (N);
6367 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6370 Binary_Op_Validity_Checks (N);
6372 if Is_Array_Type (Typ1) then
6373 Expand_Array_Comparison (N);
6377 if Is_Boolean_Type (Typ1) then
6378 Adjust_Condition (Op1);
6379 Adjust_Condition (Op2);
6380 Set_Etype (N, Standard_Boolean);
6381 Adjust_Result_Type (N, Typ);
6384 Rewrite_Comparison (N);
6386 -- If we still have comparison, and Vax_Float type, process it
6388 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6389 Expand_Vax_Comparison (N);
6394 --------------------
6395 -- Expand_N_Op_Lt --
6396 --------------------
6398 procedure Expand_N_Op_Lt (N : Node_Id) is
6399 Typ : constant Entity_Id := Etype (N);
6400 Op1 : constant Node_Id := Left_Opnd (N);
6401 Op2 : constant Node_Id := Right_Opnd (N);
6402 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6405 Binary_Op_Validity_Checks (N);
6407 if Is_Array_Type (Typ1) then
6408 Expand_Array_Comparison (N);
6412 if Is_Boolean_Type (Typ1) then
6413 Adjust_Condition (Op1);
6414 Adjust_Condition (Op2);
6415 Set_Etype (N, Standard_Boolean);
6416 Adjust_Result_Type (N, Typ);
6419 Rewrite_Comparison (N);
6421 -- If we still have comparison, and Vax_Float type, process it
6423 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6424 Expand_Vax_Comparison (N);
6429 -----------------------
6430 -- Expand_N_Op_Minus --
6431 -----------------------
6433 procedure Expand_N_Op_Minus (N : Node_Id) is
6434 Loc : constant Source_Ptr := Sloc (N);
6435 Typ : constant Entity_Id := Etype (N);
6438 Unary_Op_Validity_Checks (N);
6440 if not Backend_Overflow_Checks_On_Target
6441 and then Is_Signed_Integer_Type (Etype (N))
6442 and then Do_Overflow_Check (N)
6444 -- Software overflow checking expands -expr into (0 - expr)
6447 Make_Op_Subtract (Loc,
6448 Left_Opnd => Make_Integer_Literal (Loc, 0),
6449 Right_Opnd => Right_Opnd (N)));
6451 Analyze_And_Resolve (N, Typ);
6453 -- Vax floating-point types case
6455 elsif Vax_Float (Etype (N)) then
6456 Expand_Vax_Arith (N);
6458 end Expand_N_Op_Minus;
6460 ---------------------
6461 -- Expand_N_Op_Mod --
6462 ---------------------
6464 procedure Expand_N_Op_Mod (N : Node_Id) is
6465 Loc : constant Source_Ptr := Sloc (N);
6466 Typ : constant Entity_Id := Etype (N);
6467 Left : constant Node_Id := Left_Opnd (N);
6468 Right : constant Node_Id := Right_Opnd (N);
6469 DOC : constant Boolean := Do_Overflow_Check (N);
6470 DDC : constant Boolean := Do_Division_Check (N);
6480 pragma Warnings (Off, Lhi);
6483 Binary_Op_Validity_Checks (N);
6485 Determine_Range (Right, ROK, Rlo, Rhi, Assume_Valid => True);
6486 Determine_Range (Left, LOK, Llo, Lhi, Assume_Valid => True);
6488 -- Convert mod to rem if operands are known non-negative. We do this
6489 -- since it is quite likely that this will improve the quality of code,
6490 -- (the operation now corresponds to the hardware remainder), and it
6491 -- does not seem likely that it could be harmful.
6493 if LOK and then Llo >= 0
6495 ROK and then Rlo >= 0
6498 Make_Op_Rem (Sloc (N),
6499 Left_Opnd => Left_Opnd (N),
6500 Right_Opnd => Right_Opnd (N)));
6502 -- Instead of reanalyzing the node we do the analysis manually. This
6503 -- avoids anomalies when the replacement is done in an instance and
6504 -- is epsilon more efficient.
6506 Set_Entity (N, Standard_Entity (S_Op_Rem));
6508 Set_Do_Overflow_Check (N, DOC);
6509 Set_Do_Division_Check (N, DDC);
6510 Expand_N_Op_Rem (N);
6513 -- Otherwise, normal mod processing
6516 if Is_Integer_Type (Etype (N)) then
6517 Apply_Divide_Check (N);
6520 -- Apply optimization x mod 1 = 0. We don't really need that with
6521 -- gcc, but it is useful with other back ends (e.g. AAMP), and is
6522 -- certainly harmless.
6524 if Is_Integer_Type (Etype (N))
6525 and then Compile_Time_Known_Value (Right)
6526 and then Expr_Value (Right) = Uint_1
6528 -- Call Remove_Side_Effects to ensure that any side effects in
6529 -- the ignored left operand (in particular function calls to
6530 -- user defined functions) are properly executed.
6532 Remove_Side_Effects (Left);
6534 Rewrite (N, Make_Integer_Literal (Loc, 0));
6535 Analyze_And_Resolve (N, Typ);
6539 -- Deal with annoying case of largest negative number remainder
6540 -- minus one. Gigi does not handle this case correctly, because
6541 -- it generates a divide instruction which may trap in this case.
6543 -- In fact the check is quite easy, if the right operand is -1, then
6544 -- the mod value is always 0, and we can just ignore the left operand
6545 -- completely in this case.
6547 -- The operand type may be private (e.g. in the expansion of an
6548 -- intrinsic operation) so we must use the underlying type to get the
6549 -- bounds, and convert the literals explicitly.
6553 (Type_Low_Bound (Base_Type (Underlying_Type (Etype (Left)))));
6555 if ((not ROK) or else (Rlo <= (-1) and then (-1) <= Rhi))
6557 ((not LOK) or else (Llo = LLB))
6560 Make_Conditional_Expression (Loc,
6561 Expressions => New_List (
6563 Left_Opnd => Duplicate_Subexpr (Right),
6565 Unchecked_Convert_To (Typ,
6566 Make_Integer_Literal (Loc, -1))),
6567 Unchecked_Convert_To (Typ,
6568 Make_Integer_Literal (Loc, Uint_0)),
6569 Relocate_Node (N))));
6571 Set_Analyzed (Next (Next (First (Expressions (N)))));
6572 Analyze_And_Resolve (N, Typ);
6575 end Expand_N_Op_Mod;
6577 --------------------------
6578 -- Expand_N_Op_Multiply --
6579 --------------------------
6581 procedure Expand_N_Op_Multiply (N : Node_Id) is
6582 Loc : constant Source_Ptr := Sloc (N);
6583 Lop : constant Node_Id := Left_Opnd (N);
6584 Rop : constant Node_Id := Right_Opnd (N);
6586 Lp2 : constant Boolean :=
6587 Nkind (Lop) = N_Op_Expon
6588 and then Is_Power_Of_2_For_Shift (Lop);
6590 Rp2 : constant Boolean :=
6591 Nkind (Rop) = N_Op_Expon
6592 and then Is_Power_Of_2_For_Shift (Rop);
6594 Ltyp : constant Entity_Id := Etype (Lop);
6595 Rtyp : constant Entity_Id := Etype (Rop);
6596 Typ : Entity_Id := Etype (N);
6599 Binary_Op_Validity_Checks (N);
6601 -- Special optimizations for integer types
6603 if Is_Integer_Type (Typ) then
6605 -- N * 0 = 0 for integer types
6607 if Compile_Time_Known_Value (Rop)
6608 and then Expr_Value (Rop) = Uint_0
6610 -- Call Remove_Side_Effects to ensure that any side effects in
6611 -- the ignored left operand (in particular function calls to
6612 -- user defined functions) are properly executed.
6614 Remove_Side_Effects (Lop);
6616 Rewrite (N, Make_Integer_Literal (Loc, Uint_0));
6617 Analyze_And_Resolve (N, Typ);
6621 -- Similar handling for 0 * N = 0
6623 if Compile_Time_Known_Value (Lop)
6624 and then Expr_Value (Lop) = Uint_0
6626 Remove_Side_Effects (Rop);
6627 Rewrite (N, Make_Integer_Literal (Loc, Uint_0));
6628 Analyze_And_Resolve (N, Typ);
6632 -- N * 1 = 1 * N = N for integer types
6634 -- This optimisation is not done if we are going to
6635 -- rewrite the product 1 * 2 ** N to a shift.
6637 if Compile_Time_Known_Value (Rop)
6638 and then Expr_Value (Rop) = Uint_1
6644 elsif Compile_Time_Known_Value (Lop)
6645 and then Expr_Value (Lop) = Uint_1
6653 -- Convert x * 2 ** y to Shift_Left (x, y). Note that the fact that
6654 -- Is_Power_Of_2_For_Shift is set means that we know that our left
6655 -- operand is an integer, as required for this to work.
6660 -- Convert 2 ** A * 2 ** B into 2 ** (A + B)
6664 Left_Opnd => Make_Integer_Literal (Loc, 2),
6667 Left_Opnd => Right_Opnd (Lop),
6668 Right_Opnd => Right_Opnd (Rop))));
6669 Analyze_And_Resolve (N, Typ);
6674 Make_Op_Shift_Left (Loc,
6677 Convert_To (Standard_Natural, Right_Opnd (Rop))));
6678 Analyze_And_Resolve (N, Typ);
6682 -- Same processing for the operands the other way round
6686 Make_Op_Shift_Left (Loc,
6689 Convert_To (Standard_Natural, Right_Opnd (Lop))));
6690 Analyze_And_Resolve (N, Typ);
6694 -- Do required fixup of universal fixed operation
6696 if Typ = Universal_Fixed then
6697 Fixup_Universal_Fixed_Operation (N);
6701 -- Multiplications with fixed-point results
6703 if Is_Fixed_Point_Type (Typ) then
6705 -- No special processing if Treat_Fixed_As_Integer is set, since from
6706 -- a semantic point of view such operations are simply integer
6707 -- operations and will be treated that way.
6709 if not Treat_Fixed_As_Integer (N) then
6711 -- Case of fixed * integer => fixed
6713 if Is_Integer_Type (Rtyp) then
6714 Expand_Multiply_Fixed_By_Integer_Giving_Fixed (N);
6716 -- Case of integer * fixed => fixed
6718 elsif Is_Integer_Type (Ltyp) then
6719 Expand_Multiply_Integer_By_Fixed_Giving_Fixed (N);
6721 -- Case of fixed * fixed => fixed
6724 Expand_Multiply_Fixed_By_Fixed_Giving_Fixed (N);
6728 -- Other cases of multiplication of fixed-point operands. Again we
6729 -- exclude the cases where Treat_Fixed_As_Integer flag is set.
6731 elsif (Is_Fixed_Point_Type (Ltyp) or else Is_Fixed_Point_Type (Rtyp))
6732 and then not Treat_Fixed_As_Integer (N)
6734 if Is_Integer_Type (Typ) then
6735 Expand_Multiply_Fixed_By_Fixed_Giving_Integer (N);
6737 pragma Assert (Is_Floating_Point_Type (Typ));
6738 Expand_Multiply_Fixed_By_Fixed_Giving_Float (N);
6741 -- Mixed-mode operations can appear in a non-static universal context,
6742 -- in which case the integer argument must be converted explicitly.
6744 elsif Typ = Universal_Real
6745 and then Is_Integer_Type (Rtyp)
6747 Rewrite (Rop, Convert_To (Universal_Real, Relocate_Node (Rop)));
6749 Analyze_And_Resolve (Rop, Universal_Real);
6751 elsif Typ = Universal_Real
6752 and then Is_Integer_Type (Ltyp)
6754 Rewrite (Lop, Convert_To (Universal_Real, Relocate_Node (Lop)));
6756 Analyze_And_Resolve (Lop, Universal_Real);
6758 -- Non-fixed point cases, check software overflow checking required
6760 elsif Is_Signed_Integer_Type (Etype (N)) then
6761 Apply_Arithmetic_Overflow_Check (N);
6763 -- Deal with VAX float case
6765 elsif Vax_Float (Typ) then
6766 Expand_Vax_Arith (N);
6769 end Expand_N_Op_Multiply;
6771 --------------------
6772 -- Expand_N_Op_Ne --
6773 --------------------
6775 procedure Expand_N_Op_Ne (N : Node_Id) is
6776 Typ : constant Entity_Id := Etype (Left_Opnd (N));
6779 -- Case of elementary type with standard operator
6781 if Is_Elementary_Type (Typ)
6782 and then Sloc (Entity (N)) = Standard_Location
6784 Binary_Op_Validity_Checks (N);
6786 -- Boolean types (requiring handling of non-standard case)
6788 if Is_Boolean_Type (Typ) then
6789 Adjust_Condition (Left_Opnd (N));
6790 Adjust_Condition (Right_Opnd (N));
6791 Set_Etype (N, Standard_Boolean);
6792 Adjust_Result_Type (N, Typ);
6795 Rewrite_Comparison (N);
6797 -- If we still have comparison for Vax_Float, process it
6799 if Vax_Float (Typ) and then Nkind (N) in N_Op_Compare then
6800 Expand_Vax_Comparison (N);
6804 -- For all cases other than elementary types, we rewrite node as the
6805 -- negation of an equality operation, and reanalyze. The equality to be
6806 -- used is defined in the same scope and has the same signature. This
6807 -- signature must be set explicitly since in an instance it may not have
6808 -- the same visibility as in the generic unit. This avoids duplicating
6809 -- or factoring the complex code for record/array equality tests etc.
6813 Loc : constant Source_Ptr := Sloc (N);
6815 Ne : constant Entity_Id := Entity (N);
6818 Binary_Op_Validity_Checks (N);
6824 Left_Opnd => Left_Opnd (N),
6825 Right_Opnd => Right_Opnd (N)));
6826 Set_Paren_Count (Right_Opnd (Neg), 1);
6828 if Scope (Ne) /= Standard_Standard then
6829 Set_Entity (Right_Opnd (Neg), Corresponding_Equality (Ne));
6832 -- For navigation purposes, the inequality is treated as an
6833 -- implicit reference to the corresponding equality. Preserve the
6834 -- Comes_From_ source flag so that the proper Xref entry is
6837 Preserve_Comes_From_Source (Neg, N);
6838 Preserve_Comes_From_Source (Right_Opnd (Neg), N);
6840 Analyze_And_Resolve (N, Standard_Boolean);
6845 ---------------------
6846 -- Expand_N_Op_Not --
6847 ---------------------
6849 -- If the argument is other than a Boolean array type, there is no special
6850 -- expansion required, except for VMS operations on signed integers.
6852 -- For the packed case, we call the special routine in Exp_Pakd, except
6853 -- that if the component size is greater than one, we use the standard
6854 -- routine generating a gruesome loop (it is so peculiar to have packed
6855 -- arrays with non-standard Boolean representations anyway, so it does not
6856 -- matter that we do not handle this case efficiently).
6858 -- For the unpacked case (and for the special packed case where we have non
6859 -- standard Booleans, as discussed above), we generate and insert into the
6860 -- tree the following function definition:
6862 -- function Nnnn (A : arr) is
6865 -- for J in a'range loop
6866 -- B (J) := not A (J);
6871 -- Here arr is the actual subtype of the parameter (and hence always
6872 -- constrained). Then we replace the not with a call to this function.
6874 procedure Expand_N_Op_Not (N : Node_Id) is
6875 Loc : constant Source_Ptr := Sloc (N);
6876 Typ : constant Entity_Id := Etype (N);
6885 Func_Name : Entity_Id;
6886 Loop_Statement : Node_Id;
6889 Unary_Op_Validity_Checks (N);
6891 -- For boolean operand, deal with non-standard booleans
6893 if Is_Boolean_Type (Typ) then
6894 Adjust_Condition (Right_Opnd (N));
6895 Set_Etype (N, Standard_Boolean);
6896 Adjust_Result_Type (N, Typ);
6900 -- For the VMS "not" on signed integer types, use conversion to and
6901 -- from a predefined modular type.
6903 if Is_VMS_Operator (Entity (N)) then
6905 LI : constant Entity_Id := RTE (RE_Unsigned_64);
6908 Unchecked_Convert_To (Typ,
6910 Right_Opnd => Unchecked_Convert_To (LI, Right_Opnd (N))))));
6911 Analyze_And_Resolve (N, Typ);
6916 -- Only array types need any other processing
6918 if not Is_Array_Type (Typ) then
6922 -- Case of array operand. If bit packed with a component size of 1,
6923 -- handle it in Exp_Pakd if the operand is known to be aligned.
6925 if Is_Bit_Packed_Array (Typ)
6926 and then Component_Size (Typ) = 1
6927 and then not Is_Possibly_Unaligned_Object (Right_Opnd (N))
6929 Expand_Packed_Not (N);
6933 -- Case of array operand which is not bit-packed. If the context is
6934 -- a safe assignment, call in-place operation, If context is a larger
6935 -- boolean expression in the context of a safe assignment, expansion is
6936 -- done by enclosing operation.
6938 Opnd := Relocate_Node (Right_Opnd (N));
6939 Convert_To_Actual_Subtype (Opnd);
6940 Arr := Etype (Opnd);
6941 Ensure_Defined (Arr, N);
6942 Silly_Boolean_Array_Not_Test (N, Arr);
6944 if Nkind (Parent (N)) = N_Assignment_Statement then
6945 if Safe_In_Place_Array_Op (Name (Parent (N)), N, Empty) then
6946 Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
6949 -- Special case the negation of a binary operation
6951 elsif Nkind_In (Opnd, N_Op_And, N_Op_Or, N_Op_Xor)
6952 and then Safe_In_Place_Array_Op
6953 (Name (Parent (N)), Left_Opnd (Opnd), Right_Opnd (Opnd))
6955 Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
6959 elsif Nkind (Parent (N)) in N_Binary_Op
6960 and then Nkind (Parent (Parent (N))) = N_Assignment_Statement
6963 Op1 : constant Node_Id := Left_Opnd (Parent (N));
6964 Op2 : constant Node_Id := Right_Opnd (Parent (N));
6965 Lhs : constant Node_Id := Name (Parent (Parent (N)));
6968 if Safe_In_Place_Array_Op (Lhs, Op1, Op2) then
6970 and then Nkind (Op2) = N_Op_Not
6972 -- (not A) op (not B) can be reduced to a single call
6977 and then Nkind (Parent (N)) = N_Op_Xor
6979 -- A xor (not B) can also be special-cased
6987 A := Make_Defining_Identifier (Loc, Name_uA);
6988 B := Make_Defining_Identifier (Loc, Name_uB);
6989 J := Make_Defining_Identifier (Loc, Name_uJ);
6992 Make_Indexed_Component (Loc,
6993 Prefix => New_Reference_To (A, Loc),
6994 Expressions => New_List (New_Reference_To (J, Loc)));
6997 Make_Indexed_Component (Loc,
6998 Prefix => New_Reference_To (B, Loc),
6999 Expressions => New_List (New_Reference_To (J, Loc)));
7002 Make_Implicit_Loop_Statement (N,
7003 Identifier => Empty,
7006 Make_Iteration_Scheme (Loc,
7007 Loop_Parameter_Specification =>
7008 Make_Loop_Parameter_Specification (Loc,
7009 Defining_Identifier => J,
7010 Discrete_Subtype_Definition =>
7011 Make_Attribute_Reference (Loc,
7012 Prefix => Make_Identifier (Loc, Chars (A)),
7013 Attribute_Name => Name_Range))),
7015 Statements => New_List (
7016 Make_Assignment_Statement (Loc,
7018 Expression => Make_Op_Not (Loc, A_J))));
7020 Func_Name := Make_Temporary (Loc, 'N');
7021 Set_Is_Inlined (Func_Name);
7024 Make_Subprogram_Body (Loc,
7026 Make_Function_Specification (Loc,
7027 Defining_Unit_Name => Func_Name,
7028 Parameter_Specifications => New_List (
7029 Make_Parameter_Specification (Loc,
7030 Defining_Identifier => A,
7031 Parameter_Type => New_Reference_To (Typ, Loc))),
7032 Result_Definition => New_Reference_To (Typ, Loc)),
7034 Declarations => New_List (
7035 Make_Object_Declaration (Loc,
7036 Defining_Identifier => B,
7037 Object_Definition => New_Reference_To (Arr, Loc))),
7039 Handled_Statement_Sequence =>
7040 Make_Handled_Sequence_Of_Statements (Loc,
7041 Statements => New_List (
7043 Make_Simple_Return_Statement (Loc,
7045 Make_Identifier (Loc, Chars (B)))))));
7048 Make_Function_Call (Loc,
7049 Name => New_Reference_To (Func_Name, Loc),
7050 Parameter_Associations => New_List (Opnd)));
7052 Analyze_And_Resolve (N, Typ);
7053 end Expand_N_Op_Not;
7055 --------------------
7056 -- Expand_N_Op_Or --
7057 --------------------
7059 procedure Expand_N_Op_Or (N : Node_Id) is
7060 Typ : constant Entity_Id := Etype (N);
7063 Binary_Op_Validity_Checks (N);
7065 if Is_Array_Type (Etype (N)) then
7066 Expand_Boolean_Operator (N);
7068 elsif Is_Boolean_Type (Etype (N)) then
7070 -- Replace OR by OR ELSE if Short_Circuit_And_Or active and the
7071 -- type is standard Boolean (do not mess with AND that uses a non-
7072 -- standard Boolean type, because something strange is going on).
7074 if Short_Circuit_And_Or and then Typ = Standard_Boolean then
7076 Make_Or_Else (Sloc (N),
7077 Left_Opnd => Relocate_Node (Left_Opnd (N)),
7078 Right_Opnd => Relocate_Node (Right_Opnd (N))));
7079 Analyze_And_Resolve (N, Typ);
7081 -- Otherwise, adjust conditions
7084 Adjust_Condition (Left_Opnd (N));
7085 Adjust_Condition (Right_Opnd (N));
7086 Set_Etype (N, Standard_Boolean);
7087 Adjust_Result_Type (N, Typ);
7092 ----------------------
7093 -- Expand_N_Op_Plus --
7094 ----------------------
7096 procedure Expand_N_Op_Plus (N : Node_Id) is
7098 Unary_Op_Validity_Checks (N);
7099 end Expand_N_Op_Plus;
7101 ---------------------
7102 -- Expand_N_Op_Rem --
7103 ---------------------
7105 procedure Expand_N_Op_Rem (N : Node_Id) is
7106 Loc : constant Source_Ptr := Sloc (N);
7107 Typ : constant Entity_Id := Etype (N);
7109 Left : constant Node_Id := Left_Opnd (N);
7110 Right : constant Node_Id := Right_Opnd (N);
7118 -- Set if corresponding operand can be negative
7120 pragma Unreferenced (Hi);
7123 Binary_Op_Validity_Checks (N);
7125 if Is_Integer_Type (Etype (N)) then
7126 Apply_Divide_Check (N);
7129 -- Apply optimization x rem 1 = 0. We don't really need that with gcc,
7130 -- but it is useful with other back ends (e.g. AAMP), and is certainly
7133 if Is_Integer_Type (Etype (N))
7134 and then Compile_Time_Known_Value (Right)
7135 and then Expr_Value (Right) = Uint_1
7137 -- Call Remove_Side_Effects to ensure that any side effects in the
7138 -- ignored left operand (in particular function calls to user defined
7139 -- functions) are properly executed.
7141 Remove_Side_Effects (Left);
7143 Rewrite (N, Make_Integer_Literal (Loc, 0));
7144 Analyze_And_Resolve (N, Typ);
7148 -- Deal with annoying case of largest negative number remainder minus
7149 -- one. Gigi does not handle this case correctly, because it generates
7150 -- a divide instruction which may trap in this case.
7152 -- In fact the check is quite easy, if the right operand is -1, then
7153 -- the remainder is always 0, and we can just ignore the left operand
7154 -- completely in this case.
7156 Determine_Range (Right, OK, Lo, Hi, Assume_Valid => True);
7157 Lneg := (not OK) or else Lo < 0;
7159 Determine_Range (Left, OK, Lo, Hi, Assume_Valid => True);
7160 Rneg := (not OK) or else Lo < 0;
7162 -- We won't mess with trying to find out if the left operand can really
7163 -- be the largest negative number (that's a pain in the case of private
7164 -- types and this is really marginal). We will just assume that we need
7165 -- the test if the left operand can be negative at all.
7167 if Lneg and Rneg then
7169 Make_Conditional_Expression (Loc,
7170 Expressions => New_List (
7172 Left_Opnd => Duplicate_Subexpr (Right),
7174 Unchecked_Convert_To (Typ,
7175 Make_Integer_Literal (Loc, -1))),
7177 Unchecked_Convert_To (Typ,
7178 Make_Integer_Literal (Loc, Uint_0)),
7180 Relocate_Node (N))));
7182 Set_Analyzed (Next (Next (First (Expressions (N)))));
7183 Analyze_And_Resolve (N, Typ);
7185 end Expand_N_Op_Rem;
7187 -----------------------------
7188 -- Expand_N_Op_Rotate_Left --
7189 -----------------------------
7191 procedure Expand_N_Op_Rotate_Left (N : Node_Id) is
7193 Binary_Op_Validity_Checks (N);
7194 end Expand_N_Op_Rotate_Left;
7196 ------------------------------
7197 -- Expand_N_Op_Rotate_Right --
7198 ------------------------------
7200 procedure Expand_N_Op_Rotate_Right (N : Node_Id) is
7202 Binary_Op_Validity_Checks (N);
7203 end Expand_N_Op_Rotate_Right;
7205 ----------------------------
7206 -- Expand_N_Op_Shift_Left --
7207 ----------------------------
7209 procedure Expand_N_Op_Shift_Left (N : Node_Id) is
7211 Binary_Op_Validity_Checks (N);
7212 end Expand_N_Op_Shift_Left;
7214 -----------------------------
7215 -- Expand_N_Op_Shift_Right --
7216 -----------------------------
7218 procedure Expand_N_Op_Shift_Right (N : Node_Id) is
7220 Binary_Op_Validity_Checks (N);
7221 end Expand_N_Op_Shift_Right;
7223 ----------------------------------------
7224 -- Expand_N_Op_Shift_Right_Arithmetic --
7225 ----------------------------------------
7227 procedure Expand_N_Op_Shift_Right_Arithmetic (N : Node_Id) is
7229 Binary_Op_Validity_Checks (N);
7230 end Expand_N_Op_Shift_Right_Arithmetic;
7232 --------------------------
7233 -- Expand_N_Op_Subtract --
7234 --------------------------
7236 procedure Expand_N_Op_Subtract (N : Node_Id) is
7237 Typ : constant Entity_Id := Etype (N);
7240 Binary_Op_Validity_Checks (N);
7242 -- N - 0 = N for integer types
7244 if Is_Integer_Type (Typ)
7245 and then Compile_Time_Known_Value (Right_Opnd (N))
7246 and then Expr_Value (Right_Opnd (N)) = 0
7248 Rewrite (N, Left_Opnd (N));
7252 -- Arithmetic overflow checks for signed integer/fixed point types
7254 if Is_Signed_Integer_Type (Typ)
7255 or else Is_Fixed_Point_Type (Typ)
7257 Apply_Arithmetic_Overflow_Check (N);
7259 -- Vax floating-point types case
7261 elsif Vax_Float (Typ) then
7262 Expand_Vax_Arith (N);
7264 end Expand_N_Op_Subtract;
7266 ---------------------
7267 -- Expand_N_Op_Xor --
7268 ---------------------
7270 procedure Expand_N_Op_Xor (N : Node_Id) is
7271 Typ : constant Entity_Id := Etype (N);
7274 Binary_Op_Validity_Checks (N);
7276 if Is_Array_Type (Etype (N)) then
7277 Expand_Boolean_Operator (N);
7279 elsif Is_Boolean_Type (Etype (N)) then
7280 Adjust_Condition (Left_Opnd (N));
7281 Adjust_Condition (Right_Opnd (N));
7282 Set_Etype (N, Standard_Boolean);
7283 Adjust_Result_Type (N, Typ);
7285 end Expand_N_Op_Xor;
7287 ----------------------
7288 -- Expand_N_Or_Else --
7289 ----------------------
7291 procedure Expand_N_Or_Else (N : Node_Id)
7292 renames Expand_Short_Circuit_Operator;
7294 -----------------------------------
7295 -- Expand_N_Qualified_Expression --
7296 -----------------------------------
7298 procedure Expand_N_Qualified_Expression (N : Node_Id) is
7299 Operand : constant Node_Id := Expression (N);
7300 Target_Type : constant Entity_Id := Entity (Subtype_Mark (N));
7303 -- Do validity check if validity checking operands
7305 if Validity_Checks_On
7306 and then Validity_Check_Operands
7308 Ensure_Valid (Operand);
7311 -- Apply possible constraint check
7313 Apply_Constraint_Check (Operand, Target_Type, No_Sliding => True);
7315 if Do_Range_Check (Operand) then
7316 Set_Do_Range_Check (Operand, False);
7317 Generate_Range_Check (Operand, Target_Type, CE_Range_Check_Failed);
7319 end Expand_N_Qualified_Expression;
7321 ---------------------------------
7322 -- Expand_N_Selected_Component --
7323 ---------------------------------
7325 -- If the selector is a discriminant of a concurrent object, rewrite the
7326 -- prefix to denote the corresponding record type.
7328 procedure Expand_N_Selected_Component (N : Node_Id) is
7329 Loc : constant Source_Ptr := Sloc (N);
7330 Par : constant Node_Id := Parent (N);
7331 P : constant Node_Id := Prefix (N);
7332 Ptyp : Entity_Id := Underlying_Type (Etype (P));
7337 function In_Left_Hand_Side (Comp : Node_Id) return Boolean;
7338 -- Gigi needs a temporary for prefixes that depend on a discriminant,
7339 -- unless the context of an assignment can provide size information.
7340 -- Don't we have a general routine that does this???
7342 -----------------------
7343 -- In_Left_Hand_Side --
7344 -----------------------
7346 function In_Left_Hand_Side (Comp : Node_Id) return Boolean is
7348 return (Nkind (Parent (Comp)) = N_Assignment_Statement
7349 and then Comp = Name (Parent (Comp)))
7350 or else (Present (Parent (Comp))
7351 and then Nkind (Parent (Comp)) in N_Subexpr
7352 and then In_Left_Hand_Side (Parent (Comp)));
7353 end In_Left_Hand_Side;
7355 -- Start of processing for Expand_N_Selected_Component
7358 -- Insert explicit dereference if required
7360 if Is_Access_Type (Ptyp) then
7361 Insert_Explicit_Dereference (P);
7362 Analyze_And_Resolve (P, Designated_Type (Ptyp));
7364 if Ekind (Etype (P)) = E_Private_Subtype
7365 and then Is_For_Access_Subtype (Etype (P))
7367 Set_Etype (P, Base_Type (Etype (P)));
7373 -- Deal with discriminant check required
7375 if Do_Discriminant_Check (N) then
7377 -- Present the discriminant checking function to the backend, so that
7378 -- it can inline the call to the function.
7381 (Discriminant_Checking_Func
7382 (Original_Record_Component (Entity (Selector_Name (N)))));
7384 -- Now reset the flag and generate the call
7386 Set_Do_Discriminant_Check (N, False);
7387 Generate_Discriminant_Check (N);
7390 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
7391 -- function, then additional actuals must be passed.
7393 if Ada_Version >= Ada_05
7394 and then Is_Build_In_Place_Function_Call (P)
7396 Make_Build_In_Place_Call_In_Anonymous_Context (P);
7399 -- Gigi cannot handle unchecked conversions that are the prefix of a
7400 -- selected component with discriminants. This must be checked during
7401 -- expansion, because during analysis the type of the selector is not
7402 -- known at the point the prefix is analyzed. If the conversion is the
7403 -- target of an assignment, then we cannot force the evaluation.
7405 if Nkind (Prefix (N)) = N_Unchecked_Type_Conversion
7406 and then Has_Discriminants (Etype (N))
7407 and then not In_Left_Hand_Side (N)
7409 Force_Evaluation (Prefix (N));
7412 -- Remaining processing applies only if selector is a discriminant
7414 if Ekind (Entity (Selector_Name (N))) = E_Discriminant then
7416 -- If the selector is a discriminant of a constrained record type,
7417 -- we may be able to rewrite the expression with the actual value
7418 -- of the discriminant, a useful optimization in some cases.
7420 if Is_Record_Type (Ptyp)
7421 and then Has_Discriminants (Ptyp)
7422 and then Is_Constrained (Ptyp)
7424 -- Do this optimization for discrete types only, and not for
7425 -- access types (access discriminants get us into trouble!)
7427 if not Is_Discrete_Type (Etype (N)) then
7430 -- Don't do this on the left hand of an assignment statement.
7431 -- Normally one would think that references like this would
7432 -- not occur, but they do in generated code, and mean that
7433 -- we really do want to assign the discriminant!
7435 elsif Nkind (Par) = N_Assignment_Statement
7436 and then Name (Par) = N
7440 -- Don't do this optimization for the prefix of an attribute or
7441 -- the operand of an object renaming declaration since these are
7442 -- contexts where we do not want the value anyway.
7444 elsif (Nkind (Par) = N_Attribute_Reference
7445 and then Prefix (Par) = N)
7446 or else Is_Renamed_Object (N)
7450 -- Don't do this optimization if we are within the code for a
7451 -- discriminant check, since the whole point of such a check may
7452 -- be to verify the condition on which the code below depends!
7454 elsif Is_In_Discriminant_Check (N) then
7457 -- Green light to see if we can do the optimization. There is
7458 -- still one condition that inhibits the optimization below but
7459 -- now is the time to check the particular discriminant.
7462 -- Loop through discriminants to find the matching discriminant
7463 -- constraint to see if we can copy it.
7465 Disc := First_Discriminant (Ptyp);
7466 Dcon := First_Elmt (Discriminant_Constraint (Ptyp));
7467 Discr_Loop : while Present (Dcon) loop
7469 -- Check if this is the matching discriminant
7471 if Disc = Entity (Selector_Name (N)) then
7473 -- Here we have the matching discriminant. Check for
7474 -- the case of a discriminant of a component that is
7475 -- constrained by an outer discriminant, which cannot
7476 -- be optimized away.
7479 Denotes_Discriminant
7480 (Node (Dcon), Check_Concurrent => True)
7484 -- In the context of a case statement, the expression may
7485 -- have the base type of the discriminant, and we need to
7486 -- preserve the constraint to avoid spurious errors on
7489 elsif Nkind (Parent (N)) = N_Case_Statement
7490 and then Etype (Node (Dcon)) /= Etype (Disc)
7493 Make_Qualified_Expression (Loc,
7495 New_Occurrence_Of (Etype (Disc), Loc),
7497 New_Copy_Tree (Node (Dcon))));
7498 Analyze_And_Resolve (N, Etype (Disc));
7500 -- In case that comes out as a static expression,
7501 -- reset it (a selected component is never static).
7503 Set_Is_Static_Expression (N, False);
7506 -- Otherwise we can just copy the constraint, but the
7507 -- result is certainly not static! In some cases the
7508 -- discriminant constraint has been analyzed in the
7509 -- context of the original subtype indication, but for
7510 -- itypes the constraint might not have been analyzed
7511 -- yet, and this must be done now.
7514 Rewrite (N, New_Copy_Tree (Node (Dcon)));
7515 Analyze_And_Resolve (N);
7516 Set_Is_Static_Expression (N, False);
7522 Next_Discriminant (Disc);
7523 end loop Discr_Loop;
7525 -- Note: the above loop should always find a matching
7526 -- discriminant, but if it does not, we just missed an
7527 -- optimization due to some glitch (perhaps a previous error),
7533 -- The only remaining processing is in the case of a discriminant of
7534 -- a concurrent object, where we rewrite the prefix to denote the
7535 -- corresponding record type. If the type is derived and has renamed
7536 -- discriminants, use corresponding discriminant, which is the one
7537 -- that appears in the corresponding record.
7539 if not Is_Concurrent_Type (Ptyp) then
7543 Disc := Entity (Selector_Name (N));
7545 if Is_Derived_Type (Ptyp)
7546 and then Present (Corresponding_Discriminant (Disc))
7548 Disc := Corresponding_Discriminant (Disc);
7552 Make_Selected_Component (Loc,
7554 Unchecked_Convert_To (Corresponding_Record_Type (Ptyp),
7556 Selector_Name => Make_Identifier (Loc, Chars (Disc)));
7561 end Expand_N_Selected_Component;
7563 --------------------
7564 -- Expand_N_Slice --
7565 --------------------
7567 procedure Expand_N_Slice (N : Node_Id) is
7568 Loc : constant Source_Ptr := Sloc (N);
7569 Typ : constant Entity_Id := Etype (N);
7570 Pfx : constant Node_Id := Prefix (N);
7571 Ptp : Entity_Id := Etype (Pfx);
7573 function Is_Procedure_Actual (N : Node_Id) return Boolean;
7574 -- Check whether the argument is an actual for a procedure call, in
7575 -- which case the expansion of a bit-packed slice is deferred until the
7576 -- call itself is expanded. The reason this is required is that we might
7577 -- have an IN OUT or OUT parameter, and the copy out is essential, and
7578 -- that copy out would be missed if we created a temporary here in
7579 -- Expand_N_Slice. Note that we don't bother to test specifically for an
7580 -- IN OUT or OUT mode parameter, since it is a bit tricky to do, and it
7581 -- is harmless to defer expansion in the IN case, since the call
7582 -- processing will still generate the appropriate copy in operation,
7583 -- which will take care of the slice.
7585 procedure Make_Temporary_For_Slice;
7586 -- Create a named variable for the value of the slice, in cases where
7587 -- the back-end cannot handle it properly, e.g. when packed types or
7588 -- unaligned slices are involved.
7590 -------------------------
7591 -- Is_Procedure_Actual --
7592 -------------------------
7594 function Is_Procedure_Actual (N : Node_Id) return Boolean is
7595 Par : Node_Id := Parent (N);
7599 -- If our parent is a procedure call we can return
7601 if Nkind (Par) = N_Procedure_Call_Statement then
7604 -- If our parent is a type conversion, keep climbing the tree,
7605 -- since a type conversion can be a procedure actual. Also keep
7606 -- climbing if parameter association or a qualified expression,
7607 -- since these are additional cases that do can appear on
7608 -- procedure actuals.
7610 elsif Nkind_In (Par, N_Type_Conversion,
7611 N_Parameter_Association,
7612 N_Qualified_Expression)
7614 Par := Parent (Par);
7616 -- Any other case is not what we are looking for
7622 end Is_Procedure_Actual;
7624 ------------------------------
7625 -- Make_Temporary_For_Slice --
7626 ------------------------------
7628 procedure Make_Temporary_For_Slice is
7630 Ent : constant Entity_Id := Make_Temporary (Loc, 'T', N);
7633 Make_Object_Declaration (Loc,
7634 Defining_Identifier => Ent,
7635 Object_Definition => New_Occurrence_Of (Typ, Loc));
7637 Set_No_Initialization (Decl);
7639 Insert_Actions (N, New_List (
7641 Make_Assignment_Statement (Loc,
7642 Name => New_Occurrence_Of (Ent, Loc),
7643 Expression => Relocate_Node (N))));
7645 Rewrite (N, New_Occurrence_Of (Ent, Loc));
7646 Analyze_And_Resolve (N, Typ);
7647 end Make_Temporary_For_Slice;
7649 -- Start of processing for Expand_N_Slice
7652 -- Special handling for access types
7654 if Is_Access_Type (Ptp) then
7656 Ptp := Designated_Type (Ptp);
7659 Make_Explicit_Dereference (Sloc (N),
7660 Prefix => Relocate_Node (Pfx)));
7662 Analyze_And_Resolve (Pfx, Ptp);
7665 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
7666 -- function, then additional actuals must be passed.
7668 if Ada_Version >= Ada_05
7669 and then Is_Build_In_Place_Function_Call (Pfx)
7671 Make_Build_In_Place_Call_In_Anonymous_Context (Pfx);
7674 -- The remaining case to be handled is packed slices. We can leave
7675 -- packed slices as they are in the following situations:
7677 -- 1. Right or left side of an assignment (we can handle this
7678 -- situation correctly in the assignment statement expansion).
7680 -- 2. Prefix of indexed component (the slide is optimized away in this
7681 -- case, see the start of Expand_N_Slice.)
7683 -- 3. Object renaming declaration, since we want the name of the
7684 -- slice, not the value.
7686 -- 4. Argument to procedure call, since copy-in/copy-out handling may
7687 -- be required, and this is handled in the expansion of call
7690 -- 5. Prefix of an address attribute (this is an error which is caught
7691 -- elsewhere, and the expansion would interfere with generating the
7694 if not Is_Packed (Typ) then
7696 -- Apply transformation for actuals of a function call, where
7697 -- Expand_Actuals is not used.
7699 if Nkind (Parent (N)) = N_Function_Call
7700 and then Is_Possibly_Unaligned_Slice (N)
7702 Make_Temporary_For_Slice;
7705 elsif Nkind (Parent (N)) = N_Assignment_Statement
7706 or else (Nkind (Parent (Parent (N))) = N_Assignment_Statement
7707 and then Parent (N) = Name (Parent (Parent (N))))
7711 elsif Nkind (Parent (N)) = N_Indexed_Component
7712 or else Is_Renamed_Object (N)
7713 or else Is_Procedure_Actual (N)
7717 elsif Nkind (Parent (N)) = N_Attribute_Reference
7718 and then Attribute_Name (Parent (N)) = Name_Address
7723 Make_Temporary_For_Slice;
7727 ------------------------------
7728 -- Expand_N_Type_Conversion --
7729 ------------------------------
7731 procedure Expand_N_Type_Conversion (N : Node_Id) is
7732 Loc : constant Source_Ptr := Sloc (N);
7733 Operand : constant Node_Id := Expression (N);
7734 Target_Type : constant Entity_Id := Etype (N);
7735 Operand_Type : Entity_Id := Etype (Operand);
7737 procedure Handle_Changed_Representation;
7738 -- This is called in the case of record and array type conversions to
7739 -- see if there is a change of representation to be handled. Change of
7740 -- representation is actually handled at the assignment statement level,
7741 -- and what this procedure does is rewrite node N conversion as an
7742 -- assignment to temporary. If there is no change of representation,
7743 -- then the conversion node is unchanged.
7745 procedure Raise_Accessibility_Error;
7746 -- Called when we know that an accessibility check will fail. Rewrites
7747 -- node N to an appropriate raise statement and outputs warning msgs.
7748 -- The Etype of the raise node is set to Target_Type.
7750 procedure Real_Range_Check;
7751 -- Handles generation of range check for real target value
7753 -----------------------------------
7754 -- Handle_Changed_Representation --
7755 -----------------------------------
7757 procedure Handle_Changed_Representation is
7767 -- Nothing else to do if no change of representation
7769 if Same_Representation (Operand_Type, Target_Type) then
7772 -- The real change of representation work is done by the assignment
7773 -- statement processing. So if this type conversion is appearing as
7774 -- the expression of an assignment statement, nothing needs to be
7775 -- done to the conversion.
7777 elsif Nkind (Parent (N)) = N_Assignment_Statement then
7780 -- Otherwise we need to generate a temporary variable, and do the
7781 -- change of representation assignment into that temporary variable.
7782 -- The conversion is then replaced by a reference to this variable.
7787 -- If type is unconstrained we have to add a constraint, copied
7788 -- from the actual value of the left hand side.
7790 if not Is_Constrained (Target_Type) then
7791 if Has_Discriminants (Operand_Type) then
7792 Disc := First_Discriminant (Operand_Type);
7794 if Disc /= First_Stored_Discriminant (Operand_Type) then
7795 Disc := First_Stored_Discriminant (Operand_Type);
7799 while Present (Disc) loop
7801 Make_Selected_Component (Loc,
7802 Prefix => Duplicate_Subexpr_Move_Checks (Operand),
7804 Make_Identifier (Loc, Chars (Disc))));
7805 Next_Discriminant (Disc);
7808 elsif Is_Array_Type (Operand_Type) then
7809 N_Ix := First_Index (Target_Type);
7812 for J in 1 .. Number_Dimensions (Operand_Type) loop
7814 -- We convert the bounds explicitly. We use an unchecked
7815 -- conversion because bounds checks are done elsewhere.
7820 Unchecked_Convert_To (Etype (N_Ix),
7821 Make_Attribute_Reference (Loc,
7823 Duplicate_Subexpr_No_Checks
7824 (Operand, Name_Req => True),
7825 Attribute_Name => Name_First,
7826 Expressions => New_List (
7827 Make_Integer_Literal (Loc, J)))),
7830 Unchecked_Convert_To (Etype (N_Ix),
7831 Make_Attribute_Reference (Loc,
7833 Duplicate_Subexpr_No_Checks
7834 (Operand, Name_Req => True),
7835 Attribute_Name => Name_Last,
7836 Expressions => New_List (
7837 Make_Integer_Literal (Loc, J))))));
7844 Odef := New_Occurrence_Of (Target_Type, Loc);
7846 if Present (Cons) then
7848 Make_Subtype_Indication (Loc,
7849 Subtype_Mark => Odef,
7851 Make_Index_Or_Discriminant_Constraint (Loc,
7852 Constraints => Cons));
7855 Temp := Make_Temporary (Loc, 'C');
7857 Make_Object_Declaration (Loc,
7858 Defining_Identifier => Temp,
7859 Object_Definition => Odef);
7861 Set_No_Initialization (Decl, True);
7863 -- Insert required actions. It is essential to suppress checks
7864 -- since we have suppressed default initialization, which means
7865 -- that the variable we create may have no discriminants.
7870 Make_Assignment_Statement (Loc,
7871 Name => New_Occurrence_Of (Temp, Loc),
7872 Expression => Relocate_Node (N))),
7873 Suppress => All_Checks);
7875 Rewrite (N, New_Occurrence_Of (Temp, Loc));
7878 end Handle_Changed_Representation;
7880 -------------------------------
7881 -- Raise_Accessibility_Error --
7882 -------------------------------
7884 procedure Raise_Accessibility_Error is
7887 Make_Raise_Program_Error (Sloc (N),
7888 Reason => PE_Accessibility_Check_Failed));
7889 Set_Etype (N, Target_Type);
7891 Error_Msg_N ("?accessibility check failure", N);
7893 ("\?& will be raised at run time", N, Standard_Program_Error);
7894 end Raise_Accessibility_Error;
7896 ----------------------
7897 -- Real_Range_Check --
7898 ----------------------
7900 -- Case of conversions to floating-point or fixed-point. If range checks
7901 -- are enabled and the target type has a range constraint, we convert:
7907 -- Tnn : typ'Base := typ'Base (x);
7908 -- [constraint_error when Tnn < typ'First or else Tnn > typ'Last]
7911 -- This is necessary when there is a conversion of integer to float or
7912 -- to fixed-point to ensure that the correct checks are made. It is not
7913 -- necessary for float to float where it is enough to simply set the
7914 -- Do_Range_Check flag.
7916 procedure Real_Range_Check is
7917 Btyp : constant Entity_Id := Base_Type (Target_Type);
7918 Lo : constant Node_Id := Type_Low_Bound (Target_Type);
7919 Hi : constant Node_Id := Type_High_Bound (Target_Type);
7920 Xtyp : constant Entity_Id := Etype (Operand);
7925 -- Nothing to do if conversion was rewritten
7927 if Nkind (N) /= N_Type_Conversion then
7931 -- Nothing to do if range checks suppressed, or target has the same
7932 -- range as the base type (or is the base type).
7934 if Range_Checks_Suppressed (Target_Type)
7935 or else (Lo = Type_Low_Bound (Btyp)
7937 Hi = Type_High_Bound (Btyp))
7942 -- Nothing to do if expression is an entity on which checks have been
7945 if Is_Entity_Name (Operand)
7946 and then Range_Checks_Suppressed (Entity (Operand))
7951 -- Nothing to do if bounds are all static and we can tell that the
7952 -- expression is within the bounds of the target. Note that if the
7953 -- operand is of an unconstrained floating-point type, then we do
7954 -- not trust it to be in range (might be infinite)
7957 S_Lo : constant Node_Id := Type_Low_Bound (Xtyp);
7958 S_Hi : constant Node_Id := Type_High_Bound (Xtyp);
7961 if (not Is_Floating_Point_Type (Xtyp)
7962 or else Is_Constrained (Xtyp))
7963 and then Compile_Time_Known_Value (S_Lo)
7964 and then Compile_Time_Known_Value (S_Hi)
7965 and then Compile_Time_Known_Value (Hi)
7966 and then Compile_Time_Known_Value (Lo)
7969 D_Lov : constant Ureal := Expr_Value_R (Lo);
7970 D_Hiv : constant Ureal := Expr_Value_R (Hi);
7975 if Is_Real_Type (Xtyp) then
7976 S_Lov := Expr_Value_R (S_Lo);
7977 S_Hiv := Expr_Value_R (S_Hi);
7979 S_Lov := UR_From_Uint (Expr_Value (S_Lo));
7980 S_Hiv := UR_From_Uint (Expr_Value (S_Hi));
7984 and then S_Lov >= D_Lov
7985 and then S_Hiv <= D_Hiv
7987 Set_Do_Range_Check (Operand, False);
7994 -- For float to float conversions, we are done
7996 if Is_Floating_Point_Type (Xtyp)
7998 Is_Floating_Point_Type (Btyp)
8003 -- Otherwise rewrite the conversion as described above
8005 Conv := Relocate_Node (N);
8006 Rewrite (Subtype_Mark (Conv), New_Occurrence_Of (Btyp, Loc));
8007 Set_Etype (Conv, Btyp);
8009 -- Enable overflow except for case of integer to float conversions,
8010 -- where it is never required, since we can never have overflow in
8013 if not Is_Integer_Type (Etype (Operand)) then
8014 Enable_Overflow_Check (Conv);
8017 Tnn := Make_Temporary (Loc, 'T', Conv);
8019 Insert_Actions (N, New_List (
8020 Make_Object_Declaration (Loc,
8021 Defining_Identifier => Tnn,
8022 Object_Definition => New_Occurrence_Of (Btyp, Loc),
8023 Expression => Conv),
8025 Make_Raise_Constraint_Error (Loc,
8030 Left_Opnd => New_Occurrence_Of (Tnn, Loc),
8032 Make_Attribute_Reference (Loc,
8033 Attribute_Name => Name_First,
8035 New_Occurrence_Of (Target_Type, Loc))),
8039 Left_Opnd => New_Occurrence_Of (Tnn, Loc),
8041 Make_Attribute_Reference (Loc,
8042 Attribute_Name => Name_Last,
8044 New_Occurrence_Of (Target_Type, Loc)))),
8045 Reason => CE_Range_Check_Failed)));
8047 Rewrite (N, New_Occurrence_Of (Tnn, Loc));
8048 Analyze_And_Resolve (N, Btyp);
8049 end Real_Range_Check;
8051 -- Start of processing for Expand_N_Type_Conversion
8054 -- Nothing at all to do if conversion is to the identical type so remove
8055 -- the conversion completely, it is useless, except that it may carry
8056 -- an Assignment_OK attribute, which must be propagated to the operand.
8058 if Operand_Type = Target_Type then
8059 if Assignment_OK (N) then
8060 Set_Assignment_OK (Operand);
8063 Rewrite (N, Relocate_Node (Operand));
8067 -- Nothing to do if this is the second argument of read. This is a
8068 -- "backwards" conversion that will be handled by the specialized code
8069 -- in attribute processing.
8071 if Nkind (Parent (N)) = N_Attribute_Reference
8072 and then Attribute_Name (Parent (N)) = Name_Read
8073 and then Next (First (Expressions (Parent (N)))) = N
8078 -- Here if we may need to expand conversion
8080 -- If the operand of the type conversion is an arithmetic operation on
8081 -- signed integers, and the based type of the signed integer type in
8082 -- question is smaller than Standard.Integer, we promote both of the
8083 -- operands to type Integer.
8085 -- For example, if we have
8087 -- target-type (opnd1 + opnd2)
8089 -- and opnd1 and opnd2 are of type short integer, then we rewrite
8092 -- target-type (integer(opnd1) + integer(opnd2))
8094 -- We do this because we are always allowed to compute in a larger type
8095 -- if we do the right thing with the result, and in this case we are
8096 -- going to do a conversion which will do an appropriate check to make
8097 -- sure that things are in range of the target type in any case. This
8098 -- avoids some unnecessary intermediate overflows.
8100 -- We might consider a similar transformation in the case where the
8101 -- target is a real type or a 64-bit integer type, and the operand
8102 -- is an arithmetic operation using a 32-bit integer type. However,
8103 -- we do not bother with this case, because it could cause significant
8104 -- ineffiencies on 32-bit machines. On a 64-bit machine it would be
8105 -- much cheaper, but we don't want different behavior on 32-bit and
8106 -- 64-bit machines. Note that the exclusion of the 64-bit case also
8107 -- handles the configurable run-time cases where 64-bit arithmetic
8108 -- may simply be unavailable.
8110 -- Note: this circuit is partially redundant with respect to the circuit
8111 -- in Checks.Apply_Arithmetic_Overflow_Check, but we catch more cases in
8112 -- the processing here. Also we still need the Checks circuit, since we
8113 -- have to be sure not to generate junk overflow checks in the first
8114 -- place, since it would be trick to remove them here!
8116 if Integer_Promotion_Possible (N) then
8118 -- All conditions met, go ahead with transformation
8126 Make_Type_Conversion (Loc,
8127 Subtype_Mark => New_Reference_To (Standard_Integer, Loc),
8128 Expression => Relocate_Node (Right_Opnd (Operand)));
8130 Opnd := New_Op_Node (Nkind (Operand), Loc);
8131 Set_Right_Opnd (Opnd, R);
8133 if Nkind (Operand) in N_Binary_Op then
8135 Make_Type_Conversion (Loc,
8136 Subtype_Mark => New_Reference_To (Standard_Integer, Loc),
8137 Expression => Relocate_Node (Left_Opnd (Operand)));
8139 Set_Left_Opnd (Opnd, L);
8143 Make_Type_Conversion (Loc,
8144 Subtype_Mark => Relocate_Node (Subtype_Mark (N)),
8145 Expression => Opnd));
8147 Analyze_And_Resolve (N, Target_Type);
8152 -- Do validity check if validity checking operands
8154 if Validity_Checks_On
8155 and then Validity_Check_Operands
8157 Ensure_Valid (Operand);
8160 -- Special case of converting from non-standard boolean type
8162 if Is_Boolean_Type (Operand_Type)
8163 and then (Nonzero_Is_True (Operand_Type))
8165 Adjust_Condition (Operand);
8166 Set_Etype (Operand, Standard_Boolean);
8167 Operand_Type := Standard_Boolean;
8170 -- Case of converting to an access type
8172 if Is_Access_Type (Target_Type) then
8174 -- Apply an accessibility check when the conversion operand is an
8175 -- access parameter (or a renaming thereof), unless conversion was
8176 -- expanded from an Unchecked_ or Unrestricted_Access attribute.
8177 -- Note that other checks may still need to be applied below (such
8178 -- as tagged type checks).
8180 if Is_Entity_Name (Operand)
8182 (Is_Formal (Entity (Operand))
8184 (Present (Renamed_Object (Entity (Operand)))
8185 and then Is_Entity_Name (Renamed_Object (Entity (Operand)))
8187 (Entity (Renamed_Object (Entity (Operand))))))
8188 and then Ekind (Etype (Operand)) = E_Anonymous_Access_Type
8189 and then (Nkind (Original_Node (N)) /= N_Attribute_Reference
8190 or else Attribute_Name (Original_Node (N)) = Name_Access)
8192 Apply_Accessibility_Check
8193 (Operand, Target_Type, Insert_Node => Operand);
8195 -- If the level of the operand type is statically deeper than the
8196 -- level of the target type, then force Program_Error. Note that this
8197 -- can only occur for cases where the attribute is within the body of
8198 -- an instantiation (otherwise the conversion will already have been
8199 -- rejected as illegal). Note: warnings are issued by the analyzer
8200 -- for the instance cases.
8202 elsif In_Instance_Body
8203 and then Type_Access_Level (Operand_Type) >
8204 Type_Access_Level (Target_Type)
8206 Raise_Accessibility_Error;
8208 -- When the operand is a selected access discriminant the check needs
8209 -- to be made against the level of the object denoted by the prefix
8210 -- of the selected name. Force Program_Error for this case as well
8211 -- (this accessibility violation can only happen if within the body
8212 -- of an instantiation).
8214 elsif In_Instance_Body
8215 and then Ekind (Operand_Type) = E_Anonymous_Access_Type
8216 and then Nkind (Operand) = N_Selected_Component
8217 and then Object_Access_Level (Operand) >
8218 Type_Access_Level (Target_Type)
8220 Raise_Accessibility_Error;
8225 -- Case of conversions of tagged types and access to tagged types
8227 -- When needed, that is to say when the expression is class-wide, Add
8228 -- runtime a tag check for (strict) downward conversion by using the
8229 -- membership test, generating:
8231 -- [constraint_error when Operand not in Target_Type'Class]
8233 -- or in the access type case
8235 -- [constraint_error
8236 -- when Operand /= null
8237 -- and then Operand.all not in
8238 -- Designated_Type (Target_Type)'Class]
8240 if (Is_Access_Type (Target_Type)
8241 and then Is_Tagged_Type (Designated_Type (Target_Type)))
8242 or else Is_Tagged_Type (Target_Type)
8244 -- Do not do any expansion in the access type case if the parent is a
8245 -- renaming, since this is an error situation which will be caught by
8246 -- Sem_Ch8, and the expansion can interfere with this error check.
8248 if Is_Access_Type (Target_Type) and then Is_Renamed_Object (N) then
8252 -- Otherwise, proceed with processing tagged conversion
8254 Tagged_Conversion : declare
8255 Actual_Op_Typ : Entity_Id;
8256 Actual_Targ_Typ : Entity_Id;
8257 Make_Conversion : Boolean := False;
8258 Root_Op_Typ : Entity_Id;
8260 procedure Make_Tag_Check (Targ_Typ : Entity_Id);
8261 -- Create a membership check to test whether Operand is a member
8262 -- of Targ_Typ. If the original Target_Type is an access, include
8263 -- a test for null value. The check is inserted at N.
8265 --------------------
8266 -- Make_Tag_Check --
8267 --------------------
8269 procedure Make_Tag_Check (Targ_Typ : Entity_Id) is
8274 -- [Constraint_Error
8275 -- when Operand /= null
8276 -- and then Operand.all not in Targ_Typ]
8278 if Is_Access_Type (Target_Type) then
8283 Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
8284 Right_Opnd => Make_Null (Loc)),
8289 Make_Explicit_Dereference (Loc,
8290 Prefix => Duplicate_Subexpr_No_Checks (Operand)),
8291 Right_Opnd => New_Reference_To (Targ_Typ, Loc)));
8294 -- [Constraint_Error when Operand not in Targ_Typ]
8299 Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
8300 Right_Opnd => New_Reference_To (Targ_Typ, Loc));
8304 Make_Raise_Constraint_Error (Loc,
8306 Reason => CE_Tag_Check_Failed));
8309 -- Start of processing for Tagged_Conversion
8312 if Is_Access_Type (Target_Type) then
8314 -- Handle entities from the limited view
8317 Available_View (Designated_Type (Operand_Type));
8319 Available_View (Designated_Type (Target_Type));
8321 Actual_Op_Typ := Operand_Type;
8322 Actual_Targ_Typ := Target_Type;
8325 Root_Op_Typ := Root_Type (Actual_Op_Typ);
8327 -- Ada 2005 (AI-251): Handle interface type conversion
8329 if Is_Interface (Actual_Op_Typ) then
8330 Expand_Interface_Conversion (N, Is_Static => False);
8334 if not Tag_Checks_Suppressed (Actual_Targ_Typ) then
8336 -- Create a runtime tag check for a downward class-wide type
8339 if Is_Class_Wide_Type (Actual_Op_Typ)
8340 and then Actual_Op_Typ /= Actual_Targ_Typ
8341 and then Root_Op_Typ /= Actual_Targ_Typ
8342 and then Is_Ancestor (Root_Op_Typ, Actual_Targ_Typ)
8344 Make_Tag_Check (Class_Wide_Type (Actual_Targ_Typ));
8345 Make_Conversion := True;
8348 -- AI05-0073: If the result subtype of the function is defined
8349 -- by an access_definition designating a specific tagged type
8350 -- T, a check is made that the result value is null or the tag
8351 -- of the object designated by the result value identifies T.
8352 -- Constraint_Error is raised if this check fails.
8354 if Nkind (Parent (N)) = Sinfo.N_Return_Statement then
8357 Func_Typ : Entity_Id;
8360 -- Climb scope stack looking for the enclosing function
8362 Func := Current_Scope;
8363 while Present (Func)
8364 and then Ekind (Func) /= E_Function
8366 Func := Scope (Func);
8369 -- The function's return subtype must be defined using
8370 -- an access definition.
8372 if Nkind (Result_Definition (Parent (Func))) =
8375 Func_Typ := Directly_Designated_Type (Etype (Func));
8377 -- The return subtype denotes a specific tagged type,
8378 -- in other words, a non class-wide type.
8380 if Is_Tagged_Type (Func_Typ)
8381 and then not Is_Class_Wide_Type (Func_Typ)
8383 Make_Tag_Check (Actual_Targ_Typ);
8384 Make_Conversion := True;
8390 -- We have generated a tag check for either a class-wide type
8391 -- conversion or for AI05-0073.
8393 if Make_Conversion then
8398 Make_Unchecked_Type_Conversion (Loc,
8399 Subtype_Mark => New_Occurrence_Of (Target_Type, Loc),
8400 Expression => Relocate_Node (Expression (N)));
8402 Analyze_And_Resolve (N, Target_Type);
8406 end Tagged_Conversion;
8408 -- Case of other access type conversions
8410 elsif Is_Access_Type (Target_Type) then
8411 Apply_Constraint_Check (Operand, Target_Type);
8413 -- Case of conversions from a fixed-point type
8415 -- These conversions require special expansion and processing, found in
8416 -- the Exp_Fixd package. We ignore cases where Conversion_OK is set,
8417 -- since from a semantic point of view, these are simple integer
8418 -- conversions, which do not need further processing.
8420 elsif Is_Fixed_Point_Type (Operand_Type)
8421 and then not Conversion_OK (N)
8423 -- We should never see universal fixed at this case, since the
8424 -- expansion of the constituent divide or multiply should have
8425 -- eliminated the explicit mention of universal fixed.
8427 pragma Assert (Operand_Type /= Universal_Fixed);
8429 -- Check for special case of the conversion to universal real that
8430 -- occurs as a result of the use of a round attribute. In this case,
8431 -- the real type for the conversion is taken from the target type of
8432 -- the Round attribute and the result must be marked as rounded.
8434 if Target_Type = Universal_Real
8435 and then Nkind (Parent (N)) = N_Attribute_Reference
8436 and then Attribute_Name (Parent (N)) = Name_Round
8438 Set_Rounded_Result (N);
8439 Set_Etype (N, Etype (Parent (N)));
8442 -- Otherwise do correct fixed-conversion, but skip these if the
8443 -- Conversion_OK flag is set, because from a semantic point of view
8444 -- these are simple integer conversions needing no further processing
8445 -- (the backend will simply treat them as integers).
8447 if not Conversion_OK (N) then
8448 if Is_Fixed_Point_Type (Etype (N)) then
8449 Expand_Convert_Fixed_To_Fixed (N);
8452 elsif Is_Integer_Type (Etype (N)) then
8453 Expand_Convert_Fixed_To_Integer (N);
8456 pragma Assert (Is_Floating_Point_Type (Etype (N)));
8457 Expand_Convert_Fixed_To_Float (N);
8462 -- Case of conversions to a fixed-point type
8464 -- These conversions require special expansion and processing, found in
8465 -- the Exp_Fixd package. Again, ignore cases where Conversion_OK is set,
8466 -- since from a semantic point of view, these are simple integer
8467 -- conversions, which do not need further processing.
8469 elsif Is_Fixed_Point_Type (Target_Type)
8470 and then not Conversion_OK (N)
8472 if Is_Integer_Type (Operand_Type) then
8473 Expand_Convert_Integer_To_Fixed (N);
8476 pragma Assert (Is_Floating_Point_Type (Operand_Type));
8477 Expand_Convert_Float_To_Fixed (N);
8481 -- Case of float-to-integer conversions
8483 -- We also handle float-to-fixed conversions with Conversion_OK set
8484 -- since semantically the fixed-point target is treated as though it
8485 -- were an integer in such cases.
8487 elsif Is_Floating_Point_Type (Operand_Type)
8489 (Is_Integer_Type (Target_Type)
8491 (Is_Fixed_Point_Type (Target_Type) and then Conversion_OK (N)))
8493 -- One more check here, gcc is still not able to do conversions of
8494 -- this type with proper overflow checking, and so gigi is doing an
8495 -- approximation of what is required by doing floating-point compares
8496 -- with the end-point. But that can lose precision in some cases, and
8497 -- give a wrong result. Converting the operand to Universal_Real is
8498 -- helpful, but still does not catch all cases with 64-bit integers
8499 -- on targets with only 64-bit floats.
8501 -- The above comment seems obsoleted by Apply_Float_Conversion_Check
8502 -- Can this code be removed ???
8504 if Do_Range_Check (Operand) then
8506 Make_Type_Conversion (Loc,
8508 New_Occurrence_Of (Universal_Real, Loc),
8510 Relocate_Node (Operand)));
8512 Set_Etype (Operand, Universal_Real);
8513 Enable_Range_Check (Operand);
8514 Set_Do_Range_Check (Expression (Operand), False);
8517 -- Case of array conversions
8519 -- Expansion of array conversions, add required length/range checks but
8520 -- only do this if there is no change of representation. For handling of
8521 -- this case, see Handle_Changed_Representation.
8523 elsif Is_Array_Type (Target_Type) then
8525 if Is_Constrained (Target_Type) then
8526 Apply_Length_Check (Operand, Target_Type);
8528 Apply_Range_Check (Operand, Target_Type);
8531 Handle_Changed_Representation;
8533 -- Case of conversions of discriminated types
8535 -- Add required discriminant checks if target is constrained. Again this
8536 -- change is skipped if we have a change of representation.
8538 elsif Has_Discriminants (Target_Type)
8539 and then Is_Constrained (Target_Type)
8541 Apply_Discriminant_Check (Operand, Target_Type);
8542 Handle_Changed_Representation;
8544 -- Case of all other record conversions. The only processing required
8545 -- is to check for a change of representation requiring the special
8546 -- assignment processing.
8548 elsif Is_Record_Type (Target_Type) then
8550 -- Ada 2005 (AI-216): Program_Error is raised when converting from
8551 -- a derived Unchecked_Union type to an unconstrained type that is
8552 -- not Unchecked_Union if the operand lacks inferable discriminants.
8554 if Is_Derived_Type (Operand_Type)
8555 and then Is_Unchecked_Union (Base_Type (Operand_Type))
8556 and then not Is_Constrained (Target_Type)
8557 and then not Is_Unchecked_Union (Base_Type (Target_Type))
8558 and then not Has_Inferable_Discriminants (Operand)
8560 -- To prevent Gigi from generating illegal code, we generate a
8561 -- Program_Error node, but we give it the target type of the
8565 PE : constant Node_Id := Make_Raise_Program_Error (Loc,
8566 Reason => PE_Unchecked_Union_Restriction);
8569 Set_Etype (PE, Target_Type);
8574 Handle_Changed_Representation;
8577 -- Case of conversions of enumeration types
8579 elsif Is_Enumeration_Type (Target_Type) then
8581 -- Special processing is required if there is a change of
8582 -- representation (from enumeration representation clauses).
8584 if not Same_Representation (Target_Type, Operand_Type) then
8586 -- Convert: x(y) to x'val (ytyp'val (y))
8589 Make_Attribute_Reference (Loc,
8590 Prefix => New_Occurrence_Of (Target_Type, Loc),
8591 Attribute_Name => Name_Val,
8592 Expressions => New_List (
8593 Make_Attribute_Reference (Loc,
8594 Prefix => New_Occurrence_Of (Operand_Type, Loc),
8595 Attribute_Name => Name_Pos,
8596 Expressions => New_List (Operand)))));
8598 Analyze_And_Resolve (N, Target_Type);
8601 -- Case of conversions to floating-point
8603 elsif Is_Floating_Point_Type (Target_Type) then
8607 -- At this stage, either the conversion node has been transformed into
8608 -- some other equivalent expression, or left as a conversion that can be
8609 -- handled by Gigi, in the following cases:
8611 -- Conversions with no change of representation or type
8613 -- Numeric conversions involving integer, floating- and fixed-point
8614 -- values. Fixed-point values are allowed only if Conversion_OK is
8615 -- set, i.e. if the fixed-point values are to be treated as integers.
8617 -- No other conversions should be passed to Gigi
8619 -- Check: are these rules stated in sinfo??? if so, why restate here???
8621 -- The only remaining step is to generate a range check if we still have
8622 -- a type conversion at this stage and Do_Range_Check is set. For now we
8623 -- do this only for conversions of discrete types.
8625 if Nkind (N) = N_Type_Conversion
8626 and then Is_Discrete_Type (Etype (N))
8629 Expr : constant Node_Id := Expression (N);
8634 if Do_Range_Check (Expr)
8635 and then Is_Discrete_Type (Etype (Expr))
8637 Set_Do_Range_Check (Expr, False);
8639 -- Before we do a range check, we have to deal with treating a
8640 -- fixed-point operand as an integer. The way we do this is
8641 -- simply to do an unchecked conversion to an appropriate
8642 -- integer type large enough to hold the result.
8644 -- This code is not active yet, because we are only dealing
8645 -- with discrete types so far ???
8647 if Nkind (Expr) in N_Has_Treat_Fixed_As_Integer
8648 and then Treat_Fixed_As_Integer (Expr)
8650 Ftyp := Base_Type (Etype (Expr));
8652 if Esize (Ftyp) >= Esize (Standard_Integer) then
8653 Ityp := Standard_Long_Long_Integer;
8655 Ityp := Standard_Integer;
8658 Rewrite (Expr, Unchecked_Convert_To (Ityp, Expr));
8661 -- Reset overflow flag, since the range check will include
8662 -- dealing with possible overflow, and generate the check. If
8663 -- Address is either a source type or target type, suppress
8664 -- range check to avoid typing anomalies when it is a visible
8667 Set_Do_Overflow_Check (N, False);
8668 if not Is_Descendent_Of_Address (Etype (Expr))
8669 and then not Is_Descendent_Of_Address (Target_Type)
8671 Generate_Range_Check
8672 (Expr, Target_Type, CE_Range_Check_Failed);
8678 -- Final step, if the result is a type conversion involving Vax_Float
8679 -- types, then it is subject for further special processing.
8681 if Nkind (N) = N_Type_Conversion
8682 and then (Vax_Float (Operand_Type) or else Vax_Float (Target_Type))
8684 Expand_Vax_Conversion (N);
8687 end Expand_N_Type_Conversion;
8689 -----------------------------------
8690 -- Expand_N_Unchecked_Expression --
8691 -----------------------------------
8693 -- Remove the unchecked expression node from the tree. Its job was simply
8694 -- to make sure that its constituent expression was handled with checks
8695 -- off, and now that that is done, we can remove it from the tree, and
8696 -- indeed must, since Gigi does not expect to see these nodes.
8698 procedure Expand_N_Unchecked_Expression (N : Node_Id) is
8699 Exp : constant Node_Id := Expression (N);
8702 Set_Assignment_OK (Exp, Assignment_OK (N) or else Assignment_OK (Exp));
8704 end Expand_N_Unchecked_Expression;
8706 ----------------------------------------
8707 -- Expand_N_Unchecked_Type_Conversion --
8708 ----------------------------------------
8710 -- If this cannot be handled by Gigi and we haven't already made a
8711 -- temporary for it, do it now.
8713 procedure Expand_N_Unchecked_Type_Conversion (N : Node_Id) is
8714 Target_Type : constant Entity_Id := Etype (N);
8715 Operand : constant Node_Id := Expression (N);
8716 Operand_Type : constant Entity_Id := Etype (Operand);
8719 -- Nothing at all to do if conversion is to the identical type so remove
8720 -- the conversion completely, it is useless, except that it may carry
8721 -- an Assignment_OK indication which must be propagated to the operand.
8723 if Operand_Type = Target_Type then
8724 -- Code duplicates Expand_N_Unchecked_Expression above, factor???
8726 if Assignment_OK (N) then
8727 Set_Assignment_OK (Operand);
8730 Rewrite (N, Relocate_Node (Operand));
8734 -- If we have a conversion of a compile time known value to a target
8735 -- type and the value is in range of the target type, then we can simply
8736 -- replace the construct by an integer literal of the correct type. We
8737 -- only apply this to integer types being converted. Possibly it may
8738 -- apply in other cases, but it is too much trouble to worry about.
8740 -- Note that we do not do this transformation if the Kill_Range_Check
8741 -- flag is set, since then the value may be outside the expected range.
8742 -- This happens in the Normalize_Scalars case.
8744 -- We also skip this if either the target or operand type is biased
8745 -- because in this case, the unchecked conversion is supposed to
8746 -- preserve the bit pattern, not the integer value.
8748 if Is_Integer_Type (Target_Type)
8749 and then not Has_Biased_Representation (Target_Type)
8750 and then Is_Integer_Type (Operand_Type)
8751 and then not Has_Biased_Representation (Operand_Type)
8752 and then Compile_Time_Known_Value (Operand)
8753 and then not Kill_Range_Check (N)
8756 Val : constant Uint := Expr_Value (Operand);
8759 if Compile_Time_Known_Value (Type_Low_Bound (Target_Type))
8761 Compile_Time_Known_Value (Type_High_Bound (Target_Type))
8763 Val >= Expr_Value (Type_Low_Bound (Target_Type))
8765 Val <= Expr_Value (Type_High_Bound (Target_Type))
8767 Rewrite (N, Make_Integer_Literal (Sloc (N), Val));
8769 -- If Address is the target type, just set the type to avoid a
8770 -- spurious type error on the literal when Address is a visible
8773 if Is_Descendent_Of_Address (Target_Type) then
8774 Set_Etype (N, Target_Type);
8776 Analyze_And_Resolve (N, Target_Type);
8784 -- Nothing to do if conversion is safe
8786 if Safe_Unchecked_Type_Conversion (N) then
8790 -- Otherwise force evaluation unless Assignment_OK flag is set (this
8791 -- flag indicates ??? -- more comments needed here)
8793 if Assignment_OK (N) then
8796 Force_Evaluation (N);
8798 end Expand_N_Unchecked_Type_Conversion;
8800 ----------------------------
8801 -- Expand_Record_Equality --
8802 ----------------------------
8804 -- For non-variant records, Equality is expanded when needed into:
8806 -- and then Lhs.Discr1 = Rhs.Discr1
8808 -- and then Lhs.Discrn = Rhs.Discrn
8809 -- and then Lhs.Cmp1 = Rhs.Cmp1
8811 -- and then Lhs.Cmpn = Rhs.Cmpn
8813 -- The expression is folded by the back-end for adjacent fields. This
8814 -- function is called for tagged record in only one occasion: for imple-
8815 -- menting predefined primitive equality (see Predefined_Primitives_Bodies)
8816 -- otherwise the primitive "=" is used directly.
8818 function Expand_Record_Equality
8823 Bodies : List_Id) return Node_Id
8825 Loc : constant Source_Ptr := Sloc (Nod);
8830 First_Time : Boolean := True;
8832 function Suitable_Element (C : Entity_Id) return Entity_Id;
8833 -- Return the first field to compare beginning with C, skipping the
8834 -- inherited components.
8836 ----------------------
8837 -- Suitable_Element --
8838 ----------------------
8840 function Suitable_Element (C : Entity_Id) return Entity_Id is
8845 elsif Ekind (C) /= E_Discriminant
8846 and then Ekind (C) /= E_Component
8848 return Suitable_Element (Next_Entity (C));
8850 elsif Is_Tagged_Type (Typ)
8851 and then C /= Original_Record_Component (C)
8853 return Suitable_Element (Next_Entity (C));
8855 elsif Chars (C) = Name_uController
8856 or else Chars (C) = Name_uTag
8858 return Suitable_Element (Next_Entity (C));
8860 elsif Is_Interface (Etype (C)) then
8861 return Suitable_Element (Next_Entity (C));
8866 end Suitable_Element;
8868 -- Start of processing for Expand_Record_Equality
8871 -- Generates the following code: (assuming that Typ has one Discr and
8872 -- component C2 is also a record)
8875 -- and then Lhs.Discr1 = Rhs.Discr1
8876 -- and then Lhs.C1 = Rhs.C1
8877 -- and then Lhs.C2.C1=Rhs.C2.C1 and then ... Lhs.C2.Cn=Rhs.C2.Cn
8879 -- and then Lhs.Cmpn = Rhs.Cmpn
8881 Result := New_Reference_To (Standard_True, Loc);
8882 C := Suitable_Element (First_Entity (Typ));
8883 while Present (C) loop
8891 First_Time := False;
8895 New_Lhs := New_Copy_Tree (Lhs);
8896 New_Rhs := New_Copy_Tree (Rhs);
8900 Expand_Composite_Equality (Nod, Etype (C),
8902 Make_Selected_Component (Loc,
8904 Selector_Name => New_Reference_To (C, Loc)),
8906 Make_Selected_Component (Loc,
8908 Selector_Name => New_Reference_To (C, Loc)),
8911 -- If some (sub)component is an unchecked_union, the whole
8912 -- operation will raise program error.
8914 if Nkind (Check) = N_Raise_Program_Error then
8916 Set_Etype (Result, Standard_Boolean);
8921 Left_Opnd => Result,
8922 Right_Opnd => Check);
8926 C := Suitable_Element (Next_Entity (C));
8930 end Expand_Record_Equality;
8932 -----------------------------------
8933 -- Expand_Short_Circuit_Operator --
8934 -----------------------------------
8936 -- Deal with special expansion if actions are present for the right operand
8937 -- and deal with optimizing case of arguments being True or False. We also
8938 -- deal with the special case of non-standard boolean values.
8940 procedure Expand_Short_Circuit_Operator (N : Node_Id) is
8941 Loc : constant Source_Ptr := Sloc (N);
8942 Typ : constant Entity_Id := Etype (N);
8943 Kind : constant Node_Kind := Nkind (N);
8944 Left : constant Node_Id := Left_Opnd (N);
8945 Right : constant Node_Id := Right_Opnd (N);
8946 LocR : constant Source_Ptr := Sloc (Right);
8949 Shortcut_Value : constant Boolean := Nkind (N) = N_Or_Else;
8950 Shortcut_Ent : constant Entity_Id := Boolean_Literals (Shortcut_Value);
8951 -- If Left = Shortcut_Value then Right need not be evaluated
8953 function Make_Test_Expr (Opnd : Node_Id) return Node_Id;
8954 -- For Opnd a boolean expression, return a Boolean expression equivalent
8955 -- to Opnd /= Shortcut_Value.
8957 --------------------
8958 -- Make_Test_Expr --
8959 --------------------
8961 function Make_Test_Expr (Opnd : Node_Id) return Node_Id is
8963 if Shortcut_Value then
8964 return Make_Op_Not (Sloc (Opnd), Opnd);
8971 -- Entity for a temporary variable holding the value of the operator,
8972 -- used for expansion in the case where actions are present.
8974 -- Start of processing for Expand_Short_Circuit_Operator
8977 -- Deal with non-standard booleans
8979 if Is_Boolean_Type (Typ) then
8980 Adjust_Condition (Left);
8981 Adjust_Condition (Right);
8982 Set_Etype (N, Standard_Boolean);
8985 -- Check for cases where left argument is known to be True or False
8987 if Compile_Time_Known_Value (Left) then
8989 -- Mark SCO for left condition as compile time known
8991 if Generate_SCO and then Comes_From_Source (Left) then
8992 Set_SCO_Condition (Left, Expr_Value_E (Left) = Standard_True);
8995 -- Rewrite True AND THEN Right / False OR ELSE Right to Right.
8996 -- Any actions associated with Right will be executed unconditionally
8997 -- and can thus be inserted into the tree unconditionally.
8999 if Expr_Value_E (Left) /= Shortcut_Ent then
9000 if Present (Actions (N)) then
9001 Insert_Actions (N, Actions (N));
9006 -- Rewrite False AND THEN Right / True OR ELSE Right to Left.
9007 -- In this case we can forget the actions associated with Right,
9008 -- since they will never be executed.
9011 Kill_Dead_Code (Right);
9012 Kill_Dead_Code (Actions (N));
9013 Rewrite (N, New_Occurrence_Of (Shortcut_Ent, Loc));
9016 Adjust_Result_Type (N, Typ);
9020 -- If Actions are present for the right operand, we have to do some
9021 -- special processing. We can't just let these actions filter back into
9022 -- code preceding the short circuit (which is what would have happened
9023 -- if we had not trapped them in the short-circuit form), since they
9024 -- must only be executed if the right operand of the short circuit is
9025 -- executed and not otherwise.
9027 -- the temporary variable C.
9029 if Present (Actions (N)) then
9030 Actlist := Actions (N);
9032 -- The old approach is to expand:
9034 -- left AND THEN right
9038 -- C : Boolean := False;
9046 -- and finally rewrite the operator into a reference to C. Similarly
9047 -- for left OR ELSE right, with negated values. Note that this
9048 -- rewrite causes some difficulties for coverage analysis because
9049 -- of the introduction of the new variable C, which obscures the
9050 -- structure of the test.
9052 -- We use this "old approach" if use of N_Expression_With_Actions
9053 -- is False (see description in Opt of when this is or is not set).
9055 if not Use_Expression_With_Actions then
9056 Op_Var := Make_Temporary (Loc, 'C', Related_Node => N);
9059 Make_Object_Declaration (Loc,
9060 Defining_Identifier =>
9062 Object_Definition =>
9063 New_Occurrence_Of (Standard_Boolean, Loc),
9065 New_Occurrence_Of (Shortcut_Ent, Loc)));
9068 Make_Implicit_If_Statement (Right,
9069 Condition => Make_Test_Expr (Right),
9070 Then_Statements => New_List (
9071 Make_Assignment_Statement (LocR,
9072 Name => New_Occurrence_Of (Op_Var, LocR),
9075 (Boolean_Literals (not Shortcut_Value), LocR)))));
9078 Make_Implicit_If_Statement (Left,
9079 Condition => Make_Test_Expr (Left),
9080 Then_Statements => Actlist));
9082 Rewrite (N, New_Occurrence_Of (Op_Var, Loc));
9083 Analyze_And_Resolve (N, Standard_Boolean);
9085 -- The new approach, activated for now by the use of debug flag
9086 -- -gnatd.X is to use the new Expression_With_Actions node for the
9087 -- right operand of the short-circuit form. This should solve the
9088 -- traceability problems for coverage analysis.
9092 Make_Expression_With_Actions (LocR,
9093 Expression => Relocate_Node (Right),
9094 Actions => Actlist));
9095 Set_Actions (N, No_List);
9096 Analyze_And_Resolve (Right, Standard_Boolean);
9099 -- Special processing necessary for SCIL generation for AND THEN
9100 -- with a function call as the right operand.
9102 -- What is this about, and is it needed for both cases above???
9105 and then Kind = N_And_Then
9106 and then Nkind (Right) = N_Function_Call
9108 Adjust_SCIL_Node (N, Right);
9111 Adjust_Result_Type (N, Typ);
9115 -- No actions present, check for cases of right argument True/False
9117 if Compile_Time_Known_Value (Right) then
9119 -- Mark SCO for left condition as compile time known
9121 if Generate_SCO and then Comes_From_Source (Right) then
9122 Set_SCO_Condition (Right, Expr_Value_E (Right) = Standard_True);
9125 -- Change (Left and then True), (Left or else False) to Left.
9126 -- Note that we know there are no actions associated with the right
9127 -- operand, since we just checked for this case above.
9129 if Expr_Value_E (Right) /= Shortcut_Ent then
9132 -- Change (Left and then False), (Left or else True) to Right,
9133 -- making sure to preserve any side effects associated with the Left
9137 Remove_Side_Effects (Left);
9138 Rewrite (N, New_Occurrence_Of (Shortcut_Ent, Loc));
9142 Adjust_Result_Type (N, Typ);
9143 end Expand_Short_Circuit_Operator;
9145 -------------------------------------
9146 -- Fixup_Universal_Fixed_Operation --
9147 -------------------------------------
9149 procedure Fixup_Universal_Fixed_Operation (N : Node_Id) is
9150 Conv : constant Node_Id := Parent (N);
9153 -- We must have a type conversion immediately above us
9155 pragma Assert (Nkind (Conv) = N_Type_Conversion);
9157 -- Normally the type conversion gives our target type. The exception
9158 -- occurs in the case of the Round attribute, where the conversion
9159 -- will be to universal real, and our real type comes from the Round
9160 -- attribute (as well as an indication that we must round the result)
9162 if Nkind (Parent (Conv)) = N_Attribute_Reference
9163 and then Attribute_Name (Parent (Conv)) = Name_Round
9165 Set_Etype (N, Etype (Parent (Conv)));
9166 Set_Rounded_Result (N);
9168 -- Normal case where type comes from conversion above us
9171 Set_Etype (N, Etype (Conv));
9173 end Fixup_Universal_Fixed_Operation;
9175 ------------------------------
9176 -- Get_Allocator_Final_List --
9177 ------------------------------
9179 function Get_Allocator_Final_List
9182 PtrT : Entity_Id) return Entity_Id
9184 Loc : constant Source_Ptr := Sloc (N);
9186 Owner : Entity_Id := PtrT;
9187 -- The entity whose finalization list must be used to attach the
9188 -- allocated object.
9191 if Ekind (PtrT) = E_Anonymous_Access_Type then
9193 -- If the context is an access parameter, we need to create a
9194 -- non-anonymous access type in order to have a usable final list,
9195 -- because there is otherwise no pool to which the allocated object
9196 -- can belong. We create both the type and the finalization chain
9197 -- here, because freezing an internal type does not create such a
9198 -- chain. The Final_Chain that is thus created is shared by the
9199 -- access parameter. The access type is tested against the result
9200 -- type of the function to exclude allocators whose type is an
9201 -- anonymous access result type. We freeze the type at once to
9202 -- ensure that it is properly decorated for the back-end, even
9203 -- if the context and current scope is a loop.
9205 if Nkind (Associated_Node_For_Itype (PtrT))
9206 in N_Subprogram_Specification
9209 Etype (Defining_Unit_Name (Associated_Node_For_Itype (PtrT)))
9211 Owner := Make_Temporary (Loc, 'J');
9213 Make_Full_Type_Declaration (Loc,
9214 Defining_Identifier => Owner,
9216 Make_Access_To_Object_Definition (Loc,
9217 Subtype_Indication =>
9218 New_Occurrence_Of (T, Loc))));
9220 Freeze_Before (N, Owner);
9221 Build_Final_List (N, Owner);
9222 Set_Associated_Final_Chain (PtrT, Associated_Final_Chain (Owner));
9224 -- Ada 2005 (AI-318-02): If the context is a return object
9225 -- declaration, then the anonymous return subtype is defined to have
9226 -- the same accessibility level as that of the function's result
9227 -- subtype, which means that we want the scope where the function is
9230 elsif Nkind (Associated_Node_For_Itype (PtrT)) = N_Object_Declaration
9231 and then Ekind (Scope (PtrT)) = E_Return_Statement
9233 Owner := Scope (Return_Applies_To (Scope (PtrT)));
9235 -- Case of an access discriminant, or (Ada 2005) of an anonymous
9236 -- access component or anonymous access function result: find the
9237 -- final list associated with the scope of the type. (In the
9238 -- anonymous access component kind, a list controller will have
9239 -- been allocated when freezing the record type, and PtrT has an
9240 -- Associated_Final_Chain attribute designating it.)
9242 elsif No (Associated_Final_Chain (PtrT)) then
9243 Owner := Scope (PtrT);
9247 return Find_Final_List (Owner);
9248 end Get_Allocator_Final_List;
9250 ---------------------------------
9251 -- Has_Inferable_Discriminants --
9252 ---------------------------------
9254 function Has_Inferable_Discriminants (N : Node_Id) return Boolean is
9256 function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean;
9257 -- Determines whether the left-most prefix of a selected component is a
9258 -- formal parameter in a subprogram. Assumes N is a selected component.
9260 --------------------------------
9261 -- Prefix_Is_Formal_Parameter --
9262 --------------------------------
9264 function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean is
9265 Sel_Comp : Node_Id := N;
9268 -- Move to the left-most prefix by climbing up the tree
9270 while Present (Parent (Sel_Comp))
9271 and then Nkind (Parent (Sel_Comp)) = N_Selected_Component
9273 Sel_Comp := Parent (Sel_Comp);
9276 return Ekind (Entity (Prefix (Sel_Comp))) in Formal_Kind;
9277 end Prefix_Is_Formal_Parameter;
9279 -- Start of processing for Has_Inferable_Discriminants
9282 -- For identifiers and indexed components, it is sufficient to have a
9283 -- constrained Unchecked_Union nominal subtype.
9285 if Nkind_In (N, N_Identifier, N_Indexed_Component) then
9286 return Is_Unchecked_Union (Base_Type (Etype (N)))
9288 Is_Constrained (Etype (N));
9290 -- For selected components, the subtype of the selector must be a
9291 -- constrained Unchecked_Union. If the component is subject to a
9292 -- per-object constraint, then the enclosing object must have inferable
9295 elsif Nkind (N) = N_Selected_Component then
9296 if Has_Per_Object_Constraint (Entity (Selector_Name (N))) then
9298 -- A small hack. If we have a per-object constrained selected
9299 -- component of a formal parameter, return True since we do not
9300 -- know the actual parameter association yet.
9302 if Prefix_Is_Formal_Parameter (N) then
9306 -- Otherwise, check the enclosing object and the selector
9308 return Has_Inferable_Discriminants (Prefix (N))
9310 Has_Inferable_Discriminants (Selector_Name (N));
9313 -- The call to Has_Inferable_Discriminants will determine whether
9314 -- the selector has a constrained Unchecked_Union nominal type.
9316 return Has_Inferable_Discriminants (Selector_Name (N));
9318 -- A qualified expression has inferable discriminants if its subtype
9319 -- mark is a constrained Unchecked_Union subtype.
9321 elsif Nkind (N) = N_Qualified_Expression then
9322 return Is_Unchecked_Union (Subtype_Mark (N))
9324 Is_Constrained (Subtype_Mark (N));
9329 end Has_Inferable_Discriminants;
9331 -------------------------------
9332 -- Insert_Dereference_Action --
9333 -------------------------------
9335 procedure Insert_Dereference_Action (N : Node_Id) is
9336 Loc : constant Source_Ptr := Sloc (N);
9337 Typ : constant Entity_Id := Etype (N);
9338 Pool : constant Entity_Id := Associated_Storage_Pool (Typ);
9339 Pnod : constant Node_Id := Parent (N);
9341 function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean;
9342 -- Return true if type of P is derived from Checked_Pool;
9344 -----------------------------
9345 -- Is_Checked_Storage_Pool --
9346 -----------------------------
9348 function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean is
9357 while T /= Etype (T) loop
9358 if Is_RTE (T, RE_Checked_Pool) then
9366 end Is_Checked_Storage_Pool;
9368 -- Start of processing for Insert_Dereference_Action
9371 pragma Assert (Nkind (Pnod) = N_Explicit_Dereference);
9373 if not (Is_Checked_Storage_Pool (Pool)
9374 and then Comes_From_Source (Original_Node (Pnod)))
9380 Make_Procedure_Call_Statement (Loc,
9381 Name => New_Reference_To (
9382 Find_Prim_Op (Etype (Pool), Name_Dereference), Loc),
9384 Parameter_Associations => New_List (
9388 New_Reference_To (Pool, Loc),
9390 -- Storage_Address. We use the attribute Pool_Address, which uses
9391 -- the pointer itself to find the address of the object, and which
9392 -- handles unconstrained arrays properly by computing the address
9393 -- of the template. i.e. the correct address of the corresponding
9396 Make_Attribute_Reference (Loc,
9397 Prefix => Duplicate_Subexpr_Move_Checks (N),
9398 Attribute_Name => Name_Pool_Address),
9400 -- Size_In_Storage_Elements
9402 Make_Op_Divide (Loc,
9404 Make_Attribute_Reference (Loc,
9406 Make_Explicit_Dereference (Loc,
9407 Duplicate_Subexpr_Move_Checks (N)),
9408 Attribute_Name => Name_Size),
9410 Make_Integer_Literal (Loc, System_Storage_Unit)),
9414 Make_Attribute_Reference (Loc,
9416 Make_Explicit_Dereference (Loc,
9417 Duplicate_Subexpr_Move_Checks (N)),
9418 Attribute_Name => Name_Alignment))));
9421 when RE_Not_Available =>
9423 end Insert_Dereference_Action;
9425 --------------------------------
9426 -- Integer_Promotion_Possible --
9427 --------------------------------
9429 function Integer_Promotion_Possible (N : Node_Id) return Boolean is
9430 Operand : constant Node_Id := Expression (N);
9431 Operand_Type : constant Entity_Id := Etype (Operand);
9432 Root_Operand_Type : constant Entity_Id := Root_Type (Operand_Type);
9435 pragma Assert (Nkind (N) = N_Type_Conversion);
9439 -- We only do the transformation for source constructs. We assume
9440 -- that the expander knows what it is doing when it generates code.
9442 Comes_From_Source (N)
9444 -- If the operand type is Short_Integer or Short_Short_Integer,
9445 -- then we will promote to Integer, which is available on all
9446 -- targets, and is sufficient to ensure no intermediate overflow.
9447 -- Furthermore it is likely to be as efficient or more efficient
9448 -- than using the smaller type for the computation so we do this
9452 (Root_Operand_Type = Base_Type (Standard_Short_Integer)
9454 Root_Operand_Type = Base_Type (Standard_Short_Short_Integer))
9456 -- Test for interesting operation, which includes addition,
9457 -- division, exponentiation, multiplication, subtraction, absolute
9458 -- value and unary negation. Unary "+" is omitted since it is a
9459 -- no-op and thus can't overflow.
9461 and then Nkind_In (Operand, N_Op_Abs,
9468 end Integer_Promotion_Possible;
9470 ------------------------------
9471 -- Make_Array_Comparison_Op --
9472 ------------------------------
9474 -- This is a hand-coded expansion of the following generic function:
9477 -- type elem is (<>);
9478 -- type index is (<>);
9479 -- type a is array (index range <>) of elem;
9481 -- function Gnnn (X : a; Y: a) return boolean is
9482 -- J : index := Y'first;
9485 -- if X'length = 0 then
9488 -- elsif Y'length = 0 then
9492 -- for I in X'range loop
9493 -- if X (I) = Y (J) then
9494 -- if J = Y'last then
9497 -- J := index'succ (J);
9501 -- return X (I) > Y (J);
9505 -- return X'length > Y'length;
9509 -- Note that since we are essentially doing this expansion by hand, we
9510 -- do not need to generate an actual or formal generic part, just the
9511 -- instantiated function itself.
9513 function Make_Array_Comparison_Op
9515 Nod : Node_Id) return Node_Id
9517 Loc : constant Source_Ptr := Sloc (Nod);
9519 X : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uX);
9520 Y : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uY);
9521 I : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uI);
9522 J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ);
9524 Index : constant Entity_Id := Base_Type (Etype (First_Index (Typ)));
9526 Loop_Statement : Node_Id;
9527 Loop_Body : Node_Id;
9530 Final_Expr : Node_Id;
9531 Func_Body : Node_Id;
9532 Func_Name : Entity_Id;
9538 -- if J = Y'last then
9541 -- J := index'succ (J);
9545 Make_Implicit_If_Statement (Nod,
9548 Left_Opnd => New_Reference_To (J, Loc),
9550 Make_Attribute_Reference (Loc,
9551 Prefix => New_Reference_To (Y, Loc),
9552 Attribute_Name => Name_Last)),
9554 Then_Statements => New_List (
9555 Make_Exit_Statement (Loc)),
9559 Make_Assignment_Statement (Loc,
9560 Name => New_Reference_To (J, Loc),
9562 Make_Attribute_Reference (Loc,
9563 Prefix => New_Reference_To (Index, Loc),
9564 Attribute_Name => Name_Succ,
9565 Expressions => New_List (New_Reference_To (J, Loc))))));
9567 -- if X (I) = Y (J) then
9570 -- return X (I) > Y (J);
9574 Make_Implicit_If_Statement (Nod,
9578 Make_Indexed_Component (Loc,
9579 Prefix => New_Reference_To (X, Loc),
9580 Expressions => New_List (New_Reference_To (I, Loc))),
9583 Make_Indexed_Component (Loc,
9584 Prefix => New_Reference_To (Y, Loc),
9585 Expressions => New_List (New_Reference_To (J, Loc)))),
9587 Then_Statements => New_List (Inner_If),
9589 Else_Statements => New_List (
9590 Make_Simple_Return_Statement (Loc,
9594 Make_Indexed_Component (Loc,
9595 Prefix => New_Reference_To (X, Loc),
9596 Expressions => New_List (New_Reference_To (I, Loc))),
9599 Make_Indexed_Component (Loc,
9600 Prefix => New_Reference_To (Y, Loc),
9601 Expressions => New_List (
9602 New_Reference_To (J, Loc)))))));
9604 -- for I in X'range loop
9609 Make_Implicit_Loop_Statement (Nod,
9610 Identifier => Empty,
9613 Make_Iteration_Scheme (Loc,
9614 Loop_Parameter_Specification =>
9615 Make_Loop_Parameter_Specification (Loc,
9616 Defining_Identifier => I,
9617 Discrete_Subtype_Definition =>
9618 Make_Attribute_Reference (Loc,
9619 Prefix => New_Reference_To (X, Loc),
9620 Attribute_Name => Name_Range))),
9622 Statements => New_List (Loop_Body));
9624 -- if X'length = 0 then
9626 -- elsif Y'length = 0 then
9629 -- for ... loop ... end loop;
9630 -- return X'length > Y'length;
9634 Make_Attribute_Reference (Loc,
9635 Prefix => New_Reference_To (X, Loc),
9636 Attribute_Name => Name_Length);
9639 Make_Attribute_Reference (Loc,
9640 Prefix => New_Reference_To (Y, Loc),
9641 Attribute_Name => Name_Length);
9645 Left_Opnd => Length1,
9646 Right_Opnd => Length2);
9649 Make_Implicit_If_Statement (Nod,
9653 Make_Attribute_Reference (Loc,
9654 Prefix => New_Reference_To (X, Loc),
9655 Attribute_Name => Name_Length),
9657 Make_Integer_Literal (Loc, 0)),
9661 Make_Simple_Return_Statement (Loc,
9662 Expression => New_Reference_To (Standard_False, Loc))),
9664 Elsif_Parts => New_List (
9665 Make_Elsif_Part (Loc,
9669 Make_Attribute_Reference (Loc,
9670 Prefix => New_Reference_To (Y, Loc),
9671 Attribute_Name => Name_Length),
9673 Make_Integer_Literal (Loc, 0)),
9677 Make_Simple_Return_Statement (Loc,
9678 Expression => New_Reference_To (Standard_True, Loc))))),
9680 Else_Statements => New_List (
9682 Make_Simple_Return_Statement (Loc,
9683 Expression => Final_Expr)));
9687 Formals := New_List (
9688 Make_Parameter_Specification (Loc,
9689 Defining_Identifier => X,
9690 Parameter_Type => New_Reference_To (Typ, Loc)),
9692 Make_Parameter_Specification (Loc,
9693 Defining_Identifier => Y,
9694 Parameter_Type => New_Reference_To (Typ, Loc)));
9696 -- function Gnnn (...) return boolean is
9697 -- J : index := Y'first;
9702 Func_Name := Make_Temporary (Loc, 'G');
9705 Make_Subprogram_Body (Loc,
9707 Make_Function_Specification (Loc,
9708 Defining_Unit_Name => Func_Name,
9709 Parameter_Specifications => Formals,
9710 Result_Definition => New_Reference_To (Standard_Boolean, Loc)),
9712 Declarations => New_List (
9713 Make_Object_Declaration (Loc,
9714 Defining_Identifier => J,
9715 Object_Definition => New_Reference_To (Index, Loc),
9717 Make_Attribute_Reference (Loc,
9718 Prefix => New_Reference_To (Y, Loc),
9719 Attribute_Name => Name_First))),
9721 Handled_Statement_Sequence =>
9722 Make_Handled_Sequence_Of_Statements (Loc,
9723 Statements => New_List (If_Stat)));
9726 end Make_Array_Comparison_Op;
9728 ---------------------------
9729 -- Make_Boolean_Array_Op --
9730 ---------------------------
9732 -- For logical operations on boolean arrays, expand in line the following,
9733 -- replacing 'and' with 'or' or 'xor' where needed:
9735 -- function Annn (A : typ; B: typ) return typ is
9738 -- for J in A'range loop
9739 -- C (J) := A (J) op B (J);
9744 -- Here typ is the boolean array type
9746 function Make_Boolean_Array_Op
9748 N : Node_Id) return Node_Id
9750 Loc : constant Source_Ptr := Sloc (N);
9752 A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA);
9753 B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB);
9754 C : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uC);
9755 J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ);
9763 Func_Name : Entity_Id;
9764 Func_Body : Node_Id;
9765 Loop_Statement : Node_Id;
9769 Make_Indexed_Component (Loc,
9770 Prefix => New_Reference_To (A, Loc),
9771 Expressions => New_List (New_Reference_To (J, Loc)));
9774 Make_Indexed_Component (Loc,
9775 Prefix => New_Reference_To (B, Loc),
9776 Expressions => New_List (New_Reference_To (J, Loc)));
9779 Make_Indexed_Component (Loc,
9780 Prefix => New_Reference_To (C, Loc),
9781 Expressions => New_List (New_Reference_To (J, Loc)));
9783 if Nkind (N) = N_Op_And then
9789 elsif Nkind (N) = N_Op_Or then
9803 Make_Implicit_Loop_Statement (N,
9804 Identifier => Empty,
9807 Make_Iteration_Scheme (Loc,
9808 Loop_Parameter_Specification =>
9809 Make_Loop_Parameter_Specification (Loc,
9810 Defining_Identifier => J,
9811 Discrete_Subtype_Definition =>
9812 Make_Attribute_Reference (Loc,
9813 Prefix => New_Reference_To (A, Loc),
9814 Attribute_Name => Name_Range))),
9816 Statements => New_List (
9817 Make_Assignment_Statement (Loc,
9819 Expression => Op)));
9821 Formals := New_List (
9822 Make_Parameter_Specification (Loc,
9823 Defining_Identifier => A,
9824 Parameter_Type => New_Reference_To (Typ, Loc)),
9826 Make_Parameter_Specification (Loc,
9827 Defining_Identifier => B,
9828 Parameter_Type => New_Reference_To (Typ, Loc)));
9830 Func_Name := Make_Temporary (Loc, 'A');
9831 Set_Is_Inlined (Func_Name);
9834 Make_Subprogram_Body (Loc,
9836 Make_Function_Specification (Loc,
9837 Defining_Unit_Name => Func_Name,
9838 Parameter_Specifications => Formals,
9839 Result_Definition => New_Reference_To (Typ, Loc)),
9841 Declarations => New_List (
9842 Make_Object_Declaration (Loc,
9843 Defining_Identifier => C,
9844 Object_Definition => New_Reference_To (Typ, Loc))),
9846 Handled_Statement_Sequence =>
9847 Make_Handled_Sequence_Of_Statements (Loc,
9848 Statements => New_List (
9850 Make_Simple_Return_Statement (Loc,
9851 Expression => New_Reference_To (C, Loc)))));
9854 end Make_Boolean_Array_Op;
9856 ------------------------
9857 -- Rewrite_Comparison --
9858 ------------------------
9860 procedure Rewrite_Comparison (N : Node_Id) is
9861 Warning_Generated : Boolean := False;
9862 -- Set to True if first pass with Assume_Valid generates a warning in
9863 -- which case we skip the second pass to avoid warning overloaded.
9866 -- Set to Standard_True or Standard_False
9869 if Nkind (N) = N_Type_Conversion then
9870 Rewrite_Comparison (Expression (N));
9873 elsif Nkind (N) not in N_Op_Compare then
9877 -- Now start looking at the comparison in detail. We potentially go
9878 -- through this loop twice. The first time, Assume_Valid is set False
9879 -- in the call to Compile_Time_Compare. If this call results in a
9880 -- clear result of always True or Always False, that's decisive and
9881 -- we are done. Otherwise we repeat the processing with Assume_Valid
9882 -- set to True to generate additional warnings. We can skip that step
9883 -- if Constant_Condition_Warnings is False.
9885 for AV in False .. True loop
9887 Typ : constant Entity_Id := Etype (N);
9888 Op1 : constant Node_Id := Left_Opnd (N);
9889 Op2 : constant Node_Id := Right_Opnd (N);
9891 Res : constant Compare_Result :=
9892 Compile_Time_Compare (Op1, Op2, Assume_Valid => AV);
9893 -- Res indicates if compare outcome can be compile time determined
9895 True_Result : Boolean;
9896 False_Result : Boolean;
9899 case N_Op_Compare (Nkind (N)) is
9901 True_Result := Res = EQ;
9902 False_Result := Res = LT or else Res = GT or else Res = NE;
9905 True_Result := Res in Compare_GE;
9906 False_Result := Res = LT;
9909 and then Constant_Condition_Warnings
9910 and then Comes_From_Source (Original_Node (N))
9911 and then Nkind (Original_Node (N)) = N_Op_Ge
9912 and then not In_Instance
9913 and then Is_Integer_Type (Etype (Left_Opnd (N)))
9914 and then not Has_Warnings_Off (Etype (Left_Opnd (N)))
9917 ("can never be greater than, could replace by ""'=""?", N);
9918 Warning_Generated := True;
9922 True_Result := Res = GT;
9923 False_Result := Res in Compare_LE;
9926 True_Result := Res = LT;
9927 False_Result := Res in Compare_GE;
9930 True_Result := Res in Compare_LE;
9931 False_Result := Res = GT;
9934 and then Constant_Condition_Warnings
9935 and then Comes_From_Source (Original_Node (N))
9936 and then Nkind (Original_Node (N)) = N_Op_Le
9937 and then not In_Instance
9938 and then Is_Integer_Type (Etype (Left_Opnd (N)))
9939 and then not Has_Warnings_Off (Etype (Left_Opnd (N)))
9942 ("can never be less than, could replace by ""'=""?", N);
9943 Warning_Generated := True;
9947 True_Result := Res = NE or else Res = GT or else Res = LT;
9948 False_Result := Res = EQ;
9951 -- If this is the first iteration, then we actually convert the
9952 -- comparison into True or False, if the result is certain.
9955 if True_Result or False_Result then
9957 Result := Standard_True;
9959 Result := Standard_False;
9964 New_Occurrence_Of (Result, Sloc (N))));
9965 Analyze_And_Resolve (N, Typ);
9966 Warn_On_Known_Condition (N);
9970 -- If this is the second iteration (AV = True), and the original
9971 -- node comes from source and we are not in an instance, then give
9972 -- a warning if we know result would be True or False. Note: we
9973 -- know Constant_Condition_Warnings is set if we get here.
9975 elsif Comes_From_Source (Original_Node (N))
9976 and then not In_Instance
9980 ("condition can only be False if invalid values present?",
9982 elsif False_Result then
9984 ("condition can only be True if invalid values present?",
9990 -- Skip second iteration if not warning on constant conditions or
9991 -- if the first iteration already generated a warning of some kind or
9992 -- if we are in any case assuming all values are valid (so that the
9993 -- first iteration took care of the valid case).
9995 exit when not Constant_Condition_Warnings;
9996 exit when Warning_Generated;
9997 exit when Assume_No_Invalid_Values;
9999 end Rewrite_Comparison;
10001 ----------------------------
10002 -- Safe_In_Place_Array_Op --
10003 ----------------------------
10005 function Safe_In_Place_Array_Op
10008 Op2 : Node_Id) return Boolean
10010 Target : Entity_Id;
10012 function Is_Safe_Operand (Op : Node_Id) return Boolean;
10013 -- Operand is safe if it cannot overlap part of the target of the
10014 -- operation. If the operand and the target are identical, the operand
10015 -- is safe. The operand can be empty in the case of negation.
10017 function Is_Unaliased (N : Node_Id) return Boolean;
10018 -- Check that N is a stand-alone entity
10024 function Is_Unaliased (N : Node_Id) return Boolean is
10028 and then No (Address_Clause (Entity (N)))
10029 and then No (Renamed_Object (Entity (N)));
10032 ---------------------
10033 -- Is_Safe_Operand --
10034 ---------------------
10036 function Is_Safe_Operand (Op : Node_Id) return Boolean is
10041 elsif Is_Entity_Name (Op) then
10042 return Is_Unaliased (Op);
10044 elsif Nkind_In (Op, N_Indexed_Component, N_Selected_Component) then
10045 return Is_Unaliased (Prefix (Op));
10047 elsif Nkind (Op) = N_Slice then
10049 Is_Unaliased (Prefix (Op))
10050 and then Entity (Prefix (Op)) /= Target;
10052 elsif Nkind (Op) = N_Op_Not then
10053 return Is_Safe_Operand (Right_Opnd (Op));
10058 end Is_Safe_Operand;
10060 -- Start of processing for Is_Safe_In_Place_Array_Op
10063 -- Skip this processing if the component size is different from system
10064 -- storage unit (since at least for NOT this would cause problems).
10066 if Component_Size (Etype (Lhs)) /= System_Storage_Unit then
10069 -- Cannot do in place stuff on VM_Target since cannot pass addresses
10071 elsif VM_Target /= No_VM then
10074 -- Cannot do in place stuff if non-standard Boolean representation
10076 elsif Has_Non_Standard_Rep (Component_Type (Etype (Lhs))) then
10079 elsif not Is_Unaliased (Lhs) then
10083 Target := Entity (Lhs);
10084 return Is_Safe_Operand (Op1) and then Is_Safe_Operand (Op2);
10086 end Safe_In_Place_Array_Op;
10088 -----------------------
10089 -- Tagged_Membership --
10090 -----------------------
10092 -- There are two different cases to consider depending on whether the right
10093 -- operand is a class-wide type or not. If not we just compare the actual
10094 -- tag of the left expr to the target type tag:
10096 -- Left_Expr.Tag = Right_Type'Tag;
10098 -- If it is a class-wide type we use the RT function CW_Membership which is
10099 -- usually implemented by looking in the ancestor tables contained in the
10100 -- dispatch table pointed by Left_Expr.Tag for Typ'Tag
10102 -- Ada 2005 (AI-251): If it is a class-wide interface type we use the RT
10103 -- function IW_Membership which is usually implemented by looking in the
10104 -- table of abstract interface types plus the ancestor table contained in
10105 -- the dispatch table pointed by Left_Expr.Tag for Typ'Tag
10107 procedure Tagged_Membership
10109 SCIL_Node : out Node_Id;
10110 Result : out Node_Id)
10112 Left : constant Node_Id := Left_Opnd (N);
10113 Right : constant Node_Id := Right_Opnd (N);
10114 Loc : constant Source_Ptr := Sloc (N);
10116 Left_Type : Entity_Id;
10117 New_Node : Node_Id;
10118 Right_Type : Entity_Id;
10122 SCIL_Node := Empty;
10124 -- Handle entities from the limited view
10126 Left_Type := Available_View (Etype (Left));
10127 Right_Type := Available_View (Etype (Right));
10129 if Is_Class_Wide_Type (Left_Type) then
10130 Left_Type := Root_Type (Left_Type);
10134 Make_Selected_Component (Loc,
10135 Prefix => Relocate_Node (Left),
10137 New_Reference_To (First_Tag_Component (Left_Type), Loc));
10139 if Is_Class_Wide_Type (Right_Type) then
10141 -- No need to issue a run-time check if we statically know that the
10142 -- result of this membership test is always true. For example,
10143 -- considering the following declarations:
10145 -- type Iface is interface;
10146 -- type T is tagged null record;
10147 -- type DT is new T and Iface with null record;
10152 -- These membership tests are always true:
10155 -- Obj2 in T'Class;
10156 -- Obj2 in Iface'Class;
10158 -- We do not need to handle cases where the membership is illegal.
10161 -- Obj1 in DT'Class; -- Compile time error
10162 -- Obj1 in Iface'Class; -- Compile time error
10164 if not Is_Class_Wide_Type (Left_Type)
10165 and then (Is_Ancestor (Etype (Right_Type), Left_Type)
10166 or else (Is_Interface (Etype (Right_Type))
10167 and then Interface_Present_In_Ancestor
10169 Iface => Etype (Right_Type))))
10171 Result := New_Reference_To (Standard_True, Loc);
10175 -- Ada 2005 (AI-251): Class-wide applied to interfaces
10177 if Is_Interface (Etype (Class_Wide_Type (Right_Type)))
10179 -- Support to: "Iface_CW_Typ in Typ'Class"
10181 or else Is_Interface (Left_Type)
10183 -- Issue error if IW_Membership operation not available in a
10184 -- configurable run time setting.
10186 if not RTE_Available (RE_IW_Membership) then
10188 ("dynamic membership test on interface types", N);
10194 Make_Function_Call (Loc,
10195 Name => New_Occurrence_Of (RTE (RE_IW_Membership), Loc),
10196 Parameter_Associations => New_List (
10197 Make_Attribute_Reference (Loc,
10199 Attribute_Name => Name_Address),
10202 (Access_Disp_Table (Root_Type (Right_Type)))),
10205 -- Ada 95: Normal case
10208 Build_CW_Membership (Loc,
10209 Obj_Tag_Node => Obj_Tag,
10213 (Access_Disp_Table (Root_Type (Right_Type)))),
10216 New_Node => New_Node);
10218 -- Generate the SCIL node for this class-wide membership test.
10219 -- Done here because the previous call to Build_CW_Membership
10220 -- relocates Obj_Tag.
10222 if Generate_SCIL then
10223 SCIL_Node := Make_SCIL_Membership_Test (Sloc (N));
10224 Set_SCIL_Entity (SCIL_Node, Etype (Right_Type));
10225 Set_SCIL_Tag_Value (SCIL_Node, Obj_Tag);
10228 Result := New_Node;
10231 -- Right_Type is not a class-wide type
10234 -- No need to check the tag of the object if Right_Typ is abstract
10236 if Is_Abstract_Type (Right_Type) then
10237 Result := New_Reference_To (Standard_False, Loc);
10242 Left_Opnd => Obj_Tag,
10245 (Node (First_Elmt (Access_Disp_Table (Right_Type))), Loc));
10248 end Tagged_Membership;
10250 ------------------------------
10251 -- Unary_Op_Validity_Checks --
10252 ------------------------------
10254 procedure Unary_Op_Validity_Checks (N : Node_Id) is
10256 if Validity_Checks_On and Validity_Check_Operands then
10257 Ensure_Valid (Right_Opnd (N));
10259 end Unary_Op_Validity_Checks;
OSDN Git Service
