1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Checks; use Checks;
28 with Debug; use Debug;
29 with Einfo; use Einfo;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Exp_Aggr; use Exp_Aggr;
33 with Exp_Atag; use Exp_Atag;
34 with Exp_Ch3; use Exp_Ch3;
35 with Exp_Ch6; use Exp_Ch6;
36 with Exp_Ch7; use Exp_Ch7;
37 with Exp_Ch9; use Exp_Ch9;
38 with Exp_Disp; use Exp_Disp;
39 with Exp_Fixd; use Exp_Fixd;
40 with Exp_Pakd; use Exp_Pakd;
41 with Exp_Tss; use Exp_Tss;
42 with Exp_Util; use Exp_Util;
43 with Exp_VFpt; use Exp_VFpt;
44 with Freeze; use Freeze;
45 with Inline; use Inline;
46 with Namet; use Namet;
47 with Nlists; use Nlists;
48 with Nmake; use Nmake;
50 with Restrict; use Restrict;
51 with Rident; use Rident;
52 with Rtsfind; use Rtsfind;
54 with Sem_Aux; use Sem_Aux;
55 with Sem_Cat; use Sem_Cat;
56 with Sem_Ch3; use Sem_Ch3;
57 with Sem_Ch8; use Sem_Ch8;
58 with Sem_Ch13; use Sem_Ch13;
59 with Sem_Eval; use Sem_Eval;
60 with Sem_Res; use Sem_Res;
61 with Sem_Type; use Sem_Type;
62 with Sem_Util; use Sem_Util;
63 with Sem_Warn; use Sem_Warn;
64 with Sinfo; use Sinfo;
65 with Snames; use Snames;
66 with Stand; use Stand;
67 with Targparm; use Targparm;
68 with Tbuild; use Tbuild;
69 with Ttypes; use Ttypes;
70 with Uintp; use Uintp;
71 with Urealp; use Urealp;
72 with Validsw; use Validsw;
74 package body Exp_Ch4 is
76 -----------------------
77 -- Local Subprograms --
78 -----------------------
80 procedure Binary_Op_Validity_Checks (N : Node_Id);
81 pragma Inline (Binary_Op_Validity_Checks);
82 -- Performs validity checks for a binary operator
84 procedure Build_Boolean_Array_Proc_Call
88 -- If a boolean array assignment can be done in place, build call to
89 -- corresponding library procedure.
91 procedure Displace_Allocator_Pointer (N : Node_Id);
92 -- Ada 2005 (AI-251): Subsidiary procedure to Expand_N_Allocator and
93 -- Expand_Allocator_Expression. Allocating class-wide interface objects
94 -- this routine displaces the pointer to the allocated object to reference
95 -- the component referencing the corresponding secondary dispatch table.
97 procedure Expand_Allocator_Expression (N : Node_Id);
98 -- Subsidiary to Expand_N_Allocator, for the case when the expression
99 -- is a qualified expression or an aggregate.
101 procedure Expand_Array_Comparison (N : Node_Id);
102 -- This routine handles expansion of the comparison operators (N_Op_Lt,
103 -- N_Op_Le, N_Op_Gt, N_Op_Ge) when operating on an array type. The basic
104 -- code for these operators is similar, differing only in the details of
105 -- the actual comparison call that is made. Special processing (call a
108 function Expand_Array_Equality
113 Typ : Entity_Id) return Node_Id;
114 -- Expand an array equality into a call to a function implementing this
115 -- equality, and a call to it. Loc is the location for the generated nodes.
116 -- Lhs and Rhs are the array expressions to be compared. Bodies is a list
117 -- on which to attach bodies of local functions that are created in the
118 -- process. It is the responsibility of the caller to insert those bodies
119 -- at the right place. Nod provides the Sloc value for the generated code.
120 -- Normally the types used for the generated equality routine are taken
121 -- from Lhs and Rhs. However, in some situations of generated code, the
122 -- Etype fields of Lhs and Rhs are not set yet. In such cases, Typ supplies
123 -- the type to be used for the formal parameters.
125 procedure Expand_Boolean_Operator (N : Node_Id);
126 -- Common expansion processing for Boolean operators (And, Or, Xor) for the
127 -- case of array type arguments.
129 function Expand_Composite_Equality
134 Bodies : List_Id) return Node_Id;
135 -- Local recursive function used to expand equality for nested composite
136 -- types. Used by Expand_Record/Array_Equality, Bodies is a list on which
137 -- to attach bodies of local functions that are created in the process.
138 -- This is the responsibility of the caller to insert those bodies at the
139 -- right place. Nod provides the Sloc value for generated code. Lhs and Rhs
140 -- are the left and right sides for the comparison, and Typ is the type of
141 -- the arrays to compare.
143 procedure Expand_Concatenate (Cnode : Node_Id; Opnds : List_Id);
144 -- Routine to expand concatenation of a sequence of two or more operands
145 -- (in the list Operands) and replace node Cnode with the result of the
146 -- concatenation. The operands can be of any appropriate type, and can
147 -- include both arrays and singleton elements.
149 procedure Fixup_Universal_Fixed_Operation (N : Node_Id);
150 -- N is a N_Op_Divide or N_Op_Multiply node whose result is universal
151 -- fixed. We do not have such a type at runtime, so the purpose of this
152 -- routine is to find the real type by looking up the tree. We also
153 -- determine if the operation must be rounded.
155 function Get_Allocator_Final_List
158 PtrT : Entity_Id) return Entity_Id;
159 -- If the designated type is controlled, build final_list expression for
160 -- created object. If context is an access parameter, create a local access
161 -- type to have a usable finalization list.
163 function Has_Inferable_Discriminants (N : Node_Id) return Boolean;
164 -- Ada 2005 (AI-216): A view of an Unchecked_Union object has inferable
165 -- discriminants if it has a constrained nominal type, unless the object
166 -- is a component of an enclosing Unchecked_Union object that is subject
167 -- to a per-object constraint and the enclosing object lacks inferable
170 -- An expression of an Unchecked_Union type has inferable discriminants
171 -- if it is either a name of an object with inferable discriminants or a
172 -- qualified expression whose subtype mark denotes a constrained subtype.
174 procedure Insert_Dereference_Action (N : Node_Id);
175 -- N is an expression whose type is an access. When the type of the
176 -- associated storage pool is derived from Checked_Pool, generate a
177 -- call to the 'Dereference' primitive operation.
179 function Make_Array_Comparison_Op
181 Nod : Node_Id) return Node_Id;
182 -- Comparisons between arrays are expanded in line. This function produces
183 -- the body of the implementation of (a > b), where a and b are one-
184 -- dimensional arrays of some discrete type. The original node is then
185 -- expanded into the appropriate call to this function. Nod provides the
186 -- Sloc value for the generated code.
188 function Make_Boolean_Array_Op
190 N : Node_Id) return Node_Id;
191 -- Boolean operations on boolean arrays are expanded in line. This function
192 -- produce the body for the node N, which is (a and b), (a or b), or (a xor
193 -- b). It is used only the normal case and not the packed case. The type
194 -- involved, Typ, is the Boolean array type, and the logical operations in
195 -- the body are simple boolean operations. Note that Typ is always a
196 -- constrained type (the caller has ensured this by using
197 -- Convert_To_Actual_Subtype if necessary).
199 procedure Rewrite_Comparison (N : Node_Id);
200 -- If N is the node for a comparison whose outcome can be determined at
201 -- compile time, then the node N can be rewritten with True or False. If
202 -- the outcome cannot be determined at compile time, the call has no
203 -- effect. If N is a type conversion, then this processing is applied to
204 -- its expression. If N is neither comparison nor a type conversion, the
205 -- call has no effect.
207 function Tagged_Membership (N : Node_Id) return Node_Id;
208 -- Construct the expression corresponding to the tagged membership test.
209 -- Deals with a second operand being (or not) a class-wide type.
211 function Safe_In_Place_Array_Op
214 Op2 : Node_Id) return Boolean;
215 -- In the context of an assignment, where the right-hand side is a boolean
216 -- operation on arrays, check whether operation can be performed in place.
218 procedure Unary_Op_Validity_Checks (N : Node_Id);
219 pragma Inline (Unary_Op_Validity_Checks);
220 -- Performs validity checks for a unary operator
222 -------------------------------
223 -- Binary_Op_Validity_Checks --
224 -------------------------------
226 procedure Binary_Op_Validity_Checks (N : Node_Id) is
228 if Validity_Checks_On and Validity_Check_Operands then
229 Ensure_Valid (Left_Opnd (N));
230 Ensure_Valid (Right_Opnd (N));
232 end Binary_Op_Validity_Checks;
234 ------------------------------------
235 -- Build_Boolean_Array_Proc_Call --
236 ------------------------------------
238 procedure Build_Boolean_Array_Proc_Call
243 Loc : constant Source_Ptr := Sloc (N);
244 Kind : constant Node_Kind := Nkind (Expression (N));
245 Target : constant Node_Id :=
246 Make_Attribute_Reference (Loc,
248 Attribute_Name => Name_Address);
250 Arg1 : constant Node_Id := Op1;
251 Arg2 : Node_Id := Op2;
253 Proc_Name : Entity_Id;
256 if Kind = N_Op_Not then
257 if Nkind (Op1) in N_Binary_Op then
259 -- Use negated version of the binary operators
261 if Nkind (Op1) = N_Op_And then
262 Proc_Name := RTE (RE_Vector_Nand);
264 elsif Nkind (Op1) = N_Op_Or then
265 Proc_Name := RTE (RE_Vector_Nor);
267 else pragma Assert (Nkind (Op1) = N_Op_Xor);
268 Proc_Name := RTE (RE_Vector_Xor);
272 Make_Procedure_Call_Statement (Loc,
273 Name => New_Occurrence_Of (Proc_Name, Loc),
275 Parameter_Associations => New_List (
277 Make_Attribute_Reference (Loc,
278 Prefix => Left_Opnd (Op1),
279 Attribute_Name => Name_Address),
281 Make_Attribute_Reference (Loc,
282 Prefix => Right_Opnd (Op1),
283 Attribute_Name => Name_Address),
285 Make_Attribute_Reference (Loc,
286 Prefix => Left_Opnd (Op1),
287 Attribute_Name => Name_Length)));
290 Proc_Name := RTE (RE_Vector_Not);
293 Make_Procedure_Call_Statement (Loc,
294 Name => New_Occurrence_Of (Proc_Name, Loc),
295 Parameter_Associations => New_List (
298 Make_Attribute_Reference (Loc,
300 Attribute_Name => Name_Address),
302 Make_Attribute_Reference (Loc,
304 Attribute_Name => Name_Length)));
308 -- We use the following equivalences:
310 -- (not X) or (not Y) = not (X and Y) = Nand (X, Y)
311 -- (not X) and (not Y) = not (X or Y) = Nor (X, Y)
312 -- (not X) xor (not Y) = X xor Y
313 -- X xor (not Y) = not (X xor Y) = Nxor (X, Y)
315 if Nkind (Op1) = N_Op_Not then
316 if Kind = N_Op_And then
317 Proc_Name := RTE (RE_Vector_Nor);
319 elsif Kind = N_Op_Or then
320 Proc_Name := RTE (RE_Vector_Nand);
323 Proc_Name := RTE (RE_Vector_Xor);
327 if Kind = N_Op_And then
328 Proc_Name := RTE (RE_Vector_And);
330 elsif Kind = N_Op_Or then
331 Proc_Name := RTE (RE_Vector_Or);
333 elsif Nkind (Op2) = N_Op_Not then
334 Proc_Name := RTE (RE_Vector_Nxor);
335 Arg2 := Right_Opnd (Op2);
338 Proc_Name := RTE (RE_Vector_Xor);
343 Make_Procedure_Call_Statement (Loc,
344 Name => New_Occurrence_Of (Proc_Name, Loc),
345 Parameter_Associations => New_List (
347 Make_Attribute_Reference (Loc,
349 Attribute_Name => Name_Address),
350 Make_Attribute_Reference (Loc,
352 Attribute_Name => Name_Address),
353 Make_Attribute_Reference (Loc,
355 Attribute_Name => Name_Length)));
358 Rewrite (N, Call_Node);
362 when RE_Not_Available =>
364 end Build_Boolean_Array_Proc_Call;
366 --------------------------------
367 -- Displace_Allocator_Pointer --
368 --------------------------------
370 procedure Displace_Allocator_Pointer (N : Node_Id) is
371 Loc : constant Source_Ptr := Sloc (N);
372 Orig_Node : constant Node_Id := Original_Node (N);
378 -- Do nothing in case of VM targets: the virtual machine will handle
379 -- interfaces directly.
381 if VM_Target /= No_VM then
385 pragma Assert (Nkind (N) = N_Identifier
386 and then Nkind (Orig_Node) = N_Allocator);
388 PtrT := Etype (Orig_Node);
389 Dtyp := Designated_Type (PtrT);
390 Etyp := Etype (Expression (Orig_Node));
392 if Is_Class_Wide_Type (Dtyp)
393 and then Is_Interface (Dtyp)
395 -- If the type of the allocator expression is not an interface type
396 -- we can generate code to reference the record component containing
397 -- the pointer to the secondary dispatch table.
399 if not Is_Interface (Etyp) then
401 Saved_Typ : constant Entity_Id := Etype (Orig_Node);
404 -- 1) Get access to the allocated object
407 Make_Explicit_Dereference (Loc,
412 -- 2) Add the conversion to displace the pointer to reference
413 -- the secondary dispatch table.
415 Rewrite (N, Convert_To (Dtyp, Relocate_Node (N)));
416 Analyze_And_Resolve (N, Dtyp);
418 -- 3) The 'access to the secondary dispatch table will be used
419 -- as the value returned by the allocator.
422 Make_Attribute_Reference (Loc,
423 Prefix => Relocate_Node (N),
424 Attribute_Name => Name_Access));
425 Set_Etype (N, Saved_Typ);
429 -- If the type of the allocator expression is an interface type we
430 -- generate a run-time call to displace "this" to reference the
431 -- component containing the pointer to the secondary dispatch table
432 -- or else raise Constraint_Error if the actual object does not
433 -- implement the target interface. This case corresponds with the
434 -- following example:
436 -- function Op (Obj : Iface_1'Class) return access Iface_2'Class is
438 -- return new Iface_2'Class'(Obj);
443 Unchecked_Convert_To (PtrT,
444 Make_Function_Call (Loc,
445 Name => New_Reference_To (RTE (RE_Displace), Loc),
446 Parameter_Associations => New_List (
447 Unchecked_Convert_To (RTE (RE_Address),
453 (Access_Disp_Table (Etype (Base_Type (Dtyp))))),
455 Analyze_And_Resolve (N, PtrT);
458 end Displace_Allocator_Pointer;
460 ---------------------------------
461 -- Expand_Allocator_Expression --
462 ---------------------------------
464 procedure Expand_Allocator_Expression (N : Node_Id) is
465 Loc : constant Source_Ptr := Sloc (N);
466 Exp : constant Node_Id := Expression (Expression (N));
467 PtrT : constant Entity_Id := Etype (N);
468 DesigT : constant Entity_Id := Designated_Type (PtrT);
470 procedure Apply_Accessibility_Check
472 Built_In_Place : Boolean := False);
473 -- Ada 2005 (AI-344): For an allocator with a class-wide designated
474 -- type, generate an accessibility check to verify that the level of the
475 -- type of the created object is not deeper than the level of the access
476 -- type. If the type of the qualified expression is class- wide, then
477 -- always generate the check (except in the case where it is known to be
478 -- unnecessary, see comment below). Otherwise, only generate the check
479 -- if the level of the qualified expression type is statically deeper
480 -- than the access type.
482 -- Although the static accessibility will generally have been performed
483 -- as a legality check, it won't have been done in cases where the
484 -- allocator appears in generic body, so a run-time check is needed in
485 -- general. One special case is when the access type is declared in the
486 -- same scope as the class-wide allocator, in which case the check can
487 -- never fail, so it need not be generated.
489 -- As an open issue, there seem to be cases where the static level
490 -- associated with the class-wide object's underlying type is not
491 -- sufficient to perform the proper accessibility check, such as for
492 -- allocators in nested subprograms or accept statements initialized by
493 -- class-wide formals when the actual originates outside at a deeper
494 -- static level. The nested subprogram case might require passing
495 -- accessibility levels along with class-wide parameters, and the task
496 -- case seems to be an actual gap in the language rules that needs to
497 -- be fixed by the ARG. ???
499 -------------------------------
500 -- Apply_Accessibility_Check --
501 -------------------------------
503 procedure Apply_Accessibility_Check
505 Built_In_Place : Boolean := False)
510 -- Note: we skip the accessibility check for the VM case, since
511 -- there does not seem to be any practical way of implementing it.
513 if Ada_Version >= Ada_05
514 and then VM_Target = No_VM
515 and then Is_Class_Wide_Type (DesigT)
516 and then not Scope_Suppress (Accessibility_Check)
518 (Type_Access_Level (Etype (Exp)) > Type_Access_Level (PtrT)
520 (Is_Class_Wide_Type (Etype (Exp))
521 and then Scope (PtrT) /= Current_Scope))
523 -- If the allocator was built in place Ref is already a reference
524 -- to the access object initialized to the result of the allocator
525 -- (see Exp_Ch6.Make_Build_In_Place_Call_In_Allocator). Otherwise
526 -- it is the entity associated with the object containing the
527 -- address of the allocated object.
529 if Built_In_Place then
530 Ref_Node := New_Copy (Ref);
532 Ref_Node := New_Reference_To (Ref, Loc);
536 Make_Raise_Program_Error (Loc,
540 Build_Get_Access_Level (Loc,
541 Make_Attribute_Reference (Loc,
543 Attribute_Name => Name_Tag)),
545 Make_Integer_Literal (Loc,
546 Type_Access_Level (PtrT))),
547 Reason => PE_Accessibility_Check_Failed));
549 end Apply_Accessibility_Check;
553 Indic : constant Node_Id := Subtype_Mark (Expression (N));
554 T : constant Entity_Id := Entity (Indic);
559 TagT : Entity_Id := Empty;
560 -- Type used as source for tag assignment
562 TagR : Node_Id := Empty;
563 -- Target reference for tag assignment
565 Aggr_In_Place : constant Boolean := Is_Delayed_Aggregate (Exp);
567 Tag_Assign : Node_Id;
570 -- Start of processing for Expand_Allocator_Expression
573 if Is_Tagged_Type (T) or else Needs_Finalization (T) then
575 -- Ada 2005 (AI-318-02): If the initialization expression is a call
576 -- to a build-in-place function, then access to the allocated object
577 -- must be passed to the function. Currently we limit such functions
578 -- to those with constrained limited result subtypes, but eventually
579 -- we plan to expand the allowed forms of functions that are treated
580 -- as build-in-place.
582 if Ada_Version >= Ada_05
583 and then Is_Build_In_Place_Function_Call (Exp)
585 Make_Build_In_Place_Call_In_Allocator (N, Exp);
586 Apply_Accessibility_Check (N, Built_In_Place => True);
590 -- Actions inserted before:
591 -- Temp : constant ptr_T := new T'(Expression);
592 -- <no CW> Temp._tag := T'tag;
593 -- <CTRL> Adjust (Finalizable (Temp.all));
594 -- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
596 -- We analyze by hand the new internal allocator to avoid
597 -- any recursion and inappropriate call to Initialize
599 -- We don't want to remove side effects when the expression must be
600 -- built in place. In the case of a build-in-place function call,
601 -- that could lead to a duplication of the call, which was already
602 -- substituted for the allocator.
604 if not Aggr_In_Place then
605 Remove_Side_Effects (Exp);
609 Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
611 -- For a class wide allocation generate the following code:
613 -- type Equiv_Record is record ... end record;
614 -- implicit subtype CW is <Class_Wide_Subytpe>;
615 -- temp : PtrT := new CW'(CW!(expr));
617 if Is_Class_Wide_Type (T) then
618 Expand_Subtype_From_Expr (Empty, T, Indic, Exp);
620 -- Ada 2005 (AI-251): If the expression is a class-wide interface
621 -- object we generate code to move up "this" to reference the
622 -- base of the object before allocating the new object.
624 -- Note that Exp'Address is recursively expanded into a call
625 -- to Base_Address (Exp.Tag)
627 if Is_Class_Wide_Type (Etype (Exp))
628 and then Is_Interface (Etype (Exp))
629 and then VM_Target = No_VM
633 Unchecked_Convert_To (Entity (Indic),
634 Make_Explicit_Dereference (Loc,
635 Unchecked_Convert_To (RTE (RE_Tag_Ptr),
636 Make_Attribute_Reference (Loc,
638 Attribute_Name => Name_Address)))));
643 Unchecked_Convert_To (Entity (Indic), Exp));
646 Analyze_And_Resolve (Expression (N), Entity (Indic));
649 -- Keep separate the management of allocators returning interfaces
651 if not Is_Interface (Directly_Designated_Type (PtrT)) then
652 if Aggr_In_Place then
654 Make_Object_Declaration (Loc,
655 Defining_Identifier => Temp,
656 Object_Definition => New_Reference_To (PtrT, Loc),
659 New_Reference_To (Etype (Exp), Loc)));
661 -- Copy the Comes_From_Source flag for the allocator we just
662 -- built, since logically this allocator is a replacement of
663 -- the original allocator node. This is for proper handling of
664 -- restriction No_Implicit_Heap_Allocations.
666 Set_Comes_From_Source
667 (Expression (Tmp_Node), Comes_From_Source (N));
669 Set_No_Initialization (Expression (Tmp_Node));
670 Insert_Action (N, Tmp_Node);
672 if Needs_Finalization (T)
673 and then Ekind (PtrT) = E_Anonymous_Access_Type
675 -- Create local finalization list for access parameter
677 Flist := Get_Allocator_Final_List (N, Base_Type (T), PtrT);
680 Convert_Aggr_In_Allocator (N, Tmp_Node, Exp);
683 Node := Relocate_Node (N);
686 Make_Object_Declaration (Loc,
687 Defining_Identifier => Temp,
688 Constant_Present => True,
689 Object_Definition => New_Reference_To (PtrT, Loc),
690 Expression => Node));
693 -- Ada 2005 (AI-251): Handle allocators whose designated type is an
694 -- interface type. In this case we use the type of the qualified
695 -- expression to allocate the object.
699 Def_Id : constant Entity_Id :=
700 Make_Defining_Identifier (Loc,
701 New_Internal_Name ('T'));
706 Make_Full_Type_Declaration (Loc,
707 Defining_Identifier => Def_Id,
709 Make_Access_To_Object_Definition (Loc,
711 Null_Exclusion_Present => False,
712 Constant_Present => False,
713 Subtype_Indication =>
714 New_Reference_To (Etype (Exp), Loc)));
716 Insert_Action (N, New_Decl);
718 -- Inherit the final chain to ensure that the expansion of the
719 -- aggregate is correct in case of controlled types
721 if Needs_Finalization (Directly_Designated_Type (PtrT)) then
722 Set_Associated_Final_Chain (Def_Id,
723 Associated_Final_Chain (PtrT));
726 -- Declare the object using the previous type declaration
728 if Aggr_In_Place then
730 Make_Object_Declaration (Loc,
731 Defining_Identifier => Temp,
732 Object_Definition => New_Reference_To (Def_Id, Loc),
735 New_Reference_To (Etype (Exp), Loc)));
737 -- Copy the Comes_From_Source flag for the allocator we just
738 -- built, since logically this allocator is a replacement of
739 -- the original allocator node. This is for proper handling
740 -- of restriction No_Implicit_Heap_Allocations.
742 Set_Comes_From_Source
743 (Expression (Tmp_Node), Comes_From_Source (N));
745 Set_No_Initialization (Expression (Tmp_Node));
746 Insert_Action (N, Tmp_Node);
748 if Needs_Finalization (T)
749 and then Ekind (PtrT) = E_Anonymous_Access_Type
751 -- Create local finalization list for access parameter
754 Get_Allocator_Final_List (N, Base_Type (T), PtrT);
757 Convert_Aggr_In_Allocator (N, Tmp_Node, Exp);
759 Node := Relocate_Node (N);
762 Make_Object_Declaration (Loc,
763 Defining_Identifier => Temp,
764 Constant_Present => True,
765 Object_Definition => New_Reference_To (Def_Id, Loc),
766 Expression => Node));
769 -- Generate an additional object containing the address of the
770 -- returned object. The type of this second object declaration
771 -- is the correct type required for the common processing that
772 -- is still performed by this subprogram. The displacement of
773 -- this pointer to reference the component associated with the
774 -- interface type will be done at the end of common processing.
777 Make_Object_Declaration (Loc,
778 Defining_Identifier => Make_Defining_Identifier (Loc,
779 New_Internal_Name ('P')),
780 Object_Definition => New_Reference_To (PtrT, Loc),
781 Expression => Unchecked_Convert_To (PtrT,
782 New_Reference_To (Temp, Loc)));
784 Insert_Action (N, New_Decl);
786 Tmp_Node := New_Decl;
787 Temp := Defining_Identifier (New_Decl);
791 Apply_Accessibility_Check (Temp);
793 -- Generate the tag assignment
795 -- Suppress the tag assignment when VM_Target because VM tags are
796 -- represented implicitly in objects.
798 if VM_Target /= No_VM then
801 -- Ada 2005 (AI-251): Suppress the tag assignment with class-wide
802 -- interface objects because in this case the tag does not change.
804 elsif Is_Interface (Directly_Designated_Type (Etype (N))) then
805 pragma Assert (Is_Class_Wide_Type
806 (Directly_Designated_Type (Etype (N))));
809 elsif Is_Tagged_Type (T) and then not Is_Class_Wide_Type (T) then
811 TagR := New_Reference_To (Temp, Loc);
813 elsif Is_Private_Type (T)
814 and then Is_Tagged_Type (Underlying_Type (T))
816 TagT := Underlying_Type (T);
818 Unchecked_Convert_To (Underlying_Type (T),
819 Make_Explicit_Dereference (Loc,
820 Prefix => New_Reference_To (Temp, Loc)));
823 if Present (TagT) then
825 Make_Assignment_Statement (Loc,
827 Make_Selected_Component (Loc,
830 New_Reference_To (First_Tag_Component (TagT), Loc)),
833 Unchecked_Convert_To (RTE (RE_Tag),
835 (Elists.Node (First_Elmt (Access_Disp_Table (TagT))),
838 -- The previous assignment has to be done in any case
840 Set_Assignment_OK (Name (Tag_Assign));
841 Insert_Action (N, Tag_Assign);
844 if Needs_Finalization (DesigT)
845 and then Needs_Finalization (T)
849 Apool : constant Entity_Id :=
850 Associated_Storage_Pool (PtrT);
853 -- If it is an allocation on the secondary stack (i.e. a value
854 -- returned from a function), the object is attached on the
855 -- caller side as soon as the call is completed (see
856 -- Expand_Ctrl_Function_Call)
858 if Is_RTE (Apool, RE_SS_Pool) then
860 F : constant Entity_Id :=
861 Make_Defining_Identifier (Loc,
862 New_Internal_Name ('F'));
865 Make_Object_Declaration (Loc,
866 Defining_Identifier => F,
867 Object_Definition => New_Reference_To (RTE
868 (RE_Finalizable_Ptr), Loc)));
870 Flist := New_Reference_To (F, Loc);
871 Attach := Make_Integer_Literal (Loc, 1);
874 -- Normal case, not a secondary stack allocation
877 if Needs_Finalization (T)
878 and then Ekind (PtrT) = E_Anonymous_Access_Type
880 -- Create local finalization list for access parameter
883 Get_Allocator_Final_List (N, Base_Type (T), PtrT);
885 Flist := Find_Final_List (PtrT);
888 Attach := Make_Integer_Literal (Loc, 2);
891 -- Generate an Adjust call if the object will be moved. In Ada
892 -- 2005, the object may be inherently limited, in which case
893 -- there is no Adjust procedure, and the object is built in
894 -- place. In Ada 95, the object can be limited but not
895 -- inherently limited if this allocator came from a return
896 -- statement (we're allocating the result on the secondary
897 -- stack). In that case, the object will be moved, so we _do_
901 and then not Is_Inherently_Limited_Type (T)
907 -- An unchecked conversion is needed in the classwide
908 -- case because the designated type can be an ancestor of
909 -- the subtype mark of the allocator.
911 Unchecked_Convert_To (T,
912 Make_Explicit_Dereference (Loc,
913 Prefix => New_Reference_To (Temp, Loc))),
917 With_Attach => Attach,
923 Rewrite (N, New_Reference_To (Temp, Loc));
924 Analyze_And_Resolve (N, PtrT);
926 -- Ada 2005 (AI-251): Displace the pointer to reference the record
927 -- component containing the secondary dispatch table of the interface
930 if Is_Interface (Directly_Designated_Type (PtrT)) then
931 Displace_Allocator_Pointer (N);
934 elsif Aggr_In_Place then
936 Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
938 Make_Object_Declaration (Loc,
939 Defining_Identifier => Temp,
940 Object_Definition => New_Reference_To (PtrT, Loc),
941 Expression => Make_Allocator (Loc,
942 New_Reference_To (Etype (Exp), Loc)));
944 -- Copy the Comes_From_Source flag for the allocator we just built,
945 -- since logically this allocator is a replacement of the original
946 -- allocator node. This is for proper handling of restriction
947 -- No_Implicit_Heap_Allocations.
949 Set_Comes_From_Source
950 (Expression (Tmp_Node), Comes_From_Source (N));
952 Set_No_Initialization (Expression (Tmp_Node));
953 Insert_Action (N, Tmp_Node);
954 Convert_Aggr_In_Allocator (N, Tmp_Node, Exp);
955 Rewrite (N, New_Reference_To (Temp, Loc));
956 Analyze_And_Resolve (N, PtrT);
958 elsif Is_Access_Type (T)
959 and then Can_Never_Be_Null (T)
961 Install_Null_Excluding_Check (Exp);
963 elsif Is_Access_Type (DesigT)
964 and then Nkind (Exp) = N_Allocator
965 and then Nkind (Expression (Exp)) /= N_Qualified_Expression
967 -- Apply constraint to designated subtype indication
969 Apply_Constraint_Check (Expression (Exp),
970 Designated_Type (DesigT),
973 if Nkind (Expression (Exp)) = N_Raise_Constraint_Error then
975 -- Propagate constraint_error to enclosing allocator
977 Rewrite (Exp, New_Copy (Expression (Exp)));
981 -- type A is access T1;
982 -- X : A := new T2'(...);
983 -- T1 and T2 can be different subtypes, and we might need to check
984 -- both constraints. First check against the type of the qualified
987 Apply_Constraint_Check (Exp, T, No_Sliding => True);
989 -- A check is also needed in cases where the designated subtype is
990 -- constrained and differs from the subtype given in the qualified
991 -- expression. Note that the check on the qualified expression does
992 -- not allow sliding, but this check does (a relaxation from Ada 83).
994 if Is_Constrained (DesigT)
995 and then not Subtypes_Statically_Match (T, DesigT)
997 Apply_Constraint_Check
998 (Exp, DesigT, No_Sliding => False);
1001 -- For an access to unconstrained packed array, GIGI needs to see an
1002 -- expression with a constrained subtype in order to compute the
1003 -- proper size for the allocator.
1005 if Is_Array_Type (T)
1006 and then not Is_Constrained (T)
1007 and then Is_Packed (T)
1010 ConstrT : constant Entity_Id :=
1011 Make_Defining_Identifier (Loc,
1012 Chars => New_Internal_Name ('A'));
1013 Internal_Exp : constant Node_Id := Relocate_Node (Exp);
1016 Make_Subtype_Declaration (Loc,
1017 Defining_Identifier => ConstrT,
1018 Subtype_Indication =>
1019 Make_Subtype_From_Expr (Exp, T)));
1020 Freeze_Itype (ConstrT, Exp);
1021 Rewrite (Exp, OK_Convert_To (ConstrT, Internal_Exp));
1025 -- Ada 2005 (AI-318-02): If the initialization expression is a call
1026 -- to a build-in-place function, then access to the allocated object
1027 -- must be passed to the function. Currently we limit such functions
1028 -- to those with constrained limited result subtypes, but eventually
1029 -- we plan to expand the allowed forms of functions that are treated
1030 -- as build-in-place.
1032 if Ada_Version >= Ada_05
1033 and then Is_Build_In_Place_Function_Call (Exp)
1035 Make_Build_In_Place_Call_In_Allocator (N, Exp);
1040 when RE_Not_Available =>
1042 end Expand_Allocator_Expression;
1044 -----------------------------
1045 -- Expand_Array_Comparison --
1046 -----------------------------
1048 -- Expansion is only required in the case of array types. For the unpacked
1049 -- case, an appropriate runtime routine is called. For packed cases, and
1050 -- also in some other cases where a runtime routine cannot be called, the
1051 -- form of the expansion is:
1053 -- [body for greater_nn; boolean_expression]
1055 -- The body is built by Make_Array_Comparison_Op, and the form of the
1056 -- Boolean expression depends on the operator involved.
1058 procedure Expand_Array_Comparison (N : Node_Id) is
1059 Loc : constant Source_Ptr := Sloc (N);
1060 Op1 : Node_Id := Left_Opnd (N);
1061 Op2 : Node_Id := Right_Opnd (N);
1062 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
1063 Ctyp : constant Entity_Id := Component_Type (Typ1);
1066 Func_Body : Node_Id;
1067 Func_Name : Entity_Id;
1071 Byte_Addressable : constant Boolean := System_Storage_Unit = Byte'Size;
1072 -- True for byte addressable target
1074 function Length_Less_Than_4 (Opnd : Node_Id) return Boolean;
1075 -- Returns True if the length of the given operand is known to be less
1076 -- than 4. Returns False if this length is known to be four or greater
1077 -- or is not known at compile time.
1079 ------------------------
1080 -- Length_Less_Than_4 --
1081 ------------------------
1083 function Length_Less_Than_4 (Opnd : Node_Id) return Boolean is
1084 Otyp : constant Entity_Id := Etype (Opnd);
1087 if Ekind (Otyp) = E_String_Literal_Subtype then
1088 return String_Literal_Length (Otyp) < 4;
1092 Ityp : constant Entity_Id := Etype (First_Index (Otyp));
1093 Lo : constant Node_Id := Type_Low_Bound (Ityp);
1094 Hi : constant Node_Id := Type_High_Bound (Ityp);
1099 if Compile_Time_Known_Value (Lo) then
1100 Lov := Expr_Value (Lo);
1105 if Compile_Time_Known_Value (Hi) then
1106 Hiv := Expr_Value (Hi);
1111 return Hiv < Lov + 3;
1114 end Length_Less_Than_4;
1116 -- Start of processing for Expand_Array_Comparison
1119 -- Deal first with unpacked case, where we can call a runtime routine
1120 -- except that we avoid this for targets for which are not addressable
1121 -- by bytes, and for the JVM/CIL, since they do not support direct
1122 -- addressing of array components.
1124 if not Is_Bit_Packed_Array (Typ1)
1125 and then Byte_Addressable
1126 and then VM_Target = No_VM
1128 -- The call we generate is:
1130 -- Compare_Array_xn[_Unaligned]
1131 -- (left'address, right'address, left'length, right'length) <op> 0
1133 -- x = U for unsigned, S for signed
1134 -- n = 8,16,32,64 for component size
1135 -- Add _Unaligned if length < 4 and component size is 8.
1136 -- <op> is the standard comparison operator
1138 if Component_Size (Typ1) = 8 then
1139 if Length_Less_Than_4 (Op1)
1141 Length_Less_Than_4 (Op2)
1143 if Is_Unsigned_Type (Ctyp) then
1144 Comp := RE_Compare_Array_U8_Unaligned;
1146 Comp := RE_Compare_Array_S8_Unaligned;
1150 if Is_Unsigned_Type (Ctyp) then
1151 Comp := RE_Compare_Array_U8;
1153 Comp := RE_Compare_Array_S8;
1157 elsif Component_Size (Typ1) = 16 then
1158 if Is_Unsigned_Type (Ctyp) then
1159 Comp := RE_Compare_Array_U16;
1161 Comp := RE_Compare_Array_S16;
1164 elsif Component_Size (Typ1) = 32 then
1165 if Is_Unsigned_Type (Ctyp) then
1166 Comp := RE_Compare_Array_U32;
1168 Comp := RE_Compare_Array_S32;
1171 else pragma Assert (Component_Size (Typ1) = 64);
1172 if Is_Unsigned_Type (Ctyp) then
1173 Comp := RE_Compare_Array_U64;
1175 Comp := RE_Compare_Array_S64;
1179 Remove_Side_Effects (Op1, Name_Req => True);
1180 Remove_Side_Effects (Op2, Name_Req => True);
1183 Make_Function_Call (Sloc (Op1),
1184 Name => New_Occurrence_Of (RTE (Comp), Loc),
1186 Parameter_Associations => New_List (
1187 Make_Attribute_Reference (Loc,
1188 Prefix => Relocate_Node (Op1),
1189 Attribute_Name => Name_Address),
1191 Make_Attribute_Reference (Loc,
1192 Prefix => Relocate_Node (Op2),
1193 Attribute_Name => Name_Address),
1195 Make_Attribute_Reference (Loc,
1196 Prefix => Relocate_Node (Op1),
1197 Attribute_Name => Name_Length),
1199 Make_Attribute_Reference (Loc,
1200 Prefix => Relocate_Node (Op2),
1201 Attribute_Name => Name_Length))));
1204 Make_Integer_Literal (Sloc (Op2),
1207 Analyze_And_Resolve (Op1, Standard_Integer);
1208 Analyze_And_Resolve (Op2, Standard_Integer);
1212 -- Cases where we cannot make runtime call
1214 -- For (a <= b) we convert to not (a > b)
1216 if Chars (N) = Name_Op_Le then
1222 Right_Opnd => Op2)));
1223 Analyze_And_Resolve (N, Standard_Boolean);
1226 -- For < the Boolean expression is
1227 -- greater__nn (op2, op1)
1229 elsif Chars (N) = Name_Op_Lt then
1230 Func_Body := Make_Array_Comparison_Op (Typ1, N);
1234 Op1 := Right_Opnd (N);
1235 Op2 := Left_Opnd (N);
1237 -- For (a >= b) we convert to not (a < b)
1239 elsif Chars (N) = Name_Op_Ge then
1245 Right_Opnd => Op2)));
1246 Analyze_And_Resolve (N, Standard_Boolean);
1249 -- For > the Boolean expression is
1250 -- greater__nn (op1, op2)
1253 pragma Assert (Chars (N) = Name_Op_Gt);
1254 Func_Body := Make_Array_Comparison_Op (Typ1, N);
1257 Func_Name := Defining_Unit_Name (Specification (Func_Body));
1259 Make_Function_Call (Loc,
1260 Name => New_Reference_To (Func_Name, Loc),
1261 Parameter_Associations => New_List (Op1, Op2));
1263 Insert_Action (N, Func_Body);
1265 Analyze_And_Resolve (N, Standard_Boolean);
1268 when RE_Not_Available =>
1270 end Expand_Array_Comparison;
1272 ---------------------------
1273 -- Expand_Array_Equality --
1274 ---------------------------
1276 -- Expand an equality function for multi-dimensional arrays. Here is an
1277 -- example of such a function for Nb_Dimension = 2
1279 -- function Enn (A : atyp; B : btyp) return boolean is
1281 -- if (A'length (1) = 0 or else A'length (2) = 0)
1283 -- (B'length (1) = 0 or else B'length (2) = 0)
1285 -- return True; -- RM 4.5.2(22)
1288 -- if A'length (1) /= B'length (1)
1290 -- A'length (2) /= B'length (2)
1292 -- return False; -- RM 4.5.2(23)
1296 -- A1 : Index_T1 := A'first (1);
1297 -- B1 : Index_T1 := B'first (1);
1301 -- A2 : Index_T2 := A'first (2);
1302 -- B2 : Index_T2 := B'first (2);
1305 -- if A (A1, A2) /= B (B1, B2) then
1309 -- exit when A2 = A'last (2);
1310 -- A2 := Index_T2'succ (A2);
1311 -- B2 := Index_T2'succ (B2);
1315 -- exit when A1 = A'last (1);
1316 -- A1 := Index_T1'succ (A1);
1317 -- B1 := Index_T1'succ (B1);
1324 -- Note on the formal types used (atyp and btyp). If either of the arrays
1325 -- is of a private type, we use the underlying type, and do an unchecked
1326 -- conversion of the actual. If either of the arrays has a bound depending
1327 -- on a discriminant, then we use the base type since otherwise we have an
1328 -- escaped discriminant in the function.
1330 -- If both arrays are constrained and have the same bounds, we can generate
1331 -- a loop with an explicit iteration scheme using a 'Range attribute over
1334 function Expand_Array_Equality
1339 Typ : Entity_Id) return Node_Id
1341 Loc : constant Source_Ptr := Sloc (Nod);
1342 Decls : constant List_Id := New_List;
1343 Index_List1 : constant List_Id := New_List;
1344 Index_List2 : constant List_Id := New_List;
1348 Func_Name : Entity_Id;
1349 Func_Body : Node_Id;
1351 A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA);
1352 B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB);
1356 -- The parameter types to be used for the formals
1361 Num : Int) return Node_Id;
1362 -- This builds the attribute reference Arr'Nam (Expr)
1364 function Component_Equality (Typ : Entity_Id) return Node_Id;
1365 -- Create one statement to compare corresponding components, designated
1366 -- by a full set of indices.
1368 function Get_Arg_Type (N : Node_Id) return Entity_Id;
1369 -- Given one of the arguments, computes the appropriate type to be used
1370 -- for that argument in the corresponding function formal
1372 function Handle_One_Dimension
1374 Index : Node_Id) return Node_Id;
1375 -- This procedure returns the following code
1378 -- Bn : Index_T := B'First (N);
1382 -- exit when An = A'Last (N);
1383 -- An := Index_T'Succ (An)
1384 -- Bn := Index_T'Succ (Bn)
1388 -- If both indices are constrained and identical, the procedure
1389 -- returns a simpler loop:
1391 -- for An in A'Range (N) loop
1395 -- N is the dimension for which we are generating a loop. Index is the
1396 -- N'th index node, whose Etype is Index_Type_n in the above code. The
1397 -- xxx statement is either the loop or declare for the next dimension
1398 -- or if this is the last dimension the comparison of corresponding
1399 -- components of the arrays.
1401 -- The actual way the code works is to return the comparison of
1402 -- corresponding components for the N+1 call. That's neater!
1404 function Test_Empty_Arrays return Node_Id;
1405 -- This function constructs the test for both arrays being empty
1406 -- (A'length (1) = 0 or else A'length (2) = 0 or else ...)
1408 -- (B'length (1) = 0 or else B'length (2) = 0 or else ...)
1410 function Test_Lengths_Correspond return Node_Id;
1411 -- This function constructs the test for arrays having different lengths
1412 -- in at least one index position, in which case the resulting code is:
1414 -- A'length (1) /= B'length (1)
1416 -- A'length (2) /= B'length (2)
1427 Num : Int) return Node_Id
1431 Make_Attribute_Reference (Loc,
1432 Attribute_Name => Nam,
1433 Prefix => New_Reference_To (Arr, Loc),
1434 Expressions => New_List (Make_Integer_Literal (Loc, Num)));
1437 ------------------------
1438 -- Component_Equality --
1439 ------------------------
1441 function Component_Equality (Typ : Entity_Id) return Node_Id is
1446 -- if a(i1...) /= b(j1...) then return false; end if;
1449 Make_Indexed_Component (Loc,
1450 Prefix => Make_Identifier (Loc, Chars (A)),
1451 Expressions => Index_List1);
1454 Make_Indexed_Component (Loc,
1455 Prefix => Make_Identifier (Loc, Chars (B)),
1456 Expressions => Index_List2);
1458 Test := Expand_Composite_Equality
1459 (Nod, Component_Type (Typ), L, R, Decls);
1461 -- If some (sub)component is an unchecked_union, the whole operation
1462 -- will raise program error.
1464 if Nkind (Test) = N_Raise_Program_Error then
1466 -- This node is going to be inserted at a location where a
1467 -- statement is expected: clear its Etype so analysis will set
1468 -- it to the expected Standard_Void_Type.
1470 Set_Etype (Test, Empty);
1475 Make_Implicit_If_Statement (Nod,
1476 Condition => Make_Op_Not (Loc, Right_Opnd => Test),
1477 Then_Statements => New_List (
1478 Make_Simple_Return_Statement (Loc,
1479 Expression => New_Occurrence_Of (Standard_False, Loc))));
1481 end Component_Equality;
1487 function Get_Arg_Type (N : Node_Id) return Entity_Id is
1498 T := Underlying_Type (T);
1500 X := First_Index (T);
1501 while Present (X) loop
1502 if Denotes_Discriminant (Type_Low_Bound (Etype (X)))
1504 Denotes_Discriminant (Type_High_Bound (Etype (X)))
1517 --------------------------
1518 -- Handle_One_Dimension --
1519 ---------------------------
1521 function Handle_One_Dimension
1523 Index : Node_Id) return Node_Id
1525 Need_Separate_Indexes : constant Boolean :=
1527 or else not Is_Constrained (Ltyp);
1528 -- If the index types are identical, and we are working with
1529 -- constrained types, then we can use the same index for both
1532 An : constant Entity_Id := Make_Defining_Identifier (Loc,
1533 Chars => New_Internal_Name ('A'));
1536 Index_T : Entity_Id;
1541 if N > Number_Dimensions (Ltyp) then
1542 return Component_Equality (Ltyp);
1545 -- Case where we generate a loop
1547 Index_T := Base_Type (Etype (Index));
1549 if Need_Separate_Indexes then
1551 Make_Defining_Identifier (Loc,
1552 Chars => New_Internal_Name ('B'));
1557 Append (New_Reference_To (An, Loc), Index_List1);
1558 Append (New_Reference_To (Bn, Loc), Index_List2);
1560 Stm_List := New_List (
1561 Handle_One_Dimension (N + 1, Next_Index (Index)));
1563 if Need_Separate_Indexes then
1565 -- Generate guard for loop, followed by increments of indices
1567 Append_To (Stm_List,
1568 Make_Exit_Statement (Loc,
1571 Left_Opnd => New_Reference_To (An, Loc),
1572 Right_Opnd => Arr_Attr (A, Name_Last, N))));
1574 Append_To (Stm_List,
1575 Make_Assignment_Statement (Loc,
1576 Name => New_Reference_To (An, Loc),
1578 Make_Attribute_Reference (Loc,
1579 Prefix => New_Reference_To (Index_T, Loc),
1580 Attribute_Name => Name_Succ,
1581 Expressions => New_List (New_Reference_To (An, Loc)))));
1583 Append_To (Stm_List,
1584 Make_Assignment_Statement (Loc,
1585 Name => New_Reference_To (Bn, Loc),
1587 Make_Attribute_Reference (Loc,
1588 Prefix => New_Reference_To (Index_T, Loc),
1589 Attribute_Name => Name_Succ,
1590 Expressions => New_List (New_Reference_To (Bn, Loc)))));
1593 -- If separate indexes, we need a declare block for An and Bn, and a
1594 -- loop without an iteration scheme.
1596 if Need_Separate_Indexes then
1598 Make_Implicit_Loop_Statement (Nod, Statements => Stm_List);
1601 Make_Block_Statement (Loc,
1602 Declarations => New_List (
1603 Make_Object_Declaration (Loc,
1604 Defining_Identifier => An,
1605 Object_Definition => New_Reference_To (Index_T, Loc),
1606 Expression => Arr_Attr (A, Name_First, N)),
1608 Make_Object_Declaration (Loc,
1609 Defining_Identifier => Bn,
1610 Object_Definition => New_Reference_To (Index_T, Loc),
1611 Expression => Arr_Attr (B, Name_First, N))),
1613 Handled_Statement_Sequence =>
1614 Make_Handled_Sequence_Of_Statements (Loc,
1615 Statements => New_List (Loop_Stm)));
1617 -- If no separate indexes, return loop statement with explicit
1618 -- iteration scheme on its own
1622 Make_Implicit_Loop_Statement (Nod,
1623 Statements => Stm_List,
1625 Make_Iteration_Scheme (Loc,
1626 Loop_Parameter_Specification =>
1627 Make_Loop_Parameter_Specification (Loc,
1628 Defining_Identifier => An,
1629 Discrete_Subtype_Definition =>
1630 Arr_Attr (A, Name_Range, N))));
1633 end Handle_One_Dimension;
1635 -----------------------
1636 -- Test_Empty_Arrays --
1637 -----------------------
1639 function Test_Empty_Arrays return Node_Id is
1649 for J in 1 .. Number_Dimensions (Ltyp) loop
1652 Left_Opnd => Arr_Attr (A, Name_Length, J),
1653 Right_Opnd => Make_Integer_Literal (Loc, 0));
1657 Left_Opnd => Arr_Attr (B, Name_Length, J),
1658 Right_Opnd => Make_Integer_Literal (Loc, 0));
1667 Left_Opnd => Relocate_Node (Alist),
1668 Right_Opnd => Atest);
1672 Left_Opnd => Relocate_Node (Blist),
1673 Right_Opnd => Btest);
1680 Right_Opnd => Blist);
1681 end Test_Empty_Arrays;
1683 -----------------------------
1684 -- Test_Lengths_Correspond --
1685 -----------------------------
1687 function Test_Lengths_Correspond return Node_Id is
1693 for J in 1 .. Number_Dimensions (Ltyp) loop
1696 Left_Opnd => Arr_Attr (A, Name_Length, J),
1697 Right_Opnd => Arr_Attr (B, Name_Length, J));
1704 Left_Opnd => Relocate_Node (Result),
1705 Right_Opnd => Rtest);
1710 end Test_Lengths_Correspond;
1712 -- Start of processing for Expand_Array_Equality
1715 Ltyp := Get_Arg_Type (Lhs);
1716 Rtyp := Get_Arg_Type (Rhs);
1718 -- For now, if the argument types are not the same, go to the base type,
1719 -- since the code assumes that the formals have the same type. This is
1720 -- fixable in future ???
1722 if Ltyp /= Rtyp then
1723 Ltyp := Base_Type (Ltyp);
1724 Rtyp := Base_Type (Rtyp);
1725 pragma Assert (Ltyp = Rtyp);
1728 -- Build list of formals for function
1730 Formals := New_List (
1731 Make_Parameter_Specification (Loc,
1732 Defining_Identifier => A,
1733 Parameter_Type => New_Reference_To (Ltyp, Loc)),
1735 Make_Parameter_Specification (Loc,
1736 Defining_Identifier => B,
1737 Parameter_Type => New_Reference_To (Rtyp, Loc)));
1739 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('E'));
1741 -- Build statement sequence for function
1744 Make_Subprogram_Body (Loc,
1746 Make_Function_Specification (Loc,
1747 Defining_Unit_Name => Func_Name,
1748 Parameter_Specifications => Formals,
1749 Result_Definition => New_Reference_To (Standard_Boolean, Loc)),
1751 Declarations => Decls,
1753 Handled_Statement_Sequence =>
1754 Make_Handled_Sequence_Of_Statements (Loc,
1755 Statements => New_List (
1757 Make_Implicit_If_Statement (Nod,
1758 Condition => Test_Empty_Arrays,
1759 Then_Statements => New_List (
1760 Make_Simple_Return_Statement (Loc,
1762 New_Occurrence_Of (Standard_True, Loc)))),
1764 Make_Implicit_If_Statement (Nod,
1765 Condition => Test_Lengths_Correspond,
1766 Then_Statements => New_List (
1767 Make_Simple_Return_Statement (Loc,
1769 New_Occurrence_Of (Standard_False, Loc)))),
1771 Handle_One_Dimension (1, First_Index (Ltyp)),
1773 Make_Simple_Return_Statement (Loc,
1774 Expression => New_Occurrence_Of (Standard_True, Loc)))));
1776 Set_Has_Completion (Func_Name, True);
1777 Set_Is_Inlined (Func_Name);
1779 -- If the array type is distinct from the type of the arguments, it
1780 -- is the full view of a private type. Apply an unchecked conversion
1781 -- to insure that analysis of the call succeeds.
1791 or else Base_Type (Etype (Lhs)) /= Base_Type (Ltyp)
1793 L := OK_Convert_To (Ltyp, Lhs);
1797 or else Base_Type (Etype (Rhs)) /= Base_Type (Rtyp)
1799 R := OK_Convert_To (Rtyp, Rhs);
1802 Actuals := New_List (L, R);
1805 Append_To (Bodies, Func_Body);
1808 Make_Function_Call (Loc,
1809 Name => New_Reference_To (Func_Name, Loc),
1810 Parameter_Associations => Actuals);
1811 end Expand_Array_Equality;
1813 -----------------------------
1814 -- Expand_Boolean_Operator --
1815 -----------------------------
1817 -- Note that we first get the actual subtypes of the operands, since we
1818 -- always want to deal with types that have bounds.
1820 procedure Expand_Boolean_Operator (N : Node_Id) is
1821 Typ : constant Entity_Id := Etype (N);
1824 -- Special case of bit packed array where both operands are known to be
1825 -- properly aligned. In this case we use an efficient run time routine
1826 -- to carry out the operation (see System.Bit_Ops).
1828 if Is_Bit_Packed_Array (Typ)
1829 and then not Is_Possibly_Unaligned_Object (Left_Opnd (N))
1830 and then not Is_Possibly_Unaligned_Object (Right_Opnd (N))
1832 Expand_Packed_Boolean_Operator (N);
1836 -- For the normal non-packed case, the general expansion is to build
1837 -- function for carrying out the comparison (use Make_Boolean_Array_Op)
1838 -- and then inserting it into the tree. The original operator node is
1839 -- then rewritten as a call to this function. We also use this in the
1840 -- packed case if either operand is a possibly unaligned object.
1843 Loc : constant Source_Ptr := Sloc (N);
1844 L : constant Node_Id := Relocate_Node (Left_Opnd (N));
1845 R : constant Node_Id := Relocate_Node (Right_Opnd (N));
1846 Func_Body : Node_Id;
1847 Func_Name : Entity_Id;
1850 Convert_To_Actual_Subtype (L);
1851 Convert_To_Actual_Subtype (R);
1852 Ensure_Defined (Etype (L), N);
1853 Ensure_Defined (Etype (R), N);
1854 Apply_Length_Check (R, Etype (L));
1856 if Nkind (N) = N_Op_Xor then
1857 Silly_Boolean_Array_Xor_Test (N, Etype (L));
1860 if Nkind (Parent (N)) = N_Assignment_Statement
1861 and then Safe_In_Place_Array_Op (Name (Parent (N)), L, R)
1863 Build_Boolean_Array_Proc_Call (Parent (N), L, R);
1865 elsif Nkind (Parent (N)) = N_Op_Not
1866 and then Nkind (N) = N_Op_And
1868 Safe_In_Place_Array_Op (Name (Parent (Parent (N))), L, R)
1873 Func_Body := Make_Boolean_Array_Op (Etype (L), N);
1874 Func_Name := Defining_Unit_Name (Specification (Func_Body));
1875 Insert_Action (N, Func_Body);
1877 -- Now rewrite the expression with a call
1880 Make_Function_Call (Loc,
1881 Name => New_Reference_To (Func_Name, Loc),
1882 Parameter_Associations =>
1885 Make_Type_Conversion
1886 (Loc, New_Reference_To (Etype (L), Loc), R))));
1888 Analyze_And_Resolve (N, Typ);
1891 end Expand_Boolean_Operator;
1893 -------------------------------
1894 -- Expand_Composite_Equality --
1895 -------------------------------
1897 -- This function is only called for comparing internal fields of composite
1898 -- types when these fields are themselves composites. This is a special
1899 -- case because it is not possible to respect normal Ada visibility rules.
1901 function Expand_Composite_Equality
1906 Bodies : List_Id) return Node_Id
1908 Loc : constant Source_Ptr := Sloc (Nod);
1909 Full_Type : Entity_Id;
1914 if Is_Private_Type (Typ) then
1915 Full_Type := Underlying_Type (Typ);
1920 -- Defense against malformed private types with no completion the error
1921 -- will be diagnosed later by check_completion
1923 if No (Full_Type) then
1924 return New_Reference_To (Standard_False, Loc);
1927 Full_Type := Base_Type (Full_Type);
1929 if Is_Array_Type (Full_Type) then
1931 -- If the operand is an elementary type other than a floating-point
1932 -- type, then we can simply use the built-in block bitwise equality,
1933 -- since the predefined equality operators always apply and bitwise
1934 -- equality is fine for all these cases.
1936 if Is_Elementary_Type (Component_Type (Full_Type))
1937 and then not Is_Floating_Point_Type (Component_Type (Full_Type))
1939 return Make_Op_Eq (Loc, Left_Opnd => Lhs, Right_Opnd => Rhs);
1941 -- For composite component types, and floating-point types, use the
1942 -- expansion. This deals with tagged component types (where we use
1943 -- the applicable equality routine) and floating-point, (where we
1944 -- need to worry about negative zeroes), and also the case of any
1945 -- composite type recursively containing such fields.
1948 return Expand_Array_Equality (Nod, Lhs, Rhs, Bodies, Full_Type);
1951 elsif Is_Tagged_Type (Full_Type) then
1953 -- Call the primitive operation "=" of this type
1955 if Is_Class_Wide_Type (Full_Type) then
1956 Full_Type := Root_Type (Full_Type);
1959 -- If this is derived from an untagged private type completed with a
1960 -- tagged type, it does not have a full view, so we use the primitive
1961 -- operations of the private type. This check should no longer be
1962 -- necessary when these types receive their full views ???
1964 if Is_Private_Type (Typ)
1965 and then not Is_Tagged_Type (Typ)
1966 and then not Is_Controlled (Typ)
1967 and then Is_Derived_Type (Typ)
1968 and then No (Full_View (Typ))
1970 Prim := First_Elmt (Collect_Primitive_Operations (Typ));
1972 Prim := First_Elmt (Primitive_Operations (Full_Type));
1976 Eq_Op := Node (Prim);
1977 exit when Chars (Eq_Op) = Name_Op_Eq
1978 and then Etype (First_Formal (Eq_Op)) =
1979 Etype (Next_Formal (First_Formal (Eq_Op)))
1980 and then Base_Type (Etype (Eq_Op)) = Standard_Boolean;
1982 pragma Assert (Present (Prim));
1985 Eq_Op := Node (Prim);
1988 Make_Function_Call (Loc,
1989 Name => New_Reference_To (Eq_Op, Loc),
1990 Parameter_Associations =>
1992 (Unchecked_Convert_To (Etype (First_Formal (Eq_Op)), Lhs),
1993 Unchecked_Convert_To (Etype (First_Formal (Eq_Op)), Rhs)));
1995 elsif Is_Record_Type (Full_Type) then
1996 Eq_Op := TSS (Full_Type, TSS_Composite_Equality);
1998 if Present (Eq_Op) then
1999 if Etype (First_Formal (Eq_Op)) /= Full_Type then
2001 -- Inherited equality from parent type. Convert the actuals to
2002 -- match signature of operation.
2005 T : constant Entity_Id := Etype (First_Formal (Eq_Op));
2009 Make_Function_Call (Loc,
2010 Name => New_Reference_To (Eq_Op, Loc),
2011 Parameter_Associations =>
2012 New_List (OK_Convert_To (T, Lhs),
2013 OK_Convert_To (T, Rhs)));
2017 -- Comparison between Unchecked_Union components
2019 if Is_Unchecked_Union (Full_Type) then
2021 Lhs_Type : Node_Id := Full_Type;
2022 Rhs_Type : Node_Id := Full_Type;
2023 Lhs_Discr_Val : Node_Id;
2024 Rhs_Discr_Val : Node_Id;
2029 if Nkind (Lhs) = N_Selected_Component then
2030 Lhs_Type := Etype (Entity (Selector_Name (Lhs)));
2035 if Nkind (Rhs) = N_Selected_Component then
2036 Rhs_Type := Etype (Entity (Selector_Name (Rhs)));
2039 -- Lhs of the composite equality
2041 if Is_Constrained (Lhs_Type) then
2043 -- Since the enclosing record type can never be an
2044 -- Unchecked_Union (this code is executed for records
2045 -- that do not have variants), we may reference its
2048 if Nkind (Lhs) = N_Selected_Component
2049 and then Has_Per_Object_Constraint (
2050 Entity (Selector_Name (Lhs)))
2053 Make_Selected_Component (Loc,
2054 Prefix => Prefix (Lhs),
2057 Get_Discriminant_Value (
2058 First_Discriminant (Lhs_Type),
2060 Stored_Constraint (Lhs_Type))));
2063 Lhs_Discr_Val := New_Copy (
2064 Get_Discriminant_Value (
2065 First_Discriminant (Lhs_Type),
2067 Stored_Constraint (Lhs_Type)));
2071 -- It is not possible to infer the discriminant since
2072 -- the subtype is not constrained.
2075 Make_Raise_Program_Error (Loc,
2076 Reason => PE_Unchecked_Union_Restriction);
2079 -- Rhs of the composite equality
2081 if Is_Constrained (Rhs_Type) then
2082 if Nkind (Rhs) = N_Selected_Component
2083 and then Has_Per_Object_Constraint (
2084 Entity (Selector_Name (Rhs)))
2087 Make_Selected_Component (Loc,
2088 Prefix => Prefix (Rhs),
2091 Get_Discriminant_Value (
2092 First_Discriminant (Rhs_Type),
2094 Stored_Constraint (Rhs_Type))));
2097 Rhs_Discr_Val := New_Copy (
2098 Get_Discriminant_Value (
2099 First_Discriminant (Rhs_Type),
2101 Stored_Constraint (Rhs_Type)));
2106 Make_Raise_Program_Error (Loc,
2107 Reason => PE_Unchecked_Union_Restriction);
2110 -- Call the TSS equality function with the inferred
2111 -- discriminant values.
2114 Make_Function_Call (Loc,
2115 Name => New_Reference_To (Eq_Op, Loc),
2116 Parameter_Associations => New_List (
2124 -- Shouldn't this be an else, we can't fall through the above
2128 Make_Function_Call (Loc,
2129 Name => New_Reference_To (Eq_Op, Loc),
2130 Parameter_Associations => New_List (Lhs, Rhs));
2134 return Expand_Record_Equality (Nod, Full_Type, Lhs, Rhs, Bodies);
2138 -- It can be a simple record or the full view of a scalar private
2140 return Make_Op_Eq (Loc, Left_Opnd => Lhs, Right_Opnd => Rhs);
2142 end Expand_Composite_Equality;
2144 ------------------------
2145 -- Expand_Concatenate --
2146 ------------------------
2148 procedure Expand_Concatenate (Cnode : Node_Id; Opnds : List_Id) is
2149 Loc : constant Source_Ptr := Sloc (Cnode);
2151 Atyp : constant Entity_Id := Base_Type (Etype (Cnode));
2152 -- Result type of concatenation
2154 Ctyp : constant Entity_Id := Base_Type (Component_Type (Etype (Cnode)));
2155 -- Component type. Elements of this component type can appear as one
2156 -- of the operands of concatenation as well as arrays.
2158 Istyp : constant Entity_Id := Etype (First_Index (Atyp));
2161 Ityp : constant Entity_Id := Base_Type (Istyp);
2162 -- Index type. This is the base type of the index subtype, and is used
2163 -- for all computed bounds (which may be out of range of Istyp in the
2164 -- case of null ranges).
2167 -- This is the type we use to do arithmetic to compute the bounds and
2168 -- lengths of operands. The choice of this type is a little subtle and
2169 -- is discussed in a separate section at the start of the body code.
2171 Concatenation_Error : exception;
2172 -- Raised if concatenation is sure to raise a CE
2174 Result_May_Be_Null : Boolean := True;
2175 -- Reset to False if at least one operand is encountered which is known
2176 -- at compile time to be non-null. Used for handling the special case
2177 -- of setting the high bound to the last operand high bound for a null
2178 -- result, thus ensuring a proper high bound in the super-flat case.
2180 N : constant Nat := List_Length (Opnds);
2181 -- Number of concatenation operands including possibly null operands
2184 -- Number of operands excluding any known to be null, except that the
2185 -- last operand is always retained, in case it provides the bounds for
2189 -- Current operand being processed in the loop through operands. After
2190 -- this loop is complete, always contains the last operand (which is not
2191 -- the same as Operands (NN), since null operands are skipped).
2193 -- Arrays describing the operands, only the first NN entries of each
2194 -- array are set (NN < N when we exclude known null operands).
2196 Is_Fixed_Length : array (1 .. N) of Boolean;
2197 -- True if length of corresponding operand known at compile time
2199 Operands : array (1 .. N) of Node_Id;
2200 -- Set to the corresponding entry in the Opnds list (but note that null
2201 -- operands are excluded, so not all entries in the list are stored).
2203 Fixed_Length : array (1 .. N) of Uint;
2204 -- Set to length of operand. Entries in this array are set only if the
2205 -- corresponding entry in Is_Fixed_Length is True.
2207 Opnd_Low_Bound : array (1 .. N) of Node_Id;
2208 -- Set to lower bound of operand. Either an integer literal in the case
2209 -- where the bound is known at compile time, else actual lower bound.
2210 -- The operand low bound is of type Ityp.
2212 Var_Length : array (1 .. N) of Entity_Id;
2213 -- Set to an entity of type Natural that contains the length of an
2214 -- operand whose length is not known at compile time. Entries in this
2215 -- array are set only if the corresponding entry in Is_Fixed_Length
2216 -- is False. The entity is of type Artyp.
2218 Aggr_Length : array (0 .. N) of Node_Id;
2219 -- The J'th entry in an expression node that represents the total length
2220 -- of operands 1 through J. It is either an integer literal node, or a
2221 -- reference to a constant entity with the right value, so it is fine
2222 -- to just do a Copy_Node to get an appropriate copy. The extra zero'th
2223 -- entry always is set to zero. The length is of type Artyp.
2225 Low_Bound : Node_Id;
2226 -- A tree node representing the low bound of the result (of type Ityp).
2227 -- This is either an integer literal node, or an identifier reference to
2228 -- a constant entity initialized to the appropriate value.
2230 Last_Opnd_High_Bound : Node_Id;
2231 -- A tree node representing the high bound of the last operand. This
2232 -- need only be set if the result could be null. It is used for the
2233 -- special case of setting the right high bound for a null result.
2234 -- This is of type Ityp.
2236 High_Bound : Node_Id;
2237 -- A tree node representing the high bound of the result (of type Ityp)
2240 -- Result of the concatenation (of type Ityp)
2242 Actions : constant List_Id := New_List;
2243 -- Collect actions to be inserted if Save_Space is False
2245 Save_Space : Boolean;
2246 pragma Warnings (Off, Save_Space);
2247 -- Set to True if we are saving generated code space by calling routines
2248 -- in packages System.Concat_n.
2250 Known_Non_Null_Operand_Seen : Boolean;
2251 -- Set True during generation of the assignements of operands into
2252 -- result once an operand known to be non-null has been seen.
2254 function Make_Artyp_Literal (Val : Nat) return Node_Id;
2255 -- This function makes an N_Integer_Literal node that is returned in
2256 -- analyzed form with the type set to Artyp. Importantly this literal
2257 -- is not flagged as static, so that if we do computations with it that
2258 -- result in statically detected out of range conditions, we will not
2259 -- generate error messages but instead warning messages.
2261 function To_Artyp (X : Node_Id) return Node_Id;
2262 -- Given a node of type Ityp, returns the corresponding value of type
2263 -- Artyp. For non-enumeration types, this is a plain integer conversion.
2264 -- For enum types, the Pos of the value is returned.
2266 function To_Ityp (X : Node_Id) return Node_Id;
2267 -- The inverse function (uses Val in the case of enumeration types)
2269 ------------------------
2270 -- Make_Artyp_Literal --
2271 ------------------------
2273 function Make_Artyp_Literal (Val : Nat) return Node_Id is
2274 Result : constant Node_Id := Make_Integer_Literal (Loc, Val);
2276 Set_Etype (Result, Artyp);
2277 Set_Analyzed (Result, True);
2278 Set_Is_Static_Expression (Result, False);
2280 end Make_Artyp_Literal;
2286 function To_Artyp (X : Node_Id) return Node_Id is
2288 if Ityp = Base_Type (Artyp) then
2291 elsif Is_Enumeration_Type (Ityp) then
2293 Make_Attribute_Reference (Loc,
2294 Prefix => New_Occurrence_Of (Ityp, Loc),
2295 Attribute_Name => Name_Pos,
2296 Expressions => New_List (X));
2299 return Convert_To (Artyp, X);
2307 function To_Ityp (X : Node_Id) return Node_Id is
2309 if Is_Enumeration_Type (Ityp) then
2311 Make_Attribute_Reference (Loc,
2312 Prefix => New_Occurrence_Of (Ityp, Loc),
2313 Attribute_Name => Name_Val,
2314 Expressions => New_List (X));
2316 -- Case where we will do a type conversion
2319 if Ityp = Base_Type (Artyp) then
2322 return Convert_To (Ityp, X);
2327 -- Local Declarations
2329 Opnd_Typ : Entity_Id;
2337 -- Choose an appropriate computational type
2339 -- We will be doing calculations of lengths and bounds in this routine
2340 -- and computing one from the other in some cases, e.g. getting the high
2341 -- bound by adding the length-1 to the low bound.
2343 -- We can't just use the index type, or even its base type for this
2344 -- purpose for two reasons. First it might be an enumeration type which
2345 -- is not suitable fo computations of any kind, and second it may simply
2346 -- not have enough range. For example if the index type is -128..+127
2347 -- then lengths can be up to 256, which is out of range of the type.
2349 -- For enumeration types, we can simply use Standard_Integer, this is
2350 -- sufficient since the actual number of enumeration literals cannot
2351 -- possibly exceed the range of integer (remember we will be doing the
2352 -- arithmetic with POS values, not representation values).
2354 if Is_Enumeration_Type (Ityp) then
2355 Artyp := Standard_Integer;
2357 -- If index type is Positive, we use the standard unsigned type, to give
2358 -- more room on the top of the range, obviating the need for an overflow
2359 -- check when creating the upper bound. This is needed to avoid junk
2360 -- overflow checks in the common case of String types.
2362 -- ??? Disabled for now
2364 -- elsif Istyp = Standard_Positive then
2365 -- Artyp := Standard_Unsigned;
2367 -- For modular types, we use a 32-bit modular type for types whose size
2368 -- is in the range 1-31 bits. For 32-bit unsigned types, we use the
2369 -- identity type, and for larger unsigned types we use 64-bits.
2371 elsif Is_Modular_Integer_Type (Ityp) then
2372 if RM_Size (Ityp) < RM_Size (Standard_Unsigned) then
2373 Artyp := Standard_Unsigned;
2374 elsif RM_Size (Ityp) = RM_Size (Standard_Unsigned) then
2377 Artyp := RTE (RE_Long_Long_Unsigned);
2380 -- Similar treatment for signed types
2383 if RM_Size (Ityp) < RM_Size (Standard_Integer) then
2384 Artyp := Standard_Integer;
2385 elsif RM_Size (Ityp) = RM_Size (Standard_Integer) then
2388 Artyp := Standard_Long_Long_Integer;
2392 -- Supply dummy entry at start of length array
2394 Aggr_Length (0) := Make_Artyp_Literal (0);
2396 -- Go through operands setting up the above arrays
2400 Opnd := Remove_Head (Opnds);
2401 Opnd_Typ := Etype (Opnd);
2403 -- The parent got messed up when we put the operands in a list,
2404 -- so now put back the proper parent for the saved operand.
2406 Set_Parent (Opnd, Parent (Cnode));
2408 -- Set will be True when we have setup one entry in the array
2412 -- Singleton element (or character literal) case
2414 if Base_Type (Opnd_Typ) = Ctyp then
2416 Operands (NN) := Opnd;
2417 Is_Fixed_Length (NN) := True;
2418 Fixed_Length (NN) := Uint_1;
2419 Result_May_Be_Null := False;
2421 -- Set low bound of operand (no need to set Last_Opnd_High_Bound
2422 -- since we know that the result cannot be null).
2424 Opnd_Low_Bound (NN) :=
2425 Make_Attribute_Reference (Loc,
2426 Prefix => New_Reference_To (Istyp, Loc),
2427 Attribute_Name => Name_First);
2431 -- String literal case (can only occur for strings of course)
2433 elsif Nkind (Opnd) = N_String_Literal then
2434 Len := String_Literal_Length (Opnd_Typ);
2437 Result_May_Be_Null := False;
2440 -- Capture last operand high bound if result could be null
2442 if J = N and then Result_May_Be_Null then
2443 Last_Opnd_High_Bound :=
2446 New_Copy_Tree (String_Literal_Low_Bound (Opnd_Typ)),
2447 Right_Opnd => Make_Integer_Literal (Loc, 1));
2450 -- Skip null string literal
2452 if J < N and then Len = 0 then
2457 Operands (NN) := Opnd;
2458 Is_Fixed_Length (NN) := True;
2460 -- Set length and bounds
2462 Fixed_Length (NN) := Len;
2464 Opnd_Low_Bound (NN) :=
2465 New_Copy_Tree (String_Literal_Low_Bound (Opnd_Typ));
2472 -- Check constrained case with known bounds
2474 if Is_Constrained (Opnd_Typ) then
2476 Index : constant Node_Id := First_Index (Opnd_Typ);
2477 Indx_Typ : constant Entity_Id := Etype (Index);
2478 Lo : constant Node_Id := Type_Low_Bound (Indx_Typ);
2479 Hi : constant Node_Id := Type_High_Bound (Indx_Typ);
2482 -- Fixed length constrained array type with known at compile
2483 -- time bounds is last case of fixed length operand.
2485 if Compile_Time_Known_Value (Lo)
2487 Compile_Time_Known_Value (Hi)
2490 Loval : constant Uint := Expr_Value (Lo);
2491 Hival : constant Uint := Expr_Value (Hi);
2492 Len : constant Uint :=
2493 UI_Max (Hival - Loval + 1, Uint_0);
2497 Result_May_Be_Null := False;
2500 -- Capture last operand bound if result could be null
2502 if J = N and then Result_May_Be_Null then
2503 Last_Opnd_High_Bound :=
2505 Make_Integer_Literal (Loc,
2506 Intval => Expr_Value (Hi)));
2509 -- Exclude null length case unless last operand
2511 if J < N and then Len = 0 then
2516 Operands (NN) := Opnd;
2517 Is_Fixed_Length (NN) := True;
2518 Fixed_Length (NN) := Len;
2520 Opnd_Low_Bound (NN) := To_Ityp (
2521 Make_Integer_Literal (Loc,
2522 Intval => Expr_Value (Lo)));
2530 -- All cases where the length is not known at compile time, or the
2531 -- special case of an operand which is known to be null but has a
2532 -- lower bound other than 1 or is other than a string type.
2537 -- Capture operand bounds
2539 Opnd_Low_Bound (NN) :=
2540 Make_Attribute_Reference (Loc,
2542 Duplicate_Subexpr (Opnd, Name_Req => True),
2543 Attribute_Name => Name_First);
2545 if J = N and Result_May_Be_Null then
2546 Last_Opnd_High_Bound :=
2548 Make_Attribute_Reference (Loc,
2550 Duplicate_Subexpr (Opnd, Name_Req => True),
2551 Attribute_Name => Name_Last));
2554 -- Capture length of operand in entity
2556 Operands (NN) := Opnd;
2557 Is_Fixed_Length (NN) := False;
2560 Make_Defining_Identifier (Loc,
2561 Chars => New_Internal_Name ('L'));
2564 Make_Object_Declaration (Loc,
2565 Defining_Identifier => Var_Length (NN),
2566 Constant_Present => True,
2568 Object_Definition =>
2569 New_Occurrence_Of (Artyp, Loc),
2572 Make_Attribute_Reference (Loc,
2574 Duplicate_Subexpr (Opnd, Name_Req => True),
2575 Attribute_Name => Name_Length)));
2579 -- Set next entry in aggregate length array
2581 -- For first entry, make either integer literal for fixed length
2582 -- or a reference to the saved length for variable length.
2585 if Is_Fixed_Length (1) then
2587 Make_Integer_Literal (Loc,
2588 Intval => Fixed_Length (1));
2591 New_Reference_To (Var_Length (1), Loc);
2594 -- If entry is fixed length and only fixed lengths so far, make
2595 -- appropriate new integer literal adding new length.
2597 elsif Is_Fixed_Length (NN)
2598 and then Nkind (Aggr_Length (NN - 1)) = N_Integer_Literal
2601 Make_Integer_Literal (Loc,
2602 Intval => Fixed_Length (NN) + Intval (Aggr_Length (NN - 1)));
2604 -- All other cases, construct an addition node for the length and
2605 -- create an entity initialized to this length.
2609 Make_Defining_Identifier (Loc,
2610 Chars => New_Internal_Name ('L'));
2612 if Is_Fixed_Length (NN) then
2613 Clen := Make_Integer_Literal (Loc, Fixed_Length (NN));
2615 Clen := New_Reference_To (Var_Length (NN), Loc);
2619 Make_Object_Declaration (Loc,
2620 Defining_Identifier => Ent,
2621 Constant_Present => True,
2623 Object_Definition =>
2624 New_Occurrence_Of (Artyp, Loc),
2628 Left_Opnd => New_Copy (Aggr_Length (NN - 1)),
2629 Right_Opnd => Clen)));
2631 Aggr_Length (NN) := Make_Identifier (Loc, Chars => Chars (Ent));
2638 -- If we have only skipped null operands, return the last operand
2645 -- If we have only one non-null operand, return it and we are done.
2646 -- There is one case in which this cannot be done, and that is when
2647 -- the sole operand is of the element type, in which case it must be
2648 -- converted to an array, and the easiest way of doing that is to go
2649 -- through the normal general circuit.
2652 and then Base_Type (Etype (Operands (1))) /= Ctyp
2654 Result := Operands (1);
2658 -- Cases where we have a real concatenation
2660 -- Next step is to find the low bound for the result array that we
2661 -- will allocate. The rules for this are in (RM 4.5.6(5-7)).
2663 -- If the ultimate ancestor of the index subtype is a constrained array
2664 -- definition, then the lower bound is that of the index subtype as
2665 -- specified by (RM 4.5.3(6)).
2667 -- The right test here is to go to the root type, and then the ultimate
2668 -- ancestor is the first subtype of this root type.
2670 if Is_Constrained (First_Subtype (Root_Type (Atyp))) then
2672 Make_Attribute_Reference (Loc,
2674 New_Occurrence_Of (First_Subtype (Root_Type (Atyp)), Loc),
2675 Attribute_Name => Name_First);
2677 -- If the first operand in the list has known length we know that
2678 -- the lower bound of the result is the lower bound of this operand.
2680 elsif Is_Fixed_Length (1) then
2681 Low_Bound := Opnd_Low_Bound (1);
2683 -- OK, we don't know the lower bound, we have to build a horrible
2684 -- expression actions node of the form
2686 -- if Cond1'Length /= 0 then
2689 -- if Opnd2'Length /= 0 then
2694 -- The nesting ends either when we hit an operand whose length is known
2695 -- at compile time, or on reaching the last operand, whose low bound we
2696 -- take unconditionally whether or not it is null. It's easiest to do
2697 -- this with a recursive procedure:
2701 function Get_Known_Bound (J : Nat) return Node_Id;
2702 -- Returns the lower bound determined by operands J .. NN
2704 ---------------------
2705 -- Get_Known_Bound --
2706 ---------------------
2708 function Get_Known_Bound (J : Nat) return Node_Id is
2710 if Is_Fixed_Length (J) or else J = NN then
2711 return New_Copy (Opnd_Low_Bound (J));
2715 Make_Conditional_Expression (Loc,
2716 Expressions => New_List (
2719 Left_Opnd => New_Reference_To (Var_Length (J), Loc),
2720 Right_Opnd => Make_Integer_Literal (Loc, 0)),
2722 New_Copy (Opnd_Low_Bound (J)),
2723 Get_Known_Bound (J + 1)));
2725 end Get_Known_Bound;
2729 Make_Defining_Identifier (Loc, Chars => New_Internal_Name ('L'));
2732 Make_Object_Declaration (Loc,
2733 Defining_Identifier => Ent,
2734 Constant_Present => True,
2735 Object_Definition => New_Occurrence_Of (Ityp, Loc),
2736 Expression => Get_Known_Bound (1)));
2738 Low_Bound := New_Reference_To (Ent, Loc);
2742 -- Now we can safely compute the upper bound, normally
2743 -- Low_Bound + Length - 1.
2748 Left_Opnd => To_Artyp (New_Copy (Low_Bound)),
2750 Make_Op_Subtract (Loc,
2751 Left_Opnd => New_Copy (Aggr_Length (NN)),
2752 Right_Opnd => Make_Artyp_Literal (1))));
2754 -- Note that calculation of the high bound may cause overflow in some
2755 -- very weird cases, so in the general case we need an overflow check on
2756 -- the high bound. We can avoid this for the common case of string types
2757 -- and other types whose index is Positive, since we chose a wider range
2758 -- for the arithmetic type.
2760 if Istyp /= Standard_Positive then
2761 Activate_Overflow_Check (High_Bound);
2764 -- Handle the exceptional case where the result is null, in which case
2765 -- case the bounds come from the last operand (so that we get the proper
2766 -- bounds if the last operand is super-flat).
2768 if Result_May_Be_Null then
2770 Make_Conditional_Expression (Loc,
2771 Expressions => New_List (
2773 Left_Opnd => New_Copy (Aggr_Length (NN)),
2774 Right_Opnd => Make_Artyp_Literal (0)),
2775 Last_Opnd_High_Bound,
2779 -- Here is where we insert the saved up actions
2781 Insert_Actions (Cnode, Actions, Suppress => All_Checks);
2783 -- Now we construct an array object with appropriate bounds
2786 Make_Defining_Identifier (Loc,
2787 Chars => New_Internal_Name ('S'));
2789 -- If the bound is statically known to be out of range, we do not want
2790 -- to abort, we want a warning and a runtime constraint error. Note that
2791 -- we have arranged that the result will not be treated as a static
2792 -- constant, so we won't get an illegality during this insertion.
2794 Insert_Action (Cnode,
2795 Make_Object_Declaration (Loc,
2796 Defining_Identifier => Ent,
2797 Object_Definition =>
2798 Make_Subtype_Indication (Loc,
2799 Subtype_Mark => New_Occurrence_Of (Atyp, Loc),
2801 Make_Index_Or_Discriminant_Constraint (Loc,
2802 Constraints => New_List (
2804 Low_Bound => Low_Bound,
2805 High_Bound => High_Bound))))),
2806 Suppress => All_Checks);
2808 -- If the result of the concatenation appears as the initializing
2809 -- expression of an object declaration, we can just rename the
2810 -- result, rather than copying it.
2812 Set_OK_To_Rename (Ent);
2814 -- Catch the static out of range case now
2816 if Raises_Constraint_Error (High_Bound) then
2817 raise Concatenation_Error;
2820 -- Now we will generate the assignments to do the actual concatenation
2822 -- There is one case in which we will not do this, namely when all the
2823 -- following conditions are met:
2825 -- The result type is Standard.String
2827 -- There are nine or fewer retained (non-null) operands
2829 -- The optimization level is -O0
2831 -- The corresponding System.Concat_n.Str_Concat_n routine is
2832 -- available in the run time.
2834 -- The debug flag gnatd.c is not set
2836 -- If all these conditions are met then we generate a call to the
2837 -- relevant concatenation routine. The purpose of this is to avoid
2838 -- undesirable code bloat at -O0.
2840 if Atyp = Standard_String
2841 and then NN in 2 .. 9
2842 and then (Opt.Optimization_Level = 0 or else Debug_Flag_Dot_CC)
2843 and then not Debug_Flag_Dot_C
2846 RR : constant array (Nat range 2 .. 9) of RE_Id :=
2857 if RTE_Available (RR (NN)) then
2859 Opnds : constant List_Id :=
2860 New_List (New_Occurrence_Of (Ent, Loc));
2863 for J in 1 .. NN loop
2864 if Is_List_Member (Operands (J)) then
2865 Remove (Operands (J));
2868 if Base_Type (Etype (Operands (J))) = Ctyp then
2870 Make_Aggregate (Loc,
2871 Component_Associations => New_List (
2872 Make_Component_Association (Loc,
2873 Choices => New_List (
2874 Make_Integer_Literal (Loc, 1)),
2875 Expression => Operands (J)))));
2878 Append_To (Opnds, Operands (J));
2882 Insert_Action (Cnode,
2883 Make_Procedure_Call_Statement (Loc,
2884 Name => New_Reference_To (RTE (RR (NN)), Loc),
2885 Parameter_Associations => Opnds));
2887 Result := New_Reference_To (Ent, Loc);
2894 -- Not special case so generate the assignments
2896 Known_Non_Null_Operand_Seen := False;
2898 for J in 1 .. NN loop
2900 Lo : constant Node_Id :=
2902 Left_Opnd => To_Artyp (New_Copy (Low_Bound)),
2903 Right_Opnd => Aggr_Length (J - 1));
2905 Hi : constant Node_Id :=
2907 Left_Opnd => To_Artyp (New_Copy (Low_Bound)),
2909 Make_Op_Subtract (Loc,
2910 Left_Opnd => Aggr_Length (J),
2911 Right_Opnd => Make_Artyp_Literal (1)));
2914 -- Singleton case, simple assignment
2916 if Base_Type (Etype (Operands (J))) = Ctyp then
2917 Known_Non_Null_Operand_Seen := True;
2918 Insert_Action (Cnode,
2919 Make_Assignment_Statement (Loc,
2921 Make_Indexed_Component (Loc,
2922 Prefix => New_Occurrence_Of (Ent, Loc),
2923 Expressions => New_List (To_Ityp (Lo))),
2924 Expression => Operands (J)),
2925 Suppress => All_Checks);
2927 -- Array case, slice assignment, skipped when argument is fixed
2928 -- length and known to be null.
2930 elsif (not Is_Fixed_Length (J)) or else (Fixed_Length (J) > 0) then
2933 Make_Assignment_Statement (Loc,
2937 New_Occurrence_Of (Ent, Loc),
2940 Low_Bound => To_Ityp (Lo),
2941 High_Bound => To_Ityp (Hi))),
2942 Expression => Operands (J));
2944 if Is_Fixed_Length (J) then
2945 Known_Non_Null_Operand_Seen := True;
2947 elsif not Known_Non_Null_Operand_Seen then
2949 -- Here if operand length is not statically known and no
2950 -- operand known to be non-null has been processed yet.
2951 -- If operand length is 0, we do not need to perform the
2952 -- assignment, and we must avoid the evaluation of the
2953 -- high bound of the slice, since it may underflow if the
2954 -- low bound is Ityp'First.
2957 Make_Implicit_If_Statement (Cnode,
2961 New_Occurrence_Of (Var_Length (J), Loc),
2962 Right_Opnd => Make_Integer_Literal (Loc, 0)),
2967 Insert_Action (Cnode, Assign, Suppress => All_Checks);
2973 -- Finally we build the result, which is a reference to the array object
2975 Result := New_Reference_To (Ent, Loc);
2978 Rewrite (Cnode, Result);
2979 Analyze_And_Resolve (Cnode, Atyp);
2982 when Concatenation_Error =>
2984 -- Kill warning generated for the declaration of the static out of
2985 -- range high bound, and instead generate a Constraint_Error with
2986 -- an appropriate specific message.
2988 Kill_Dead_Code (Declaration_Node (Entity (High_Bound)));
2989 Apply_Compile_Time_Constraint_Error
2991 Msg => "concatenation result upper bound out of range?",
2992 Reason => CE_Range_Check_Failed);
2993 -- Set_Etype (Cnode, Atyp);
2994 end Expand_Concatenate;
2996 ------------------------
2997 -- Expand_N_Allocator --
2998 ------------------------
3000 procedure Expand_N_Allocator (N : Node_Id) is
3001 PtrT : constant Entity_Id := Etype (N);
3002 Dtyp : constant Entity_Id := Designated_Type (PtrT);
3003 Etyp : constant Entity_Id := Etype (Expression (N));
3004 Loc : constant Source_Ptr := Sloc (N);
3009 procedure Complete_Coextension_Finalization;
3010 -- Generate finalization calls for all nested coextensions of N. This
3011 -- routine may allocate list controllers if necessary.
3013 procedure Rewrite_Coextension (N : Node_Id);
3014 -- Static coextensions have the same lifetime as the entity they
3015 -- constrain. Such occurrences can be rewritten as aliased objects
3016 -- and their unrestricted access used instead of the coextension.
3018 function Size_In_Storage_Elements (E : Entity_Id) return Node_Id;
3019 -- Given a constrained array type E, returns a node representing the
3020 -- code to compute the size in storage elements for the given type.
3021 -- This is done without using the attribute (which malfunctions for
3024 ---------------------------------------
3025 -- Complete_Coextension_Finalization --
3026 ---------------------------------------
3028 procedure Complete_Coextension_Finalization is
3030 Coext_Elmt : Elmt_Id;
3034 function Inside_A_Return_Statement (N : Node_Id) return Boolean;
3035 -- Determine whether node N is part of a return statement
3037 function Needs_Initialization_Call (N : Node_Id) return Boolean;
3038 -- Determine whether node N is a subtype indicator allocator which
3039 -- acts a coextension. Such coextensions need initialization.
3041 -------------------------------
3042 -- Inside_A_Return_Statement --
3043 -------------------------------
3045 function Inside_A_Return_Statement (N : Node_Id) return Boolean is
3050 while Present (P) loop
3052 (P, N_Extended_Return_Statement, N_Simple_Return_Statement)
3056 -- Stop the traversal when we reach a subprogram body
3058 elsif Nkind (P) = N_Subprogram_Body then
3066 end Inside_A_Return_Statement;
3068 -------------------------------
3069 -- Needs_Initialization_Call --
3070 -------------------------------
3072 function Needs_Initialization_Call (N : Node_Id) return Boolean is
3076 if Nkind (N) = N_Explicit_Dereference
3077 and then Nkind (Prefix (N)) = N_Identifier
3078 and then Nkind (Parent (Entity (Prefix (N)))) =
3079 N_Object_Declaration
3081 Obj_Decl := Parent (Entity (Prefix (N)));
3084 Present (Expression (Obj_Decl))
3085 and then Nkind (Expression (Obj_Decl)) = N_Allocator
3086 and then Nkind (Expression (Expression (Obj_Decl))) /=
3087 N_Qualified_Expression;
3091 end Needs_Initialization_Call;
3093 -- Start of processing for Complete_Coextension_Finalization
3096 -- When a coextension root is inside a return statement, we need to
3097 -- use the finalization chain of the function's scope. This does not
3098 -- apply for controlled named access types because in those cases we
3099 -- can use the finalization chain of the type itself.
3101 if Inside_A_Return_Statement (N)
3103 (Ekind (PtrT) = E_Anonymous_Access_Type
3105 (Ekind (PtrT) = E_Access_Type
3106 and then No (Associated_Final_Chain (PtrT))))
3110 Outer_S : Entity_Id;
3111 S : Entity_Id := Current_Scope;
3114 while Present (S) and then S /= Standard_Standard loop
3115 if Ekind (S) = E_Function then
3116 Outer_S := Scope (S);
3118 -- Retrieve the declaration of the body
3123 (Corresponding_Body (Parent (Parent (S)))));
3130 -- Push the scope of the function body since we are inserting
3131 -- the list before the body, but we are currently in the body
3132 -- itself. Override the finalization list of PtrT since the
3133 -- finalization context is now different.
3135 Push_Scope (Outer_S);
3136 Build_Final_List (Decl, PtrT);
3140 -- The root allocator may not be controlled, but it still needs a
3141 -- finalization list for all nested coextensions.
3143 elsif No (Associated_Final_Chain (PtrT)) then
3144 Build_Final_List (N, PtrT);
3148 Make_Selected_Component (Loc,
3150 New_Reference_To (Associated_Final_Chain (PtrT), Loc),
3152 Make_Identifier (Loc, Name_F));
3154 Coext_Elmt := First_Elmt (Coextensions (N));
3155 while Present (Coext_Elmt) loop
3156 Coext := Node (Coext_Elmt);
3161 if Nkind (Coext) = N_Identifier then
3163 Make_Unchecked_Type_Conversion (Loc,
3164 Subtype_Mark => New_Reference_To (Etype (Coext), Loc),
3166 Make_Explicit_Dereference (Loc,
3167 Prefix => New_Copy_Tree (Coext)));
3169 Ref := New_Copy_Tree (Coext);
3172 -- No initialization call if not allowed
3174 Check_Restriction (No_Default_Initialization, N);
3176 if not Restriction_Active (No_Default_Initialization) then
3180 -- attach_to_final_list (Ref, Flist, 2)
3182 if Needs_Initialization_Call (Coext) then
3186 Typ => Etype (Coext),
3188 With_Attach => Make_Integer_Literal (Loc, Uint_2)));
3191 -- attach_to_final_list (Ref, Flist, 2)
3197 Flist_Ref => New_Copy_Tree (Flist),
3198 With_Attach => Make_Integer_Literal (Loc, Uint_2)));
3202 Next_Elmt (Coext_Elmt);
3204 end Complete_Coextension_Finalization;
3206 -------------------------
3207 -- Rewrite_Coextension --
3208 -------------------------
3210 procedure Rewrite_Coextension (N : Node_Id) is
3211 Temp : constant Node_Id :=
3212 Make_Defining_Identifier (Loc,
3213 New_Internal_Name ('C'));
3216 -- Cnn : aliased Etyp;
3218 Decl : constant Node_Id :=
3219 Make_Object_Declaration (Loc,
3220 Defining_Identifier => Temp,
3221 Aliased_Present => True,
3222 Object_Definition =>
3223 New_Occurrence_Of (Etyp, Loc));
3227 if Nkind (Expression (N)) = N_Qualified_Expression then
3228 Set_Expression (Decl, Expression (Expression (N)));
3231 -- Find the proper insertion node for the declaration
3234 while Present (Nod) loop
3235 exit when Nkind (Nod) in N_Statement_Other_Than_Procedure_Call
3236 or else Nkind (Nod) = N_Procedure_Call_Statement
3237 or else Nkind (Nod) in N_Declaration;
3238 Nod := Parent (Nod);
3241 Insert_Before (Nod, Decl);
3245 Make_Attribute_Reference (Loc,
3246 Prefix => New_Occurrence_Of (Temp, Loc),
3247 Attribute_Name => Name_Unrestricted_Access));
3249 Analyze_And_Resolve (N, PtrT);
3250 end Rewrite_Coextension;
3252 ------------------------------
3253 -- Size_In_Storage_Elements --
3254 ------------------------------
3256 function Size_In_Storage_Elements (E : Entity_Id) return Node_Id is
3258 -- Logically this just returns E'Max_Size_In_Storage_Elements.
3259 -- However, the reason for the existence of this function is
3260 -- to construct a test for sizes too large, which means near the
3261 -- 32-bit limit on a 32-bit machine, and precisely the trouble
3262 -- is that we get overflows when sizes are greater than 2**31.
3264 -- So what we end up doing for array types is to use the expression:
3266 -- number-of-elements * component_type'Max_Size_In_Storage_Elements
3268 -- which avoids this problem. All this is a big bogus, but it does
3269 -- mean we catch common cases of trying to allocate arrays that
3270 -- are too large, and which in the absence of a check results in
3271 -- undetected chaos ???
3278 for J in 1 .. Number_Dimensions (E) loop
3280 Make_Attribute_Reference (Loc,
3281 Prefix => New_Occurrence_Of (E, Loc),
3282 Attribute_Name => Name_Length,
3283 Expressions => New_List (
3284 Make_Integer_Literal (Loc, J)));
3291 Make_Op_Multiply (Loc,
3298 Make_Op_Multiply (Loc,
3301 Make_Attribute_Reference (Loc,
3302 Prefix => New_Occurrence_Of (Component_Type (E), Loc),
3303 Attribute_Name => Name_Max_Size_In_Storage_Elements));
3305 end Size_In_Storage_Elements;
3307 -- Start of processing for Expand_N_Allocator
3310 -- RM E.2.3(22). We enforce that the expected type of an allocator
3311 -- shall not be a remote access-to-class-wide-limited-private type
3313 -- Why is this being done at expansion time, seems clearly wrong ???
3315 Validate_Remote_Access_To_Class_Wide_Type (N);
3317 -- Set the Storage Pool
3319 Set_Storage_Pool (N, Associated_Storage_Pool (Root_Type (PtrT)));
3321 if Present (Storage_Pool (N)) then
3322 if Is_RTE (Storage_Pool (N), RE_SS_Pool) then
3323 if VM_Target = No_VM then
3324 Set_Procedure_To_Call (N, RTE (RE_SS_Allocate));
3327 elsif Is_Class_Wide_Type (Etype (Storage_Pool (N))) then
3328 Set_Procedure_To_Call (N, RTE (RE_Allocate_Any));
3331 Set_Procedure_To_Call (N,
3332 Find_Prim_Op (Etype (Storage_Pool (N)), Name_Allocate));
3336 -- Under certain circumstances we can replace an allocator by an access
3337 -- to statically allocated storage. The conditions, as noted in AARM
3338 -- 3.10 (10c) are as follows:
3340 -- Size and initial value is known at compile time
3341 -- Access type is access-to-constant
3343 -- The allocator is not part of a constraint on a record component,
3344 -- because in that case the inserted actions are delayed until the
3345 -- record declaration is fully analyzed, which is too late for the
3346 -- analysis of the rewritten allocator.
3348 if Is_Access_Constant (PtrT)
3349 and then Nkind (Expression (N)) = N_Qualified_Expression
3350 and then Compile_Time_Known_Value (Expression (Expression (N)))
3351 and then Size_Known_At_Compile_Time (Etype (Expression
3353 and then not Is_Record_Type (Current_Scope)
3355 -- Here we can do the optimization. For the allocator
3359 -- We insert an object declaration
3361 -- Tnn : aliased x := y;
3363 -- and replace the allocator by Tnn'Unrestricted_Access. Tnn is
3364 -- marked as requiring static allocation.
3367 Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
3369 Desig := Subtype_Mark (Expression (N));
3371 -- If context is constrained, use constrained subtype directly,
3372 -- so that the constant is not labelled as having a nominally
3373 -- unconstrained subtype.
3375 if Entity (Desig) = Base_Type (Dtyp) then
3376 Desig := New_Occurrence_Of (Dtyp, Loc);
3380 Make_Object_Declaration (Loc,
3381 Defining_Identifier => Temp,
3382 Aliased_Present => True,
3383 Constant_Present => Is_Access_Constant (PtrT),
3384 Object_Definition => Desig,
3385 Expression => Expression (Expression (N))));
3388 Make_Attribute_Reference (Loc,
3389 Prefix => New_Occurrence_Of (Temp, Loc),
3390 Attribute_Name => Name_Unrestricted_Access));
3392 Analyze_And_Resolve (N, PtrT);
3394 -- We set the variable as statically allocated, since we don't want
3395 -- it going on the stack of the current procedure!
3397 Set_Is_Statically_Allocated (Temp);
3401 -- Same if the allocator is an access discriminant for a local object:
3402 -- instead of an allocator we create a local value and constrain the
3403 -- the enclosing object with the corresponding access attribute.
3405 if Is_Static_Coextension (N) then
3406 Rewrite_Coextension (N);
3410 -- The current allocator creates an object which may contain nested
3411 -- coextensions. Use the current allocator's finalization list to
3412 -- generate finalization call for all nested coextensions.
3414 if Is_Coextension_Root (N) then
3415 Complete_Coextension_Finalization;
3418 -- Check for size too large, we do this because the back end misses
3419 -- proper checks here and can generate rubbish allocation calls when
3420 -- we are near the limit. We only do this for the 32-bit address case
3421 -- since that is from a practical point of view where we see a problem.
3423 if System_Address_Size = 32
3424 and then not Storage_Checks_Suppressed (PtrT)
3425 and then not Storage_Checks_Suppressed (Dtyp)
3426 and then not Storage_Checks_Suppressed (Etyp)
3428 -- The check we want to generate should look like
3430 -- if Etyp'Max_Size_In_Storage_Elements > 3.5 gigabytes then
3431 -- raise Storage_Error;
3434 -- where 3.5 gigabytes is a constant large enough to accomodate any
3435 -- reasonable request for. But we can't do it this way because at
3436 -- least at the moment we don't compute this attribute right, and
3437 -- can silently give wrong results when the result gets large. Since
3438 -- this is all about large results, that's bad, so instead we only
3439 -- apply the check for constrained arrays, and manually compute the
3440 -- value of the attribute ???
3442 if Is_Array_Type (Etyp) and then Is_Constrained (Etyp) then
3444 Make_Raise_Storage_Error (Loc,
3447 Left_Opnd => Size_In_Storage_Elements (Etyp),
3449 Make_Integer_Literal (Loc,
3450 Intval => Uint_7 * (Uint_2 ** 29))),
3451 Reason => SE_Object_Too_Large));
3455 -- Handle case of qualified expression (other than optimization above)
3456 -- First apply constraint checks, because the bounds or discriminants
3457 -- in the aggregate might not match the subtype mark in the allocator.
3459 if Nkind (Expression (N)) = N_Qualified_Expression then
3460 Apply_Constraint_Check
3461 (Expression (Expression (N)), Etype (Expression (N)));
3463 Expand_Allocator_Expression (N);
3467 -- If the allocator is for a type which requires initialization, and
3468 -- there is no initial value (i.e. operand is a subtype indication
3469 -- rather than a qualified expression), then we must generate a call to
3470 -- the initialization routine using an expressions action node:
3472 -- [Pnnn : constant ptr_T := new (T); Init (Pnnn.all,...); Pnnn]
3474 -- Here ptr_T is the pointer type for the allocator, and T is the
3475 -- subtype of the allocator. A special case arises if the designated
3476 -- type of the access type is a task or contains tasks. In this case
3477 -- the call to Init (Temp.all ...) is replaced by code that ensures
3478 -- that tasks get activated (see Exp_Ch9.Build_Task_Allocate_Block
3479 -- for details). In addition, if the type T is a task T, then the
3480 -- first argument to Init must be converted to the task record type.
3483 T : constant Entity_Id := Entity (Expression (N));
3491 Temp_Decl : Node_Id;
3492 Temp_Type : Entity_Id;
3493 Attach_Level : Uint;
3496 if No_Initialization (N) then
3499 -- Case of no initialization procedure present
3501 elsif not Has_Non_Null_Base_Init_Proc (T) then
3503 -- Case of simple initialization required
3505 if Needs_Simple_Initialization (T) then
3506 Check_Restriction (No_Default_Initialization, N);
3507 Rewrite (Expression (N),
3508 Make_Qualified_Expression (Loc,
3509 Subtype_Mark => New_Occurrence_Of (T, Loc),
3510 Expression => Get_Simple_Init_Val (T, N)));
3512 Analyze_And_Resolve (Expression (Expression (N)), T);
3513 Analyze_And_Resolve (Expression (N), T);
3514 Set_Paren_Count (Expression (Expression (N)), 1);
3515 Expand_N_Allocator (N);
3517 -- No initialization required
3523 -- Case of initialization procedure present, must be called
3526 Check_Restriction (No_Default_Initialization, N);
3528 if not Restriction_Active (No_Default_Initialization) then
3529 Init := Base_Init_Proc (T);
3531 Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
3533 -- Construct argument list for the initialization routine call
3536 Make_Explicit_Dereference (Loc,
3537 Prefix => New_Reference_To (Temp, Loc));
3538 Set_Assignment_OK (Arg1);
3541 -- The initialization procedure expects a specific type. if the
3542 -- context is access to class wide, indicate that the object
3543 -- being allocated has the right specific type.
3545 if Is_Class_Wide_Type (Dtyp) then
3546 Arg1 := Unchecked_Convert_To (T, Arg1);
3549 -- If designated type is a concurrent type or if it is private
3550 -- type whose definition is a concurrent type, the first
3551 -- argument in the Init routine has to be unchecked conversion
3552 -- to the corresponding record type. If the designated type is
3553 -- a derived type, we also convert the argument to its root
3556 if Is_Concurrent_Type (T) then
3558 Unchecked_Convert_To (Corresponding_Record_Type (T), Arg1);
3560 elsif Is_Private_Type (T)
3561 and then Present (Full_View (T))
3562 and then Is_Concurrent_Type (Full_View (T))
3565 Unchecked_Convert_To
3566 (Corresponding_Record_Type (Full_View (T)), Arg1);
3568 elsif Etype (First_Formal (Init)) /= Base_Type (T) then
3570 Ftyp : constant Entity_Id := Etype (First_Formal (Init));
3572 Arg1 := OK_Convert_To (Etype (Ftyp), Arg1);
3573 Set_Etype (Arg1, Ftyp);
3577 Args := New_List (Arg1);
3579 -- For the task case, pass the Master_Id of the access type as
3580 -- the value of the _Master parameter, and _Chain as the value
3581 -- of the _Chain parameter (_Chain will be defined as part of
3582 -- the generated code for the allocator).
3584 -- In Ada 2005, the context may be a function that returns an
3585 -- anonymous access type. In that case the Master_Id has been
3586 -- created when expanding the function declaration.
3588 if Has_Task (T) then
3589 if No (Master_Id (Base_Type (PtrT))) then
3591 -- If we have a non-library level task with restriction
3592 -- No_Task_Hierarchy set, then no point in expanding.
3594 if not Is_Library_Level_Entity (T)
3595 and then Restriction_Active (No_Task_Hierarchy)
3600 -- The designated type was an incomplete type, and the
3601 -- access type did not get expanded. Salvage it now.
3603 pragma Assert (Present (Parent (Base_Type (PtrT))));
3604 Expand_N_Full_Type_Declaration
3605 (Parent (Base_Type (PtrT)));
3608 -- If the context of the allocator is a declaration or an
3609 -- assignment, we can generate a meaningful image for it,
3610 -- even though subsequent assignments might remove the
3611 -- connection between task and entity. We build this image
3612 -- when the left-hand side is a simple variable, a simple
3613 -- indexed assignment or a simple selected component.
3615 if Nkind (Parent (N)) = N_Assignment_Statement then
3617 Nam : constant Node_Id := Name (Parent (N));
3620 if Is_Entity_Name (Nam) then
3622 Build_Task_Image_Decls
3625 (Entity (Nam), Sloc (Nam)), T);
3628 (Nam, N_Indexed_Component, N_Selected_Component)
3629 and then Is_Entity_Name (Prefix (Nam))
3632 Build_Task_Image_Decls
3633 (Loc, Nam, Etype (Prefix (Nam)));
3635 Decls := Build_Task_Image_Decls (Loc, T, T);
3639 elsif Nkind (Parent (N)) = N_Object_Declaration then
3641 Build_Task_Image_Decls
3642 (Loc, Defining_Identifier (Parent (N)), T);
3645 Decls := Build_Task_Image_Decls (Loc, T, T);
3650 (Master_Id (Base_Type (Root_Type (PtrT))), Loc));
3651 Append_To (Args, Make_Identifier (Loc, Name_uChain));
3653 Decl := Last (Decls);
3655 New_Occurrence_Of (Defining_Identifier (Decl), Loc));
3657 -- Has_Task is false, Decls not used
3663 -- Add discriminants if discriminated type
3666 Dis : Boolean := False;
3670 if Has_Discriminants (T) then
3674 elsif Is_Private_Type (T)
3675 and then Present (Full_View (T))
3676 and then Has_Discriminants (Full_View (T))
3679 Typ := Full_View (T);
3684 -- If the allocated object will be constrained by the
3685 -- default values for discriminants, then build a subtype
3686 -- with those defaults, and change the allocated subtype
3687 -- to that. Note that this happens in fewer cases in Ada
3690 if not Is_Constrained (Typ)
3691 and then Present (Discriminant_Default_Value
3692 (First_Discriminant (Typ)))
3693 and then (Ada_Version < Ada_05
3695 not Has_Constrained_Partial_View (Typ))
3697 Typ := Build_Default_Subtype (Typ, N);
3698 Set_Expression (N, New_Reference_To (Typ, Loc));
3701 Discr := First_Elmt (Discriminant_Constraint (Typ));
3702 while Present (Discr) loop
3703 Nod := Node (Discr);
3704 Append (New_Copy_Tree (Node (Discr)), Args);
3706 -- AI-416: when the discriminant constraint is an
3707 -- anonymous access type make sure an accessibility
3708 -- check is inserted if necessary (3.10.2(22.q/2))
3710 if Ada_Version >= Ada_05
3712 Ekind (Etype (Nod)) = E_Anonymous_Access_Type
3714 Apply_Accessibility_Check
3715 (Nod, Typ, Insert_Node => Nod);
3723 -- We set the allocator as analyzed so that when we analyze the
3724 -- expression actions node, we do not get an unwanted recursive
3725 -- expansion of the allocator expression.
3727 Set_Analyzed (N, True);
3728 Nod := Relocate_Node (N);
3730 -- Here is the transformation:
3732 -- output: Temp : constant ptr_T := new T;
3733 -- Init (Temp.all, ...);
3734 -- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
3735 -- <CTRL> Initialize (Finalizable (Temp.all));
3737 -- Here ptr_T is the pointer type for the allocator, and is the
3738 -- subtype of the allocator.
3741 Make_Object_Declaration (Loc,
3742 Defining_Identifier => Temp,
3743 Constant_Present => True,
3744 Object_Definition => New_Reference_To (Temp_Type, Loc),
3747 Set_Assignment_OK (Temp_Decl);
3748 Insert_Action (N, Temp_Decl, Suppress => All_Checks);
3750 -- If the designated type is a task type or contains tasks,
3751 -- create block to activate created tasks, and insert
3752 -- declaration for Task_Image variable ahead of call.
3754 if Has_Task (T) then
3756 L : constant List_Id := New_List;
3759 Build_Task_Allocate_Block (L, Nod, Args);
3761 Insert_List_Before (First (Declarations (Blk)), Decls);
3762 Insert_Actions (N, L);
3767 Make_Procedure_Call_Statement (Loc,
3768 Name => New_Reference_To (Init, Loc),
3769 Parameter_Associations => Args));
3772 if Needs_Finalization (T) then
3774 -- Postpone the generation of a finalization call for the
3775 -- current allocator if it acts as a coextension.
3777 if Is_Dynamic_Coextension (N) then
3778 if No (Coextensions (N)) then
3779 Set_Coextensions (N, New_Elmt_List);
3782 Append_Elmt (New_Copy_Tree (Arg1), Coextensions (N));
3786 Get_Allocator_Final_List (N, Base_Type (T), PtrT);
3788 -- Anonymous access types created for access parameters
3789 -- are attached to an explicitly constructed controller,
3790 -- which ensures that they can be finalized properly,
3791 -- even if their deallocation might not happen. The list
3792 -- associated with the controller is doubly-linked. For
3793 -- other anonymous access types, the object may end up
3794 -- on the global final list which is singly-linked.
3795 -- Work needed for access discriminants in Ada 2005 ???
3797 if Ekind (PtrT) = E_Anonymous_Access_Type then
3798 Attach_Level := Uint_1;
3800 Attach_Level := Uint_2;
3805 Ref => New_Copy_Tree (Arg1),
3808 With_Attach => Make_Integer_Literal (Loc,
3809 Intval => Attach_Level)));
3813 Rewrite (N, New_Reference_To (Temp, Loc));
3814 Analyze_And_Resolve (N, PtrT);
3819 -- Ada 2005 (AI-251): If the allocator is for a class-wide interface
3820 -- object that has been rewritten as a reference, we displace "this"
3821 -- to reference properly its secondary dispatch table.
3823 if Nkind (N) = N_Identifier
3824 and then Is_Interface (Dtyp)
3826 Displace_Allocator_Pointer (N);
3830 when RE_Not_Available =>
3832 end Expand_N_Allocator;
3834 -----------------------
3835 -- Expand_N_And_Then --
3836 -----------------------
3838 -- Expand into conditional expression if Actions present, and also deal
3839 -- with optimizing case of arguments being True or False.
3841 procedure Expand_N_And_Then (N : Node_Id) is
3842 Loc : constant Source_Ptr := Sloc (N);
3843 Typ : constant Entity_Id := Etype (N);
3844 Left : constant Node_Id := Left_Opnd (N);
3845 Right : constant Node_Id := Right_Opnd (N);
3849 -- Deal with non-standard booleans
3851 if Is_Boolean_Type (Typ) then
3852 Adjust_Condition (Left);
3853 Adjust_Condition (Right);
3854 Set_Etype (N, Standard_Boolean);
3857 -- Check for cases where left argument is known to be True or False
3859 if Compile_Time_Known_Value (Left) then
3861 -- If left argument is True, change (True and then Right) to Right.
3862 -- Any actions associated with Right will be executed unconditionally
3863 -- and can thus be inserted into the tree unconditionally.
3865 if Expr_Value_E (Left) = Standard_True then
3866 if Present (Actions (N)) then
3867 Insert_Actions (N, Actions (N));
3872 -- If left argument is False, change (False and then Right) to False.
3873 -- In this case we can forget the actions associated with Right,
3874 -- since they will never be executed.
3876 else pragma Assert (Expr_Value_E (Left) = Standard_False);
3877 Kill_Dead_Code (Right);
3878 Kill_Dead_Code (Actions (N));
3879 Rewrite (N, New_Occurrence_Of (Standard_False, Loc));
3882 Adjust_Result_Type (N, Typ);
3886 -- If Actions are present, we expand
3888 -- left and then right
3892 -- if left then right else false end
3894 -- with the actions becoming the Then_Actions of the conditional
3895 -- expression. This conditional expression is then further expanded
3896 -- (and will eventually disappear)
3898 if Present (Actions (N)) then
3899 Actlist := Actions (N);
3901 Make_Conditional_Expression (Loc,
3902 Expressions => New_List (
3905 New_Occurrence_Of (Standard_False, Loc))));
3907 Set_Then_Actions (N, Actlist);
3908 Analyze_And_Resolve (N, Standard_Boolean);
3909 Adjust_Result_Type (N, Typ);
3913 -- No actions present, check for cases of right argument True/False
3915 if Compile_Time_Known_Value (Right) then
3917 -- Change (Left and then True) to Left. Note that we know there are
3918 -- no actions associated with the True operand, since we just checked
3919 -- for this case above.
3921 if Expr_Value_E (Right) = Standard_True then
3924 -- Change (Left and then False) to False, making sure to preserve any
3925 -- side effects associated with the Left operand.
3927 else pragma Assert (Expr_Value_E (Right) = Standard_False);
3928 Remove_Side_Effects (Left);
3930 (N, New_Occurrence_Of (Standard_False, Loc));
3934 Adjust_Result_Type (N, Typ);
3935 end Expand_N_And_Then;
3937 -------------------------------------
3938 -- Expand_N_Conditional_Expression --
3939 -------------------------------------
3941 -- Expand into expression actions if then/else actions present
3943 procedure Expand_N_Conditional_Expression (N : Node_Id) is
3944 Loc : constant Source_Ptr := Sloc (N);
3945 Cond : constant Node_Id := First (Expressions (N));
3946 Thenx : constant Node_Id := Next (Cond);
3947 Elsex : constant Node_Id := Next (Thenx);
3948 Typ : constant Entity_Id := Etype (N);
3953 -- If either then or else actions are present, then given:
3955 -- if cond then then-expr else else-expr end
3957 -- we insert the following sequence of actions (using Insert_Actions):
3962 -- Cnn := then-expr;
3968 -- and replace the conditional expression by a reference to Cnn
3970 if Present (Then_Actions (N)) or else Present (Else_Actions (N)) then
3971 Cnn := Make_Defining_Identifier (Loc, New_Internal_Name ('C'));
3974 Make_Implicit_If_Statement (N,
3975 Condition => Relocate_Node (Cond),
3977 Then_Statements => New_List (
3978 Make_Assignment_Statement (Sloc (Thenx),
3979 Name => New_Occurrence_Of (Cnn, Sloc (Thenx)),
3980 Expression => Relocate_Node (Thenx))),
3982 Else_Statements => New_List (
3983 Make_Assignment_Statement (Sloc (Elsex),
3984 Name => New_Occurrence_Of (Cnn, Sloc (Elsex)),
3985 Expression => Relocate_Node (Elsex))));
3987 Set_Assignment_OK (Name (First (Then_Statements (New_If))));
3988 Set_Assignment_OK (Name (First (Else_Statements (New_If))));
3990 if Present (Then_Actions (N)) then
3992 (First (Then_Statements (New_If)), Then_Actions (N));
3995 if Present (Else_Actions (N)) then
3997 (First (Else_Statements (New_If)), Else_Actions (N));
4000 Rewrite (N, New_Occurrence_Of (Cnn, Loc));
4003 Make_Object_Declaration (Loc,
4004 Defining_Identifier => Cnn,
4005 Object_Definition => New_Occurrence_Of (Typ, Loc)));
4007 Insert_Action (N, New_If);
4008 Analyze_And_Resolve (N, Typ);
4010 end Expand_N_Conditional_Expression;
4012 -----------------------------------
4013 -- Expand_N_Explicit_Dereference --
4014 -----------------------------------
4016 procedure Expand_N_Explicit_Dereference (N : Node_Id) is
4018 -- Insert explicit dereference call for the checked storage pool case
4020 Insert_Dereference_Action (Prefix (N));
4021 end Expand_N_Explicit_Dereference;
4027 procedure Expand_N_In (N : Node_Id) is
4028 Loc : constant Source_Ptr := Sloc (N);
4029 Rtyp : constant Entity_Id := Etype (N);
4030 Lop : constant Node_Id := Left_Opnd (N);
4031 Rop : constant Node_Id := Right_Opnd (N);
4032 Static : constant Boolean := Is_OK_Static_Expression (N);
4034 procedure Substitute_Valid_Check;
4035 -- Replaces node N by Lop'Valid. This is done when we have an explicit
4036 -- test for the left operand being in range of its subtype.
4038 ----------------------------
4039 -- Substitute_Valid_Check --
4040 ----------------------------
4042 procedure Substitute_Valid_Check is
4045 Make_Attribute_Reference (Loc,
4046 Prefix => Relocate_Node (Lop),
4047 Attribute_Name => Name_Valid));
4049 Analyze_And_Resolve (N, Rtyp);
4051 Error_Msg_N ("?explicit membership test may be optimized away", N);
4052 Error_Msg_N ("\?use ''Valid attribute instead", N);
4054 end Substitute_Valid_Check;
4056 -- Start of processing for Expand_N_In
4059 -- Check case of explicit test for an expression in range of its
4060 -- subtype. This is suspicious usage and we replace it with a 'Valid
4061 -- test and give a warning.
4063 if Is_Scalar_Type (Etype (Lop))
4064 and then Nkind (Rop) in N_Has_Entity
4065 and then Etype (Lop) = Entity (Rop)
4066 and then Comes_From_Source (N)
4067 and then VM_Target = No_VM
4069 Substitute_Valid_Check;
4073 -- Do validity check on operands
4075 if Validity_Checks_On and Validity_Check_Operands then
4076 Ensure_Valid (Left_Opnd (N));
4077 Validity_Check_Range (Right_Opnd (N));
4080 -- Case of explicit range
4082 if Nkind (Rop) = N_Range then
4084 Lo : constant Node_Id := Low_Bound (Rop);
4085 Hi : constant Node_Id := High_Bound (Rop);
4087 Ltyp : constant Entity_Id := Etype (Lop);
4089 Lo_Orig : constant Node_Id := Original_Node (Lo);
4090 Hi_Orig : constant Node_Id := Original_Node (Hi);
4092 Lcheck : Compare_Result;
4093 Ucheck : Compare_Result;
4095 Warn1 : constant Boolean :=
4096 Constant_Condition_Warnings
4097 and then Comes_From_Source (N)
4098 and then not In_Instance;
4099 -- This must be true for any of the optimization warnings, we
4100 -- clearly want to give them only for source with the flag on.
4101 -- We also skip these warnings in an instance since it may be
4102 -- the case that different instantiations have different ranges.
4104 Warn2 : constant Boolean :=
4106 and then Nkind (Original_Node (Rop)) = N_Range
4107 and then Is_Integer_Type (Etype (Lo));
4108 -- For the case where only one bound warning is elided, we also
4109 -- insist on an explicit range and an integer type. The reason is
4110 -- that the use of enumeration ranges including an end point is
4111 -- common, as is the use of a subtype name, one of whose bounds
4112 -- is the same as the type of the expression.
4115 -- If test is explicit x'first .. x'last, replace by valid check
4117 if Is_Scalar_Type (Ltyp)
4118 and then Nkind (Lo_Orig) = N_Attribute_Reference
4119 and then Attribute_Name (Lo_Orig) = Name_First
4120 and then Nkind (Prefix (Lo_Orig)) in N_Has_Entity
4121 and then Entity (Prefix (Lo_Orig)) = Ltyp
4122 and then Nkind (Hi_Orig) = N_Attribute_Reference
4123 and then Attribute_Name (Hi_Orig) = Name_Last
4124 and then Nkind (Prefix (Hi_Orig)) in N_Has_Entity
4125 and then Entity (Prefix (Hi_Orig)) = Ltyp
4126 and then Comes_From_Source (N)
4127 and then VM_Target = No_VM
4129 Substitute_Valid_Check;
4133 -- If bounds of type are known at compile time, and the end points
4134 -- are known at compile time and identical, this is another case
4135 -- for substituting a valid test. We only do this for discrete
4136 -- types, since it won't arise in practice for float types.
4138 if Comes_From_Source (N)
4139 and then Is_Discrete_Type (Ltyp)
4140 and then Compile_Time_Known_Value (Type_High_Bound (Ltyp))
4141 and then Compile_Time_Known_Value (Type_Low_Bound (Ltyp))
4142 and then Compile_Time_Known_Value (Lo)
4143 and then Compile_Time_Known_Value (Hi)
4144 and then Expr_Value (Type_High_Bound (Ltyp)) = Expr_Value (Hi)
4145 and then Expr_Value (Type_Low_Bound (Ltyp)) = Expr_Value (Lo)
4147 -- Kill warnings in instances, since they may be cases where we
4148 -- have a test in the generic that makes sense with some types
4149 -- and not with other types.
4151 and then not In_Instance
4153 Substitute_Valid_Check;
4157 -- If we have an explicit range, do a bit of optimization based
4158 -- on range analysis (we may be able to kill one or both checks).
4160 Lcheck := Compile_Time_Compare (Lop, Lo, Assume_Valid => False);
4161 Ucheck := Compile_Time_Compare (Lop, Hi, Assume_Valid => False);
4163 -- If either check is known to fail, replace result by False since
4164 -- the other check does not matter. Preserve the static flag for
4165 -- legality checks, because we are constant-folding beyond RM 4.9.
4167 if Lcheck = LT or else Ucheck = GT then
4169 Error_Msg_N ("?range test optimized away", N);
4170 Error_Msg_N ("\?value is known to be out of range", N);
4174 New_Reference_To (Standard_False, Loc));
4175 Analyze_And_Resolve (N, Rtyp);
4176 Set_Is_Static_Expression (N, Static);
4180 -- If both checks are known to succeed, replace result by True,
4181 -- since we know we are in range.
4183 elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then
4185 Error_Msg_N ("?range test optimized away", N);
4186 Error_Msg_N ("\?value is known to be in range", N);
4190 New_Reference_To (Standard_True, Loc));
4191 Analyze_And_Resolve (N, Rtyp);
4192 Set_Is_Static_Expression (N, Static);
4196 -- If lower bound check succeeds and upper bound check is not
4197 -- known to succeed or fail, then replace the range check with
4198 -- a comparison against the upper bound.
4200 elsif Lcheck in Compare_GE then
4201 if Warn2 and then not In_Instance then
4202 Error_Msg_N ("?lower bound test optimized away", Lo);
4203 Error_Msg_N ("\?value is known to be in range", Lo);
4209 Right_Opnd => High_Bound (Rop)));
4210 Analyze_And_Resolve (N, Rtyp);
4214 -- If upper bound check succeeds and lower bound check is not
4215 -- known to succeed or fail, then replace the range check with
4216 -- a comparison against the lower bound.
4218 elsif Ucheck in Compare_LE then
4219 if Warn2 and then not In_Instance then
4220 Error_Msg_N ("?upper bound test optimized away", Hi);
4221 Error_Msg_N ("\?value is known to be in range", Hi);
4227 Right_Opnd => Low_Bound (Rop)));
4228 Analyze_And_Resolve (N, Rtyp);
4233 -- We couldn't optimize away the range check, but there is one
4234 -- more issue. If we are checking constant conditionals, then we
4235 -- see if we can determine the outcome assuming everything is
4236 -- valid, and if so give an appropriate warning.
4238 if Warn1 and then not Assume_No_Invalid_Values then
4239 Lcheck := Compile_Time_Compare (Lop, Lo, Assume_Valid => True);
4240 Ucheck := Compile_Time_Compare (Lop, Hi, Assume_Valid => True);
4242 -- Result is out of range for valid value
4244 if Lcheck = LT or else Ucheck = GT then
4246 ("?value can only be in range if it is invalid", N);
4248 -- Result is in range for valid value
4250 elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then
4252 ("?value can only be out of range if it is invalid", N);
4254 -- Lower bound check succeeds if value is valid
4256 elsif Warn2 and then Lcheck in Compare_GE then
4258 ("?lower bound check only fails if it is invalid", Lo);
4260 -- Upper bound check succeeds if value is valid
4262 elsif Warn2 and then Ucheck in Compare_LE then
4264 ("?upper bound check only fails for invalid values", Hi);
4269 -- For all other cases of an explicit range, nothing to be done
4273 -- Here right operand is a subtype mark
4277 Typ : Entity_Id := Etype (Rop);
4278 Is_Acc : constant Boolean := Is_Access_Type (Typ);
4279 Obj : Node_Id := Lop;
4280 Cond : Node_Id := Empty;
4283 Remove_Side_Effects (Obj);
4285 -- For tagged type, do tagged membership operation
4287 if Is_Tagged_Type (Typ) then
4289 -- No expansion will be performed when VM_Target, as the VM
4290 -- back-ends will handle the membership tests directly (tags
4291 -- are not explicitly represented in Java objects, so the
4292 -- normal tagged membership expansion is not what we want).
4294 if VM_Target = No_VM then
4295 Rewrite (N, Tagged_Membership (N));
4296 Analyze_And_Resolve (N, Rtyp);
4301 -- If type is scalar type, rewrite as x in t'first .. t'last.
4302 -- This reason we do this is that the bounds may have the wrong
4303 -- type if they come from the original type definition. Also this
4304 -- way we get all the processing above for an explicit range.
4306 elsif Is_Scalar_Type (Typ) then
4310 Make_Attribute_Reference (Loc,
4311 Attribute_Name => Name_First,
4312 Prefix => New_Reference_To (Typ, Loc)),
4315 Make_Attribute_Reference (Loc,
4316 Attribute_Name => Name_Last,
4317 Prefix => New_Reference_To (Typ, Loc))));
4318 Analyze_And_Resolve (N, Rtyp);
4321 -- Ada 2005 (AI-216): Program_Error is raised when evaluating
4322 -- a membership test if the subtype mark denotes a constrained
4323 -- Unchecked_Union subtype and the expression lacks inferable
4326 elsif Is_Unchecked_Union (Base_Type (Typ))
4327 and then Is_Constrained (Typ)
4328 and then not Has_Inferable_Discriminants (Lop)
4331 Make_Raise_Program_Error (Loc,
4332 Reason => PE_Unchecked_Union_Restriction));
4334 -- Prevent Gigi from generating incorrect code by rewriting
4335 -- the test as a standard False.
4338 New_Occurrence_Of (Standard_False, Loc));
4343 -- Here we have a non-scalar type
4346 Typ := Designated_Type (Typ);
4349 if not Is_Constrained (Typ) then
4351 New_Reference_To (Standard_True, Loc));
4352 Analyze_And_Resolve (N, Rtyp);
4354 -- For the constrained array case, we have to check the subscripts
4355 -- for an exact match if the lengths are non-zero (the lengths
4356 -- must match in any case).
4358 elsif Is_Array_Type (Typ) then
4360 Check_Subscripts : declare
4361 function Construct_Attribute_Reference
4364 Dim : Nat) return Node_Id;
4365 -- Build attribute reference E'Nam(Dim)
4367 -----------------------------------
4368 -- Construct_Attribute_Reference --
4369 -----------------------------------
4371 function Construct_Attribute_Reference
4374 Dim : Nat) return Node_Id
4378 Make_Attribute_Reference (Loc,
4380 Attribute_Name => Nam,
4381 Expressions => New_List (
4382 Make_Integer_Literal (Loc, Dim)));
4383 end Construct_Attribute_Reference;
4385 -- Start of processing for Check_Subscripts
4388 for J in 1 .. Number_Dimensions (Typ) loop
4389 Evolve_And_Then (Cond,
4392 Construct_Attribute_Reference
4393 (Duplicate_Subexpr_No_Checks (Obj),
4396 Construct_Attribute_Reference
4397 (New_Occurrence_Of (Typ, Loc), Name_First, J)));
4399 Evolve_And_Then (Cond,
4402 Construct_Attribute_Reference
4403 (Duplicate_Subexpr_No_Checks (Obj),
4406 Construct_Attribute_Reference
4407 (New_Occurrence_Of (Typ, Loc), Name_Last, J)));
4416 Right_Opnd => Make_Null (Loc)),
4417 Right_Opnd => Cond);
4421 Analyze_And_Resolve (N, Rtyp);
4422 end Check_Subscripts;
4424 -- These are the cases where constraint checks may be required,
4425 -- e.g. records with possible discriminants
4428 -- Expand the test into a series of discriminant comparisons.
4429 -- The expression that is built is the negation of the one that
4430 -- is used for checking discriminant constraints.
4432 Obj := Relocate_Node (Left_Opnd (N));
4434 if Has_Discriminants (Typ) then
4435 Cond := Make_Op_Not (Loc,
4436 Right_Opnd => Build_Discriminant_Checks (Obj, Typ));
4439 Cond := Make_Or_Else (Loc,
4443 Right_Opnd => Make_Null (Loc)),
4444 Right_Opnd => Cond);
4448 Cond := New_Occurrence_Of (Standard_True, Loc);
4452 Analyze_And_Resolve (N, Rtyp);
4458 --------------------------------
4459 -- Expand_N_Indexed_Component --
4460 --------------------------------
4462 procedure Expand_N_Indexed_Component (N : Node_Id) is
4463 Loc : constant Source_Ptr := Sloc (N);
4464 Typ : constant Entity_Id := Etype (N);
4465 P : constant Node_Id := Prefix (N);
4466 T : constant Entity_Id := Etype (P);
4469 -- A special optimization, if we have an indexed component that is
4470 -- selecting from a slice, then we can eliminate the slice, since, for
4471 -- example, x (i .. j)(k) is identical to x(k). The only difference is
4472 -- the range check required by the slice. The range check for the slice
4473 -- itself has already been generated. The range check for the
4474 -- subscripting operation is ensured by converting the subject to
4475 -- the subtype of the slice.
4477 -- This optimization not only generates better code, avoiding slice
4478 -- messing especially in the packed case, but more importantly bypasses
4479 -- some problems in handling this peculiar case, for example, the issue
4480 -- of dealing specially with object renamings.
4482 if Nkind (P) = N_Slice then
4484 Make_Indexed_Component (Loc,
4485 Prefix => Prefix (P),
4486 Expressions => New_List (
4488 (Etype (First_Index (Etype (P))),
4489 First (Expressions (N))))));
4490 Analyze_And_Resolve (N, Typ);
4494 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
4495 -- function, then additional actuals must be passed.
4497 if Ada_Version >= Ada_05
4498 and then Is_Build_In_Place_Function_Call (P)
4500 Make_Build_In_Place_Call_In_Anonymous_Context (P);
4503 -- If the prefix is an access type, then we unconditionally rewrite if
4504 -- as an explicit deference. This simplifies processing for several
4505 -- cases, including packed array cases and certain cases in which checks
4506 -- must be generated. We used to try to do this only when it was
4507 -- necessary, but it cleans up the code to do it all the time.
4509 if Is_Access_Type (T) then
4510 Insert_Explicit_Dereference (P);
4511 Analyze_And_Resolve (P, Designated_Type (T));
4514 -- Generate index and validity checks
4516 Generate_Index_Checks (N);
4518 if Validity_Checks_On and then Validity_Check_Subscripts then
4519 Apply_Subscript_Validity_Checks (N);
4522 -- All done for the non-packed case
4524 if not Is_Packed (Etype (Prefix (N))) then
4528 -- For packed arrays that are not bit-packed (i.e. the case of an array
4529 -- with one or more index types with a non-contiguous enumeration type),
4530 -- we can always use the normal packed element get circuit.
4532 if not Is_Bit_Packed_Array (Etype (Prefix (N))) then
4533 Expand_Packed_Element_Reference (N);
4537 -- For a reference to a component of a bit packed array, we have to
4538 -- convert it to a reference to the corresponding Packed_Array_Type.
4539 -- We only want to do this for simple references, and not for:
4541 -- Left side of assignment, or prefix of left side of assignment, or
4542 -- prefix of the prefix, to handle packed arrays of packed arrays,
4543 -- This case is handled in Exp_Ch5.Expand_N_Assignment_Statement
4545 -- Renaming objects in renaming associations
4546 -- This case is handled when a use of the renamed variable occurs
4548 -- Actual parameters for a procedure call
4549 -- This case is handled in Exp_Ch6.Expand_Actuals
4551 -- The second expression in a 'Read attribute reference
4553 -- The prefix of an address or size attribute reference
4555 -- The following circuit detects these exceptions
4558 Child : Node_Id := N;
4559 Parnt : Node_Id := Parent (N);
4563 if Nkind (Parnt) = N_Unchecked_Expression then
4566 elsif Nkind_In (Parnt, N_Object_Renaming_Declaration,
4567 N_Procedure_Call_Statement)
4568 or else (Nkind (Parnt) = N_Parameter_Association
4570 Nkind (Parent (Parnt)) = N_Procedure_Call_Statement)
4574 elsif Nkind (Parnt) = N_Attribute_Reference
4575 and then (Attribute_Name (Parnt) = Name_Address
4577 Attribute_Name (Parnt) = Name_Size)
4578 and then Prefix (Parnt) = Child
4582 elsif Nkind (Parnt) = N_Assignment_Statement
4583 and then Name (Parnt) = Child
4587 -- If the expression is an index of an indexed component, it must
4588 -- be expanded regardless of context.
4590 elsif Nkind (Parnt) = N_Indexed_Component
4591 and then Child /= Prefix (Parnt)
4593 Expand_Packed_Element_Reference (N);
4596 elsif Nkind (Parent (Parnt)) = N_Assignment_Statement
4597 and then Name (Parent (Parnt)) = Parnt
4601 elsif Nkind (Parnt) = N_Attribute_Reference
4602 and then Attribute_Name (Parnt) = Name_Read
4603 and then Next (First (Expressions (Parnt))) = Child
4607 elsif Nkind_In (Parnt, N_Indexed_Component, N_Selected_Component)
4608 and then Prefix (Parnt) = Child
4613 Expand_Packed_Element_Reference (N);
4617 -- Keep looking up tree for unchecked expression, or if we are the
4618 -- prefix of a possible assignment left side.
4621 Parnt := Parent (Child);
4624 end Expand_N_Indexed_Component;
4626 ---------------------
4627 -- Expand_N_Not_In --
4628 ---------------------
4630 -- Replace a not in b by not (a in b) so that the expansions for (a in b)
4631 -- can be done. This avoids needing to duplicate this expansion code.
4633 procedure Expand_N_Not_In (N : Node_Id) is
4634 Loc : constant Source_Ptr := Sloc (N);
4635 Typ : constant Entity_Id := Etype (N);
4636 Cfs : constant Boolean := Comes_From_Source (N);
4643 Left_Opnd => Left_Opnd (N),
4644 Right_Opnd => Right_Opnd (N))));
4646 -- We want this to appear as coming from source if original does (see
4647 -- transformations in Expand_N_In).
4649 Set_Comes_From_Source (N, Cfs);
4650 Set_Comes_From_Source (Right_Opnd (N), Cfs);
4652 -- Now analyze transformed node
4654 Analyze_And_Resolve (N, Typ);
4655 end Expand_N_Not_In;
4661 -- The only replacement required is for the case of a null of type that is
4662 -- an access to protected subprogram. We represent such access values as a
4663 -- record, and so we must replace the occurrence of null by the equivalent
4664 -- record (with a null address and a null pointer in it), so that the
4665 -- backend creates the proper value.
4667 procedure Expand_N_Null (N : Node_Id) is
4668 Loc : constant Source_Ptr := Sloc (N);
4669 Typ : constant Entity_Id := Etype (N);
4673 if Is_Access_Protected_Subprogram_Type (Typ) then
4675 Make_Aggregate (Loc,
4676 Expressions => New_List (
4677 New_Occurrence_Of (RTE (RE_Null_Address), Loc),
4681 Analyze_And_Resolve (N, Equivalent_Type (Typ));
4683 -- For subsequent semantic analysis, the node must retain its type.
4684 -- Gigi in any case replaces this type by the corresponding record
4685 -- type before processing the node.
4691 when RE_Not_Available =>
4695 ---------------------
4696 -- Expand_N_Op_Abs --
4697 ---------------------
4699 procedure Expand_N_Op_Abs (N : Node_Id) is
4700 Loc : constant Source_Ptr := Sloc (N);
4701 Expr : constant Node_Id := Right_Opnd (N);
4704 Unary_Op_Validity_Checks (N);
4706 -- Deal with software overflow checking
4708 if not Backend_Overflow_Checks_On_Target
4709 and then Is_Signed_Integer_Type (Etype (N))
4710 and then Do_Overflow_Check (N)
4712 -- The only case to worry about is when the argument is equal to the
4713 -- largest negative number, so what we do is to insert the check:
4715 -- [constraint_error when Expr = typ'Base'First]
4717 -- with the usual Duplicate_Subexpr use coding for expr
4720 Make_Raise_Constraint_Error (Loc,
4723 Left_Opnd => Duplicate_Subexpr (Expr),
4725 Make_Attribute_Reference (Loc,
4727 New_Occurrence_Of (Base_Type (Etype (Expr)), Loc),
4728 Attribute_Name => Name_First)),
4729 Reason => CE_Overflow_Check_Failed));
4732 -- Vax floating-point types case
4734 if Vax_Float (Etype (N)) then
4735 Expand_Vax_Arith (N);
4737 end Expand_N_Op_Abs;
4739 ---------------------
4740 -- Expand_N_Op_Add --
4741 ---------------------
4743 procedure Expand_N_Op_Add (N : Node_Id) is
4744 Typ : constant Entity_Id := Etype (N);
4747 Binary_Op_Validity_Checks (N);
4749 -- N + 0 = 0 + N = N for integer types
4751 if Is_Integer_Type (Typ) then
4752 if Compile_Time_Known_Value (Right_Opnd (N))
4753 and then Expr_Value (Right_Opnd (N)) = Uint_0
4755 Rewrite (N, Left_Opnd (N));
4758 elsif Compile_Time_Known_Value (Left_Opnd (N))
4759 and then Expr_Value (Left_Opnd (N)) = Uint_0
4761 Rewrite (N, Right_Opnd (N));
4766 -- Arithmetic overflow checks for signed integer/fixed point types
4768 if Is_Signed_Integer_Type (Typ)
4769 or else Is_Fixed_Point_Type (Typ)
4771 Apply_Arithmetic_Overflow_Check (N);
4774 -- Vax floating-point types case
4776 elsif Vax_Float (Typ) then
4777 Expand_Vax_Arith (N);
4779 end Expand_N_Op_Add;
4781 ---------------------
4782 -- Expand_N_Op_And --
4783 ---------------------
4785 procedure Expand_N_Op_And (N : Node_Id) is
4786 Typ : constant Entity_Id := Etype (N);
4789 Binary_Op_Validity_Checks (N);
4791 if Is_Array_Type (Etype (N)) then
4792 Expand_Boolean_Operator (N);
4794 elsif Is_Boolean_Type (Etype (N)) then
4795 Adjust_Condition (Left_Opnd (N));
4796 Adjust_Condition (Right_Opnd (N));
4797 Set_Etype (N, Standard_Boolean);
4798 Adjust_Result_Type (N, Typ);
4800 end Expand_N_Op_And;
4802 ------------------------
4803 -- Expand_N_Op_Concat --
4804 ------------------------
4806 procedure Expand_N_Op_Concat (N : Node_Id) is
4808 -- List of operands to be concatenated
4811 -- Node which is to be replaced by the result of concatenating the nodes
4812 -- in the list Opnds.
4815 -- Ensure validity of both operands
4817 Binary_Op_Validity_Checks (N);
4819 -- If we are the left operand of a concatenation higher up the tree,
4820 -- then do nothing for now, since we want to deal with a series of
4821 -- concatenations as a unit.
4823 if Nkind (Parent (N)) = N_Op_Concat
4824 and then N = Left_Opnd (Parent (N))
4829 -- We get here with a concatenation whose left operand may be a
4830 -- concatenation itself with a consistent type. We need to process
4831 -- these concatenation operands from left to right, which means
4832 -- from the deepest node in the tree to the highest node.
4835 while Nkind (Left_Opnd (Cnode)) = N_Op_Concat loop
4836 Cnode := Left_Opnd (Cnode);
4839 -- Now Opnd is the deepest Opnd, and its parents are the concatenation
4840 -- nodes above, so now we process bottom up, doing the operations. We
4841 -- gather a string that is as long as possible up to five operands
4843 -- The outer loop runs more than once if more than one concatenation
4844 -- type is involved.
4847 Opnds := New_List (Left_Opnd (Cnode), Right_Opnd (Cnode));
4848 Set_Parent (Opnds, N);
4850 -- The inner loop gathers concatenation operands
4852 Inner : while Cnode /= N
4853 and then Base_Type (Etype (Cnode)) =
4854 Base_Type (Etype (Parent (Cnode)))
4856 Cnode := Parent (Cnode);
4857 Append (Right_Opnd (Cnode), Opnds);
4860 Expand_Concatenate (Cnode, Opnds);
4862 exit Outer when Cnode = N;
4863 Cnode := Parent (Cnode);
4865 end Expand_N_Op_Concat;
4867 ------------------------
4868 -- Expand_N_Op_Divide --
4869 ------------------------
4871 procedure Expand_N_Op_Divide (N : Node_Id) is
4872 Loc : constant Source_Ptr := Sloc (N);
4873 Lopnd : constant Node_Id := Left_Opnd (N);
4874 Ropnd : constant Node_Id := Right_Opnd (N);
4875 Ltyp : constant Entity_Id := Etype (Lopnd);
4876 Rtyp : constant Entity_Id := Etype (Ropnd);
4877 Typ : Entity_Id := Etype (N);
4878 Rknow : constant Boolean := Is_Integer_Type (Typ)
4880 Compile_Time_Known_Value (Ropnd);
4884 Binary_Op_Validity_Checks (N);
4887 Rval := Expr_Value (Ropnd);
4890 -- N / 1 = N for integer types
4892 if Rknow and then Rval = Uint_1 then
4897 -- Convert x / 2 ** y to Shift_Right (x, y). Note that the fact that
4898 -- Is_Power_Of_2_For_Shift is set means that we know that our left
4899 -- operand is an unsigned integer, as required for this to work.
4901 if Nkind (Ropnd) = N_Op_Expon
4902 and then Is_Power_Of_2_For_Shift (Ropnd)
4904 -- We cannot do this transformation in configurable run time mode if we
4905 -- have 64-bit -- integers and long shifts are not available.
4909 or else Support_Long_Shifts_On_Target)
4912 Make_Op_Shift_Right (Loc,
4915 Convert_To (Standard_Natural, Right_Opnd (Ropnd))));
4916 Analyze_And_Resolve (N, Typ);
4920 -- Do required fixup of universal fixed operation
4922 if Typ = Universal_Fixed then
4923 Fixup_Universal_Fixed_Operation (N);
4927 -- Divisions with fixed-point results
4929 if Is_Fixed_Point_Type (Typ) then
4931 -- No special processing if Treat_Fixed_As_Integer is set, since
4932 -- from a semantic point of view such operations are simply integer
4933 -- operations and will be treated that way.
4935 if not Treat_Fixed_As_Integer (N) then
4936 if Is_Integer_Type (Rtyp) then
4937 Expand_Divide_Fixed_By_Integer_Giving_Fixed (N);
4939 Expand_Divide_Fixed_By_Fixed_Giving_Fixed (N);
4943 -- Other cases of division of fixed-point operands. Again we exclude the
4944 -- case where Treat_Fixed_As_Integer is set.
4946 elsif (Is_Fixed_Point_Type (Ltyp) or else
4947 Is_Fixed_Point_Type (Rtyp))
4948 and then not Treat_Fixed_As_Integer (N)
4950 if Is_Integer_Type (Typ) then
4951 Expand_Divide_Fixed_By_Fixed_Giving_Integer (N);
4953 pragma Assert (Is_Floating_Point_Type (Typ));
4954 Expand_Divide_Fixed_By_Fixed_Giving_Float (N);
4957 -- Mixed-mode operations can appear in a non-static universal context,
4958 -- in which case the integer argument must be converted explicitly.
4960 elsif Typ = Universal_Real
4961 and then Is_Integer_Type (Rtyp)
4964 Convert_To (Universal_Real, Relocate_Node (Ropnd)));
4966 Analyze_And_Resolve (Ropnd, Universal_Real);
4968 elsif Typ = Universal_Real
4969 and then Is_Integer_Type (Ltyp)
4972 Convert_To (Universal_Real, Relocate_Node (Lopnd)));
4974 Analyze_And_Resolve (Lopnd, Universal_Real);
4976 -- Non-fixed point cases, do integer zero divide and overflow checks
4978 elsif Is_Integer_Type (Typ) then
4979 Apply_Divide_Check (N);
4981 -- Check for 64-bit division available, or long shifts if the divisor
4982 -- is a small power of 2 (since such divides will be converted into
4985 if Esize (Ltyp) > 32
4986 and then not Support_64_Bit_Divides_On_Target
4989 or else not Support_Long_Shifts_On_Target
4990 or else (Rval /= Uint_2 and then
4991 Rval /= Uint_4 and then
4992 Rval /= Uint_8 and then
4993 Rval /= Uint_16 and then
4994 Rval /= Uint_32 and then
4997 Error_Msg_CRT ("64-bit division", N);
5000 -- Deal with Vax_Float
5002 elsif Vax_Float (Typ) then
5003 Expand_Vax_Arith (N);
5006 end Expand_N_Op_Divide;
5008 --------------------
5009 -- Expand_N_Op_Eq --
5010 --------------------
5012 procedure Expand_N_Op_Eq (N : Node_Id) is
5013 Loc : constant Source_Ptr := Sloc (N);
5014 Typ : constant Entity_Id := Etype (N);
5015 Lhs : constant Node_Id := Left_Opnd (N);
5016 Rhs : constant Node_Id := Right_Opnd (N);
5017 Bodies : constant List_Id := New_List;
5018 A_Typ : constant Entity_Id := Etype (Lhs);
5020 Typl : Entity_Id := A_Typ;
5021 Op_Name : Entity_Id;
5024 procedure Build_Equality_Call (Eq : Entity_Id);
5025 -- If a constructed equality exists for the type or for its parent,
5026 -- build and analyze call, adding conversions if the operation is
5029 function Has_Unconstrained_UU_Component (Typ : Node_Id) return Boolean;
5030 -- Determines whether a type has a subcomponent of an unconstrained
5031 -- Unchecked_Union subtype. Typ is a record type.
5033 -------------------------
5034 -- Build_Equality_Call --
5035 -------------------------
5037 procedure Build_Equality_Call (Eq : Entity_Id) is
5038 Op_Type : constant Entity_Id := Etype (First_Formal (Eq));
5039 L_Exp : Node_Id := Relocate_Node (Lhs);
5040 R_Exp : Node_Id := Relocate_Node (Rhs);
5043 if Base_Type (Op_Type) /= Base_Type (A_Typ)
5044 and then not Is_Class_Wide_Type (A_Typ)
5046 L_Exp := OK_Convert_To (Op_Type, L_Exp);
5047 R_Exp := OK_Convert_To (Op_Type, R_Exp);
5050 -- If we have an Unchecked_Union, we need to add the inferred
5051 -- discriminant values as actuals in the function call. At this
5052 -- point, the expansion has determined that both operands have
5053 -- inferable discriminants.
5055 if Is_Unchecked_Union (Op_Type) then
5057 Lhs_Type : constant Node_Id := Etype (L_Exp);
5058 Rhs_Type : constant Node_Id := Etype (R_Exp);
5059 Lhs_Discr_Val : Node_Id;
5060 Rhs_Discr_Val : Node_Id;
5063 -- Per-object constrained selected components require special
5064 -- attention. If the enclosing scope of the component is an
5065 -- Unchecked_Union, we cannot reference its discriminants
5066 -- directly. This is why we use the two extra parameters of
5067 -- the equality function of the enclosing Unchecked_Union.
5069 -- type UU_Type (Discr : Integer := 0) is
5072 -- pragma Unchecked_Union (UU_Type);
5074 -- 1. Unchecked_Union enclosing record:
5076 -- type Enclosing_UU_Type (Discr : Integer := 0) is record
5078 -- Comp : UU_Type (Discr);
5080 -- end Enclosing_UU_Type;
5081 -- pragma Unchecked_Union (Enclosing_UU_Type);
5083 -- Obj1 : Enclosing_UU_Type;
5084 -- Obj2 : Enclosing_UU_Type (1);
5086 -- [. . .] Obj1 = Obj2 [. . .]
5090 -- if not (uu_typeEQ (obj1.comp, obj2.comp, a, b)) then
5092 -- A and B are the formal parameters of the equality function
5093 -- of Enclosing_UU_Type. The function always has two extra
5094 -- formals to capture the inferred discriminant values.
5096 -- 2. Non-Unchecked_Union enclosing record:
5099 -- Enclosing_Non_UU_Type (Discr : Integer := 0)
5102 -- Comp : UU_Type (Discr);
5104 -- end Enclosing_Non_UU_Type;
5106 -- Obj1 : Enclosing_Non_UU_Type;
5107 -- Obj2 : Enclosing_Non_UU_Type (1);
5109 -- ... Obj1 = Obj2 ...
5113 -- if not (uu_typeEQ (obj1.comp, obj2.comp,
5114 -- obj1.discr, obj2.discr)) then
5116 -- In this case we can directly reference the discriminants of
5117 -- the enclosing record.
5121 if Nkind (Lhs) = N_Selected_Component
5122 and then Has_Per_Object_Constraint
5123 (Entity (Selector_Name (Lhs)))
5125 -- Enclosing record is an Unchecked_Union, use formal A
5127 if Is_Unchecked_Union (Scope
5128 (Entity (Selector_Name (Lhs))))
5131 Make_Identifier (Loc,
5134 -- Enclosing record is of a non-Unchecked_Union type, it is
5135 -- possible to reference the discriminant.
5139 Make_Selected_Component (Loc,
5140 Prefix => Prefix (Lhs),
5143 (Get_Discriminant_Value
5144 (First_Discriminant (Lhs_Type),
5146 Stored_Constraint (Lhs_Type))));
5149 -- Comment needed here ???
5152 -- Infer the discriminant value
5156 (Get_Discriminant_Value
5157 (First_Discriminant (Lhs_Type),
5159 Stored_Constraint (Lhs_Type)));
5164 if Nkind (Rhs) = N_Selected_Component
5165 and then Has_Per_Object_Constraint
5166 (Entity (Selector_Name (Rhs)))
5168 if Is_Unchecked_Union
5169 (Scope (Entity (Selector_Name (Rhs))))
5172 Make_Identifier (Loc,
5177 Make_Selected_Component (Loc,
5178 Prefix => Prefix (Rhs),
5180 New_Copy (Get_Discriminant_Value (
5181 First_Discriminant (Rhs_Type),
5183 Stored_Constraint (Rhs_Type))));
5188 New_Copy (Get_Discriminant_Value (
5189 First_Discriminant (Rhs_Type),
5191 Stored_Constraint (Rhs_Type)));
5196 Make_Function_Call (Loc,
5197 Name => New_Reference_To (Eq, Loc),
5198 Parameter_Associations => New_List (
5205 -- Normal case, not an unchecked union
5209 Make_Function_Call (Loc,
5210 Name => New_Reference_To (Eq, Loc),
5211 Parameter_Associations => New_List (L_Exp, R_Exp)));
5214 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5215 end Build_Equality_Call;
5217 ------------------------------------
5218 -- Has_Unconstrained_UU_Component --
5219 ------------------------------------
5221 function Has_Unconstrained_UU_Component
5222 (Typ : Node_Id) return Boolean
5224 Tdef : constant Node_Id :=
5225 Type_Definition (Declaration_Node (Base_Type (Typ)));
5229 function Component_Is_Unconstrained_UU
5230 (Comp : Node_Id) return Boolean;
5231 -- Determines whether the subtype of the component is an
5232 -- unconstrained Unchecked_Union.
5234 function Variant_Is_Unconstrained_UU
5235 (Variant : Node_Id) return Boolean;
5236 -- Determines whether a component of the variant has an unconstrained
5237 -- Unchecked_Union subtype.
5239 -----------------------------------
5240 -- Component_Is_Unconstrained_UU --
5241 -----------------------------------
5243 function Component_Is_Unconstrained_UU
5244 (Comp : Node_Id) return Boolean
5247 if Nkind (Comp) /= N_Component_Declaration then
5252 Sindic : constant Node_Id :=
5253 Subtype_Indication (Component_Definition (Comp));
5256 -- Unconstrained nominal type. In the case of a constraint
5257 -- present, the node kind would have been N_Subtype_Indication.
5259 if Nkind (Sindic) = N_Identifier then
5260 return Is_Unchecked_Union (Base_Type (Etype (Sindic)));
5265 end Component_Is_Unconstrained_UU;
5267 ---------------------------------
5268 -- Variant_Is_Unconstrained_UU --
5269 ---------------------------------
5271 function Variant_Is_Unconstrained_UU
5272 (Variant : Node_Id) return Boolean
5274 Clist : constant Node_Id := Component_List (Variant);
5277 if Is_Empty_List (Component_Items (Clist)) then
5281 -- We only need to test one component
5284 Comp : Node_Id := First (Component_Items (Clist));
5287 while Present (Comp) loop
5288 if Component_Is_Unconstrained_UU (Comp) then
5296 -- None of the components withing the variant were of
5297 -- unconstrained Unchecked_Union type.
5300 end Variant_Is_Unconstrained_UU;
5302 -- Start of processing for Has_Unconstrained_UU_Component
5305 if Null_Present (Tdef) then
5309 Clist := Component_List (Tdef);
5310 Vpart := Variant_Part (Clist);
5312 -- Inspect available components
5314 if Present (Component_Items (Clist)) then
5316 Comp : Node_Id := First (Component_Items (Clist));
5319 while Present (Comp) loop
5321 -- One component is sufficient
5323 if Component_Is_Unconstrained_UU (Comp) then
5332 -- Inspect available components withing variants
5334 if Present (Vpart) then
5336 Variant : Node_Id := First (Variants (Vpart));
5339 while Present (Variant) loop
5341 -- One component within a variant is sufficient
5343 if Variant_Is_Unconstrained_UU (Variant) then
5352 -- Neither the available components, nor the components inside the
5353 -- variant parts were of an unconstrained Unchecked_Union subtype.
5356 end Has_Unconstrained_UU_Component;
5358 -- Start of processing for Expand_N_Op_Eq
5361 Binary_Op_Validity_Checks (N);
5363 if Ekind (Typl) = E_Private_Type then
5364 Typl := Underlying_Type (Typl);
5365 elsif Ekind (Typl) = E_Private_Subtype then
5366 Typl := Underlying_Type (Base_Type (Typl));
5371 -- It may happen in error situations that the underlying type is not
5372 -- set. The error will be detected later, here we just defend the
5379 Typl := Base_Type (Typl);
5381 -- Boolean types (requiring handling of non-standard case)
5383 if Is_Boolean_Type (Typl) then
5384 Adjust_Condition (Left_Opnd (N));
5385 Adjust_Condition (Right_Opnd (N));
5386 Set_Etype (N, Standard_Boolean);
5387 Adjust_Result_Type (N, Typ);
5391 elsif Is_Array_Type (Typl) then
5393 -- If we are doing full validity checking, and it is possible for the
5394 -- array elements to be invalid then expand out array comparisons to
5395 -- make sure that we check the array elements.
5397 if Validity_Check_Operands
5398 and then not Is_Known_Valid (Component_Type (Typl))
5401 Save_Force_Validity_Checks : constant Boolean :=
5402 Force_Validity_Checks;
5404 Force_Validity_Checks := True;
5406 Expand_Array_Equality
5408 Relocate_Node (Lhs),
5409 Relocate_Node (Rhs),
5412 Insert_Actions (N, Bodies);
5413 Analyze_And_Resolve (N, Standard_Boolean);
5414 Force_Validity_Checks := Save_Force_Validity_Checks;
5417 -- Packed case where both operands are known aligned
5419 elsif Is_Bit_Packed_Array (Typl)
5420 and then not Is_Possibly_Unaligned_Object (Lhs)
5421 and then not Is_Possibly_Unaligned_Object (Rhs)
5423 Expand_Packed_Eq (N);
5425 -- Where the component type is elementary we can use a block bit
5426 -- comparison (if supported on the target) exception in the case
5427 -- of floating-point (negative zero issues require element by
5428 -- element comparison), and atomic types (where we must be sure
5429 -- to load elements independently) and possibly unaligned arrays.
5431 elsif Is_Elementary_Type (Component_Type (Typl))
5432 and then not Is_Floating_Point_Type (Component_Type (Typl))
5433 and then not Is_Atomic (Component_Type (Typl))
5434 and then not Is_Possibly_Unaligned_Object (Lhs)
5435 and then not Is_Possibly_Unaligned_Object (Rhs)
5436 and then Support_Composite_Compare_On_Target
5440 -- For composite and floating-point cases, expand equality loop to
5441 -- make sure of using proper comparisons for tagged types, and
5442 -- correctly handling the floating-point case.
5446 Expand_Array_Equality
5448 Relocate_Node (Lhs),
5449 Relocate_Node (Rhs),
5452 Insert_Actions (N, Bodies, Suppress => All_Checks);
5453 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5458 elsif Is_Record_Type (Typl) then
5460 -- For tagged types, use the primitive "="
5462 if Is_Tagged_Type (Typl) then
5464 -- No need to do anything else compiling under restriction
5465 -- No_Dispatching_Calls. During the semantic analysis we
5466 -- already notified such violation.
5468 if Restriction_Active (No_Dispatching_Calls) then
5472 -- If this is derived from an untagged private type completed with
5473 -- a tagged type, it does not have a full view, so we use the
5474 -- primitive operations of the private type. This check should no
5475 -- longer be necessary when these types get their full views???
5477 if Is_Private_Type (A_Typ)
5478 and then not Is_Tagged_Type (A_Typ)
5479 and then Is_Derived_Type (A_Typ)
5480 and then No (Full_View (A_Typ))
5482 -- Search for equality operation, checking that the operands
5483 -- have the same type. Note that we must find a matching entry,
5484 -- or something is very wrong!
5486 Prim := First_Elmt (Collect_Primitive_Operations (A_Typ));
5488 while Present (Prim) loop
5489 exit when Chars (Node (Prim)) = Name_Op_Eq
5490 and then Etype (First_Formal (Node (Prim))) =
5491 Etype (Next_Formal (First_Formal (Node (Prim))))
5493 Base_Type (Etype (Node (Prim))) = Standard_Boolean;
5498 pragma Assert (Present (Prim));
5499 Op_Name := Node (Prim);
5501 -- Find the type's predefined equality or an overriding
5502 -- user- defined equality. The reason for not simply calling
5503 -- Find_Prim_Op here is that there may be a user-defined
5504 -- overloaded equality op that precedes the equality that we want,
5505 -- so we have to explicitly search (e.g., there could be an
5506 -- equality with two different parameter types).
5509 if Is_Class_Wide_Type (Typl) then
5510 Typl := Root_Type (Typl);
5513 Prim := First_Elmt (Primitive_Operations (Typl));
5514 while Present (Prim) loop
5515 exit when Chars (Node (Prim)) = Name_Op_Eq
5516 and then Etype (First_Formal (Node (Prim))) =
5517 Etype (Next_Formal (First_Formal (Node (Prim))))
5519 Base_Type (Etype (Node (Prim))) = Standard_Boolean;
5524 pragma Assert (Present (Prim));
5525 Op_Name := Node (Prim);
5528 Build_Equality_Call (Op_Name);
5530 -- Ada 2005 (AI-216): Program_Error is raised when evaluating the
5531 -- predefined equality operator for a type which has a subcomponent
5532 -- of an Unchecked_Union type whose nominal subtype is unconstrained.
5534 elsif Has_Unconstrained_UU_Component (Typl) then
5536 Make_Raise_Program_Error (Loc,
5537 Reason => PE_Unchecked_Union_Restriction));
5539 -- Prevent Gigi from generating incorrect code by rewriting the
5540 -- equality as a standard False.
5543 New_Occurrence_Of (Standard_False, Loc));
5545 elsif Is_Unchecked_Union (Typl) then
5547 -- If we can infer the discriminants of the operands, we make a
5548 -- call to the TSS equality function.
5550 if Has_Inferable_Discriminants (Lhs)
5552 Has_Inferable_Discriminants (Rhs)
5555 (TSS (Root_Type (Typl), TSS_Composite_Equality));
5558 -- Ada 2005 (AI-216): Program_Error is raised when evaluating
5559 -- the predefined equality operator for an Unchecked_Union type
5560 -- if either of the operands lack inferable discriminants.
5563 Make_Raise_Program_Error (Loc,
5564 Reason => PE_Unchecked_Union_Restriction));
5566 -- Prevent Gigi from generating incorrect code by rewriting
5567 -- the equality as a standard False.
5570 New_Occurrence_Of (Standard_False, Loc));
5574 -- If a type support function is present (for complex cases), use it
5576 elsif Present (TSS (Root_Type (Typl), TSS_Composite_Equality)) then
5578 (TSS (Root_Type (Typl), TSS_Composite_Equality));
5580 -- Otherwise expand the component by component equality. Note that
5581 -- we never use block-bit comparisons for records, because of the
5582 -- problems with gaps. The backend will often be able to recombine
5583 -- the separate comparisons that we generate here.
5586 Remove_Side_Effects (Lhs);
5587 Remove_Side_Effects (Rhs);
5589 Expand_Record_Equality (N, Typl, Lhs, Rhs, Bodies));
5591 Insert_Actions (N, Bodies, Suppress => All_Checks);
5592 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5596 -- Test if result is known at compile time
5598 Rewrite_Comparison (N);
5600 -- If we still have comparison for Vax_Float, process it
5602 if Vax_Float (Typl) and then Nkind (N) in N_Op_Compare then
5603 Expand_Vax_Comparison (N);
5608 -----------------------
5609 -- Expand_N_Op_Expon --
5610 -----------------------
5612 procedure Expand_N_Op_Expon (N : Node_Id) is
5613 Loc : constant Source_Ptr := Sloc (N);
5614 Typ : constant Entity_Id := Etype (N);
5615 Rtyp : constant Entity_Id := Root_Type (Typ);
5616 Base : constant Node_Id := Relocate_Node (Left_Opnd (N));
5617 Bastyp : constant Node_Id := Etype (Base);
5618 Exp : constant Node_Id := Relocate_Node (Right_Opnd (N));
5619 Exptyp : constant Entity_Id := Etype (Exp);
5620 Ovflo : constant Boolean := Do_Overflow_Check (N);
5629 Binary_Op_Validity_Checks (N);
5631 -- If either operand is of a private type, then we have the use of an
5632 -- intrinsic operator, and we get rid of the privateness, by using root
5633 -- types of underlying types for the actual operation. Otherwise the
5634 -- private types will cause trouble if we expand multiplications or
5635 -- shifts etc. We also do this transformation if the result type is
5636 -- different from the base type.
5638 if Is_Private_Type (Etype (Base))
5640 Is_Private_Type (Typ)
5642 Is_Private_Type (Exptyp)
5644 Rtyp /= Root_Type (Bastyp)
5647 Bt : constant Entity_Id := Root_Type (Underlying_Type (Bastyp));
5648 Et : constant Entity_Id := Root_Type (Underlying_Type (Exptyp));
5652 Unchecked_Convert_To (Typ,
5654 Left_Opnd => Unchecked_Convert_To (Bt, Base),
5655 Right_Opnd => Unchecked_Convert_To (Et, Exp))));
5656 Analyze_And_Resolve (N, Typ);
5661 -- Test for case of known right argument
5663 if Compile_Time_Known_Value (Exp) then
5664 Expv := Expr_Value (Exp);
5666 -- We only fold small non-negative exponents. You might think we
5667 -- could fold small negative exponents for the real case, but we
5668 -- can't because we are required to raise Constraint_Error for
5669 -- the case of 0.0 ** (negative) even if Machine_Overflows = False.
5670 -- See ACVC test C4A012B.
5672 if Expv >= 0 and then Expv <= 4 then
5674 -- X ** 0 = 1 (or 1.0)
5678 -- Call Remove_Side_Effects to ensure that any side effects
5679 -- in the ignored left operand (in particular function calls
5680 -- to user defined functions) are properly executed.
5682 Remove_Side_Effects (Base);
5684 if Ekind (Typ) in Integer_Kind then
5685 Xnode := Make_Integer_Literal (Loc, Intval => 1);
5687 Xnode := Make_Real_Literal (Loc, Ureal_1);
5699 Make_Op_Multiply (Loc,
5700 Left_Opnd => Duplicate_Subexpr (Base),
5701 Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
5703 -- X ** 3 = X * X * X
5707 Make_Op_Multiply (Loc,
5709 Make_Op_Multiply (Loc,
5710 Left_Opnd => Duplicate_Subexpr (Base),
5711 Right_Opnd => Duplicate_Subexpr_No_Checks (Base)),
5712 Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
5715 -- En : constant base'type := base * base;
5721 Make_Defining_Identifier (Loc, New_Internal_Name ('E'));
5723 Insert_Actions (N, New_List (
5724 Make_Object_Declaration (Loc,
5725 Defining_Identifier => Temp,
5726 Constant_Present => True,
5727 Object_Definition => New_Reference_To (Typ, Loc),
5729 Make_Op_Multiply (Loc,
5730 Left_Opnd => Duplicate_Subexpr (Base),
5731 Right_Opnd => Duplicate_Subexpr_No_Checks (Base)))));
5734 Make_Op_Multiply (Loc,
5735 Left_Opnd => New_Reference_To (Temp, Loc),
5736 Right_Opnd => New_Reference_To (Temp, Loc));
5740 Analyze_And_Resolve (N, Typ);
5745 -- Case of (2 ** expression) appearing as an argument of an integer
5746 -- multiplication, or as the right argument of a division of a non-
5747 -- negative integer. In such cases we leave the node untouched, setting
5748 -- the flag Is_Natural_Power_Of_2_for_Shift set, then the expansion
5749 -- of the higher level node converts it into a shift.
5751 -- Note: this transformation is not applicable for a modular type with
5752 -- a non-binary modulus in the multiplication case, since we get a wrong
5753 -- result if the shift causes an overflow before the modular reduction.
5755 if Nkind (Base) = N_Integer_Literal
5756 and then Intval (Base) = 2
5757 and then Is_Integer_Type (Root_Type (Exptyp))
5758 and then Esize (Root_Type (Exptyp)) <= Esize (Standard_Integer)
5759 and then Is_Unsigned_Type (Exptyp)
5761 and then Nkind (Parent (N)) in N_Binary_Op
5764 P : constant Node_Id := Parent (N);
5765 L : constant Node_Id := Left_Opnd (P);
5766 R : constant Node_Id := Right_Opnd (P);
5769 if (Nkind (P) = N_Op_Multiply
5770 and then not Non_Binary_Modulus (Typ)
5772 ((Is_Integer_Type (Etype (L)) and then R = N)
5774 (Is_Integer_Type (Etype (R)) and then L = N))
5775 and then not Do_Overflow_Check (P))
5778 (Nkind (P) = N_Op_Divide
5779 and then Is_Integer_Type (Etype (L))
5780 and then Is_Unsigned_Type (Etype (L))
5782 and then not Do_Overflow_Check (P))
5784 Set_Is_Power_Of_2_For_Shift (N);
5790 -- Fall through if exponentiation must be done using a runtime routine
5792 -- First deal with modular case
5794 if Is_Modular_Integer_Type (Rtyp) then
5796 -- Non-binary case, we call the special exponentiation routine for
5797 -- the non-binary case, converting the argument to Long_Long_Integer
5798 -- and passing the modulus value. Then the result is converted back
5799 -- to the base type.
5801 if Non_Binary_Modulus (Rtyp) then
5804 Make_Function_Call (Loc,
5805 Name => New_Reference_To (RTE (RE_Exp_Modular), Loc),
5806 Parameter_Associations => New_List (
5807 Convert_To (Standard_Integer, Base),
5808 Make_Integer_Literal (Loc, Modulus (Rtyp)),
5811 -- Binary case, in this case, we call one of two routines, either the
5812 -- unsigned integer case, or the unsigned long long integer case,
5813 -- with a final "and" operation to do the required mod.
5816 if UI_To_Int (Esize (Rtyp)) <= Standard_Integer_Size then
5817 Ent := RTE (RE_Exp_Unsigned);
5819 Ent := RTE (RE_Exp_Long_Long_Unsigned);
5826 Make_Function_Call (Loc,
5827 Name => New_Reference_To (Ent, Loc),
5828 Parameter_Associations => New_List (
5829 Convert_To (Etype (First_Formal (Ent)), Base),
5832 Make_Integer_Literal (Loc, Modulus (Rtyp) - 1))));
5836 -- Common exit point for modular type case
5838 Analyze_And_Resolve (N, Typ);
5841 -- Signed integer cases, done using either Integer or Long_Long_Integer.
5842 -- It is not worth having routines for Short_[Short_]Integer, since for
5843 -- most machines it would not help, and it would generate more code that
5844 -- might need certification when a certified run time is required.
5846 -- In the integer cases, we have two routines, one for when overflow
5847 -- checks are required, and one when they are not required, since there
5848 -- is a real gain in omitting checks on many machines.
5850 elsif Rtyp = Base_Type (Standard_Long_Long_Integer)
5851 or else (Rtyp = Base_Type (Standard_Long_Integer)
5853 Esize (Standard_Long_Integer) > Esize (Standard_Integer))
5854 or else (Rtyp = Universal_Integer)
5856 Etyp := Standard_Long_Long_Integer;
5859 Rent := RE_Exp_Long_Long_Integer;
5861 Rent := RE_Exn_Long_Long_Integer;
5864 elsif Is_Signed_Integer_Type (Rtyp) then
5865 Etyp := Standard_Integer;
5868 Rent := RE_Exp_Integer;
5870 Rent := RE_Exn_Integer;
5873 -- Floating-point cases, always done using Long_Long_Float. We do not
5874 -- need separate routines for the overflow case here, since in the case
5875 -- of floating-point, we generate infinities anyway as a rule (either
5876 -- that or we automatically trap overflow), and if there is an infinity
5877 -- generated and a range check is required, the check will fail anyway.
5880 pragma Assert (Is_Floating_Point_Type (Rtyp));
5881 Etyp := Standard_Long_Long_Float;
5882 Rent := RE_Exn_Long_Long_Float;
5885 -- Common processing for integer cases and floating-point cases.
5886 -- If we are in the right type, we can call runtime routine directly
5889 and then Rtyp /= Universal_Integer
5890 and then Rtyp /= Universal_Real
5893 Make_Function_Call (Loc,
5894 Name => New_Reference_To (RTE (Rent), Loc),
5895 Parameter_Associations => New_List (Base, Exp)));
5897 -- Otherwise we have to introduce conversions (conversions are also
5898 -- required in the universal cases, since the runtime routine is
5899 -- typed using one of the standard types).
5904 Make_Function_Call (Loc,
5905 Name => New_Reference_To (RTE (Rent), Loc),
5906 Parameter_Associations => New_List (
5907 Convert_To (Etyp, Base),
5911 Analyze_And_Resolve (N, Typ);
5915 when RE_Not_Available =>
5917 end Expand_N_Op_Expon;
5919 --------------------
5920 -- Expand_N_Op_Ge --
5921 --------------------
5923 procedure Expand_N_Op_Ge (N : Node_Id) is
5924 Typ : constant Entity_Id := Etype (N);
5925 Op1 : constant Node_Id := Left_Opnd (N);
5926 Op2 : constant Node_Id := Right_Opnd (N);
5927 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
5930 Binary_Op_Validity_Checks (N);
5932 if Is_Array_Type (Typ1) then
5933 Expand_Array_Comparison (N);
5937 if Is_Boolean_Type (Typ1) then
5938 Adjust_Condition (Op1);
5939 Adjust_Condition (Op2);
5940 Set_Etype (N, Standard_Boolean);
5941 Adjust_Result_Type (N, Typ);
5944 Rewrite_Comparison (N);
5946 -- If we still have comparison, and Vax_Float type, process it
5948 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
5949 Expand_Vax_Comparison (N);
5954 --------------------
5955 -- Expand_N_Op_Gt --
5956 --------------------
5958 procedure Expand_N_Op_Gt (N : Node_Id) is
5959 Typ : constant Entity_Id := Etype (N);
5960 Op1 : constant Node_Id := Left_Opnd (N);
5961 Op2 : constant Node_Id := Right_Opnd (N);
5962 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
5965 Binary_Op_Validity_Checks (N);
5967 if Is_Array_Type (Typ1) then
5968 Expand_Array_Comparison (N);
5972 if Is_Boolean_Type (Typ1) then
5973 Adjust_Condition (Op1);
5974 Adjust_Condition (Op2);
5975 Set_Etype (N, Standard_Boolean);
5976 Adjust_Result_Type (N, Typ);
5979 Rewrite_Comparison (N);
5981 -- If we still have comparison, and Vax_Float type, process it
5983 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
5984 Expand_Vax_Comparison (N);
5989 --------------------
5990 -- Expand_N_Op_Le --
5991 --------------------
5993 procedure Expand_N_Op_Le (N : Node_Id) is
5994 Typ : constant Entity_Id := Etype (N);
5995 Op1 : constant Node_Id := Left_Opnd (N);
5996 Op2 : constant Node_Id := Right_Opnd (N);
5997 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6000 Binary_Op_Validity_Checks (N);
6002 if Is_Array_Type (Typ1) then
6003 Expand_Array_Comparison (N);
6007 if Is_Boolean_Type (Typ1) then
6008 Adjust_Condition (Op1);
6009 Adjust_Condition (Op2);
6010 Set_Etype (N, Standard_Boolean);
6011 Adjust_Result_Type (N, Typ);
6014 Rewrite_Comparison (N);
6016 -- If we still have comparison, and Vax_Float type, process it
6018 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6019 Expand_Vax_Comparison (N);
6024 --------------------
6025 -- Expand_N_Op_Lt --
6026 --------------------
6028 procedure Expand_N_Op_Lt (N : Node_Id) is
6029 Typ : constant Entity_Id := Etype (N);
6030 Op1 : constant Node_Id := Left_Opnd (N);
6031 Op2 : constant Node_Id := Right_Opnd (N);
6032 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6035 Binary_Op_Validity_Checks (N);
6037 if Is_Array_Type (Typ1) then
6038 Expand_Array_Comparison (N);
6042 if Is_Boolean_Type (Typ1) then
6043 Adjust_Condition (Op1);
6044 Adjust_Condition (Op2);
6045 Set_Etype (N, Standard_Boolean);
6046 Adjust_Result_Type (N, Typ);
6049 Rewrite_Comparison (N);
6051 -- If we still have comparison, and Vax_Float type, process it
6053 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6054 Expand_Vax_Comparison (N);
6059 -----------------------
6060 -- Expand_N_Op_Minus --
6061 -----------------------
6063 procedure Expand_N_Op_Minus (N : Node_Id) is
6064 Loc : constant Source_Ptr := Sloc (N);
6065 Typ : constant Entity_Id := Etype (N);
6068 Unary_Op_Validity_Checks (N);
6070 if not Backend_Overflow_Checks_On_Target
6071 and then Is_Signed_Integer_Type (Etype (N))
6072 and then Do_Overflow_Check (N)
6074 -- Software overflow checking expands -expr into (0 - expr)
6077 Make_Op_Subtract (Loc,
6078 Left_Opnd => Make_Integer_Literal (Loc, 0),
6079 Right_Opnd => Right_Opnd (N)));
6081 Analyze_And_Resolve (N, Typ);
6083 -- Vax floating-point types case
6085 elsif Vax_Float (Etype (N)) then
6086 Expand_Vax_Arith (N);
6088 end Expand_N_Op_Minus;
6090 ---------------------
6091 -- Expand_N_Op_Mod --
6092 ---------------------
6094 procedure Expand_N_Op_Mod (N : Node_Id) is
6095 Loc : constant Source_Ptr := Sloc (N);
6096 Typ : constant Entity_Id := Etype (N);
6097 Left : constant Node_Id := Left_Opnd (N);
6098 Right : constant Node_Id := Right_Opnd (N);
6099 DOC : constant Boolean := Do_Overflow_Check (N);
6100 DDC : constant Boolean := Do_Division_Check (N);
6110 pragma Warnings (Off, Lhi);
6113 Binary_Op_Validity_Checks (N);
6115 Determine_Range (Right, ROK, Rlo, Rhi);
6116 Determine_Range (Left, LOK, Llo, Lhi);
6118 -- Convert mod to rem if operands are known non-negative. We do this
6119 -- since it is quite likely that this will improve the quality of code,
6120 -- (the operation now corresponds to the hardware remainder), and it
6121 -- does not seem likely that it could be harmful.
6123 if LOK and then Llo >= 0
6125 ROK and then Rlo >= 0
6128 Make_Op_Rem (Sloc (N),
6129 Left_Opnd => Left_Opnd (N),
6130 Right_Opnd => Right_Opnd (N)));
6132 -- Instead of reanalyzing the node we do the analysis manually. This
6133 -- avoids anomalies when the replacement is done in an instance and
6134 -- is epsilon more efficient.
6136 Set_Entity (N, Standard_Entity (S_Op_Rem));
6138 Set_Do_Overflow_Check (N, DOC);
6139 Set_Do_Division_Check (N, DDC);
6140 Expand_N_Op_Rem (N);
6143 -- Otherwise, normal mod processing
6146 if Is_Integer_Type (Etype (N)) then
6147 Apply_Divide_Check (N);
6150 -- Apply optimization x mod 1 = 0. We don't really need that with
6151 -- gcc, but it is useful with other back ends (e.g. AAMP), and is
6152 -- certainly harmless.
6154 if Is_Integer_Type (Etype (N))
6155 and then Compile_Time_Known_Value (Right)
6156 and then Expr_Value (Right) = Uint_1
6158 -- Call Remove_Side_Effects to ensure that any side effects in
6159 -- the ignored left operand (in particular function calls to
6160 -- user defined functions) are properly executed.
6162 Remove_Side_Effects (Left);
6164 Rewrite (N, Make_Integer_Literal (Loc, 0));
6165 Analyze_And_Resolve (N, Typ);
6169 -- Deal with annoying case of largest negative number remainder
6170 -- minus one. Gigi does not handle this case correctly, because
6171 -- it generates a divide instruction which may trap in this case.
6173 -- In fact the check is quite easy, if the right operand is -1, then
6174 -- the mod value is always 0, and we can just ignore the left operand
6175 -- completely in this case.
6177 -- The operand type may be private (e.g. in the expansion of an
6178 -- intrinsic operation) so we must use the underlying type to get the
6179 -- bounds, and convert the literals explicitly.
6183 (Type_Low_Bound (Base_Type (Underlying_Type (Etype (Left)))));
6185 if ((not ROK) or else (Rlo <= (-1) and then (-1) <= Rhi))
6187 ((not LOK) or else (Llo = LLB))
6190 Make_Conditional_Expression (Loc,
6191 Expressions => New_List (
6193 Left_Opnd => Duplicate_Subexpr (Right),
6195 Unchecked_Convert_To (Typ,
6196 Make_Integer_Literal (Loc, -1))),
6197 Unchecked_Convert_To (Typ,
6198 Make_Integer_Literal (Loc, Uint_0)),
6199 Relocate_Node (N))));
6201 Set_Analyzed (Next (Next (First (Expressions (N)))));
6202 Analyze_And_Resolve (N, Typ);
6205 end Expand_N_Op_Mod;
6207 --------------------------
6208 -- Expand_N_Op_Multiply --
6209 --------------------------
6211 procedure Expand_N_Op_Multiply (N : Node_Id) is
6212 Loc : constant Source_Ptr := Sloc (N);
6213 Lop : constant Node_Id := Left_Opnd (N);
6214 Rop : constant Node_Id := Right_Opnd (N);
6216 Lp2 : constant Boolean :=
6217 Nkind (Lop) = N_Op_Expon
6218 and then Is_Power_Of_2_For_Shift (Lop);
6220 Rp2 : constant Boolean :=
6221 Nkind (Rop) = N_Op_Expon
6222 and then Is_Power_Of_2_For_Shift (Rop);
6224 Ltyp : constant Entity_Id := Etype (Lop);
6225 Rtyp : constant Entity_Id := Etype (Rop);
6226 Typ : Entity_Id := Etype (N);
6229 Binary_Op_Validity_Checks (N);
6231 -- Special optimizations for integer types
6233 if Is_Integer_Type (Typ) then
6235 -- N * 0 = 0 for integer types
6237 if Compile_Time_Known_Value (Rop)
6238 and then Expr_Value (Rop) = Uint_0
6240 -- Call Remove_Side_Effects to ensure that any side effects in
6241 -- the ignored left operand (in particular function calls to
6242 -- user defined functions) are properly executed.
6244 Remove_Side_Effects (Lop);
6246 Rewrite (N, Make_Integer_Literal (Loc, Uint_0));
6247 Analyze_And_Resolve (N, Typ);
6251 -- Similar handling for 0 * N = 0
6253 if Compile_Time_Known_Value (Lop)
6254 and then Expr_Value (Lop) = Uint_0
6256 Remove_Side_Effects (Rop);
6257 Rewrite (N, Make_Integer_Literal (Loc, Uint_0));
6258 Analyze_And_Resolve (N, Typ);
6262 -- N * 1 = 1 * N = N for integer types
6264 -- This optimisation is not done if we are going to
6265 -- rewrite the product 1 * 2 ** N to a shift.
6267 if Compile_Time_Known_Value (Rop)
6268 and then Expr_Value (Rop) = Uint_1
6274 elsif Compile_Time_Known_Value (Lop)
6275 and then Expr_Value (Lop) = Uint_1
6283 -- Convert x * 2 ** y to Shift_Left (x, y). Note that the fact that
6284 -- Is_Power_Of_2_For_Shift is set means that we know that our left
6285 -- operand is an integer, as required for this to work.
6290 -- Convert 2 ** A * 2 ** B into 2 ** (A + B)
6294 Left_Opnd => Make_Integer_Literal (Loc, 2),
6297 Left_Opnd => Right_Opnd (Lop),
6298 Right_Opnd => Right_Opnd (Rop))));
6299 Analyze_And_Resolve (N, Typ);
6304 Make_Op_Shift_Left (Loc,
6307 Convert_To (Standard_Natural, Right_Opnd (Rop))));
6308 Analyze_And_Resolve (N, Typ);
6312 -- Same processing for the operands the other way round
6316 Make_Op_Shift_Left (Loc,
6319 Convert_To (Standard_Natural, Right_Opnd (Lop))));
6320 Analyze_And_Resolve (N, Typ);
6324 -- Do required fixup of universal fixed operation
6326 if Typ = Universal_Fixed then
6327 Fixup_Universal_Fixed_Operation (N);
6331 -- Multiplications with fixed-point results
6333 if Is_Fixed_Point_Type (Typ) then
6335 -- No special processing if Treat_Fixed_As_Integer is set, since from
6336 -- a semantic point of view such operations are simply integer
6337 -- operations and will be treated that way.
6339 if not Treat_Fixed_As_Integer (N) then
6341 -- Case of fixed * integer => fixed
6343 if Is_Integer_Type (Rtyp) then
6344 Expand_Multiply_Fixed_By_Integer_Giving_Fixed (N);
6346 -- Case of integer * fixed => fixed
6348 elsif Is_Integer_Type (Ltyp) then
6349 Expand_Multiply_Integer_By_Fixed_Giving_Fixed (N);
6351 -- Case of fixed * fixed => fixed
6354 Expand_Multiply_Fixed_By_Fixed_Giving_Fixed (N);
6358 -- Other cases of multiplication of fixed-point operands. Again we
6359 -- exclude the cases where Treat_Fixed_As_Integer flag is set.
6361 elsif (Is_Fixed_Point_Type (Ltyp) or else Is_Fixed_Point_Type (Rtyp))
6362 and then not Treat_Fixed_As_Integer (N)
6364 if Is_Integer_Type (Typ) then
6365 Expand_Multiply_Fixed_By_Fixed_Giving_Integer (N);
6367 pragma Assert (Is_Floating_Point_Type (Typ));
6368 Expand_Multiply_Fixed_By_Fixed_Giving_Float (N);
6371 -- Mixed-mode operations can appear in a non-static universal context,
6372 -- in which case the integer argument must be converted explicitly.
6374 elsif Typ = Universal_Real
6375 and then Is_Integer_Type (Rtyp)
6377 Rewrite (Rop, Convert_To (Universal_Real, Relocate_Node (Rop)));
6379 Analyze_And_Resolve (Rop, Universal_Real);
6381 elsif Typ = Universal_Real
6382 and then Is_Integer_Type (Ltyp)
6384 Rewrite (Lop, Convert_To (Universal_Real, Relocate_Node (Lop)));
6386 Analyze_And_Resolve (Lop, Universal_Real);
6388 -- Non-fixed point cases, check software overflow checking required
6390 elsif Is_Signed_Integer_Type (Etype (N)) then
6391 Apply_Arithmetic_Overflow_Check (N);
6393 -- Deal with VAX float case
6395 elsif Vax_Float (Typ) then
6396 Expand_Vax_Arith (N);
6399 end Expand_N_Op_Multiply;
6401 --------------------
6402 -- Expand_N_Op_Ne --
6403 --------------------
6405 procedure Expand_N_Op_Ne (N : Node_Id) is
6406 Typ : constant Entity_Id := Etype (Left_Opnd (N));
6409 -- Case of elementary type with standard operator
6411 if Is_Elementary_Type (Typ)
6412 and then Sloc (Entity (N)) = Standard_Location
6414 Binary_Op_Validity_Checks (N);
6416 -- Boolean types (requiring handling of non-standard case)
6418 if Is_Boolean_Type (Typ) then
6419 Adjust_Condition (Left_Opnd (N));
6420 Adjust_Condition (Right_Opnd (N));
6421 Set_Etype (N, Standard_Boolean);
6422 Adjust_Result_Type (N, Typ);
6425 Rewrite_Comparison (N);
6427 -- If we still have comparison for Vax_Float, process it
6429 if Vax_Float (Typ) and then Nkind (N) in N_Op_Compare then
6430 Expand_Vax_Comparison (N);
6434 -- For all cases other than elementary types, we rewrite node as the
6435 -- negation of an equality operation, and reanalyze. The equality to be
6436 -- used is defined in the same scope and has the same signature. This
6437 -- signature must be set explicitly since in an instance it may not have
6438 -- the same visibility as in the generic unit. This avoids duplicating
6439 -- or factoring the complex code for record/array equality tests etc.
6443 Loc : constant Source_Ptr := Sloc (N);
6445 Ne : constant Entity_Id := Entity (N);
6448 Binary_Op_Validity_Checks (N);
6454 Left_Opnd => Left_Opnd (N),
6455 Right_Opnd => Right_Opnd (N)));
6456 Set_Paren_Count (Right_Opnd (Neg), 1);
6458 if Scope (Ne) /= Standard_Standard then
6459 Set_Entity (Right_Opnd (Neg), Corresponding_Equality (Ne));
6462 -- For navigation purposes, the inequality is treated as an
6463 -- implicit reference to the corresponding equality. Preserve the
6464 -- Comes_From_ source flag so that the proper Xref entry is
6467 Preserve_Comes_From_Source (Neg, N);
6468 Preserve_Comes_From_Source (Right_Opnd (Neg), N);
6470 Analyze_And_Resolve (N, Standard_Boolean);
6475 ---------------------
6476 -- Expand_N_Op_Not --
6477 ---------------------
6479 -- If the argument is other than a Boolean array type, there is no special
6480 -- expansion required.
6482 -- For the packed case, we call the special routine in Exp_Pakd, except
6483 -- that if the component size is greater than one, we use the standard
6484 -- routine generating a gruesome loop (it is so peculiar to have packed
6485 -- arrays with non-standard Boolean representations anyway, so it does not
6486 -- matter that we do not handle this case efficiently).
6488 -- For the unpacked case (and for the special packed case where we have non
6489 -- standard Booleans, as discussed above), we generate and insert into the
6490 -- tree the following function definition:
6492 -- function Nnnn (A : arr) is
6495 -- for J in a'range loop
6496 -- B (J) := not A (J);
6501 -- Here arr is the actual subtype of the parameter (and hence always
6502 -- constrained). Then we replace the not with a call to this function.
6504 procedure Expand_N_Op_Not (N : Node_Id) is
6505 Loc : constant Source_Ptr := Sloc (N);
6506 Typ : constant Entity_Id := Etype (N);
6515 Func_Name : Entity_Id;
6516 Loop_Statement : Node_Id;
6519 Unary_Op_Validity_Checks (N);
6521 -- For boolean operand, deal with non-standard booleans
6523 if Is_Boolean_Type (Typ) then
6524 Adjust_Condition (Right_Opnd (N));
6525 Set_Etype (N, Standard_Boolean);
6526 Adjust_Result_Type (N, Typ);
6530 -- Only array types need any other processing
6532 if not Is_Array_Type (Typ) then
6536 -- Case of array operand. If bit packed with a component size of 1,
6537 -- handle it in Exp_Pakd if the operand is known to be aligned.
6539 if Is_Bit_Packed_Array (Typ)
6540 and then Component_Size (Typ) = 1
6541 and then not Is_Possibly_Unaligned_Object (Right_Opnd (N))
6543 Expand_Packed_Not (N);
6547 -- Case of array operand which is not bit-packed. If the context is
6548 -- a safe assignment, call in-place operation, If context is a larger
6549 -- boolean expression in the context of a safe assignment, expansion is
6550 -- done by enclosing operation.
6552 Opnd := Relocate_Node (Right_Opnd (N));
6553 Convert_To_Actual_Subtype (Opnd);
6554 Arr := Etype (Opnd);
6555 Ensure_Defined (Arr, N);
6556 Silly_Boolean_Array_Not_Test (N, Arr);
6558 if Nkind (Parent (N)) = N_Assignment_Statement then
6559 if Safe_In_Place_Array_Op (Name (Parent (N)), N, Empty) then
6560 Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
6563 -- Special case the negation of a binary operation
6565 elsif Nkind_In (Opnd, N_Op_And, N_Op_Or, N_Op_Xor)
6566 and then Safe_In_Place_Array_Op
6567 (Name (Parent (N)), Left_Opnd (Opnd), Right_Opnd (Opnd))
6569 Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
6573 elsif Nkind (Parent (N)) in N_Binary_Op
6574 and then Nkind (Parent (Parent (N))) = N_Assignment_Statement
6577 Op1 : constant Node_Id := Left_Opnd (Parent (N));
6578 Op2 : constant Node_Id := Right_Opnd (Parent (N));
6579 Lhs : constant Node_Id := Name (Parent (Parent (N)));
6582 if Safe_In_Place_Array_Op (Lhs, Op1, Op2) then
6584 and then Nkind (Op2) = N_Op_Not
6586 -- (not A) op (not B) can be reduced to a single call
6591 and then Nkind (Parent (N)) = N_Op_Xor
6593 -- A xor (not B) can also be special-cased
6601 A := Make_Defining_Identifier (Loc, Name_uA);
6602 B := Make_Defining_Identifier (Loc, Name_uB);
6603 J := Make_Defining_Identifier (Loc, Name_uJ);
6606 Make_Indexed_Component (Loc,
6607 Prefix => New_Reference_To (A, Loc),
6608 Expressions => New_List (New_Reference_To (J, Loc)));
6611 Make_Indexed_Component (Loc,
6612 Prefix => New_Reference_To (B, Loc),
6613 Expressions => New_List (New_Reference_To (J, Loc)));
6616 Make_Implicit_Loop_Statement (N,
6617 Identifier => Empty,
6620 Make_Iteration_Scheme (Loc,
6621 Loop_Parameter_Specification =>
6622 Make_Loop_Parameter_Specification (Loc,
6623 Defining_Identifier => J,
6624 Discrete_Subtype_Definition =>
6625 Make_Attribute_Reference (Loc,
6626 Prefix => Make_Identifier (Loc, Chars (A)),
6627 Attribute_Name => Name_Range))),
6629 Statements => New_List (
6630 Make_Assignment_Statement (Loc,
6632 Expression => Make_Op_Not (Loc, A_J))));
6634 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('N'));
6635 Set_Is_Inlined (Func_Name);
6638 Make_Subprogram_Body (Loc,
6640 Make_Function_Specification (Loc,
6641 Defining_Unit_Name => Func_Name,
6642 Parameter_Specifications => New_List (
6643 Make_Parameter_Specification (Loc,
6644 Defining_Identifier => A,
6645 Parameter_Type => New_Reference_To (Typ, Loc))),
6646 Result_Definition => New_Reference_To (Typ, Loc)),
6648 Declarations => New_List (
6649 Make_Object_Declaration (Loc,
6650 Defining_Identifier => B,
6651 Object_Definition => New_Reference_To (Arr, Loc))),
6653 Handled_Statement_Sequence =>
6654 Make_Handled_Sequence_Of_Statements (Loc,
6655 Statements => New_List (
6657 Make_Simple_Return_Statement (Loc,
6659 Make_Identifier (Loc, Chars (B)))))));
6662 Make_Function_Call (Loc,
6663 Name => New_Reference_To (Func_Name, Loc),
6664 Parameter_Associations => New_List (Opnd)));
6666 Analyze_And_Resolve (N, Typ);
6667 end Expand_N_Op_Not;
6669 --------------------
6670 -- Expand_N_Op_Or --
6671 --------------------
6673 procedure Expand_N_Op_Or (N : Node_Id) is
6674 Typ : constant Entity_Id := Etype (N);
6677 Binary_Op_Validity_Checks (N);
6679 if Is_Array_Type (Etype (N)) then
6680 Expand_Boolean_Operator (N);
6682 elsif Is_Boolean_Type (Etype (N)) then
6683 Adjust_Condition (Left_Opnd (N));
6684 Adjust_Condition (Right_Opnd (N));
6685 Set_Etype (N, Standard_Boolean);
6686 Adjust_Result_Type (N, Typ);
6690 ----------------------
6691 -- Expand_N_Op_Plus --
6692 ----------------------
6694 procedure Expand_N_Op_Plus (N : Node_Id) is
6696 Unary_Op_Validity_Checks (N);
6697 end Expand_N_Op_Plus;
6699 ---------------------
6700 -- Expand_N_Op_Rem --
6701 ---------------------
6703 procedure Expand_N_Op_Rem (N : Node_Id) is
6704 Loc : constant Source_Ptr := Sloc (N);
6705 Typ : constant Entity_Id := Etype (N);
6707 Left : constant Node_Id := Left_Opnd (N);
6708 Right : constant Node_Id := Right_Opnd (N);
6718 pragma Warnings (Off, Lhi);
6721 Binary_Op_Validity_Checks (N);
6723 if Is_Integer_Type (Etype (N)) then
6724 Apply_Divide_Check (N);
6727 -- Apply optimization x rem 1 = 0. We don't really need that with gcc,
6728 -- but it is useful with other back ends (e.g. AAMP), and is certainly
6731 if Is_Integer_Type (Etype (N))
6732 and then Compile_Time_Known_Value (Right)
6733 and then Expr_Value (Right) = Uint_1
6735 -- Call Remove_Side_Effects to ensure that any side effects in the
6736 -- ignored left operand (in particular function calls to user defined
6737 -- functions) are properly executed.
6739 Remove_Side_Effects (Left);
6741 Rewrite (N, Make_Integer_Literal (Loc, 0));
6742 Analyze_And_Resolve (N, Typ);
6746 -- Deal with annoying case of largest negative number remainder minus
6747 -- one. Gigi does not handle this case correctly, because it generates
6748 -- a divide instruction which may trap in this case.
6750 -- In fact the check is quite easy, if the right operand is -1, then
6751 -- the remainder is always 0, and we can just ignore the left operand
6752 -- completely in this case.
6754 Determine_Range (Right, ROK, Rlo, Rhi);
6755 Determine_Range (Left, LOK, Llo, Lhi);
6757 -- The operand type may be private (e.g. in the expansion of an
6758 -- intrinsic operation) so we must use the underlying type to get the
6759 -- bounds, and convert the literals explicitly.
6763 (Type_Low_Bound (Base_Type (Underlying_Type (Etype (Left)))));
6765 -- Now perform the test, generating code only if needed
6767 if ((not ROK) or else (Rlo <= (-1) and then (-1) <= Rhi))
6769 ((not LOK) or else (Llo = LLB))
6772 Make_Conditional_Expression (Loc,
6773 Expressions => New_List (
6775 Left_Opnd => Duplicate_Subexpr (Right),
6777 Unchecked_Convert_To (Typ,
6778 Make_Integer_Literal (Loc, -1))),
6780 Unchecked_Convert_To (Typ,
6781 Make_Integer_Literal (Loc, Uint_0)),
6783 Relocate_Node (N))));
6785 Set_Analyzed (Next (Next (First (Expressions (N)))));
6786 Analyze_And_Resolve (N, Typ);
6788 end Expand_N_Op_Rem;
6790 -----------------------------
6791 -- Expand_N_Op_Rotate_Left --
6792 -----------------------------
6794 procedure Expand_N_Op_Rotate_Left (N : Node_Id) is
6796 Binary_Op_Validity_Checks (N);
6797 end Expand_N_Op_Rotate_Left;
6799 ------------------------------
6800 -- Expand_N_Op_Rotate_Right --
6801 ------------------------------
6803 procedure Expand_N_Op_Rotate_Right (N : Node_Id) is
6805 Binary_Op_Validity_Checks (N);
6806 end Expand_N_Op_Rotate_Right;
6808 ----------------------------
6809 -- Expand_N_Op_Shift_Left --
6810 ----------------------------
6812 procedure Expand_N_Op_Shift_Left (N : Node_Id) is
6814 Binary_Op_Validity_Checks (N);
6815 end Expand_N_Op_Shift_Left;
6817 -----------------------------
6818 -- Expand_N_Op_Shift_Right --
6819 -----------------------------
6821 procedure Expand_N_Op_Shift_Right (N : Node_Id) is
6823 Binary_Op_Validity_Checks (N);
6824 end Expand_N_Op_Shift_Right;
6826 ----------------------------------------
6827 -- Expand_N_Op_Shift_Right_Arithmetic --
6828 ----------------------------------------
6830 procedure Expand_N_Op_Shift_Right_Arithmetic (N : Node_Id) is
6832 Binary_Op_Validity_Checks (N);
6833 end Expand_N_Op_Shift_Right_Arithmetic;
6835 --------------------------
6836 -- Expand_N_Op_Subtract --
6837 --------------------------
6839 procedure Expand_N_Op_Subtract (N : Node_Id) is
6840 Typ : constant Entity_Id := Etype (N);
6843 Binary_Op_Validity_Checks (N);
6845 -- N - 0 = N for integer types
6847 if Is_Integer_Type (Typ)
6848 and then Compile_Time_Known_Value (Right_Opnd (N))
6849 and then Expr_Value (Right_Opnd (N)) = 0
6851 Rewrite (N, Left_Opnd (N));
6855 -- Arithmetic overflow checks for signed integer/fixed point types
6857 if Is_Signed_Integer_Type (Typ)
6858 or else Is_Fixed_Point_Type (Typ)
6860 Apply_Arithmetic_Overflow_Check (N);
6862 -- Vax floating-point types case
6864 elsif Vax_Float (Typ) then
6865 Expand_Vax_Arith (N);
6867 end Expand_N_Op_Subtract;
6869 ---------------------
6870 -- Expand_N_Op_Xor --
6871 ---------------------
6873 procedure Expand_N_Op_Xor (N : Node_Id) is
6874 Typ : constant Entity_Id := Etype (N);
6877 Binary_Op_Validity_Checks (N);
6879 if Is_Array_Type (Etype (N)) then
6880 Expand_Boolean_Operator (N);
6882 elsif Is_Boolean_Type (Etype (N)) then
6883 Adjust_Condition (Left_Opnd (N));
6884 Adjust_Condition (Right_Opnd (N));
6885 Set_Etype (N, Standard_Boolean);
6886 Adjust_Result_Type (N, Typ);
6888 end Expand_N_Op_Xor;
6890 ----------------------
6891 -- Expand_N_Or_Else --
6892 ----------------------
6894 -- Expand into conditional expression if Actions present, and also
6895 -- deal with optimizing case of arguments being True or False.
6897 procedure Expand_N_Or_Else (N : Node_Id) is
6898 Loc : constant Source_Ptr := Sloc (N);
6899 Typ : constant Entity_Id := Etype (N);
6900 Left : constant Node_Id := Left_Opnd (N);
6901 Right : constant Node_Id := Right_Opnd (N);
6905 -- Deal with non-standard booleans
6907 if Is_Boolean_Type (Typ) then
6908 Adjust_Condition (Left);
6909 Adjust_Condition (Right);
6910 Set_Etype (N, Standard_Boolean);
6913 -- Check for cases where left argument is known to be True or False
6915 if Compile_Time_Known_Value (Left) then
6917 -- If left argument is False, change (False or else Right) to Right.
6918 -- Any actions associated with Right will be executed unconditionally
6919 -- and can thus be inserted into the tree unconditionally.
6921 if Expr_Value_E (Left) = Standard_False then
6922 if Present (Actions (N)) then
6923 Insert_Actions (N, Actions (N));
6928 -- If left argument is True, change (True and then Right) to True. In
6929 -- this case we can forget the actions associated with Right, since
6930 -- they will never be executed.
6932 else pragma Assert (Expr_Value_E (Left) = Standard_True);
6933 Kill_Dead_Code (Right);
6934 Kill_Dead_Code (Actions (N));
6935 Rewrite (N, New_Occurrence_Of (Standard_True, Loc));
6938 Adjust_Result_Type (N, Typ);
6942 -- If Actions are present, we expand
6944 -- left or else right
6948 -- if left then True else right end
6950 -- with the actions becoming the Else_Actions of the conditional
6951 -- expression. This conditional expression is then further expanded
6952 -- (and will eventually disappear)
6954 if Present (Actions (N)) then
6955 Actlist := Actions (N);
6957 Make_Conditional_Expression (Loc,
6958 Expressions => New_List (
6960 New_Occurrence_Of (Standard_True, Loc),
6963 Set_Else_Actions (N, Actlist);
6964 Analyze_And_Resolve (N, Standard_Boolean);
6965 Adjust_Result_Type (N, Typ);
6969 -- No actions present, check for cases of right argument True/False
6971 if Compile_Time_Known_Value (Right) then
6973 -- Change (Left or else False) to Left. Note that we know there are
6974 -- no actions associated with the True operand, since we just checked
6975 -- for this case above.
6977 if Expr_Value_E (Right) = Standard_False then
6980 -- Change (Left or else True) to True, making sure to preserve any
6981 -- side effects associated with the Left operand.
6983 else pragma Assert (Expr_Value_E (Right) = Standard_True);
6984 Remove_Side_Effects (Left);
6986 (N, New_Occurrence_Of (Standard_True, Loc));
6990 Adjust_Result_Type (N, Typ);
6991 end Expand_N_Or_Else;
6993 -----------------------------------
6994 -- Expand_N_Qualified_Expression --
6995 -----------------------------------
6997 procedure Expand_N_Qualified_Expression (N : Node_Id) is
6998 Operand : constant Node_Id := Expression (N);
6999 Target_Type : constant Entity_Id := Entity (Subtype_Mark (N));
7002 -- Do validity check if validity checking operands
7004 if Validity_Checks_On
7005 and then Validity_Check_Operands
7007 Ensure_Valid (Operand);
7010 -- Apply possible constraint check
7012 Apply_Constraint_Check (Operand, Target_Type, No_Sliding => True);
7013 end Expand_N_Qualified_Expression;
7015 ---------------------------------
7016 -- Expand_N_Selected_Component --
7017 ---------------------------------
7019 -- If the selector is a discriminant of a concurrent object, rewrite the
7020 -- prefix to denote the corresponding record type.
7022 procedure Expand_N_Selected_Component (N : Node_Id) is
7023 Loc : constant Source_Ptr := Sloc (N);
7024 Par : constant Node_Id := Parent (N);
7025 P : constant Node_Id := Prefix (N);
7026 Ptyp : Entity_Id := Underlying_Type (Etype (P));
7031 function In_Left_Hand_Side (Comp : Node_Id) return Boolean;
7032 -- Gigi needs a temporary for prefixes that depend on a discriminant,
7033 -- unless the context of an assignment can provide size information.
7034 -- Don't we have a general routine that does this???
7036 -----------------------
7037 -- In_Left_Hand_Side --
7038 -----------------------
7040 function In_Left_Hand_Side (Comp : Node_Id) return Boolean is
7042 return (Nkind (Parent (Comp)) = N_Assignment_Statement
7043 and then Comp = Name (Parent (Comp)))
7044 or else (Present (Parent (Comp))
7045 and then Nkind (Parent (Comp)) in N_Subexpr
7046 and then In_Left_Hand_Side (Parent (Comp)));
7047 end In_Left_Hand_Side;
7049 -- Start of processing for Expand_N_Selected_Component
7052 -- Insert explicit dereference if required
7054 if Is_Access_Type (Ptyp) then
7055 Insert_Explicit_Dereference (P);
7056 Analyze_And_Resolve (P, Designated_Type (Ptyp));
7058 if Ekind (Etype (P)) = E_Private_Subtype
7059 and then Is_For_Access_Subtype (Etype (P))
7061 Set_Etype (P, Base_Type (Etype (P)));
7067 -- Deal with discriminant check required
7069 if Do_Discriminant_Check (N) then
7071 -- Present the discriminant checking function to the backend, so that
7072 -- it can inline the call to the function.
7075 (Discriminant_Checking_Func
7076 (Original_Record_Component (Entity (Selector_Name (N)))));
7078 -- Now reset the flag and generate the call
7080 Set_Do_Discriminant_Check (N, False);
7081 Generate_Discriminant_Check (N);
7084 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
7085 -- function, then additional actuals must be passed.
7087 if Ada_Version >= Ada_05
7088 and then Is_Build_In_Place_Function_Call (P)
7090 Make_Build_In_Place_Call_In_Anonymous_Context (P);
7093 -- Gigi cannot handle unchecked conversions that are the prefix of a
7094 -- selected component with discriminants. This must be checked during
7095 -- expansion, because during analysis the type of the selector is not
7096 -- known at the point the prefix is analyzed. If the conversion is the
7097 -- target of an assignment, then we cannot force the evaluation.
7099 if Nkind (Prefix (N)) = N_Unchecked_Type_Conversion
7100 and then Has_Discriminants (Etype (N))
7101 and then not In_Left_Hand_Side (N)
7103 Force_Evaluation (Prefix (N));
7106 -- Remaining processing applies only if selector is a discriminant
7108 if Ekind (Entity (Selector_Name (N))) = E_Discriminant then
7110 -- If the selector is a discriminant of a constrained record type,
7111 -- we may be able to rewrite the expression with the actual value
7112 -- of the discriminant, a useful optimization in some cases.
7114 if Is_Record_Type (Ptyp)
7115 and then Has_Discriminants (Ptyp)
7116 and then Is_Constrained (Ptyp)
7118 -- Do this optimization for discrete types only, and not for
7119 -- access types (access discriminants get us into trouble!)
7121 if not Is_Discrete_Type (Etype (N)) then
7124 -- Don't do this on the left hand of an assignment statement.
7125 -- Normally one would think that references like this would
7126 -- not occur, but they do in generated code, and mean that
7127 -- we really do want to assign the discriminant!
7129 elsif Nkind (Par) = N_Assignment_Statement
7130 and then Name (Par) = N
7134 -- Don't do this optimization for the prefix of an attribute or
7135 -- the operand of an object renaming declaration since these are
7136 -- contexts where we do not want the value anyway.
7138 elsif (Nkind (Par) = N_Attribute_Reference
7139 and then Prefix (Par) = N)
7140 or else Is_Renamed_Object (N)
7144 -- Don't do this optimization if we are within the code for a
7145 -- discriminant check, since the whole point of such a check may
7146 -- be to verify the condition on which the code below depends!
7148 elsif Is_In_Discriminant_Check (N) then
7151 -- Green light to see if we can do the optimization. There is
7152 -- still one condition that inhibits the optimization below but
7153 -- now is the time to check the particular discriminant.
7156 -- Loop through discriminants to find the matching discriminant
7157 -- constraint to see if we can copy it.
7159 Disc := First_Discriminant (Ptyp);
7160 Dcon := First_Elmt (Discriminant_Constraint (Ptyp));
7161 Discr_Loop : while Present (Dcon) loop
7163 -- Check if this is the matching discriminant
7165 if Disc = Entity (Selector_Name (N)) then
7167 -- Here we have the matching discriminant. Check for
7168 -- the case of a discriminant of a component that is
7169 -- constrained by an outer discriminant, which cannot
7170 -- be optimized away.
7173 Denotes_Discriminant
7174 (Node (Dcon), Check_Concurrent => True)
7178 -- In the context of a case statement, the expression may
7179 -- have the base type of the discriminant, and we need to
7180 -- preserve the constraint to avoid spurious errors on
7183 elsif Nkind (Parent (N)) = N_Case_Statement
7184 and then Etype (Node (Dcon)) /= Etype (Disc)
7187 Make_Qualified_Expression (Loc,
7189 New_Occurrence_Of (Etype (Disc), Loc),
7191 New_Copy_Tree (Node (Dcon))));
7192 Analyze_And_Resolve (N, Etype (Disc));
7194 -- In case that comes out as a static expression,
7195 -- reset it (a selected component is never static).
7197 Set_Is_Static_Expression (N, False);
7200 -- Otherwise we can just copy the constraint, but the
7201 -- result is certainly not static! In some cases the
7202 -- discriminant constraint has been analyzed in the
7203 -- context of the original subtype indication, but for
7204 -- itypes the constraint might not have been analyzed
7205 -- yet, and this must be done now.
7208 Rewrite (N, New_Copy_Tree (Node (Dcon)));
7209 Analyze_And_Resolve (N);
7210 Set_Is_Static_Expression (N, False);
7216 Next_Discriminant (Disc);
7217 end loop Discr_Loop;
7219 -- Note: the above loop should always find a matching
7220 -- discriminant, but if it does not, we just missed an
7221 -- optimization due to some glitch (perhaps a previous error),
7227 -- The only remaining processing is in the case of a discriminant of
7228 -- a concurrent object, where we rewrite the prefix to denote the
7229 -- corresponding record type. If the type is derived and has renamed
7230 -- discriminants, use corresponding discriminant, which is the one
7231 -- that appears in the corresponding record.
7233 if not Is_Concurrent_Type (Ptyp) then
7237 Disc := Entity (Selector_Name (N));
7239 if Is_Derived_Type (Ptyp)
7240 and then Present (Corresponding_Discriminant (Disc))
7242 Disc := Corresponding_Discriminant (Disc);
7246 Make_Selected_Component (Loc,
7248 Unchecked_Convert_To (Corresponding_Record_Type (Ptyp),
7250 Selector_Name => Make_Identifier (Loc, Chars (Disc)));
7255 end Expand_N_Selected_Component;
7257 --------------------
7258 -- Expand_N_Slice --
7259 --------------------
7261 procedure Expand_N_Slice (N : Node_Id) is
7262 Loc : constant Source_Ptr := Sloc (N);
7263 Typ : constant Entity_Id := Etype (N);
7264 Pfx : constant Node_Id := Prefix (N);
7265 Ptp : Entity_Id := Etype (Pfx);
7267 function Is_Procedure_Actual (N : Node_Id) return Boolean;
7268 -- Check whether the argument is an actual for a procedure call, in
7269 -- which case the expansion of a bit-packed slice is deferred until the
7270 -- call itself is expanded. The reason this is required is that we might
7271 -- have an IN OUT or OUT parameter, and the copy out is essential, and
7272 -- that copy out would be missed if we created a temporary here in
7273 -- Expand_N_Slice. Note that we don't bother to test specifically for an
7274 -- IN OUT or OUT mode parameter, since it is a bit tricky to do, and it
7275 -- is harmless to defer expansion in the IN case, since the call
7276 -- processing will still generate the appropriate copy in operation,
7277 -- which will take care of the slice.
7279 procedure Make_Temporary;
7280 -- Create a named variable for the value of the slice, in cases where
7281 -- the back-end cannot handle it properly, e.g. when packed types or
7282 -- unaligned slices are involved.
7284 -------------------------
7285 -- Is_Procedure_Actual --
7286 -------------------------
7288 function Is_Procedure_Actual (N : Node_Id) return Boolean is
7289 Par : Node_Id := Parent (N);
7293 -- If our parent is a procedure call we can return
7295 if Nkind (Par) = N_Procedure_Call_Statement then
7298 -- If our parent is a type conversion, keep climbing the tree,
7299 -- since a type conversion can be a procedure actual. Also keep
7300 -- climbing if parameter association or a qualified expression,
7301 -- since these are additional cases that do can appear on
7302 -- procedure actuals.
7304 elsif Nkind_In (Par, N_Type_Conversion,
7305 N_Parameter_Association,
7306 N_Qualified_Expression)
7308 Par := Parent (Par);
7310 -- Any other case is not what we are looking for
7316 end Is_Procedure_Actual;
7318 --------------------
7319 -- Make_Temporary --
7320 --------------------
7322 procedure Make_Temporary is
7324 Ent : constant Entity_Id :=
7325 Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
7328 Make_Object_Declaration (Loc,
7329 Defining_Identifier => Ent,
7330 Object_Definition => New_Occurrence_Of (Typ, Loc));
7332 Set_No_Initialization (Decl);
7334 Insert_Actions (N, New_List (
7336 Make_Assignment_Statement (Loc,
7337 Name => New_Occurrence_Of (Ent, Loc),
7338 Expression => Relocate_Node (N))));
7340 Rewrite (N, New_Occurrence_Of (Ent, Loc));
7341 Analyze_And_Resolve (N, Typ);
7344 -- Start of processing for Expand_N_Slice
7347 -- Special handling for access types
7349 if Is_Access_Type (Ptp) then
7351 Ptp := Designated_Type (Ptp);
7354 Make_Explicit_Dereference (Sloc (N),
7355 Prefix => Relocate_Node (Pfx)));
7357 Analyze_And_Resolve (Pfx, Ptp);
7360 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
7361 -- function, then additional actuals must be passed.
7363 if Ada_Version >= Ada_05
7364 and then Is_Build_In_Place_Function_Call (Pfx)
7366 Make_Build_In_Place_Call_In_Anonymous_Context (Pfx);
7369 -- Range checks are potentially also needed for cases involving a slice
7370 -- indexed by a subtype indication, but Do_Range_Check can currently
7371 -- only be set for expressions ???
7373 if not Index_Checks_Suppressed (Ptp)
7374 and then (not Is_Entity_Name (Pfx)
7375 or else not Index_Checks_Suppressed (Entity (Pfx)))
7376 and then Nkind (Discrete_Range (N)) /= N_Subtype_Indication
7378 -- Do not enable range check to nodes associated with the frontend
7379 -- expansion of the dispatch table. We first check if Ada.Tags is
7380 -- already loaded to avoid the addition of an undesired dependence
7381 -- on such run-time unit.
7386 (RTU_Loaded (Ada_Tags)
7387 and then Nkind (Prefix (N)) = N_Selected_Component
7388 and then Present (Entity (Selector_Name (Prefix (N))))
7389 and then Entity (Selector_Name (Prefix (N))) =
7390 RTE_Record_Component (RE_Prims_Ptr)))
7392 Enable_Range_Check (Discrete_Range (N));
7395 -- The remaining case to be handled is packed slices. We can leave
7396 -- packed slices as they are in the following situations:
7398 -- 1. Right or left side of an assignment (we can handle this
7399 -- situation correctly in the assignment statement expansion).
7401 -- 2. Prefix of indexed component (the slide is optimized away in this
7402 -- case, see the start of Expand_N_Slice.)
7404 -- 3. Object renaming declaration, since we want the name of the
7405 -- slice, not the value.
7407 -- 4. Argument to procedure call, since copy-in/copy-out handling may
7408 -- be required, and this is handled in the expansion of call
7411 -- 5. Prefix of an address attribute (this is an error which is caught
7412 -- elsewhere, and the expansion would interfere with generating the
7415 if not Is_Packed (Typ) then
7417 -- Apply transformation for actuals of a function call, where
7418 -- Expand_Actuals is not used.
7420 if Nkind (Parent (N)) = N_Function_Call
7421 and then Is_Possibly_Unaligned_Slice (N)
7426 elsif Nkind (Parent (N)) = N_Assignment_Statement
7427 or else (Nkind (Parent (Parent (N))) = N_Assignment_Statement
7428 and then Parent (N) = Name (Parent (Parent (N))))
7432 elsif Nkind (Parent (N)) = N_Indexed_Component
7433 or else Is_Renamed_Object (N)
7434 or else Is_Procedure_Actual (N)
7438 elsif Nkind (Parent (N)) = N_Attribute_Reference
7439 and then Attribute_Name (Parent (N)) = Name_Address
7448 ------------------------------
7449 -- Expand_N_Type_Conversion --
7450 ------------------------------
7452 procedure Expand_N_Type_Conversion (N : Node_Id) is
7453 Loc : constant Source_Ptr := Sloc (N);
7454 Operand : constant Node_Id := Expression (N);
7455 Target_Type : constant Entity_Id := Etype (N);
7456 Operand_Type : Entity_Id := Etype (Operand);
7458 procedure Handle_Changed_Representation;
7459 -- This is called in the case of record and array type conversions to
7460 -- see if there is a change of representation to be handled. Change of
7461 -- representation is actually handled at the assignment statement level,
7462 -- and what this procedure does is rewrite node N conversion as an
7463 -- assignment to temporary. If there is no change of representation,
7464 -- then the conversion node is unchanged.
7466 procedure Real_Range_Check;
7467 -- Handles generation of range check for real target value
7469 -----------------------------------
7470 -- Handle_Changed_Representation --
7471 -----------------------------------
7473 procedure Handle_Changed_Representation is
7482 -- Nothing else to do if no change of representation
7484 if Same_Representation (Operand_Type, Target_Type) then
7487 -- The real change of representation work is done by the assignment
7488 -- statement processing. So if this type conversion is appearing as
7489 -- the expression of an assignment statement, nothing needs to be
7490 -- done to the conversion.
7492 elsif Nkind (Parent (N)) = N_Assignment_Statement then
7495 -- Otherwise we need to generate a temporary variable, and do the
7496 -- change of representation assignment into that temporary variable.
7497 -- The conversion is then replaced by a reference to this variable.
7502 -- If type is unconstrained we have to add a constraint, copied
7503 -- from the actual value of the left hand side.
7505 if not Is_Constrained (Target_Type) then
7506 if Has_Discriminants (Operand_Type) then
7507 Disc := First_Discriminant (Operand_Type);
7509 if Disc /= First_Stored_Discriminant (Operand_Type) then
7510 Disc := First_Stored_Discriminant (Operand_Type);
7514 while Present (Disc) loop
7516 Make_Selected_Component (Loc,
7517 Prefix => Duplicate_Subexpr_Move_Checks (Operand),
7519 Make_Identifier (Loc, Chars (Disc))));
7520 Next_Discriminant (Disc);
7523 elsif Is_Array_Type (Operand_Type) then
7524 N_Ix := First_Index (Target_Type);
7527 for J in 1 .. Number_Dimensions (Operand_Type) loop
7529 -- We convert the bounds explicitly. We use an unchecked
7530 -- conversion because bounds checks are done elsewhere.
7535 Unchecked_Convert_To (Etype (N_Ix),
7536 Make_Attribute_Reference (Loc,
7538 Duplicate_Subexpr_No_Checks
7539 (Operand, Name_Req => True),
7540 Attribute_Name => Name_First,
7541 Expressions => New_List (
7542 Make_Integer_Literal (Loc, J)))),
7545 Unchecked_Convert_To (Etype (N_Ix),
7546 Make_Attribute_Reference (Loc,
7548 Duplicate_Subexpr_No_Checks
7549 (Operand, Name_Req => True),
7550 Attribute_Name => Name_Last,
7551 Expressions => New_List (
7552 Make_Integer_Literal (Loc, J))))));
7559 Odef := New_Occurrence_Of (Target_Type, Loc);
7561 if Present (Cons) then
7563 Make_Subtype_Indication (Loc,
7564 Subtype_Mark => Odef,
7566 Make_Index_Or_Discriminant_Constraint (Loc,
7567 Constraints => Cons));
7570 Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('C'));
7572 Make_Object_Declaration (Loc,
7573 Defining_Identifier => Temp,
7574 Object_Definition => Odef);
7576 Set_No_Initialization (Decl, True);
7578 -- Insert required actions. It is essential to suppress checks
7579 -- since we have suppressed default initialization, which means
7580 -- that the variable we create may have no discriminants.
7585 Make_Assignment_Statement (Loc,
7586 Name => New_Occurrence_Of (Temp, Loc),
7587 Expression => Relocate_Node (N))),
7588 Suppress => All_Checks);
7590 Rewrite (N, New_Occurrence_Of (Temp, Loc));
7593 end Handle_Changed_Representation;
7595 ----------------------
7596 -- Real_Range_Check --
7597 ----------------------
7599 -- Case of conversions to floating-point or fixed-point. If range checks
7600 -- are enabled and the target type has a range constraint, we convert:
7606 -- Tnn : typ'Base := typ'Base (x);
7607 -- [constraint_error when Tnn < typ'First or else Tnn > typ'Last]
7610 -- This is necessary when there is a conversion of integer to float or
7611 -- to fixed-point to ensure that the correct checks are made. It is not
7612 -- necessary for float to float where it is enough to simply set the
7613 -- Do_Range_Check flag.
7615 procedure Real_Range_Check is
7616 Btyp : constant Entity_Id := Base_Type (Target_Type);
7617 Lo : constant Node_Id := Type_Low_Bound (Target_Type);
7618 Hi : constant Node_Id := Type_High_Bound (Target_Type);
7619 Xtyp : constant Entity_Id := Etype (Operand);
7624 -- Nothing to do if conversion was rewritten
7626 if Nkind (N) /= N_Type_Conversion then
7630 -- Nothing to do if range checks suppressed, or target has the same
7631 -- range as the base type (or is the base type).
7633 if Range_Checks_Suppressed (Target_Type)
7634 or else (Lo = Type_Low_Bound (Btyp)
7636 Hi = Type_High_Bound (Btyp))
7641 -- Nothing to do if expression is an entity on which checks have been
7644 if Is_Entity_Name (Operand)
7645 and then Range_Checks_Suppressed (Entity (Operand))
7650 -- Nothing to do if bounds are all static and we can tell that the
7651 -- expression is within the bounds of the target. Note that if the
7652 -- operand is of an unconstrained floating-point type, then we do
7653 -- not trust it to be in range (might be infinite)
7656 S_Lo : constant Node_Id := Type_Low_Bound (Xtyp);
7657 S_Hi : constant Node_Id := Type_High_Bound (Xtyp);
7660 if (not Is_Floating_Point_Type (Xtyp)
7661 or else Is_Constrained (Xtyp))
7662 and then Compile_Time_Known_Value (S_Lo)
7663 and then Compile_Time_Known_Value (S_Hi)
7664 and then Compile_Time_Known_Value (Hi)
7665 and then Compile_Time_Known_Value (Lo)
7668 D_Lov : constant Ureal := Expr_Value_R (Lo);
7669 D_Hiv : constant Ureal := Expr_Value_R (Hi);
7674 if Is_Real_Type (Xtyp) then
7675 S_Lov := Expr_Value_R (S_Lo);
7676 S_Hiv := Expr_Value_R (S_Hi);
7678 S_Lov := UR_From_Uint (Expr_Value (S_Lo));
7679 S_Hiv := UR_From_Uint (Expr_Value (S_Hi));
7683 and then S_Lov >= D_Lov
7684 and then S_Hiv <= D_Hiv
7686 Set_Do_Range_Check (Operand, False);
7693 -- For float to float conversions, we are done
7695 if Is_Floating_Point_Type (Xtyp)
7697 Is_Floating_Point_Type (Btyp)
7702 -- Otherwise rewrite the conversion as described above
7704 Conv := Relocate_Node (N);
7706 (Subtype_Mark (Conv), New_Occurrence_Of (Btyp, Loc));
7707 Set_Etype (Conv, Btyp);
7709 -- Enable overflow except for case of integer to float conversions,
7710 -- where it is never required, since we can never have overflow in
7713 if not Is_Integer_Type (Etype (Operand)) then
7714 Enable_Overflow_Check (Conv);
7718 Make_Defining_Identifier (Loc,
7719 Chars => New_Internal_Name ('T'));
7721 Insert_Actions (N, New_List (
7722 Make_Object_Declaration (Loc,
7723 Defining_Identifier => Tnn,
7724 Object_Definition => New_Occurrence_Of (Btyp, Loc),
7725 Expression => Conv),
7727 Make_Raise_Constraint_Error (Loc,
7732 Left_Opnd => New_Occurrence_Of (Tnn, Loc),
7734 Make_Attribute_Reference (Loc,
7735 Attribute_Name => Name_First,
7737 New_Occurrence_Of (Target_Type, Loc))),
7741 Left_Opnd => New_Occurrence_Of (Tnn, Loc),
7743 Make_Attribute_Reference (Loc,
7744 Attribute_Name => Name_Last,
7746 New_Occurrence_Of (Target_Type, Loc)))),
7747 Reason => CE_Range_Check_Failed)));
7749 Rewrite (N, New_Occurrence_Of (Tnn, Loc));
7750 Analyze_And_Resolve (N, Btyp);
7751 end Real_Range_Check;
7753 -- Start of processing for Expand_N_Type_Conversion
7756 -- Nothing at all to do if conversion is to the identical type so remove
7757 -- the conversion completely, it is useless.
7759 if Operand_Type = Target_Type then
7760 Rewrite (N, Relocate_Node (Operand));
7764 -- Nothing to do if this is the second argument of read. This is a
7765 -- "backwards" conversion that will be handled by the specialized code
7766 -- in attribute processing.
7768 if Nkind (Parent (N)) = N_Attribute_Reference
7769 and then Attribute_Name (Parent (N)) = Name_Read
7770 and then Next (First (Expressions (Parent (N)))) = N
7775 -- Here if we may need to expand conversion
7777 -- Do validity check if validity checking operands
7779 if Validity_Checks_On
7780 and then Validity_Check_Operands
7782 Ensure_Valid (Operand);
7785 -- Special case of converting from non-standard boolean type
7787 if Is_Boolean_Type (Operand_Type)
7788 and then (Nonzero_Is_True (Operand_Type))
7790 Adjust_Condition (Operand);
7791 Set_Etype (Operand, Standard_Boolean);
7792 Operand_Type := Standard_Boolean;
7795 -- Case of converting to an access type
7797 if Is_Access_Type (Target_Type) then
7799 -- Apply an accessibility check when the conversion operand is an
7800 -- access parameter (or a renaming thereof), unless conversion was
7801 -- expanded from an Unchecked_ or Unrestricted_Access attribute.
7802 -- Note that other checks may still need to be applied below (such
7803 -- as tagged type checks).
7805 if Is_Entity_Name (Operand)
7807 (Is_Formal (Entity (Operand))
7809 (Present (Renamed_Object (Entity (Operand)))
7810 and then Is_Entity_Name (Renamed_Object (Entity (Operand)))
7812 (Entity (Renamed_Object (Entity (Operand))))))
7813 and then Ekind (Etype (Operand)) = E_Anonymous_Access_Type
7814 and then (Nkind (Original_Node (N)) /= N_Attribute_Reference
7815 or else Attribute_Name (Original_Node (N)) = Name_Access)
7817 Apply_Accessibility_Check
7818 (Operand, Target_Type, Insert_Node => Operand);
7820 -- If the level of the operand type is statically deeper than the
7821 -- level of the target type, then force Program_Error. Note that this
7822 -- can only occur for cases where the attribute is within the body of
7823 -- an instantiation (otherwise the conversion will already have been
7824 -- rejected as illegal). Note: warnings are issued by the analyzer
7825 -- for the instance cases.
7827 elsif In_Instance_Body
7828 and then Type_Access_Level (Operand_Type) >
7829 Type_Access_Level (Target_Type)
7832 Make_Raise_Program_Error (Sloc (N),
7833 Reason => PE_Accessibility_Check_Failed));
7834 Set_Etype (N, Target_Type);
7836 -- When the operand is a selected access discriminant the check needs
7837 -- to be made against the level of the object denoted by the prefix
7838 -- of the selected name. Force Program_Error for this case as well
7839 -- (this accessibility violation can only happen if within the body
7840 -- of an instantiation).
7842 elsif In_Instance_Body
7843 and then Ekind (Operand_Type) = E_Anonymous_Access_Type
7844 and then Nkind (Operand) = N_Selected_Component
7845 and then Object_Access_Level (Operand) >
7846 Type_Access_Level (Target_Type)
7849 Make_Raise_Program_Error (Sloc (N),
7850 Reason => PE_Accessibility_Check_Failed));
7851 Set_Etype (N, Target_Type);
7855 -- Case of conversions of tagged types and access to tagged types
7857 -- When needed, that is to say when the expression is class-wide, Add
7858 -- runtime a tag check for (strict) downward conversion by using the
7859 -- membership test, generating:
7861 -- [constraint_error when Operand not in Target_Type'Class]
7863 -- or in the access type case
7865 -- [constraint_error
7866 -- when Operand /= null
7867 -- and then Operand.all not in
7868 -- Designated_Type (Target_Type)'Class]
7870 if (Is_Access_Type (Target_Type)
7871 and then Is_Tagged_Type (Designated_Type (Target_Type)))
7872 or else Is_Tagged_Type (Target_Type)
7874 -- Do not do any expansion in the access type case if the parent is a
7875 -- renaming, since this is an error situation which will be caught by
7876 -- Sem_Ch8, and the expansion can interfere with this error check.
7878 if Is_Access_Type (Target_Type)
7879 and then Is_Renamed_Object (N)
7884 -- Otherwise, proceed with processing tagged conversion
7887 Actual_Op_Typ : Entity_Id;
7888 Actual_Targ_Typ : Entity_Id;
7889 Make_Conversion : Boolean := False;
7890 Root_Op_Typ : Entity_Id;
7892 procedure Make_Tag_Check (Targ_Typ : Entity_Id);
7893 -- Create a membership check to test whether Operand is a member
7894 -- of Targ_Typ. If the original Target_Type is an access, include
7895 -- a test for null value. The check is inserted at N.
7897 --------------------
7898 -- Make_Tag_Check --
7899 --------------------
7901 procedure Make_Tag_Check (Targ_Typ : Entity_Id) is
7906 -- [Constraint_Error
7907 -- when Operand /= null
7908 -- and then Operand.all not in Targ_Typ]
7910 if Is_Access_Type (Target_Type) then
7915 Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
7916 Right_Opnd => Make_Null (Loc)),
7921 Make_Explicit_Dereference (Loc,
7922 Prefix => Duplicate_Subexpr_No_Checks (Operand)),
7923 Right_Opnd => New_Reference_To (Targ_Typ, Loc)));
7926 -- [Constraint_Error when Operand not in Targ_Typ]
7931 Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
7932 Right_Opnd => New_Reference_To (Targ_Typ, Loc));
7936 Make_Raise_Constraint_Error (Loc,
7938 Reason => CE_Tag_Check_Failed));
7941 -- Start of processing
7944 if Is_Access_Type (Target_Type) then
7945 Actual_Op_Typ := Designated_Type (Operand_Type);
7946 Actual_Targ_Typ := Designated_Type (Target_Type);
7949 Actual_Op_Typ := Operand_Type;
7950 Actual_Targ_Typ := Target_Type;
7953 Root_Op_Typ := Root_Type (Actual_Op_Typ);
7955 -- Ada 2005 (AI-251): Handle interface type conversion
7957 if Is_Interface (Actual_Op_Typ) then
7958 Expand_Interface_Conversion (N, Is_Static => False);
7962 if not Tag_Checks_Suppressed (Actual_Targ_Typ) then
7964 -- Create a runtime tag check for a downward class-wide type
7967 if Is_Class_Wide_Type (Actual_Op_Typ)
7968 and then Root_Op_Typ /= Actual_Targ_Typ
7969 and then Is_Ancestor (Root_Op_Typ, Actual_Targ_Typ)
7971 Make_Tag_Check (Class_Wide_Type (Actual_Targ_Typ));
7972 Make_Conversion := True;
7975 -- AI05-0073: If the result subtype of the function is defined
7976 -- by an access_definition designating a specific tagged type
7977 -- T, a check is made that the result value is null or the tag
7978 -- of the object designated by the result value identifies T.
7979 -- Constraint_Error is raised if this check fails.
7981 if Nkind (Parent (N)) = Sinfo.N_Return_Statement then
7984 Func_Typ : Entity_Id;
7987 -- Climb scope stack looking for the enclosing function
7989 Func := Current_Scope;
7990 while Present (Func)
7991 and then Ekind (Func) /= E_Function
7993 Func := Scope (Func);
7996 -- The function's return subtype must be defined using
7997 -- an access definition.
7999 if Nkind (Result_Definition (Parent (Func))) =
8002 Func_Typ := Directly_Designated_Type (Etype (Func));
8004 -- The return subtype denotes a specific tagged type,
8005 -- in other words, a non class-wide type.
8007 if Is_Tagged_Type (Func_Typ)
8008 and then not Is_Class_Wide_Type (Func_Typ)
8010 Make_Tag_Check (Actual_Targ_Typ);
8011 Make_Conversion := True;
8017 -- We have generated a tag check for either a class-wide type
8018 -- conversion or for AI05-0073.
8020 if Make_Conversion then
8025 Make_Unchecked_Type_Conversion (Loc,
8026 Subtype_Mark => New_Occurrence_Of (Target_Type, Loc),
8027 Expression => Relocate_Node (Expression (N)));
8029 Analyze_And_Resolve (N, Target_Type);
8035 -- Case of other access type conversions
8037 elsif Is_Access_Type (Target_Type) then
8038 Apply_Constraint_Check (Operand, Target_Type);
8040 -- Case of conversions from a fixed-point type
8042 -- These conversions require special expansion and processing, found in
8043 -- the Exp_Fixd package. We ignore cases where Conversion_OK is set,
8044 -- since from a semantic point of view, these are simple integer
8045 -- conversions, which do not need further processing.
8047 elsif Is_Fixed_Point_Type (Operand_Type)
8048 and then not Conversion_OK (N)
8050 -- We should never see universal fixed at this case, since the
8051 -- expansion of the constituent divide or multiply should have
8052 -- eliminated the explicit mention of universal fixed.
8054 pragma Assert (Operand_Type /= Universal_Fixed);
8056 -- Check for special case of the conversion to universal real that
8057 -- occurs as a result of the use of a round attribute. In this case,
8058 -- the real type for the conversion is taken from the target type of
8059 -- the Round attribute and the result must be marked as rounded.
8061 if Target_Type = Universal_Real
8062 and then Nkind (Parent (N)) = N_Attribute_Reference
8063 and then Attribute_Name (Parent (N)) = Name_Round
8065 Set_Rounded_Result (N);
8066 Set_Etype (N, Etype (Parent (N)));
8069 -- Otherwise do correct fixed-conversion, but skip these if the
8070 -- Conversion_OK flag is set, because from a semantic point of
8071 -- view these are simple integer conversions needing no further
8072 -- processing (the backend will simply treat them as integers)
8074 if not Conversion_OK (N) then
8075 if Is_Fixed_Point_Type (Etype (N)) then
8076 Expand_Convert_Fixed_To_Fixed (N);
8079 elsif Is_Integer_Type (Etype (N)) then
8080 Expand_Convert_Fixed_To_Integer (N);
8083 pragma Assert (Is_Floating_Point_Type (Etype (N)));
8084 Expand_Convert_Fixed_To_Float (N);
8089 -- Case of conversions to a fixed-point type
8091 -- These conversions require special expansion and processing, found in
8092 -- the Exp_Fixd package. Again, ignore cases where Conversion_OK is set,
8093 -- since from a semantic point of view, these are simple integer
8094 -- conversions, which do not need further processing.
8096 elsif Is_Fixed_Point_Type (Target_Type)
8097 and then not Conversion_OK (N)
8099 if Is_Integer_Type (Operand_Type) then
8100 Expand_Convert_Integer_To_Fixed (N);
8103 pragma Assert (Is_Floating_Point_Type (Operand_Type));
8104 Expand_Convert_Float_To_Fixed (N);
8108 -- Case of float-to-integer conversions
8110 -- We also handle float-to-fixed conversions with Conversion_OK set
8111 -- since semantically the fixed-point target is treated as though it
8112 -- were an integer in such cases.
8114 elsif Is_Floating_Point_Type (Operand_Type)
8116 (Is_Integer_Type (Target_Type)
8118 (Is_Fixed_Point_Type (Target_Type) and then Conversion_OK (N)))
8120 -- One more check here, gcc is still not able to do conversions of
8121 -- this type with proper overflow checking, and so gigi is doing an
8122 -- approximation of what is required by doing floating-point compares
8123 -- with the end-point. But that can lose precision in some cases, and
8124 -- give a wrong result. Converting the operand to Universal_Real is
8125 -- helpful, but still does not catch all cases with 64-bit integers
8126 -- on targets with only 64-bit floats
8128 -- The above comment seems obsoleted by Apply_Float_Conversion_Check
8129 -- Can this code be removed ???
8131 if Do_Range_Check (Operand) then
8133 Make_Type_Conversion (Loc,
8135 New_Occurrence_Of (Universal_Real, Loc),
8137 Relocate_Node (Operand)));
8139 Set_Etype (Operand, Universal_Real);
8140 Enable_Range_Check (Operand);
8141 Set_Do_Range_Check (Expression (Operand), False);
8144 -- Case of array conversions
8146 -- Expansion of array conversions, add required length/range checks but
8147 -- only do this if there is no change of representation. For handling of
8148 -- this case, see Handle_Changed_Representation.
8150 elsif Is_Array_Type (Target_Type) then
8152 if Is_Constrained (Target_Type) then
8153 Apply_Length_Check (Operand, Target_Type);
8155 Apply_Range_Check (Operand, Target_Type);
8158 Handle_Changed_Representation;
8160 -- Case of conversions of discriminated types
8162 -- Add required discriminant checks if target is constrained. Again this
8163 -- change is skipped if we have a change of representation.
8165 elsif Has_Discriminants (Target_Type)
8166 and then Is_Constrained (Target_Type)
8168 Apply_Discriminant_Check (Operand, Target_Type);
8169 Handle_Changed_Representation;
8171 -- Case of all other record conversions. The only processing required
8172 -- is to check for a change of representation requiring the special
8173 -- assignment processing.
8175 elsif Is_Record_Type (Target_Type) then
8177 -- Ada 2005 (AI-216): Program_Error is raised when converting from
8178 -- a derived Unchecked_Union type to an unconstrained type that is
8179 -- not Unchecked_Union if the operand lacks inferable discriminants.
8181 if Is_Derived_Type (Operand_Type)
8182 and then Is_Unchecked_Union (Base_Type (Operand_Type))
8183 and then not Is_Constrained (Target_Type)
8184 and then not Is_Unchecked_Union (Base_Type (Target_Type))
8185 and then not Has_Inferable_Discriminants (Operand)
8187 -- To prevent Gigi from generating illegal code, we generate a
8188 -- Program_Error node, but we give it the target type of the
8192 PE : constant Node_Id := Make_Raise_Program_Error (Loc,
8193 Reason => PE_Unchecked_Union_Restriction);
8196 Set_Etype (PE, Target_Type);
8201 Handle_Changed_Representation;
8204 -- Case of conversions of enumeration types
8206 elsif Is_Enumeration_Type (Target_Type) then
8208 -- Special processing is required if there is a change of
8209 -- representation (from enumeration representation clauses)
8211 if not Same_Representation (Target_Type, Operand_Type) then
8213 -- Convert: x(y) to x'val (ytyp'val (y))
8216 Make_Attribute_Reference (Loc,
8217 Prefix => New_Occurrence_Of (Target_Type, Loc),
8218 Attribute_Name => Name_Val,
8219 Expressions => New_List (
8220 Make_Attribute_Reference (Loc,
8221 Prefix => New_Occurrence_Of (Operand_Type, Loc),
8222 Attribute_Name => Name_Pos,
8223 Expressions => New_List (Operand)))));
8225 Analyze_And_Resolve (N, Target_Type);
8228 -- Case of conversions to floating-point
8230 elsif Is_Floating_Point_Type (Target_Type) then
8234 -- At this stage, either the conversion node has been transformed into
8235 -- some other equivalent expression, or left as a conversion that can
8236 -- be handled by Gigi. The conversions that Gigi can handle are the
8239 -- Conversions with no change of representation or type
8241 -- Numeric conversions involving integer, floating- and fixed-point
8242 -- values. Fixed-point values are allowed only if Conversion_OK is
8243 -- set, i.e. if the fixed-point values are to be treated as integers.
8245 -- No other conversions should be passed to Gigi
8247 -- Check: are these rules stated in sinfo??? if so, why restate here???
8249 -- The only remaining step is to generate a range check if we still have
8250 -- a type conversion at this stage and Do_Range_Check is set. For now we
8251 -- do this only for conversions of discrete types.
8253 if Nkind (N) = N_Type_Conversion
8254 and then Is_Discrete_Type (Etype (N))
8257 Expr : constant Node_Id := Expression (N);
8262 if Do_Range_Check (Expr)
8263 and then Is_Discrete_Type (Etype (Expr))
8265 Set_Do_Range_Check (Expr, False);
8267 -- Before we do a range check, we have to deal with treating a
8268 -- fixed-point operand as an integer. The way we do this is
8269 -- simply to do an unchecked conversion to an appropriate
8270 -- integer type large enough to hold the result.
8272 -- This code is not active yet, because we are only dealing
8273 -- with discrete types so far ???
8275 if Nkind (Expr) in N_Has_Treat_Fixed_As_Integer
8276 and then Treat_Fixed_As_Integer (Expr)
8278 Ftyp := Base_Type (Etype (Expr));
8280 if Esize (Ftyp) >= Esize (Standard_Integer) then
8281 Ityp := Standard_Long_Long_Integer;
8283 Ityp := Standard_Integer;
8286 Rewrite (Expr, Unchecked_Convert_To (Ityp, Expr));
8289 -- Reset overflow flag, since the range check will include
8290 -- dealing with possible overflow, and generate the check If
8291 -- Address is either a source type or target type, suppress
8292 -- range check to avoid typing anomalies when it is a visible
8295 Set_Do_Overflow_Check (N, False);
8296 if not Is_Descendent_Of_Address (Etype (Expr))
8297 and then not Is_Descendent_Of_Address (Target_Type)
8299 Generate_Range_Check
8300 (Expr, Target_Type, CE_Range_Check_Failed);
8306 -- Final step, if the result is a type conversion involving Vax_Float
8307 -- types, then it is subject for further special processing.
8309 if Nkind (N) = N_Type_Conversion
8310 and then (Vax_Float (Operand_Type) or else Vax_Float (Target_Type))
8312 Expand_Vax_Conversion (N);
8315 end Expand_N_Type_Conversion;
8317 -----------------------------------
8318 -- Expand_N_Unchecked_Expression --
8319 -----------------------------------
8321 -- Remove the unchecked expression node from the tree. It's job was simply
8322 -- to make sure that its constituent expression was handled with checks
8323 -- off, and now that that is done, we can remove it from the tree, and
8324 -- indeed must, since gigi does not expect to see these nodes.
8326 procedure Expand_N_Unchecked_Expression (N : Node_Id) is
8327 Exp : constant Node_Id := Expression (N);
8330 Set_Assignment_OK (Exp, Assignment_OK (N) or Assignment_OK (Exp));
8332 end Expand_N_Unchecked_Expression;
8334 ----------------------------------------
8335 -- Expand_N_Unchecked_Type_Conversion --
8336 ----------------------------------------
8338 -- If this cannot be handled by Gigi and we haven't already made a
8339 -- temporary for it, do it now.
8341 procedure Expand_N_Unchecked_Type_Conversion (N : Node_Id) is
8342 Target_Type : constant Entity_Id := Etype (N);
8343 Operand : constant Node_Id := Expression (N);
8344 Operand_Type : constant Entity_Id := Etype (Operand);
8347 -- If we have a conversion of a compile time known value to a target
8348 -- type and the value is in range of the target type, then we can simply
8349 -- replace the construct by an integer literal of the correct type. We
8350 -- only apply this to integer types being converted. Possibly it may
8351 -- apply in other cases, but it is too much trouble to worry about.
8353 -- Note that we do not do this transformation if the Kill_Range_Check
8354 -- flag is set, since then the value may be outside the expected range.
8355 -- This happens in the Normalize_Scalars case.
8357 -- We also skip this if either the target or operand type is biased
8358 -- because in this case, the unchecked conversion is supposed to
8359 -- preserve the bit pattern, not the integer value.
8361 if Is_Integer_Type (Target_Type)
8362 and then not Has_Biased_Representation (Target_Type)
8363 and then Is_Integer_Type (Operand_Type)
8364 and then not Has_Biased_Representation (Operand_Type)
8365 and then Compile_Time_Known_Value (Operand)
8366 and then not Kill_Range_Check (N)
8369 Val : constant Uint := Expr_Value (Operand);
8372 if Compile_Time_Known_Value (Type_Low_Bound (Target_Type))
8374 Compile_Time_Known_Value (Type_High_Bound (Target_Type))
8376 Val >= Expr_Value (Type_Low_Bound (Target_Type))
8378 Val <= Expr_Value (Type_High_Bound (Target_Type))
8380 Rewrite (N, Make_Integer_Literal (Sloc (N), Val));
8382 -- If Address is the target type, just set the type to avoid a
8383 -- spurious type error on the literal when Address is a visible
8386 if Is_Descendent_Of_Address (Target_Type) then
8387 Set_Etype (N, Target_Type);
8389 Analyze_And_Resolve (N, Target_Type);
8397 -- Nothing to do if conversion is safe
8399 if Safe_Unchecked_Type_Conversion (N) then
8403 -- Otherwise force evaluation unless Assignment_OK flag is set (this
8404 -- flag indicates ??? -- more comments needed here)
8406 if Assignment_OK (N) then
8409 Force_Evaluation (N);
8411 end Expand_N_Unchecked_Type_Conversion;
8413 ----------------------------
8414 -- Expand_Record_Equality --
8415 ----------------------------
8417 -- For non-variant records, Equality is expanded when needed into:
8419 -- and then Lhs.Discr1 = Rhs.Discr1
8421 -- and then Lhs.Discrn = Rhs.Discrn
8422 -- and then Lhs.Cmp1 = Rhs.Cmp1
8424 -- and then Lhs.Cmpn = Rhs.Cmpn
8426 -- The expression is folded by the back-end for adjacent fields. This
8427 -- function is called for tagged record in only one occasion: for imple-
8428 -- menting predefined primitive equality (see Predefined_Primitives_Bodies)
8429 -- otherwise the primitive "=" is used directly.
8431 function Expand_Record_Equality
8436 Bodies : List_Id) return Node_Id
8438 Loc : constant Source_Ptr := Sloc (Nod);
8443 First_Time : Boolean := True;
8445 function Suitable_Element (C : Entity_Id) return Entity_Id;
8446 -- Return the first field to compare beginning with C, skipping the
8447 -- inherited components.
8449 ----------------------
8450 -- Suitable_Element --
8451 ----------------------
8453 function Suitable_Element (C : Entity_Id) return Entity_Id is
8458 elsif Ekind (C) /= E_Discriminant
8459 and then Ekind (C) /= E_Component
8461 return Suitable_Element (Next_Entity (C));
8463 elsif Is_Tagged_Type (Typ)
8464 and then C /= Original_Record_Component (C)
8466 return Suitable_Element (Next_Entity (C));
8468 elsif Chars (C) = Name_uController
8469 or else Chars (C) = Name_uTag
8471 return Suitable_Element (Next_Entity (C));
8473 elsif Is_Interface (Etype (C)) then
8474 return Suitable_Element (Next_Entity (C));
8479 end Suitable_Element;
8481 -- Start of processing for Expand_Record_Equality
8484 -- Generates the following code: (assuming that Typ has one Discr and
8485 -- component C2 is also a record)
8488 -- and then Lhs.Discr1 = Rhs.Discr1
8489 -- and then Lhs.C1 = Rhs.C1
8490 -- and then Lhs.C2.C1=Rhs.C2.C1 and then ... Lhs.C2.Cn=Rhs.C2.Cn
8492 -- and then Lhs.Cmpn = Rhs.Cmpn
8494 Result := New_Reference_To (Standard_True, Loc);
8495 C := Suitable_Element (First_Entity (Typ));
8497 while Present (C) loop
8505 First_Time := False;
8509 New_Lhs := New_Copy_Tree (Lhs);
8510 New_Rhs := New_Copy_Tree (Rhs);
8514 Expand_Composite_Equality (Nod, Etype (C),
8516 Make_Selected_Component (Loc,
8518 Selector_Name => New_Reference_To (C, Loc)),
8520 Make_Selected_Component (Loc,
8522 Selector_Name => New_Reference_To (C, Loc)),
8525 -- If some (sub)component is an unchecked_union, the whole
8526 -- operation will raise program error.
8528 if Nkind (Check) = N_Raise_Program_Error then
8530 Set_Etype (Result, Standard_Boolean);
8535 Left_Opnd => Result,
8536 Right_Opnd => Check);
8540 C := Suitable_Element (Next_Entity (C));
8544 end Expand_Record_Equality;
8546 -------------------------------------
8547 -- Fixup_Universal_Fixed_Operation --
8548 -------------------------------------
8550 procedure Fixup_Universal_Fixed_Operation (N : Node_Id) is
8551 Conv : constant Node_Id := Parent (N);
8554 -- We must have a type conversion immediately above us
8556 pragma Assert (Nkind (Conv) = N_Type_Conversion);
8558 -- Normally the type conversion gives our target type. The exception
8559 -- occurs in the case of the Round attribute, where the conversion
8560 -- will be to universal real, and our real type comes from the Round
8561 -- attribute (as well as an indication that we must round the result)
8563 if Nkind (Parent (Conv)) = N_Attribute_Reference
8564 and then Attribute_Name (Parent (Conv)) = Name_Round
8566 Set_Etype (N, Etype (Parent (Conv)));
8567 Set_Rounded_Result (N);
8569 -- Normal case where type comes from conversion above us
8572 Set_Etype (N, Etype (Conv));
8574 end Fixup_Universal_Fixed_Operation;
8576 ------------------------------
8577 -- Get_Allocator_Final_List --
8578 ------------------------------
8580 function Get_Allocator_Final_List
8583 PtrT : Entity_Id) return Entity_Id
8585 Loc : constant Source_Ptr := Sloc (N);
8587 Owner : Entity_Id := PtrT;
8588 -- The entity whose finalization list must be used to attach the
8589 -- allocated object.
8592 if Ekind (PtrT) = E_Anonymous_Access_Type then
8594 -- If the context is an access parameter, we need to create a
8595 -- non-anonymous access type in order to have a usable final list,
8596 -- because there is otherwise no pool to which the allocated object
8597 -- can belong. We create both the type and the finalization chain
8598 -- here, because freezing an internal type does not create such a
8599 -- chain. The Final_Chain that is thus created is shared by the
8600 -- access parameter. The access type is tested against the result
8601 -- type of the function to exclude allocators whose type is an
8602 -- anonymous access result type. We freeze the type at once to
8603 -- ensure that it is properly decorated for the back-end, even
8604 -- if the context and current scope is a loop.
8606 if Nkind (Associated_Node_For_Itype (PtrT))
8607 in N_Subprogram_Specification
8610 Etype (Defining_Unit_Name (Associated_Node_For_Itype (PtrT)))
8612 Owner := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
8614 Make_Full_Type_Declaration (Loc,
8615 Defining_Identifier => Owner,
8617 Make_Access_To_Object_Definition (Loc,
8618 Subtype_Indication =>
8619 New_Occurrence_Of (T, Loc))));
8621 Freeze_Before (N, Owner);
8622 Build_Final_List (N, Owner);
8623 Set_Associated_Final_Chain (PtrT, Associated_Final_Chain (Owner));
8625 -- Ada 2005 (AI-318-02): If the context is a return object
8626 -- declaration, then the anonymous return subtype is defined to have
8627 -- the same accessibility level as that of the function's result
8628 -- subtype, which means that we want the scope where the function is
8631 elsif Nkind (Associated_Node_For_Itype (PtrT)) = N_Object_Declaration
8632 and then Ekind (Scope (PtrT)) = E_Return_Statement
8634 Owner := Scope (Return_Applies_To (Scope (PtrT)));
8636 -- Case of an access discriminant, or (Ada 2005), of an anonymous
8637 -- access component or anonymous access function result: find the
8638 -- final list associated with the scope of the type. (In the
8639 -- anonymous access component kind, a list controller will have
8640 -- been allocated when freezing the record type, and PtrT has an
8641 -- Associated_Final_Chain attribute designating it.)
8643 elsif No (Associated_Final_Chain (PtrT)) then
8644 Owner := Scope (PtrT);
8648 return Find_Final_List (Owner);
8649 end Get_Allocator_Final_List;
8651 ---------------------------------
8652 -- Has_Inferable_Discriminants --
8653 ---------------------------------
8655 function Has_Inferable_Discriminants (N : Node_Id) return Boolean is
8657 function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean;
8658 -- Determines whether the left-most prefix of a selected component is a
8659 -- formal parameter in a subprogram. Assumes N is a selected component.
8661 --------------------------------
8662 -- Prefix_Is_Formal_Parameter --
8663 --------------------------------
8665 function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean is
8666 Sel_Comp : Node_Id := N;
8669 -- Move to the left-most prefix by climbing up the tree
8671 while Present (Parent (Sel_Comp))
8672 and then Nkind (Parent (Sel_Comp)) = N_Selected_Component
8674 Sel_Comp := Parent (Sel_Comp);
8677 return Ekind (Entity (Prefix (Sel_Comp))) in Formal_Kind;
8678 end Prefix_Is_Formal_Parameter;
8680 -- Start of processing for Has_Inferable_Discriminants
8683 -- For identifiers and indexed components, it is sufficient to have a
8684 -- constrained Unchecked_Union nominal subtype.
8686 if Nkind_In (N, N_Identifier, N_Indexed_Component) then
8687 return Is_Unchecked_Union (Base_Type (Etype (N)))
8689 Is_Constrained (Etype (N));
8691 -- For selected components, the subtype of the selector must be a
8692 -- constrained Unchecked_Union. If the component is subject to a
8693 -- per-object constraint, then the enclosing object must have inferable
8696 elsif Nkind (N) = N_Selected_Component then
8697 if Has_Per_Object_Constraint (Entity (Selector_Name (N))) then
8699 -- A small hack. If we have a per-object constrained selected
8700 -- component of a formal parameter, return True since we do not
8701 -- know the actual parameter association yet.
8703 if Prefix_Is_Formal_Parameter (N) then
8707 -- Otherwise, check the enclosing object and the selector
8709 return Has_Inferable_Discriminants (Prefix (N))
8711 Has_Inferable_Discriminants (Selector_Name (N));
8714 -- The call to Has_Inferable_Discriminants will determine whether
8715 -- the selector has a constrained Unchecked_Union nominal type.
8717 return Has_Inferable_Discriminants (Selector_Name (N));
8719 -- A qualified expression has inferable discriminants if its subtype
8720 -- mark is a constrained Unchecked_Union subtype.
8722 elsif Nkind (N) = N_Qualified_Expression then
8723 return Is_Unchecked_Union (Subtype_Mark (N))
8725 Is_Constrained (Subtype_Mark (N));
8730 end Has_Inferable_Discriminants;
8732 -------------------------------
8733 -- Insert_Dereference_Action --
8734 -------------------------------
8736 procedure Insert_Dereference_Action (N : Node_Id) is
8737 Loc : constant Source_Ptr := Sloc (N);
8738 Typ : constant Entity_Id := Etype (N);
8739 Pool : constant Entity_Id := Associated_Storage_Pool (Typ);
8740 Pnod : constant Node_Id := Parent (N);
8742 function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean;
8743 -- Return true if type of P is derived from Checked_Pool;
8745 -----------------------------
8746 -- Is_Checked_Storage_Pool --
8747 -----------------------------
8749 function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean is
8758 while T /= Etype (T) loop
8759 if Is_RTE (T, RE_Checked_Pool) then
8767 end Is_Checked_Storage_Pool;
8769 -- Start of processing for Insert_Dereference_Action
8772 pragma Assert (Nkind (Pnod) = N_Explicit_Dereference);
8774 if not (Is_Checked_Storage_Pool (Pool)
8775 and then Comes_From_Source (Original_Node (Pnod)))
8781 Make_Procedure_Call_Statement (Loc,
8782 Name => New_Reference_To (
8783 Find_Prim_Op (Etype (Pool), Name_Dereference), Loc),
8785 Parameter_Associations => New_List (
8789 New_Reference_To (Pool, Loc),
8791 -- Storage_Address. We use the attribute Pool_Address, which uses
8792 -- the pointer itself to find the address of the object, and which
8793 -- handles unconstrained arrays properly by computing the address
8794 -- of the template. i.e. the correct address of the corresponding
8797 Make_Attribute_Reference (Loc,
8798 Prefix => Duplicate_Subexpr_Move_Checks (N),
8799 Attribute_Name => Name_Pool_Address),
8801 -- Size_In_Storage_Elements
8803 Make_Op_Divide (Loc,
8805 Make_Attribute_Reference (Loc,
8807 Make_Explicit_Dereference (Loc,
8808 Duplicate_Subexpr_Move_Checks (N)),
8809 Attribute_Name => Name_Size),
8811 Make_Integer_Literal (Loc, System_Storage_Unit)),
8815 Make_Attribute_Reference (Loc,
8817 Make_Explicit_Dereference (Loc,
8818 Duplicate_Subexpr_Move_Checks (N)),
8819 Attribute_Name => Name_Alignment))));
8822 when RE_Not_Available =>
8824 end Insert_Dereference_Action;
8826 ------------------------------
8827 -- Make_Array_Comparison_Op --
8828 ------------------------------
8830 -- This is a hand-coded expansion of the following generic function:
8833 -- type elem is (<>);
8834 -- type index is (<>);
8835 -- type a is array (index range <>) of elem;
8837 -- function Gnnn (X : a; Y: a) return boolean is
8838 -- J : index := Y'first;
8841 -- if X'length = 0 then
8844 -- elsif Y'length = 0 then
8848 -- for I in X'range loop
8849 -- if X (I) = Y (J) then
8850 -- if J = Y'last then
8853 -- J := index'succ (J);
8857 -- return X (I) > Y (J);
8861 -- return X'length > Y'length;
8865 -- Note that since we are essentially doing this expansion by hand, we
8866 -- do not need to generate an actual or formal generic part, just the
8867 -- instantiated function itself.
8869 function Make_Array_Comparison_Op
8871 Nod : Node_Id) return Node_Id
8873 Loc : constant Source_Ptr := Sloc (Nod);
8875 X : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uX);
8876 Y : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uY);
8877 I : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uI);
8878 J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ);
8880 Index : constant Entity_Id := Base_Type (Etype (First_Index (Typ)));
8882 Loop_Statement : Node_Id;
8883 Loop_Body : Node_Id;
8886 Final_Expr : Node_Id;
8887 Func_Body : Node_Id;
8888 Func_Name : Entity_Id;
8894 -- if J = Y'last then
8897 -- J := index'succ (J);
8901 Make_Implicit_If_Statement (Nod,
8904 Left_Opnd => New_Reference_To (J, Loc),
8906 Make_Attribute_Reference (Loc,
8907 Prefix => New_Reference_To (Y, Loc),
8908 Attribute_Name => Name_Last)),
8910 Then_Statements => New_List (
8911 Make_Exit_Statement (Loc)),
8915 Make_Assignment_Statement (Loc,
8916 Name => New_Reference_To (J, Loc),
8918 Make_Attribute_Reference (Loc,
8919 Prefix => New_Reference_To (Index, Loc),
8920 Attribute_Name => Name_Succ,
8921 Expressions => New_List (New_Reference_To (J, Loc))))));
8923 -- if X (I) = Y (J) then
8926 -- return X (I) > Y (J);
8930 Make_Implicit_If_Statement (Nod,
8934 Make_Indexed_Component (Loc,
8935 Prefix => New_Reference_To (X, Loc),
8936 Expressions => New_List (New_Reference_To (I, Loc))),
8939 Make_Indexed_Component (Loc,
8940 Prefix => New_Reference_To (Y, Loc),
8941 Expressions => New_List (New_Reference_To (J, Loc)))),
8943 Then_Statements => New_List (Inner_If),
8945 Else_Statements => New_List (
8946 Make_Simple_Return_Statement (Loc,
8950 Make_Indexed_Component (Loc,
8951 Prefix => New_Reference_To (X, Loc),
8952 Expressions => New_List (New_Reference_To (I, Loc))),
8955 Make_Indexed_Component (Loc,
8956 Prefix => New_Reference_To (Y, Loc),
8957 Expressions => New_List (
8958 New_Reference_To (J, Loc)))))));
8960 -- for I in X'range loop
8965 Make_Implicit_Loop_Statement (Nod,
8966 Identifier => Empty,
8969 Make_Iteration_Scheme (Loc,
8970 Loop_Parameter_Specification =>
8971 Make_Loop_Parameter_Specification (Loc,
8972 Defining_Identifier => I,
8973 Discrete_Subtype_Definition =>
8974 Make_Attribute_Reference (Loc,
8975 Prefix => New_Reference_To (X, Loc),
8976 Attribute_Name => Name_Range))),
8978 Statements => New_List (Loop_Body));
8980 -- if X'length = 0 then
8982 -- elsif Y'length = 0 then
8985 -- for ... loop ... end loop;
8986 -- return X'length > Y'length;
8990 Make_Attribute_Reference (Loc,
8991 Prefix => New_Reference_To (X, Loc),
8992 Attribute_Name => Name_Length);
8995 Make_Attribute_Reference (Loc,
8996 Prefix => New_Reference_To (Y, Loc),
8997 Attribute_Name => Name_Length);
9001 Left_Opnd => Length1,
9002 Right_Opnd => Length2);
9005 Make_Implicit_If_Statement (Nod,
9009 Make_Attribute_Reference (Loc,
9010 Prefix => New_Reference_To (X, Loc),
9011 Attribute_Name => Name_Length),
9013 Make_Integer_Literal (Loc, 0)),
9017 Make_Simple_Return_Statement (Loc,
9018 Expression => New_Reference_To (Standard_False, Loc))),
9020 Elsif_Parts => New_List (
9021 Make_Elsif_Part (Loc,
9025 Make_Attribute_Reference (Loc,
9026 Prefix => New_Reference_To (Y, Loc),
9027 Attribute_Name => Name_Length),
9029 Make_Integer_Literal (Loc, 0)),
9033 Make_Simple_Return_Statement (Loc,
9034 Expression => New_Reference_To (Standard_True, Loc))))),
9036 Else_Statements => New_List (
9038 Make_Simple_Return_Statement (Loc,
9039 Expression => Final_Expr)));
9043 Formals := New_List (
9044 Make_Parameter_Specification (Loc,
9045 Defining_Identifier => X,
9046 Parameter_Type => New_Reference_To (Typ, Loc)),
9048 Make_Parameter_Specification (Loc,
9049 Defining_Identifier => Y,
9050 Parameter_Type => New_Reference_To (Typ, Loc)));
9052 -- function Gnnn (...) return boolean is
9053 -- J : index := Y'first;
9058 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('G'));
9061 Make_Subprogram_Body (Loc,
9063 Make_Function_Specification (Loc,
9064 Defining_Unit_Name => Func_Name,
9065 Parameter_Specifications => Formals,
9066 Result_Definition => New_Reference_To (Standard_Boolean, Loc)),
9068 Declarations => New_List (
9069 Make_Object_Declaration (Loc,
9070 Defining_Identifier => J,
9071 Object_Definition => New_Reference_To (Index, Loc),
9073 Make_Attribute_Reference (Loc,
9074 Prefix => New_Reference_To (Y, Loc),
9075 Attribute_Name => Name_First))),
9077 Handled_Statement_Sequence =>
9078 Make_Handled_Sequence_Of_Statements (Loc,
9079 Statements => New_List (If_Stat)));
9082 end Make_Array_Comparison_Op;
9084 ---------------------------
9085 -- Make_Boolean_Array_Op --
9086 ---------------------------
9088 -- For logical operations on boolean arrays, expand in line the following,
9089 -- replacing 'and' with 'or' or 'xor' where needed:
9091 -- function Annn (A : typ; B: typ) return typ is
9094 -- for J in A'range loop
9095 -- C (J) := A (J) op B (J);
9100 -- Here typ is the boolean array type
9102 function Make_Boolean_Array_Op
9104 N : Node_Id) return Node_Id
9106 Loc : constant Source_Ptr := Sloc (N);
9108 A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA);
9109 B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB);
9110 C : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uC);
9111 J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ);
9119 Func_Name : Entity_Id;
9120 Func_Body : Node_Id;
9121 Loop_Statement : Node_Id;
9125 Make_Indexed_Component (Loc,
9126 Prefix => New_Reference_To (A, Loc),
9127 Expressions => New_List (New_Reference_To (J, Loc)));
9130 Make_Indexed_Component (Loc,
9131 Prefix => New_Reference_To (B, Loc),
9132 Expressions => New_List (New_Reference_To (J, Loc)));
9135 Make_Indexed_Component (Loc,
9136 Prefix => New_Reference_To (C, Loc),
9137 Expressions => New_List (New_Reference_To (J, Loc)));
9139 if Nkind (N) = N_Op_And then
9145 elsif Nkind (N) = N_Op_Or then
9159 Make_Implicit_Loop_Statement (N,
9160 Identifier => Empty,
9163 Make_Iteration_Scheme (Loc,
9164 Loop_Parameter_Specification =>
9165 Make_Loop_Parameter_Specification (Loc,
9166 Defining_Identifier => J,
9167 Discrete_Subtype_Definition =>
9168 Make_Attribute_Reference (Loc,
9169 Prefix => New_Reference_To (A, Loc),
9170 Attribute_Name => Name_Range))),
9172 Statements => New_List (
9173 Make_Assignment_Statement (Loc,
9175 Expression => Op)));
9177 Formals := New_List (
9178 Make_Parameter_Specification (Loc,
9179 Defining_Identifier => A,
9180 Parameter_Type => New_Reference_To (Typ, Loc)),
9182 Make_Parameter_Specification (Loc,
9183 Defining_Identifier => B,
9184 Parameter_Type => New_Reference_To (Typ, Loc)));
9187 Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
9188 Set_Is_Inlined (Func_Name);
9191 Make_Subprogram_Body (Loc,
9193 Make_Function_Specification (Loc,
9194 Defining_Unit_Name => Func_Name,
9195 Parameter_Specifications => Formals,
9196 Result_Definition => New_Reference_To (Typ, Loc)),
9198 Declarations => New_List (
9199 Make_Object_Declaration (Loc,
9200 Defining_Identifier => C,
9201 Object_Definition => New_Reference_To (Typ, Loc))),
9203 Handled_Statement_Sequence =>
9204 Make_Handled_Sequence_Of_Statements (Loc,
9205 Statements => New_List (
9207 Make_Simple_Return_Statement (Loc,
9208 Expression => New_Reference_To (C, Loc)))));
9211 end Make_Boolean_Array_Op;
9213 ------------------------
9214 -- Rewrite_Comparison --
9215 ------------------------
9217 procedure Rewrite_Comparison (N : Node_Id) is
9218 Warning_Generated : Boolean := False;
9219 -- Set to True if first pass with Assume_Valid generates a warning in
9220 -- which case we skip the second pass to avoid warning overloaded.
9223 -- Set to Standard_True or Standard_False
9226 if Nkind (N) = N_Type_Conversion then
9227 Rewrite_Comparison (Expression (N));
9230 elsif Nkind (N) not in N_Op_Compare then
9234 -- Now start looking at the comparison in detail. We potentially go
9235 -- through this loop twice. The first time, Assume_Valid is set False
9236 -- in the call to Compile_Time_Compare. If this call results in a
9237 -- clear result of always True or Always False, that's decisive and
9238 -- we are done. Otherwise we repeat the processing with Assume_Valid
9239 -- set to True to generate additional warnings. We can stil that step
9240 -- if Constant_Condition_Warnings is False.
9242 for AV in False .. True loop
9244 Typ : constant Entity_Id := Etype (N);
9245 Op1 : constant Node_Id := Left_Opnd (N);
9246 Op2 : constant Node_Id := Right_Opnd (N);
9248 Res : constant Compare_Result :=
9249 Compile_Time_Compare (Op1, Op2, Assume_Valid => AV);
9250 -- Res indicates if compare outcome can be compile time determined
9252 True_Result : Boolean;
9253 False_Result : Boolean;
9256 case N_Op_Compare (Nkind (N)) is
9258 True_Result := Res = EQ;
9259 False_Result := Res = LT or else Res = GT or else Res = NE;
9262 True_Result := Res in Compare_GE;
9263 False_Result := Res = LT;
9266 and then Constant_Condition_Warnings
9267 and then Comes_From_Source (Original_Node (N))
9268 and then Nkind (Original_Node (N)) = N_Op_Ge
9269 and then not In_Instance
9270 and then Is_Integer_Type (Etype (Left_Opnd (N)))
9271 and then not Has_Warnings_Off (Etype (Left_Opnd (N)))
9274 ("can never be greater than, could replace by ""'=""?", N);
9275 Warning_Generated := True;
9279 True_Result := Res = GT;
9280 False_Result := Res in Compare_LE;
9283 True_Result := Res = LT;
9284 False_Result := Res in Compare_GE;
9287 True_Result := Res in Compare_LE;
9288 False_Result := Res = GT;
9291 and then Constant_Condition_Warnings
9292 and then Comes_From_Source (Original_Node (N))
9293 and then Nkind (Original_Node (N)) = N_Op_Le
9294 and then not In_Instance
9295 and then Is_Integer_Type (Etype (Left_Opnd (N)))
9296 and then not Has_Warnings_Off (Etype (Left_Opnd (N)))
9299 ("can never be less than, could replace by ""'=""?", N);
9300 Warning_Generated := True;
9304 True_Result := Res = NE or else Res = GT or else Res = LT;
9305 False_Result := Res = EQ;
9308 -- If this is the first iteration, then we actually convert the
9309 -- comparison into True or False, if the result is certain.
9312 if True_Result or False_Result then
9314 Result := Standard_True;
9316 Result := Standard_False;
9321 New_Occurrence_Of (Result, Sloc (N))));
9322 Analyze_And_Resolve (N, Typ);
9323 Warn_On_Known_Condition (N);
9327 -- If this is the second iteration (AV = True), and the original
9328 -- node comes from source and we are not in an instance, then
9329 -- give a warning if we know result would be True or False. Note
9330 -- we know Constant_Condition_Warnings is set if we get here.
9332 elsif Comes_From_Source (Original_Node (N))
9333 and then not In_Instance
9337 ("condition can only be False if invalid values present?",
9339 elsif False_Result then
9341 ("condition can only be True if invalid values present?",
9347 -- Skip second iteration if not warning on constant conditions or
9348 -- if the first iteration already generated a warning of some kind
9349 -- or if we are in any case assuming all values are valid (so that
9350 -- the first iteration took care of the valid case).
9352 exit when not Constant_Condition_Warnings;
9353 exit when Warning_Generated;
9354 exit when Assume_No_Invalid_Values;
9356 end Rewrite_Comparison;
9358 ----------------------------
9359 -- Safe_In_Place_Array_Op --
9360 ----------------------------
9362 function Safe_In_Place_Array_Op
9365 Op2 : Node_Id) return Boolean
9369 function Is_Safe_Operand (Op : Node_Id) return Boolean;
9370 -- Operand is safe if it cannot overlap part of the target of the
9371 -- operation. If the operand and the target are identical, the operand
9372 -- is safe. The operand can be empty in the case of negation.
9374 function Is_Unaliased (N : Node_Id) return Boolean;
9375 -- Check that N is a stand-alone entity
9381 function Is_Unaliased (N : Node_Id) return Boolean is
9385 and then No (Address_Clause (Entity (N)))
9386 and then No (Renamed_Object (Entity (N)));
9389 ---------------------
9390 -- Is_Safe_Operand --
9391 ---------------------
9393 function Is_Safe_Operand (Op : Node_Id) return Boolean is
9398 elsif Is_Entity_Name (Op) then
9399 return Is_Unaliased (Op);
9401 elsif Nkind_In (Op, N_Indexed_Component, N_Selected_Component) then
9402 return Is_Unaliased (Prefix (Op));
9404 elsif Nkind (Op) = N_Slice then
9406 Is_Unaliased (Prefix (Op))
9407 and then Entity (Prefix (Op)) /= Target;
9409 elsif Nkind (Op) = N_Op_Not then
9410 return Is_Safe_Operand (Right_Opnd (Op));
9415 end Is_Safe_Operand;
9417 -- Start of processing for Is_Safe_In_Place_Array_Op
9420 -- Skip this processing if the component size is different from system
9421 -- storage unit (since at least for NOT this would cause problems).
9423 if Component_Size (Etype (Lhs)) /= System_Storage_Unit then
9426 -- Cannot do in place stuff on VM_Target since cannot pass addresses
9428 elsif VM_Target /= No_VM then
9431 -- Cannot do in place stuff if non-standard Boolean representation
9433 elsif Has_Non_Standard_Rep (Component_Type (Etype (Lhs))) then
9436 elsif not Is_Unaliased (Lhs) then
9439 Target := Entity (Lhs);
9442 Is_Safe_Operand (Op1)
9443 and then Is_Safe_Operand (Op2);
9445 end Safe_In_Place_Array_Op;
9447 -----------------------
9448 -- Tagged_Membership --
9449 -----------------------
9451 -- There are two different cases to consider depending on whether the right
9452 -- operand is a class-wide type or not. If not we just compare the actual
9453 -- tag of the left expr to the target type tag:
9455 -- Left_Expr.Tag = Right_Type'Tag;
9457 -- If it is a class-wide type we use the RT function CW_Membership which is
9458 -- usually implemented by looking in the ancestor tables contained in the
9459 -- dispatch table pointed by Left_Expr.Tag for Typ'Tag
9461 -- Ada 2005 (AI-251): If it is a class-wide interface type we use the RT
9462 -- function IW_Membership which is usually implemented by looking in the
9463 -- table of abstract interface types plus the ancestor table contained in
9464 -- the dispatch table pointed by Left_Expr.Tag for Typ'Tag
9466 function Tagged_Membership (N : Node_Id) return Node_Id is
9467 Left : constant Node_Id := Left_Opnd (N);
9468 Right : constant Node_Id := Right_Opnd (N);
9469 Loc : constant Source_Ptr := Sloc (N);
9471 Left_Type : Entity_Id;
9472 Right_Type : Entity_Id;
9476 Left_Type := Etype (Left);
9477 Right_Type := Etype (Right);
9479 if Is_Class_Wide_Type (Left_Type) then
9480 Left_Type := Root_Type (Left_Type);
9484 Make_Selected_Component (Loc,
9485 Prefix => Relocate_Node (Left),
9487 New_Reference_To (First_Tag_Component (Left_Type), Loc));
9489 if Is_Class_Wide_Type (Right_Type) then
9491 -- No need to issue a run-time check if we statically know that the
9492 -- result of this membership test is always true. For example,
9493 -- considering the following declarations:
9495 -- type Iface is interface;
9496 -- type T is tagged null record;
9497 -- type DT is new T and Iface with null record;
9502 -- These membership tests are always true:
9506 -- Obj2 in Iface'Class;
9508 -- We do not need to handle cases where the membership is illegal.
9511 -- Obj1 in DT'Class; -- Compile time error
9512 -- Obj1 in Iface'Class; -- Compile time error
9514 if not Is_Class_Wide_Type (Left_Type)
9515 and then (Is_Ancestor (Etype (Right_Type), Left_Type)
9516 or else (Is_Interface (Etype (Right_Type))
9517 and then Interface_Present_In_Ancestor
9519 Iface => Etype (Right_Type))))
9521 return New_Reference_To (Standard_True, Loc);
9524 -- Ada 2005 (AI-251): Class-wide applied to interfaces
9526 if Is_Interface (Etype (Class_Wide_Type (Right_Type)))
9528 -- Support to: "Iface_CW_Typ in Typ'Class"
9530 or else Is_Interface (Left_Type)
9532 -- Issue error if IW_Membership operation not available in a
9533 -- configurable run time setting.
9535 if not RTE_Available (RE_IW_Membership) then
9537 ("dynamic membership test on interface types", N);
9542 Make_Function_Call (Loc,
9543 Name => New_Occurrence_Of (RTE (RE_IW_Membership), Loc),
9544 Parameter_Associations => New_List (
9545 Make_Attribute_Reference (Loc,
9547 Attribute_Name => Name_Address),
9550 (Access_Disp_Table (Root_Type (Right_Type)))),
9553 -- Ada 95: Normal case
9557 Build_CW_Membership (Loc,
9558 Obj_Tag_Node => Obj_Tag,
9562 (Access_Disp_Table (Root_Type (Right_Type)))),
9566 -- Right_Type is not a class-wide type
9569 -- No need to check the tag of the object if Right_Typ is abstract
9571 if Is_Abstract_Type (Right_Type) then
9572 return New_Reference_To (Standard_False, Loc);
9577 Left_Opnd => Obj_Tag,
9580 (Node (First_Elmt (Access_Disp_Table (Right_Type))), Loc));
9583 end Tagged_Membership;
9585 ------------------------------
9586 -- Unary_Op_Validity_Checks --
9587 ------------------------------
9589 procedure Unary_Op_Validity_Checks (N : Node_Id) is
9591 if Validity_Checks_On and Validity_Check_Operands then
9592 Ensure_Valid (Right_Opnd (N));
9594 end Unary_Op_Validity_Checks;
OSDN Git Service
