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 not Tagged_Type_Expansion then
385 pragma Assert (Nkind (N) = N_Identifier
386 and then Nkind (Orig_Node) = N_Allocator);
388 PtrT := Etype (Orig_Node);
389 Dtyp := Available_View (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 Tagged_Type_Expansion
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 if Is_CPP_Constructor_Call (Exp) then
578 -- Pnnn : constant ptr_T := new (T); Init (Pnnn.all,...); Pnnn
580 -- Allocate the object with no expression
582 Node := Relocate_Node (N);
583 Set_Expression (Node,
584 New_Reference_To (Root_Type (Etype (Exp)), Loc));
586 -- Avoid its expansion to avoid generating a call to the default
591 Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
594 Make_Object_Declaration (Loc,
595 Defining_Identifier => Temp,
596 Constant_Present => True,
597 Object_Definition => New_Reference_To (PtrT, Loc),
598 Expression => Node));
600 Apply_Accessibility_Check (Temp);
602 -- Locate the enclosing list and insert the C++ constructor call
609 while not Is_List_Member (P) loop
613 Insert_List_After_And_Analyze (P,
614 Build_Initialization_Call (Loc,
616 Make_Explicit_Dereference (Loc,
617 Prefix => New_Reference_To (Temp, Loc)),
618 Typ => Root_Type (Etype (Exp)),
619 Constructor_Ref => Exp));
622 Rewrite (N, New_Reference_To (Temp, Loc));
623 Analyze_And_Resolve (N, PtrT);
627 -- Ada 2005 (AI-318-02): If the initialization expression is a call
628 -- to a build-in-place function, then access to the allocated object
629 -- must be passed to the function. Currently we limit such functions
630 -- to those with constrained limited result subtypes, but eventually
631 -- we plan to expand the allowed forms of functions that are treated
632 -- as build-in-place.
634 if Ada_Version >= Ada_05
635 and then Is_Build_In_Place_Function_Call (Exp)
637 Make_Build_In_Place_Call_In_Allocator (N, Exp);
638 Apply_Accessibility_Check (N, Built_In_Place => True);
642 -- Actions inserted before:
643 -- Temp : constant ptr_T := new T'(Expression);
644 -- <no CW> Temp._tag := T'tag;
645 -- <CTRL> Adjust (Finalizable (Temp.all));
646 -- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
648 -- We analyze by hand the new internal allocator to avoid
649 -- any recursion and inappropriate call to Initialize
651 -- We don't want to remove side effects when the expression must be
652 -- built in place. In the case of a build-in-place function call,
653 -- that could lead to a duplication of the call, which was already
654 -- substituted for the allocator.
656 if not Aggr_In_Place then
657 Remove_Side_Effects (Exp);
661 Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
663 -- For a class wide allocation generate the following code:
665 -- type Equiv_Record is record ... end record;
666 -- implicit subtype CW is <Class_Wide_Subytpe>;
667 -- temp : PtrT := new CW'(CW!(expr));
669 if Is_Class_Wide_Type (T) then
670 Expand_Subtype_From_Expr (Empty, T, Indic, Exp);
672 -- Ada 2005 (AI-251): If the expression is a class-wide interface
673 -- object we generate code to move up "this" to reference the
674 -- base of the object before allocating the new object.
676 -- Note that Exp'Address is recursively expanded into a call
677 -- to Base_Address (Exp.Tag)
679 if Is_Class_Wide_Type (Etype (Exp))
680 and then Is_Interface (Etype (Exp))
681 and then Tagged_Type_Expansion
685 Unchecked_Convert_To (Entity (Indic),
686 Make_Explicit_Dereference (Loc,
687 Unchecked_Convert_To (RTE (RE_Tag_Ptr),
688 Make_Attribute_Reference (Loc,
690 Attribute_Name => Name_Address)))));
695 Unchecked_Convert_To (Entity (Indic), Exp));
698 Analyze_And_Resolve (Expression (N), Entity (Indic));
701 -- Keep separate the management of allocators returning interfaces
703 if not Is_Interface (Directly_Designated_Type (PtrT)) then
704 if Aggr_In_Place then
706 Make_Object_Declaration (Loc,
707 Defining_Identifier => Temp,
708 Object_Definition => New_Reference_To (PtrT, Loc),
711 New_Reference_To (Etype (Exp), Loc)));
713 -- Copy the Comes_From_Source flag for the allocator we just
714 -- built, since logically this allocator is a replacement of
715 -- the original allocator node. This is for proper handling of
716 -- restriction No_Implicit_Heap_Allocations.
718 Set_Comes_From_Source
719 (Expression (Tmp_Node), Comes_From_Source (N));
721 Set_No_Initialization (Expression (Tmp_Node));
722 Insert_Action (N, Tmp_Node);
724 if Needs_Finalization (T)
725 and then Ekind (PtrT) = E_Anonymous_Access_Type
727 -- Create local finalization list for access parameter
729 Flist := Get_Allocator_Final_List (N, Base_Type (T), PtrT);
732 Convert_Aggr_In_Allocator (N, Tmp_Node, Exp);
735 Node := Relocate_Node (N);
738 Make_Object_Declaration (Loc,
739 Defining_Identifier => Temp,
740 Constant_Present => True,
741 Object_Definition => New_Reference_To (PtrT, Loc),
742 Expression => Node));
745 -- Ada 2005 (AI-251): Handle allocators whose designated type is an
746 -- interface type. In this case we use the type of the qualified
747 -- expression to allocate the object.
751 Def_Id : constant Entity_Id :=
752 Make_Defining_Identifier (Loc,
753 New_Internal_Name ('T'));
758 Make_Full_Type_Declaration (Loc,
759 Defining_Identifier => Def_Id,
761 Make_Access_To_Object_Definition (Loc,
763 Null_Exclusion_Present => False,
764 Constant_Present => False,
765 Subtype_Indication =>
766 New_Reference_To (Etype (Exp), Loc)));
768 Insert_Action (N, New_Decl);
770 -- Inherit the final chain to ensure that the expansion of the
771 -- aggregate is correct in case of controlled types
773 if Needs_Finalization (Directly_Designated_Type (PtrT)) then
774 Set_Associated_Final_Chain (Def_Id,
775 Associated_Final_Chain (PtrT));
778 -- Declare the object using the previous type declaration
780 if Aggr_In_Place then
782 Make_Object_Declaration (Loc,
783 Defining_Identifier => Temp,
784 Object_Definition => New_Reference_To (Def_Id, Loc),
787 New_Reference_To (Etype (Exp), Loc)));
789 -- Copy the Comes_From_Source flag for the allocator we just
790 -- built, since logically this allocator is a replacement of
791 -- the original allocator node. This is for proper handling
792 -- of restriction No_Implicit_Heap_Allocations.
794 Set_Comes_From_Source
795 (Expression (Tmp_Node), Comes_From_Source (N));
797 Set_No_Initialization (Expression (Tmp_Node));
798 Insert_Action (N, Tmp_Node);
800 if Needs_Finalization (T)
801 and then Ekind (PtrT) = E_Anonymous_Access_Type
803 -- Create local finalization list for access parameter
806 Get_Allocator_Final_List (N, Base_Type (T), PtrT);
809 Convert_Aggr_In_Allocator (N, Tmp_Node, Exp);
811 Node := Relocate_Node (N);
814 Make_Object_Declaration (Loc,
815 Defining_Identifier => Temp,
816 Constant_Present => True,
817 Object_Definition => New_Reference_To (Def_Id, Loc),
818 Expression => Node));
821 -- Generate an additional object containing the address of the
822 -- returned object. The type of this second object declaration
823 -- is the correct type required for the common processing that
824 -- is still performed by this subprogram. The displacement of
825 -- this pointer to reference the component associated with the
826 -- interface type will be done at the end of common processing.
829 Make_Object_Declaration (Loc,
830 Defining_Identifier => Make_Defining_Identifier (Loc,
831 New_Internal_Name ('P')),
832 Object_Definition => New_Reference_To (PtrT, Loc),
833 Expression => Unchecked_Convert_To (PtrT,
834 New_Reference_To (Temp, Loc)));
836 Insert_Action (N, New_Decl);
838 Tmp_Node := New_Decl;
839 Temp := Defining_Identifier (New_Decl);
843 Apply_Accessibility_Check (Temp);
845 -- Generate the tag assignment
847 -- Suppress the tag assignment when VM_Target because VM tags are
848 -- represented implicitly in objects.
850 if not Tagged_Type_Expansion then
853 -- Ada 2005 (AI-251): Suppress the tag assignment with class-wide
854 -- interface objects because in this case the tag does not change.
856 elsif Is_Interface (Directly_Designated_Type (Etype (N))) then
857 pragma Assert (Is_Class_Wide_Type
858 (Directly_Designated_Type (Etype (N))));
861 elsif Is_Tagged_Type (T) and then not Is_Class_Wide_Type (T) then
863 TagR := New_Reference_To (Temp, Loc);
865 elsif Is_Private_Type (T)
866 and then Is_Tagged_Type (Underlying_Type (T))
868 TagT := Underlying_Type (T);
870 Unchecked_Convert_To (Underlying_Type (T),
871 Make_Explicit_Dereference (Loc,
872 Prefix => New_Reference_To (Temp, Loc)));
875 if Present (TagT) then
877 Make_Assignment_Statement (Loc,
879 Make_Selected_Component (Loc,
882 New_Reference_To (First_Tag_Component (TagT), Loc)),
885 Unchecked_Convert_To (RTE (RE_Tag),
887 (Elists.Node (First_Elmt (Access_Disp_Table (TagT))),
890 -- The previous assignment has to be done in any case
892 Set_Assignment_OK (Name (Tag_Assign));
893 Insert_Action (N, Tag_Assign);
896 if Needs_Finalization (DesigT)
897 and then Needs_Finalization (T)
901 Apool : constant Entity_Id :=
902 Associated_Storage_Pool (PtrT);
905 -- If it is an allocation on the secondary stack (i.e. a value
906 -- returned from a function), the object is attached on the
907 -- caller side as soon as the call is completed (see
908 -- Expand_Ctrl_Function_Call)
910 if Is_RTE (Apool, RE_SS_Pool) then
912 F : constant Entity_Id :=
913 Make_Defining_Identifier (Loc,
914 New_Internal_Name ('F'));
917 Make_Object_Declaration (Loc,
918 Defining_Identifier => F,
919 Object_Definition => New_Reference_To (RTE
920 (RE_Finalizable_Ptr), Loc)));
922 Flist := New_Reference_To (F, Loc);
923 Attach := Make_Integer_Literal (Loc, 1);
926 -- Normal case, not a secondary stack allocation
929 if Needs_Finalization (T)
930 and then Ekind (PtrT) = E_Anonymous_Access_Type
932 -- Create local finalization list for access parameter
935 Get_Allocator_Final_List (N, Base_Type (T), PtrT);
937 Flist := Find_Final_List (PtrT);
940 Attach := Make_Integer_Literal (Loc, 2);
943 -- Generate an Adjust call if the object will be moved. In Ada
944 -- 2005, the object may be inherently limited, in which case
945 -- there is no Adjust procedure, and the object is built in
946 -- place. In Ada 95, the object can be limited but not
947 -- inherently limited if this allocator came from a return
948 -- statement (we're allocating the result on the secondary
949 -- stack). In that case, the object will be moved, so we _do_
953 and then not Is_Inherently_Limited_Type (T)
959 -- An unchecked conversion is needed in the classwide
960 -- case because the designated type can be an ancestor of
961 -- the subtype mark of the allocator.
963 Unchecked_Convert_To (T,
964 Make_Explicit_Dereference (Loc,
965 Prefix => New_Reference_To (Temp, Loc))),
969 With_Attach => Attach,
975 Rewrite (N, New_Reference_To (Temp, Loc));
976 Analyze_And_Resolve (N, PtrT);
978 -- Ada 2005 (AI-251): Displace the pointer to reference the record
979 -- component containing the secondary dispatch table of the interface
982 if Is_Interface (Directly_Designated_Type (PtrT)) then
983 Displace_Allocator_Pointer (N);
986 elsif Aggr_In_Place then
988 Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
990 Make_Object_Declaration (Loc,
991 Defining_Identifier => Temp,
992 Object_Definition => New_Reference_To (PtrT, Loc),
993 Expression => Make_Allocator (Loc,
994 New_Reference_To (Etype (Exp), Loc)));
996 -- Copy the Comes_From_Source flag for the allocator we just built,
997 -- since logically this allocator is a replacement of the original
998 -- allocator node. This is for proper handling of restriction
999 -- No_Implicit_Heap_Allocations.
1001 Set_Comes_From_Source
1002 (Expression (Tmp_Node), Comes_From_Source (N));
1004 Set_No_Initialization (Expression (Tmp_Node));
1005 Insert_Action (N, Tmp_Node);
1006 Convert_Aggr_In_Allocator (N, Tmp_Node, Exp);
1007 Rewrite (N, New_Reference_To (Temp, Loc));
1008 Analyze_And_Resolve (N, PtrT);
1010 elsif Is_Access_Type (T)
1011 and then Can_Never_Be_Null (T)
1013 Install_Null_Excluding_Check (Exp);
1015 elsif Is_Access_Type (DesigT)
1016 and then Nkind (Exp) = N_Allocator
1017 and then Nkind (Expression (Exp)) /= N_Qualified_Expression
1019 -- Apply constraint to designated subtype indication
1021 Apply_Constraint_Check (Expression (Exp),
1022 Designated_Type (DesigT),
1023 No_Sliding => True);
1025 if Nkind (Expression (Exp)) = N_Raise_Constraint_Error then
1027 -- Propagate constraint_error to enclosing allocator
1029 Rewrite (Exp, New_Copy (Expression (Exp)));
1033 -- type A is access T1;
1034 -- X : A := new T2'(...);
1035 -- T1 and T2 can be different subtypes, and we might need to check
1036 -- both constraints. First check against the type of the qualified
1039 Apply_Constraint_Check (Exp, T, No_Sliding => True);
1041 if Do_Range_Check (Exp) then
1042 Set_Do_Range_Check (Exp, False);
1043 Generate_Range_Check (Exp, DesigT, CE_Range_Check_Failed);
1046 -- A check is also needed in cases where the designated subtype is
1047 -- constrained and differs from the subtype given in the qualified
1048 -- expression. Note that the check on the qualified expression does
1049 -- not allow sliding, but this check does (a relaxation from Ada 83).
1051 if Is_Constrained (DesigT)
1052 and then not Subtypes_Statically_Match (T, DesigT)
1054 Apply_Constraint_Check
1055 (Exp, DesigT, No_Sliding => False);
1057 if Do_Range_Check (Exp) then
1058 Set_Do_Range_Check (Exp, False);
1059 Generate_Range_Check (Exp, DesigT, CE_Range_Check_Failed);
1063 -- For an access to unconstrained packed array, GIGI needs to see an
1064 -- expression with a constrained subtype in order to compute the
1065 -- proper size for the allocator.
1067 if Is_Array_Type (T)
1068 and then not Is_Constrained (T)
1069 and then Is_Packed (T)
1072 ConstrT : constant Entity_Id :=
1073 Make_Defining_Identifier (Loc,
1074 Chars => New_Internal_Name ('A'));
1075 Internal_Exp : constant Node_Id := Relocate_Node (Exp);
1078 Make_Subtype_Declaration (Loc,
1079 Defining_Identifier => ConstrT,
1080 Subtype_Indication =>
1081 Make_Subtype_From_Expr (Exp, T)));
1082 Freeze_Itype (ConstrT, Exp);
1083 Rewrite (Exp, OK_Convert_To (ConstrT, Internal_Exp));
1087 -- Ada 2005 (AI-318-02): If the initialization expression is a call
1088 -- to a build-in-place function, then access to the allocated object
1089 -- must be passed to the function. Currently we limit such functions
1090 -- to those with constrained limited result subtypes, but eventually
1091 -- we plan to expand the allowed forms of functions that are treated
1092 -- as build-in-place.
1094 if Ada_Version >= Ada_05
1095 and then Is_Build_In_Place_Function_Call (Exp)
1097 Make_Build_In_Place_Call_In_Allocator (N, Exp);
1102 when RE_Not_Available =>
1104 end Expand_Allocator_Expression;
1106 -----------------------------
1107 -- Expand_Array_Comparison --
1108 -----------------------------
1110 -- Expansion is only required in the case of array types. For the unpacked
1111 -- case, an appropriate runtime routine is called. For packed cases, and
1112 -- also in some other cases where a runtime routine cannot be called, the
1113 -- form of the expansion is:
1115 -- [body for greater_nn; boolean_expression]
1117 -- The body is built by Make_Array_Comparison_Op, and the form of the
1118 -- Boolean expression depends on the operator involved.
1120 procedure Expand_Array_Comparison (N : Node_Id) is
1121 Loc : constant Source_Ptr := Sloc (N);
1122 Op1 : Node_Id := Left_Opnd (N);
1123 Op2 : Node_Id := Right_Opnd (N);
1124 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
1125 Ctyp : constant Entity_Id := Component_Type (Typ1);
1128 Func_Body : Node_Id;
1129 Func_Name : Entity_Id;
1133 Byte_Addressable : constant Boolean := System_Storage_Unit = Byte'Size;
1134 -- True for byte addressable target
1136 function Length_Less_Than_4 (Opnd : Node_Id) return Boolean;
1137 -- Returns True if the length of the given operand is known to be less
1138 -- than 4. Returns False if this length is known to be four or greater
1139 -- or is not known at compile time.
1141 ------------------------
1142 -- Length_Less_Than_4 --
1143 ------------------------
1145 function Length_Less_Than_4 (Opnd : Node_Id) return Boolean is
1146 Otyp : constant Entity_Id := Etype (Opnd);
1149 if Ekind (Otyp) = E_String_Literal_Subtype then
1150 return String_Literal_Length (Otyp) < 4;
1154 Ityp : constant Entity_Id := Etype (First_Index (Otyp));
1155 Lo : constant Node_Id := Type_Low_Bound (Ityp);
1156 Hi : constant Node_Id := Type_High_Bound (Ityp);
1161 if Compile_Time_Known_Value (Lo) then
1162 Lov := Expr_Value (Lo);
1167 if Compile_Time_Known_Value (Hi) then
1168 Hiv := Expr_Value (Hi);
1173 return Hiv < Lov + 3;
1176 end Length_Less_Than_4;
1178 -- Start of processing for Expand_Array_Comparison
1181 -- Deal first with unpacked case, where we can call a runtime routine
1182 -- except that we avoid this for targets for which are not addressable
1183 -- by bytes, and for the JVM/CIL, since they do not support direct
1184 -- addressing of array components.
1186 if not Is_Bit_Packed_Array (Typ1)
1187 and then Byte_Addressable
1188 and then VM_Target = No_VM
1190 -- The call we generate is:
1192 -- Compare_Array_xn[_Unaligned]
1193 -- (left'address, right'address, left'length, right'length) <op> 0
1195 -- x = U for unsigned, S for signed
1196 -- n = 8,16,32,64 for component size
1197 -- Add _Unaligned if length < 4 and component size is 8.
1198 -- <op> is the standard comparison operator
1200 if Component_Size (Typ1) = 8 then
1201 if Length_Less_Than_4 (Op1)
1203 Length_Less_Than_4 (Op2)
1205 if Is_Unsigned_Type (Ctyp) then
1206 Comp := RE_Compare_Array_U8_Unaligned;
1208 Comp := RE_Compare_Array_S8_Unaligned;
1212 if Is_Unsigned_Type (Ctyp) then
1213 Comp := RE_Compare_Array_U8;
1215 Comp := RE_Compare_Array_S8;
1219 elsif Component_Size (Typ1) = 16 then
1220 if Is_Unsigned_Type (Ctyp) then
1221 Comp := RE_Compare_Array_U16;
1223 Comp := RE_Compare_Array_S16;
1226 elsif Component_Size (Typ1) = 32 then
1227 if Is_Unsigned_Type (Ctyp) then
1228 Comp := RE_Compare_Array_U32;
1230 Comp := RE_Compare_Array_S32;
1233 else pragma Assert (Component_Size (Typ1) = 64);
1234 if Is_Unsigned_Type (Ctyp) then
1235 Comp := RE_Compare_Array_U64;
1237 Comp := RE_Compare_Array_S64;
1241 Remove_Side_Effects (Op1, Name_Req => True);
1242 Remove_Side_Effects (Op2, Name_Req => True);
1245 Make_Function_Call (Sloc (Op1),
1246 Name => New_Occurrence_Of (RTE (Comp), Loc),
1248 Parameter_Associations => New_List (
1249 Make_Attribute_Reference (Loc,
1250 Prefix => Relocate_Node (Op1),
1251 Attribute_Name => Name_Address),
1253 Make_Attribute_Reference (Loc,
1254 Prefix => Relocate_Node (Op2),
1255 Attribute_Name => Name_Address),
1257 Make_Attribute_Reference (Loc,
1258 Prefix => Relocate_Node (Op1),
1259 Attribute_Name => Name_Length),
1261 Make_Attribute_Reference (Loc,
1262 Prefix => Relocate_Node (Op2),
1263 Attribute_Name => Name_Length))));
1266 Make_Integer_Literal (Sloc (Op2),
1269 Analyze_And_Resolve (Op1, Standard_Integer);
1270 Analyze_And_Resolve (Op2, Standard_Integer);
1274 -- Cases where we cannot make runtime call
1276 -- For (a <= b) we convert to not (a > b)
1278 if Chars (N) = Name_Op_Le then
1284 Right_Opnd => Op2)));
1285 Analyze_And_Resolve (N, Standard_Boolean);
1288 -- For < the Boolean expression is
1289 -- greater__nn (op2, op1)
1291 elsif Chars (N) = Name_Op_Lt then
1292 Func_Body := Make_Array_Comparison_Op (Typ1, N);
1296 Op1 := Right_Opnd (N);
1297 Op2 := Left_Opnd (N);
1299 -- For (a >= b) we convert to not (a < b)
1301 elsif Chars (N) = Name_Op_Ge then
1307 Right_Opnd => Op2)));
1308 Analyze_And_Resolve (N, Standard_Boolean);
1311 -- For > the Boolean expression is
1312 -- greater__nn (op1, op2)
1315 pragma Assert (Chars (N) = Name_Op_Gt);
1316 Func_Body := Make_Array_Comparison_Op (Typ1, N);
1319 Func_Name := Defining_Unit_Name (Specification (Func_Body));
1321 Make_Function_Call (Loc,
1322 Name => New_Reference_To (Func_Name, Loc),
1323 Parameter_Associations => New_List (Op1, Op2));
1325 Insert_Action (N, Func_Body);
1327 Analyze_And_Resolve (N, Standard_Boolean);
1330 when RE_Not_Available =>
1332 end Expand_Array_Comparison;
1334 ---------------------------
1335 -- Expand_Array_Equality --
1336 ---------------------------
1338 -- Expand an equality function for multi-dimensional arrays. Here is an
1339 -- example of such a function for Nb_Dimension = 2
1341 -- function Enn (A : atyp; B : btyp) return boolean is
1343 -- if (A'length (1) = 0 or else A'length (2) = 0)
1345 -- (B'length (1) = 0 or else B'length (2) = 0)
1347 -- return True; -- RM 4.5.2(22)
1350 -- if A'length (1) /= B'length (1)
1352 -- A'length (2) /= B'length (2)
1354 -- return False; -- RM 4.5.2(23)
1358 -- A1 : Index_T1 := A'first (1);
1359 -- B1 : Index_T1 := B'first (1);
1363 -- A2 : Index_T2 := A'first (2);
1364 -- B2 : Index_T2 := B'first (2);
1367 -- if A (A1, A2) /= B (B1, B2) then
1371 -- exit when A2 = A'last (2);
1372 -- A2 := Index_T2'succ (A2);
1373 -- B2 := Index_T2'succ (B2);
1377 -- exit when A1 = A'last (1);
1378 -- A1 := Index_T1'succ (A1);
1379 -- B1 := Index_T1'succ (B1);
1386 -- Note on the formal types used (atyp and btyp). If either of the arrays
1387 -- is of a private type, we use the underlying type, and do an unchecked
1388 -- conversion of the actual. If either of the arrays has a bound depending
1389 -- on a discriminant, then we use the base type since otherwise we have an
1390 -- escaped discriminant in the function.
1392 -- If both arrays are constrained and have the same bounds, we can generate
1393 -- a loop with an explicit iteration scheme using a 'Range attribute over
1396 function Expand_Array_Equality
1401 Typ : Entity_Id) return Node_Id
1403 Loc : constant Source_Ptr := Sloc (Nod);
1404 Decls : constant List_Id := New_List;
1405 Index_List1 : constant List_Id := New_List;
1406 Index_List2 : constant List_Id := New_List;
1410 Func_Name : Entity_Id;
1411 Func_Body : Node_Id;
1413 A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA);
1414 B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB);
1418 -- The parameter types to be used for the formals
1423 Num : Int) return Node_Id;
1424 -- This builds the attribute reference Arr'Nam (Expr)
1426 function Component_Equality (Typ : Entity_Id) return Node_Id;
1427 -- Create one statement to compare corresponding components, designated
1428 -- by a full set of indices.
1430 function Get_Arg_Type (N : Node_Id) return Entity_Id;
1431 -- Given one of the arguments, computes the appropriate type to be used
1432 -- for that argument in the corresponding function formal
1434 function Handle_One_Dimension
1436 Index : Node_Id) return Node_Id;
1437 -- This procedure returns the following code
1440 -- Bn : Index_T := B'First (N);
1444 -- exit when An = A'Last (N);
1445 -- An := Index_T'Succ (An)
1446 -- Bn := Index_T'Succ (Bn)
1450 -- If both indices are constrained and identical, the procedure
1451 -- returns a simpler loop:
1453 -- for An in A'Range (N) loop
1457 -- N is the dimension for which we are generating a loop. Index is the
1458 -- N'th index node, whose Etype is Index_Type_n in the above code. The
1459 -- xxx statement is either the loop or declare for the next dimension
1460 -- or if this is the last dimension the comparison of corresponding
1461 -- components of the arrays.
1463 -- The actual way the code works is to return the comparison of
1464 -- corresponding components for the N+1 call. That's neater!
1466 function Test_Empty_Arrays return Node_Id;
1467 -- This function constructs the test for both arrays being empty
1468 -- (A'length (1) = 0 or else A'length (2) = 0 or else ...)
1470 -- (B'length (1) = 0 or else B'length (2) = 0 or else ...)
1472 function Test_Lengths_Correspond return Node_Id;
1473 -- This function constructs the test for arrays having different lengths
1474 -- in at least one index position, in which case the resulting code is:
1476 -- A'length (1) /= B'length (1)
1478 -- A'length (2) /= B'length (2)
1489 Num : Int) return Node_Id
1493 Make_Attribute_Reference (Loc,
1494 Attribute_Name => Nam,
1495 Prefix => New_Reference_To (Arr, Loc),
1496 Expressions => New_List (Make_Integer_Literal (Loc, Num)));
1499 ------------------------
1500 -- Component_Equality --
1501 ------------------------
1503 function Component_Equality (Typ : Entity_Id) return Node_Id is
1508 -- if a(i1...) /= b(j1...) then return false; end if;
1511 Make_Indexed_Component (Loc,
1512 Prefix => Make_Identifier (Loc, Chars (A)),
1513 Expressions => Index_List1);
1516 Make_Indexed_Component (Loc,
1517 Prefix => Make_Identifier (Loc, Chars (B)),
1518 Expressions => Index_List2);
1520 Test := Expand_Composite_Equality
1521 (Nod, Component_Type (Typ), L, R, Decls);
1523 -- If some (sub)component is an unchecked_union, the whole operation
1524 -- will raise program error.
1526 if Nkind (Test) = N_Raise_Program_Error then
1528 -- This node is going to be inserted at a location where a
1529 -- statement is expected: clear its Etype so analysis will set
1530 -- it to the expected Standard_Void_Type.
1532 Set_Etype (Test, Empty);
1537 Make_Implicit_If_Statement (Nod,
1538 Condition => Make_Op_Not (Loc, Right_Opnd => Test),
1539 Then_Statements => New_List (
1540 Make_Simple_Return_Statement (Loc,
1541 Expression => New_Occurrence_Of (Standard_False, Loc))));
1543 end Component_Equality;
1549 function Get_Arg_Type (N : Node_Id) return Entity_Id is
1560 T := Underlying_Type (T);
1562 X := First_Index (T);
1563 while Present (X) loop
1564 if Denotes_Discriminant (Type_Low_Bound (Etype (X)))
1566 Denotes_Discriminant (Type_High_Bound (Etype (X)))
1579 --------------------------
1580 -- Handle_One_Dimension --
1581 ---------------------------
1583 function Handle_One_Dimension
1585 Index : Node_Id) return Node_Id
1587 Need_Separate_Indexes : constant Boolean :=
1589 or else not Is_Constrained (Ltyp);
1590 -- If the index types are identical, and we are working with
1591 -- constrained types, then we can use the same index for both
1594 An : constant Entity_Id := Make_Defining_Identifier (Loc,
1595 Chars => New_Internal_Name ('A'));
1598 Index_T : Entity_Id;
1603 if N > Number_Dimensions (Ltyp) then
1604 return Component_Equality (Ltyp);
1607 -- Case where we generate a loop
1609 Index_T := Base_Type (Etype (Index));
1611 if Need_Separate_Indexes then
1613 Make_Defining_Identifier (Loc,
1614 Chars => New_Internal_Name ('B'));
1619 Append (New_Reference_To (An, Loc), Index_List1);
1620 Append (New_Reference_To (Bn, Loc), Index_List2);
1622 Stm_List := New_List (
1623 Handle_One_Dimension (N + 1, Next_Index (Index)));
1625 if Need_Separate_Indexes then
1627 -- Generate guard for loop, followed by increments of indices
1629 Append_To (Stm_List,
1630 Make_Exit_Statement (Loc,
1633 Left_Opnd => New_Reference_To (An, Loc),
1634 Right_Opnd => Arr_Attr (A, Name_Last, N))));
1636 Append_To (Stm_List,
1637 Make_Assignment_Statement (Loc,
1638 Name => New_Reference_To (An, Loc),
1640 Make_Attribute_Reference (Loc,
1641 Prefix => New_Reference_To (Index_T, Loc),
1642 Attribute_Name => Name_Succ,
1643 Expressions => New_List (New_Reference_To (An, Loc)))));
1645 Append_To (Stm_List,
1646 Make_Assignment_Statement (Loc,
1647 Name => New_Reference_To (Bn, Loc),
1649 Make_Attribute_Reference (Loc,
1650 Prefix => New_Reference_To (Index_T, Loc),
1651 Attribute_Name => Name_Succ,
1652 Expressions => New_List (New_Reference_To (Bn, Loc)))));
1655 -- If separate indexes, we need a declare block for An and Bn, and a
1656 -- loop without an iteration scheme.
1658 if Need_Separate_Indexes then
1660 Make_Implicit_Loop_Statement (Nod, Statements => Stm_List);
1663 Make_Block_Statement (Loc,
1664 Declarations => New_List (
1665 Make_Object_Declaration (Loc,
1666 Defining_Identifier => An,
1667 Object_Definition => New_Reference_To (Index_T, Loc),
1668 Expression => Arr_Attr (A, Name_First, N)),
1670 Make_Object_Declaration (Loc,
1671 Defining_Identifier => Bn,
1672 Object_Definition => New_Reference_To (Index_T, Loc),
1673 Expression => Arr_Attr (B, Name_First, N))),
1675 Handled_Statement_Sequence =>
1676 Make_Handled_Sequence_Of_Statements (Loc,
1677 Statements => New_List (Loop_Stm)));
1679 -- If no separate indexes, return loop statement with explicit
1680 -- iteration scheme on its own
1684 Make_Implicit_Loop_Statement (Nod,
1685 Statements => Stm_List,
1687 Make_Iteration_Scheme (Loc,
1688 Loop_Parameter_Specification =>
1689 Make_Loop_Parameter_Specification (Loc,
1690 Defining_Identifier => An,
1691 Discrete_Subtype_Definition =>
1692 Arr_Attr (A, Name_Range, N))));
1695 end Handle_One_Dimension;
1697 -----------------------
1698 -- Test_Empty_Arrays --
1699 -----------------------
1701 function Test_Empty_Arrays return Node_Id is
1711 for J in 1 .. Number_Dimensions (Ltyp) loop
1714 Left_Opnd => Arr_Attr (A, Name_Length, J),
1715 Right_Opnd => Make_Integer_Literal (Loc, 0));
1719 Left_Opnd => Arr_Attr (B, Name_Length, J),
1720 Right_Opnd => Make_Integer_Literal (Loc, 0));
1729 Left_Opnd => Relocate_Node (Alist),
1730 Right_Opnd => Atest);
1734 Left_Opnd => Relocate_Node (Blist),
1735 Right_Opnd => Btest);
1742 Right_Opnd => Blist);
1743 end Test_Empty_Arrays;
1745 -----------------------------
1746 -- Test_Lengths_Correspond --
1747 -----------------------------
1749 function Test_Lengths_Correspond return Node_Id is
1755 for J in 1 .. Number_Dimensions (Ltyp) loop
1758 Left_Opnd => Arr_Attr (A, Name_Length, J),
1759 Right_Opnd => Arr_Attr (B, Name_Length, J));
1766 Left_Opnd => Relocate_Node (Result),
1767 Right_Opnd => Rtest);
1772 end Test_Lengths_Correspond;
1774 -- Start of processing for Expand_Array_Equality
1777 Ltyp := Get_Arg_Type (Lhs);
1778 Rtyp := Get_Arg_Type (Rhs);
1780 -- For now, if the argument types are not the same, go to the base type,
1781 -- since the code assumes that the formals have the same type. This is
1782 -- fixable in future ???
1784 if Ltyp /= Rtyp then
1785 Ltyp := Base_Type (Ltyp);
1786 Rtyp := Base_Type (Rtyp);
1787 pragma Assert (Ltyp = Rtyp);
1790 -- Build list of formals for function
1792 Formals := New_List (
1793 Make_Parameter_Specification (Loc,
1794 Defining_Identifier => A,
1795 Parameter_Type => New_Reference_To (Ltyp, Loc)),
1797 Make_Parameter_Specification (Loc,
1798 Defining_Identifier => B,
1799 Parameter_Type => New_Reference_To (Rtyp, Loc)));
1801 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('E'));
1803 -- Build statement sequence for function
1806 Make_Subprogram_Body (Loc,
1808 Make_Function_Specification (Loc,
1809 Defining_Unit_Name => Func_Name,
1810 Parameter_Specifications => Formals,
1811 Result_Definition => New_Reference_To (Standard_Boolean, Loc)),
1813 Declarations => Decls,
1815 Handled_Statement_Sequence =>
1816 Make_Handled_Sequence_Of_Statements (Loc,
1817 Statements => New_List (
1819 Make_Implicit_If_Statement (Nod,
1820 Condition => Test_Empty_Arrays,
1821 Then_Statements => New_List (
1822 Make_Simple_Return_Statement (Loc,
1824 New_Occurrence_Of (Standard_True, Loc)))),
1826 Make_Implicit_If_Statement (Nod,
1827 Condition => Test_Lengths_Correspond,
1828 Then_Statements => New_List (
1829 Make_Simple_Return_Statement (Loc,
1831 New_Occurrence_Of (Standard_False, Loc)))),
1833 Handle_One_Dimension (1, First_Index (Ltyp)),
1835 Make_Simple_Return_Statement (Loc,
1836 Expression => New_Occurrence_Of (Standard_True, Loc)))));
1838 Set_Has_Completion (Func_Name, True);
1839 Set_Is_Inlined (Func_Name);
1841 -- If the array type is distinct from the type of the arguments, it
1842 -- is the full view of a private type. Apply an unchecked conversion
1843 -- to insure that analysis of the call succeeds.
1853 or else Base_Type (Etype (Lhs)) /= Base_Type (Ltyp)
1855 L := OK_Convert_To (Ltyp, Lhs);
1859 or else Base_Type (Etype (Rhs)) /= Base_Type (Rtyp)
1861 R := OK_Convert_To (Rtyp, Rhs);
1864 Actuals := New_List (L, R);
1867 Append_To (Bodies, Func_Body);
1870 Make_Function_Call (Loc,
1871 Name => New_Reference_To (Func_Name, Loc),
1872 Parameter_Associations => Actuals);
1873 end Expand_Array_Equality;
1875 -----------------------------
1876 -- Expand_Boolean_Operator --
1877 -----------------------------
1879 -- Note that we first get the actual subtypes of the operands, since we
1880 -- always want to deal with types that have bounds.
1882 procedure Expand_Boolean_Operator (N : Node_Id) is
1883 Typ : constant Entity_Id := Etype (N);
1886 -- Special case of bit packed array where both operands are known to be
1887 -- properly aligned. In this case we use an efficient run time routine
1888 -- to carry out the operation (see System.Bit_Ops).
1890 if Is_Bit_Packed_Array (Typ)
1891 and then not Is_Possibly_Unaligned_Object (Left_Opnd (N))
1892 and then not Is_Possibly_Unaligned_Object (Right_Opnd (N))
1894 Expand_Packed_Boolean_Operator (N);
1898 -- For the normal non-packed case, the general expansion is to build
1899 -- function for carrying out the comparison (use Make_Boolean_Array_Op)
1900 -- and then inserting it into the tree. The original operator node is
1901 -- then rewritten as a call to this function. We also use this in the
1902 -- packed case if either operand is a possibly unaligned object.
1905 Loc : constant Source_Ptr := Sloc (N);
1906 L : constant Node_Id := Relocate_Node (Left_Opnd (N));
1907 R : constant Node_Id := Relocate_Node (Right_Opnd (N));
1908 Func_Body : Node_Id;
1909 Func_Name : Entity_Id;
1912 Convert_To_Actual_Subtype (L);
1913 Convert_To_Actual_Subtype (R);
1914 Ensure_Defined (Etype (L), N);
1915 Ensure_Defined (Etype (R), N);
1916 Apply_Length_Check (R, Etype (L));
1918 if Nkind (N) = N_Op_Xor then
1919 Silly_Boolean_Array_Xor_Test (N, Etype (L));
1922 if Nkind (Parent (N)) = N_Assignment_Statement
1923 and then Safe_In_Place_Array_Op (Name (Parent (N)), L, R)
1925 Build_Boolean_Array_Proc_Call (Parent (N), L, R);
1927 elsif Nkind (Parent (N)) = N_Op_Not
1928 and then Nkind (N) = N_Op_And
1930 Safe_In_Place_Array_Op (Name (Parent (Parent (N))), L, R)
1935 Func_Body := Make_Boolean_Array_Op (Etype (L), N);
1936 Func_Name := Defining_Unit_Name (Specification (Func_Body));
1937 Insert_Action (N, Func_Body);
1939 -- Now rewrite the expression with a call
1942 Make_Function_Call (Loc,
1943 Name => New_Reference_To (Func_Name, Loc),
1944 Parameter_Associations =>
1947 Make_Type_Conversion
1948 (Loc, New_Reference_To (Etype (L), Loc), R))));
1950 Analyze_And_Resolve (N, Typ);
1953 end Expand_Boolean_Operator;
1955 -------------------------------
1956 -- Expand_Composite_Equality --
1957 -------------------------------
1959 -- This function is only called for comparing internal fields of composite
1960 -- types when these fields are themselves composites. This is a special
1961 -- case because it is not possible to respect normal Ada visibility rules.
1963 function Expand_Composite_Equality
1968 Bodies : List_Id) return Node_Id
1970 Loc : constant Source_Ptr := Sloc (Nod);
1971 Full_Type : Entity_Id;
1976 if Is_Private_Type (Typ) then
1977 Full_Type := Underlying_Type (Typ);
1982 -- Defense against malformed private types with no completion the error
1983 -- will be diagnosed later by check_completion
1985 if No (Full_Type) then
1986 return New_Reference_To (Standard_False, Loc);
1989 Full_Type := Base_Type (Full_Type);
1991 if Is_Array_Type (Full_Type) then
1993 -- If the operand is an elementary type other than a floating-point
1994 -- type, then we can simply use the built-in block bitwise equality,
1995 -- since the predefined equality operators always apply and bitwise
1996 -- equality is fine for all these cases.
1998 if Is_Elementary_Type (Component_Type (Full_Type))
1999 and then not Is_Floating_Point_Type (Component_Type (Full_Type))
2001 return Make_Op_Eq (Loc, Left_Opnd => Lhs, Right_Opnd => Rhs);
2003 -- For composite component types, and floating-point types, use the
2004 -- expansion. This deals with tagged component types (where we use
2005 -- the applicable equality routine) and floating-point, (where we
2006 -- need to worry about negative zeroes), and also the case of any
2007 -- composite type recursively containing such fields.
2010 return Expand_Array_Equality (Nod, Lhs, Rhs, Bodies, Full_Type);
2013 elsif Is_Tagged_Type (Full_Type) then
2015 -- Call the primitive operation "=" of this type
2017 if Is_Class_Wide_Type (Full_Type) then
2018 Full_Type := Root_Type (Full_Type);
2021 -- If this is derived from an untagged private type completed with a
2022 -- tagged type, it does not have a full view, so we use the primitive
2023 -- operations of the private type. This check should no longer be
2024 -- necessary when these types receive their full views ???
2026 if Is_Private_Type (Typ)
2027 and then not Is_Tagged_Type (Typ)
2028 and then not Is_Controlled (Typ)
2029 and then Is_Derived_Type (Typ)
2030 and then No (Full_View (Typ))
2032 Prim := First_Elmt (Collect_Primitive_Operations (Typ));
2034 Prim := First_Elmt (Primitive_Operations (Full_Type));
2038 Eq_Op := Node (Prim);
2039 exit when Chars (Eq_Op) = Name_Op_Eq
2040 and then Etype (First_Formal (Eq_Op)) =
2041 Etype (Next_Formal (First_Formal (Eq_Op)))
2042 and then Base_Type (Etype (Eq_Op)) = Standard_Boolean;
2044 pragma Assert (Present (Prim));
2047 Eq_Op := Node (Prim);
2050 Make_Function_Call (Loc,
2051 Name => New_Reference_To (Eq_Op, Loc),
2052 Parameter_Associations =>
2054 (Unchecked_Convert_To (Etype (First_Formal (Eq_Op)), Lhs),
2055 Unchecked_Convert_To (Etype (First_Formal (Eq_Op)), Rhs)));
2057 elsif Is_Record_Type (Full_Type) then
2058 Eq_Op := TSS (Full_Type, TSS_Composite_Equality);
2060 if Present (Eq_Op) then
2061 if Etype (First_Formal (Eq_Op)) /= Full_Type then
2063 -- Inherited equality from parent type. Convert the actuals to
2064 -- match signature of operation.
2067 T : constant Entity_Id := Etype (First_Formal (Eq_Op));
2071 Make_Function_Call (Loc,
2072 Name => New_Reference_To (Eq_Op, Loc),
2073 Parameter_Associations =>
2074 New_List (OK_Convert_To (T, Lhs),
2075 OK_Convert_To (T, Rhs)));
2079 -- Comparison between Unchecked_Union components
2081 if Is_Unchecked_Union (Full_Type) then
2083 Lhs_Type : Node_Id := Full_Type;
2084 Rhs_Type : Node_Id := Full_Type;
2085 Lhs_Discr_Val : Node_Id;
2086 Rhs_Discr_Val : Node_Id;
2091 if Nkind (Lhs) = N_Selected_Component then
2092 Lhs_Type := Etype (Entity (Selector_Name (Lhs)));
2097 if Nkind (Rhs) = N_Selected_Component then
2098 Rhs_Type := Etype (Entity (Selector_Name (Rhs)));
2101 -- Lhs of the composite equality
2103 if Is_Constrained (Lhs_Type) then
2105 -- Since the enclosing record type can never be an
2106 -- Unchecked_Union (this code is executed for records
2107 -- that do not have variants), we may reference its
2110 if Nkind (Lhs) = N_Selected_Component
2111 and then Has_Per_Object_Constraint (
2112 Entity (Selector_Name (Lhs)))
2115 Make_Selected_Component (Loc,
2116 Prefix => Prefix (Lhs),
2119 Get_Discriminant_Value (
2120 First_Discriminant (Lhs_Type),
2122 Stored_Constraint (Lhs_Type))));
2125 Lhs_Discr_Val := New_Copy (
2126 Get_Discriminant_Value (
2127 First_Discriminant (Lhs_Type),
2129 Stored_Constraint (Lhs_Type)));
2133 -- It is not possible to infer the discriminant since
2134 -- the subtype is not constrained.
2137 Make_Raise_Program_Error (Loc,
2138 Reason => PE_Unchecked_Union_Restriction);
2141 -- Rhs of the composite equality
2143 if Is_Constrained (Rhs_Type) then
2144 if Nkind (Rhs) = N_Selected_Component
2145 and then Has_Per_Object_Constraint (
2146 Entity (Selector_Name (Rhs)))
2149 Make_Selected_Component (Loc,
2150 Prefix => Prefix (Rhs),
2153 Get_Discriminant_Value (
2154 First_Discriminant (Rhs_Type),
2156 Stored_Constraint (Rhs_Type))));
2159 Rhs_Discr_Val := New_Copy (
2160 Get_Discriminant_Value (
2161 First_Discriminant (Rhs_Type),
2163 Stored_Constraint (Rhs_Type)));
2168 Make_Raise_Program_Error (Loc,
2169 Reason => PE_Unchecked_Union_Restriction);
2172 -- Call the TSS equality function with the inferred
2173 -- discriminant values.
2176 Make_Function_Call (Loc,
2177 Name => New_Reference_To (Eq_Op, Loc),
2178 Parameter_Associations => New_List (
2186 -- Shouldn't this be an else, we can't fall through the above
2190 Make_Function_Call (Loc,
2191 Name => New_Reference_To (Eq_Op, Loc),
2192 Parameter_Associations => New_List (Lhs, Rhs));
2196 return Expand_Record_Equality (Nod, Full_Type, Lhs, Rhs, Bodies);
2200 -- It can be a simple record or the full view of a scalar private
2202 return Make_Op_Eq (Loc, Left_Opnd => Lhs, Right_Opnd => Rhs);
2204 end Expand_Composite_Equality;
2206 ------------------------
2207 -- Expand_Concatenate --
2208 ------------------------
2210 procedure Expand_Concatenate (Cnode : Node_Id; Opnds : List_Id) is
2211 Loc : constant Source_Ptr := Sloc (Cnode);
2213 Atyp : constant Entity_Id := Base_Type (Etype (Cnode));
2214 -- Result type of concatenation
2216 Ctyp : constant Entity_Id := Base_Type (Component_Type (Etype (Cnode)));
2217 -- Component type. Elements of this component type can appear as one
2218 -- of the operands of concatenation as well as arrays.
2220 Istyp : constant Entity_Id := Etype (First_Index (Atyp));
2223 Ityp : constant Entity_Id := Base_Type (Istyp);
2224 -- Index type. This is the base type of the index subtype, and is used
2225 -- for all computed bounds (which may be out of range of Istyp in the
2226 -- case of null ranges).
2229 -- This is the type we use to do arithmetic to compute the bounds and
2230 -- lengths of operands. The choice of this type is a little subtle and
2231 -- is discussed in a separate section at the start of the body code.
2233 Concatenation_Error : exception;
2234 -- Raised if concatenation is sure to raise a CE
2236 Result_May_Be_Null : Boolean := True;
2237 -- Reset to False if at least one operand is encountered which is known
2238 -- at compile time to be non-null. Used for handling the special case
2239 -- of setting the high bound to the last operand high bound for a null
2240 -- result, thus ensuring a proper high bound in the super-flat case.
2242 N : constant Nat := List_Length (Opnds);
2243 -- Number of concatenation operands including possibly null operands
2246 -- Number of operands excluding any known to be null, except that the
2247 -- last operand is always retained, in case it provides the bounds for
2251 -- Current operand being processed in the loop through operands. After
2252 -- this loop is complete, always contains the last operand (which is not
2253 -- the same as Operands (NN), since null operands are skipped).
2255 -- Arrays describing the operands, only the first NN entries of each
2256 -- array are set (NN < N when we exclude known null operands).
2258 Is_Fixed_Length : array (1 .. N) of Boolean;
2259 -- True if length of corresponding operand known at compile time
2261 Operands : array (1 .. N) of Node_Id;
2262 -- Set to the corresponding entry in the Opnds list (but note that null
2263 -- operands are excluded, so not all entries in the list are stored).
2265 Fixed_Length : array (1 .. N) of Uint;
2266 -- Set to length of operand. Entries in this array are set only if the
2267 -- corresponding entry in Is_Fixed_Length is True.
2269 Opnd_Low_Bound : array (1 .. N) of Node_Id;
2270 -- Set to lower bound of operand. Either an integer literal in the case
2271 -- where the bound is known at compile time, else actual lower bound.
2272 -- The operand low bound is of type Ityp.
2274 Var_Length : array (1 .. N) of Entity_Id;
2275 -- Set to an entity of type Natural that contains the length of an
2276 -- operand whose length is not known at compile time. Entries in this
2277 -- array are set only if the corresponding entry in Is_Fixed_Length
2278 -- is False. The entity is of type Artyp.
2280 Aggr_Length : array (0 .. N) of Node_Id;
2281 -- The J'th entry in an expression node that represents the total length
2282 -- of operands 1 through J. It is either an integer literal node, or a
2283 -- reference to a constant entity with the right value, so it is fine
2284 -- to just do a Copy_Node to get an appropriate copy. The extra zero'th
2285 -- entry always is set to zero. The length is of type Artyp.
2287 Low_Bound : Node_Id;
2288 -- A tree node representing the low bound of the result (of type Ityp).
2289 -- This is either an integer literal node, or an identifier reference to
2290 -- a constant entity initialized to the appropriate value.
2292 Last_Opnd_High_Bound : Node_Id;
2293 -- A tree node representing the high bound of the last operand. This
2294 -- need only be set if the result could be null. It is used for the
2295 -- special case of setting the right high bound for a null result.
2296 -- This is of type Ityp.
2298 High_Bound : Node_Id;
2299 -- A tree node representing the high bound of the result (of type Ityp)
2302 -- Result of the concatenation (of type Ityp)
2304 Actions : constant List_Id := New_List;
2305 -- Collect actions to be inserted if Save_Space is False
2307 Save_Space : Boolean;
2308 pragma Warnings (Off, Save_Space);
2309 -- Set to True if we are saving generated code space by calling routines
2310 -- in packages System.Concat_n.
2312 Known_Non_Null_Operand_Seen : Boolean;
2313 -- Set True during generation of the assignements of operands into
2314 -- result once an operand known to be non-null has been seen.
2316 function Make_Artyp_Literal (Val : Nat) return Node_Id;
2317 -- This function makes an N_Integer_Literal node that is returned in
2318 -- analyzed form with the type set to Artyp. Importantly this literal
2319 -- is not flagged as static, so that if we do computations with it that
2320 -- result in statically detected out of range conditions, we will not
2321 -- generate error messages but instead warning messages.
2323 function To_Artyp (X : Node_Id) return Node_Id;
2324 -- Given a node of type Ityp, returns the corresponding value of type
2325 -- Artyp. For non-enumeration types, this is a plain integer conversion.
2326 -- For enum types, the Pos of the value is returned.
2328 function To_Ityp (X : Node_Id) return Node_Id;
2329 -- The inverse function (uses Val in the case of enumeration types)
2331 ------------------------
2332 -- Make_Artyp_Literal --
2333 ------------------------
2335 function Make_Artyp_Literal (Val : Nat) return Node_Id is
2336 Result : constant Node_Id := Make_Integer_Literal (Loc, Val);
2338 Set_Etype (Result, Artyp);
2339 Set_Analyzed (Result, True);
2340 Set_Is_Static_Expression (Result, False);
2342 end Make_Artyp_Literal;
2348 function To_Artyp (X : Node_Id) return Node_Id is
2350 if Ityp = Base_Type (Artyp) then
2353 elsif Is_Enumeration_Type (Ityp) then
2355 Make_Attribute_Reference (Loc,
2356 Prefix => New_Occurrence_Of (Ityp, Loc),
2357 Attribute_Name => Name_Pos,
2358 Expressions => New_List (X));
2361 return Convert_To (Artyp, X);
2369 function To_Ityp (X : Node_Id) return Node_Id is
2371 if Is_Enumeration_Type (Ityp) then
2373 Make_Attribute_Reference (Loc,
2374 Prefix => New_Occurrence_Of (Ityp, Loc),
2375 Attribute_Name => Name_Val,
2376 Expressions => New_List (X));
2378 -- Case where we will do a type conversion
2381 if Ityp = Base_Type (Artyp) then
2384 return Convert_To (Ityp, X);
2389 -- Local Declarations
2391 Opnd_Typ : Entity_Id;
2399 -- Choose an appropriate computational type
2401 -- We will be doing calculations of lengths and bounds in this routine
2402 -- and computing one from the other in some cases, e.g. getting the high
2403 -- bound by adding the length-1 to the low bound.
2405 -- We can't just use the index type, or even its base type for this
2406 -- purpose for two reasons. First it might be an enumeration type which
2407 -- is not suitable fo computations of any kind, and second it may simply
2408 -- not have enough range. For example if the index type is -128..+127
2409 -- then lengths can be up to 256, which is out of range of the type.
2411 -- For enumeration types, we can simply use Standard_Integer, this is
2412 -- sufficient since the actual number of enumeration literals cannot
2413 -- possibly exceed the range of integer (remember we will be doing the
2414 -- arithmetic with POS values, not representation values).
2416 if Is_Enumeration_Type (Ityp) then
2417 Artyp := Standard_Integer;
2419 -- If index type is Positive, we use the standard unsigned type, to give
2420 -- more room on the top of the range, obviating the need for an overflow
2421 -- check when creating the upper bound. This is needed to avoid junk
2422 -- overflow checks in the common case of String types.
2424 -- ??? Disabled for now
2426 -- elsif Istyp = Standard_Positive then
2427 -- Artyp := Standard_Unsigned;
2429 -- For modular types, we use a 32-bit modular type for types whose size
2430 -- is in the range 1-31 bits. For 32-bit unsigned types, we use the
2431 -- identity type, and for larger unsigned types we use 64-bits.
2433 elsif Is_Modular_Integer_Type (Ityp) then
2434 if RM_Size (Ityp) < RM_Size (Standard_Unsigned) then
2435 Artyp := Standard_Unsigned;
2436 elsif RM_Size (Ityp) = RM_Size (Standard_Unsigned) then
2439 Artyp := RTE (RE_Long_Long_Unsigned);
2442 -- Similar treatment for signed types
2445 if RM_Size (Ityp) < RM_Size (Standard_Integer) then
2446 Artyp := Standard_Integer;
2447 elsif RM_Size (Ityp) = RM_Size (Standard_Integer) then
2450 Artyp := Standard_Long_Long_Integer;
2454 -- Supply dummy entry at start of length array
2456 Aggr_Length (0) := Make_Artyp_Literal (0);
2458 -- Go through operands setting up the above arrays
2462 Opnd := Remove_Head (Opnds);
2463 Opnd_Typ := Etype (Opnd);
2465 -- The parent got messed up when we put the operands in a list,
2466 -- so now put back the proper parent for the saved operand.
2468 Set_Parent (Opnd, Parent (Cnode));
2470 -- Set will be True when we have setup one entry in the array
2474 -- Singleton element (or character literal) case
2476 if Base_Type (Opnd_Typ) = Ctyp then
2478 Operands (NN) := Opnd;
2479 Is_Fixed_Length (NN) := True;
2480 Fixed_Length (NN) := Uint_1;
2481 Result_May_Be_Null := False;
2483 -- Set low bound of operand (no need to set Last_Opnd_High_Bound
2484 -- since we know that the result cannot be null).
2486 Opnd_Low_Bound (NN) :=
2487 Make_Attribute_Reference (Loc,
2488 Prefix => New_Reference_To (Istyp, Loc),
2489 Attribute_Name => Name_First);
2493 -- String literal case (can only occur for strings of course)
2495 elsif Nkind (Opnd) = N_String_Literal then
2496 Len := String_Literal_Length (Opnd_Typ);
2499 Result_May_Be_Null := False;
2502 -- Capture last operand high bound if result could be null
2504 if J = N and then Result_May_Be_Null then
2505 Last_Opnd_High_Bound :=
2508 New_Copy_Tree (String_Literal_Low_Bound (Opnd_Typ)),
2509 Right_Opnd => Make_Integer_Literal (Loc, 1));
2512 -- Skip null string literal
2514 if J < N and then Len = 0 then
2519 Operands (NN) := Opnd;
2520 Is_Fixed_Length (NN) := True;
2522 -- Set length and bounds
2524 Fixed_Length (NN) := Len;
2526 Opnd_Low_Bound (NN) :=
2527 New_Copy_Tree (String_Literal_Low_Bound (Opnd_Typ));
2534 -- Check constrained case with known bounds
2536 if Is_Constrained (Opnd_Typ) then
2538 Index : constant Node_Id := First_Index (Opnd_Typ);
2539 Indx_Typ : constant Entity_Id := Etype (Index);
2540 Lo : constant Node_Id := Type_Low_Bound (Indx_Typ);
2541 Hi : constant Node_Id := Type_High_Bound (Indx_Typ);
2544 -- Fixed length constrained array type with known at compile
2545 -- time bounds is last case of fixed length operand.
2547 if Compile_Time_Known_Value (Lo)
2549 Compile_Time_Known_Value (Hi)
2552 Loval : constant Uint := Expr_Value (Lo);
2553 Hival : constant Uint := Expr_Value (Hi);
2554 Len : constant Uint :=
2555 UI_Max (Hival - Loval + 1, Uint_0);
2559 Result_May_Be_Null := False;
2562 -- Capture last operand bound if result could be null
2564 if J = N and then Result_May_Be_Null then
2565 Last_Opnd_High_Bound :=
2567 Make_Integer_Literal (Loc,
2568 Intval => Expr_Value (Hi)));
2571 -- Exclude null length case unless last operand
2573 if J < N and then Len = 0 then
2578 Operands (NN) := Opnd;
2579 Is_Fixed_Length (NN) := True;
2580 Fixed_Length (NN) := Len;
2582 Opnd_Low_Bound (NN) := To_Ityp (
2583 Make_Integer_Literal (Loc,
2584 Intval => Expr_Value (Lo)));
2592 -- All cases where the length is not known at compile time, or the
2593 -- special case of an operand which is known to be null but has a
2594 -- lower bound other than 1 or is other than a string type.
2599 -- Capture operand bounds
2601 Opnd_Low_Bound (NN) :=
2602 Make_Attribute_Reference (Loc,
2604 Duplicate_Subexpr (Opnd, Name_Req => True),
2605 Attribute_Name => Name_First);
2607 if J = N and Result_May_Be_Null then
2608 Last_Opnd_High_Bound :=
2610 Make_Attribute_Reference (Loc,
2612 Duplicate_Subexpr (Opnd, Name_Req => True),
2613 Attribute_Name => Name_Last));
2616 -- Capture length of operand in entity
2618 Operands (NN) := Opnd;
2619 Is_Fixed_Length (NN) := False;
2622 Make_Defining_Identifier (Loc,
2623 Chars => New_Internal_Name ('L'));
2626 Make_Object_Declaration (Loc,
2627 Defining_Identifier => Var_Length (NN),
2628 Constant_Present => True,
2630 Object_Definition =>
2631 New_Occurrence_Of (Artyp, Loc),
2634 Make_Attribute_Reference (Loc,
2636 Duplicate_Subexpr (Opnd, Name_Req => True),
2637 Attribute_Name => Name_Length)));
2641 -- Set next entry in aggregate length array
2643 -- For first entry, make either integer literal for fixed length
2644 -- or a reference to the saved length for variable length.
2647 if Is_Fixed_Length (1) then
2649 Make_Integer_Literal (Loc,
2650 Intval => Fixed_Length (1));
2653 New_Reference_To (Var_Length (1), Loc);
2656 -- If entry is fixed length and only fixed lengths so far, make
2657 -- appropriate new integer literal adding new length.
2659 elsif Is_Fixed_Length (NN)
2660 and then Nkind (Aggr_Length (NN - 1)) = N_Integer_Literal
2663 Make_Integer_Literal (Loc,
2664 Intval => Fixed_Length (NN) + Intval (Aggr_Length (NN - 1)));
2666 -- All other cases, construct an addition node for the length and
2667 -- create an entity initialized to this length.
2671 Make_Defining_Identifier (Loc,
2672 Chars => New_Internal_Name ('L'));
2674 if Is_Fixed_Length (NN) then
2675 Clen := Make_Integer_Literal (Loc, Fixed_Length (NN));
2677 Clen := New_Reference_To (Var_Length (NN), Loc);
2681 Make_Object_Declaration (Loc,
2682 Defining_Identifier => Ent,
2683 Constant_Present => True,
2685 Object_Definition =>
2686 New_Occurrence_Of (Artyp, Loc),
2690 Left_Opnd => New_Copy (Aggr_Length (NN - 1)),
2691 Right_Opnd => Clen)));
2693 Aggr_Length (NN) := Make_Identifier (Loc, Chars => Chars (Ent));
2700 -- If we have only skipped null operands, return the last operand
2707 -- If we have only one non-null operand, return it and we are done.
2708 -- There is one case in which this cannot be done, and that is when
2709 -- the sole operand is of the element type, in which case it must be
2710 -- converted to an array, and the easiest way of doing that is to go
2711 -- through the normal general circuit.
2714 and then Base_Type (Etype (Operands (1))) /= Ctyp
2716 Result := Operands (1);
2720 -- Cases where we have a real concatenation
2722 -- Next step is to find the low bound for the result array that we
2723 -- will allocate. The rules for this are in (RM 4.5.6(5-7)).
2725 -- If the ultimate ancestor of the index subtype is a constrained array
2726 -- definition, then the lower bound is that of the index subtype as
2727 -- specified by (RM 4.5.3(6)).
2729 -- The right test here is to go to the root type, and then the ultimate
2730 -- ancestor is the first subtype of this root type.
2732 if Is_Constrained (First_Subtype (Root_Type (Atyp))) then
2734 Make_Attribute_Reference (Loc,
2736 New_Occurrence_Of (First_Subtype (Root_Type (Atyp)), Loc),
2737 Attribute_Name => Name_First);
2739 -- If the first operand in the list has known length we know that
2740 -- the lower bound of the result is the lower bound of this operand.
2742 elsif Is_Fixed_Length (1) then
2743 Low_Bound := Opnd_Low_Bound (1);
2745 -- OK, we don't know the lower bound, we have to build a horrible
2746 -- expression actions node of the form
2748 -- if Cond1'Length /= 0 then
2751 -- if Opnd2'Length /= 0 then
2756 -- The nesting ends either when we hit an operand whose length is known
2757 -- at compile time, or on reaching the last operand, whose low bound we
2758 -- take unconditionally whether or not it is null. It's easiest to do
2759 -- this with a recursive procedure:
2763 function Get_Known_Bound (J : Nat) return Node_Id;
2764 -- Returns the lower bound determined by operands J .. NN
2766 ---------------------
2767 -- Get_Known_Bound --
2768 ---------------------
2770 function Get_Known_Bound (J : Nat) return Node_Id is
2772 if Is_Fixed_Length (J) or else J = NN then
2773 return New_Copy (Opnd_Low_Bound (J));
2777 Make_Conditional_Expression (Loc,
2778 Expressions => New_List (
2781 Left_Opnd => New_Reference_To (Var_Length (J), Loc),
2782 Right_Opnd => Make_Integer_Literal (Loc, 0)),
2784 New_Copy (Opnd_Low_Bound (J)),
2785 Get_Known_Bound (J + 1)));
2787 end Get_Known_Bound;
2791 Make_Defining_Identifier (Loc, Chars => New_Internal_Name ('L'));
2794 Make_Object_Declaration (Loc,
2795 Defining_Identifier => Ent,
2796 Constant_Present => True,
2797 Object_Definition => New_Occurrence_Of (Ityp, Loc),
2798 Expression => Get_Known_Bound (1)));
2800 Low_Bound := New_Reference_To (Ent, Loc);
2804 -- Now we can safely compute the upper bound, normally
2805 -- Low_Bound + Length - 1.
2810 Left_Opnd => To_Artyp (New_Copy (Low_Bound)),
2812 Make_Op_Subtract (Loc,
2813 Left_Opnd => New_Copy (Aggr_Length (NN)),
2814 Right_Opnd => Make_Artyp_Literal (1))));
2816 -- Note that calculation of the high bound may cause overflow in some
2817 -- very weird cases, so in the general case we need an overflow check on
2818 -- the high bound. We can avoid this for the common case of string types
2819 -- and other types whose index is Positive, since we chose a wider range
2820 -- for the arithmetic type.
2822 if Istyp /= Standard_Positive then
2823 Activate_Overflow_Check (High_Bound);
2826 -- Handle the exceptional case where the result is null, in which case
2827 -- case the bounds come from the last operand (so that we get the proper
2828 -- bounds if the last operand is super-flat).
2830 if Result_May_Be_Null then
2832 Make_Conditional_Expression (Loc,
2833 Expressions => New_List (
2835 Left_Opnd => New_Copy (Aggr_Length (NN)),
2836 Right_Opnd => Make_Artyp_Literal (0)),
2837 Last_Opnd_High_Bound,
2841 -- Here is where we insert the saved up actions
2843 Insert_Actions (Cnode, Actions, Suppress => All_Checks);
2845 -- Now we construct an array object with appropriate bounds
2848 Make_Defining_Identifier (Loc,
2849 Chars => New_Internal_Name ('S'));
2851 -- If the bound is statically known to be out of range, we do not want
2852 -- to abort, we want a warning and a runtime constraint error. Note that
2853 -- we have arranged that the result will not be treated as a static
2854 -- constant, so we won't get an illegality during this insertion.
2856 Insert_Action (Cnode,
2857 Make_Object_Declaration (Loc,
2858 Defining_Identifier => Ent,
2859 Object_Definition =>
2860 Make_Subtype_Indication (Loc,
2861 Subtype_Mark => New_Occurrence_Of (Atyp, Loc),
2863 Make_Index_Or_Discriminant_Constraint (Loc,
2864 Constraints => New_List (
2866 Low_Bound => Low_Bound,
2867 High_Bound => High_Bound))))),
2868 Suppress => All_Checks);
2870 -- If the result of the concatenation appears as the initializing
2871 -- expression of an object declaration, we can just rename the
2872 -- result, rather than copying it.
2874 Set_OK_To_Rename (Ent);
2876 -- Catch the static out of range case now
2878 if Raises_Constraint_Error (High_Bound) then
2879 raise Concatenation_Error;
2882 -- Now we will generate the assignments to do the actual concatenation
2884 -- There is one case in which we will not do this, namely when all the
2885 -- following conditions are met:
2887 -- The result type is Standard.String
2889 -- There are nine or fewer retained (non-null) operands
2891 -- The optimization level is -O0
2893 -- The corresponding System.Concat_n.Str_Concat_n routine is
2894 -- available in the run time.
2896 -- The debug flag gnatd.c is not set
2898 -- If all these conditions are met then we generate a call to the
2899 -- relevant concatenation routine. The purpose of this is to avoid
2900 -- undesirable code bloat at -O0.
2902 if Atyp = Standard_String
2903 and then NN in 2 .. 9
2904 and then (Opt.Optimization_Level = 0 or else Debug_Flag_Dot_CC)
2905 and then not Debug_Flag_Dot_C
2908 RR : constant array (Nat range 2 .. 9) of RE_Id :=
2919 if RTE_Available (RR (NN)) then
2921 Opnds : constant List_Id :=
2922 New_List (New_Occurrence_Of (Ent, Loc));
2925 for J in 1 .. NN loop
2926 if Is_List_Member (Operands (J)) then
2927 Remove (Operands (J));
2930 if Base_Type (Etype (Operands (J))) = Ctyp then
2932 Make_Aggregate (Loc,
2933 Component_Associations => New_List (
2934 Make_Component_Association (Loc,
2935 Choices => New_List (
2936 Make_Integer_Literal (Loc, 1)),
2937 Expression => Operands (J)))));
2940 Append_To (Opnds, Operands (J));
2944 Insert_Action (Cnode,
2945 Make_Procedure_Call_Statement (Loc,
2946 Name => New_Reference_To (RTE (RR (NN)), Loc),
2947 Parameter_Associations => Opnds));
2949 Result := New_Reference_To (Ent, Loc);
2956 -- Not special case so generate the assignments
2958 Known_Non_Null_Operand_Seen := False;
2960 for J in 1 .. NN loop
2962 Lo : constant Node_Id :=
2964 Left_Opnd => To_Artyp (New_Copy (Low_Bound)),
2965 Right_Opnd => Aggr_Length (J - 1));
2967 Hi : constant Node_Id :=
2969 Left_Opnd => To_Artyp (New_Copy (Low_Bound)),
2971 Make_Op_Subtract (Loc,
2972 Left_Opnd => Aggr_Length (J),
2973 Right_Opnd => Make_Artyp_Literal (1)));
2976 -- Singleton case, simple assignment
2978 if Base_Type (Etype (Operands (J))) = Ctyp then
2979 Known_Non_Null_Operand_Seen := True;
2980 Insert_Action (Cnode,
2981 Make_Assignment_Statement (Loc,
2983 Make_Indexed_Component (Loc,
2984 Prefix => New_Occurrence_Of (Ent, Loc),
2985 Expressions => New_List (To_Ityp (Lo))),
2986 Expression => Operands (J)),
2987 Suppress => All_Checks);
2989 -- Array case, slice assignment, skipped when argument is fixed
2990 -- length and known to be null.
2992 elsif (not Is_Fixed_Length (J)) or else (Fixed_Length (J) > 0) then
2995 Make_Assignment_Statement (Loc,
2999 New_Occurrence_Of (Ent, Loc),
3002 Low_Bound => To_Ityp (Lo),
3003 High_Bound => To_Ityp (Hi))),
3004 Expression => Operands (J));
3006 if Is_Fixed_Length (J) then
3007 Known_Non_Null_Operand_Seen := True;
3009 elsif not Known_Non_Null_Operand_Seen then
3011 -- Here if operand length is not statically known and no
3012 -- operand known to be non-null has been processed yet.
3013 -- If operand length is 0, we do not need to perform the
3014 -- assignment, and we must avoid the evaluation of the
3015 -- high bound of the slice, since it may underflow if the
3016 -- low bound is Ityp'First.
3019 Make_Implicit_If_Statement (Cnode,
3023 New_Occurrence_Of (Var_Length (J), Loc),
3024 Right_Opnd => Make_Integer_Literal (Loc, 0)),
3029 Insert_Action (Cnode, Assign, Suppress => All_Checks);
3035 -- Finally we build the result, which is a reference to the array object
3037 Result := New_Reference_To (Ent, Loc);
3040 Rewrite (Cnode, Result);
3041 Analyze_And_Resolve (Cnode, Atyp);
3044 when Concatenation_Error =>
3046 -- Kill warning generated for the declaration of the static out of
3047 -- range high bound, and instead generate a Constraint_Error with
3048 -- an appropriate specific message.
3050 Kill_Dead_Code (Declaration_Node (Entity (High_Bound)));
3051 Apply_Compile_Time_Constraint_Error
3053 Msg => "concatenation result upper bound out of range?",
3054 Reason => CE_Range_Check_Failed);
3055 -- Set_Etype (Cnode, Atyp);
3056 end Expand_Concatenate;
3058 ------------------------
3059 -- Expand_N_Allocator --
3060 ------------------------
3062 procedure Expand_N_Allocator (N : Node_Id) is
3063 PtrT : constant Entity_Id := Etype (N);
3064 Dtyp : constant Entity_Id := Available_View (Designated_Type (PtrT));
3065 Etyp : constant Entity_Id := Etype (Expression (N));
3066 Loc : constant Source_Ptr := Sloc (N);
3071 procedure Complete_Coextension_Finalization;
3072 -- Generate finalization calls for all nested coextensions of N. This
3073 -- routine may allocate list controllers if necessary.
3075 procedure Rewrite_Coextension (N : Node_Id);
3076 -- Static coextensions have the same lifetime as the entity they
3077 -- constrain. Such occurrences can be rewritten as aliased objects
3078 -- and their unrestricted access used instead of the coextension.
3080 function Size_In_Storage_Elements (E : Entity_Id) return Node_Id;
3081 -- Given a constrained array type E, returns a node representing the
3082 -- code to compute the size in storage elements for the given type.
3083 -- This is done without using the attribute (which malfunctions for
3086 ---------------------------------------
3087 -- Complete_Coextension_Finalization --
3088 ---------------------------------------
3090 procedure Complete_Coextension_Finalization is
3092 Coext_Elmt : Elmt_Id;
3096 function Inside_A_Return_Statement (N : Node_Id) return Boolean;
3097 -- Determine whether node N is part of a return statement
3099 function Needs_Initialization_Call (N : Node_Id) return Boolean;
3100 -- Determine whether node N is a subtype indicator allocator which
3101 -- acts a coextension. Such coextensions need initialization.
3103 -------------------------------
3104 -- Inside_A_Return_Statement --
3105 -------------------------------
3107 function Inside_A_Return_Statement (N : Node_Id) return Boolean is
3112 while Present (P) loop
3114 (P, N_Extended_Return_Statement, N_Simple_Return_Statement)
3118 -- Stop the traversal when we reach a subprogram body
3120 elsif Nkind (P) = N_Subprogram_Body then
3128 end Inside_A_Return_Statement;
3130 -------------------------------
3131 -- Needs_Initialization_Call --
3132 -------------------------------
3134 function Needs_Initialization_Call (N : Node_Id) return Boolean is
3138 if Nkind (N) = N_Explicit_Dereference
3139 and then Nkind (Prefix (N)) = N_Identifier
3140 and then Nkind (Parent (Entity (Prefix (N)))) =
3141 N_Object_Declaration
3143 Obj_Decl := Parent (Entity (Prefix (N)));
3146 Present (Expression (Obj_Decl))
3147 and then Nkind (Expression (Obj_Decl)) = N_Allocator
3148 and then Nkind (Expression (Expression (Obj_Decl))) /=
3149 N_Qualified_Expression;
3153 end Needs_Initialization_Call;
3155 -- Start of processing for Complete_Coextension_Finalization
3158 -- When a coextension root is inside a return statement, we need to
3159 -- use the finalization chain of the function's scope. This does not
3160 -- apply for controlled named access types because in those cases we
3161 -- can use the finalization chain of the type itself.
3163 if Inside_A_Return_Statement (N)
3165 (Ekind (PtrT) = E_Anonymous_Access_Type
3167 (Ekind (PtrT) = E_Access_Type
3168 and then No (Associated_Final_Chain (PtrT))))
3172 Outer_S : Entity_Id;
3173 S : Entity_Id := Current_Scope;
3176 while Present (S) and then S /= Standard_Standard loop
3177 if Ekind (S) = E_Function then
3178 Outer_S := Scope (S);
3180 -- Retrieve the declaration of the body
3185 (Corresponding_Body (Parent (Parent (S)))));
3192 -- Push the scope of the function body since we are inserting
3193 -- the list before the body, but we are currently in the body
3194 -- itself. Override the finalization list of PtrT since the
3195 -- finalization context is now different.
3197 Push_Scope (Outer_S);
3198 Build_Final_List (Decl, PtrT);
3202 -- The root allocator may not be controlled, but it still needs a
3203 -- finalization list for all nested coextensions.
3205 elsif No (Associated_Final_Chain (PtrT)) then
3206 Build_Final_List (N, PtrT);
3210 Make_Selected_Component (Loc,
3212 New_Reference_To (Associated_Final_Chain (PtrT), Loc),
3214 Make_Identifier (Loc, Name_F));
3216 Coext_Elmt := First_Elmt (Coextensions (N));
3217 while Present (Coext_Elmt) loop
3218 Coext := Node (Coext_Elmt);
3223 if Nkind (Coext) = N_Identifier then
3225 Make_Unchecked_Type_Conversion (Loc,
3226 Subtype_Mark => New_Reference_To (Etype (Coext), Loc),
3228 Make_Explicit_Dereference (Loc,
3229 Prefix => New_Copy_Tree (Coext)));
3231 Ref := New_Copy_Tree (Coext);
3234 -- No initialization call if not allowed
3236 Check_Restriction (No_Default_Initialization, N);
3238 if not Restriction_Active (No_Default_Initialization) then
3242 -- attach_to_final_list (Ref, Flist, 2)
3244 if Needs_Initialization_Call (Coext) then
3248 Typ => Etype (Coext),
3250 With_Attach => Make_Integer_Literal (Loc, Uint_2)));
3253 -- attach_to_final_list (Ref, Flist, 2)
3259 Flist_Ref => New_Copy_Tree (Flist),
3260 With_Attach => Make_Integer_Literal (Loc, Uint_2)));
3264 Next_Elmt (Coext_Elmt);
3266 end Complete_Coextension_Finalization;
3268 -------------------------
3269 -- Rewrite_Coextension --
3270 -------------------------
3272 procedure Rewrite_Coextension (N : Node_Id) is
3273 Temp : constant Node_Id :=
3274 Make_Defining_Identifier (Loc,
3275 New_Internal_Name ('C'));
3278 -- Cnn : aliased Etyp;
3280 Decl : constant Node_Id :=
3281 Make_Object_Declaration (Loc,
3282 Defining_Identifier => Temp,
3283 Aliased_Present => True,
3284 Object_Definition =>
3285 New_Occurrence_Of (Etyp, Loc));
3289 if Nkind (Expression (N)) = N_Qualified_Expression then
3290 Set_Expression (Decl, Expression (Expression (N)));
3293 -- Find the proper insertion node for the declaration
3296 while Present (Nod) loop
3297 exit when Nkind (Nod) in N_Statement_Other_Than_Procedure_Call
3298 or else Nkind (Nod) = N_Procedure_Call_Statement
3299 or else Nkind (Nod) in N_Declaration;
3300 Nod := Parent (Nod);
3303 Insert_Before (Nod, Decl);
3307 Make_Attribute_Reference (Loc,
3308 Prefix => New_Occurrence_Of (Temp, Loc),
3309 Attribute_Name => Name_Unrestricted_Access));
3311 Analyze_And_Resolve (N, PtrT);
3312 end Rewrite_Coextension;
3314 ------------------------------
3315 -- Size_In_Storage_Elements --
3316 ------------------------------
3318 function Size_In_Storage_Elements (E : Entity_Id) return Node_Id is
3320 -- Logically this just returns E'Max_Size_In_Storage_Elements.
3321 -- However, the reason for the existence of this function is
3322 -- to construct a test for sizes too large, which means near the
3323 -- 32-bit limit on a 32-bit machine, and precisely the trouble
3324 -- is that we get overflows when sizes are greater than 2**31.
3326 -- So what we end up doing for array types is to use the expression:
3328 -- number-of-elements * component_type'Max_Size_In_Storage_Elements
3330 -- which avoids this problem. All this is a big bogus, but it does
3331 -- mean we catch common cases of trying to allocate arrays that
3332 -- are too large, and which in the absence of a check results in
3333 -- undetected chaos ???
3340 for J in 1 .. Number_Dimensions (E) loop
3342 Make_Attribute_Reference (Loc,
3343 Prefix => New_Occurrence_Of (E, Loc),
3344 Attribute_Name => Name_Length,
3345 Expressions => New_List (
3346 Make_Integer_Literal (Loc, J)));
3353 Make_Op_Multiply (Loc,
3360 Make_Op_Multiply (Loc,
3363 Make_Attribute_Reference (Loc,
3364 Prefix => New_Occurrence_Of (Component_Type (E), Loc),
3365 Attribute_Name => Name_Max_Size_In_Storage_Elements));
3367 end Size_In_Storage_Elements;
3369 -- Start of processing for Expand_N_Allocator
3372 -- RM E.2.3(22). We enforce that the expected type of an allocator
3373 -- shall not be a remote access-to-class-wide-limited-private type
3375 -- Why is this being done at expansion time, seems clearly wrong ???
3377 Validate_Remote_Access_To_Class_Wide_Type (N);
3379 -- Set the Storage Pool
3381 Set_Storage_Pool (N, Associated_Storage_Pool (Root_Type (PtrT)));
3383 if Present (Storage_Pool (N)) then
3384 if Is_RTE (Storage_Pool (N), RE_SS_Pool) then
3385 if VM_Target = No_VM then
3386 Set_Procedure_To_Call (N, RTE (RE_SS_Allocate));
3389 elsif Is_Class_Wide_Type (Etype (Storage_Pool (N))) then
3390 Set_Procedure_To_Call (N, RTE (RE_Allocate_Any));
3393 Set_Procedure_To_Call (N,
3394 Find_Prim_Op (Etype (Storage_Pool (N)), Name_Allocate));
3398 -- Under certain circumstances we can replace an allocator by an access
3399 -- to statically allocated storage. The conditions, as noted in AARM
3400 -- 3.10 (10c) are as follows:
3402 -- Size and initial value is known at compile time
3403 -- Access type is access-to-constant
3405 -- The allocator is not part of a constraint on a record component,
3406 -- because in that case the inserted actions are delayed until the
3407 -- record declaration is fully analyzed, which is too late for the
3408 -- analysis of the rewritten allocator.
3410 if Is_Access_Constant (PtrT)
3411 and then Nkind (Expression (N)) = N_Qualified_Expression
3412 and then Compile_Time_Known_Value (Expression (Expression (N)))
3413 and then Size_Known_At_Compile_Time (Etype (Expression
3415 and then not Is_Record_Type (Current_Scope)
3417 -- Here we can do the optimization. For the allocator
3421 -- We insert an object declaration
3423 -- Tnn : aliased x := y;
3425 -- and replace the allocator by Tnn'Unrestricted_Access. Tnn is
3426 -- marked as requiring static allocation.
3429 Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
3431 Desig := Subtype_Mark (Expression (N));
3433 -- If context is constrained, use constrained subtype directly,
3434 -- so that the constant is not labelled as having a nominally
3435 -- unconstrained subtype.
3437 if Entity (Desig) = Base_Type (Dtyp) then
3438 Desig := New_Occurrence_Of (Dtyp, Loc);
3442 Make_Object_Declaration (Loc,
3443 Defining_Identifier => Temp,
3444 Aliased_Present => True,
3445 Constant_Present => Is_Access_Constant (PtrT),
3446 Object_Definition => Desig,
3447 Expression => Expression (Expression (N))));
3450 Make_Attribute_Reference (Loc,
3451 Prefix => New_Occurrence_Of (Temp, Loc),
3452 Attribute_Name => Name_Unrestricted_Access));
3454 Analyze_And_Resolve (N, PtrT);
3456 -- We set the variable as statically allocated, since we don't want
3457 -- it going on the stack of the current procedure!
3459 Set_Is_Statically_Allocated (Temp);
3463 -- Same if the allocator is an access discriminant for a local object:
3464 -- instead of an allocator we create a local value and constrain the
3465 -- the enclosing object with the corresponding access attribute.
3467 if Is_Static_Coextension (N) then
3468 Rewrite_Coextension (N);
3472 -- The current allocator creates an object which may contain nested
3473 -- coextensions. Use the current allocator's finalization list to
3474 -- generate finalization call for all nested coextensions.
3476 if Is_Coextension_Root (N) then
3477 Complete_Coextension_Finalization;
3480 -- Check for size too large, we do this because the back end misses
3481 -- proper checks here and can generate rubbish allocation calls when
3482 -- we are near the limit. We only do this for the 32-bit address case
3483 -- since that is from a practical point of view where we see a problem.
3485 if System_Address_Size = 32
3486 and then not Storage_Checks_Suppressed (PtrT)
3487 and then not Storage_Checks_Suppressed (Dtyp)
3488 and then not Storage_Checks_Suppressed (Etyp)
3490 -- The check we want to generate should look like
3492 -- if Etyp'Max_Size_In_Storage_Elements > 3.5 gigabytes then
3493 -- raise Storage_Error;
3496 -- where 3.5 gigabytes is a constant large enough to accomodate any
3497 -- reasonable request for. But we can't do it this way because at
3498 -- least at the moment we don't compute this attribute right, and
3499 -- can silently give wrong results when the result gets large. Since
3500 -- this is all about large results, that's bad, so instead we only
3501 -- apply the check for constrained arrays, and manually compute the
3502 -- value of the attribute ???
3504 if Is_Array_Type (Etyp) and then Is_Constrained (Etyp) then
3506 Make_Raise_Storage_Error (Loc,
3509 Left_Opnd => Size_In_Storage_Elements (Etyp),
3511 Make_Integer_Literal (Loc,
3512 Intval => Uint_7 * (Uint_2 ** 29))),
3513 Reason => SE_Object_Too_Large));
3517 -- Handle case of qualified expression (other than optimization above)
3518 -- First apply constraint checks, because the bounds or discriminants
3519 -- in the aggregate might not match the subtype mark in the allocator.
3521 if Nkind (Expression (N)) = N_Qualified_Expression then
3522 Apply_Constraint_Check
3523 (Expression (Expression (N)), Etype (Expression (N)));
3525 Expand_Allocator_Expression (N);
3529 -- If the allocator is for a type which requires initialization, and
3530 -- there is no initial value (i.e. operand is a subtype indication
3531 -- rather than a qualified expression), then we must generate a call to
3532 -- the initialization routine using an expressions action node:
3534 -- [Pnnn : constant ptr_T := new (T); Init (Pnnn.all,...); Pnnn]
3536 -- Here ptr_T is the pointer type for the allocator, and T is the
3537 -- subtype of the allocator. A special case arises if the designated
3538 -- type of the access type is a task or contains tasks. In this case
3539 -- the call to Init (Temp.all ...) is replaced by code that ensures
3540 -- that tasks get activated (see Exp_Ch9.Build_Task_Allocate_Block
3541 -- for details). In addition, if the type T is a task T, then the
3542 -- first argument to Init must be converted to the task record type.
3545 T : constant Entity_Id := Entity (Expression (N));
3553 Temp_Decl : Node_Id;
3554 Temp_Type : Entity_Id;
3555 Attach_Level : Uint;
3558 if No_Initialization (N) then
3561 -- Case of no initialization procedure present
3563 elsif not Has_Non_Null_Base_Init_Proc (T) then
3565 -- Case of simple initialization required
3567 if Needs_Simple_Initialization (T) then
3568 Check_Restriction (No_Default_Initialization, N);
3569 Rewrite (Expression (N),
3570 Make_Qualified_Expression (Loc,
3571 Subtype_Mark => New_Occurrence_Of (T, Loc),
3572 Expression => Get_Simple_Init_Val (T, N)));
3574 Analyze_And_Resolve (Expression (Expression (N)), T);
3575 Analyze_And_Resolve (Expression (N), T);
3576 Set_Paren_Count (Expression (Expression (N)), 1);
3577 Expand_N_Allocator (N);
3579 -- No initialization required
3585 -- Case of initialization procedure present, must be called
3588 Check_Restriction (No_Default_Initialization, N);
3590 if not Restriction_Active (No_Default_Initialization) then
3591 Init := Base_Init_Proc (T);
3593 Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
3595 -- Construct argument list for the initialization routine call
3598 Make_Explicit_Dereference (Loc,
3599 Prefix => New_Reference_To (Temp, Loc));
3600 Set_Assignment_OK (Arg1);
3603 -- The initialization procedure expects a specific type. if the
3604 -- context is access to class wide, indicate that the object
3605 -- being allocated has the right specific type.
3607 if Is_Class_Wide_Type (Dtyp) then
3608 Arg1 := Unchecked_Convert_To (T, Arg1);
3611 -- If designated type is a concurrent type or if it is private
3612 -- type whose definition is a concurrent type, the first
3613 -- argument in the Init routine has to be unchecked conversion
3614 -- to the corresponding record type. If the designated type is
3615 -- a derived type, we also convert the argument to its root
3618 if Is_Concurrent_Type (T) then
3620 Unchecked_Convert_To (Corresponding_Record_Type (T), Arg1);
3622 elsif Is_Private_Type (T)
3623 and then Present (Full_View (T))
3624 and then Is_Concurrent_Type (Full_View (T))
3627 Unchecked_Convert_To
3628 (Corresponding_Record_Type (Full_View (T)), Arg1);
3630 elsif Etype (First_Formal (Init)) /= Base_Type (T) then
3632 Ftyp : constant Entity_Id := Etype (First_Formal (Init));
3634 Arg1 := OK_Convert_To (Etype (Ftyp), Arg1);
3635 Set_Etype (Arg1, Ftyp);
3639 Args := New_List (Arg1);
3641 -- For the task case, pass the Master_Id of the access type as
3642 -- the value of the _Master parameter, and _Chain as the value
3643 -- of the _Chain parameter (_Chain will be defined as part of
3644 -- the generated code for the allocator).
3646 -- In Ada 2005, the context may be a function that returns an
3647 -- anonymous access type. In that case the Master_Id has been
3648 -- created when expanding the function declaration.
3650 if Has_Task (T) then
3651 if No (Master_Id (Base_Type (PtrT))) then
3653 -- If we have a non-library level task with restriction
3654 -- No_Task_Hierarchy set, then no point in expanding.
3656 if not Is_Library_Level_Entity (T)
3657 and then Restriction_Active (No_Task_Hierarchy)
3662 -- The designated type was an incomplete type, and the
3663 -- access type did not get expanded. Salvage it now.
3665 pragma Assert (Present (Parent (Base_Type (PtrT))));
3666 Expand_N_Full_Type_Declaration
3667 (Parent (Base_Type (PtrT)));
3670 -- If the context of the allocator is a declaration or an
3671 -- assignment, we can generate a meaningful image for it,
3672 -- even though subsequent assignments might remove the
3673 -- connection between task and entity. We build this image
3674 -- when the left-hand side is a simple variable, a simple
3675 -- indexed assignment or a simple selected component.
3677 if Nkind (Parent (N)) = N_Assignment_Statement then
3679 Nam : constant Node_Id := Name (Parent (N));
3682 if Is_Entity_Name (Nam) then
3684 Build_Task_Image_Decls
3687 (Entity (Nam), Sloc (Nam)), T);
3690 (Nam, N_Indexed_Component, N_Selected_Component)
3691 and then Is_Entity_Name (Prefix (Nam))
3694 Build_Task_Image_Decls
3695 (Loc, Nam, Etype (Prefix (Nam)));
3697 Decls := Build_Task_Image_Decls (Loc, T, T);
3701 elsif Nkind (Parent (N)) = N_Object_Declaration then
3703 Build_Task_Image_Decls
3704 (Loc, Defining_Identifier (Parent (N)), T);
3707 Decls := Build_Task_Image_Decls (Loc, T, T);
3712 (Master_Id (Base_Type (Root_Type (PtrT))), Loc));
3713 Append_To (Args, Make_Identifier (Loc, Name_uChain));
3715 Decl := Last (Decls);
3717 New_Occurrence_Of (Defining_Identifier (Decl), Loc));
3719 -- Has_Task is false, Decls not used
3725 -- Add discriminants if discriminated type
3728 Dis : Boolean := False;
3732 if Has_Discriminants (T) then
3736 elsif Is_Private_Type (T)
3737 and then Present (Full_View (T))
3738 and then Has_Discriminants (Full_View (T))
3741 Typ := Full_View (T);
3746 -- If the allocated object will be constrained by the
3747 -- default values for discriminants, then build a subtype
3748 -- with those defaults, and change the allocated subtype
3749 -- to that. Note that this happens in fewer cases in Ada
3752 if not Is_Constrained (Typ)
3753 and then Present (Discriminant_Default_Value
3754 (First_Discriminant (Typ)))
3755 and then (Ada_Version < Ada_05
3757 not Has_Constrained_Partial_View (Typ))
3759 Typ := Build_Default_Subtype (Typ, N);
3760 Set_Expression (N, New_Reference_To (Typ, Loc));
3763 Discr := First_Elmt (Discriminant_Constraint (Typ));
3764 while Present (Discr) loop
3765 Nod := Node (Discr);
3766 Append (New_Copy_Tree (Node (Discr)), Args);
3768 -- AI-416: when the discriminant constraint is an
3769 -- anonymous access type make sure an accessibility
3770 -- check is inserted if necessary (3.10.2(22.q/2))
3772 if Ada_Version >= Ada_05
3774 Ekind (Etype (Nod)) = E_Anonymous_Access_Type
3776 Apply_Accessibility_Check
3777 (Nod, Typ, Insert_Node => Nod);
3785 -- We set the allocator as analyzed so that when we analyze the
3786 -- expression actions node, we do not get an unwanted recursive
3787 -- expansion of the allocator expression.
3789 Set_Analyzed (N, True);
3790 Nod := Relocate_Node (N);
3792 -- Here is the transformation:
3794 -- output: Temp : constant ptr_T := new T;
3795 -- Init (Temp.all, ...);
3796 -- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
3797 -- <CTRL> Initialize (Finalizable (Temp.all));
3799 -- Here ptr_T is the pointer type for the allocator, and is the
3800 -- subtype of the allocator.
3803 Make_Object_Declaration (Loc,
3804 Defining_Identifier => Temp,
3805 Constant_Present => True,
3806 Object_Definition => New_Reference_To (Temp_Type, Loc),
3809 Set_Assignment_OK (Temp_Decl);
3810 Insert_Action (N, Temp_Decl, Suppress => All_Checks);
3812 -- If the designated type is a task type or contains tasks,
3813 -- create block to activate created tasks, and insert
3814 -- declaration for Task_Image variable ahead of call.
3816 if Has_Task (T) then
3818 L : constant List_Id := New_List;
3821 Build_Task_Allocate_Block (L, Nod, Args);
3823 Insert_List_Before (First (Declarations (Blk)), Decls);
3824 Insert_Actions (N, L);
3829 Make_Procedure_Call_Statement (Loc,
3830 Name => New_Reference_To (Init, Loc),
3831 Parameter_Associations => Args));
3834 if Needs_Finalization (T) then
3836 -- Postpone the generation of a finalization call for the
3837 -- current allocator if it acts as a coextension.
3839 if Is_Dynamic_Coextension (N) then
3840 if No (Coextensions (N)) then
3841 Set_Coextensions (N, New_Elmt_List);
3844 Append_Elmt (New_Copy_Tree (Arg1), Coextensions (N));
3848 Get_Allocator_Final_List (N, Base_Type (T), PtrT);
3850 -- Anonymous access types created for access parameters
3851 -- are attached to an explicitly constructed controller,
3852 -- which ensures that they can be finalized properly,
3853 -- even if their deallocation might not happen. The list
3854 -- associated with the controller is doubly-linked. For
3855 -- other anonymous access types, the object may end up
3856 -- on the global final list which is singly-linked.
3857 -- Work needed for access discriminants in Ada 2005 ???
3859 if Ekind (PtrT) = E_Anonymous_Access_Type then
3860 Attach_Level := Uint_1;
3862 Attach_Level := Uint_2;
3867 Ref => New_Copy_Tree (Arg1),
3870 With_Attach => Make_Integer_Literal (Loc,
3871 Intval => Attach_Level)));
3875 Rewrite (N, New_Reference_To (Temp, Loc));
3876 Analyze_And_Resolve (N, PtrT);
3881 -- Ada 2005 (AI-251): If the allocator is for a class-wide interface
3882 -- object that has been rewritten as a reference, we displace "this"
3883 -- to reference properly its secondary dispatch table.
3885 if Nkind (N) = N_Identifier
3886 and then Is_Interface (Dtyp)
3888 Displace_Allocator_Pointer (N);
3892 when RE_Not_Available =>
3894 end Expand_N_Allocator;
3896 -----------------------
3897 -- Expand_N_And_Then --
3898 -----------------------
3900 -- Expand into conditional expression if Actions present, and also deal
3901 -- with optimizing case of arguments being True or False.
3903 procedure Expand_N_And_Then (N : Node_Id) is
3904 Loc : constant Source_Ptr := Sloc (N);
3905 Typ : constant Entity_Id := Etype (N);
3906 Left : constant Node_Id := Left_Opnd (N);
3907 Right : constant Node_Id := Right_Opnd (N);
3911 -- Deal with non-standard booleans
3913 if Is_Boolean_Type (Typ) then
3914 Adjust_Condition (Left);
3915 Adjust_Condition (Right);
3916 Set_Etype (N, Standard_Boolean);
3919 -- Check for cases where left argument is known to be True or False
3921 if Compile_Time_Known_Value (Left) then
3923 -- If left argument is True, change (True and then Right) to Right.
3924 -- Any actions associated with Right will be executed unconditionally
3925 -- and can thus be inserted into the tree unconditionally.
3927 if Expr_Value_E (Left) = Standard_True then
3928 if Present (Actions (N)) then
3929 Insert_Actions (N, Actions (N));
3934 -- If left argument is False, change (False and then Right) to False.
3935 -- In this case we can forget the actions associated with Right,
3936 -- since they will never be executed.
3938 else pragma Assert (Expr_Value_E (Left) = Standard_False);
3939 Kill_Dead_Code (Right);
3940 Kill_Dead_Code (Actions (N));
3941 Rewrite (N, New_Occurrence_Of (Standard_False, Loc));
3944 Adjust_Result_Type (N, Typ);
3948 -- If Actions are present, we expand
3950 -- left and then right
3954 -- if left then right else false end
3956 -- with the actions becoming the Then_Actions of the conditional
3957 -- expression. This conditional expression is then further expanded
3958 -- (and will eventually disappear)
3960 if Present (Actions (N)) then
3961 Actlist := Actions (N);
3963 Make_Conditional_Expression (Loc,
3964 Expressions => New_List (
3967 New_Occurrence_Of (Standard_False, Loc))));
3969 Set_Then_Actions (N, Actlist);
3970 Analyze_And_Resolve (N, Standard_Boolean);
3971 Adjust_Result_Type (N, Typ);
3975 -- No actions present, check for cases of right argument True/False
3977 if Compile_Time_Known_Value (Right) then
3979 -- Change (Left and then True) to Left. Note that we know there are
3980 -- no actions associated with the True operand, since we just checked
3981 -- for this case above.
3983 if Expr_Value_E (Right) = Standard_True then
3986 -- Change (Left and then False) to False, making sure to preserve any
3987 -- side effects associated with the Left operand.
3989 else pragma Assert (Expr_Value_E (Right) = Standard_False);
3990 Remove_Side_Effects (Left);
3992 (N, New_Occurrence_Of (Standard_False, Loc));
3996 Adjust_Result_Type (N, Typ);
3997 end Expand_N_And_Then;
3999 -------------------------------------
4000 -- Expand_N_Conditional_Expression --
4001 -------------------------------------
4003 -- Expand into expression actions if then/else actions present
4005 procedure Expand_N_Conditional_Expression (N : Node_Id) is
4006 Loc : constant Source_Ptr := Sloc (N);
4007 Cond : constant Node_Id := First (Expressions (N));
4008 Thenx : constant Node_Id := Next (Cond);
4009 Elsex : constant Node_Id := Next (Thenx);
4010 Typ : constant Entity_Id := Etype (N);
4015 -- If either then or else actions are present, then given:
4017 -- if cond then then-expr else else-expr end
4019 -- we insert the following sequence of actions (using Insert_Actions):
4024 -- Cnn := then-expr;
4030 -- and replace the conditional expression by a reference to Cnn
4032 if Present (Then_Actions (N)) or else Present (Else_Actions (N)) then
4033 Cnn := Make_Defining_Identifier (Loc, New_Internal_Name ('C'));
4036 Make_Implicit_If_Statement (N,
4037 Condition => Relocate_Node (Cond),
4039 Then_Statements => New_List (
4040 Make_Assignment_Statement (Sloc (Thenx),
4041 Name => New_Occurrence_Of (Cnn, Sloc (Thenx)),
4042 Expression => Relocate_Node (Thenx))),
4044 Else_Statements => New_List (
4045 Make_Assignment_Statement (Sloc (Elsex),
4046 Name => New_Occurrence_Of (Cnn, Sloc (Elsex)),
4047 Expression => Relocate_Node (Elsex))));
4049 -- Move the SLOC of the parent If statement to the newly created one
4050 -- and change it to the SLOC of the expression which, after
4051 -- expansion, will correspond to what is being evaluated.
4053 if Present (Parent (N))
4054 and then Nkind (Parent (N)) = N_If_Statement
4056 Set_Sloc (New_If, Sloc (Parent (N)));
4057 Set_Sloc (Parent (N), Loc);
4060 Set_Assignment_OK (Name (First (Then_Statements (New_If))));
4061 Set_Assignment_OK (Name (First (Else_Statements (New_If))));
4063 if Present (Then_Actions (N)) then
4065 (First (Then_Statements (New_If)), Then_Actions (N));
4068 if Present (Else_Actions (N)) then
4070 (First (Else_Statements (New_If)), Else_Actions (N));
4073 Rewrite (N, New_Occurrence_Of (Cnn, Loc));
4076 Make_Object_Declaration (Loc,
4077 Defining_Identifier => Cnn,
4078 Object_Definition => New_Occurrence_Of (Typ, Loc)));
4080 Insert_Action (N, New_If);
4081 Analyze_And_Resolve (N, Typ);
4083 -- Link temporary to original expression, for Codepeer
4085 Set_Related_Expression (Cnn, Original_Node (N));
4087 end Expand_N_Conditional_Expression;
4089 -----------------------------------
4090 -- Expand_N_Explicit_Dereference --
4091 -----------------------------------
4093 procedure Expand_N_Explicit_Dereference (N : Node_Id) is
4095 -- Insert explicit dereference call for the checked storage pool case
4097 Insert_Dereference_Action (Prefix (N));
4098 end Expand_N_Explicit_Dereference;
4104 procedure Expand_N_In (N : Node_Id) is
4105 Loc : constant Source_Ptr := Sloc (N);
4106 Rtyp : constant Entity_Id := Etype (N);
4107 Lop : constant Node_Id := Left_Opnd (N);
4108 Rop : constant Node_Id := Right_Opnd (N);
4109 Static : constant Boolean := Is_OK_Static_Expression (N);
4111 procedure Substitute_Valid_Check;
4112 -- Replaces node N by Lop'Valid. This is done when we have an explicit
4113 -- test for the left operand being in range of its subtype.
4115 ----------------------------
4116 -- Substitute_Valid_Check --
4117 ----------------------------
4119 procedure Substitute_Valid_Check is
4122 Make_Attribute_Reference (Loc,
4123 Prefix => Relocate_Node (Lop),
4124 Attribute_Name => Name_Valid));
4126 Analyze_And_Resolve (N, Rtyp);
4128 Error_Msg_N ("?explicit membership test may be optimized away", N);
4129 Error_Msg_N ("\?use ''Valid attribute instead", N);
4131 end Substitute_Valid_Check;
4133 -- Start of processing for Expand_N_In
4136 -- Check case of explicit test for an expression in range of its
4137 -- subtype. This is suspicious usage and we replace it with a 'Valid
4138 -- test and give a warning.
4140 if Is_Scalar_Type (Etype (Lop))
4141 and then Nkind (Rop) in N_Has_Entity
4142 and then Etype (Lop) = Entity (Rop)
4143 and then Comes_From_Source (N)
4144 and then VM_Target = No_VM
4146 Substitute_Valid_Check;
4150 -- Do validity check on operands
4152 if Validity_Checks_On and Validity_Check_Operands then
4153 Ensure_Valid (Left_Opnd (N));
4154 Validity_Check_Range (Right_Opnd (N));
4157 -- Case of explicit range
4159 if Nkind (Rop) = N_Range then
4161 Lo : constant Node_Id := Low_Bound (Rop);
4162 Hi : constant Node_Id := High_Bound (Rop);
4164 Ltyp : constant Entity_Id := Etype (Lop);
4166 Lo_Orig : constant Node_Id := Original_Node (Lo);
4167 Hi_Orig : constant Node_Id := Original_Node (Hi);
4169 Lcheck : Compare_Result;
4170 Ucheck : Compare_Result;
4172 Warn1 : constant Boolean :=
4173 Constant_Condition_Warnings
4174 and then Comes_From_Source (N)
4175 and then not In_Instance;
4176 -- This must be true for any of the optimization warnings, we
4177 -- clearly want to give them only for source with the flag on.
4178 -- We also skip these warnings in an instance since it may be
4179 -- the case that different instantiations have different ranges.
4181 Warn2 : constant Boolean :=
4183 and then Nkind (Original_Node (Rop)) = N_Range
4184 and then Is_Integer_Type (Etype (Lo));
4185 -- For the case where only one bound warning is elided, we also
4186 -- insist on an explicit range and an integer type. The reason is
4187 -- that the use of enumeration ranges including an end point is
4188 -- common, as is the use of a subtype name, one of whose bounds
4189 -- is the same as the type of the expression.
4192 -- If test is explicit x'first .. x'last, replace by valid check
4194 if Is_Scalar_Type (Ltyp)
4195 and then Nkind (Lo_Orig) = N_Attribute_Reference
4196 and then Attribute_Name (Lo_Orig) = Name_First
4197 and then Nkind (Prefix (Lo_Orig)) in N_Has_Entity
4198 and then Entity (Prefix (Lo_Orig)) = Ltyp
4199 and then Nkind (Hi_Orig) = N_Attribute_Reference
4200 and then Attribute_Name (Hi_Orig) = Name_Last
4201 and then Nkind (Prefix (Hi_Orig)) in N_Has_Entity
4202 and then Entity (Prefix (Hi_Orig)) = Ltyp
4203 and then Comes_From_Source (N)
4204 and then VM_Target = No_VM
4206 Substitute_Valid_Check;
4210 -- If bounds of type are known at compile time, and the end points
4211 -- are known at compile time and identical, this is another case
4212 -- for substituting a valid test. We only do this for discrete
4213 -- types, since it won't arise in practice for float types.
4215 if Comes_From_Source (N)
4216 and then Is_Discrete_Type (Ltyp)
4217 and then Compile_Time_Known_Value (Type_High_Bound (Ltyp))
4218 and then Compile_Time_Known_Value (Type_Low_Bound (Ltyp))
4219 and then Compile_Time_Known_Value (Lo)
4220 and then Compile_Time_Known_Value (Hi)
4221 and then Expr_Value (Type_High_Bound (Ltyp)) = Expr_Value (Hi)
4222 and then Expr_Value (Type_Low_Bound (Ltyp)) = Expr_Value (Lo)
4224 -- Kill warnings in instances, since they may be cases where we
4225 -- have a test in the generic that makes sense with some types
4226 -- and not with other types.
4228 and then not In_Instance
4230 Substitute_Valid_Check;
4234 -- If we have an explicit range, do a bit of optimization based
4235 -- on range analysis (we may be able to kill one or both checks).
4237 Lcheck := Compile_Time_Compare (Lop, Lo, Assume_Valid => False);
4238 Ucheck := Compile_Time_Compare (Lop, Hi, Assume_Valid => False);
4240 -- If either check is known to fail, replace result by False since
4241 -- the other check does not matter. Preserve the static flag for
4242 -- legality checks, because we are constant-folding beyond RM 4.9.
4244 if Lcheck = LT or else Ucheck = GT then
4246 Error_Msg_N ("?range test optimized away", N);
4247 Error_Msg_N ("\?value is known to be out of range", N);
4251 New_Reference_To (Standard_False, Loc));
4252 Analyze_And_Resolve (N, Rtyp);
4253 Set_Is_Static_Expression (N, Static);
4257 -- If both checks are known to succeed, replace result by True,
4258 -- since we know we are in range.
4260 elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then
4262 Error_Msg_N ("?range test optimized away", N);
4263 Error_Msg_N ("\?value is known to be in range", N);
4267 New_Reference_To (Standard_True, Loc));
4268 Analyze_And_Resolve (N, Rtyp);
4269 Set_Is_Static_Expression (N, Static);
4273 -- If lower bound check succeeds and upper bound check is not
4274 -- known to succeed or fail, then replace the range check with
4275 -- a comparison against the upper bound.
4277 elsif Lcheck in Compare_GE then
4278 if Warn2 and then not In_Instance then
4279 Error_Msg_N ("?lower bound test optimized away", Lo);
4280 Error_Msg_N ("\?value is known to be in range", Lo);
4286 Right_Opnd => High_Bound (Rop)));
4287 Analyze_And_Resolve (N, Rtyp);
4291 -- If upper bound check succeeds and lower bound check is not
4292 -- known to succeed or fail, then replace the range check with
4293 -- a comparison against the lower bound.
4295 elsif Ucheck in Compare_LE then
4296 if Warn2 and then not In_Instance then
4297 Error_Msg_N ("?upper bound test optimized away", Hi);
4298 Error_Msg_N ("\?value is known to be in range", Hi);
4304 Right_Opnd => Low_Bound (Rop)));
4305 Analyze_And_Resolve (N, Rtyp);
4310 -- We couldn't optimize away the range check, but there is one
4311 -- more issue. If we are checking constant conditionals, then we
4312 -- see if we can determine the outcome assuming everything is
4313 -- valid, and if so give an appropriate warning.
4315 if Warn1 and then not Assume_No_Invalid_Values then
4316 Lcheck := Compile_Time_Compare (Lop, Lo, Assume_Valid => True);
4317 Ucheck := Compile_Time_Compare (Lop, Hi, Assume_Valid => True);
4319 -- Result is out of range for valid value
4321 if Lcheck = LT or else Ucheck = GT then
4323 ("?value can only be in range if it is invalid", N);
4325 -- Result is in range for valid value
4327 elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then
4329 ("?value can only be out of range if it is invalid", N);
4331 -- Lower bound check succeeds if value is valid
4333 elsif Warn2 and then Lcheck in Compare_GE then
4335 ("?lower bound check only fails if it is invalid", Lo);
4337 -- Upper bound check succeeds if value is valid
4339 elsif Warn2 and then Ucheck in Compare_LE then
4341 ("?upper bound check only fails for invalid values", Hi);
4346 -- For all other cases of an explicit range, nothing to be done
4350 -- Here right operand is a subtype mark
4354 Typ : Entity_Id := Etype (Rop);
4355 Is_Acc : constant Boolean := Is_Access_Type (Typ);
4356 Obj : Node_Id := Lop;
4357 Cond : Node_Id := Empty;
4360 Remove_Side_Effects (Obj);
4362 -- For tagged type, do tagged membership operation
4364 if Is_Tagged_Type (Typ) then
4366 -- No expansion will be performed when VM_Target, as the VM
4367 -- back-ends will handle the membership tests directly (tags
4368 -- are not explicitly represented in Java objects, so the
4369 -- normal tagged membership expansion is not what we want).
4371 if Tagged_Type_Expansion then
4372 Rewrite (N, Tagged_Membership (N));
4373 Analyze_And_Resolve (N, Rtyp);
4378 -- If type is scalar type, rewrite as x in t'first .. t'last.
4379 -- This reason we do this is that the bounds may have the wrong
4380 -- type if they come from the original type definition. Also this
4381 -- way we get all the processing above for an explicit range.
4383 elsif Is_Scalar_Type (Typ) then
4387 Make_Attribute_Reference (Loc,
4388 Attribute_Name => Name_First,
4389 Prefix => New_Reference_To (Typ, Loc)),
4392 Make_Attribute_Reference (Loc,
4393 Attribute_Name => Name_Last,
4394 Prefix => New_Reference_To (Typ, Loc))));
4395 Analyze_And_Resolve (N, Rtyp);
4398 -- Ada 2005 (AI-216): Program_Error is raised when evaluating
4399 -- a membership test if the subtype mark denotes a constrained
4400 -- Unchecked_Union subtype and the expression lacks inferable
4403 elsif Is_Unchecked_Union (Base_Type (Typ))
4404 and then Is_Constrained (Typ)
4405 and then not Has_Inferable_Discriminants (Lop)
4408 Make_Raise_Program_Error (Loc,
4409 Reason => PE_Unchecked_Union_Restriction));
4411 -- Prevent Gigi from generating incorrect code by rewriting
4412 -- the test as a standard False.
4415 New_Occurrence_Of (Standard_False, Loc));
4420 -- Here we have a non-scalar type
4423 Typ := Designated_Type (Typ);
4426 if not Is_Constrained (Typ) then
4428 New_Reference_To (Standard_True, Loc));
4429 Analyze_And_Resolve (N, Rtyp);
4431 -- For the constrained array case, we have to check the subscripts
4432 -- for an exact match if the lengths are non-zero (the lengths
4433 -- must match in any case).
4435 elsif Is_Array_Type (Typ) then
4437 Check_Subscripts : declare
4438 function Construct_Attribute_Reference
4441 Dim : Nat) return Node_Id;
4442 -- Build attribute reference E'Nam(Dim)
4444 -----------------------------------
4445 -- Construct_Attribute_Reference --
4446 -----------------------------------
4448 function Construct_Attribute_Reference
4451 Dim : Nat) return Node_Id
4455 Make_Attribute_Reference (Loc,
4457 Attribute_Name => Nam,
4458 Expressions => New_List (
4459 Make_Integer_Literal (Loc, Dim)));
4460 end Construct_Attribute_Reference;
4462 -- Start of processing for Check_Subscripts
4465 for J in 1 .. Number_Dimensions (Typ) loop
4466 Evolve_And_Then (Cond,
4469 Construct_Attribute_Reference
4470 (Duplicate_Subexpr_No_Checks (Obj),
4473 Construct_Attribute_Reference
4474 (New_Occurrence_Of (Typ, Loc), Name_First, J)));
4476 Evolve_And_Then (Cond,
4479 Construct_Attribute_Reference
4480 (Duplicate_Subexpr_No_Checks (Obj),
4483 Construct_Attribute_Reference
4484 (New_Occurrence_Of (Typ, Loc), Name_Last, J)));
4493 Right_Opnd => Make_Null (Loc)),
4494 Right_Opnd => Cond);
4498 Analyze_And_Resolve (N, Rtyp);
4499 end Check_Subscripts;
4501 -- These are the cases where constraint checks may be required,
4502 -- e.g. records with possible discriminants
4505 -- Expand the test into a series of discriminant comparisons.
4506 -- The expression that is built is the negation of the one that
4507 -- is used for checking discriminant constraints.
4509 Obj := Relocate_Node (Left_Opnd (N));
4511 if Has_Discriminants (Typ) then
4512 Cond := Make_Op_Not (Loc,
4513 Right_Opnd => Build_Discriminant_Checks (Obj, Typ));
4516 Cond := Make_Or_Else (Loc,
4520 Right_Opnd => Make_Null (Loc)),
4521 Right_Opnd => Cond);
4525 Cond := New_Occurrence_Of (Standard_True, Loc);
4529 Analyze_And_Resolve (N, Rtyp);
4535 --------------------------------
4536 -- Expand_N_Indexed_Component --
4537 --------------------------------
4539 procedure Expand_N_Indexed_Component (N : Node_Id) is
4540 Loc : constant Source_Ptr := Sloc (N);
4541 Typ : constant Entity_Id := Etype (N);
4542 P : constant Node_Id := Prefix (N);
4543 T : constant Entity_Id := Etype (P);
4546 -- A special optimization, if we have an indexed component that is
4547 -- selecting from a slice, then we can eliminate the slice, since, for
4548 -- example, x (i .. j)(k) is identical to x(k). The only difference is
4549 -- the range check required by the slice. The range check for the slice
4550 -- itself has already been generated. The range check for the
4551 -- subscripting operation is ensured by converting the subject to
4552 -- the subtype of the slice.
4554 -- This optimization not only generates better code, avoiding slice
4555 -- messing especially in the packed case, but more importantly bypasses
4556 -- some problems in handling this peculiar case, for example, the issue
4557 -- of dealing specially with object renamings.
4559 if Nkind (P) = N_Slice then
4561 Make_Indexed_Component (Loc,
4562 Prefix => Prefix (P),
4563 Expressions => New_List (
4565 (Etype (First_Index (Etype (P))),
4566 First (Expressions (N))))));
4567 Analyze_And_Resolve (N, Typ);
4571 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
4572 -- function, then additional actuals must be passed.
4574 if Ada_Version >= Ada_05
4575 and then Is_Build_In_Place_Function_Call (P)
4577 Make_Build_In_Place_Call_In_Anonymous_Context (P);
4580 -- If the prefix is an access type, then we unconditionally rewrite if
4581 -- as an explicit deference. This simplifies processing for several
4582 -- cases, including packed array cases and certain cases in which checks
4583 -- must be generated. We used to try to do this only when it was
4584 -- necessary, but it cleans up the code to do it all the time.
4586 if Is_Access_Type (T) then
4587 Insert_Explicit_Dereference (P);
4588 Analyze_And_Resolve (P, Designated_Type (T));
4591 -- Generate index and validity checks
4593 Generate_Index_Checks (N);
4595 if Validity_Checks_On and then Validity_Check_Subscripts then
4596 Apply_Subscript_Validity_Checks (N);
4599 -- All done for the non-packed case
4601 if not Is_Packed (Etype (Prefix (N))) then
4605 -- For packed arrays that are not bit-packed (i.e. the case of an array
4606 -- with one or more index types with a non-contiguous enumeration type),
4607 -- we can always use the normal packed element get circuit.
4609 if not Is_Bit_Packed_Array (Etype (Prefix (N))) then
4610 Expand_Packed_Element_Reference (N);
4614 -- For a reference to a component of a bit packed array, we have to
4615 -- convert it to a reference to the corresponding Packed_Array_Type.
4616 -- We only want to do this for simple references, and not for:
4618 -- Left side of assignment, or prefix of left side of assignment, or
4619 -- prefix of the prefix, to handle packed arrays of packed arrays,
4620 -- This case is handled in Exp_Ch5.Expand_N_Assignment_Statement
4622 -- Renaming objects in renaming associations
4623 -- This case is handled when a use of the renamed variable occurs
4625 -- Actual parameters for a procedure call
4626 -- This case is handled in Exp_Ch6.Expand_Actuals
4628 -- The second expression in a 'Read attribute reference
4630 -- The prefix of an address or size attribute reference
4632 -- The following circuit detects these exceptions
4635 Child : Node_Id := N;
4636 Parnt : Node_Id := Parent (N);
4640 if Nkind (Parnt) = N_Unchecked_Expression then
4643 elsif Nkind_In (Parnt, N_Object_Renaming_Declaration,
4644 N_Procedure_Call_Statement)
4645 or else (Nkind (Parnt) = N_Parameter_Association
4647 Nkind (Parent (Parnt)) = N_Procedure_Call_Statement)
4651 elsif Nkind (Parnt) = N_Attribute_Reference
4652 and then (Attribute_Name (Parnt) = Name_Address
4654 Attribute_Name (Parnt) = Name_Size)
4655 and then Prefix (Parnt) = Child
4659 elsif Nkind (Parnt) = N_Assignment_Statement
4660 and then Name (Parnt) = Child
4664 -- If the expression is an index of an indexed component, it must
4665 -- be expanded regardless of context.
4667 elsif Nkind (Parnt) = N_Indexed_Component
4668 and then Child /= Prefix (Parnt)
4670 Expand_Packed_Element_Reference (N);
4673 elsif Nkind (Parent (Parnt)) = N_Assignment_Statement
4674 and then Name (Parent (Parnt)) = Parnt
4678 elsif Nkind (Parnt) = N_Attribute_Reference
4679 and then Attribute_Name (Parnt) = Name_Read
4680 and then Next (First (Expressions (Parnt))) = Child
4684 elsif Nkind_In (Parnt, N_Indexed_Component, N_Selected_Component)
4685 and then Prefix (Parnt) = Child
4690 Expand_Packed_Element_Reference (N);
4694 -- Keep looking up tree for unchecked expression, or if we are the
4695 -- prefix of a possible assignment left side.
4698 Parnt := Parent (Child);
4701 end Expand_N_Indexed_Component;
4703 ---------------------
4704 -- Expand_N_Not_In --
4705 ---------------------
4707 -- Replace a not in b by not (a in b) so that the expansions for (a in b)
4708 -- can be done. This avoids needing to duplicate this expansion code.
4710 procedure Expand_N_Not_In (N : Node_Id) is
4711 Loc : constant Source_Ptr := Sloc (N);
4712 Typ : constant Entity_Id := Etype (N);
4713 Cfs : constant Boolean := Comes_From_Source (N);
4720 Left_Opnd => Left_Opnd (N),
4721 Right_Opnd => Right_Opnd (N))));
4723 -- We want this to appear as coming from source if original does (see
4724 -- transformations in Expand_N_In).
4726 Set_Comes_From_Source (N, Cfs);
4727 Set_Comes_From_Source (Right_Opnd (N), Cfs);
4729 -- Now analyze transformed node
4731 Analyze_And_Resolve (N, Typ);
4732 end Expand_N_Not_In;
4738 -- The only replacement required is for the case of a null of type that is
4739 -- an access to protected subprogram. We represent such access values as a
4740 -- record, and so we must replace the occurrence of null by the equivalent
4741 -- record (with a null address and a null pointer in it), so that the
4742 -- backend creates the proper value.
4744 procedure Expand_N_Null (N : Node_Id) is
4745 Loc : constant Source_Ptr := Sloc (N);
4746 Typ : constant Entity_Id := Etype (N);
4750 if Is_Access_Protected_Subprogram_Type (Typ) then
4752 Make_Aggregate (Loc,
4753 Expressions => New_List (
4754 New_Occurrence_Of (RTE (RE_Null_Address), Loc),
4758 Analyze_And_Resolve (N, Equivalent_Type (Typ));
4760 -- For subsequent semantic analysis, the node must retain its type.
4761 -- Gigi in any case replaces this type by the corresponding record
4762 -- type before processing the node.
4768 when RE_Not_Available =>
4772 ---------------------
4773 -- Expand_N_Op_Abs --
4774 ---------------------
4776 procedure Expand_N_Op_Abs (N : Node_Id) is
4777 Loc : constant Source_Ptr := Sloc (N);
4778 Expr : constant Node_Id := Right_Opnd (N);
4781 Unary_Op_Validity_Checks (N);
4783 -- Deal with software overflow checking
4785 if not Backend_Overflow_Checks_On_Target
4786 and then Is_Signed_Integer_Type (Etype (N))
4787 and then Do_Overflow_Check (N)
4789 -- The only case to worry about is when the argument is equal to the
4790 -- largest negative number, so what we do is to insert the check:
4792 -- [constraint_error when Expr = typ'Base'First]
4794 -- with the usual Duplicate_Subexpr use coding for expr
4797 Make_Raise_Constraint_Error (Loc,
4800 Left_Opnd => Duplicate_Subexpr (Expr),
4802 Make_Attribute_Reference (Loc,
4804 New_Occurrence_Of (Base_Type (Etype (Expr)), Loc),
4805 Attribute_Name => Name_First)),
4806 Reason => CE_Overflow_Check_Failed));
4809 -- Vax floating-point types case
4811 if Vax_Float (Etype (N)) then
4812 Expand_Vax_Arith (N);
4814 end Expand_N_Op_Abs;
4816 ---------------------
4817 -- Expand_N_Op_Add --
4818 ---------------------
4820 procedure Expand_N_Op_Add (N : Node_Id) is
4821 Typ : constant Entity_Id := Etype (N);
4824 Binary_Op_Validity_Checks (N);
4826 -- N + 0 = 0 + N = N for integer types
4828 if Is_Integer_Type (Typ) then
4829 if Compile_Time_Known_Value (Right_Opnd (N))
4830 and then Expr_Value (Right_Opnd (N)) = Uint_0
4832 Rewrite (N, Left_Opnd (N));
4835 elsif Compile_Time_Known_Value (Left_Opnd (N))
4836 and then Expr_Value (Left_Opnd (N)) = Uint_0
4838 Rewrite (N, Right_Opnd (N));
4843 -- Arithmetic overflow checks for signed integer/fixed point types
4845 if Is_Signed_Integer_Type (Typ)
4846 or else Is_Fixed_Point_Type (Typ)
4848 Apply_Arithmetic_Overflow_Check (N);
4851 -- Vax floating-point types case
4853 elsif Vax_Float (Typ) then
4854 Expand_Vax_Arith (N);
4856 end Expand_N_Op_Add;
4858 ---------------------
4859 -- Expand_N_Op_And --
4860 ---------------------
4862 procedure Expand_N_Op_And (N : Node_Id) is
4863 Typ : constant Entity_Id := Etype (N);
4866 Binary_Op_Validity_Checks (N);
4868 if Is_Array_Type (Etype (N)) then
4869 Expand_Boolean_Operator (N);
4871 elsif Is_Boolean_Type (Etype (N)) then
4872 Adjust_Condition (Left_Opnd (N));
4873 Adjust_Condition (Right_Opnd (N));
4874 Set_Etype (N, Standard_Boolean);
4875 Adjust_Result_Type (N, Typ);
4877 end Expand_N_Op_And;
4879 ------------------------
4880 -- Expand_N_Op_Concat --
4881 ------------------------
4883 procedure Expand_N_Op_Concat (N : Node_Id) is
4885 -- List of operands to be concatenated
4888 -- Node which is to be replaced by the result of concatenating the nodes
4889 -- in the list Opnds.
4892 -- Ensure validity of both operands
4894 Binary_Op_Validity_Checks (N);
4896 -- If we are the left operand of a concatenation higher up the tree,
4897 -- then do nothing for now, since we want to deal with a series of
4898 -- concatenations as a unit.
4900 if Nkind (Parent (N)) = N_Op_Concat
4901 and then N = Left_Opnd (Parent (N))
4906 -- We get here with a concatenation whose left operand may be a
4907 -- concatenation itself with a consistent type. We need to process
4908 -- these concatenation operands from left to right, which means
4909 -- from the deepest node in the tree to the highest node.
4912 while Nkind (Left_Opnd (Cnode)) = N_Op_Concat loop
4913 Cnode := Left_Opnd (Cnode);
4916 -- Now Opnd is the deepest Opnd, and its parents are the concatenation
4917 -- nodes above, so now we process bottom up, doing the operations. We
4918 -- gather a string that is as long as possible up to five operands
4920 -- The outer loop runs more than once if more than one concatenation
4921 -- type is involved.
4924 Opnds := New_List (Left_Opnd (Cnode), Right_Opnd (Cnode));
4925 Set_Parent (Opnds, N);
4927 -- The inner loop gathers concatenation operands
4929 Inner : while Cnode /= N
4930 and then Base_Type (Etype (Cnode)) =
4931 Base_Type (Etype (Parent (Cnode)))
4933 Cnode := Parent (Cnode);
4934 Append (Right_Opnd (Cnode), Opnds);
4937 Expand_Concatenate (Cnode, Opnds);
4939 exit Outer when Cnode = N;
4940 Cnode := Parent (Cnode);
4942 end Expand_N_Op_Concat;
4944 ------------------------
4945 -- Expand_N_Op_Divide --
4946 ------------------------
4948 procedure Expand_N_Op_Divide (N : Node_Id) is
4949 Loc : constant Source_Ptr := Sloc (N);
4950 Lopnd : constant Node_Id := Left_Opnd (N);
4951 Ropnd : constant Node_Id := Right_Opnd (N);
4952 Ltyp : constant Entity_Id := Etype (Lopnd);
4953 Rtyp : constant Entity_Id := Etype (Ropnd);
4954 Typ : Entity_Id := Etype (N);
4955 Rknow : constant Boolean := Is_Integer_Type (Typ)
4957 Compile_Time_Known_Value (Ropnd);
4961 Binary_Op_Validity_Checks (N);
4964 Rval := Expr_Value (Ropnd);
4967 -- N / 1 = N for integer types
4969 if Rknow and then Rval = Uint_1 then
4974 -- Convert x / 2 ** y to Shift_Right (x, y). Note that the fact that
4975 -- Is_Power_Of_2_For_Shift is set means that we know that our left
4976 -- operand is an unsigned integer, as required for this to work.
4978 if Nkind (Ropnd) = N_Op_Expon
4979 and then Is_Power_Of_2_For_Shift (Ropnd)
4981 -- We cannot do this transformation in configurable run time mode if we
4982 -- have 64-bit -- integers and long shifts are not available.
4986 or else Support_Long_Shifts_On_Target)
4989 Make_Op_Shift_Right (Loc,
4992 Convert_To (Standard_Natural, Right_Opnd (Ropnd))));
4993 Analyze_And_Resolve (N, Typ);
4997 -- Do required fixup of universal fixed operation
4999 if Typ = Universal_Fixed then
5000 Fixup_Universal_Fixed_Operation (N);
5004 -- Divisions with fixed-point results
5006 if Is_Fixed_Point_Type (Typ) then
5008 -- No special processing if Treat_Fixed_As_Integer is set, since
5009 -- from a semantic point of view such operations are simply integer
5010 -- operations and will be treated that way.
5012 if not Treat_Fixed_As_Integer (N) then
5013 if Is_Integer_Type (Rtyp) then
5014 Expand_Divide_Fixed_By_Integer_Giving_Fixed (N);
5016 Expand_Divide_Fixed_By_Fixed_Giving_Fixed (N);
5020 -- Other cases of division of fixed-point operands. Again we exclude the
5021 -- case where Treat_Fixed_As_Integer is set.
5023 elsif (Is_Fixed_Point_Type (Ltyp) or else
5024 Is_Fixed_Point_Type (Rtyp))
5025 and then not Treat_Fixed_As_Integer (N)
5027 if Is_Integer_Type (Typ) then
5028 Expand_Divide_Fixed_By_Fixed_Giving_Integer (N);
5030 pragma Assert (Is_Floating_Point_Type (Typ));
5031 Expand_Divide_Fixed_By_Fixed_Giving_Float (N);
5034 -- Mixed-mode operations can appear in a non-static universal context,
5035 -- in which case the integer argument must be converted explicitly.
5037 elsif Typ = Universal_Real
5038 and then Is_Integer_Type (Rtyp)
5041 Convert_To (Universal_Real, Relocate_Node (Ropnd)));
5043 Analyze_And_Resolve (Ropnd, Universal_Real);
5045 elsif Typ = Universal_Real
5046 and then Is_Integer_Type (Ltyp)
5049 Convert_To (Universal_Real, Relocate_Node (Lopnd)));
5051 Analyze_And_Resolve (Lopnd, Universal_Real);
5053 -- Non-fixed point cases, do integer zero divide and overflow checks
5055 elsif Is_Integer_Type (Typ) then
5056 Apply_Divide_Check (N);
5058 -- Check for 64-bit division available, or long shifts if the divisor
5059 -- is a small power of 2 (since such divides will be converted into
5062 if Esize (Ltyp) > 32
5063 and then not Support_64_Bit_Divides_On_Target
5066 or else not Support_Long_Shifts_On_Target
5067 or else (Rval /= Uint_2 and then
5068 Rval /= Uint_4 and then
5069 Rval /= Uint_8 and then
5070 Rval /= Uint_16 and then
5071 Rval /= Uint_32 and then
5074 Error_Msg_CRT ("64-bit division", N);
5077 -- Deal with Vax_Float
5079 elsif Vax_Float (Typ) then
5080 Expand_Vax_Arith (N);
5083 end Expand_N_Op_Divide;
5085 --------------------
5086 -- Expand_N_Op_Eq --
5087 --------------------
5089 procedure Expand_N_Op_Eq (N : Node_Id) is
5090 Loc : constant Source_Ptr := Sloc (N);
5091 Typ : constant Entity_Id := Etype (N);
5092 Lhs : constant Node_Id := Left_Opnd (N);
5093 Rhs : constant Node_Id := Right_Opnd (N);
5094 Bodies : constant List_Id := New_List;
5095 A_Typ : constant Entity_Id := Etype (Lhs);
5097 Typl : Entity_Id := A_Typ;
5098 Op_Name : Entity_Id;
5101 procedure Build_Equality_Call (Eq : Entity_Id);
5102 -- If a constructed equality exists for the type or for its parent,
5103 -- build and analyze call, adding conversions if the operation is
5106 function Has_Unconstrained_UU_Component (Typ : Node_Id) return Boolean;
5107 -- Determines whether a type has a subcomponent of an unconstrained
5108 -- Unchecked_Union subtype. Typ is a record type.
5110 -------------------------
5111 -- Build_Equality_Call --
5112 -------------------------
5114 procedure Build_Equality_Call (Eq : Entity_Id) is
5115 Op_Type : constant Entity_Id := Etype (First_Formal (Eq));
5116 L_Exp : Node_Id := Relocate_Node (Lhs);
5117 R_Exp : Node_Id := Relocate_Node (Rhs);
5120 if Base_Type (Op_Type) /= Base_Type (A_Typ)
5121 and then not Is_Class_Wide_Type (A_Typ)
5123 L_Exp := OK_Convert_To (Op_Type, L_Exp);
5124 R_Exp := OK_Convert_To (Op_Type, R_Exp);
5127 -- If we have an Unchecked_Union, we need to add the inferred
5128 -- discriminant values as actuals in the function call. At this
5129 -- point, the expansion has determined that both operands have
5130 -- inferable discriminants.
5132 if Is_Unchecked_Union (Op_Type) then
5134 Lhs_Type : constant Node_Id := Etype (L_Exp);
5135 Rhs_Type : constant Node_Id := Etype (R_Exp);
5136 Lhs_Discr_Val : Node_Id;
5137 Rhs_Discr_Val : Node_Id;
5140 -- Per-object constrained selected components require special
5141 -- attention. If the enclosing scope of the component is an
5142 -- Unchecked_Union, we cannot reference its discriminants
5143 -- directly. This is why we use the two extra parameters of
5144 -- the equality function of the enclosing Unchecked_Union.
5146 -- type UU_Type (Discr : Integer := 0) is
5149 -- pragma Unchecked_Union (UU_Type);
5151 -- 1. Unchecked_Union enclosing record:
5153 -- type Enclosing_UU_Type (Discr : Integer := 0) is record
5155 -- Comp : UU_Type (Discr);
5157 -- end Enclosing_UU_Type;
5158 -- pragma Unchecked_Union (Enclosing_UU_Type);
5160 -- Obj1 : Enclosing_UU_Type;
5161 -- Obj2 : Enclosing_UU_Type (1);
5163 -- [. . .] Obj1 = Obj2 [. . .]
5167 -- if not (uu_typeEQ (obj1.comp, obj2.comp, a, b)) then
5169 -- A and B are the formal parameters of the equality function
5170 -- of Enclosing_UU_Type. The function always has two extra
5171 -- formals to capture the inferred discriminant values.
5173 -- 2. Non-Unchecked_Union enclosing record:
5176 -- Enclosing_Non_UU_Type (Discr : Integer := 0)
5179 -- Comp : UU_Type (Discr);
5181 -- end Enclosing_Non_UU_Type;
5183 -- Obj1 : Enclosing_Non_UU_Type;
5184 -- Obj2 : Enclosing_Non_UU_Type (1);
5186 -- ... Obj1 = Obj2 ...
5190 -- if not (uu_typeEQ (obj1.comp, obj2.comp,
5191 -- obj1.discr, obj2.discr)) then
5193 -- In this case we can directly reference the discriminants of
5194 -- the enclosing record.
5198 if Nkind (Lhs) = N_Selected_Component
5199 and then Has_Per_Object_Constraint
5200 (Entity (Selector_Name (Lhs)))
5202 -- Enclosing record is an Unchecked_Union, use formal A
5204 if Is_Unchecked_Union (Scope
5205 (Entity (Selector_Name (Lhs))))
5208 Make_Identifier (Loc,
5211 -- Enclosing record is of a non-Unchecked_Union type, it is
5212 -- possible to reference the discriminant.
5216 Make_Selected_Component (Loc,
5217 Prefix => Prefix (Lhs),
5220 (Get_Discriminant_Value
5221 (First_Discriminant (Lhs_Type),
5223 Stored_Constraint (Lhs_Type))));
5226 -- Comment needed here ???
5229 -- Infer the discriminant value
5233 (Get_Discriminant_Value
5234 (First_Discriminant (Lhs_Type),
5236 Stored_Constraint (Lhs_Type)));
5241 if Nkind (Rhs) = N_Selected_Component
5242 and then Has_Per_Object_Constraint
5243 (Entity (Selector_Name (Rhs)))
5245 if Is_Unchecked_Union
5246 (Scope (Entity (Selector_Name (Rhs))))
5249 Make_Identifier (Loc,
5254 Make_Selected_Component (Loc,
5255 Prefix => Prefix (Rhs),
5257 New_Copy (Get_Discriminant_Value (
5258 First_Discriminant (Rhs_Type),
5260 Stored_Constraint (Rhs_Type))));
5265 New_Copy (Get_Discriminant_Value (
5266 First_Discriminant (Rhs_Type),
5268 Stored_Constraint (Rhs_Type)));
5273 Make_Function_Call (Loc,
5274 Name => New_Reference_To (Eq, Loc),
5275 Parameter_Associations => New_List (
5282 -- Normal case, not an unchecked union
5286 Make_Function_Call (Loc,
5287 Name => New_Reference_To (Eq, Loc),
5288 Parameter_Associations => New_List (L_Exp, R_Exp)));
5291 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5292 end Build_Equality_Call;
5294 ------------------------------------
5295 -- Has_Unconstrained_UU_Component --
5296 ------------------------------------
5298 function Has_Unconstrained_UU_Component
5299 (Typ : Node_Id) return Boolean
5301 Tdef : constant Node_Id :=
5302 Type_Definition (Declaration_Node (Base_Type (Typ)));
5306 function Component_Is_Unconstrained_UU
5307 (Comp : Node_Id) return Boolean;
5308 -- Determines whether the subtype of the component is an
5309 -- unconstrained Unchecked_Union.
5311 function Variant_Is_Unconstrained_UU
5312 (Variant : Node_Id) return Boolean;
5313 -- Determines whether a component of the variant has an unconstrained
5314 -- Unchecked_Union subtype.
5316 -----------------------------------
5317 -- Component_Is_Unconstrained_UU --
5318 -----------------------------------
5320 function Component_Is_Unconstrained_UU
5321 (Comp : Node_Id) return Boolean
5324 if Nkind (Comp) /= N_Component_Declaration then
5329 Sindic : constant Node_Id :=
5330 Subtype_Indication (Component_Definition (Comp));
5333 -- Unconstrained nominal type. In the case of a constraint
5334 -- present, the node kind would have been N_Subtype_Indication.
5336 if Nkind (Sindic) = N_Identifier then
5337 return Is_Unchecked_Union (Base_Type (Etype (Sindic)));
5342 end Component_Is_Unconstrained_UU;
5344 ---------------------------------
5345 -- Variant_Is_Unconstrained_UU --
5346 ---------------------------------
5348 function Variant_Is_Unconstrained_UU
5349 (Variant : Node_Id) return Boolean
5351 Clist : constant Node_Id := Component_List (Variant);
5354 if Is_Empty_List (Component_Items (Clist)) then
5358 -- We only need to test one component
5361 Comp : Node_Id := First (Component_Items (Clist));
5364 while Present (Comp) loop
5365 if Component_Is_Unconstrained_UU (Comp) then
5373 -- None of the components withing the variant were of
5374 -- unconstrained Unchecked_Union type.
5377 end Variant_Is_Unconstrained_UU;
5379 -- Start of processing for Has_Unconstrained_UU_Component
5382 if Null_Present (Tdef) then
5386 Clist := Component_List (Tdef);
5387 Vpart := Variant_Part (Clist);
5389 -- Inspect available components
5391 if Present (Component_Items (Clist)) then
5393 Comp : Node_Id := First (Component_Items (Clist));
5396 while Present (Comp) loop
5398 -- One component is sufficient
5400 if Component_Is_Unconstrained_UU (Comp) then
5409 -- Inspect available components withing variants
5411 if Present (Vpart) then
5413 Variant : Node_Id := First (Variants (Vpart));
5416 while Present (Variant) loop
5418 -- One component within a variant is sufficient
5420 if Variant_Is_Unconstrained_UU (Variant) then
5429 -- Neither the available components, nor the components inside the
5430 -- variant parts were of an unconstrained Unchecked_Union subtype.
5433 end Has_Unconstrained_UU_Component;
5435 -- Start of processing for Expand_N_Op_Eq
5438 Binary_Op_Validity_Checks (N);
5440 if Ekind (Typl) = E_Private_Type then
5441 Typl := Underlying_Type (Typl);
5442 elsif Ekind (Typl) = E_Private_Subtype then
5443 Typl := Underlying_Type (Base_Type (Typl));
5448 -- It may happen in error situations that the underlying type is not
5449 -- set. The error will be detected later, here we just defend the
5456 Typl := Base_Type (Typl);
5458 -- Boolean types (requiring handling of non-standard case)
5460 if Is_Boolean_Type (Typl) then
5461 Adjust_Condition (Left_Opnd (N));
5462 Adjust_Condition (Right_Opnd (N));
5463 Set_Etype (N, Standard_Boolean);
5464 Adjust_Result_Type (N, Typ);
5468 elsif Is_Array_Type (Typl) then
5470 -- If we are doing full validity checking, and it is possible for the
5471 -- array elements to be invalid then expand out array comparisons to
5472 -- make sure that we check the array elements.
5474 if Validity_Check_Operands
5475 and then not Is_Known_Valid (Component_Type (Typl))
5478 Save_Force_Validity_Checks : constant Boolean :=
5479 Force_Validity_Checks;
5481 Force_Validity_Checks := True;
5483 Expand_Array_Equality
5485 Relocate_Node (Lhs),
5486 Relocate_Node (Rhs),
5489 Insert_Actions (N, Bodies);
5490 Analyze_And_Resolve (N, Standard_Boolean);
5491 Force_Validity_Checks := Save_Force_Validity_Checks;
5494 -- Packed case where both operands are known aligned
5496 elsif Is_Bit_Packed_Array (Typl)
5497 and then not Is_Possibly_Unaligned_Object (Lhs)
5498 and then not Is_Possibly_Unaligned_Object (Rhs)
5500 Expand_Packed_Eq (N);
5502 -- Where the component type is elementary we can use a block bit
5503 -- comparison (if supported on the target) exception in the case
5504 -- of floating-point (negative zero issues require element by
5505 -- element comparison), and atomic types (where we must be sure
5506 -- to load elements independently) and possibly unaligned arrays.
5508 elsif Is_Elementary_Type (Component_Type (Typl))
5509 and then not Is_Floating_Point_Type (Component_Type (Typl))
5510 and then not Is_Atomic (Component_Type (Typl))
5511 and then not Is_Possibly_Unaligned_Object (Lhs)
5512 and then not Is_Possibly_Unaligned_Object (Rhs)
5513 and then Support_Composite_Compare_On_Target
5517 -- For composite and floating-point cases, expand equality loop to
5518 -- make sure of using proper comparisons for tagged types, and
5519 -- correctly handling the floating-point case.
5523 Expand_Array_Equality
5525 Relocate_Node (Lhs),
5526 Relocate_Node (Rhs),
5529 Insert_Actions (N, Bodies, Suppress => All_Checks);
5530 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5535 elsif Is_Record_Type (Typl) then
5537 -- For tagged types, use the primitive "="
5539 if Is_Tagged_Type (Typl) then
5541 -- No need to do anything else compiling under restriction
5542 -- No_Dispatching_Calls. During the semantic analysis we
5543 -- already notified such violation.
5545 if Restriction_Active (No_Dispatching_Calls) then
5549 -- If this is derived from an untagged private type completed with
5550 -- a tagged type, it does not have a full view, so we use the
5551 -- primitive operations of the private type. This check should no
5552 -- longer be necessary when these types get their full views???
5554 if Is_Private_Type (A_Typ)
5555 and then not Is_Tagged_Type (A_Typ)
5556 and then Is_Derived_Type (A_Typ)
5557 and then No (Full_View (A_Typ))
5559 -- Search for equality operation, checking that the operands
5560 -- have the same type. Note that we must find a matching entry,
5561 -- or something is very wrong!
5563 Prim := First_Elmt (Collect_Primitive_Operations (A_Typ));
5565 while Present (Prim) loop
5566 exit when Chars (Node (Prim)) = Name_Op_Eq
5567 and then Etype (First_Formal (Node (Prim))) =
5568 Etype (Next_Formal (First_Formal (Node (Prim))))
5570 Base_Type (Etype (Node (Prim))) = Standard_Boolean;
5575 pragma Assert (Present (Prim));
5576 Op_Name := Node (Prim);
5578 -- Find the type's predefined equality or an overriding
5579 -- user- defined equality. The reason for not simply calling
5580 -- Find_Prim_Op here is that there may be a user-defined
5581 -- overloaded equality op that precedes the equality that we want,
5582 -- so we have to explicitly search (e.g., there could be an
5583 -- equality with two different parameter types).
5586 if Is_Class_Wide_Type (Typl) then
5587 Typl := Root_Type (Typl);
5590 Prim := First_Elmt (Primitive_Operations (Typl));
5591 while Present (Prim) loop
5592 exit when Chars (Node (Prim)) = Name_Op_Eq
5593 and then Etype (First_Formal (Node (Prim))) =
5594 Etype (Next_Formal (First_Formal (Node (Prim))))
5596 Base_Type (Etype (Node (Prim))) = Standard_Boolean;
5601 pragma Assert (Present (Prim));
5602 Op_Name := Node (Prim);
5605 Build_Equality_Call (Op_Name);
5607 -- Ada 2005 (AI-216): Program_Error is raised when evaluating the
5608 -- predefined equality operator for a type which has a subcomponent
5609 -- of an Unchecked_Union type whose nominal subtype is unconstrained.
5611 elsif Has_Unconstrained_UU_Component (Typl) then
5613 Make_Raise_Program_Error (Loc,
5614 Reason => PE_Unchecked_Union_Restriction));
5616 -- Prevent Gigi from generating incorrect code by rewriting the
5617 -- equality as a standard False.
5620 New_Occurrence_Of (Standard_False, Loc));
5622 elsif Is_Unchecked_Union (Typl) then
5624 -- If we can infer the discriminants of the operands, we make a
5625 -- call to the TSS equality function.
5627 if Has_Inferable_Discriminants (Lhs)
5629 Has_Inferable_Discriminants (Rhs)
5632 (TSS (Root_Type (Typl), TSS_Composite_Equality));
5635 -- Ada 2005 (AI-216): Program_Error is raised when evaluating
5636 -- the predefined equality operator for an Unchecked_Union type
5637 -- if either of the operands lack inferable discriminants.
5640 Make_Raise_Program_Error (Loc,
5641 Reason => PE_Unchecked_Union_Restriction));
5643 -- Prevent Gigi from generating incorrect code by rewriting
5644 -- the equality as a standard False.
5647 New_Occurrence_Of (Standard_False, Loc));
5651 -- If a type support function is present (for complex cases), use it
5653 elsif Present (TSS (Root_Type (Typl), TSS_Composite_Equality)) then
5655 (TSS (Root_Type (Typl), TSS_Composite_Equality));
5657 -- Otherwise expand the component by component equality. Note that
5658 -- we never use block-bit comparisons for records, because of the
5659 -- problems with gaps. The backend will often be able to recombine
5660 -- the separate comparisons that we generate here.
5663 Remove_Side_Effects (Lhs);
5664 Remove_Side_Effects (Rhs);
5666 Expand_Record_Equality (N, Typl, Lhs, Rhs, Bodies));
5668 Insert_Actions (N, Bodies, Suppress => All_Checks);
5669 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5673 -- Test if result is known at compile time
5675 Rewrite_Comparison (N);
5677 -- If we still have comparison for Vax_Float, process it
5679 if Vax_Float (Typl) and then Nkind (N) in N_Op_Compare then
5680 Expand_Vax_Comparison (N);
5685 -----------------------
5686 -- Expand_N_Op_Expon --
5687 -----------------------
5689 procedure Expand_N_Op_Expon (N : Node_Id) is
5690 Loc : constant Source_Ptr := Sloc (N);
5691 Typ : constant Entity_Id := Etype (N);
5692 Rtyp : constant Entity_Id := Root_Type (Typ);
5693 Base : constant Node_Id := Relocate_Node (Left_Opnd (N));
5694 Bastyp : constant Node_Id := Etype (Base);
5695 Exp : constant Node_Id := Relocate_Node (Right_Opnd (N));
5696 Exptyp : constant Entity_Id := Etype (Exp);
5697 Ovflo : constant Boolean := Do_Overflow_Check (N);
5706 Binary_Op_Validity_Checks (N);
5708 -- If either operand is of a private type, then we have the use of an
5709 -- intrinsic operator, and we get rid of the privateness, by using root
5710 -- types of underlying types for the actual operation. Otherwise the
5711 -- private types will cause trouble if we expand multiplications or
5712 -- shifts etc. We also do this transformation if the result type is
5713 -- different from the base type.
5715 if Is_Private_Type (Etype (Base))
5717 Is_Private_Type (Typ)
5719 Is_Private_Type (Exptyp)
5721 Rtyp /= Root_Type (Bastyp)
5724 Bt : constant Entity_Id := Root_Type (Underlying_Type (Bastyp));
5725 Et : constant Entity_Id := Root_Type (Underlying_Type (Exptyp));
5729 Unchecked_Convert_To (Typ,
5731 Left_Opnd => Unchecked_Convert_To (Bt, Base),
5732 Right_Opnd => Unchecked_Convert_To (Et, Exp))));
5733 Analyze_And_Resolve (N, Typ);
5738 -- Test for case of known right argument
5740 if Compile_Time_Known_Value (Exp) then
5741 Expv := Expr_Value (Exp);
5743 -- We only fold small non-negative exponents. You might think we
5744 -- could fold small negative exponents for the real case, but we
5745 -- can't because we are required to raise Constraint_Error for
5746 -- the case of 0.0 ** (negative) even if Machine_Overflows = False.
5747 -- See ACVC test C4A012B.
5749 if Expv >= 0 and then Expv <= 4 then
5751 -- X ** 0 = 1 (or 1.0)
5755 -- Call Remove_Side_Effects to ensure that any side effects
5756 -- in the ignored left operand (in particular function calls
5757 -- to user defined functions) are properly executed.
5759 Remove_Side_Effects (Base);
5761 if Ekind (Typ) in Integer_Kind then
5762 Xnode := Make_Integer_Literal (Loc, Intval => 1);
5764 Xnode := Make_Real_Literal (Loc, Ureal_1);
5776 Make_Op_Multiply (Loc,
5777 Left_Opnd => Duplicate_Subexpr (Base),
5778 Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
5780 -- X ** 3 = X * X * X
5784 Make_Op_Multiply (Loc,
5786 Make_Op_Multiply (Loc,
5787 Left_Opnd => Duplicate_Subexpr (Base),
5788 Right_Opnd => Duplicate_Subexpr_No_Checks (Base)),
5789 Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
5792 -- En : constant base'type := base * base;
5798 Make_Defining_Identifier (Loc, New_Internal_Name ('E'));
5800 Insert_Actions (N, New_List (
5801 Make_Object_Declaration (Loc,
5802 Defining_Identifier => Temp,
5803 Constant_Present => True,
5804 Object_Definition => New_Reference_To (Typ, Loc),
5806 Make_Op_Multiply (Loc,
5807 Left_Opnd => Duplicate_Subexpr (Base),
5808 Right_Opnd => Duplicate_Subexpr_No_Checks (Base)))));
5811 Make_Op_Multiply (Loc,
5812 Left_Opnd => New_Reference_To (Temp, Loc),
5813 Right_Opnd => New_Reference_To (Temp, Loc));
5817 Analyze_And_Resolve (N, Typ);
5822 -- Case of (2 ** expression) appearing as an argument of an integer
5823 -- multiplication, or as the right argument of a division of a non-
5824 -- negative integer. In such cases we leave the node untouched, setting
5825 -- the flag Is_Natural_Power_Of_2_for_Shift set, then the expansion
5826 -- of the higher level node converts it into a shift.
5828 -- Note: this transformation is not applicable for a modular type with
5829 -- a non-binary modulus in the multiplication case, since we get a wrong
5830 -- result if the shift causes an overflow before the modular reduction.
5832 if Nkind (Base) = N_Integer_Literal
5833 and then Intval (Base) = 2
5834 and then Is_Integer_Type (Root_Type (Exptyp))
5835 and then Esize (Root_Type (Exptyp)) <= Esize (Standard_Integer)
5836 and then Is_Unsigned_Type (Exptyp)
5838 and then Nkind (Parent (N)) in N_Binary_Op
5841 P : constant Node_Id := Parent (N);
5842 L : constant Node_Id := Left_Opnd (P);
5843 R : constant Node_Id := Right_Opnd (P);
5846 if (Nkind (P) = N_Op_Multiply
5847 and then not Non_Binary_Modulus (Typ)
5849 ((Is_Integer_Type (Etype (L)) and then R = N)
5851 (Is_Integer_Type (Etype (R)) and then L = N))
5852 and then not Do_Overflow_Check (P))
5855 (Nkind (P) = N_Op_Divide
5856 and then Is_Integer_Type (Etype (L))
5857 and then Is_Unsigned_Type (Etype (L))
5859 and then not Do_Overflow_Check (P))
5861 Set_Is_Power_Of_2_For_Shift (N);
5867 -- Fall through if exponentiation must be done using a runtime routine
5869 -- First deal with modular case
5871 if Is_Modular_Integer_Type (Rtyp) then
5873 -- Non-binary case, we call the special exponentiation routine for
5874 -- the non-binary case, converting the argument to Long_Long_Integer
5875 -- and passing the modulus value. Then the result is converted back
5876 -- to the base type.
5878 if Non_Binary_Modulus (Rtyp) then
5881 Make_Function_Call (Loc,
5882 Name => New_Reference_To (RTE (RE_Exp_Modular), Loc),
5883 Parameter_Associations => New_List (
5884 Convert_To (Standard_Integer, Base),
5885 Make_Integer_Literal (Loc, Modulus (Rtyp)),
5888 -- Binary case, in this case, we call one of two routines, either the
5889 -- unsigned integer case, or the unsigned long long integer case,
5890 -- with a final "and" operation to do the required mod.
5893 if UI_To_Int (Esize (Rtyp)) <= Standard_Integer_Size then
5894 Ent := RTE (RE_Exp_Unsigned);
5896 Ent := RTE (RE_Exp_Long_Long_Unsigned);
5903 Make_Function_Call (Loc,
5904 Name => New_Reference_To (Ent, Loc),
5905 Parameter_Associations => New_List (
5906 Convert_To (Etype (First_Formal (Ent)), Base),
5909 Make_Integer_Literal (Loc, Modulus (Rtyp) - 1))));
5913 -- Common exit point for modular type case
5915 Analyze_And_Resolve (N, Typ);
5918 -- Signed integer cases, done using either Integer or Long_Long_Integer.
5919 -- It is not worth having routines for Short_[Short_]Integer, since for
5920 -- most machines it would not help, and it would generate more code that
5921 -- might need certification when a certified run time is required.
5923 -- In the integer cases, we have two routines, one for when overflow
5924 -- checks are required, and one when they are not required, since there
5925 -- is a real gain in omitting checks on many machines.
5927 elsif Rtyp = Base_Type (Standard_Long_Long_Integer)
5928 or else (Rtyp = Base_Type (Standard_Long_Integer)
5930 Esize (Standard_Long_Integer) > Esize (Standard_Integer))
5931 or else (Rtyp = Universal_Integer)
5933 Etyp := Standard_Long_Long_Integer;
5936 Rent := RE_Exp_Long_Long_Integer;
5938 Rent := RE_Exn_Long_Long_Integer;
5941 elsif Is_Signed_Integer_Type (Rtyp) then
5942 Etyp := Standard_Integer;
5945 Rent := RE_Exp_Integer;
5947 Rent := RE_Exn_Integer;
5950 -- Floating-point cases, always done using Long_Long_Float. We do not
5951 -- need separate routines for the overflow case here, since in the case
5952 -- of floating-point, we generate infinities anyway as a rule (either
5953 -- that or we automatically trap overflow), and if there is an infinity
5954 -- generated and a range check is required, the check will fail anyway.
5957 pragma Assert (Is_Floating_Point_Type (Rtyp));
5958 Etyp := Standard_Long_Long_Float;
5959 Rent := RE_Exn_Long_Long_Float;
5962 -- Common processing for integer cases and floating-point cases.
5963 -- If we are in the right type, we can call runtime routine directly
5966 and then Rtyp /= Universal_Integer
5967 and then Rtyp /= Universal_Real
5970 Make_Function_Call (Loc,
5971 Name => New_Reference_To (RTE (Rent), Loc),
5972 Parameter_Associations => New_List (Base, Exp)));
5974 -- Otherwise we have to introduce conversions (conversions are also
5975 -- required in the universal cases, since the runtime routine is
5976 -- typed using one of the standard types).
5981 Make_Function_Call (Loc,
5982 Name => New_Reference_To (RTE (Rent), Loc),
5983 Parameter_Associations => New_List (
5984 Convert_To (Etyp, Base),
5988 Analyze_And_Resolve (N, Typ);
5992 when RE_Not_Available =>
5994 end Expand_N_Op_Expon;
5996 --------------------
5997 -- Expand_N_Op_Ge --
5998 --------------------
6000 procedure Expand_N_Op_Ge (N : Node_Id) is
6001 Typ : constant Entity_Id := Etype (N);
6002 Op1 : constant Node_Id := Left_Opnd (N);
6003 Op2 : constant Node_Id := Right_Opnd (N);
6004 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6007 Binary_Op_Validity_Checks (N);
6009 if Is_Array_Type (Typ1) then
6010 Expand_Array_Comparison (N);
6014 if Is_Boolean_Type (Typ1) then
6015 Adjust_Condition (Op1);
6016 Adjust_Condition (Op2);
6017 Set_Etype (N, Standard_Boolean);
6018 Adjust_Result_Type (N, Typ);
6021 Rewrite_Comparison (N);
6023 -- If we still have comparison, and Vax_Float type, process it
6025 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6026 Expand_Vax_Comparison (N);
6031 --------------------
6032 -- Expand_N_Op_Gt --
6033 --------------------
6035 procedure Expand_N_Op_Gt (N : Node_Id) is
6036 Typ : constant Entity_Id := Etype (N);
6037 Op1 : constant Node_Id := Left_Opnd (N);
6038 Op2 : constant Node_Id := Right_Opnd (N);
6039 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6042 Binary_Op_Validity_Checks (N);
6044 if Is_Array_Type (Typ1) then
6045 Expand_Array_Comparison (N);
6049 if Is_Boolean_Type (Typ1) then
6050 Adjust_Condition (Op1);
6051 Adjust_Condition (Op2);
6052 Set_Etype (N, Standard_Boolean);
6053 Adjust_Result_Type (N, Typ);
6056 Rewrite_Comparison (N);
6058 -- If we still have comparison, and Vax_Float type, process it
6060 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6061 Expand_Vax_Comparison (N);
6066 --------------------
6067 -- Expand_N_Op_Le --
6068 --------------------
6070 procedure Expand_N_Op_Le (N : Node_Id) is
6071 Typ : constant Entity_Id := Etype (N);
6072 Op1 : constant Node_Id := Left_Opnd (N);
6073 Op2 : constant Node_Id := Right_Opnd (N);
6074 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6077 Binary_Op_Validity_Checks (N);
6079 if Is_Array_Type (Typ1) then
6080 Expand_Array_Comparison (N);
6084 if Is_Boolean_Type (Typ1) then
6085 Adjust_Condition (Op1);
6086 Adjust_Condition (Op2);
6087 Set_Etype (N, Standard_Boolean);
6088 Adjust_Result_Type (N, Typ);
6091 Rewrite_Comparison (N);
6093 -- If we still have comparison, and Vax_Float type, process it
6095 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6096 Expand_Vax_Comparison (N);
6101 --------------------
6102 -- Expand_N_Op_Lt --
6103 --------------------
6105 procedure Expand_N_Op_Lt (N : Node_Id) is
6106 Typ : constant Entity_Id := Etype (N);
6107 Op1 : constant Node_Id := Left_Opnd (N);
6108 Op2 : constant Node_Id := Right_Opnd (N);
6109 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6112 Binary_Op_Validity_Checks (N);
6114 if Is_Array_Type (Typ1) then
6115 Expand_Array_Comparison (N);
6119 if Is_Boolean_Type (Typ1) then
6120 Adjust_Condition (Op1);
6121 Adjust_Condition (Op2);
6122 Set_Etype (N, Standard_Boolean);
6123 Adjust_Result_Type (N, Typ);
6126 Rewrite_Comparison (N);
6128 -- If we still have comparison, and Vax_Float type, process it
6130 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6131 Expand_Vax_Comparison (N);
6136 -----------------------
6137 -- Expand_N_Op_Minus --
6138 -----------------------
6140 procedure Expand_N_Op_Minus (N : Node_Id) is
6141 Loc : constant Source_Ptr := Sloc (N);
6142 Typ : constant Entity_Id := Etype (N);
6145 Unary_Op_Validity_Checks (N);
6147 if not Backend_Overflow_Checks_On_Target
6148 and then Is_Signed_Integer_Type (Etype (N))
6149 and then Do_Overflow_Check (N)
6151 -- Software overflow checking expands -expr into (0 - expr)
6154 Make_Op_Subtract (Loc,
6155 Left_Opnd => Make_Integer_Literal (Loc, 0),
6156 Right_Opnd => Right_Opnd (N)));
6158 Analyze_And_Resolve (N, Typ);
6160 -- Vax floating-point types case
6162 elsif Vax_Float (Etype (N)) then
6163 Expand_Vax_Arith (N);
6165 end Expand_N_Op_Minus;
6167 ---------------------
6168 -- Expand_N_Op_Mod --
6169 ---------------------
6171 procedure Expand_N_Op_Mod (N : Node_Id) is
6172 Loc : constant Source_Ptr := Sloc (N);
6173 Typ : constant Entity_Id := Etype (N);
6174 Left : constant Node_Id := Left_Opnd (N);
6175 Right : constant Node_Id := Right_Opnd (N);
6176 DOC : constant Boolean := Do_Overflow_Check (N);
6177 DDC : constant Boolean := Do_Division_Check (N);
6187 pragma Warnings (Off, Lhi);
6190 Binary_Op_Validity_Checks (N);
6192 Determine_Range (Right, ROK, Rlo, Rhi);
6193 Determine_Range (Left, LOK, Llo, Lhi);
6195 -- Convert mod to rem if operands are known non-negative. We do this
6196 -- since it is quite likely that this will improve the quality of code,
6197 -- (the operation now corresponds to the hardware remainder), and it
6198 -- does not seem likely that it could be harmful.
6200 if LOK and then Llo >= 0
6202 ROK and then Rlo >= 0
6205 Make_Op_Rem (Sloc (N),
6206 Left_Opnd => Left_Opnd (N),
6207 Right_Opnd => Right_Opnd (N)));
6209 -- Instead of reanalyzing the node we do the analysis manually. This
6210 -- avoids anomalies when the replacement is done in an instance and
6211 -- is epsilon more efficient.
6213 Set_Entity (N, Standard_Entity (S_Op_Rem));
6215 Set_Do_Overflow_Check (N, DOC);
6216 Set_Do_Division_Check (N, DDC);
6217 Expand_N_Op_Rem (N);
6220 -- Otherwise, normal mod processing
6223 if Is_Integer_Type (Etype (N)) then
6224 Apply_Divide_Check (N);
6227 -- Apply optimization x mod 1 = 0. We don't really need that with
6228 -- gcc, but it is useful with other back ends (e.g. AAMP), and is
6229 -- certainly harmless.
6231 if Is_Integer_Type (Etype (N))
6232 and then Compile_Time_Known_Value (Right)
6233 and then Expr_Value (Right) = Uint_1
6235 -- Call Remove_Side_Effects to ensure that any side effects in
6236 -- the ignored left operand (in particular function calls to
6237 -- user defined functions) are properly executed.
6239 Remove_Side_Effects (Left);
6241 Rewrite (N, Make_Integer_Literal (Loc, 0));
6242 Analyze_And_Resolve (N, Typ);
6246 -- Deal with annoying case of largest negative number remainder
6247 -- minus one. Gigi does not handle this case correctly, because
6248 -- it generates a divide instruction which may trap in this case.
6250 -- In fact the check is quite easy, if the right operand is -1, then
6251 -- the mod value is always 0, and we can just ignore the left operand
6252 -- completely in this case.
6254 -- The operand type may be private (e.g. in the expansion of an
6255 -- intrinsic operation) so we must use the underlying type to get the
6256 -- bounds, and convert the literals explicitly.
6260 (Type_Low_Bound (Base_Type (Underlying_Type (Etype (Left)))));
6262 if ((not ROK) or else (Rlo <= (-1) and then (-1) <= Rhi))
6264 ((not LOK) or else (Llo = LLB))
6267 Make_Conditional_Expression (Loc,
6268 Expressions => New_List (
6270 Left_Opnd => Duplicate_Subexpr (Right),
6272 Unchecked_Convert_To (Typ,
6273 Make_Integer_Literal (Loc, -1))),
6274 Unchecked_Convert_To (Typ,
6275 Make_Integer_Literal (Loc, Uint_0)),
6276 Relocate_Node (N))));
6278 Set_Analyzed (Next (Next (First (Expressions (N)))));
6279 Analyze_And_Resolve (N, Typ);
6282 end Expand_N_Op_Mod;
6284 --------------------------
6285 -- Expand_N_Op_Multiply --
6286 --------------------------
6288 procedure Expand_N_Op_Multiply (N : Node_Id) is
6289 Loc : constant Source_Ptr := Sloc (N);
6290 Lop : constant Node_Id := Left_Opnd (N);
6291 Rop : constant Node_Id := Right_Opnd (N);
6293 Lp2 : constant Boolean :=
6294 Nkind (Lop) = N_Op_Expon
6295 and then Is_Power_Of_2_For_Shift (Lop);
6297 Rp2 : constant Boolean :=
6298 Nkind (Rop) = N_Op_Expon
6299 and then Is_Power_Of_2_For_Shift (Rop);
6301 Ltyp : constant Entity_Id := Etype (Lop);
6302 Rtyp : constant Entity_Id := Etype (Rop);
6303 Typ : Entity_Id := Etype (N);
6306 Binary_Op_Validity_Checks (N);
6308 -- Special optimizations for integer types
6310 if Is_Integer_Type (Typ) then
6312 -- N * 0 = 0 for integer types
6314 if Compile_Time_Known_Value (Rop)
6315 and then Expr_Value (Rop) = Uint_0
6317 -- Call Remove_Side_Effects to ensure that any side effects in
6318 -- the ignored left operand (in particular function calls to
6319 -- user defined functions) are properly executed.
6321 Remove_Side_Effects (Lop);
6323 Rewrite (N, Make_Integer_Literal (Loc, Uint_0));
6324 Analyze_And_Resolve (N, Typ);
6328 -- Similar handling for 0 * N = 0
6330 if Compile_Time_Known_Value (Lop)
6331 and then Expr_Value (Lop) = Uint_0
6333 Remove_Side_Effects (Rop);
6334 Rewrite (N, Make_Integer_Literal (Loc, Uint_0));
6335 Analyze_And_Resolve (N, Typ);
6339 -- N * 1 = 1 * N = N for integer types
6341 -- This optimisation is not done if we are going to
6342 -- rewrite the product 1 * 2 ** N to a shift.
6344 if Compile_Time_Known_Value (Rop)
6345 and then Expr_Value (Rop) = Uint_1
6351 elsif Compile_Time_Known_Value (Lop)
6352 and then Expr_Value (Lop) = Uint_1
6360 -- Convert x * 2 ** y to Shift_Left (x, y). Note that the fact that
6361 -- Is_Power_Of_2_For_Shift is set means that we know that our left
6362 -- operand is an integer, as required for this to work.
6367 -- Convert 2 ** A * 2 ** B into 2 ** (A + B)
6371 Left_Opnd => Make_Integer_Literal (Loc, 2),
6374 Left_Opnd => Right_Opnd (Lop),
6375 Right_Opnd => Right_Opnd (Rop))));
6376 Analyze_And_Resolve (N, Typ);
6381 Make_Op_Shift_Left (Loc,
6384 Convert_To (Standard_Natural, Right_Opnd (Rop))));
6385 Analyze_And_Resolve (N, Typ);
6389 -- Same processing for the operands the other way round
6393 Make_Op_Shift_Left (Loc,
6396 Convert_To (Standard_Natural, Right_Opnd (Lop))));
6397 Analyze_And_Resolve (N, Typ);
6401 -- Do required fixup of universal fixed operation
6403 if Typ = Universal_Fixed then
6404 Fixup_Universal_Fixed_Operation (N);
6408 -- Multiplications with fixed-point results
6410 if Is_Fixed_Point_Type (Typ) then
6412 -- No special processing if Treat_Fixed_As_Integer is set, since from
6413 -- a semantic point of view such operations are simply integer
6414 -- operations and will be treated that way.
6416 if not Treat_Fixed_As_Integer (N) then
6418 -- Case of fixed * integer => fixed
6420 if Is_Integer_Type (Rtyp) then
6421 Expand_Multiply_Fixed_By_Integer_Giving_Fixed (N);
6423 -- Case of integer * fixed => fixed
6425 elsif Is_Integer_Type (Ltyp) then
6426 Expand_Multiply_Integer_By_Fixed_Giving_Fixed (N);
6428 -- Case of fixed * fixed => fixed
6431 Expand_Multiply_Fixed_By_Fixed_Giving_Fixed (N);
6435 -- Other cases of multiplication of fixed-point operands. Again we
6436 -- exclude the cases where Treat_Fixed_As_Integer flag is set.
6438 elsif (Is_Fixed_Point_Type (Ltyp) or else Is_Fixed_Point_Type (Rtyp))
6439 and then not Treat_Fixed_As_Integer (N)
6441 if Is_Integer_Type (Typ) then
6442 Expand_Multiply_Fixed_By_Fixed_Giving_Integer (N);
6444 pragma Assert (Is_Floating_Point_Type (Typ));
6445 Expand_Multiply_Fixed_By_Fixed_Giving_Float (N);
6448 -- Mixed-mode operations can appear in a non-static universal context,
6449 -- in which case the integer argument must be converted explicitly.
6451 elsif Typ = Universal_Real
6452 and then Is_Integer_Type (Rtyp)
6454 Rewrite (Rop, Convert_To (Universal_Real, Relocate_Node (Rop)));
6456 Analyze_And_Resolve (Rop, Universal_Real);
6458 elsif Typ = Universal_Real
6459 and then Is_Integer_Type (Ltyp)
6461 Rewrite (Lop, Convert_To (Universal_Real, Relocate_Node (Lop)));
6463 Analyze_And_Resolve (Lop, Universal_Real);
6465 -- Non-fixed point cases, check software overflow checking required
6467 elsif Is_Signed_Integer_Type (Etype (N)) then
6468 Apply_Arithmetic_Overflow_Check (N);
6470 -- Deal with VAX float case
6472 elsif Vax_Float (Typ) then
6473 Expand_Vax_Arith (N);
6476 end Expand_N_Op_Multiply;
6478 --------------------
6479 -- Expand_N_Op_Ne --
6480 --------------------
6482 procedure Expand_N_Op_Ne (N : Node_Id) is
6483 Typ : constant Entity_Id := Etype (Left_Opnd (N));
6486 -- Case of elementary type with standard operator
6488 if Is_Elementary_Type (Typ)
6489 and then Sloc (Entity (N)) = Standard_Location
6491 Binary_Op_Validity_Checks (N);
6493 -- Boolean types (requiring handling of non-standard case)
6495 if Is_Boolean_Type (Typ) then
6496 Adjust_Condition (Left_Opnd (N));
6497 Adjust_Condition (Right_Opnd (N));
6498 Set_Etype (N, Standard_Boolean);
6499 Adjust_Result_Type (N, Typ);
6502 Rewrite_Comparison (N);
6504 -- If we still have comparison for Vax_Float, process it
6506 if Vax_Float (Typ) and then Nkind (N) in N_Op_Compare then
6507 Expand_Vax_Comparison (N);
6511 -- For all cases other than elementary types, we rewrite node as the
6512 -- negation of an equality operation, and reanalyze. The equality to be
6513 -- used is defined in the same scope and has the same signature. This
6514 -- signature must be set explicitly since in an instance it may not have
6515 -- the same visibility as in the generic unit. This avoids duplicating
6516 -- or factoring the complex code for record/array equality tests etc.
6520 Loc : constant Source_Ptr := Sloc (N);
6522 Ne : constant Entity_Id := Entity (N);
6525 Binary_Op_Validity_Checks (N);
6531 Left_Opnd => Left_Opnd (N),
6532 Right_Opnd => Right_Opnd (N)));
6533 Set_Paren_Count (Right_Opnd (Neg), 1);
6535 if Scope (Ne) /= Standard_Standard then
6536 Set_Entity (Right_Opnd (Neg), Corresponding_Equality (Ne));
6539 -- For navigation purposes, the inequality is treated as an
6540 -- implicit reference to the corresponding equality. Preserve the
6541 -- Comes_From_ source flag so that the proper Xref entry is
6544 Preserve_Comes_From_Source (Neg, N);
6545 Preserve_Comes_From_Source (Right_Opnd (Neg), N);
6547 Analyze_And_Resolve (N, Standard_Boolean);
6552 ---------------------
6553 -- Expand_N_Op_Not --
6554 ---------------------
6556 -- If the argument is other than a Boolean array type, there is no special
6557 -- expansion required.
6559 -- For the packed case, we call the special routine in Exp_Pakd, except
6560 -- that if the component size is greater than one, we use the standard
6561 -- routine generating a gruesome loop (it is so peculiar to have packed
6562 -- arrays with non-standard Boolean representations anyway, so it does not
6563 -- matter that we do not handle this case efficiently).
6565 -- For the unpacked case (and for the special packed case where we have non
6566 -- standard Booleans, as discussed above), we generate and insert into the
6567 -- tree the following function definition:
6569 -- function Nnnn (A : arr) is
6572 -- for J in a'range loop
6573 -- B (J) := not A (J);
6578 -- Here arr is the actual subtype of the parameter (and hence always
6579 -- constrained). Then we replace the not with a call to this function.
6581 procedure Expand_N_Op_Not (N : Node_Id) is
6582 Loc : constant Source_Ptr := Sloc (N);
6583 Typ : constant Entity_Id := Etype (N);
6592 Func_Name : Entity_Id;
6593 Loop_Statement : Node_Id;
6596 Unary_Op_Validity_Checks (N);
6598 -- For boolean operand, deal with non-standard booleans
6600 if Is_Boolean_Type (Typ) then
6601 Adjust_Condition (Right_Opnd (N));
6602 Set_Etype (N, Standard_Boolean);
6603 Adjust_Result_Type (N, Typ);
6607 -- Only array types need any other processing
6609 if not Is_Array_Type (Typ) then
6613 -- Case of array operand. If bit packed with a component size of 1,
6614 -- handle it in Exp_Pakd if the operand is known to be aligned.
6616 if Is_Bit_Packed_Array (Typ)
6617 and then Component_Size (Typ) = 1
6618 and then not Is_Possibly_Unaligned_Object (Right_Opnd (N))
6620 Expand_Packed_Not (N);
6624 -- Case of array operand which is not bit-packed. If the context is
6625 -- a safe assignment, call in-place operation, If context is a larger
6626 -- boolean expression in the context of a safe assignment, expansion is
6627 -- done by enclosing operation.
6629 Opnd := Relocate_Node (Right_Opnd (N));
6630 Convert_To_Actual_Subtype (Opnd);
6631 Arr := Etype (Opnd);
6632 Ensure_Defined (Arr, N);
6633 Silly_Boolean_Array_Not_Test (N, Arr);
6635 if Nkind (Parent (N)) = N_Assignment_Statement then
6636 if Safe_In_Place_Array_Op (Name (Parent (N)), N, Empty) then
6637 Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
6640 -- Special case the negation of a binary operation
6642 elsif Nkind_In (Opnd, N_Op_And, N_Op_Or, N_Op_Xor)
6643 and then Safe_In_Place_Array_Op
6644 (Name (Parent (N)), Left_Opnd (Opnd), Right_Opnd (Opnd))
6646 Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
6650 elsif Nkind (Parent (N)) in N_Binary_Op
6651 and then Nkind (Parent (Parent (N))) = N_Assignment_Statement
6654 Op1 : constant Node_Id := Left_Opnd (Parent (N));
6655 Op2 : constant Node_Id := Right_Opnd (Parent (N));
6656 Lhs : constant Node_Id := Name (Parent (Parent (N)));
6659 if Safe_In_Place_Array_Op (Lhs, Op1, Op2) then
6661 and then Nkind (Op2) = N_Op_Not
6663 -- (not A) op (not B) can be reduced to a single call
6668 and then Nkind (Parent (N)) = N_Op_Xor
6670 -- A xor (not B) can also be special-cased
6678 A := Make_Defining_Identifier (Loc, Name_uA);
6679 B := Make_Defining_Identifier (Loc, Name_uB);
6680 J := Make_Defining_Identifier (Loc, Name_uJ);
6683 Make_Indexed_Component (Loc,
6684 Prefix => New_Reference_To (A, Loc),
6685 Expressions => New_List (New_Reference_To (J, Loc)));
6688 Make_Indexed_Component (Loc,
6689 Prefix => New_Reference_To (B, Loc),
6690 Expressions => New_List (New_Reference_To (J, Loc)));
6693 Make_Implicit_Loop_Statement (N,
6694 Identifier => Empty,
6697 Make_Iteration_Scheme (Loc,
6698 Loop_Parameter_Specification =>
6699 Make_Loop_Parameter_Specification (Loc,
6700 Defining_Identifier => J,
6701 Discrete_Subtype_Definition =>
6702 Make_Attribute_Reference (Loc,
6703 Prefix => Make_Identifier (Loc, Chars (A)),
6704 Attribute_Name => Name_Range))),
6706 Statements => New_List (
6707 Make_Assignment_Statement (Loc,
6709 Expression => Make_Op_Not (Loc, A_J))));
6711 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('N'));
6712 Set_Is_Inlined (Func_Name);
6715 Make_Subprogram_Body (Loc,
6717 Make_Function_Specification (Loc,
6718 Defining_Unit_Name => Func_Name,
6719 Parameter_Specifications => New_List (
6720 Make_Parameter_Specification (Loc,
6721 Defining_Identifier => A,
6722 Parameter_Type => New_Reference_To (Typ, Loc))),
6723 Result_Definition => New_Reference_To (Typ, Loc)),
6725 Declarations => New_List (
6726 Make_Object_Declaration (Loc,
6727 Defining_Identifier => B,
6728 Object_Definition => New_Reference_To (Arr, Loc))),
6730 Handled_Statement_Sequence =>
6731 Make_Handled_Sequence_Of_Statements (Loc,
6732 Statements => New_List (
6734 Make_Simple_Return_Statement (Loc,
6736 Make_Identifier (Loc, Chars (B)))))));
6739 Make_Function_Call (Loc,
6740 Name => New_Reference_To (Func_Name, Loc),
6741 Parameter_Associations => New_List (Opnd)));
6743 Analyze_And_Resolve (N, Typ);
6744 end Expand_N_Op_Not;
6746 --------------------
6747 -- Expand_N_Op_Or --
6748 --------------------
6750 procedure Expand_N_Op_Or (N : Node_Id) is
6751 Typ : constant Entity_Id := Etype (N);
6754 Binary_Op_Validity_Checks (N);
6756 if Is_Array_Type (Etype (N)) then
6757 Expand_Boolean_Operator (N);
6759 elsif Is_Boolean_Type (Etype (N)) then
6760 Adjust_Condition (Left_Opnd (N));
6761 Adjust_Condition (Right_Opnd (N));
6762 Set_Etype (N, Standard_Boolean);
6763 Adjust_Result_Type (N, Typ);
6767 ----------------------
6768 -- Expand_N_Op_Plus --
6769 ----------------------
6771 procedure Expand_N_Op_Plus (N : Node_Id) is
6773 Unary_Op_Validity_Checks (N);
6774 end Expand_N_Op_Plus;
6776 ---------------------
6777 -- Expand_N_Op_Rem --
6778 ---------------------
6780 procedure Expand_N_Op_Rem (N : Node_Id) is
6781 Loc : constant Source_Ptr := Sloc (N);
6782 Typ : constant Entity_Id := Etype (N);
6784 Left : constant Node_Id := Left_Opnd (N);
6785 Right : constant Node_Id := Right_Opnd (N);
6795 pragma Warnings (Off, Lhi);
6798 Binary_Op_Validity_Checks (N);
6800 if Is_Integer_Type (Etype (N)) then
6801 Apply_Divide_Check (N);
6804 -- Apply optimization x rem 1 = 0. We don't really need that with gcc,
6805 -- but it is useful with other back ends (e.g. AAMP), and is certainly
6808 if Is_Integer_Type (Etype (N))
6809 and then Compile_Time_Known_Value (Right)
6810 and then Expr_Value (Right) = Uint_1
6812 -- Call Remove_Side_Effects to ensure that any side effects in the
6813 -- ignored left operand (in particular function calls to user defined
6814 -- functions) are properly executed.
6816 Remove_Side_Effects (Left);
6818 Rewrite (N, Make_Integer_Literal (Loc, 0));
6819 Analyze_And_Resolve (N, Typ);
6823 -- Deal with annoying case of largest negative number remainder minus
6824 -- one. Gigi does not handle this case correctly, because it generates
6825 -- a divide instruction which may trap in this case.
6827 -- In fact the check is quite easy, if the right operand is -1, then
6828 -- the remainder is always 0, and we can just ignore the left operand
6829 -- completely in this case.
6831 Determine_Range (Right, ROK, Rlo, Rhi);
6832 Determine_Range (Left, LOK, Llo, Lhi);
6834 -- The operand type may be private (e.g. in the expansion of an
6835 -- intrinsic operation) so we must use the underlying type to get the
6836 -- bounds, and convert the literals explicitly.
6840 (Type_Low_Bound (Base_Type (Underlying_Type (Etype (Left)))));
6842 -- Now perform the test, generating code only if needed
6844 if ((not ROK) or else (Rlo <= (-1) and then (-1) <= Rhi))
6846 ((not LOK) or else (Llo = LLB))
6849 Make_Conditional_Expression (Loc,
6850 Expressions => New_List (
6852 Left_Opnd => Duplicate_Subexpr (Right),
6854 Unchecked_Convert_To (Typ,
6855 Make_Integer_Literal (Loc, -1))),
6857 Unchecked_Convert_To (Typ,
6858 Make_Integer_Literal (Loc, Uint_0)),
6860 Relocate_Node (N))));
6862 Set_Analyzed (Next (Next (First (Expressions (N)))));
6863 Analyze_And_Resolve (N, Typ);
6865 end Expand_N_Op_Rem;
6867 -----------------------------
6868 -- Expand_N_Op_Rotate_Left --
6869 -----------------------------
6871 procedure Expand_N_Op_Rotate_Left (N : Node_Id) is
6873 Binary_Op_Validity_Checks (N);
6874 end Expand_N_Op_Rotate_Left;
6876 ------------------------------
6877 -- Expand_N_Op_Rotate_Right --
6878 ------------------------------
6880 procedure Expand_N_Op_Rotate_Right (N : Node_Id) is
6882 Binary_Op_Validity_Checks (N);
6883 end Expand_N_Op_Rotate_Right;
6885 ----------------------------
6886 -- Expand_N_Op_Shift_Left --
6887 ----------------------------
6889 procedure Expand_N_Op_Shift_Left (N : Node_Id) is
6891 Binary_Op_Validity_Checks (N);
6892 end Expand_N_Op_Shift_Left;
6894 -----------------------------
6895 -- Expand_N_Op_Shift_Right --
6896 -----------------------------
6898 procedure Expand_N_Op_Shift_Right (N : Node_Id) is
6900 Binary_Op_Validity_Checks (N);
6901 end Expand_N_Op_Shift_Right;
6903 ----------------------------------------
6904 -- Expand_N_Op_Shift_Right_Arithmetic --
6905 ----------------------------------------
6907 procedure Expand_N_Op_Shift_Right_Arithmetic (N : Node_Id) is
6909 Binary_Op_Validity_Checks (N);
6910 end Expand_N_Op_Shift_Right_Arithmetic;
6912 --------------------------
6913 -- Expand_N_Op_Subtract --
6914 --------------------------
6916 procedure Expand_N_Op_Subtract (N : Node_Id) is
6917 Typ : constant Entity_Id := Etype (N);
6920 Binary_Op_Validity_Checks (N);
6922 -- N - 0 = N for integer types
6924 if Is_Integer_Type (Typ)
6925 and then Compile_Time_Known_Value (Right_Opnd (N))
6926 and then Expr_Value (Right_Opnd (N)) = 0
6928 Rewrite (N, Left_Opnd (N));
6932 -- Arithmetic overflow checks for signed integer/fixed point types
6934 if Is_Signed_Integer_Type (Typ)
6935 or else Is_Fixed_Point_Type (Typ)
6937 Apply_Arithmetic_Overflow_Check (N);
6939 -- Vax floating-point types case
6941 elsif Vax_Float (Typ) then
6942 Expand_Vax_Arith (N);
6944 end Expand_N_Op_Subtract;
6946 ---------------------
6947 -- Expand_N_Op_Xor --
6948 ---------------------
6950 procedure Expand_N_Op_Xor (N : Node_Id) is
6951 Typ : constant Entity_Id := Etype (N);
6954 Binary_Op_Validity_Checks (N);
6956 if Is_Array_Type (Etype (N)) then
6957 Expand_Boolean_Operator (N);
6959 elsif Is_Boolean_Type (Etype (N)) then
6960 Adjust_Condition (Left_Opnd (N));
6961 Adjust_Condition (Right_Opnd (N));
6962 Set_Etype (N, Standard_Boolean);
6963 Adjust_Result_Type (N, Typ);
6965 end Expand_N_Op_Xor;
6967 ----------------------
6968 -- Expand_N_Or_Else --
6969 ----------------------
6971 -- Expand into conditional expression if Actions present, and also
6972 -- deal with optimizing case of arguments being True or False.
6974 procedure Expand_N_Or_Else (N : Node_Id) is
6975 Loc : constant Source_Ptr := Sloc (N);
6976 Typ : constant Entity_Id := Etype (N);
6977 Left : constant Node_Id := Left_Opnd (N);
6978 Right : constant Node_Id := Right_Opnd (N);
6982 -- Deal with non-standard booleans
6984 if Is_Boolean_Type (Typ) then
6985 Adjust_Condition (Left);
6986 Adjust_Condition (Right);
6987 Set_Etype (N, Standard_Boolean);
6990 -- Check for cases where left argument is known to be True or False
6992 if Compile_Time_Known_Value (Left) then
6994 -- If left argument is False, change (False or else Right) to Right.
6995 -- Any actions associated with Right will be executed unconditionally
6996 -- and can thus be inserted into the tree unconditionally.
6998 if Expr_Value_E (Left) = Standard_False then
6999 if Present (Actions (N)) then
7000 Insert_Actions (N, Actions (N));
7005 -- If left argument is True, change (True and then Right) to True. In
7006 -- this case we can forget the actions associated with Right, since
7007 -- they will never be executed.
7009 else pragma Assert (Expr_Value_E (Left) = Standard_True);
7010 Kill_Dead_Code (Right);
7011 Kill_Dead_Code (Actions (N));
7012 Rewrite (N, New_Occurrence_Of (Standard_True, Loc));
7015 Adjust_Result_Type (N, Typ);
7019 -- If Actions are present, we expand
7021 -- left or else right
7025 -- if left then True else right end
7027 -- with the actions becoming the Else_Actions of the conditional
7028 -- expression. This conditional expression is then further expanded
7029 -- (and will eventually disappear)
7031 if Present (Actions (N)) then
7032 Actlist := Actions (N);
7034 Make_Conditional_Expression (Loc,
7035 Expressions => New_List (
7037 New_Occurrence_Of (Standard_True, Loc),
7040 Set_Else_Actions (N, Actlist);
7041 Analyze_And_Resolve (N, Standard_Boolean);
7042 Adjust_Result_Type (N, Typ);
7046 -- No actions present, check for cases of right argument True/False
7048 if Compile_Time_Known_Value (Right) then
7050 -- Change (Left or else False) to Left. Note that we know there are
7051 -- no actions associated with the True operand, since we just checked
7052 -- for this case above.
7054 if Expr_Value_E (Right) = Standard_False then
7057 -- Change (Left or else True) to True, making sure to preserve any
7058 -- side effects associated with the Left operand.
7060 else pragma Assert (Expr_Value_E (Right) = Standard_True);
7061 Remove_Side_Effects (Left);
7063 (N, New_Occurrence_Of (Standard_True, Loc));
7067 Adjust_Result_Type (N, Typ);
7068 end Expand_N_Or_Else;
7070 -----------------------------------
7071 -- Expand_N_Qualified_Expression --
7072 -----------------------------------
7074 procedure Expand_N_Qualified_Expression (N : Node_Id) is
7075 Operand : constant Node_Id := Expression (N);
7076 Target_Type : constant Entity_Id := Entity (Subtype_Mark (N));
7079 -- Do validity check if validity checking operands
7081 if Validity_Checks_On
7082 and then Validity_Check_Operands
7084 Ensure_Valid (Operand);
7087 -- Apply possible constraint check
7089 Apply_Constraint_Check (Operand, Target_Type, No_Sliding => True);
7091 if Do_Range_Check (Operand) then
7092 Set_Do_Range_Check (Operand, False);
7093 Generate_Range_Check (Operand, Target_Type, CE_Range_Check_Failed);
7095 end Expand_N_Qualified_Expression;
7097 ---------------------------------
7098 -- Expand_N_Selected_Component --
7099 ---------------------------------
7101 -- If the selector is a discriminant of a concurrent object, rewrite the
7102 -- prefix to denote the corresponding record type.
7104 procedure Expand_N_Selected_Component (N : Node_Id) is
7105 Loc : constant Source_Ptr := Sloc (N);
7106 Par : constant Node_Id := Parent (N);
7107 P : constant Node_Id := Prefix (N);
7108 Ptyp : Entity_Id := Underlying_Type (Etype (P));
7113 function In_Left_Hand_Side (Comp : Node_Id) return Boolean;
7114 -- Gigi needs a temporary for prefixes that depend on a discriminant,
7115 -- unless the context of an assignment can provide size information.
7116 -- Don't we have a general routine that does this???
7118 -----------------------
7119 -- In_Left_Hand_Side --
7120 -----------------------
7122 function In_Left_Hand_Side (Comp : Node_Id) return Boolean is
7124 return (Nkind (Parent (Comp)) = N_Assignment_Statement
7125 and then Comp = Name (Parent (Comp)))
7126 or else (Present (Parent (Comp))
7127 and then Nkind (Parent (Comp)) in N_Subexpr
7128 and then In_Left_Hand_Side (Parent (Comp)));
7129 end In_Left_Hand_Side;
7131 -- Start of processing for Expand_N_Selected_Component
7134 -- Insert explicit dereference if required
7136 if Is_Access_Type (Ptyp) then
7137 Insert_Explicit_Dereference (P);
7138 Analyze_And_Resolve (P, Designated_Type (Ptyp));
7140 if Ekind (Etype (P)) = E_Private_Subtype
7141 and then Is_For_Access_Subtype (Etype (P))
7143 Set_Etype (P, Base_Type (Etype (P)));
7149 -- Deal with discriminant check required
7151 if Do_Discriminant_Check (N) then
7153 -- Present the discriminant checking function to the backend, so that
7154 -- it can inline the call to the function.
7157 (Discriminant_Checking_Func
7158 (Original_Record_Component (Entity (Selector_Name (N)))));
7160 -- Now reset the flag and generate the call
7162 Set_Do_Discriminant_Check (N, False);
7163 Generate_Discriminant_Check (N);
7166 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
7167 -- function, then additional actuals must be passed.
7169 if Ada_Version >= Ada_05
7170 and then Is_Build_In_Place_Function_Call (P)
7172 Make_Build_In_Place_Call_In_Anonymous_Context (P);
7175 -- Gigi cannot handle unchecked conversions that are the prefix of a
7176 -- selected component with discriminants. This must be checked during
7177 -- expansion, because during analysis the type of the selector is not
7178 -- known at the point the prefix is analyzed. If the conversion is the
7179 -- target of an assignment, then we cannot force the evaluation.
7181 if Nkind (Prefix (N)) = N_Unchecked_Type_Conversion
7182 and then Has_Discriminants (Etype (N))
7183 and then not In_Left_Hand_Side (N)
7185 Force_Evaluation (Prefix (N));
7188 -- Remaining processing applies only if selector is a discriminant
7190 if Ekind (Entity (Selector_Name (N))) = E_Discriminant then
7192 -- If the selector is a discriminant of a constrained record type,
7193 -- we may be able to rewrite the expression with the actual value
7194 -- of the discriminant, a useful optimization in some cases.
7196 if Is_Record_Type (Ptyp)
7197 and then Has_Discriminants (Ptyp)
7198 and then Is_Constrained (Ptyp)
7200 -- Do this optimization for discrete types only, and not for
7201 -- access types (access discriminants get us into trouble!)
7203 if not Is_Discrete_Type (Etype (N)) then
7206 -- Don't do this on the left hand of an assignment statement.
7207 -- Normally one would think that references like this would
7208 -- not occur, but they do in generated code, and mean that
7209 -- we really do want to assign the discriminant!
7211 elsif Nkind (Par) = N_Assignment_Statement
7212 and then Name (Par) = N
7216 -- Don't do this optimization for the prefix of an attribute or
7217 -- the operand of an object renaming declaration since these are
7218 -- contexts where we do not want the value anyway.
7220 elsif (Nkind (Par) = N_Attribute_Reference
7221 and then Prefix (Par) = N)
7222 or else Is_Renamed_Object (N)
7226 -- Don't do this optimization if we are within the code for a
7227 -- discriminant check, since the whole point of such a check may
7228 -- be to verify the condition on which the code below depends!
7230 elsif Is_In_Discriminant_Check (N) then
7233 -- Green light to see if we can do the optimization. There is
7234 -- still one condition that inhibits the optimization below but
7235 -- now is the time to check the particular discriminant.
7238 -- Loop through discriminants to find the matching discriminant
7239 -- constraint to see if we can copy it.
7241 Disc := First_Discriminant (Ptyp);
7242 Dcon := First_Elmt (Discriminant_Constraint (Ptyp));
7243 Discr_Loop : while Present (Dcon) loop
7245 -- Check if this is the matching discriminant
7247 if Disc = Entity (Selector_Name (N)) then
7249 -- Here we have the matching discriminant. Check for
7250 -- the case of a discriminant of a component that is
7251 -- constrained by an outer discriminant, which cannot
7252 -- be optimized away.
7255 Denotes_Discriminant
7256 (Node (Dcon), Check_Concurrent => True)
7260 -- In the context of a case statement, the expression may
7261 -- have the base type of the discriminant, and we need to
7262 -- preserve the constraint to avoid spurious errors on
7265 elsif Nkind (Parent (N)) = N_Case_Statement
7266 and then Etype (Node (Dcon)) /= Etype (Disc)
7269 Make_Qualified_Expression (Loc,
7271 New_Occurrence_Of (Etype (Disc), Loc),
7273 New_Copy_Tree (Node (Dcon))));
7274 Analyze_And_Resolve (N, Etype (Disc));
7276 -- In case that comes out as a static expression,
7277 -- reset it (a selected component is never static).
7279 Set_Is_Static_Expression (N, False);
7282 -- Otherwise we can just copy the constraint, but the
7283 -- result is certainly not static! In some cases the
7284 -- discriminant constraint has been analyzed in the
7285 -- context of the original subtype indication, but for
7286 -- itypes the constraint might not have been analyzed
7287 -- yet, and this must be done now.
7290 Rewrite (N, New_Copy_Tree (Node (Dcon)));
7291 Analyze_And_Resolve (N);
7292 Set_Is_Static_Expression (N, False);
7298 Next_Discriminant (Disc);
7299 end loop Discr_Loop;
7301 -- Note: the above loop should always find a matching
7302 -- discriminant, but if it does not, we just missed an
7303 -- optimization due to some glitch (perhaps a previous error),
7309 -- The only remaining processing is in the case of a discriminant of
7310 -- a concurrent object, where we rewrite the prefix to denote the
7311 -- corresponding record type. If the type is derived and has renamed
7312 -- discriminants, use corresponding discriminant, which is the one
7313 -- that appears in the corresponding record.
7315 if not Is_Concurrent_Type (Ptyp) then
7319 Disc := Entity (Selector_Name (N));
7321 if Is_Derived_Type (Ptyp)
7322 and then Present (Corresponding_Discriminant (Disc))
7324 Disc := Corresponding_Discriminant (Disc);
7328 Make_Selected_Component (Loc,
7330 Unchecked_Convert_To (Corresponding_Record_Type (Ptyp),
7332 Selector_Name => Make_Identifier (Loc, Chars (Disc)));
7337 end Expand_N_Selected_Component;
7339 --------------------
7340 -- Expand_N_Slice --
7341 --------------------
7343 procedure Expand_N_Slice (N : Node_Id) is
7344 Loc : constant Source_Ptr := Sloc (N);
7345 Typ : constant Entity_Id := Etype (N);
7346 Pfx : constant Node_Id := Prefix (N);
7347 Ptp : Entity_Id := Etype (Pfx);
7349 function Is_Procedure_Actual (N : Node_Id) return Boolean;
7350 -- Check whether the argument is an actual for a procedure call, in
7351 -- which case the expansion of a bit-packed slice is deferred until the
7352 -- call itself is expanded. The reason this is required is that we might
7353 -- have an IN OUT or OUT parameter, and the copy out is essential, and
7354 -- that copy out would be missed if we created a temporary here in
7355 -- Expand_N_Slice. Note that we don't bother to test specifically for an
7356 -- IN OUT or OUT mode parameter, since it is a bit tricky to do, and it
7357 -- is harmless to defer expansion in the IN case, since the call
7358 -- processing will still generate the appropriate copy in operation,
7359 -- which will take care of the slice.
7361 procedure Make_Temporary;
7362 -- Create a named variable for the value of the slice, in cases where
7363 -- the back-end cannot handle it properly, e.g. when packed types or
7364 -- unaligned slices are involved.
7366 -------------------------
7367 -- Is_Procedure_Actual --
7368 -------------------------
7370 function Is_Procedure_Actual (N : Node_Id) return Boolean is
7371 Par : Node_Id := Parent (N);
7375 -- If our parent is a procedure call we can return
7377 if Nkind (Par) = N_Procedure_Call_Statement then
7380 -- If our parent is a type conversion, keep climbing the tree,
7381 -- since a type conversion can be a procedure actual. Also keep
7382 -- climbing if parameter association or a qualified expression,
7383 -- since these are additional cases that do can appear on
7384 -- procedure actuals.
7386 elsif Nkind_In (Par, N_Type_Conversion,
7387 N_Parameter_Association,
7388 N_Qualified_Expression)
7390 Par := Parent (Par);
7392 -- Any other case is not what we are looking for
7398 end Is_Procedure_Actual;
7400 --------------------
7401 -- Make_Temporary --
7402 --------------------
7404 procedure Make_Temporary is
7406 Ent : constant Entity_Id :=
7407 Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
7410 Make_Object_Declaration (Loc,
7411 Defining_Identifier => Ent,
7412 Object_Definition => New_Occurrence_Of (Typ, Loc));
7414 Set_No_Initialization (Decl);
7416 Insert_Actions (N, New_List (
7418 Make_Assignment_Statement (Loc,
7419 Name => New_Occurrence_Of (Ent, Loc),
7420 Expression => Relocate_Node (N))));
7422 Rewrite (N, New_Occurrence_Of (Ent, Loc));
7423 Analyze_And_Resolve (N, Typ);
7426 -- Start of processing for Expand_N_Slice
7429 -- Special handling for access types
7431 if Is_Access_Type (Ptp) then
7433 Ptp := Designated_Type (Ptp);
7436 Make_Explicit_Dereference (Sloc (N),
7437 Prefix => Relocate_Node (Pfx)));
7439 Analyze_And_Resolve (Pfx, Ptp);
7442 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
7443 -- function, then additional actuals must be passed.
7445 if Ada_Version >= Ada_05
7446 and then Is_Build_In_Place_Function_Call (Pfx)
7448 Make_Build_In_Place_Call_In_Anonymous_Context (Pfx);
7451 -- Range checks are potentially also needed for cases involving a slice
7452 -- indexed by a subtype indication, but Do_Range_Check can currently
7453 -- only be set for expressions ???
7455 if not Index_Checks_Suppressed (Ptp)
7456 and then (not Is_Entity_Name (Pfx)
7457 or else not Index_Checks_Suppressed (Entity (Pfx)))
7458 and then Nkind (Discrete_Range (N)) /= N_Subtype_Indication
7460 -- Do not enable range check to nodes associated with the frontend
7461 -- expansion of the dispatch table. We first check if Ada.Tags is
7462 -- already loaded to avoid the addition of an undesired dependence
7463 -- on such run-time unit.
7466 (not Tagged_Type_Expansion
7468 (RTU_Loaded (Ada_Tags)
7469 and then Nkind (Prefix (N)) = N_Selected_Component
7470 and then Present (Entity (Selector_Name (Prefix (N))))
7471 and then Entity (Selector_Name (Prefix (N))) =
7472 RTE_Record_Component (RE_Prims_Ptr)))
7474 Enable_Range_Check (Discrete_Range (N));
7477 -- The remaining case to be handled is packed slices. We can leave
7478 -- packed slices as they are in the following situations:
7480 -- 1. Right or left side of an assignment (we can handle this
7481 -- situation correctly in the assignment statement expansion).
7483 -- 2. Prefix of indexed component (the slide is optimized away in this
7484 -- case, see the start of Expand_N_Slice.)
7486 -- 3. Object renaming declaration, since we want the name of the
7487 -- slice, not the value.
7489 -- 4. Argument to procedure call, since copy-in/copy-out handling may
7490 -- be required, and this is handled in the expansion of call
7493 -- 5. Prefix of an address attribute (this is an error which is caught
7494 -- elsewhere, and the expansion would interfere with generating the
7497 if not Is_Packed (Typ) then
7499 -- Apply transformation for actuals of a function call, where
7500 -- Expand_Actuals is not used.
7502 if Nkind (Parent (N)) = N_Function_Call
7503 and then Is_Possibly_Unaligned_Slice (N)
7508 elsif Nkind (Parent (N)) = N_Assignment_Statement
7509 or else (Nkind (Parent (Parent (N))) = N_Assignment_Statement
7510 and then Parent (N) = Name (Parent (Parent (N))))
7514 elsif Nkind (Parent (N)) = N_Indexed_Component
7515 or else Is_Renamed_Object (N)
7516 or else Is_Procedure_Actual (N)
7520 elsif Nkind (Parent (N)) = N_Attribute_Reference
7521 and then Attribute_Name (Parent (N)) = Name_Address
7530 ------------------------------
7531 -- Expand_N_Type_Conversion --
7532 ------------------------------
7534 procedure Expand_N_Type_Conversion (N : Node_Id) is
7535 Loc : constant Source_Ptr := Sloc (N);
7536 Operand : constant Node_Id := Expression (N);
7537 Target_Type : constant Entity_Id := Etype (N);
7538 Operand_Type : Entity_Id := Etype (Operand);
7540 procedure Handle_Changed_Representation;
7541 -- This is called in the case of record and array type conversions to
7542 -- see if there is a change of representation to be handled. Change of
7543 -- representation is actually handled at the assignment statement level,
7544 -- and what this procedure does is rewrite node N conversion as an
7545 -- assignment to temporary. If there is no change of representation,
7546 -- then the conversion node is unchanged.
7548 procedure Real_Range_Check;
7549 -- Handles generation of range check for real target value
7551 -----------------------------------
7552 -- Handle_Changed_Representation --
7553 -----------------------------------
7555 procedure Handle_Changed_Representation is
7564 -- Nothing else to do if no change of representation
7566 if Same_Representation (Operand_Type, Target_Type) then
7569 -- The real change of representation work is done by the assignment
7570 -- statement processing. So if this type conversion is appearing as
7571 -- the expression of an assignment statement, nothing needs to be
7572 -- done to the conversion.
7574 elsif Nkind (Parent (N)) = N_Assignment_Statement then
7577 -- Otherwise we need to generate a temporary variable, and do the
7578 -- change of representation assignment into that temporary variable.
7579 -- The conversion is then replaced by a reference to this variable.
7584 -- If type is unconstrained we have to add a constraint, copied
7585 -- from the actual value of the left hand side.
7587 if not Is_Constrained (Target_Type) then
7588 if Has_Discriminants (Operand_Type) then
7589 Disc := First_Discriminant (Operand_Type);
7591 if Disc /= First_Stored_Discriminant (Operand_Type) then
7592 Disc := First_Stored_Discriminant (Operand_Type);
7596 while Present (Disc) loop
7598 Make_Selected_Component (Loc,
7599 Prefix => Duplicate_Subexpr_Move_Checks (Operand),
7601 Make_Identifier (Loc, Chars (Disc))));
7602 Next_Discriminant (Disc);
7605 elsif Is_Array_Type (Operand_Type) then
7606 N_Ix := First_Index (Target_Type);
7609 for J in 1 .. Number_Dimensions (Operand_Type) loop
7611 -- We convert the bounds explicitly. We use an unchecked
7612 -- conversion because bounds checks are done elsewhere.
7617 Unchecked_Convert_To (Etype (N_Ix),
7618 Make_Attribute_Reference (Loc,
7620 Duplicate_Subexpr_No_Checks
7621 (Operand, Name_Req => True),
7622 Attribute_Name => Name_First,
7623 Expressions => New_List (
7624 Make_Integer_Literal (Loc, J)))),
7627 Unchecked_Convert_To (Etype (N_Ix),
7628 Make_Attribute_Reference (Loc,
7630 Duplicate_Subexpr_No_Checks
7631 (Operand, Name_Req => True),
7632 Attribute_Name => Name_Last,
7633 Expressions => New_List (
7634 Make_Integer_Literal (Loc, J))))));
7641 Odef := New_Occurrence_Of (Target_Type, Loc);
7643 if Present (Cons) then
7645 Make_Subtype_Indication (Loc,
7646 Subtype_Mark => Odef,
7648 Make_Index_Or_Discriminant_Constraint (Loc,
7649 Constraints => Cons));
7652 Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('C'));
7654 Make_Object_Declaration (Loc,
7655 Defining_Identifier => Temp,
7656 Object_Definition => Odef);
7658 Set_No_Initialization (Decl, True);
7660 -- Insert required actions. It is essential to suppress checks
7661 -- since we have suppressed default initialization, which means
7662 -- that the variable we create may have no discriminants.
7667 Make_Assignment_Statement (Loc,
7668 Name => New_Occurrence_Of (Temp, Loc),
7669 Expression => Relocate_Node (N))),
7670 Suppress => All_Checks);
7672 Rewrite (N, New_Occurrence_Of (Temp, Loc));
7675 end Handle_Changed_Representation;
7677 ----------------------
7678 -- Real_Range_Check --
7679 ----------------------
7681 -- Case of conversions to floating-point or fixed-point. If range checks
7682 -- are enabled and the target type has a range constraint, we convert:
7688 -- Tnn : typ'Base := typ'Base (x);
7689 -- [constraint_error when Tnn < typ'First or else Tnn > typ'Last]
7692 -- This is necessary when there is a conversion of integer to float or
7693 -- to fixed-point to ensure that the correct checks are made. It is not
7694 -- necessary for float to float where it is enough to simply set the
7695 -- Do_Range_Check flag.
7697 procedure Real_Range_Check is
7698 Btyp : constant Entity_Id := Base_Type (Target_Type);
7699 Lo : constant Node_Id := Type_Low_Bound (Target_Type);
7700 Hi : constant Node_Id := Type_High_Bound (Target_Type);
7701 Xtyp : constant Entity_Id := Etype (Operand);
7706 -- Nothing to do if conversion was rewritten
7708 if Nkind (N) /= N_Type_Conversion then
7712 -- Nothing to do if range checks suppressed, or target has the same
7713 -- range as the base type (or is the base type).
7715 if Range_Checks_Suppressed (Target_Type)
7716 or else (Lo = Type_Low_Bound (Btyp)
7718 Hi = Type_High_Bound (Btyp))
7723 -- Nothing to do if expression is an entity on which checks have been
7726 if Is_Entity_Name (Operand)
7727 and then Range_Checks_Suppressed (Entity (Operand))
7732 -- Nothing to do if bounds are all static and we can tell that the
7733 -- expression is within the bounds of the target. Note that if the
7734 -- operand is of an unconstrained floating-point type, then we do
7735 -- not trust it to be in range (might be infinite)
7738 S_Lo : constant Node_Id := Type_Low_Bound (Xtyp);
7739 S_Hi : constant Node_Id := Type_High_Bound (Xtyp);
7742 if (not Is_Floating_Point_Type (Xtyp)
7743 or else Is_Constrained (Xtyp))
7744 and then Compile_Time_Known_Value (S_Lo)
7745 and then Compile_Time_Known_Value (S_Hi)
7746 and then Compile_Time_Known_Value (Hi)
7747 and then Compile_Time_Known_Value (Lo)
7750 D_Lov : constant Ureal := Expr_Value_R (Lo);
7751 D_Hiv : constant Ureal := Expr_Value_R (Hi);
7756 if Is_Real_Type (Xtyp) then
7757 S_Lov := Expr_Value_R (S_Lo);
7758 S_Hiv := Expr_Value_R (S_Hi);
7760 S_Lov := UR_From_Uint (Expr_Value (S_Lo));
7761 S_Hiv := UR_From_Uint (Expr_Value (S_Hi));
7765 and then S_Lov >= D_Lov
7766 and then S_Hiv <= D_Hiv
7768 Set_Do_Range_Check (Operand, False);
7775 -- For float to float conversions, we are done
7777 if Is_Floating_Point_Type (Xtyp)
7779 Is_Floating_Point_Type (Btyp)
7784 -- Otherwise rewrite the conversion as described above
7786 Conv := Relocate_Node (N);
7788 (Subtype_Mark (Conv), New_Occurrence_Of (Btyp, Loc));
7789 Set_Etype (Conv, Btyp);
7791 -- Enable overflow except for case of integer to float conversions,
7792 -- where it is never required, since we can never have overflow in
7795 if not Is_Integer_Type (Etype (Operand)) then
7796 Enable_Overflow_Check (Conv);
7800 Make_Defining_Identifier (Loc,
7801 Chars => New_Internal_Name ('T'));
7803 Insert_Actions (N, New_List (
7804 Make_Object_Declaration (Loc,
7805 Defining_Identifier => Tnn,
7806 Object_Definition => New_Occurrence_Of (Btyp, Loc),
7807 Expression => Conv),
7809 Make_Raise_Constraint_Error (Loc,
7814 Left_Opnd => New_Occurrence_Of (Tnn, Loc),
7816 Make_Attribute_Reference (Loc,
7817 Attribute_Name => Name_First,
7819 New_Occurrence_Of (Target_Type, Loc))),
7823 Left_Opnd => New_Occurrence_Of (Tnn, Loc),
7825 Make_Attribute_Reference (Loc,
7826 Attribute_Name => Name_Last,
7828 New_Occurrence_Of (Target_Type, Loc)))),
7829 Reason => CE_Range_Check_Failed)));
7831 Rewrite (N, New_Occurrence_Of (Tnn, Loc));
7832 Analyze_And_Resolve (N, Btyp);
7833 end Real_Range_Check;
7835 -- Start of processing for Expand_N_Type_Conversion
7838 -- Nothing at all to do if conversion is to the identical type so remove
7839 -- the conversion completely, it is useless.
7841 if Operand_Type = Target_Type then
7842 Rewrite (N, Relocate_Node (Operand));
7846 -- Nothing to do if this is the second argument of read. This is a
7847 -- "backwards" conversion that will be handled by the specialized code
7848 -- in attribute processing.
7850 if Nkind (Parent (N)) = N_Attribute_Reference
7851 and then Attribute_Name (Parent (N)) = Name_Read
7852 and then Next (First (Expressions (Parent (N)))) = N
7857 -- Here if we may need to expand conversion
7859 -- Do validity check if validity checking operands
7861 if Validity_Checks_On
7862 and then Validity_Check_Operands
7864 Ensure_Valid (Operand);
7867 -- Special case of converting from non-standard boolean type
7869 if Is_Boolean_Type (Operand_Type)
7870 and then (Nonzero_Is_True (Operand_Type))
7872 Adjust_Condition (Operand);
7873 Set_Etype (Operand, Standard_Boolean);
7874 Operand_Type := Standard_Boolean;
7877 -- Case of converting to an access type
7879 if Is_Access_Type (Target_Type) then
7881 -- Apply an accessibility check when the conversion operand is an
7882 -- access parameter (or a renaming thereof), unless conversion was
7883 -- expanded from an Unchecked_ or Unrestricted_Access attribute.
7884 -- Note that other checks may still need to be applied below (such
7885 -- as tagged type checks).
7887 if Is_Entity_Name (Operand)
7889 (Is_Formal (Entity (Operand))
7891 (Present (Renamed_Object (Entity (Operand)))
7892 and then Is_Entity_Name (Renamed_Object (Entity (Operand)))
7894 (Entity (Renamed_Object (Entity (Operand))))))
7895 and then Ekind (Etype (Operand)) = E_Anonymous_Access_Type
7896 and then (Nkind (Original_Node (N)) /= N_Attribute_Reference
7897 or else Attribute_Name (Original_Node (N)) = Name_Access)
7899 Apply_Accessibility_Check
7900 (Operand, Target_Type, Insert_Node => Operand);
7902 -- If the level of the operand type is statically deeper than the
7903 -- level of the target type, then force Program_Error. Note that this
7904 -- can only occur for cases where the attribute is within the body of
7905 -- an instantiation (otherwise the conversion will already have been
7906 -- rejected as illegal). Note: warnings are issued by the analyzer
7907 -- for the instance cases.
7909 elsif In_Instance_Body
7910 and then Type_Access_Level (Operand_Type) >
7911 Type_Access_Level (Target_Type)
7914 Make_Raise_Program_Error (Sloc (N),
7915 Reason => PE_Accessibility_Check_Failed));
7916 Set_Etype (N, Target_Type);
7918 -- When the operand is a selected access discriminant the check needs
7919 -- to be made against the level of the object denoted by the prefix
7920 -- of the selected name. Force Program_Error for this case as well
7921 -- (this accessibility violation can only happen if within the body
7922 -- of an instantiation).
7924 elsif In_Instance_Body
7925 and then Ekind (Operand_Type) = E_Anonymous_Access_Type
7926 and then Nkind (Operand) = N_Selected_Component
7927 and then Object_Access_Level (Operand) >
7928 Type_Access_Level (Target_Type)
7931 Make_Raise_Program_Error (Sloc (N),
7932 Reason => PE_Accessibility_Check_Failed));
7933 Set_Etype (N, Target_Type);
7939 -- Case of conversions of tagged types and access to tagged types
7941 -- When needed, that is to say when the expression is class-wide, Add
7942 -- runtime a tag check for (strict) downward conversion by using the
7943 -- membership test, generating:
7945 -- [constraint_error when Operand not in Target_Type'Class]
7947 -- or in the access type case
7949 -- [constraint_error
7950 -- when Operand /= null
7951 -- and then Operand.all not in
7952 -- Designated_Type (Target_Type)'Class]
7954 if (Is_Access_Type (Target_Type)
7955 and then Is_Tagged_Type (Designated_Type (Target_Type)))
7956 or else Is_Tagged_Type (Target_Type)
7958 -- Do not do any expansion in the access type case if the parent is a
7959 -- renaming, since this is an error situation which will be caught by
7960 -- Sem_Ch8, and the expansion can interfere with this error check.
7962 if Is_Access_Type (Target_Type)
7963 and then Is_Renamed_Object (N)
7968 -- Otherwise, proceed with processing tagged conversion
7971 Actual_Op_Typ : Entity_Id;
7972 Actual_Targ_Typ : Entity_Id;
7973 Make_Conversion : Boolean := False;
7974 Root_Op_Typ : Entity_Id;
7976 procedure Make_Tag_Check (Targ_Typ : Entity_Id);
7977 -- Create a membership check to test whether Operand is a member
7978 -- of Targ_Typ. If the original Target_Type is an access, include
7979 -- a test for null value. The check is inserted at N.
7981 --------------------
7982 -- Make_Tag_Check --
7983 --------------------
7985 procedure Make_Tag_Check (Targ_Typ : Entity_Id) is
7990 -- [Constraint_Error
7991 -- when Operand /= null
7992 -- and then Operand.all not in Targ_Typ]
7994 if Is_Access_Type (Target_Type) then
7999 Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
8000 Right_Opnd => Make_Null (Loc)),
8005 Make_Explicit_Dereference (Loc,
8006 Prefix => Duplicate_Subexpr_No_Checks (Operand)),
8007 Right_Opnd => New_Reference_To (Targ_Typ, Loc)));
8010 -- [Constraint_Error when Operand not in Targ_Typ]
8015 Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
8016 Right_Opnd => New_Reference_To (Targ_Typ, Loc));
8020 Make_Raise_Constraint_Error (Loc,
8022 Reason => CE_Tag_Check_Failed));
8025 -- Start of processing
8028 if Is_Access_Type (Target_Type) then
8030 -- Handle entities from the limited view
8033 Available_View (Designated_Type (Operand_Type));
8035 Available_View (Designated_Type (Target_Type));
8037 Actual_Op_Typ := Operand_Type;
8038 Actual_Targ_Typ := Target_Type;
8041 Root_Op_Typ := Root_Type (Actual_Op_Typ);
8043 -- Ada 2005 (AI-251): Handle interface type conversion
8045 if Is_Interface (Actual_Op_Typ) then
8046 Expand_Interface_Conversion (N, Is_Static => False);
8050 if not Tag_Checks_Suppressed (Actual_Targ_Typ) then
8052 -- Create a runtime tag check for a downward class-wide type
8055 if Is_Class_Wide_Type (Actual_Op_Typ)
8056 and then Actual_Op_Typ /= Actual_Targ_Typ
8057 and then Root_Op_Typ /= Actual_Targ_Typ
8058 and then Is_Ancestor (Root_Op_Typ, Actual_Targ_Typ)
8060 Make_Tag_Check (Class_Wide_Type (Actual_Targ_Typ));
8061 Make_Conversion := True;
8064 -- AI05-0073: If the result subtype of the function is defined
8065 -- by an access_definition designating a specific tagged type
8066 -- T, a check is made that the result value is null or the tag
8067 -- of the object designated by the result value identifies T.
8068 -- Constraint_Error is raised if this check fails.
8070 if Nkind (Parent (N)) = Sinfo.N_Return_Statement then
8073 Func_Typ : Entity_Id;
8076 -- Climb scope stack looking for the enclosing function
8078 Func := Current_Scope;
8079 while Present (Func)
8080 and then Ekind (Func) /= E_Function
8082 Func := Scope (Func);
8085 -- The function's return subtype must be defined using
8086 -- an access definition.
8088 if Nkind (Result_Definition (Parent (Func))) =
8091 Func_Typ := Directly_Designated_Type (Etype (Func));
8093 -- The return subtype denotes a specific tagged type,
8094 -- in other words, a non class-wide type.
8096 if Is_Tagged_Type (Func_Typ)
8097 and then not Is_Class_Wide_Type (Func_Typ)
8099 Make_Tag_Check (Actual_Targ_Typ);
8100 Make_Conversion := True;
8106 -- We have generated a tag check for either a class-wide type
8107 -- conversion or for AI05-0073.
8109 if Make_Conversion then
8114 Make_Unchecked_Type_Conversion (Loc,
8115 Subtype_Mark => New_Occurrence_Of (Target_Type, Loc),
8116 Expression => Relocate_Node (Expression (N)));
8118 Analyze_And_Resolve (N, Target_Type);
8124 -- Case of other access type conversions
8126 elsif Is_Access_Type (Target_Type) then
8127 Apply_Constraint_Check (Operand, Target_Type);
8129 -- Case of conversions from a fixed-point type
8131 -- These conversions require special expansion and processing, found in
8132 -- the Exp_Fixd package. We ignore cases where Conversion_OK is set,
8133 -- since from a semantic point of view, these are simple integer
8134 -- conversions, which do not need further processing.
8136 elsif Is_Fixed_Point_Type (Operand_Type)
8137 and then not Conversion_OK (N)
8139 -- We should never see universal fixed at this case, since the
8140 -- expansion of the constituent divide or multiply should have
8141 -- eliminated the explicit mention of universal fixed.
8143 pragma Assert (Operand_Type /= Universal_Fixed);
8145 -- Check for special case of the conversion to universal real that
8146 -- occurs as a result of the use of a round attribute. In this case,
8147 -- the real type for the conversion is taken from the target type of
8148 -- the Round attribute and the result must be marked as rounded.
8150 if Target_Type = Universal_Real
8151 and then Nkind (Parent (N)) = N_Attribute_Reference
8152 and then Attribute_Name (Parent (N)) = Name_Round
8154 Set_Rounded_Result (N);
8155 Set_Etype (N, Etype (Parent (N)));
8158 -- Otherwise do correct fixed-conversion, but skip these if the
8159 -- Conversion_OK flag is set, because from a semantic point of
8160 -- view these are simple integer conversions needing no further
8161 -- processing (the backend will simply treat them as integers)
8163 if not Conversion_OK (N) then
8164 if Is_Fixed_Point_Type (Etype (N)) then
8165 Expand_Convert_Fixed_To_Fixed (N);
8168 elsif Is_Integer_Type (Etype (N)) then
8169 Expand_Convert_Fixed_To_Integer (N);
8172 pragma Assert (Is_Floating_Point_Type (Etype (N)));
8173 Expand_Convert_Fixed_To_Float (N);
8178 -- Case of conversions to a fixed-point type
8180 -- These conversions require special expansion and processing, found in
8181 -- the Exp_Fixd package. Again, ignore cases where Conversion_OK is set,
8182 -- since from a semantic point of view, these are simple integer
8183 -- conversions, which do not need further processing.
8185 elsif Is_Fixed_Point_Type (Target_Type)
8186 and then not Conversion_OK (N)
8188 if Is_Integer_Type (Operand_Type) then
8189 Expand_Convert_Integer_To_Fixed (N);
8192 pragma Assert (Is_Floating_Point_Type (Operand_Type));
8193 Expand_Convert_Float_To_Fixed (N);
8197 -- Case of float-to-integer conversions
8199 -- We also handle float-to-fixed conversions with Conversion_OK set
8200 -- since semantically the fixed-point target is treated as though it
8201 -- were an integer in such cases.
8203 elsif Is_Floating_Point_Type (Operand_Type)
8205 (Is_Integer_Type (Target_Type)
8207 (Is_Fixed_Point_Type (Target_Type) and then Conversion_OK (N)))
8209 -- One more check here, gcc is still not able to do conversions of
8210 -- this type with proper overflow checking, and so gigi is doing an
8211 -- approximation of what is required by doing floating-point compares
8212 -- with the end-point. But that can lose precision in some cases, and
8213 -- give a wrong result. Converting the operand to Universal_Real is
8214 -- helpful, but still does not catch all cases with 64-bit integers
8215 -- on targets with only 64-bit floats
8217 -- The above comment seems obsoleted by Apply_Float_Conversion_Check
8218 -- Can this code be removed ???
8220 if Do_Range_Check (Operand) then
8222 Make_Type_Conversion (Loc,
8224 New_Occurrence_Of (Universal_Real, Loc),
8226 Relocate_Node (Operand)));
8228 Set_Etype (Operand, Universal_Real);
8229 Enable_Range_Check (Operand);
8230 Set_Do_Range_Check (Expression (Operand), False);
8233 -- Case of array conversions
8235 -- Expansion of array conversions, add required length/range checks but
8236 -- only do this if there is no change of representation. For handling of
8237 -- this case, see Handle_Changed_Representation.
8239 elsif Is_Array_Type (Target_Type) then
8241 if Is_Constrained (Target_Type) then
8242 Apply_Length_Check (Operand, Target_Type);
8244 Apply_Range_Check (Operand, Target_Type);
8247 Handle_Changed_Representation;
8249 -- Case of conversions of discriminated types
8251 -- Add required discriminant checks if target is constrained. Again this
8252 -- change is skipped if we have a change of representation.
8254 elsif Has_Discriminants (Target_Type)
8255 and then Is_Constrained (Target_Type)
8257 Apply_Discriminant_Check (Operand, Target_Type);
8258 Handle_Changed_Representation;
8260 -- Case of all other record conversions. The only processing required
8261 -- is to check for a change of representation requiring the special
8262 -- assignment processing.
8264 elsif Is_Record_Type (Target_Type) then
8266 -- Ada 2005 (AI-216): Program_Error is raised when converting from
8267 -- a derived Unchecked_Union type to an unconstrained type that is
8268 -- not Unchecked_Union if the operand lacks inferable discriminants.
8270 if Is_Derived_Type (Operand_Type)
8271 and then Is_Unchecked_Union (Base_Type (Operand_Type))
8272 and then not Is_Constrained (Target_Type)
8273 and then not Is_Unchecked_Union (Base_Type (Target_Type))
8274 and then not Has_Inferable_Discriminants (Operand)
8276 -- To prevent Gigi from generating illegal code, we generate a
8277 -- Program_Error node, but we give it the target type of the
8281 PE : constant Node_Id := Make_Raise_Program_Error (Loc,
8282 Reason => PE_Unchecked_Union_Restriction);
8285 Set_Etype (PE, Target_Type);
8290 Handle_Changed_Representation;
8293 -- Case of conversions of enumeration types
8295 elsif Is_Enumeration_Type (Target_Type) then
8297 -- Special processing is required if there is a change of
8298 -- representation (from enumeration representation clauses)
8300 if not Same_Representation (Target_Type, Operand_Type) then
8302 -- Convert: x(y) to x'val (ytyp'val (y))
8305 Make_Attribute_Reference (Loc,
8306 Prefix => New_Occurrence_Of (Target_Type, Loc),
8307 Attribute_Name => Name_Val,
8308 Expressions => New_List (
8309 Make_Attribute_Reference (Loc,
8310 Prefix => New_Occurrence_Of (Operand_Type, Loc),
8311 Attribute_Name => Name_Pos,
8312 Expressions => New_List (Operand)))));
8314 Analyze_And_Resolve (N, Target_Type);
8317 -- Case of conversions to floating-point
8319 elsif Is_Floating_Point_Type (Target_Type) then
8323 -- At this stage, either the conversion node has been transformed into
8324 -- some other equivalent expression, or left as a conversion that can
8325 -- be handled by Gigi. The conversions that Gigi can handle are the
8328 -- Conversions with no change of representation or type
8330 -- Numeric conversions involving integer, floating- and fixed-point
8331 -- values. Fixed-point values are allowed only if Conversion_OK is
8332 -- set, i.e. if the fixed-point values are to be treated as integers.
8334 -- No other conversions should be passed to Gigi
8336 -- Check: are these rules stated in sinfo??? if so, why restate here???
8338 -- The only remaining step is to generate a range check if we still have
8339 -- a type conversion at this stage and Do_Range_Check is set. For now we
8340 -- do this only for conversions of discrete types.
8342 if Nkind (N) = N_Type_Conversion
8343 and then Is_Discrete_Type (Etype (N))
8346 Expr : constant Node_Id := Expression (N);
8351 if Do_Range_Check (Expr)
8352 and then Is_Discrete_Type (Etype (Expr))
8354 Set_Do_Range_Check (Expr, False);
8356 -- Before we do a range check, we have to deal with treating a
8357 -- fixed-point operand as an integer. The way we do this is
8358 -- simply to do an unchecked conversion to an appropriate
8359 -- integer type large enough to hold the result.
8361 -- This code is not active yet, because we are only dealing
8362 -- with discrete types so far ???
8364 if Nkind (Expr) in N_Has_Treat_Fixed_As_Integer
8365 and then Treat_Fixed_As_Integer (Expr)
8367 Ftyp := Base_Type (Etype (Expr));
8369 if Esize (Ftyp) >= Esize (Standard_Integer) then
8370 Ityp := Standard_Long_Long_Integer;
8372 Ityp := Standard_Integer;
8375 Rewrite (Expr, Unchecked_Convert_To (Ityp, Expr));
8378 -- Reset overflow flag, since the range check will include
8379 -- dealing with possible overflow, and generate the check If
8380 -- Address is either a source type or target type, suppress
8381 -- range check to avoid typing anomalies when it is a visible
8384 Set_Do_Overflow_Check (N, False);
8385 if not Is_Descendent_Of_Address (Etype (Expr))
8386 and then not Is_Descendent_Of_Address (Target_Type)
8388 Generate_Range_Check
8389 (Expr, Target_Type, CE_Range_Check_Failed);
8395 -- Final step, if the result is a type conversion involving Vax_Float
8396 -- types, then it is subject for further special processing.
8398 if Nkind (N) = N_Type_Conversion
8399 and then (Vax_Float (Operand_Type) or else Vax_Float (Target_Type))
8401 Expand_Vax_Conversion (N);
8404 end Expand_N_Type_Conversion;
8406 -----------------------------------
8407 -- Expand_N_Unchecked_Expression --
8408 -----------------------------------
8410 -- Remove the unchecked expression node from the tree. It's job was simply
8411 -- to make sure that its constituent expression was handled with checks
8412 -- off, and now that that is done, we can remove it from the tree, and
8413 -- indeed must, since gigi does not expect to see these nodes.
8415 procedure Expand_N_Unchecked_Expression (N : Node_Id) is
8416 Exp : constant Node_Id := Expression (N);
8419 Set_Assignment_OK (Exp, Assignment_OK (N) or Assignment_OK (Exp));
8421 end Expand_N_Unchecked_Expression;
8423 ----------------------------------------
8424 -- Expand_N_Unchecked_Type_Conversion --
8425 ----------------------------------------
8427 -- If this cannot be handled by Gigi and we haven't already made a
8428 -- temporary for it, do it now.
8430 procedure Expand_N_Unchecked_Type_Conversion (N : Node_Id) is
8431 Target_Type : constant Entity_Id := Etype (N);
8432 Operand : constant Node_Id := Expression (N);
8433 Operand_Type : constant Entity_Id := Etype (Operand);
8436 -- If we have a conversion of a compile time known value to a target
8437 -- type and the value is in range of the target type, then we can simply
8438 -- replace the construct by an integer literal of the correct type. We
8439 -- only apply this to integer types being converted. Possibly it may
8440 -- apply in other cases, but it is too much trouble to worry about.
8442 -- Note that we do not do this transformation if the Kill_Range_Check
8443 -- flag is set, since then the value may be outside the expected range.
8444 -- This happens in the Normalize_Scalars case.
8446 -- We also skip this if either the target or operand type is biased
8447 -- because in this case, the unchecked conversion is supposed to
8448 -- preserve the bit pattern, not the integer value.
8450 if Is_Integer_Type (Target_Type)
8451 and then not Has_Biased_Representation (Target_Type)
8452 and then Is_Integer_Type (Operand_Type)
8453 and then not Has_Biased_Representation (Operand_Type)
8454 and then Compile_Time_Known_Value (Operand)
8455 and then not Kill_Range_Check (N)
8458 Val : constant Uint := Expr_Value (Operand);
8461 if Compile_Time_Known_Value (Type_Low_Bound (Target_Type))
8463 Compile_Time_Known_Value (Type_High_Bound (Target_Type))
8465 Val >= Expr_Value (Type_Low_Bound (Target_Type))
8467 Val <= Expr_Value (Type_High_Bound (Target_Type))
8469 Rewrite (N, Make_Integer_Literal (Sloc (N), Val));
8471 -- If Address is the target type, just set the type to avoid a
8472 -- spurious type error on the literal when Address is a visible
8475 if Is_Descendent_Of_Address (Target_Type) then
8476 Set_Etype (N, Target_Type);
8478 Analyze_And_Resolve (N, Target_Type);
8486 -- Nothing to do if conversion is safe
8488 if Safe_Unchecked_Type_Conversion (N) then
8492 -- Otherwise force evaluation unless Assignment_OK flag is set (this
8493 -- flag indicates ??? -- more comments needed here)
8495 if Assignment_OK (N) then
8498 Force_Evaluation (N);
8500 end Expand_N_Unchecked_Type_Conversion;
8502 ----------------------------
8503 -- Expand_Record_Equality --
8504 ----------------------------
8506 -- For non-variant records, Equality is expanded when needed into:
8508 -- and then Lhs.Discr1 = Rhs.Discr1
8510 -- and then Lhs.Discrn = Rhs.Discrn
8511 -- and then Lhs.Cmp1 = Rhs.Cmp1
8513 -- and then Lhs.Cmpn = Rhs.Cmpn
8515 -- The expression is folded by the back-end for adjacent fields. This
8516 -- function is called for tagged record in only one occasion: for imple-
8517 -- menting predefined primitive equality (see Predefined_Primitives_Bodies)
8518 -- otherwise the primitive "=" is used directly.
8520 function Expand_Record_Equality
8525 Bodies : List_Id) return Node_Id
8527 Loc : constant Source_Ptr := Sloc (Nod);
8532 First_Time : Boolean := True;
8534 function Suitable_Element (C : Entity_Id) return Entity_Id;
8535 -- Return the first field to compare beginning with C, skipping the
8536 -- inherited components.
8538 ----------------------
8539 -- Suitable_Element --
8540 ----------------------
8542 function Suitable_Element (C : Entity_Id) return Entity_Id is
8547 elsif Ekind (C) /= E_Discriminant
8548 and then Ekind (C) /= E_Component
8550 return Suitable_Element (Next_Entity (C));
8552 elsif Is_Tagged_Type (Typ)
8553 and then C /= Original_Record_Component (C)
8555 return Suitable_Element (Next_Entity (C));
8557 elsif Chars (C) = Name_uController
8558 or else Chars (C) = Name_uTag
8560 return Suitable_Element (Next_Entity (C));
8562 elsif Is_Interface (Etype (C)) then
8563 return Suitable_Element (Next_Entity (C));
8568 end Suitable_Element;
8570 -- Start of processing for Expand_Record_Equality
8573 -- Generates the following code: (assuming that Typ has one Discr and
8574 -- component C2 is also a record)
8577 -- and then Lhs.Discr1 = Rhs.Discr1
8578 -- and then Lhs.C1 = Rhs.C1
8579 -- and then Lhs.C2.C1=Rhs.C2.C1 and then ... Lhs.C2.Cn=Rhs.C2.Cn
8581 -- and then Lhs.Cmpn = Rhs.Cmpn
8583 Result := New_Reference_To (Standard_True, Loc);
8584 C := Suitable_Element (First_Entity (Typ));
8586 while Present (C) loop
8594 First_Time := False;
8598 New_Lhs := New_Copy_Tree (Lhs);
8599 New_Rhs := New_Copy_Tree (Rhs);
8603 Expand_Composite_Equality (Nod, Etype (C),
8605 Make_Selected_Component (Loc,
8607 Selector_Name => New_Reference_To (C, Loc)),
8609 Make_Selected_Component (Loc,
8611 Selector_Name => New_Reference_To (C, Loc)),
8614 -- If some (sub)component is an unchecked_union, the whole
8615 -- operation will raise program error.
8617 if Nkind (Check) = N_Raise_Program_Error then
8619 Set_Etype (Result, Standard_Boolean);
8624 Left_Opnd => Result,
8625 Right_Opnd => Check);
8629 C := Suitable_Element (Next_Entity (C));
8633 end Expand_Record_Equality;
8635 -------------------------------------
8636 -- Fixup_Universal_Fixed_Operation --
8637 -------------------------------------
8639 procedure Fixup_Universal_Fixed_Operation (N : Node_Id) is
8640 Conv : constant Node_Id := Parent (N);
8643 -- We must have a type conversion immediately above us
8645 pragma Assert (Nkind (Conv) = N_Type_Conversion);
8647 -- Normally the type conversion gives our target type. The exception
8648 -- occurs in the case of the Round attribute, where the conversion
8649 -- will be to universal real, and our real type comes from the Round
8650 -- attribute (as well as an indication that we must round the result)
8652 if Nkind (Parent (Conv)) = N_Attribute_Reference
8653 and then Attribute_Name (Parent (Conv)) = Name_Round
8655 Set_Etype (N, Etype (Parent (Conv)));
8656 Set_Rounded_Result (N);
8658 -- Normal case where type comes from conversion above us
8661 Set_Etype (N, Etype (Conv));
8663 end Fixup_Universal_Fixed_Operation;
8665 ------------------------------
8666 -- Get_Allocator_Final_List --
8667 ------------------------------
8669 function Get_Allocator_Final_List
8672 PtrT : Entity_Id) return Entity_Id
8674 Loc : constant Source_Ptr := Sloc (N);
8676 Owner : Entity_Id := PtrT;
8677 -- The entity whose finalization list must be used to attach the
8678 -- allocated object.
8681 if Ekind (PtrT) = E_Anonymous_Access_Type then
8683 -- If the context is an access parameter, we need to create a
8684 -- non-anonymous access type in order to have a usable final list,
8685 -- because there is otherwise no pool to which the allocated object
8686 -- can belong. We create both the type and the finalization chain
8687 -- here, because freezing an internal type does not create such a
8688 -- chain. The Final_Chain that is thus created is shared by the
8689 -- access parameter. The access type is tested against the result
8690 -- type of the function to exclude allocators whose type is an
8691 -- anonymous access result type. We freeze the type at once to
8692 -- ensure that it is properly decorated for the back-end, even
8693 -- if the context and current scope is a loop.
8695 if Nkind (Associated_Node_For_Itype (PtrT))
8696 in N_Subprogram_Specification
8699 Etype (Defining_Unit_Name (Associated_Node_For_Itype (PtrT)))
8701 Owner := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
8703 Make_Full_Type_Declaration (Loc,
8704 Defining_Identifier => Owner,
8706 Make_Access_To_Object_Definition (Loc,
8707 Subtype_Indication =>
8708 New_Occurrence_Of (T, Loc))));
8710 Freeze_Before (N, Owner);
8711 Build_Final_List (N, Owner);
8712 Set_Associated_Final_Chain (PtrT, Associated_Final_Chain (Owner));
8714 -- Ada 2005 (AI-318-02): If the context is a return object
8715 -- declaration, then the anonymous return subtype is defined to have
8716 -- the same accessibility level as that of the function's result
8717 -- subtype, which means that we want the scope where the function is
8720 elsif Nkind (Associated_Node_For_Itype (PtrT)) = N_Object_Declaration
8721 and then Ekind (Scope (PtrT)) = E_Return_Statement
8723 Owner := Scope (Return_Applies_To (Scope (PtrT)));
8725 -- Case of an access discriminant, or (Ada 2005), of an anonymous
8726 -- access component or anonymous access function result: find the
8727 -- final list associated with the scope of the type. (In the
8728 -- anonymous access component kind, a list controller will have
8729 -- been allocated when freezing the record type, and PtrT has an
8730 -- Associated_Final_Chain attribute designating it.)
8732 elsif No (Associated_Final_Chain (PtrT)) then
8733 Owner := Scope (PtrT);
8737 return Find_Final_List (Owner);
8738 end Get_Allocator_Final_List;
8740 ---------------------------------
8741 -- Has_Inferable_Discriminants --
8742 ---------------------------------
8744 function Has_Inferable_Discriminants (N : Node_Id) return Boolean is
8746 function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean;
8747 -- Determines whether the left-most prefix of a selected component is a
8748 -- formal parameter in a subprogram. Assumes N is a selected component.
8750 --------------------------------
8751 -- Prefix_Is_Formal_Parameter --
8752 --------------------------------
8754 function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean is
8755 Sel_Comp : Node_Id := N;
8758 -- Move to the left-most prefix by climbing up the tree
8760 while Present (Parent (Sel_Comp))
8761 and then Nkind (Parent (Sel_Comp)) = N_Selected_Component
8763 Sel_Comp := Parent (Sel_Comp);
8766 return Ekind (Entity (Prefix (Sel_Comp))) in Formal_Kind;
8767 end Prefix_Is_Formal_Parameter;
8769 -- Start of processing for Has_Inferable_Discriminants
8772 -- For identifiers and indexed components, it is sufficient to have a
8773 -- constrained Unchecked_Union nominal subtype.
8775 if Nkind_In (N, N_Identifier, N_Indexed_Component) then
8776 return Is_Unchecked_Union (Base_Type (Etype (N)))
8778 Is_Constrained (Etype (N));
8780 -- For selected components, the subtype of the selector must be a
8781 -- constrained Unchecked_Union. If the component is subject to a
8782 -- per-object constraint, then the enclosing object must have inferable
8785 elsif Nkind (N) = N_Selected_Component then
8786 if Has_Per_Object_Constraint (Entity (Selector_Name (N))) then
8788 -- A small hack. If we have a per-object constrained selected
8789 -- component of a formal parameter, return True since we do not
8790 -- know the actual parameter association yet.
8792 if Prefix_Is_Formal_Parameter (N) then
8796 -- Otherwise, check the enclosing object and the selector
8798 return Has_Inferable_Discriminants (Prefix (N))
8800 Has_Inferable_Discriminants (Selector_Name (N));
8803 -- The call to Has_Inferable_Discriminants will determine whether
8804 -- the selector has a constrained Unchecked_Union nominal type.
8806 return Has_Inferable_Discriminants (Selector_Name (N));
8808 -- A qualified expression has inferable discriminants if its subtype
8809 -- mark is a constrained Unchecked_Union subtype.
8811 elsif Nkind (N) = N_Qualified_Expression then
8812 return Is_Unchecked_Union (Subtype_Mark (N))
8814 Is_Constrained (Subtype_Mark (N));
8819 end Has_Inferable_Discriminants;
8821 -------------------------------
8822 -- Insert_Dereference_Action --
8823 -------------------------------
8825 procedure Insert_Dereference_Action (N : Node_Id) is
8826 Loc : constant Source_Ptr := Sloc (N);
8827 Typ : constant Entity_Id := Etype (N);
8828 Pool : constant Entity_Id := Associated_Storage_Pool (Typ);
8829 Pnod : constant Node_Id := Parent (N);
8831 function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean;
8832 -- Return true if type of P is derived from Checked_Pool;
8834 -----------------------------
8835 -- Is_Checked_Storage_Pool --
8836 -----------------------------
8838 function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean is
8847 while T /= Etype (T) loop
8848 if Is_RTE (T, RE_Checked_Pool) then
8856 end Is_Checked_Storage_Pool;
8858 -- Start of processing for Insert_Dereference_Action
8861 pragma Assert (Nkind (Pnod) = N_Explicit_Dereference);
8863 if not (Is_Checked_Storage_Pool (Pool)
8864 and then Comes_From_Source (Original_Node (Pnod)))
8870 Make_Procedure_Call_Statement (Loc,
8871 Name => New_Reference_To (
8872 Find_Prim_Op (Etype (Pool), Name_Dereference), Loc),
8874 Parameter_Associations => New_List (
8878 New_Reference_To (Pool, Loc),
8880 -- Storage_Address. We use the attribute Pool_Address, which uses
8881 -- the pointer itself to find the address of the object, and which
8882 -- handles unconstrained arrays properly by computing the address
8883 -- of the template. i.e. the correct address of the corresponding
8886 Make_Attribute_Reference (Loc,
8887 Prefix => Duplicate_Subexpr_Move_Checks (N),
8888 Attribute_Name => Name_Pool_Address),
8890 -- Size_In_Storage_Elements
8892 Make_Op_Divide (Loc,
8894 Make_Attribute_Reference (Loc,
8896 Make_Explicit_Dereference (Loc,
8897 Duplicate_Subexpr_Move_Checks (N)),
8898 Attribute_Name => Name_Size),
8900 Make_Integer_Literal (Loc, System_Storage_Unit)),
8904 Make_Attribute_Reference (Loc,
8906 Make_Explicit_Dereference (Loc,
8907 Duplicate_Subexpr_Move_Checks (N)),
8908 Attribute_Name => Name_Alignment))));
8911 when RE_Not_Available =>
8913 end Insert_Dereference_Action;
8915 ------------------------------
8916 -- Make_Array_Comparison_Op --
8917 ------------------------------
8919 -- This is a hand-coded expansion of the following generic function:
8922 -- type elem is (<>);
8923 -- type index is (<>);
8924 -- type a is array (index range <>) of elem;
8926 -- function Gnnn (X : a; Y: a) return boolean is
8927 -- J : index := Y'first;
8930 -- if X'length = 0 then
8933 -- elsif Y'length = 0 then
8937 -- for I in X'range loop
8938 -- if X (I) = Y (J) then
8939 -- if J = Y'last then
8942 -- J := index'succ (J);
8946 -- return X (I) > Y (J);
8950 -- return X'length > Y'length;
8954 -- Note that since we are essentially doing this expansion by hand, we
8955 -- do not need to generate an actual or formal generic part, just the
8956 -- instantiated function itself.
8958 function Make_Array_Comparison_Op
8960 Nod : Node_Id) return Node_Id
8962 Loc : constant Source_Ptr := Sloc (Nod);
8964 X : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uX);
8965 Y : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uY);
8966 I : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uI);
8967 J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ);
8969 Index : constant Entity_Id := Base_Type (Etype (First_Index (Typ)));
8971 Loop_Statement : Node_Id;
8972 Loop_Body : Node_Id;
8975 Final_Expr : Node_Id;
8976 Func_Body : Node_Id;
8977 Func_Name : Entity_Id;
8983 -- if J = Y'last then
8986 -- J := index'succ (J);
8990 Make_Implicit_If_Statement (Nod,
8993 Left_Opnd => New_Reference_To (J, Loc),
8995 Make_Attribute_Reference (Loc,
8996 Prefix => New_Reference_To (Y, Loc),
8997 Attribute_Name => Name_Last)),
8999 Then_Statements => New_List (
9000 Make_Exit_Statement (Loc)),
9004 Make_Assignment_Statement (Loc,
9005 Name => New_Reference_To (J, Loc),
9007 Make_Attribute_Reference (Loc,
9008 Prefix => New_Reference_To (Index, Loc),
9009 Attribute_Name => Name_Succ,
9010 Expressions => New_List (New_Reference_To (J, Loc))))));
9012 -- if X (I) = Y (J) then
9015 -- return X (I) > Y (J);
9019 Make_Implicit_If_Statement (Nod,
9023 Make_Indexed_Component (Loc,
9024 Prefix => New_Reference_To (X, Loc),
9025 Expressions => New_List (New_Reference_To (I, Loc))),
9028 Make_Indexed_Component (Loc,
9029 Prefix => New_Reference_To (Y, Loc),
9030 Expressions => New_List (New_Reference_To (J, Loc)))),
9032 Then_Statements => New_List (Inner_If),
9034 Else_Statements => New_List (
9035 Make_Simple_Return_Statement (Loc,
9039 Make_Indexed_Component (Loc,
9040 Prefix => New_Reference_To (X, Loc),
9041 Expressions => New_List (New_Reference_To (I, Loc))),
9044 Make_Indexed_Component (Loc,
9045 Prefix => New_Reference_To (Y, Loc),
9046 Expressions => New_List (
9047 New_Reference_To (J, Loc)))))));
9049 -- for I in X'range loop
9054 Make_Implicit_Loop_Statement (Nod,
9055 Identifier => Empty,
9058 Make_Iteration_Scheme (Loc,
9059 Loop_Parameter_Specification =>
9060 Make_Loop_Parameter_Specification (Loc,
9061 Defining_Identifier => I,
9062 Discrete_Subtype_Definition =>
9063 Make_Attribute_Reference (Loc,
9064 Prefix => New_Reference_To (X, Loc),
9065 Attribute_Name => Name_Range))),
9067 Statements => New_List (Loop_Body));
9069 -- if X'length = 0 then
9071 -- elsif Y'length = 0 then
9074 -- for ... loop ... end loop;
9075 -- return X'length > Y'length;
9079 Make_Attribute_Reference (Loc,
9080 Prefix => New_Reference_To (X, Loc),
9081 Attribute_Name => Name_Length);
9084 Make_Attribute_Reference (Loc,
9085 Prefix => New_Reference_To (Y, Loc),
9086 Attribute_Name => Name_Length);
9090 Left_Opnd => Length1,
9091 Right_Opnd => Length2);
9094 Make_Implicit_If_Statement (Nod,
9098 Make_Attribute_Reference (Loc,
9099 Prefix => New_Reference_To (X, Loc),
9100 Attribute_Name => Name_Length),
9102 Make_Integer_Literal (Loc, 0)),
9106 Make_Simple_Return_Statement (Loc,
9107 Expression => New_Reference_To (Standard_False, Loc))),
9109 Elsif_Parts => New_List (
9110 Make_Elsif_Part (Loc,
9114 Make_Attribute_Reference (Loc,
9115 Prefix => New_Reference_To (Y, Loc),
9116 Attribute_Name => Name_Length),
9118 Make_Integer_Literal (Loc, 0)),
9122 Make_Simple_Return_Statement (Loc,
9123 Expression => New_Reference_To (Standard_True, Loc))))),
9125 Else_Statements => New_List (
9127 Make_Simple_Return_Statement (Loc,
9128 Expression => Final_Expr)));
9132 Formals := New_List (
9133 Make_Parameter_Specification (Loc,
9134 Defining_Identifier => X,
9135 Parameter_Type => New_Reference_To (Typ, Loc)),
9137 Make_Parameter_Specification (Loc,
9138 Defining_Identifier => Y,
9139 Parameter_Type => New_Reference_To (Typ, Loc)));
9141 -- function Gnnn (...) return boolean is
9142 -- J : index := Y'first;
9147 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('G'));
9150 Make_Subprogram_Body (Loc,
9152 Make_Function_Specification (Loc,
9153 Defining_Unit_Name => Func_Name,
9154 Parameter_Specifications => Formals,
9155 Result_Definition => New_Reference_To (Standard_Boolean, Loc)),
9157 Declarations => New_List (
9158 Make_Object_Declaration (Loc,
9159 Defining_Identifier => J,
9160 Object_Definition => New_Reference_To (Index, Loc),
9162 Make_Attribute_Reference (Loc,
9163 Prefix => New_Reference_To (Y, Loc),
9164 Attribute_Name => Name_First))),
9166 Handled_Statement_Sequence =>
9167 Make_Handled_Sequence_Of_Statements (Loc,
9168 Statements => New_List (If_Stat)));
9171 end Make_Array_Comparison_Op;
9173 ---------------------------
9174 -- Make_Boolean_Array_Op --
9175 ---------------------------
9177 -- For logical operations on boolean arrays, expand in line the following,
9178 -- replacing 'and' with 'or' or 'xor' where needed:
9180 -- function Annn (A : typ; B: typ) return typ is
9183 -- for J in A'range loop
9184 -- C (J) := A (J) op B (J);
9189 -- Here typ is the boolean array type
9191 function Make_Boolean_Array_Op
9193 N : Node_Id) return Node_Id
9195 Loc : constant Source_Ptr := Sloc (N);
9197 A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA);
9198 B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB);
9199 C : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uC);
9200 J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ);
9208 Func_Name : Entity_Id;
9209 Func_Body : Node_Id;
9210 Loop_Statement : Node_Id;
9214 Make_Indexed_Component (Loc,
9215 Prefix => New_Reference_To (A, Loc),
9216 Expressions => New_List (New_Reference_To (J, Loc)));
9219 Make_Indexed_Component (Loc,
9220 Prefix => New_Reference_To (B, Loc),
9221 Expressions => New_List (New_Reference_To (J, Loc)));
9224 Make_Indexed_Component (Loc,
9225 Prefix => New_Reference_To (C, Loc),
9226 Expressions => New_List (New_Reference_To (J, Loc)));
9228 if Nkind (N) = N_Op_And then
9234 elsif Nkind (N) = N_Op_Or then
9248 Make_Implicit_Loop_Statement (N,
9249 Identifier => Empty,
9252 Make_Iteration_Scheme (Loc,
9253 Loop_Parameter_Specification =>
9254 Make_Loop_Parameter_Specification (Loc,
9255 Defining_Identifier => J,
9256 Discrete_Subtype_Definition =>
9257 Make_Attribute_Reference (Loc,
9258 Prefix => New_Reference_To (A, Loc),
9259 Attribute_Name => Name_Range))),
9261 Statements => New_List (
9262 Make_Assignment_Statement (Loc,
9264 Expression => Op)));
9266 Formals := New_List (
9267 Make_Parameter_Specification (Loc,
9268 Defining_Identifier => A,
9269 Parameter_Type => New_Reference_To (Typ, Loc)),
9271 Make_Parameter_Specification (Loc,
9272 Defining_Identifier => B,
9273 Parameter_Type => New_Reference_To (Typ, Loc)));
9276 Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
9277 Set_Is_Inlined (Func_Name);
9280 Make_Subprogram_Body (Loc,
9282 Make_Function_Specification (Loc,
9283 Defining_Unit_Name => Func_Name,
9284 Parameter_Specifications => Formals,
9285 Result_Definition => New_Reference_To (Typ, Loc)),
9287 Declarations => New_List (
9288 Make_Object_Declaration (Loc,
9289 Defining_Identifier => C,
9290 Object_Definition => New_Reference_To (Typ, Loc))),
9292 Handled_Statement_Sequence =>
9293 Make_Handled_Sequence_Of_Statements (Loc,
9294 Statements => New_List (
9296 Make_Simple_Return_Statement (Loc,
9297 Expression => New_Reference_To (C, Loc)))));
9300 end Make_Boolean_Array_Op;
9302 ------------------------
9303 -- Rewrite_Comparison --
9304 ------------------------
9306 procedure Rewrite_Comparison (N : Node_Id) is
9307 Warning_Generated : Boolean := False;
9308 -- Set to True if first pass with Assume_Valid generates a warning in
9309 -- which case we skip the second pass to avoid warning overloaded.
9312 -- Set to Standard_True or Standard_False
9315 if Nkind (N) = N_Type_Conversion then
9316 Rewrite_Comparison (Expression (N));
9319 elsif Nkind (N) not in N_Op_Compare then
9323 -- Now start looking at the comparison in detail. We potentially go
9324 -- through this loop twice. The first time, Assume_Valid is set False
9325 -- in the call to Compile_Time_Compare. If this call results in a
9326 -- clear result of always True or Always False, that's decisive and
9327 -- we are done. Otherwise we repeat the processing with Assume_Valid
9328 -- set to True to generate additional warnings. We can stil that step
9329 -- if Constant_Condition_Warnings is False.
9331 for AV in False .. True loop
9333 Typ : constant Entity_Id := Etype (N);
9334 Op1 : constant Node_Id := Left_Opnd (N);
9335 Op2 : constant Node_Id := Right_Opnd (N);
9337 Res : constant Compare_Result :=
9338 Compile_Time_Compare (Op1, Op2, Assume_Valid => AV);
9339 -- Res indicates if compare outcome can be compile time determined
9341 True_Result : Boolean;
9342 False_Result : Boolean;
9345 case N_Op_Compare (Nkind (N)) is
9347 True_Result := Res = EQ;
9348 False_Result := Res = LT or else Res = GT or else Res = NE;
9351 True_Result := Res in Compare_GE;
9352 False_Result := Res = LT;
9355 and then Constant_Condition_Warnings
9356 and then Comes_From_Source (Original_Node (N))
9357 and then Nkind (Original_Node (N)) = N_Op_Ge
9358 and then not In_Instance
9359 and then Is_Integer_Type (Etype (Left_Opnd (N)))
9360 and then not Has_Warnings_Off (Etype (Left_Opnd (N)))
9363 ("can never be greater than, could replace by ""'=""?", N);
9364 Warning_Generated := True;
9368 True_Result := Res = GT;
9369 False_Result := Res in Compare_LE;
9372 True_Result := Res = LT;
9373 False_Result := Res in Compare_GE;
9376 True_Result := Res in Compare_LE;
9377 False_Result := Res = GT;
9380 and then Constant_Condition_Warnings
9381 and then Comes_From_Source (Original_Node (N))
9382 and then Nkind (Original_Node (N)) = N_Op_Le
9383 and then not In_Instance
9384 and then Is_Integer_Type (Etype (Left_Opnd (N)))
9385 and then not Has_Warnings_Off (Etype (Left_Opnd (N)))
9388 ("can never be less than, could replace by ""'=""?", N);
9389 Warning_Generated := True;
9393 True_Result := Res = NE or else Res = GT or else Res = LT;
9394 False_Result := Res = EQ;
9397 -- If this is the first iteration, then we actually convert the
9398 -- comparison into True or False, if the result is certain.
9401 if True_Result or False_Result then
9403 Result := Standard_True;
9405 Result := Standard_False;
9410 New_Occurrence_Of (Result, Sloc (N))));
9411 Analyze_And_Resolve (N, Typ);
9412 Warn_On_Known_Condition (N);
9416 -- If this is the second iteration (AV = True), and the original
9417 -- node comes from source and we are not in an instance, then
9418 -- give a warning if we know result would be True or False. Note
9419 -- we know Constant_Condition_Warnings is set if we get here.
9421 elsif Comes_From_Source (Original_Node (N))
9422 and then not In_Instance
9426 ("condition can only be False if invalid values present?",
9428 elsif False_Result then
9430 ("condition can only be True if invalid values present?",
9436 -- Skip second iteration if not warning on constant conditions or
9437 -- if the first iteration already generated a warning of some kind
9438 -- or if we are in any case assuming all values are valid (so that
9439 -- the first iteration took care of the valid case).
9441 exit when not Constant_Condition_Warnings;
9442 exit when Warning_Generated;
9443 exit when Assume_No_Invalid_Values;
9445 end Rewrite_Comparison;
9447 ----------------------------
9448 -- Safe_In_Place_Array_Op --
9449 ----------------------------
9451 function Safe_In_Place_Array_Op
9454 Op2 : Node_Id) return Boolean
9458 function Is_Safe_Operand (Op : Node_Id) return Boolean;
9459 -- Operand is safe if it cannot overlap part of the target of the
9460 -- operation. If the operand and the target are identical, the operand
9461 -- is safe. The operand can be empty in the case of negation.
9463 function Is_Unaliased (N : Node_Id) return Boolean;
9464 -- Check that N is a stand-alone entity
9470 function Is_Unaliased (N : Node_Id) return Boolean is
9474 and then No (Address_Clause (Entity (N)))
9475 and then No (Renamed_Object (Entity (N)));
9478 ---------------------
9479 -- Is_Safe_Operand --
9480 ---------------------
9482 function Is_Safe_Operand (Op : Node_Id) return Boolean is
9487 elsif Is_Entity_Name (Op) then
9488 return Is_Unaliased (Op);
9490 elsif Nkind_In (Op, N_Indexed_Component, N_Selected_Component) then
9491 return Is_Unaliased (Prefix (Op));
9493 elsif Nkind (Op) = N_Slice then
9495 Is_Unaliased (Prefix (Op))
9496 and then Entity (Prefix (Op)) /= Target;
9498 elsif Nkind (Op) = N_Op_Not then
9499 return Is_Safe_Operand (Right_Opnd (Op));
9504 end Is_Safe_Operand;
9506 -- Start of processing for Is_Safe_In_Place_Array_Op
9509 -- Skip this processing if the component size is different from system
9510 -- storage unit (since at least for NOT this would cause problems).
9512 if Component_Size (Etype (Lhs)) /= System_Storage_Unit then
9515 -- Cannot do in place stuff on VM_Target since cannot pass addresses
9517 elsif VM_Target /= No_VM then
9520 -- Cannot do in place stuff if non-standard Boolean representation
9522 elsif Has_Non_Standard_Rep (Component_Type (Etype (Lhs))) then
9525 elsif not Is_Unaliased (Lhs) then
9528 Target := Entity (Lhs);
9531 Is_Safe_Operand (Op1)
9532 and then Is_Safe_Operand (Op2);
9534 end Safe_In_Place_Array_Op;
9536 -----------------------
9537 -- Tagged_Membership --
9538 -----------------------
9540 -- There are two different cases to consider depending on whether the right
9541 -- operand is a class-wide type or not. If not we just compare the actual
9542 -- tag of the left expr to the target type tag:
9544 -- Left_Expr.Tag = Right_Type'Tag;
9546 -- If it is a class-wide type we use the RT function CW_Membership which is
9547 -- usually implemented by looking in the ancestor tables contained in the
9548 -- dispatch table pointed by Left_Expr.Tag for Typ'Tag
9550 -- Ada 2005 (AI-251): If it is a class-wide interface type we use the RT
9551 -- function IW_Membership which is usually implemented by looking in the
9552 -- table of abstract interface types plus the ancestor table contained in
9553 -- the dispatch table pointed by Left_Expr.Tag for Typ'Tag
9555 function Tagged_Membership (N : Node_Id) return Node_Id is
9556 Left : constant Node_Id := Left_Opnd (N);
9557 Right : constant Node_Id := Right_Opnd (N);
9558 Loc : constant Source_Ptr := Sloc (N);
9560 Left_Type : Entity_Id;
9561 Right_Type : Entity_Id;
9565 -- Handle entities from the limited view
9567 Left_Type := Available_View (Etype (Left));
9568 Right_Type := Available_View (Etype (Right));
9570 if Is_Class_Wide_Type (Left_Type) then
9571 Left_Type := Root_Type (Left_Type);
9575 Make_Selected_Component (Loc,
9576 Prefix => Relocate_Node (Left),
9578 New_Reference_To (First_Tag_Component (Left_Type), Loc));
9580 if Is_Class_Wide_Type (Right_Type) then
9582 -- No need to issue a run-time check if we statically know that the
9583 -- result of this membership test is always true. For example,
9584 -- considering the following declarations:
9586 -- type Iface is interface;
9587 -- type T is tagged null record;
9588 -- type DT is new T and Iface with null record;
9593 -- These membership tests are always true:
9597 -- Obj2 in Iface'Class;
9599 -- We do not need to handle cases where the membership is illegal.
9602 -- Obj1 in DT'Class; -- Compile time error
9603 -- Obj1 in Iface'Class; -- Compile time error
9605 if not Is_Class_Wide_Type (Left_Type)
9606 and then (Is_Ancestor (Etype (Right_Type), Left_Type)
9607 or else (Is_Interface (Etype (Right_Type))
9608 and then Interface_Present_In_Ancestor
9610 Iface => Etype (Right_Type))))
9612 return New_Reference_To (Standard_True, Loc);
9615 -- Ada 2005 (AI-251): Class-wide applied to interfaces
9617 if Is_Interface (Etype (Class_Wide_Type (Right_Type)))
9619 -- Support to: "Iface_CW_Typ in Typ'Class"
9621 or else Is_Interface (Left_Type)
9623 -- Issue error if IW_Membership operation not available in a
9624 -- configurable run time setting.
9626 if not RTE_Available (RE_IW_Membership) then
9628 ("dynamic membership test on interface types", N);
9633 Make_Function_Call (Loc,
9634 Name => New_Occurrence_Of (RTE (RE_IW_Membership), Loc),
9635 Parameter_Associations => New_List (
9636 Make_Attribute_Reference (Loc,
9638 Attribute_Name => Name_Address),
9641 (Access_Disp_Table (Root_Type (Right_Type)))),
9644 -- Ada 95: Normal case
9648 Build_CW_Membership (Loc,
9649 Obj_Tag_Node => Obj_Tag,
9653 (Access_Disp_Table (Root_Type (Right_Type)))),
9657 -- Right_Type is not a class-wide type
9660 -- No need to check the tag of the object if Right_Typ is abstract
9662 if Is_Abstract_Type (Right_Type) then
9663 return New_Reference_To (Standard_False, Loc);
9668 Left_Opnd => Obj_Tag,
9671 (Node (First_Elmt (Access_Disp_Table (Right_Type))), Loc));
9674 end Tagged_Membership;
9676 ------------------------------
9677 -- Unary_Op_Validity_Checks --
9678 ------------------------------
9680 procedure Unary_Op_Validity_Checks (N : Node_Id) is
9682 if Validity_Checks_On and Validity_Check_Operands then
9683 Ensure_Valid (Right_Opnd (N));
9685 end Unary_Op_Validity_Checks;
projects / platform / upstream / gcc.git / blob