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
4050 -- one 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 end Expand_N_Conditional_Expression;
4085 -----------------------------------
4086 -- Expand_N_Explicit_Dereference --
4087 -----------------------------------
4089 procedure Expand_N_Explicit_Dereference (N : Node_Id) is
4091 -- Insert explicit dereference call for the checked storage pool case
4093 Insert_Dereference_Action (Prefix (N));
4094 end Expand_N_Explicit_Dereference;
4100 procedure Expand_N_In (N : Node_Id) is
4101 Loc : constant Source_Ptr := Sloc (N);
4102 Rtyp : constant Entity_Id := Etype (N);
4103 Lop : constant Node_Id := Left_Opnd (N);
4104 Rop : constant Node_Id := Right_Opnd (N);
4105 Static : constant Boolean := Is_OK_Static_Expression (N);
4107 procedure Substitute_Valid_Check;
4108 -- Replaces node N by Lop'Valid. This is done when we have an explicit
4109 -- test for the left operand being in range of its subtype.
4111 ----------------------------
4112 -- Substitute_Valid_Check --
4113 ----------------------------
4115 procedure Substitute_Valid_Check is
4118 Make_Attribute_Reference (Loc,
4119 Prefix => Relocate_Node (Lop),
4120 Attribute_Name => Name_Valid));
4122 Analyze_And_Resolve (N, Rtyp);
4124 Error_Msg_N ("?explicit membership test may be optimized away", N);
4125 Error_Msg_N ("\?use ''Valid attribute instead", N);
4127 end Substitute_Valid_Check;
4129 -- Start of processing for Expand_N_In
4132 -- Check case of explicit test for an expression in range of its
4133 -- subtype. This is suspicious usage and we replace it with a 'Valid
4134 -- test and give a warning.
4136 if Is_Scalar_Type (Etype (Lop))
4137 and then Nkind (Rop) in N_Has_Entity
4138 and then Etype (Lop) = Entity (Rop)
4139 and then Comes_From_Source (N)
4140 and then VM_Target = No_VM
4142 Substitute_Valid_Check;
4146 -- Do validity check on operands
4148 if Validity_Checks_On and Validity_Check_Operands then
4149 Ensure_Valid (Left_Opnd (N));
4150 Validity_Check_Range (Right_Opnd (N));
4153 -- Case of explicit range
4155 if Nkind (Rop) = N_Range then
4157 Lo : constant Node_Id := Low_Bound (Rop);
4158 Hi : constant Node_Id := High_Bound (Rop);
4160 Ltyp : constant Entity_Id := Etype (Lop);
4162 Lo_Orig : constant Node_Id := Original_Node (Lo);
4163 Hi_Orig : constant Node_Id := Original_Node (Hi);
4165 Lcheck : Compare_Result;
4166 Ucheck : Compare_Result;
4168 Warn1 : constant Boolean :=
4169 Constant_Condition_Warnings
4170 and then Comes_From_Source (N)
4171 and then not In_Instance;
4172 -- This must be true for any of the optimization warnings, we
4173 -- clearly want to give them only for source with the flag on.
4174 -- We also skip these warnings in an instance since it may be
4175 -- the case that different instantiations have different ranges.
4177 Warn2 : constant Boolean :=
4179 and then Nkind (Original_Node (Rop)) = N_Range
4180 and then Is_Integer_Type (Etype (Lo));
4181 -- For the case where only one bound warning is elided, we also
4182 -- insist on an explicit range and an integer type. The reason is
4183 -- that the use of enumeration ranges including an end point is
4184 -- common, as is the use of a subtype name, one of whose bounds
4185 -- is the same as the type of the expression.
4188 -- If test is explicit x'first .. x'last, replace by valid check
4190 if Is_Scalar_Type (Ltyp)
4191 and then Nkind (Lo_Orig) = N_Attribute_Reference
4192 and then Attribute_Name (Lo_Orig) = Name_First
4193 and then Nkind (Prefix (Lo_Orig)) in N_Has_Entity
4194 and then Entity (Prefix (Lo_Orig)) = Ltyp
4195 and then Nkind (Hi_Orig) = N_Attribute_Reference
4196 and then Attribute_Name (Hi_Orig) = Name_Last
4197 and then Nkind (Prefix (Hi_Orig)) in N_Has_Entity
4198 and then Entity (Prefix (Hi_Orig)) = Ltyp
4199 and then Comes_From_Source (N)
4200 and then VM_Target = No_VM
4202 Substitute_Valid_Check;
4206 -- If bounds of type are known at compile time, and the end points
4207 -- are known at compile time and identical, this is another case
4208 -- for substituting a valid test. We only do this for discrete
4209 -- types, since it won't arise in practice for float types.
4211 if Comes_From_Source (N)
4212 and then Is_Discrete_Type (Ltyp)
4213 and then Compile_Time_Known_Value (Type_High_Bound (Ltyp))
4214 and then Compile_Time_Known_Value (Type_Low_Bound (Ltyp))
4215 and then Compile_Time_Known_Value (Lo)
4216 and then Compile_Time_Known_Value (Hi)
4217 and then Expr_Value (Type_High_Bound (Ltyp)) = Expr_Value (Hi)
4218 and then Expr_Value (Type_Low_Bound (Ltyp)) = Expr_Value (Lo)
4220 -- Kill warnings in instances, since they may be cases where we
4221 -- have a test in the generic that makes sense with some types
4222 -- and not with other types.
4224 and then not In_Instance
4226 Substitute_Valid_Check;
4230 -- If we have an explicit range, do a bit of optimization based
4231 -- on range analysis (we may be able to kill one or both checks).
4233 Lcheck := Compile_Time_Compare (Lop, Lo, Assume_Valid => False);
4234 Ucheck := Compile_Time_Compare (Lop, Hi, Assume_Valid => False);
4236 -- If either check is known to fail, replace result by False since
4237 -- the other check does not matter. Preserve the static flag for
4238 -- legality checks, because we are constant-folding beyond RM 4.9.
4240 if Lcheck = LT or else Ucheck = GT then
4242 Error_Msg_N ("?range test optimized away", N);
4243 Error_Msg_N ("\?value is known to be out of range", N);
4247 New_Reference_To (Standard_False, Loc));
4248 Analyze_And_Resolve (N, Rtyp);
4249 Set_Is_Static_Expression (N, Static);
4253 -- If both checks are known to succeed, replace result by True,
4254 -- since we know we are in range.
4256 elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then
4258 Error_Msg_N ("?range test optimized away", N);
4259 Error_Msg_N ("\?value is known to be in range", N);
4263 New_Reference_To (Standard_True, Loc));
4264 Analyze_And_Resolve (N, Rtyp);
4265 Set_Is_Static_Expression (N, Static);
4269 -- If lower bound check succeeds and upper bound check is not
4270 -- known to succeed or fail, then replace the range check with
4271 -- a comparison against the upper bound.
4273 elsif Lcheck in Compare_GE then
4274 if Warn2 and then not In_Instance then
4275 Error_Msg_N ("?lower bound test optimized away", Lo);
4276 Error_Msg_N ("\?value is known to be in range", Lo);
4282 Right_Opnd => High_Bound (Rop)));
4283 Analyze_And_Resolve (N, Rtyp);
4287 -- If upper bound check succeeds and lower bound check is not
4288 -- known to succeed or fail, then replace the range check with
4289 -- a comparison against the lower bound.
4291 elsif Ucheck in Compare_LE then
4292 if Warn2 and then not In_Instance then
4293 Error_Msg_N ("?upper bound test optimized away", Hi);
4294 Error_Msg_N ("\?value is known to be in range", Hi);
4300 Right_Opnd => Low_Bound (Rop)));
4301 Analyze_And_Resolve (N, Rtyp);
4306 -- We couldn't optimize away the range check, but there is one
4307 -- more issue. If we are checking constant conditionals, then we
4308 -- see if we can determine the outcome assuming everything is
4309 -- valid, and if so give an appropriate warning.
4311 if Warn1 and then not Assume_No_Invalid_Values then
4312 Lcheck := Compile_Time_Compare (Lop, Lo, Assume_Valid => True);
4313 Ucheck := Compile_Time_Compare (Lop, Hi, Assume_Valid => True);
4315 -- Result is out of range for valid value
4317 if Lcheck = LT or else Ucheck = GT then
4319 ("?value can only be in range if it is invalid", N);
4321 -- Result is in range for valid value
4323 elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then
4325 ("?value can only be out of range if it is invalid", N);
4327 -- Lower bound check succeeds if value is valid
4329 elsif Warn2 and then Lcheck in Compare_GE then
4331 ("?lower bound check only fails if it is invalid", Lo);
4333 -- Upper bound check succeeds if value is valid
4335 elsif Warn2 and then Ucheck in Compare_LE then
4337 ("?upper bound check only fails for invalid values", Hi);
4342 -- For all other cases of an explicit range, nothing to be done
4346 -- Here right operand is a subtype mark
4350 Typ : Entity_Id := Etype (Rop);
4351 Is_Acc : constant Boolean := Is_Access_Type (Typ);
4352 Obj : Node_Id := Lop;
4353 Cond : Node_Id := Empty;
4356 Remove_Side_Effects (Obj);
4358 -- For tagged type, do tagged membership operation
4360 if Is_Tagged_Type (Typ) then
4362 -- No expansion will be performed when VM_Target, as the VM
4363 -- back-ends will handle the membership tests directly (tags
4364 -- are not explicitly represented in Java objects, so the
4365 -- normal tagged membership expansion is not what we want).
4367 if Tagged_Type_Expansion then
4368 Rewrite (N, Tagged_Membership (N));
4369 Analyze_And_Resolve (N, Rtyp);
4374 -- If type is scalar type, rewrite as x in t'first .. t'last.
4375 -- This reason we do this is that the bounds may have the wrong
4376 -- type if they come from the original type definition. Also this
4377 -- way we get all the processing above for an explicit range.
4379 elsif Is_Scalar_Type (Typ) then
4383 Make_Attribute_Reference (Loc,
4384 Attribute_Name => Name_First,
4385 Prefix => New_Reference_To (Typ, Loc)),
4388 Make_Attribute_Reference (Loc,
4389 Attribute_Name => Name_Last,
4390 Prefix => New_Reference_To (Typ, Loc))));
4391 Analyze_And_Resolve (N, Rtyp);
4394 -- Ada 2005 (AI-216): Program_Error is raised when evaluating
4395 -- a membership test if the subtype mark denotes a constrained
4396 -- Unchecked_Union subtype and the expression lacks inferable
4399 elsif Is_Unchecked_Union (Base_Type (Typ))
4400 and then Is_Constrained (Typ)
4401 and then not Has_Inferable_Discriminants (Lop)
4404 Make_Raise_Program_Error (Loc,
4405 Reason => PE_Unchecked_Union_Restriction));
4407 -- Prevent Gigi from generating incorrect code by rewriting
4408 -- the test as a standard False.
4411 New_Occurrence_Of (Standard_False, Loc));
4416 -- Here we have a non-scalar type
4419 Typ := Designated_Type (Typ);
4422 if not Is_Constrained (Typ) then
4424 New_Reference_To (Standard_True, Loc));
4425 Analyze_And_Resolve (N, Rtyp);
4427 -- For the constrained array case, we have to check the subscripts
4428 -- for an exact match if the lengths are non-zero (the lengths
4429 -- must match in any case).
4431 elsif Is_Array_Type (Typ) then
4433 Check_Subscripts : declare
4434 function Construct_Attribute_Reference
4437 Dim : Nat) return Node_Id;
4438 -- Build attribute reference E'Nam(Dim)
4440 -----------------------------------
4441 -- Construct_Attribute_Reference --
4442 -----------------------------------
4444 function Construct_Attribute_Reference
4447 Dim : Nat) return Node_Id
4451 Make_Attribute_Reference (Loc,
4453 Attribute_Name => Nam,
4454 Expressions => New_List (
4455 Make_Integer_Literal (Loc, Dim)));
4456 end Construct_Attribute_Reference;
4458 -- Start of processing for Check_Subscripts
4461 for J in 1 .. Number_Dimensions (Typ) loop
4462 Evolve_And_Then (Cond,
4465 Construct_Attribute_Reference
4466 (Duplicate_Subexpr_No_Checks (Obj),
4469 Construct_Attribute_Reference
4470 (New_Occurrence_Of (Typ, Loc), Name_First, J)));
4472 Evolve_And_Then (Cond,
4475 Construct_Attribute_Reference
4476 (Duplicate_Subexpr_No_Checks (Obj),
4479 Construct_Attribute_Reference
4480 (New_Occurrence_Of (Typ, Loc), Name_Last, J)));
4489 Right_Opnd => Make_Null (Loc)),
4490 Right_Opnd => Cond);
4494 Analyze_And_Resolve (N, Rtyp);
4495 end Check_Subscripts;
4497 -- These are the cases where constraint checks may be required,
4498 -- e.g. records with possible discriminants
4501 -- Expand the test into a series of discriminant comparisons.
4502 -- The expression that is built is the negation of the one that
4503 -- is used for checking discriminant constraints.
4505 Obj := Relocate_Node (Left_Opnd (N));
4507 if Has_Discriminants (Typ) then
4508 Cond := Make_Op_Not (Loc,
4509 Right_Opnd => Build_Discriminant_Checks (Obj, Typ));
4512 Cond := Make_Or_Else (Loc,
4516 Right_Opnd => Make_Null (Loc)),
4517 Right_Opnd => Cond);
4521 Cond := New_Occurrence_Of (Standard_True, Loc);
4525 Analyze_And_Resolve (N, Rtyp);
4531 --------------------------------
4532 -- Expand_N_Indexed_Component --
4533 --------------------------------
4535 procedure Expand_N_Indexed_Component (N : Node_Id) is
4536 Loc : constant Source_Ptr := Sloc (N);
4537 Typ : constant Entity_Id := Etype (N);
4538 P : constant Node_Id := Prefix (N);
4539 T : constant Entity_Id := Etype (P);
4542 -- A special optimization, if we have an indexed component that is
4543 -- selecting from a slice, then we can eliminate the slice, since, for
4544 -- example, x (i .. j)(k) is identical to x(k). The only difference is
4545 -- the range check required by the slice. The range check for the slice
4546 -- itself has already been generated. The range check for the
4547 -- subscripting operation is ensured by converting the subject to
4548 -- the subtype of the slice.
4550 -- This optimization not only generates better code, avoiding slice
4551 -- messing especially in the packed case, but more importantly bypasses
4552 -- some problems in handling this peculiar case, for example, the issue
4553 -- of dealing specially with object renamings.
4555 if Nkind (P) = N_Slice then
4557 Make_Indexed_Component (Loc,
4558 Prefix => Prefix (P),
4559 Expressions => New_List (
4561 (Etype (First_Index (Etype (P))),
4562 First (Expressions (N))))));
4563 Analyze_And_Resolve (N, Typ);
4567 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
4568 -- function, then additional actuals must be passed.
4570 if Ada_Version >= Ada_05
4571 and then Is_Build_In_Place_Function_Call (P)
4573 Make_Build_In_Place_Call_In_Anonymous_Context (P);
4576 -- If the prefix is an access type, then we unconditionally rewrite if
4577 -- as an explicit deference. This simplifies processing for several
4578 -- cases, including packed array cases and certain cases in which checks
4579 -- must be generated. We used to try to do this only when it was
4580 -- necessary, but it cleans up the code to do it all the time.
4582 if Is_Access_Type (T) then
4583 Insert_Explicit_Dereference (P);
4584 Analyze_And_Resolve (P, Designated_Type (T));
4587 -- Generate index and validity checks
4589 Generate_Index_Checks (N);
4591 if Validity_Checks_On and then Validity_Check_Subscripts then
4592 Apply_Subscript_Validity_Checks (N);
4595 -- All done for the non-packed case
4597 if not Is_Packed (Etype (Prefix (N))) then
4601 -- For packed arrays that are not bit-packed (i.e. the case of an array
4602 -- with one or more index types with a non-contiguous enumeration type),
4603 -- we can always use the normal packed element get circuit.
4605 if not Is_Bit_Packed_Array (Etype (Prefix (N))) then
4606 Expand_Packed_Element_Reference (N);
4610 -- For a reference to a component of a bit packed array, we have to
4611 -- convert it to a reference to the corresponding Packed_Array_Type.
4612 -- We only want to do this for simple references, and not for:
4614 -- Left side of assignment, or prefix of left side of assignment, or
4615 -- prefix of the prefix, to handle packed arrays of packed arrays,
4616 -- This case is handled in Exp_Ch5.Expand_N_Assignment_Statement
4618 -- Renaming objects in renaming associations
4619 -- This case is handled when a use of the renamed variable occurs
4621 -- Actual parameters for a procedure call
4622 -- This case is handled in Exp_Ch6.Expand_Actuals
4624 -- The second expression in a 'Read attribute reference
4626 -- The prefix of an address or size attribute reference
4628 -- The following circuit detects these exceptions
4631 Child : Node_Id := N;
4632 Parnt : Node_Id := Parent (N);
4636 if Nkind (Parnt) = N_Unchecked_Expression then
4639 elsif Nkind_In (Parnt, N_Object_Renaming_Declaration,
4640 N_Procedure_Call_Statement)
4641 or else (Nkind (Parnt) = N_Parameter_Association
4643 Nkind (Parent (Parnt)) = N_Procedure_Call_Statement)
4647 elsif Nkind (Parnt) = N_Attribute_Reference
4648 and then (Attribute_Name (Parnt) = Name_Address
4650 Attribute_Name (Parnt) = Name_Size)
4651 and then Prefix (Parnt) = Child
4655 elsif Nkind (Parnt) = N_Assignment_Statement
4656 and then Name (Parnt) = Child
4660 -- If the expression is an index of an indexed component, it must
4661 -- be expanded regardless of context.
4663 elsif Nkind (Parnt) = N_Indexed_Component
4664 and then Child /= Prefix (Parnt)
4666 Expand_Packed_Element_Reference (N);
4669 elsif Nkind (Parent (Parnt)) = N_Assignment_Statement
4670 and then Name (Parent (Parnt)) = Parnt
4674 elsif Nkind (Parnt) = N_Attribute_Reference
4675 and then Attribute_Name (Parnt) = Name_Read
4676 and then Next (First (Expressions (Parnt))) = Child
4680 elsif Nkind_In (Parnt, N_Indexed_Component, N_Selected_Component)
4681 and then Prefix (Parnt) = Child
4686 Expand_Packed_Element_Reference (N);
4690 -- Keep looking up tree for unchecked expression, or if we are the
4691 -- prefix of a possible assignment left side.
4694 Parnt := Parent (Child);
4697 end Expand_N_Indexed_Component;
4699 ---------------------
4700 -- Expand_N_Not_In --
4701 ---------------------
4703 -- Replace a not in b by not (a in b) so that the expansions for (a in b)
4704 -- can be done. This avoids needing to duplicate this expansion code.
4706 procedure Expand_N_Not_In (N : Node_Id) is
4707 Loc : constant Source_Ptr := Sloc (N);
4708 Typ : constant Entity_Id := Etype (N);
4709 Cfs : constant Boolean := Comes_From_Source (N);
4716 Left_Opnd => Left_Opnd (N),
4717 Right_Opnd => Right_Opnd (N))));
4719 -- We want this to appear as coming from source if original does (see
4720 -- transformations in Expand_N_In).
4722 Set_Comes_From_Source (N, Cfs);
4723 Set_Comes_From_Source (Right_Opnd (N), Cfs);
4725 -- Now analyze transformed node
4727 Analyze_And_Resolve (N, Typ);
4728 end Expand_N_Not_In;
4734 -- The only replacement required is for the case of a null of type that is
4735 -- an access to protected subprogram. We represent such access values as a
4736 -- record, and so we must replace the occurrence of null by the equivalent
4737 -- record (with a null address and a null pointer in it), so that the
4738 -- backend creates the proper value.
4740 procedure Expand_N_Null (N : Node_Id) is
4741 Loc : constant Source_Ptr := Sloc (N);
4742 Typ : constant Entity_Id := Etype (N);
4746 if Is_Access_Protected_Subprogram_Type (Typ) then
4748 Make_Aggregate (Loc,
4749 Expressions => New_List (
4750 New_Occurrence_Of (RTE (RE_Null_Address), Loc),
4754 Analyze_And_Resolve (N, Equivalent_Type (Typ));
4756 -- For subsequent semantic analysis, the node must retain its type.
4757 -- Gigi in any case replaces this type by the corresponding record
4758 -- type before processing the node.
4764 when RE_Not_Available =>
4768 ---------------------
4769 -- Expand_N_Op_Abs --
4770 ---------------------
4772 procedure Expand_N_Op_Abs (N : Node_Id) is
4773 Loc : constant Source_Ptr := Sloc (N);
4774 Expr : constant Node_Id := Right_Opnd (N);
4777 Unary_Op_Validity_Checks (N);
4779 -- Deal with software overflow checking
4781 if not Backend_Overflow_Checks_On_Target
4782 and then Is_Signed_Integer_Type (Etype (N))
4783 and then Do_Overflow_Check (N)
4785 -- The only case to worry about is when the argument is equal to the
4786 -- largest negative number, so what we do is to insert the check:
4788 -- [constraint_error when Expr = typ'Base'First]
4790 -- with the usual Duplicate_Subexpr use coding for expr
4793 Make_Raise_Constraint_Error (Loc,
4796 Left_Opnd => Duplicate_Subexpr (Expr),
4798 Make_Attribute_Reference (Loc,
4800 New_Occurrence_Of (Base_Type (Etype (Expr)), Loc),
4801 Attribute_Name => Name_First)),
4802 Reason => CE_Overflow_Check_Failed));
4805 -- Vax floating-point types case
4807 if Vax_Float (Etype (N)) then
4808 Expand_Vax_Arith (N);
4810 end Expand_N_Op_Abs;
4812 ---------------------
4813 -- Expand_N_Op_Add --
4814 ---------------------
4816 procedure Expand_N_Op_Add (N : Node_Id) is
4817 Typ : constant Entity_Id := Etype (N);
4820 Binary_Op_Validity_Checks (N);
4822 -- N + 0 = 0 + N = N for integer types
4824 if Is_Integer_Type (Typ) then
4825 if Compile_Time_Known_Value (Right_Opnd (N))
4826 and then Expr_Value (Right_Opnd (N)) = Uint_0
4828 Rewrite (N, Left_Opnd (N));
4831 elsif Compile_Time_Known_Value (Left_Opnd (N))
4832 and then Expr_Value (Left_Opnd (N)) = Uint_0
4834 Rewrite (N, Right_Opnd (N));
4839 -- Arithmetic overflow checks for signed integer/fixed point types
4841 if Is_Signed_Integer_Type (Typ)
4842 or else Is_Fixed_Point_Type (Typ)
4844 Apply_Arithmetic_Overflow_Check (N);
4847 -- Vax floating-point types case
4849 elsif Vax_Float (Typ) then
4850 Expand_Vax_Arith (N);
4852 end Expand_N_Op_Add;
4854 ---------------------
4855 -- Expand_N_Op_And --
4856 ---------------------
4858 procedure Expand_N_Op_And (N : Node_Id) is
4859 Typ : constant Entity_Id := Etype (N);
4862 Binary_Op_Validity_Checks (N);
4864 if Is_Array_Type (Etype (N)) then
4865 Expand_Boolean_Operator (N);
4867 elsif Is_Boolean_Type (Etype (N)) then
4868 Adjust_Condition (Left_Opnd (N));
4869 Adjust_Condition (Right_Opnd (N));
4870 Set_Etype (N, Standard_Boolean);
4871 Adjust_Result_Type (N, Typ);
4873 end Expand_N_Op_And;
4875 ------------------------
4876 -- Expand_N_Op_Concat --
4877 ------------------------
4879 procedure Expand_N_Op_Concat (N : Node_Id) is
4881 -- List of operands to be concatenated
4884 -- Node which is to be replaced by the result of concatenating the nodes
4885 -- in the list Opnds.
4888 -- Ensure validity of both operands
4890 Binary_Op_Validity_Checks (N);
4892 -- If we are the left operand of a concatenation higher up the tree,
4893 -- then do nothing for now, since we want to deal with a series of
4894 -- concatenations as a unit.
4896 if Nkind (Parent (N)) = N_Op_Concat
4897 and then N = Left_Opnd (Parent (N))
4902 -- We get here with a concatenation whose left operand may be a
4903 -- concatenation itself with a consistent type. We need to process
4904 -- these concatenation operands from left to right, which means
4905 -- from the deepest node in the tree to the highest node.
4908 while Nkind (Left_Opnd (Cnode)) = N_Op_Concat loop
4909 Cnode := Left_Opnd (Cnode);
4912 -- Now Opnd is the deepest Opnd, and its parents are the concatenation
4913 -- nodes above, so now we process bottom up, doing the operations. We
4914 -- gather a string that is as long as possible up to five operands
4916 -- The outer loop runs more than once if more than one concatenation
4917 -- type is involved.
4920 Opnds := New_List (Left_Opnd (Cnode), Right_Opnd (Cnode));
4921 Set_Parent (Opnds, N);
4923 -- The inner loop gathers concatenation operands
4925 Inner : while Cnode /= N
4926 and then Base_Type (Etype (Cnode)) =
4927 Base_Type (Etype (Parent (Cnode)))
4929 Cnode := Parent (Cnode);
4930 Append (Right_Opnd (Cnode), Opnds);
4933 Expand_Concatenate (Cnode, Opnds);
4935 exit Outer when Cnode = N;
4936 Cnode := Parent (Cnode);
4938 end Expand_N_Op_Concat;
4940 ------------------------
4941 -- Expand_N_Op_Divide --
4942 ------------------------
4944 procedure Expand_N_Op_Divide (N : Node_Id) is
4945 Loc : constant Source_Ptr := Sloc (N);
4946 Lopnd : constant Node_Id := Left_Opnd (N);
4947 Ropnd : constant Node_Id := Right_Opnd (N);
4948 Ltyp : constant Entity_Id := Etype (Lopnd);
4949 Rtyp : constant Entity_Id := Etype (Ropnd);
4950 Typ : Entity_Id := Etype (N);
4951 Rknow : constant Boolean := Is_Integer_Type (Typ)
4953 Compile_Time_Known_Value (Ropnd);
4957 Binary_Op_Validity_Checks (N);
4960 Rval := Expr_Value (Ropnd);
4963 -- N / 1 = N for integer types
4965 if Rknow and then Rval = Uint_1 then
4970 -- Convert x / 2 ** y to Shift_Right (x, y). Note that the fact that
4971 -- Is_Power_Of_2_For_Shift is set means that we know that our left
4972 -- operand is an unsigned integer, as required for this to work.
4974 if Nkind (Ropnd) = N_Op_Expon
4975 and then Is_Power_Of_2_For_Shift (Ropnd)
4977 -- We cannot do this transformation in configurable run time mode if we
4978 -- have 64-bit -- integers and long shifts are not available.
4982 or else Support_Long_Shifts_On_Target)
4985 Make_Op_Shift_Right (Loc,
4988 Convert_To (Standard_Natural, Right_Opnd (Ropnd))));
4989 Analyze_And_Resolve (N, Typ);
4993 -- Do required fixup of universal fixed operation
4995 if Typ = Universal_Fixed then
4996 Fixup_Universal_Fixed_Operation (N);
5000 -- Divisions with fixed-point results
5002 if Is_Fixed_Point_Type (Typ) then
5004 -- No special processing if Treat_Fixed_As_Integer is set, since
5005 -- from a semantic point of view such operations are simply integer
5006 -- operations and will be treated that way.
5008 if not Treat_Fixed_As_Integer (N) then
5009 if Is_Integer_Type (Rtyp) then
5010 Expand_Divide_Fixed_By_Integer_Giving_Fixed (N);
5012 Expand_Divide_Fixed_By_Fixed_Giving_Fixed (N);
5016 -- Other cases of division of fixed-point operands. Again we exclude the
5017 -- case where Treat_Fixed_As_Integer is set.
5019 elsif (Is_Fixed_Point_Type (Ltyp) or else
5020 Is_Fixed_Point_Type (Rtyp))
5021 and then not Treat_Fixed_As_Integer (N)
5023 if Is_Integer_Type (Typ) then
5024 Expand_Divide_Fixed_By_Fixed_Giving_Integer (N);
5026 pragma Assert (Is_Floating_Point_Type (Typ));
5027 Expand_Divide_Fixed_By_Fixed_Giving_Float (N);
5030 -- Mixed-mode operations can appear in a non-static universal context,
5031 -- in which case the integer argument must be converted explicitly.
5033 elsif Typ = Universal_Real
5034 and then Is_Integer_Type (Rtyp)
5037 Convert_To (Universal_Real, Relocate_Node (Ropnd)));
5039 Analyze_And_Resolve (Ropnd, Universal_Real);
5041 elsif Typ = Universal_Real
5042 and then Is_Integer_Type (Ltyp)
5045 Convert_To (Universal_Real, Relocate_Node (Lopnd)));
5047 Analyze_And_Resolve (Lopnd, Universal_Real);
5049 -- Non-fixed point cases, do integer zero divide and overflow checks
5051 elsif Is_Integer_Type (Typ) then
5052 Apply_Divide_Check (N);
5054 -- Check for 64-bit division available, or long shifts if the divisor
5055 -- is a small power of 2 (since such divides will be converted into
5058 if Esize (Ltyp) > 32
5059 and then not Support_64_Bit_Divides_On_Target
5062 or else not Support_Long_Shifts_On_Target
5063 or else (Rval /= Uint_2 and then
5064 Rval /= Uint_4 and then
5065 Rval /= Uint_8 and then
5066 Rval /= Uint_16 and then
5067 Rval /= Uint_32 and then
5070 Error_Msg_CRT ("64-bit division", N);
5073 -- Deal with Vax_Float
5075 elsif Vax_Float (Typ) then
5076 Expand_Vax_Arith (N);
5079 end Expand_N_Op_Divide;
5081 --------------------
5082 -- Expand_N_Op_Eq --
5083 --------------------
5085 procedure Expand_N_Op_Eq (N : Node_Id) is
5086 Loc : constant Source_Ptr := Sloc (N);
5087 Typ : constant Entity_Id := Etype (N);
5088 Lhs : constant Node_Id := Left_Opnd (N);
5089 Rhs : constant Node_Id := Right_Opnd (N);
5090 Bodies : constant List_Id := New_List;
5091 A_Typ : constant Entity_Id := Etype (Lhs);
5093 Typl : Entity_Id := A_Typ;
5094 Op_Name : Entity_Id;
5097 procedure Build_Equality_Call (Eq : Entity_Id);
5098 -- If a constructed equality exists for the type or for its parent,
5099 -- build and analyze call, adding conversions if the operation is
5102 function Has_Unconstrained_UU_Component (Typ : Node_Id) return Boolean;
5103 -- Determines whether a type has a subcomponent of an unconstrained
5104 -- Unchecked_Union subtype. Typ is a record type.
5106 -------------------------
5107 -- Build_Equality_Call --
5108 -------------------------
5110 procedure Build_Equality_Call (Eq : Entity_Id) is
5111 Op_Type : constant Entity_Id := Etype (First_Formal (Eq));
5112 L_Exp : Node_Id := Relocate_Node (Lhs);
5113 R_Exp : Node_Id := Relocate_Node (Rhs);
5116 if Base_Type (Op_Type) /= Base_Type (A_Typ)
5117 and then not Is_Class_Wide_Type (A_Typ)
5119 L_Exp := OK_Convert_To (Op_Type, L_Exp);
5120 R_Exp := OK_Convert_To (Op_Type, R_Exp);
5123 -- If we have an Unchecked_Union, we need to add the inferred
5124 -- discriminant values as actuals in the function call. At this
5125 -- point, the expansion has determined that both operands have
5126 -- inferable discriminants.
5128 if Is_Unchecked_Union (Op_Type) then
5130 Lhs_Type : constant Node_Id := Etype (L_Exp);
5131 Rhs_Type : constant Node_Id := Etype (R_Exp);
5132 Lhs_Discr_Val : Node_Id;
5133 Rhs_Discr_Val : Node_Id;
5136 -- Per-object constrained selected components require special
5137 -- attention. If the enclosing scope of the component is an
5138 -- Unchecked_Union, we cannot reference its discriminants
5139 -- directly. This is why we use the two extra parameters of
5140 -- the equality function of the enclosing Unchecked_Union.
5142 -- type UU_Type (Discr : Integer := 0) is
5145 -- pragma Unchecked_Union (UU_Type);
5147 -- 1. Unchecked_Union enclosing record:
5149 -- type Enclosing_UU_Type (Discr : Integer := 0) is record
5151 -- Comp : UU_Type (Discr);
5153 -- end Enclosing_UU_Type;
5154 -- pragma Unchecked_Union (Enclosing_UU_Type);
5156 -- Obj1 : Enclosing_UU_Type;
5157 -- Obj2 : Enclosing_UU_Type (1);
5159 -- [. . .] Obj1 = Obj2 [. . .]
5163 -- if not (uu_typeEQ (obj1.comp, obj2.comp, a, b)) then
5165 -- A and B are the formal parameters of the equality function
5166 -- of Enclosing_UU_Type. The function always has two extra
5167 -- formals to capture the inferred discriminant values.
5169 -- 2. Non-Unchecked_Union enclosing record:
5172 -- Enclosing_Non_UU_Type (Discr : Integer := 0)
5175 -- Comp : UU_Type (Discr);
5177 -- end Enclosing_Non_UU_Type;
5179 -- Obj1 : Enclosing_Non_UU_Type;
5180 -- Obj2 : Enclosing_Non_UU_Type (1);
5182 -- ... Obj1 = Obj2 ...
5186 -- if not (uu_typeEQ (obj1.comp, obj2.comp,
5187 -- obj1.discr, obj2.discr)) then
5189 -- In this case we can directly reference the discriminants of
5190 -- the enclosing record.
5194 if Nkind (Lhs) = N_Selected_Component
5195 and then Has_Per_Object_Constraint
5196 (Entity (Selector_Name (Lhs)))
5198 -- Enclosing record is an Unchecked_Union, use formal A
5200 if Is_Unchecked_Union (Scope
5201 (Entity (Selector_Name (Lhs))))
5204 Make_Identifier (Loc,
5207 -- Enclosing record is of a non-Unchecked_Union type, it is
5208 -- possible to reference the discriminant.
5212 Make_Selected_Component (Loc,
5213 Prefix => Prefix (Lhs),
5216 (Get_Discriminant_Value
5217 (First_Discriminant (Lhs_Type),
5219 Stored_Constraint (Lhs_Type))));
5222 -- Comment needed here ???
5225 -- Infer the discriminant value
5229 (Get_Discriminant_Value
5230 (First_Discriminant (Lhs_Type),
5232 Stored_Constraint (Lhs_Type)));
5237 if Nkind (Rhs) = N_Selected_Component
5238 and then Has_Per_Object_Constraint
5239 (Entity (Selector_Name (Rhs)))
5241 if Is_Unchecked_Union
5242 (Scope (Entity (Selector_Name (Rhs))))
5245 Make_Identifier (Loc,
5250 Make_Selected_Component (Loc,
5251 Prefix => Prefix (Rhs),
5253 New_Copy (Get_Discriminant_Value (
5254 First_Discriminant (Rhs_Type),
5256 Stored_Constraint (Rhs_Type))));
5261 New_Copy (Get_Discriminant_Value (
5262 First_Discriminant (Rhs_Type),
5264 Stored_Constraint (Rhs_Type)));
5269 Make_Function_Call (Loc,
5270 Name => New_Reference_To (Eq, Loc),
5271 Parameter_Associations => New_List (
5278 -- Normal case, not an unchecked union
5282 Make_Function_Call (Loc,
5283 Name => New_Reference_To (Eq, Loc),
5284 Parameter_Associations => New_List (L_Exp, R_Exp)));
5287 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5288 end Build_Equality_Call;
5290 ------------------------------------
5291 -- Has_Unconstrained_UU_Component --
5292 ------------------------------------
5294 function Has_Unconstrained_UU_Component
5295 (Typ : Node_Id) return Boolean
5297 Tdef : constant Node_Id :=
5298 Type_Definition (Declaration_Node (Base_Type (Typ)));
5302 function Component_Is_Unconstrained_UU
5303 (Comp : Node_Id) return Boolean;
5304 -- Determines whether the subtype of the component is an
5305 -- unconstrained Unchecked_Union.
5307 function Variant_Is_Unconstrained_UU
5308 (Variant : Node_Id) return Boolean;
5309 -- Determines whether a component of the variant has an unconstrained
5310 -- Unchecked_Union subtype.
5312 -----------------------------------
5313 -- Component_Is_Unconstrained_UU --
5314 -----------------------------------
5316 function Component_Is_Unconstrained_UU
5317 (Comp : Node_Id) return Boolean
5320 if Nkind (Comp) /= N_Component_Declaration then
5325 Sindic : constant Node_Id :=
5326 Subtype_Indication (Component_Definition (Comp));
5329 -- Unconstrained nominal type. In the case of a constraint
5330 -- present, the node kind would have been N_Subtype_Indication.
5332 if Nkind (Sindic) = N_Identifier then
5333 return Is_Unchecked_Union (Base_Type (Etype (Sindic)));
5338 end Component_Is_Unconstrained_UU;
5340 ---------------------------------
5341 -- Variant_Is_Unconstrained_UU --
5342 ---------------------------------
5344 function Variant_Is_Unconstrained_UU
5345 (Variant : Node_Id) return Boolean
5347 Clist : constant Node_Id := Component_List (Variant);
5350 if Is_Empty_List (Component_Items (Clist)) then
5354 -- We only need to test one component
5357 Comp : Node_Id := First (Component_Items (Clist));
5360 while Present (Comp) loop
5361 if Component_Is_Unconstrained_UU (Comp) then
5369 -- None of the components withing the variant were of
5370 -- unconstrained Unchecked_Union type.
5373 end Variant_Is_Unconstrained_UU;
5375 -- Start of processing for Has_Unconstrained_UU_Component
5378 if Null_Present (Tdef) then
5382 Clist := Component_List (Tdef);
5383 Vpart := Variant_Part (Clist);
5385 -- Inspect available components
5387 if Present (Component_Items (Clist)) then
5389 Comp : Node_Id := First (Component_Items (Clist));
5392 while Present (Comp) loop
5394 -- One component is sufficient
5396 if Component_Is_Unconstrained_UU (Comp) then
5405 -- Inspect available components withing variants
5407 if Present (Vpart) then
5409 Variant : Node_Id := First (Variants (Vpart));
5412 while Present (Variant) loop
5414 -- One component within a variant is sufficient
5416 if Variant_Is_Unconstrained_UU (Variant) then
5425 -- Neither the available components, nor the components inside the
5426 -- variant parts were of an unconstrained Unchecked_Union subtype.
5429 end Has_Unconstrained_UU_Component;
5431 -- Start of processing for Expand_N_Op_Eq
5434 Binary_Op_Validity_Checks (N);
5436 if Ekind (Typl) = E_Private_Type then
5437 Typl := Underlying_Type (Typl);
5438 elsif Ekind (Typl) = E_Private_Subtype then
5439 Typl := Underlying_Type (Base_Type (Typl));
5444 -- It may happen in error situations that the underlying type is not
5445 -- set. The error will be detected later, here we just defend the
5452 Typl := Base_Type (Typl);
5454 -- Boolean types (requiring handling of non-standard case)
5456 if Is_Boolean_Type (Typl) then
5457 Adjust_Condition (Left_Opnd (N));
5458 Adjust_Condition (Right_Opnd (N));
5459 Set_Etype (N, Standard_Boolean);
5460 Adjust_Result_Type (N, Typ);
5464 elsif Is_Array_Type (Typl) then
5466 -- If we are doing full validity checking, and it is possible for the
5467 -- array elements to be invalid then expand out array comparisons to
5468 -- make sure that we check the array elements.
5470 if Validity_Check_Operands
5471 and then not Is_Known_Valid (Component_Type (Typl))
5474 Save_Force_Validity_Checks : constant Boolean :=
5475 Force_Validity_Checks;
5477 Force_Validity_Checks := True;
5479 Expand_Array_Equality
5481 Relocate_Node (Lhs),
5482 Relocate_Node (Rhs),
5485 Insert_Actions (N, Bodies);
5486 Analyze_And_Resolve (N, Standard_Boolean);
5487 Force_Validity_Checks := Save_Force_Validity_Checks;
5490 -- Packed case where both operands are known aligned
5492 elsif Is_Bit_Packed_Array (Typl)
5493 and then not Is_Possibly_Unaligned_Object (Lhs)
5494 and then not Is_Possibly_Unaligned_Object (Rhs)
5496 Expand_Packed_Eq (N);
5498 -- Where the component type is elementary we can use a block bit
5499 -- comparison (if supported on the target) exception in the case
5500 -- of floating-point (negative zero issues require element by
5501 -- element comparison), and atomic types (where we must be sure
5502 -- to load elements independently) and possibly unaligned arrays.
5504 elsif Is_Elementary_Type (Component_Type (Typl))
5505 and then not Is_Floating_Point_Type (Component_Type (Typl))
5506 and then not Is_Atomic (Component_Type (Typl))
5507 and then not Is_Possibly_Unaligned_Object (Lhs)
5508 and then not Is_Possibly_Unaligned_Object (Rhs)
5509 and then Support_Composite_Compare_On_Target
5513 -- For composite and floating-point cases, expand equality loop to
5514 -- make sure of using proper comparisons for tagged types, and
5515 -- correctly handling the floating-point case.
5519 Expand_Array_Equality
5521 Relocate_Node (Lhs),
5522 Relocate_Node (Rhs),
5525 Insert_Actions (N, Bodies, Suppress => All_Checks);
5526 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5531 elsif Is_Record_Type (Typl) then
5533 -- For tagged types, use the primitive "="
5535 if Is_Tagged_Type (Typl) then
5537 -- No need to do anything else compiling under restriction
5538 -- No_Dispatching_Calls. During the semantic analysis we
5539 -- already notified such violation.
5541 if Restriction_Active (No_Dispatching_Calls) then
5545 -- If this is derived from an untagged private type completed with
5546 -- a tagged type, it does not have a full view, so we use the
5547 -- primitive operations of the private type. This check should no
5548 -- longer be necessary when these types get their full views???
5550 if Is_Private_Type (A_Typ)
5551 and then not Is_Tagged_Type (A_Typ)
5552 and then Is_Derived_Type (A_Typ)
5553 and then No (Full_View (A_Typ))
5555 -- Search for equality operation, checking that the operands
5556 -- have the same type. Note that we must find a matching entry,
5557 -- or something is very wrong!
5559 Prim := First_Elmt (Collect_Primitive_Operations (A_Typ));
5561 while Present (Prim) loop
5562 exit when Chars (Node (Prim)) = Name_Op_Eq
5563 and then Etype (First_Formal (Node (Prim))) =
5564 Etype (Next_Formal (First_Formal (Node (Prim))))
5566 Base_Type (Etype (Node (Prim))) = Standard_Boolean;
5571 pragma Assert (Present (Prim));
5572 Op_Name := Node (Prim);
5574 -- Find the type's predefined equality or an overriding
5575 -- user- defined equality. The reason for not simply calling
5576 -- Find_Prim_Op here is that there may be a user-defined
5577 -- overloaded equality op that precedes the equality that we want,
5578 -- so we have to explicitly search (e.g., there could be an
5579 -- equality with two different parameter types).
5582 if Is_Class_Wide_Type (Typl) then
5583 Typl := Root_Type (Typl);
5586 Prim := First_Elmt (Primitive_Operations (Typl));
5587 while Present (Prim) loop
5588 exit when Chars (Node (Prim)) = Name_Op_Eq
5589 and then Etype (First_Formal (Node (Prim))) =
5590 Etype (Next_Formal (First_Formal (Node (Prim))))
5592 Base_Type (Etype (Node (Prim))) = Standard_Boolean;
5597 pragma Assert (Present (Prim));
5598 Op_Name := Node (Prim);
5601 Build_Equality_Call (Op_Name);
5603 -- Ada 2005 (AI-216): Program_Error is raised when evaluating the
5604 -- predefined equality operator for a type which has a subcomponent
5605 -- of an Unchecked_Union type whose nominal subtype is unconstrained.
5607 elsif Has_Unconstrained_UU_Component (Typl) then
5609 Make_Raise_Program_Error (Loc,
5610 Reason => PE_Unchecked_Union_Restriction));
5612 -- Prevent Gigi from generating incorrect code by rewriting the
5613 -- equality as a standard False.
5616 New_Occurrence_Of (Standard_False, Loc));
5618 elsif Is_Unchecked_Union (Typl) then
5620 -- If we can infer the discriminants of the operands, we make a
5621 -- call to the TSS equality function.
5623 if Has_Inferable_Discriminants (Lhs)
5625 Has_Inferable_Discriminants (Rhs)
5628 (TSS (Root_Type (Typl), TSS_Composite_Equality));
5631 -- Ada 2005 (AI-216): Program_Error is raised when evaluating
5632 -- the predefined equality operator for an Unchecked_Union type
5633 -- if either of the operands lack inferable discriminants.
5636 Make_Raise_Program_Error (Loc,
5637 Reason => PE_Unchecked_Union_Restriction));
5639 -- Prevent Gigi from generating incorrect code by rewriting
5640 -- the equality as a standard False.
5643 New_Occurrence_Of (Standard_False, Loc));
5647 -- If a type support function is present (for complex cases), use it
5649 elsif Present (TSS (Root_Type (Typl), TSS_Composite_Equality)) then
5651 (TSS (Root_Type (Typl), TSS_Composite_Equality));
5653 -- Otherwise expand the component by component equality. Note that
5654 -- we never use block-bit comparisons for records, because of the
5655 -- problems with gaps. The backend will often be able to recombine
5656 -- the separate comparisons that we generate here.
5659 Remove_Side_Effects (Lhs);
5660 Remove_Side_Effects (Rhs);
5662 Expand_Record_Equality (N, Typl, Lhs, Rhs, Bodies));
5664 Insert_Actions (N, Bodies, Suppress => All_Checks);
5665 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
5669 -- Test if result is known at compile time
5671 Rewrite_Comparison (N);
5673 -- If we still have comparison for Vax_Float, process it
5675 if Vax_Float (Typl) and then Nkind (N) in N_Op_Compare then
5676 Expand_Vax_Comparison (N);
5681 -----------------------
5682 -- Expand_N_Op_Expon --
5683 -----------------------
5685 procedure Expand_N_Op_Expon (N : Node_Id) is
5686 Loc : constant Source_Ptr := Sloc (N);
5687 Typ : constant Entity_Id := Etype (N);
5688 Rtyp : constant Entity_Id := Root_Type (Typ);
5689 Base : constant Node_Id := Relocate_Node (Left_Opnd (N));
5690 Bastyp : constant Node_Id := Etype (Base);
5691 Exp : constant Node_Id := Relocate_Node (Right_Opnd (N));
5692 Exptyp : constant Entity_Id := Etype (Exp);
5693 Ovflo : constant Boolean := Do_Overflow_Check (N);
5702 Binary_Op_Validity_Checks (N);
5704 -- If either operand is of a private type, then we have the use of an
5705 -- intrinsic operator, and we get rid of the privateness, by using root
5706 -- types of underlying types for the actual operation. Otherwise the
5707 -- private types will cause trouble if we expand multiplications or
5708 -- shifts etc. We also do this transformation if the result type is
5709 -- different from the base type.
5711 if Is_Private_Type (Etype (Base))
5713 Is_Private_Type (Typ)
5715 Is_Private_Type (Exptyp)
5717 Rtyp /= Root_Type (Bastyp)
5720 Bt : constant Entity_Id := Root_Type (Underlying_Type (Bastyp));
5721 Et : constant Entity_Id := Root_Type (Underlying_Type (Exptyp));
5725 Unchecked_Convert_To (Typ,
5727 Left_Opnd => Unchecked_Convert_To (Bt, Base),
5728 Right_Opnd => Unchecked_Convert_To (Et, Exp))));
5729 Analyze_And_Resolve (N, Typ);
5734 -- Test for case of known right argument
5736 if Compile_Time_Known_Value (Exp) then
5737 Expv := Expr_Value (Exp);
5739 -- We only fold small non-negative exponents. You might think we
5740 -- could fold small negative exponents for the real case, but we
5741 -- can't because we are required to raise Constraint_Error for
5742 -- the case of 0.0 ** (negative) even if Machine_Overflows = False.
5743 -- See ACVC test C4A012B.
5745 if Expv >= 0 and then Expv <= 4 then
5747 -- X ** 0 = 1 (or 1.0)
5751 -- Call Remove_Side_Effects to ensure that any side effects
5752 -- in the ignored left operand (in particular function calls
5753 -- to user defined functions) are properly executed.
5755 Remove_Side_Effects (Base);
5757 if Ekind (Typ) in Integer_Kind then
5758 Xnode := Make_Integer_Literal (Loc, Intval => 1);
5760 Xnode := Make_Real_Literal (Loc, Ureal_1);
5772 Make_Op_Multiply (Loc,
5773 Left_Opnd => Duplicate_Subexpr (Base),
5774 Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
5776 -- X ** 3 = X * X * X
5780 Make_Op_Multiply (Loc,
5782 Make_Op_Multiply (Loc,
5783 Left_Opnd => Duplicate_Subexpr (Base),
5784 Right_Opnd => Duplicate_Subexpr_No_Checks (Base)),
5785 Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
5788 -- En : constant base'type := base * base;
5794 Make_Defining_Identifier (Loc, New_Internal_Name ('E'));
5796 Insert_Actions (N, New_List (
5797 Make_Object_Declaration (Loc,
5798 Defining_Identifier => Temp,
5799 Constant_Present => True,
5800 Object_Definition => New_Reference_To (Typ, Loc),
5802 Make_Op_Multiply (Loc,
5803 Left_Opnd => Duplicate_Subexpr (Base),
5804 Right_Opnd => Duplicate_Subexpr_No_Checks (Base)))));
5807 Make_Op_Multiply (Loc,
5808 Left_Opnd => New_Reference_To (Temp, Loc),
5809 Right_Opnd => New_Reference_To (Temp, Loc));
5813 Analyze_And_Resolve (N, Typ);
5818 -- Case of (2 ** expression) appearing as an argument of an integer
5819 -- multiplication, or as the right argument of a division of a non-
5820 -- negative integer. In such cases we leave the node untouched, setting
5821 -- the flag Is_Natural_Power_Of_2_for_Shift set, then the expansion
5822 -- of the higher level node converts it into a shift.
5824 -- Note: this transformation is not applicable for a modular type with
5825 -- a non-binary modulus in the multiplication case, since we get a wrong
5826 -- result if the shift causes an overflow before the modular reduction.
5828 if Nkind (Base) = N_Integer_Literal
5829 and then Intval (Base) = 2
5830 and then Is_Integer_Type (Root_Type (Exptyp))
5831 and then Esize (Root_Type (Exptyp)) <= Esize (Standard_Integer)
5832 and then Is_Unsigned_Type (Exptyp)
5834 and then Nkind (Parent (N)) in N_Binary_Op
5837 P : constant Node_Id := Parent (N);
5838 L : constant Node_Id := Left_Opnd (P);
5839 R : constant Node_Id := Right_Opnd (P);
5842 if (Nkind (P) = N_Op_Multiply
5843 and then not Non_Binary_Modulus (Typ)
5845 ((Is_Integer_Type (Etype (L)) and then R = N)
5847 (Is_Integer_Type (Etype (R)) and then L = N))
5848 and then not Do_Overflow_Check (P))
5851 (Nkind (P) = N_Op_Divide
5852 and then Is_Integer_Type (Etype (L))
5853 and then Is_Unsigned_Type (Etype (L))
5855 and then not Do_Overflow_Check (P))
5857 Set_Is_Power_Of_2_For_Shift (N);
5863 -- Fall through if exponentiation must be done using a runtime routine
5865 -- First deal with modular case
5867 if Is_Modular_Integer_Type (Rtyp) then
5869 -- Non-binary case, we call the special exponentiation routine for
5870 -- the non-binary case, converting the argument to Long_Long_Integer
5871 -- and passing the modulus value. Then the result is converted back
5872 -- to the base type.
5874 if Non_Binary_Modulus (Rtyp) then
5877 Make_Function_Call (Loc,
5878 Name => New_Reference_To (RTE (RE_Exp_Modular), Loc),
5879 Parameter_Associations => New_List (
5880 Convert_To (Standard_Integer, Base),
5881 Make_Integer_Literal (Loc, Modulus (Rtyp)),
5884 -- Binary case, in this case, we call one of two routines, either the
5885 -- unsigned integer case, or the unsigned long long integer case,
5886 -- with a final "and" operation to do the required mod.
5889 if UI_To_Int (Esize (Rtyp)) <= Standard_Integer_Size then
5890 Ent := RTE (RE_Exp_Unsigned);
5892 Ent := RTE (RE_Exp_Long_Long_Unsigned);
5899 Make_Function_Call (Loc,
5900 Name => New_Reference_To (Ent, Loc),
5901 Parameter_Associations => New_List (
5902 Convert_To (Etype (First_Formal (Ent)), Base),
5905 Make_Integer_Literal (Loc, Modulus (Rtyp) - 1))));
5909 -- Common exit point for modular type case
5911 Analyze_And_Resolve (N, Typ);
5914 -- Signed integer cases, done using either Integer or Long_Long_Integer.
5915 -- It is not worth having routines for Short_[Short_]Integer, since for
5916 -- most machines it would not help, and it would generate more code that
5917 -- might need certification when a certified run time is required.
5919 -- In the integer cases, we have two routines, one for when overflow
5920 -- checks are required, and one when they are not required, since there
5921 -- is a real gain in omitting checks on many machines.
5923 elsif Rtyp = Base_Type (Standard_Long_Long_Integer)
5924 or else (Rtyp = Base_Type (Standard_Long_Integer)
5926 Esize (Standard_Long_Integer) > Esize (Standard_Integer))
5927 or else (Rtyp = Universal_Integer)
5929 Etyp := Standard_Long_Long_Integer;
5932 Rent := RE_Exp_Long_Long_Integer;
5934 Rent := RE_Exn_Long_Long_Integer;
5937 elsif Is_Signed_Integer_Type (Rtyp) then
5938 Etyp := Standard_Integer;
5941 Rent := RE_Exp_Integer;
5943 Rent := RE_Exn_Integer;
5946 -- Floating-point cases, always done using Long_Long_Float. We do not
5947 -- need separate routines for the overflow case here, since in the case
5948 -- of floating-point, we generate infinities anyway as a rule (either
5949 -- that or we automatically trap overflow), and if there is an infinity
5950 -- generated and a range check is required, the check will fail anyway.
5953 pragma Assert (Is_Floating_Point_Type (Rtyp));
5954 Etyp := Standard_Long_Long_Float;
5955 Rent := RE_Exn_Long_Long_Float;
5958 -- Common processing for integer cases and floating-point cases.
5959 -- If we are in the right type, we can call runtime routine directly
5962 and then Rtyp /= Universal_Integer
5963 and then Rtyp /= Universal_Real
5966 Make_Function_Call (Loc,
5967 Name => New_Reference_To (RTE (Rent), Loc),
5968 Parameter_Associations => New_List (Base, Exp)));
5970 -- Otherwise we have to introduce conversions (conversions are also
5971 -- required in the universal cases, since the runtime routine is
5972 -- typed using one of the standard types).
5977 Make_Function_Call (Loc,
5978 Name => New_Reference_To (RTE (Rent), Loc),
5979 Parameter_Associations => New_List (
5980 Convert_To (Etyp, Base),
5984 Analyze_And_Resolve (N, Typ);
5988 when RE_Not_Available =>
5990 end Expand_N_Op_Expon;
5992 --------------------
5993 -- Expand_N_Op_Ge --
5994 --------------------
5996 procedure Expand_N_Op_Ge (N : Node_Id) is
5997 Typ : constant Entity_Id := Etype (N);
5998 Op1 : constant Node_Id := Left_Opnd (N);
5999 Op2 : constant Node_Id := Right_Opnd (N);
6000 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6003 Binary_Op_Validity_Checks (N);
6005 if Is_Array_Type (Typ1) then
6006 Expand_Array_Comparison (N);
6010 if Is_Boolean_Type (Typ1) then
6011 Adjust_Condition (Op1);
6012 Adjust_Condition (Op2);
6013 Set_Etype (N, Standard_Boolean);
6014 Adjust_Result_Type (N, Typ);
6017 Rewrite_Comparison (N);
6019 -- If we still have comparison, and Vax_Float type, process it
6021 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6022 Expand_Vax_Comparison (N);
6027 --------------------
6028 -- Expand_N_Op_Gt --
6029 --------------------
6031 procedure Expand_N_Op_Gt (N : Node_Id) is
6032 Typ : constant Entity_Id := Etype (N);
6033 Op1 : constant Node_Id := Left_Opnd (N);
6034 Op2 : constant Node_Id := Right_Opnd (N);
6035 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6038 Binary_Op_Validity_Checks (N);
6040 if Is_Array_Type (Typ1) then
6041 Expand_Array_Comparison (N);
6045 if Is_Boolean_Type (Typ1) then
6046 Adjust_Condition (Op1);
6047 Adjust_Condition (Op2);
6048 Set_Etype (N, Standard_Boolean);
6049 Adjust_Result_Type (N, Typ);
6052 Rewrite_Comparison (N);
6054 -- If we still have comparison, and Vax_Float type, process it
6056 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6057 Expand_Vax_Comparison (N);
6062 --------------------
6063 -- Expand_N_Op_Le --
6064 --------------------
6066 procedure Expand_N_Op_Le (N : Node_Id) is
6067 Typ : constant Entity_Id := Etype (N);
6068 Op1 : constant Node_Id := Left_Opnd (N);
6069 Op2 : constant Node_Id := Right_Opnd (N);
6070 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6073 Binary_Op_Validity_Checks (N);
6075 if Is_Array_Type (Typ1) then
6076 Expand_Array_Comparison (N);
6080 if Is_Boolean_Type (Typ1) then
6081 Adjust_Condition (Op1);
6082 Adjust_Condition (Op2);
6083 Set_Etype (N, Standard_Boolean);
6084 Adjust_Result_Type (N, Typ);
6087 Rewrite_Comparison (N);
6089 -- If we still have comparison, and Vax_Float type, process it
6091 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6092 Expand_Vax_Comparison (N);
6097 --------------------
6098 -- Expand_N_Op_Lt --
6099 --------------------
6101 procedure Expand_N_Op_Lt (N : Node_Id) is
6102 Typ : constant Entity_Id := Etype (N);
6103 Op1 : constant Node_Id := Left_Opnd (N);
6104 Op2 : constant Node_Id := Right_Opnd (N);
6105 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
6108 Binary_Op_Validity_Checks (N);
6110 if Is_Array_Type (Typ1) then
6111 Expand_Array_Comparison (N);
6115 if Is_Boolean_Type (Typ1) then
6116 Adjust_Condition (Op1);
6117 Adjust_Condition (Op2);
6118 Set_Etype (N, Standard_Boolean);
6119 Adjust_Result_Type (N, Typ);
6122 Rewrite_Comparison (N);
6124 -- If we still have comparison, and Vax_Float type, process it
6126 if Vax_Float (Typ1) and then Nkind (N) in N_Op_Compare then
6127 Expand_Vax_Comparison (N);
6132 -----------------------
6133 -- Expand_N_Op_Minus --
6134 -----------------------
6136 procedure Expand_N_Op_Minus (N : Node_Id) is
6137 Loc : constant Source_Ptr := Sloc (N);
6138 Typ : constant Entity_Id := Etype (N);
6141 Unary_Op_Validity_Checks (N);
6143 if not Backend_Overflow_Checks_On_Target
6144 and then Is_Signed_Integer_Type (Etype (N))
6145 and then Do_Overflow_Check (N)
6147 -- Software overflow checking expands -expr into (0 - expr)
6150 Make_Op_Subtract (Loc,
6151 Left_Opnd => Make_Integer_Literal (Loc, 0),
6152 Right_Opnd => Right_Opnd (N)));
6154 Analyze_And_Resolve (N, Typ);
6156 -- Vax floating-point types case
6158 elsif Vax_Float (Etype (N)) then
6159 Expand_Vax_Arith (N);
6161 end Expand_N_Op_Minus;
6163 ---------------------
6164 -- Expand_N_Op_Mod --
6165 ---------------------
6167 procedure Expand_N_Op_Mod (N : Node_Id) is
6168 Loc : constant Source_Ptr := Sloc (N);
6169 Typ : constant Entity_Id := Etype (N);
6170 Left : constant Node_Id := Left_Opnd (N);
6171 Right : constant Node_Id := Right_Opnd (N);
6172 DOC : constant Boolean := Do_Overflow_Check (N);
6173 DDC : constant Boolean := Do_Division_Check (N);
6183 pragma Warnings (Off, Lhi);
6186 Binary_Op_Validity_Checks (N);
6188 Determine_Range (Right, ROK, Rlo, Rhi);
6189 Determine_Range (Left, LOK, Llo, Lhi);
6191 -- Convert mod to rem if operands are known non-negative. We do this
6192 -- since it is quite likely that this will improve the quality of code,
6193 -- (the operation now corresponds to the hardware remainder), and it
6194 -- does not seem likely that it could be harmful.
6196 if LOK and then Llo >= 0
6198 ROK and then Rlo >= 0
6201 Make_Op_Rem (Sloc (N),
6202 Left_Opnd => Left_Opnd (N),
6203 Right_Opnd => Right_Opnd (N)));
6205 -- Instead of reanalyzing the node we do the analysis manually. This
6206 -- avoids anomalies when the replacement is done in an instance and
6207 -- is epsilon more efficient.
6209 Set_Entity (N, Standard_Entity (S_Op_Rem));
6211 Set_Do_Overflow_Check (N, DOC);
6212 Set_Do_Division_Check (N, DDC);
6213 Expand_N_Op_Rem (N);
6216 -- Otherwise, normal mod processing
6219 if Is_Integer_Type (Etype (N)) then
6220 Apply_Divide_Check (N);
6223 -- Apply optimization x mod 1 = 0. We don't really need that with
6224 -- gcc, but it is useful with other back ends (e.g. AAMP), and is
6225 -- certainly harmless.
6227 if Is_Integer_Type (Etype (N))
6228 and then Compile_Time_Known_Value (Right)
6229 and then Expr_Value (Right) = Uint_1
6231 -- Call Remove_Side_Effects to ensure that any side effects in
6232 -- the ignored left operand (in particular function calls to
6233 -- user defined functions) are properly executed.
6235 Remove_Side_Effects (Left);
6237 Rewrite (N, Make_Integer_Literal (Loc, 0));
6238 Analyze_And_Resolve (N, Typ);
6242 -- Deal with annoying case of largest negative number remainder
6243 -- minus one. Gigi does not handle this case correctly, because
6244 -- it generates a divide instruction which may trap in this case.
6246 -- In fact the check is quite easy, if the right operand is -1, then
6247 -- the mod value is always 0, and we can just ignore the left operand
6248 -- completely in this case.
6250 -- The operand type may be private (e.g. in the expansion of an
6251 -- intrinsic operation) so we must use the underlying type to get the
6252 -- bounds, and convert the literals explicitly.
6256 (Type_Low_Bound (Base_Type (Underlying_Type (Etype (Left)))));
6258 if ((not ROK) or else (Rlo <= (-1) and then (-1) <= Rhi))
6260 ((not LOK) or else (Llo = LLB))
6263 Make_Conditional_Expression (Loc,
6264 Expressions => New_List (
6266 Left_Opnd => Duplicate_Subexpr (Right),
6268 Unchecked_Convert_To (Typ,
6269 Make_Integer_Literal (Loc, -1))),
6270 Unchecked_Convert_To (Typ,
6271 Make_Integer_Literal (Loc, Uint_0)),
6272 Relocate_Node (N))));
6274 Set_Analyzed (Next (Next (First (Expressions (N)))));
6275 Analyze_And_Resolve (N, Typ);
6278 end Expand_N_Op_Mod;
6280 --------------------------
6281 -- Expand_N_Op_Multiply --
6282 --------------------------
6284 procedure Expand_N_Op_Multiply (N : Node_Id) is
6285 Loc : constant Source_Ptr := Sloc (N);
6286 Lop : constant Node_Id := Left_Opnd (N);
6287 Rop : constant Node_Id := Right_Opnd (N);
6289 Lp2 : constant Boolean :=
6290 Nkind (Lop) = N_Op_Expon
6291 and then Is_Power_Of_2_For_Shift (Lop);
6293 Rp2 : constant Boolean :=
6294 Nkind (Rop) = N_Op_Expon
6295 and then Is_Power_Of_2_For_Shift (Rop);
6297 Ltyp : constant Entity_Id := Etype (Lop);
6298 Rtyp : constant Entity_Id := Etype (Rop);
6299 Typ : Entity_Id := Etype (N);
6302 Binary_Op_Validity_Checks (N);
6304 -- Special optimizations for integer types
6306 if Is_Integer_Type (Typ) then
6308 -- N * 0 = 0 for integer types
6310 if Compile_Time_Known_Value (Rop)
6311 and then Expr_Value (Rop) = Uint_0
6313 -- Call Remove_Side_Effects to ensure that any side effects in
6314 -- the ignored left operand (in particular function calls to
6315 -- user defined functions) are properly executed.
6317 Remove_Side_Effects (Lop);
6319 Rewrite (N, Make_Integer_Literal (Loc, Uint_0));
6320 Analyze_And_Resolve (N, Typ);
6324 -- Similar handling for 0 * N = 0
6326 if Compile_Time_Known_Value (Lop)
6327 and then Expr_Value (Lop) = Uint_0
6329 Remove_Side_Effects (Rop);
6330 Rewrite (N, Make_Integer_Literal (Loc, Uint_0));
6331 Analyze_And_Resolve (N, Typ);
6335 -- N * 1 = 1 * N = N for integer types
6337 -- This optimisation is not done if we are going to
6338 -- rewrite the product 1 * 2 ** N to a shift.
6340 if Compile_Time_Known_Value (Rop)
6341 and then Expr_Value (Rop) = Uint_1
6347 elsif Compile_Time_Known_Value (Lop)
6348 and then Expr_Value (Lop) = Uint_1
6356 -- Convert x * 2 ** y to Shift_Left (x, y). Note that the fact that
6357 -- Is_Power_Of_2_For_Shift is set means that we know that our left
6358 -- operand is an integer, as required for this to work.
6363 -- Convert 2 ** A * 2 ** B into 2 ** (A + B)
6367 Left_Opnd => Make_Integer_Literal (Loc, 2),
6370 Left_Opnd => Right_Opnd (Lop),
6371 Right_Opnd => Right_Opnd (Rop))));
6372 Analyze_And_Resolve (N, Typ);
6377 Make_Op_Shift_Left (Loc,
6380 Convert_To (Standard_Natural, Right_Opnd (Rop))));
6381 Analyze_And_Resolve (N, Typ);
6385 -- Same processing for the operands the other way round
6389 Make_Op_Shift_Left (Loc,
6392 Convert_To (Standard_Natural, Right_Opnd (Lop))));
6393 Analyze_And_Resolve (N, Typ);
6397 -- Do required fixup of universal fixed operation
6399 if Typ = Universal_Fixed then
6400 Fixup_Universal_Fixed_Operation (N);
6404 -- Multiplications with fixed-point results
6406 if Is_Fixed_Point_Type (Typ) then
6408 -- No special processing if Treat_Fixed_As_Integer is set, since from
6409 -- a semantic point of view such operations are simply integer
6410 -- operations and will be treated that way.
6412 if not Treat_Fixed_As_Integer (N) then
6414 -- Case of fixed * integer => fixed
6416 if Is_Integer_Type (Rtyp) then
6417 Expand_Multiply_Fixed_By_Integer_Giving_Fixed (N);
6419 -- Case of integer * fixed => fixed
6421 elsif Is_Integer_Type (Ltyp) then
6422 Expand_Multiply_Integer_By_Fixed_Giving_Fixed (N);
6424 -- Case of fixed * fixed => fixed
6427 Expand_Multiply_Fixed_By_Fixed_Giving_Fixed (N);
6431 -- Other cases of multiplication of fixed-point operands. Again we
6432 -- exclude the cases where Treat_Fixed_As_Integer flag is set.
6434 elsif (Is_Fixed_Point_Type (Ltyp) or else Is_Fixed_Point_Type (Rtyp))
6435 and then not Treat_Fixed_As_Integer (N)
6437 if Is_Integer_Type (Typ) then
6438 Expand_Multiply_Fixed_By_Fixed_Giving_Integer (N);
6440 pragma Assert (Is_Floating_Point_Type (Typ));
6441 Expand_Multiply_Fixed_By_Fixed_Giving_Float (N);
6444 -- Mixed-mode operations can appear in a non-static universal context,
6445 -- in which case the integer argument must be converted explicitly.
6447 elsif Typ = Universal_Real
6448 and then Is_Integer_Type (Rtyp)
6450 Rewrite (Rop, Convert_To (Universal_Real, Relocate_Node (Rop)));
6452 Analyze_And_Resolve (Rop, Universal_Real);
6454 elsif Typ = Universal_Real
6455 and then Is_Integer_Type (Ltyp)
6457 Rewrite (Lop, Convert_To (Universal_Real, Relocate_Node (Lop)));
6459 Analyze_And_Resolve (Lop, Universal_Real);
6461 -- Non-fixed point cases, check software overflow checking required
6463 elsif Is_Signed_Integer_Type (Etype (N)) then
6464 Apply_Arithmetic_Overflow_Check (N);
6466 -- Deal with VAX float case
6468 elsif Vax_Float (Typ) then
6469 Expand_Vax_Arith (N);
6472 end Expand_N_Op_Multiply;
6474 --------------------
6475 -- Expand_N_Op_Ne --
6476 --------------------
6478 procedure Expand_N_Op_Ne (N : Node_Id) is
6479 Typ : constant Entity_Id := Etype (Left_Opnd (N));
6482 -- Case of elementary type with standard operator
6484 if Is_Elementary_Type (Typ)
6485 and then Sloc (Entity (N)) = Standard_Location
6487 Binary_Op_Validity_Checks (N);
6489 -- Boolean types (requiring handling of non-standard case)
6491 if Is_Boolean_Type (Typ) then
6492 Adjust_Condition (Left_Opnd (N));
6493 Adjust_Condition (Right_Opnd (N));
6494 Set_Etype (N, Standard_Boolean);
6495 Adjust_Result_Type (N, Typ);
6498 Rewrite_Comparison (N);
6500 -- If we still have comparison for Vax_Float, process it
6502 if Vax_Float (Typ) and then Nkind (N) in N_Op_Compare then
6503 Expand_Vax_Comparison (N);
6507 -- For all cases other than elementary types, we rewrite node as the
6508 -- negation of an equality operation, and reanalyze. The equality to be
6509 -- used is defined in the same scope and has the same signature. This
6510 -- signature must be set explicitly since in an instance it may not have
6511 -- the same visibility as in the generic unit. This avoids duplicating
6512 -- or factoring the complex code for record/array equality tests etc.
6516 Loc : constant Source_Ptr := Sloc (N);
6518 Ne : constant Entity_Id := Entity (N);
6521 Binary_Op_Validity_Checks (N);
6527 Left_Opnd => Left_Opnd (N),
6528 Right_Opnd => Right_Opnd (N)));
6529 Set_Paren_Count (Right_Opnd (Neg), 1);
6531 if Scope (Ne) /= Standard_Standard then
6532 Set_Entity (Right_Opnd (Neg), Corresponding_Equality (Ne));
6535 -- For navigation purposes, the inequality is treated as an
6536 -- implicit reference to the corresponding equality. Preserve the
6537 -- Comes_From_ source flag so that the proper Xref entry is
6540 Preserve_Comes_From_Source (Neg, N);
6541 Preserve_Comes_From_Source (Right_Opnd (Neg), N);
6543 Analyze_And_Resolve (N, Standard_Boolean);
6548 ---------------------
6549 -- Expand_N_Op_Not --
6550 ---------------------
6552 -- If the argument is other than a Boolean array type, there is no special
6553 -- expansion required.
6555 -- For the packed case, we call the special routine in Exp_Pakd, except
6556 -- that if the component size is greater than one, we use the standard
6557 -- routine generating a gruesome loop (it is so peculiar to have packed
6558 -- arrays with non-standard Boolean representations anyway, so it does not
6559 -- matter that we do not handle this case efficiently).
6561 -- For the unpacked case (and for the special packed case where we have non
6562 -- standard Booleans, as discussed above), we generate and insert into the
6563 -- tree the following function definition:
6565 -- function Nnnn (A : arr) is
6568 -- for J in a'range loop
6569 -- B (J) := not A (J);
6574 -- Here arr is the actual subtype of the parameter (and hence always
6575 -- constrained). Then we replace the not with a call to this function.
6577 procedure Expand_N_Op_Not (N : Node_Id) is
6578 Loc : constant Source_Ptr := Sloc (N);
6579 Typ : constant Entity_Id := Etype (N);
6588 Func_Name : Entity_Id;
6589 Loop_Statement : Node_Id;
6592 Unary_Op_Validity_Checks (N);
6594 -- For boolean operand, deal with non-standard booleans
6596 if Is_Boolean_Type (Typ) then
6597 Adjust_Condition (Right_Opnd (N));
6598 Set_Etype (N, Standard_Boolean);
6599 Adjust_Result_Type (N, Typ);
6603 -- Only array types need any other processing
6605 if not Is_Array_Type (Typ) then
6609 -- Case of array operand. If bit packed with a component size of 1,
6610 -- handle it in Exp_Pakd if the operand is known to be aligned.
6612 if Is_Bit_Packed_Array (Typ)
6613 and then Component_Size (Typ) = 1
6614 and then not Is_Possibly_Unaligned_Object (Right_Opnd (N))
6616 Expand_Packed_Not (N);
6620 -- Case of array operand which is not bit-packed. If the context is
6621 -- a safe assignment, call in-place operation, If context is a larger
6622 -- boolean expression in the context of a safe assignment, expansion is
6623 -- done by enclosing operation.
6625 Opnd := Relocate_Node (Right_Opnd (N));
6626 Convert_To_Actual_Subtype (Opnd);
6627 Arr := Etype (Opnd);
6628 Ensure_Defined (Arr, N);
6629 Silly_Boolean_Array_Not_Test (N, Arr);
6631 if Nkind (Parent (N)) = N_Assignment_Statement then
6632 if Safe_In_Place_Array_Op (Name (Parent (N)), N, Empty) then
6633 Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
6636 -- Special case the negation of a binary operation
6638 elsif Nkind_In (Opnd, N_Op_And, N_Op_Or, N_Op_Xor)
6639 and then Safe_In_Place_Array_Op
6640 (Name (Parent (N)), Left_Opnd (Opnd), Right_Opnd (Opnd))
6642 Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
6646 elsif Nkind (Parent (N)) in N_Binary_Op
6647 and then Nkind (Parent (Parent (N))) = N_Assignment_Statement
6650 Op1 : constant Node_Id := Left_Opnd (Parent (N));
6651 Op2 : constant Node_Id := Right_Opnd (Parent (N));
6652 Lhs : constant Node_Id := Name (Parent (Parent (N)));
6655 if Safe_In_Place_Array_Op (Lhs, Op1, Op2) then
6657 and then Nkind (Op2) = N_Op_Not
6659 -- (not A) op (not B) can be reduced to a single call
6664 and then Nkind (Parent (N)) = N_Op_Xor
6666 -- A xor (not B) can also be special-cased
6674 A := Make_Defining_Identifier (Loc, Name_uA);
6675 B := Make_Defining_Identifier (Loc, Name_uB);
6676 J := Make_Defining_Identifier (Loc, Name_uJ);
6679 Make_Indexed_Component (Loc,
6680 Prefix => New_Reference_To (A, Loc),
6681 Expressions => New_List (New_Reference_To (J, Loc)));
6684 Make_Indexed_Component (Loc,
6685 Prefix => New_Reference_To (B, Loc),
6686 Expressions => New_List (New_Reference_To (J, Loc)));
6689 Make_Implicit_Loop_Statement (N,
6690 Identifier => Empty,
6693 Make_Iteration_Scheme (Loc,
6694 Loop_Parameter_Specification =>
6695 Make_Loop_Parameter_Specification (Loc,
6696 Defining_Identifier => J,
6697 Discrete_Subtype_Definition =>
6698 Make_Attribute_Reference (Loc,
6699 Prefix => Make_Identifier (Loc, Chars (A)),
6700 Attribute_Name => Name_Range))),
6702 Statements => New_List (
6703 Make_Assignment_Statement (Loc,
6705 Expression => Make_Op_Not (Loc, A_J))));
6707 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('N'));
6708 Set_Is_Inlined (Func_Name);
6711 Make_Subprogram_Body (Loc,
6713 Make_Function_Specification (Loc,
6714 Defining_Unit_Name => Func_Name,
6715 Parameter_Specifications => New_List (
6716 Make_Parameter_Specification (Loc,
6717 Defining_Identifier => A,
6718 Parameter_Type => New_Reference_To (Typ, Loc))),
6719 Result_Definition => New_Reference_To (Typ, Loc)),
6721 Declarations => New_List (
6722 Make_Object_Declaration (Loc,
6723 Defining_Identifier => B,
6724 Object_Definition => New_Reference_To (Arr, Loc))),
6726 Handled_Statement_Sequence =>
6727 Make_Handled_Sequence_Of_Statements (Loc,
6728 Statements => New_List (
6730 Make_Simple_Return_Statement (Loc,
6732 Make_Identifier (Loc, Chars (B)))))));
6735 Make_Function_Call (Loc,
6736 Name => New_Reference_To (Func_Name, Loc),
6737 Parameter_Associations => New_List (Opnd)));
6739 Analyze_And_Resolve (N, Typ);
6740 end Expand_N_Op_Not;
6742 --------------------
6743 -- Expand_N_Op_Or --
6744 --------------------
6746 procedure Expand_N_Op_Or (N : Node_Id) is
6747 Typ : constant Entity_Id := Etype (N);
6750 Binary_Op_Validity_Checks (N);
6752 if Is_Array_Type (Etype (N)) then
6753 Expand_Boolean_Operator (N);
6755 elsif Is_Boolean_Type (Etype (N)) then
6756 Adjust_Condition (Left_Opnd (N));
6757 Adjust_Condition (Right_Opnd (N));
6758 Set_Etype (N, Standard_Boolean);
6759 Adjust_Result_Type (N, Typ);
6763 ----------------------
6764 -- Expand_N_Op_Plus --
6765 ----------------------
6767 procedure Expand_N_Op_Plus (N : Node_Id) is
6769 Unary_Op_Validity_Checks (N);
6770 end Expand_N_Op_Plus;
6772 ---------------------
6773 -- Expand_N_Op_Rem --
6774 ---------------------
6776 procedure Expand_N_Op_Rem (N : Node_Id) is
6777 Loc : constant Source_Ptr := Sloc (N);
6778 Typ : constant Entity_Id := Etype (N);
6780 Left : constant Node_Id := Left_Opnd (N);
6781 Right : constant Node_Id := Right_Opnd (N);
6791 pragma Warnings (Off, Lhi);
6794 Binary_Op_Validity_Checks (N);
6796 if Is_Integer_Type (Etype (N)) then
6797 Apply_Divide_Check (N);
6800 -- Apply optimization x rem 1 = 0. We don't really need that with gcc,
6801 -- but it is useful with other back ends (e.g. AAMP), and is certainly
6804 if Is_Integer_Type (Etype (N))
6805 and then Compile_Time_Known_Value (Right)
6806 and then Expr_Value (Right) = Uint_1
6808 -- Call Remove_Side_Effects to ensure that any side effects in the
6809 -- ignored left operand (in particular function calls to user defined
6810 -- functions) are properly executed.
6812 Remove_Side_Effects (Left);
6814 Rewrite (N, Make_Integer_Literal (Loc, 0));
6815 Analyze_And_Resolve (N, Typ);
6819 -- Deal with annoying case of largest negative number remainder minus
6820 -- one. Gigi does not handle this case correctly, because it generates
6821 -- a divide instruction which may trap in this case.
6823 -- In fact the check is quite easy, if the right operand is -1, then
6824 -- the remainder is always 0, and we can just ignore the left operand
6825 -- completely in this case.
6827 Determine_Range (Right, ROK, Rlo, Rhi);
6828 Determine_Range (Left, LOK, Llo, Lhi);
6830 -- The operand type may be private (e.g. in the expansion of an
6831 -- intrinsic operation) so we must use the underlying type to get the
6832 -- bounds, and convert the literals explicitly.
6836 (Type_Low_Bound (Base_Type (Underlying_Type (Etype (Left)))));
6838 -- Now perform the test, generating code only if needed
6840 if ((not ROK) or else (Rlo <= (-1) and then (-1) <= Rhi))
6842 ((not LOK) or else (Llo = LLB))
6845 Make_Conditional_Expression (Loc,
6846 Expressions => New_List (
6848 Left_Opnd => Duplicate_Subexpr (Right),
6850 Unchecked_Convert_To (Typ,
6851 Make_Integer_Literal (Loc, -1))),
6853 Unchecked_Convert_To (Typ,
6854 Make_Integer_Literal (Loc, Uint_0)),
6856 Relocate_Node (N))));
6858 Set_Analyzed (Next (Next (First (Expressions (N)))));
6859 Analyze_And_Resolve (N, Typ);
6861 end Expand_N_Op_Rem;
6863 -----------------------------
6864 -- Expand_N_Op_Rotate_Left --
6865 -----------------------------
6867 procedure Expand_N_Op_Rotate_Left (N : Node_Id) is
6869 Binary_Op_Validity_Checks (N);
6870 end Expand_N_Op_Rotate_Left;
6872 ------------------------------
6873 -- Expand_N_Op_Rotate_Right --
6874 ------------------------------
6876 procedure Expand_N_Op_Rotate_Right (N : Node_Id) is
6878 Binary_Op_Validity_Checks (N);
6879 end Expand_N_Op_Rotate_Right;
6881 ----------------------------
6882 -- Expand_N_Op_Shift_Left --
6883 ----------------------------
6885 procedure Expand_N_Op_Shift_Left (N : Node_Id) is
6887 Binary_Op_Validity_Checks (N);
6888 end Expand_N_Op_Shift_Left;
6890 -----------------------------
6891 -- Expand_N_Op_Shift_Right --
6892 -----------------------------
6894 procedure Expand_N_Op_Shift_Right (N : Node_Id) is
6896 Binary_Op_Validity_Checks (N);
6897 end Expand_N_Op_Shift_Right;
6899 ----------------------------------------
6900 -- Expand_N_Op_Shift_Right_Arithmetic --
6901 ----------------------------------------
6903 procedure Expand_N_Op_Shift_Right_Arithmetic (N : Node_Id) is
6905 Binary_Op_Validity_Checks (N);
6906 end Expand_N_Op_Shift_Right_Arithmetic;
6908 --------------------------
6909 -- Expand_N_Op_Subtract --
6910 --------------------------
6912 procedure Expand_N_Op_Subtract (N : Node_Id) is
6913 Typ : constant Entity_Id := Etype (N);
6916 Binary_Op_Validity_Checks (N);
6918 -- N - 0 = N for integer types
6920 if Is_Integer_Type (Typ)
6921 and then Compile_Time_Known_Value (Right_Opnd (N))
6922 and then Expr_Value (Right_Opnd (N)) = 0
6924 Rewrite (N, Left_Opnd (N));
6928 -- Arithmetic overflow checks for signed integer/fixed point types
6930 if Is_Signed_Integer_Type (Typ)
6931 or else Is_Fixed_Point_Type (Typ)
6933 Apply_Arithmetic_Overflow_Check (N);
6935 -- Vax floating-point types case
6937 elsif Vax_Float (Typ) then
6938 Expand_Vax_Arith (N);
6940 end Expand_N_Op_Subtract;
6942 ---------------------
6943 -- Expand_N_Op_Xor --
6944 ---------------------
6946 procedure Expand_N_Op_Xor (N : Node_Id) is
6947 Typ : constant Entity_Id := Etype (N);
6950 Binary_Op_Validity_Checks (N);
6952 if Is_Array_Type (Etype (N)) then
6953 Expand_Boolean_Operator (N);
6955 elsif Is_Boolean_Type (Etype (N)) then
6956 Adjust_Condition (Left_Opnd (N));
6957 Adjust_Condition (Right_Opnd (N));
6958 Set_Etype (N, Standard_Boolean);
6959 Adjust_Result_Type (N, Typ);
6961 end Expand_N_Op_Xor;
6963 ----------------------
6964 -- Expand_N_Or_Else --
6965 ----------------------
6967 -- Expand into conditional expression if Actions present, and also
6968 -- deal with optimizing case of arguments being True or False.
6970 procedure Expand_N_Or_Else (N : Node_Id) is
6971 Loc : constant Source_Ptr := Sloc (N);
6972 Typ : constant Entity_Id := Etype (N);
6973 Left : constant Node_Id := Left_Opnd (N);
6974 Right : constant Node_Id := Right_Opnd (N);
6978 -- Deal with non-standard booleans
6980 if Is_Boolean_Type (Typ) then
6981 Adjust_Condition (Left);
6982 Adjust_Condition (Right);
6983 Set_Etype (N, Standard_Boolean);
6986 -- Check for cases where left argument is known to be True or False
6988 if Compile_Time_Known_Value (Left) then
6990 -- If left argument is False, change (False or else Right) to Right.
6991 -- Any actions associated with Right will be executed unconditionally
6992 -- and can thus be inserted into the tree unconditionally.
6994 if Expr_Value_E (Left) = Standard_False then
6995 if Present (Actions (N)) then
6996 Insert_Actions (N, Actions (N));
7001 -- If left argument is True, change (True and then Right) to True. In
7002 -- this case we can forget the actions associated with Right, since
7003 -- they will never be executed.
7005 else pragma Assert (Expr_Value_E (Left) = Standard_True);
7006 Kill_Dead_Code (Right);
7007 Kill_Dead_Code (Actions (N));
7008 Rewrite (N, New_Occurrence_Of (Standard_True, Loc));
7011 Adjust_Result_Type (N, Typ);
7015 -- If Actions are present, we expand
7017 -- left or else right
7021 -- if left then True else right end
7023 -- with the actions becoming the Else_Actions of the conditional
7024 -- expression. This conditional expression is then further expanded
7025 -- (and will eventually disappear)
7027 if Present (Actions (N)) then
7028 Actlist := Actions (N);
7030 Make_Conditional_Expression (Loc,
7031 Expressions => New_List (
7033 New_Occurrence_Of (Standard_True, Loc),
7036 Set_Else_Actions (N, Actlist);
7037 Analyze_And_Resolve (N, Standard_Boolean);
7038 Adjust_Result_Type (N, Typ);
7042 -- No actions present, check for cases of right argument True/False
7044 if Compile_Time_Known_Value (Right) then
7046 -- Change (Left or else False) to Left. Note that we know there are
7047 -- no actions associated with the True operand, since we just checked
7048 -- for this case above.
7050 if Expr_Value_E (Right) = Standard_False then
7053 -- Change (Left or else True) to True, making sure to preserve any
7054 -- side effects associated with the Left operand.
7056 else pragma Assert (Expr_Value_E (Right) = Standard_True);
7057 Remove_Side_Effects (Left);
7059 (N, New_Occurrence_Of (Standard_True, Loc));
7063 Adjust_Result_Type (N, Typ);
7064 end Expand_N_Or_Else;
7066 -----------------------------------
7067 -- Expand_N_Qualified_Expression --
7068 -----------------------------------
7070 procedure Expand_N_Qualified_Expression (N : Node_Id) is
7071 Operand : constant Node_Id := Expression (N);
7072 Target_Type : constant Entity_Id := Entity (Subtype_Mark (N));
7075 -- Do validity check if validity checking operands
7077 if Validity_Checks_On
7078 and then Validity_Check_Operands
7080 Ensure_Valid (Operand);
7083 -- Apply possible constraint check
7085 Apply_Constraint_Check (Operand, Target_Type, No_Sliding => True);
7087 if Do_Range_Check (Operand) then
7088 Set_Do_Range_Check (Operand, False);
7089 Generate_Range_Check (Operand, Target_Type, CE_Range_Check_Failed);
7091 end Expand_N_Qualified_Expression;
7093 ---------------------------------
7094 -- Expand_N_Selected_Component --
7095 ---------------------------------
7097 -- If the selector is a discriminant of a concurrent object, rewrite the
7098 -- prefix to denote the corresponding record type.
7100 procedure Expand_N_Selected_Component (N : Node_Id) is
7101 Loc : constant Source_Ptr := Sloc (N);
7102 Par : constant Node_Id := Parent (N);
7103 P : constant Node_Id := Prefix (N);
7104 Ptyp : Entity_Id := Underlying_Type (Etype (P));
7109 function In_Left_Hand_Side (Comp : Node_Id) return Boolean;
7110 -- Gigi needs a temporary for prefixes that depend on a discriminant,
7111 -- unless the context of an assignment can provide size information.
7112 -- Don't we have a general routine that does this???
7114 -----------------------
7115 -- In_Left_Hand_Side --
7116 -----------------------
7118 function In_Left_Hand_Side (Comp : Node_Id) return Boolean is
7120 return (Nkind (Parent (Comp)) = N_Assignment_Statement
7121 and then Comp = Name (Parent (Comp)))
7122 or else (Present (Parent (Comp))
7123 and then Nkind (Parent (Comp)) in N_Subexpr
7124 and then In_Left_Hand_Side (Parent (Comp)));
7125 end In_Left_Hand_Side;
7127 -- Start of processing for Expand_N_Selected_Component
7130 -- Insert explicit dereference if required
7132 if Is_Access_Type (Ptyp) then
7133 Insert_Explicit_Dereference (P);
7134 Analyze_And_Resolve (P, Designated_Type (Ptyp));
7136 if Ekind (Etype (P)) = E_Private_Subtype
7137 and then Is_For_Access_Subtype (Etype (P))
7139 Set_Etype (P, Base_Type (Etype (P)));
7145 -- Deal with discriminant check required
7147 if Do_Discriminant_Check (N) then
7149 -- Present the discriminant checking function to the backend, so that
7150 -- it can inline the call to the function.
7153 (Discriminant_Checking_Func
7154 (Original_Record_Component (Entity (Selector_Name (N)))));
7156 -- Now reset the flag and generate the call
7158 Set_Do_Discriminant_Check (N, False);
7159 Generate_Discriminant_Check (N);
7162 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
7163 -- function, then additional actuals must be passed.
7165 if Ada_Version >= Ada_05
7166 and then Is_Build_In_Place_Function_Call (P)
7168 Make_Build_In_Place_Call_In_Anonymous_Context (P);
7171 -- Gigi cannot handle unchecked conversions that are the prefix of a
7172 -- selected component with discriminants. This must be checked during
7173 -- expansion, because during analysis the type of the selector is not
7174 -- known at the point the prefix is analyzed. If the conversion is the
7175 -- target of an assignment, then we cannot force the evaluation.
7177 if Nkind (Prefix (N)) = N_Unchecked_Type_Conversion
7178 and then Has_Discriminants (Etype (N))
7179 and then not In_Left_Hand_Side (N)
7181 Force_Evaluation (Prefix (N));
7184 -- Remaining processing applies only if selector is a discriminant
7186 if Ekind (Entity (Selector_Name (N))) = E_Discriminant then
7188 -- If the selector is a discriminant of a constrained record type,
7189 -- we may be able to rewrite the expression with the actual value
7190 -- of the discriminant, a useful optimization in some cases.
7192 if Is_Record_Type (Ptyp)
7193 and then Has_Discriminants (Ptyp)
7194 and then Is_Constrained (Ptyp)
7196 -- Do this optimization for discrete types only, and not for
7197 -- access types (access discriminants get us into trouble!)
7199 if not Is_Discrete_Type (Etype (N)) then
7202 -- Don't do this on the left hand of an assignment statement.
7203 -- Normally one would think that references like this would
7204 -- not occur, but they do in generated code, and mean that
7205 -- we really do want to assign the discriminant!
7207 elsif Nkind (Par) = N_Assignment_Statement
7208 and then Name (Par) = N
7212 -- Don't do this optimization for the prefix of an attribute or
7213 -- the operand of an object renaming declaration since these are
7214 -- contexts where we do not want the value anyway.
7216 elsif (Nkind (Par) = N_Attribute_Reference
7217 and then Prefix (Par) = N)
7218 or else Is_Renamed_Object (N)
7222 -- Don't do this optimization if we are within the code for a
7223 -- discriminant check, since the whole point of such a check may
7224 -- be to verify the condition on which the code below depends!
7226 elsif Is_In_Discriminant_Check (N) then
7229 -- Green light to see if we can do the optimization. There is
7230 -- still one condition that inhibits the optimization below but
7231 -- now is the time to check the particular discriminant.
7234 -- Loop through discriminants to find the matching discriminant
7235 -- constraint to see if we can copy it.
7237 Disc := First_Discriminant (Ptyp);
7238 Dcon := First_Elmt (Discriminant_Constraint (Ptyp));
7239 Discr_Loop : while Present (Dcon) loop
7241 -- Check if this is the matching discriminant
7243 if Disc = Entity (Selector_Name (N)) then
7245 -- Here we have the matching discriminant. Check for
7246 -- the case of a discriminant of a component that is
7247 -- constrained by an outer discriminant, which cannot
7248 -- be optimized away.
7251 Denotes_Discriminant
7252 (Node (Dcon), Check_Concurrent => True)
7256 -- In the context of a case statement, the expression may
7257 -- have the base type of the discriminant, and we need to
7258 -- preserve the constraint to avoid spurious errors on
7261 elsif Nkind (Parent (N)) = N_Case_Statement
7262 and then Etype (Node (Dcon)) /= Etype (Disc)
7265 Make_Qualified_Expression (Loc,
7267 New_Occurrence_Of (Etype (Disc), Loc),
7269 New_Copy_Tree (Node (Dcon))));
7270 Analyze_And_Resolve (N, Etype (Disc));
7272 -- In case that comes out as a static expression,
7273 -- reset it (a selected component is never static).
7275 Set_Is_Static_Expression (N, False);
7278 -- Otherwise we can just copy the constraint, but the
7279 -- result is certainly not static! In some cases the
7280 -- discriminant constraint has been analyzed in the
7281 -- context of the original subtype indication, but for
7282 -- itypes the constraint might not have been analyzed
7283 -- yet, and this must be done now.
7286 Rewrite (N, New_Copy_Tree (Node (Dcon)));
7287 Analyze_And_Resolve (N);
7288 Set_Is_Static_Expression (N, False);
7294 Next_Discriminant (Disc);
7295 end loop Discr_Loop;
7297 -- Note: the above loop should always find a matching
7298 -- discriminant, but if it does not, we just missed an
7299 -- optimization due to some glitch (perhaps a previous error),
7305 -- The only remaining processing is in the case of a discriminant of
7306 -- a concurrent object, where we rewrite the prefix to denote the
7307 -- corresponding record type. If the type is derived and has renamed
7308 -- discriminants, use corresponding discriminant, which is the one
7309 -- that appears in the corresponding record.
7311 if not Is_Concurrent_Type (Ptyp) then
7315 Disc := Entity (Selector_Name (N));
7317 if Is_Derived_Type (Ptyp)
7318 and then Present (Corresponding_Discriminant (Disc))
7320 Disc := Corresponding_Discriminant (Disc);
7324 Make_Selected_Component (Loc,
7326 Unchecked_Convert_To (Corresponding_Record_Type (Ptyp),
7328 Selector_Name => Make_Identifier (Loc, Chars (Disc)));
7333 end Expand_N_Selected_Component;
7335 --------------------
7336 -- Expand_N_Slice --
7337 --------------------
7339 procedure Expand_N_Slice (N : Node_Id) is
7340 Loc : constant Source_Ptr := Sloc (N);
7341 Typ : constant Entity_Id := Etype (N);
7342 Pfx : constant Node_Id := Prefix (N);
7343 Ptp : Entity_Id := Etype (Pfx);
7345 function Is_Procedure_Actual (N : Node_Id) return Boolean;
7346 -- Check whether the argument is an actual for a procedure call, in
7347 -- which case the expansion of a bit-packed slice is deferred until the
7348 -- call itself is expanded. The reason this is required is that we might
7349 -- have an IN OUT or OUT parameter, and the copy out is essential, and
7350 -- that copy out would be missed if we created a temporary here in
7351 -- Expand_N_Slice. Note that we don't bother to test specifically for an
7352 -- IN OUT or OUT mode parameter, since it is a bit tricky to do, and it
7353 -- is harmless to defer expansion in the IN case, since the call
7354 -- processing will still generate the appropriate copy in operation,
7355 -- which will take care of the slice.
7357 procedure Make_Temporary;
7358 -- Create a named variable for the value of the slice, in cases where
7359 -- the back-end cannot handle it properly, e.g. when packed types or
7360 -- unaligned slices are involved.
7362 -------------------------
7363 -- Is_Procedure_Actual --
7364 -------------------------
7366 function Is_Procedure_Actual (N : Node_Id) return Boolean is
7367 Par : Node_Id := Parent (N);
7371 -- If our parent is a procedure call we can return
7373 if Nkind (Par) = N_Procedure_Call_Statement then
7376 -- If our parent is a type conversion, keep climbing the tree,
7377 -- since a type conversion can be a procedure actual. Also keep
7378 -- climbing if parameter association or a qualified expression,
7379 -- since these are additional cases that do can appear on
7380 -- procedure actuals.
7382 elsif Nkind_In (Par, N_Type_Conversion,
7383 N_Parameter_Association,
7384 N_Qualified_Expression)
7386 Par := Parent (Par);
7388 -- Any other case is not what we are looking for
7394 end Is_Procedure_Actual;
7396 --------------------
7397 -- Make_Temporary --
7398 --------------------
7400 procedure Make_Temporary is
7402 Ent : constant Entity_Id :=
7403 Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
7406 Make_Object_Declaration (Loc,
7407 Defining_Identifier => Ent,
7408 Object_Definition => New_Occurrence_Of (Typ, Loc));
7410 Set_No_Initialization (Decl);
7412 Insert_Actions (N, New_List (
7414 Make_Assignment_Statement (Loc,
7415 Name => New_Occurrence_Of (Ent, Loc),
7416 Expression => Relocate_Node (N))));
7418 Rewrite (N, New_Occurrence_Of (Ent, Loc));
7419 Analyze_And_Resolve (N, Typ);
7422 -- Start of processing for Expand_N_Slice
7425 -- Special handling for access types
7427 if Is_Access_Type (Ptp) then
7429 Ptp := Designated_Type (Ptp);
7432 Make_Explicit_Dereference (Sloc (N),
7433 Prefix => Relocate_Node (Pfx)));
7435 Analyze_And_Resolve (Pfx, Ptp);
7438 -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place
7439 -- function, then additional actuals must be passed.
7441 if Ada_Version >= Ada_05
7442 and then Is_Build_In_Place_Function_Call (Pfx)
7444 Make_Build_In_Place_Call_In_Anonymous_Context (Pfx);
7447 -- The remaining case to be handled is packed slices. We can leave
7448 -- packed slices as they are in the following situations:
7450 -- 1. Right or left side of an assignment (we can handle this
7451 -- situation correctly in the assignment statement expansion).
7453 -- 2. Prefix of indexed component (the slide is optimized away in this
7454 -- case, see the start of Expand_N_Slice.)
7456 -- 3. Object renaming declaration, since we want the name of the
7457 -- slice, not the value.
7459 -- 4. Argument to procedure call, since copy-in/copy-out handling may
7460 -- be required, and this is handled in the expansion of call
7463 -- 5. Prefix of an address attribute (this is an error which is caught
7464 -- elsewhere, and the expansion would interfere with generating the
7467 if not Is_Packed (Typ) then
7469 -- Apply transformation for actuals of a function call, where
7470 -- Expand_Actuals is not used.
7472 if Nkind (Parent (N)) = N_Function_Call
7473 and then Is_Possibly_Unaligned_Slice (N)
7478 elsif Nkind (Parent (N)) = N_Assignment_Statement
7479 or else (Nkind (Parent (Parent (N))) = N_Assignment_Statement
7480 and then Parent (N) = Name (Parent (Parent (N))))
7484 elsif Nkind (Parent (N)) = N_Indexed_Component
7485 or else Is_Renamed_Object (N)
7486 or else Is_Procedure_Actual (N)
7490 elsif Nkind (Parent (N)) = N_Attribute_Reference
7491 and then Attribute_Name (Parent (N)) = Name_Address
7500 ------------------------------
7501 -- Expand_N_Type_Conversion --
7502 ------------------------------
7504 procedure Expand_N_Type_Conversion (N : Node_Id) is
7505 Loc : constant Source_Ptr := Sloc (N);
7506 Operand : constant Node_Id := Expression (N);
7507 Target_Type : constant Entity_Id := Etype (N);
7508 Operand_Type : Entity_Id := Etype (Operand);
7510 procedure Handle_Changed_Representation;
7511 -- This is called in the case of record and array type conversions to
7512 -- see if there is a change of representation to be handled. Change of
7513 -- representation is actually handled at the assignment statement level,
7514 -- and what this procedure does is rewrite node N conversion as an
7515 -- assignment to temporary. If there is no change of representation,
7516 -- then the conversion node is unchanged.
7518 procedure Real_Range_Check;
7519 -- Handles generation of range check for real target value
7521 -----------------------------------
7522 -- Handle_Changed_Representation --
7523 -----------------------------------
7525 procedure Handle_Changed_Representation is
7534 -- Nothing else to do if no change of representation
7536 if Same_Representation (Operand_Type, Target_Type) then
7539 -- The real change of representation work is done by the assignment
7540 -- statement processing. So if this type conversion is appearing as
7541 -- the expression of an assignment statement, nothing needs to be
7542 -- done to the conversion.
7544 elsif Nkind (Parent (N)) = N_Assignment_Statement then
7547 -- Otherwise we need to generate a temporary variable, and do the
7548 -- change of representation assignment into that temporary variable.
7549 -- The conversion is then replaced by a reference to this variable.
7554 -- If type is unconstrained we have to add a constraint, copied
7555 -- from the actual value of the left hand side.
7557 if not Is_Constrained (Target_Type) then
7558 if Has_Discriminants (Operand_Type) then
7559 Disc := First_Discriminant (Operand_Type);
7561 if Disc /= First_Stored_Discriminant (Operand_Type) then
7562 Disc := First_Stored_Discriminant (Operand_Type);
7566 while Present (Disc) loop
7568 Make_Selected_Component (Loc,
7569 Prefix => Duplicate_Subexpr_Move_Checks (Operand),
7571 Make_Identifier (Loc, Chars (Disc))));
7572 Next_Discriminant (Disc);
7575 elsif Is_Array_Type (Operand_Type) then
7576 N_Ix := First_Index (Target_Type);
7579 for J in 1 .. Number_Dimensions (Operand_Type) loop
7581 -- We convert the bounds explicitly. We use an unchecked
7582 -- conversion because bounds checks are done elsewhere.
7587 Unchecked_Convert_To (Etype (N_Ix),
7588 Make_Attribute_Reference (Loc,
7590 Duplicate_Subexpr_No_Checks
7591 (Operand, Name_Req => True),
7592 Attribute_Name => Name_First,
7593 Expressions => New_List (
7594 Make_Integer_Literal (Loc, J)))),
7597 Unchecked_Convert_To (Etype (N_Ix),
7598 Make_Attribute_Reference (Loc,
7600 Duplicate_Subexpr_No_Checks
7601 (Operand, Name_Req => True),
7602 Attribute_Name => Name_Last,
7603 Expressions => New_List (
7604 Make_Integer_Literal (Loc, J))))));
7611 Odef := New_Occurrence_Of (Target_Type, Loc);
7613 if Present (Cons) then
7615 Make_Subtype_Indication (Loc,
7616 Subtype_Mark => Odef,
7618 Make_Index_Or_Discriminant_Constraint (Loc,
7619 Constraints => Cons));
7622 Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('C'));
7624 Make_Object_Declaration (Loc,
7625 Defining_Identifier => Temp,
7626 Object_Definition => Odef);
7628 Set_No_Initialization (Decl, True);
7630 -- Insert required actions. It is essential to suppress checks
7631 -- since we have suppressed default initialization, which means
7632 -- that the variable we create may have no discriminants.
7637 Make_Assignment_Statement (Loc,
7638 Name => New_Occurrence_Of (Temp, Loc),
7639 Expression => Relocate_Node (N))),
7640 Suppress => All_Checks);
7642 Rewrite (N, New_Occurrence_Of (Temp, Loc));
7645 end Handle_Changed_Representation;
7647 ----------------------
7648 -- Real_Range_Check --
7649 ----------------------
7651 -- Case of conversions to floating-point or fixed-point. If range checks
7652 -- are enabled and the target type has a range constraint, we convert:
7658 -- Tnn : typ'Base := typ'Base (x);
7659 -- [constraint_error when Tnn < typ'First or else Tnn > typ'Last]
7662 -- This is necessary when there is a conversion of integer to float or
7663 -- to fixed-point to ensure that the correct checks are made. It is not
7664 -- necessary for float to float where it is enough to simply set the
7665 -- Do_Range_Check flag.
7667 procedure Real_Range_Check is
7668 Btyp : constant Entity_Id := Base_Type (Target_Type);
7669 Lo : constant Node_Id := Type_Low_Bound (Target_Type);
7670 Hi : constant Node_Id := Type_High_Bound (Target_Type);
7671 Xtyp : constant Entity_Id := Etype (Operand);
7676 -- Nothing to do if conversion was rewritten
7678 if Nkind (N) /= N_Type_Conversion then
7682 -- Nothing to do if range checks suppressed, or target has the same
7683 -- range as the base type (or is the base type).
7685 if Range_Checks_Suppressed (Target_Type)
7686 or else (Lo = Type_Low_Bound (Btyp)
7688 Hi = Type_High_Bound (Btyp))
7693 -- Nothing to do if expression is an entity on which checks have been
7696 if Is_Entity_Name (Operand)
7697 and then Range_Checks_Suppressed (Entity (Operand))
7702 -- Nothing to do if bounds are all static and we can tell that the
7703 -- expression is within the bounds of the target. Note that if the
7704 -- operand is of an unconstrained floating-point type, then we do
7705 -- not trust it to be in range (might be infinite)
7708 S_Lo : constant Node_Id := Type_Low_Bound (Xtyp);
7709 S_Hi : constant Node_Id := Type_High_Bound (Xtyp);
7712 if (not Is_Floating_Point_Type (Xtyp)
7713 or else Is_Constrained (Xtyp))
7714 and then Compile_Time_Known_Value (S_Lo)
7715 and then Compile_Time_Known_Value (S_Hi)
7716 and then Compile_Time_Known_Value (Hi)
7717 and then Compile_Time_Known_Value (Lo)
7720 D_Lov : constant Ureal := Expr_Value_R (Lo);
7721 D_Hiv : constant Ureal := Expr_Value_R (Hi);
7726 if Is_Real_Type (Xtyp) then
7727 S_Lov := Expr_Value_R (S_Lo);
7728 S_Hiv := Expr_Value_R (S_Hi);
7730 S_Lov := UR_From_Uint (Expr_Value (S_Lo));
7731 S_Hiv := UR_From_Uint (Expr_Value (S_Hi));
7735 and then S_Lov >= D_Lov
7736 and then S_Hiv <= D_Hiv
7738 Set_Do_Range_Check (Operand, False);
7745 -- For float to float conversions, we are done
7747 if Is_Floating_Point_Type (Xtyp)
7749 Is_Floating_Point_Type (Btyp)
7754 -- Otherwise rewrite the conversion as described above
7756 Conv := Relocate_Node (N);
7758 (Subtype_Mark (Conv), New_Occurrence_Of (Btyp, Loc));
7759 Set_Etype (Conv, Btyp);
7761 -- Enable overflow except for case of integer to float conversions,
7762 -- where it is never required, since we can never have overflow in
7765 if not Is_Integer_Type (Etype (Operand)) then
7766 Enable_Overflow_Check (Conv);
7770 Make_Defining_Identifier (Loc,
7771 Chars => New_Internal_Name ('T'));
7773 Insert_Actions (N, New_List (
7774 Make_Object_Declaration (Loc,
7775 Defining_Identifier => Tnn,
7776 Object_Definition => New_Occurrence_Of (Btyp, Loc),
7777 Expression => Conv),
7779 Make_Raise_Constraint_Error (Loc,
7784 Left_Opnd => New_Occurrence_Of (Tnn, Loc),
7786 Make_Attribute_Reference (Loc,
7787 Attribute_Name => Name_First,
7789 New_Occurrence_Of (Target_Type, Loc))),
7793 Left_Opnd => New_Occurrence_Of (Tnn, Loc),
7795 Make_Attribute_Reference (Loc,
7796 Attribute_Name => Name_Last,
7798 New_Occurrence_Of (Target_Type, Loc)))),
7799 Reason => CE_Range_Check_Failed)));
7801 Rewrite (N, New_Occurrence_Of (Tnn, Loc));
7802 Analyze_And_Resolve (N, Btyp);
7803 end Real_Range_Check;
7805 -- Start of processing for Expand_N_Type_Conversion
7808 -- Nothing at all to do if conversion is to the identical type so remove
7809 -- the conversion completely, it is useless.
7811 if Operand_Type = Target_Type then
7812 Rewrite (N, Relocate_Node (Operand));
7816 -- Nothing to do if this is the second argument of read. This is a
7817 -- "backwards" conversion that will be handled by the specialized code
7818 -- in attribute processing.
7820 if Nkind (Parent (N)) = N_Attribute_Reference
7821 and then Attribute_Name (Parent (N)) = Name_Read
7822 and then Next (First (Expressions (Parent (N)))) = N
7827 -- Here if we may need to expand conversion
7829 -- Do validity check if validity checking operands
7831 if Validity_Checks_On
7832 and then Validity_Check_Operands
7834 Ensure_Valid (Operand);
7837 -- Special case of converting from non-standard boolean type
7839 if Is_Boolean_Type (Operand_Type)
7840 and then (Nonzero_Is_True (Operand_Type))
7842 Adjust_Condition (Operand);
7843 Set_Etype (Operand, Standard_Boolean);
7844 Operand_Type := Standard_Boolean;
7847 -- Case of converting to an access type
7849 if Is_Access_Type (Target_Type) then
7851 -- Apply an accessibility check when the conversion operand is an
7852 -- access parameter (or a renaming thereof), unless conversion was
7853 -- expanded from an Unchecked_ or Unrestricted_Access attribute.
7854 -- Note that other checks may still need to be applied below (such
7855 -- as tagged type checks).
7857 if Is_Entity_Name (Operand)
7859 (Is_Formal (Entity (Operand))
7861 (Present (Renamed_Object (Entity (Operand)))
7862 and then Is_Entity_Name (Renamed_Object (Entity (Operand)))
7864 (Entity (Renamed_Object (Entity (Operand))))))
7865 and then Ekind (Etype (Operand)) = E_Anonymous_Access_Type
7866 and then (Nkind (Original_Node (N)) /= N_Attribute_Reference
7867 or else Attribute_Name (Original_Node (N)) = Name_Access)
7869 Apply_Accessibility_Check
7870 (Operand, Target_Type, Insert_Node => Operand);
7872 -- If the level of the operand type is statically deeper than the
7873 -- level of the target type, then force Program_Error. Note that this
7874 -- can only occur for cases where the attribute is within the body of
7875 -- an instantiation (otherwise the conversion will already have been
7876 -- rejected as illegal). Note: warnings are issued by the analyzer
7877 -- for the instance cases.
7879 elsif In_Instance_Body
7880 and then Type_Access_Level (Operand_Type) >
7881 Type_Access_Level (Target_Type)
7884 Make_Raise_Program_Error (Sloc (N),
7885 Reason => PE_Accessibility_Check_Failed));
7886 Set_Etype (N, Target_Type);
7888 -- When the operand is a selected access discriminant the check needs
7889 -- to be made against the level of the object denoted by the prefix
7890 -- of the selected name. Force Program_Error for this case as well
7891 -- (this accessibility violation can only happen if within the body
7892 -- of an instantiation).
7894 elsif In_Instance_Body
7895 and then Ekind (Operand_Type) = E_Anonymous_Access_Type
7896 and then Nkind (Operand) = N_Selected_Component
7897 and then Object_Access_Level (Operand) >
7898 Type_Access_Level (Target_Type)
7901 Make_Raise_Program_Error (Sloc (N),
7902 Reason => PE_Accessibility_Check_Failed));
7903 Set_Etype (N, Target_Type);
7909 -- Case of conversions of tagged types and access to tagged types
7911 -- When needed, that is to say when the expression is class-wide, Add
7912 -- runtime a tag check for (strict) downward conversion by using the
7913 -- membership test, generating:
7915 -- [constraint_error when Operand not in Target_Type'Class]
7917 -- or in the access type case
7919 -- [constraint_error
7920 -- when Operand /= null
7921 -- and then Operand.all not in
7922 -- Designated_Type (Target_Type)'Class]
7924 if (Is_Access_Type (Target_Type)
7925 and then Is_Tagged_Type (Designated_Type (Target_Type)))
7926 or else Is_Tagged_Type (Target_Type)
7928 -- Do not do any expansion in the access type case if the parent is a
7929 -- renaming, since this is an error situation which will be caught by
7930 -- Sem_Ch8, and the expansion can interfere with this error check.
7932 if Is_Access_Type (Target_Type)
7933 and then Is_Renamed_Object (N)
7938 -- Otherwise, proceed with processing tagged conversion
7941 Actual_Op_Typ : Entity_Id;
7942 Actual_Targ_Typ : Entity_Id;
7943 Make_Conversion : Boolean := False;
7944 Root_Op_Typ : Entity_Id;
7946 procedure Make_Tag_Check (Targ_Typ : Entity_Id);
7947 -- Create a membership check to test whether Operand is a member
7948 -- of Targ_Typ. If the original Target_Type is an access, include
7949 -- a test for null value. The check is inserted at N.
7951 --------------------
7952 -- Make_Tag_Check --
7953 --------------------
7955 procedure Make_Tag_Check (Targ_Typ : Entity_Id) is
7960 -- [Constraint_Error
7961 -- when Operand /= null
7962 -- and then Operand.all not in Targ_Typ]
7964 if Is_Access_Type (Target_Type) then
7969 Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
7970 Right_Opnd => Make_Null (Loc)),
7975 Make_Explicit_Dereference (Loc,
7976 Prefix => Duplicate_Subexpr_No_Checks (Operand)),
7977 Right_Opnd => New_Reference_To (Targ_Typ, Loc)));
7980 -- [Constraint_Error when Operand not in Targ_Typ]
7985 Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
7986 Right_Opnd => New_Reference_To (Targ_Typ, Loc));
7990 Make_Raise_Constraint_Error (Loc,
7992 Reason => CE_Tag_Check_Failed));
7995 -- Start of processing
7998 if Is_Access_Type (Target_Type) then
8000 -- Handle entities from the limited view
8003 Available_View (Designated_Type (Operand_Type));
8005 Available_View (Designated_Type (Target_Type));
8007 Actual_Op_Typ := Operand_Type;
8008 Actual_Targ_Typ := Target_Type;
8011 Root_Op_Typ := Root_Type (Actual_Op_Typ);
8013 -- Ada 2005 (AI-251): Handle interface type conversion
8015 if Is_Interface (Actual_Op_Typ) then
8016 Expand_Interface_Conversion (N, Is_Static => False);
8020 if not Tag_Checks_Suppressed (Actual_Targ_Typ) then
8022 -- Create a runtime tag check for a downward class-wide type
8025 if Is_Class_Wide_Type (Actual_Op_Typ)
8026 and then Actual_Op_Typ /= Actual_Targ_Typ
8027 and then Root_Op_Typ /= Actual_Targ_Typ
8028 and then Is_Ancestor (Root_Op_Typ, Actual_Targ_Typ)
8030 Make_Tag_Check (Class_Wide_Type (Actual_Targ_Typ));
8031 Make_Conversion := True;
8034 -- AI05-0073: If the result subtype of the function is defined
8035 -- by an access_definition designating a specific tagged type
8036 -- T, a check is made that the result value is null or the tag
8037 -- of the object designated by the result value identifies T.
8038 -- Constraint_Error is raised if this check fails.
8040 if Nkind (Parent (N)) = Sinfo.N_Return_Statement then
8043 Func_Typ : Entity_Id;
8046 -- Climb scope stack looking for the enclosing function
8048 Func := Current_Scope;
8049 while Present (Func)
8050 and then Ekind (Func) /= E_Function
8052 Func := Scope (Func);
8055 -- The function's return subtype must be defined using
8056 -- an access definition.
8058 if Nkind (Result_Definition (Parent (Func))) =
8061 Func_Typ := Directly_Designated_Type (Etype (Func));
8063 -- The return subtype denotes a specific tagged type,
8064 -- in other words, a non class-wide type.
8066 if Is_Tagged_Type (Func_Typ)
8067 and then not Is_Class_Wide_Type (Func_Typ)
8069 Make_Tag_Check (Actual_Targ_Typ);
8070 Make_Conversion := True;
8076 -- We have generated a tag check for either a class-wide type
8077 -- conversion or for AI05-0073.
8079 if Make_Conversion then
8084 Make_Unchecked_Type_Conversion (Loc,
8085 Subtype_Mark => New_Occurrence_Of (Target_Type, Loc),
8086 Expression => Relocate_Node (Expression (N)));
8088 Analyze_And_Resolve (N, Target_Type);
8094 -- Case of other access type conversions
8096 elsif Is_Access_Type (Target_Type) then
8097 Apply_Constraint_Check (Operand, Target_Type);
8099 -- Case of conversions from a fixed-point type
8101 -- These conversions require special expansion and processing, found in
8102 -- the Exp_Fixd package. We ignore cases where Conversion_OK is set,
8103 -- since from a semantic point of view, these are simple integer
8104 -- conversions, which do not need further processing.
8106 elsif Is_Fixed_Point_Type (Operand_Type)
8107 and then not Conversion_OK (N)
8109 -- We should never see universal fixed at this case, since the
8110 -- expansion of the constituent divide or multiply should have
8111 -- eliminated the explicit mention of universal fixed.
8113 pragma Assert (Operand_Type /= Universal_Fixed);
8115 -- Check for special case of the conversion to universal real that
8116 -- occurs as a result of the use of a round attribute. In this case,
8117 -- the real type for the conversion is taken from the target type of
8118 -- the Round attribute and the result must be marked as rounded.
8120 if Target_Type = Universal_Real
8121 and then Nkind (Parent (N)) = N_Attribute_Reference
8122 and then Attribute_Name (Parent (N)) = Name_Round
8124 Set_Rounded_Result (N);
8125 Set_Etype (N, Etype (Parent (N)));
8128 -- Otherwise do correct fixed-conversion, but skip these if the
8129 -- Conversion_OK flag is set, because from a semantic point of
8130 -- view these are simple integer conversions needing no further
8131 -- processing (the backend will simply treat them as integers)
8133 if not Conversion_OK (N) then
8134 if Is_Fixed_Point_Type (Etype (N)) then
8135 Expand_Convert_Fixed_To_Fixed (N);
8138 elsif Is_Integer_Type (Etype (N)) then
8139 Expand_Convert_Fixed_To_Integer (N);
8142 pragma Assert (Is_Floating_Point_Type (Etype (N)));
8143 Expand_Convert_Fixed_To_Float (N);
8148 -- Case of conversions to a fixed-point type
8150 -- These conversions require special expansion and processing, found in
8151 -- the Exp_Fixd package. Again, ignore cases where Conversion_OK is set,
8152 -- since from a semantic point of view, these are simple integer
8153 -- conversions, which do not need further processing.
8155 elsif Is_Fixed_Point_Type (Target_Type)
8156 and then not Conversion_OK (N)
8158 if Is_Integer_Type (Operand_Type) then
8159 Expand_Convert_Integer_To_Fixed (N);
8162 pragma Assert (Is_Floating_Point_Type (Operand_Type));
8163 Expand_Convert_Float_To_Fixed (N);
8167 -- Case of float-to-integer conversions
8169 -- We also handle float-to-fixed conversions with Conversion_OK set
8170 -- since semantically the fixed-point target is treated as though it
8171 -- were an integer in such cases.
8173 elsif Is_Floating_Point_Type (Operand_Type)
8175 (Is_Integer_Type (Target_Type)
8177 (Is_Fixed_Point_Type (Target_Type) and then Conversion_OK (N)))
8179 -- One more check here, gcc is still not able to do conversions of
8180 -- this type with proper overflow checking, and so gigi is doing an
8181 -- approximation of what is required by doing floating-point compares
8182 -- with the end-point. But that can lose precision in some cases, and
8183 -- give a wrong result. Converting the operand to Universal_Real is
8184 -- helpful, but still does not catch all cases with 64-bit integers
8185 -- on targets with only 64-bit floats
8187 -- The above comment seems obsoleted by Apply_Float_Conversion_Check
8188 -- Can this code be removed ???
8190 if Do_Range_Check (Operand) then
8192 Make_Type_Conversion (Loc,
8194 New_Occurrence_Of (Universal_Real, Loc),
8196 Relocate_Node (Operand)));
8198 Set_Etype (Operand, Universal_Real);
8199 Enable_Range_Check (Operand);
8200 Set_Do_Range_Check (Expression (Operand), False);
8203 -- Case of array conversions
8205 -- Expansion of array conversions, add required length/range checks but
8206 -- only do this if there is no change of representation. For handling of
8207 -- this case, see Handle_Changed_Representation.
8209 elsif Is_Array_Type (Target_Type) then
8211 if Is_Constrained (Target_Type) then
8212 Apply_Length_Check (Operand, Target_Type);
8214 Apply_Range_Check (Operand, Target_Type);
8217 Handle_Changed_Representation;
8219 -- Case of conversions of discriminated types
8221 -- Add required discriminant checks if target is constrained. Again this
8222 -- change is skipped if we have a change of representation.
8224 elsif Has_Discriminants (Target_Type)
8225 and then Is_Constrained (Target_Type)
8227 Apply_Discriminant_Check (Operand, Target_Type);
8228 Handle_Changed_Representation;
8230 -- Case of all other record conversions. The only processing required
8231 -- is to check for a change of representation requiring the special
8232 -- assignment processing.
8234 elsif Is_Record_Type (Target_Type) then
8236 -- Ada 2005 (AI-216): Program_Error is raised when converting from
8237 -- a derived Unchecked_Union type to an unconstrained type that is
8238 -- not Unchecked_Union if the operand lacks inferable discriminants.
8240 if Is_Derived_Type (Operand_Type)
8241 and then Is_Unchecked_Union (Base_Type (Operand_Type))
8242 and then not Is_Constrained (Target_Type)
8243 and then not Is_Unchecked_Union (Base_Type (Target_Type))
8244 and then not Has_Inferable_Discriminants (Operand)
8246 -- To prevent Gigi from generating illegal code, we generate a
8247 -- Program_Error node, but we give it the target type of the
8251 PE : constant Node_Id := Make_Raise_Program_Error (Loc,
8252 Reason => PE_Unchecked_Union_Restriction);
8255 Set_Etype (PE, Target_Type);
8260 Handle_Changed_Representation;
8263 -- Case of conversions of enumeration types
8265 elsif Is_Enumeration_Type (Target_Type) then
8267 -- Special processing is required if there is a change of
8268 -- representation (from enumeration representation clauses)
8270 if not Same_Representation (Target_Type, Operand_Type) then
8272 -- Convert: x(y) to x'val (ytyp'val (y))
8275 Make_Attribute_Reference (Loc,
8276 Prefix => New_Occurrence_Of (Target_Type, Loc),
8277 Attribute_Name => Name_Val,
8278 Expressions => New_List (
8279 Make_Attribute_Reference (Loc,
8280 Prefix => New_Occurrence_Of (Operand_Type, Loc),
8281 Attribute_Name => Name_Pos,
8282 Expressions => New_List (Operand)))));
8284 Analyze_And_Resolve (N, Target_Type);
8287 -- Case of conversions to floating-point
8289 elsif Is_Floating_Point_Type (Target_Type) then
8293 -- At this stage, either the conversion node has been transformed into
8294 -- some other equivalent expression, or left as a conversion that can
8295 -- be handled by Gigi. The conversions that Gigi can handle are the
8298 -- Conversions with no change of representation or type
8300 -- Numeric conversions involving integer, floating- and fixed-point
8301 -- values. Fixed-point values are allowed only if Conversion_OK is
8302 -- set, i.e. if the fixed-point values are to be treated as integers.
8304 -- No other conversions should be passed to Gigi
8306 -- Check: are these rules stated in sinfo??? if so, why restate here???
8308 -- The only remaining step is to generate a range check if we still have
8309 -- a type conversion at this stage and Do_Range_Check is set. For now we
8310 -- do this only for conversions of discrete types.
8312 if Nkind (N) = N_Type_Conversion
8313 and then Is_Discrete_Type (Etype (N))
8316 Expr : constant Node_Id := Expression (N);
8321 if Do_Range_Check (Expr)
8322 and then Is_Discrete_Type (Etype (Expr))
8324 Set_Do_Range_Check (Expr, False);
8326 -- Before we do a range check, we have to deal with treating a
8327 -- fixed-point operand as an integer. The way we do this is
8328 -- simply to do an unchecked conversion to an appropriate
8329 -- integer type large enough to hold the result.
8331 -- This code is not active yet, because we are only dealing
8332 -- with discrete types so far ???
8334 if Nkind (Expr) in N_Has_Treat_Fixed_As_Integer
8335 and then Treat_Fixed_As_Integer (Expr)
8337 Ftyp := Base_Type (Etype (Expr));
8339 if Esize (Ftyp) >= Esize (Standard_Integer) then
8340 Ityp := Standard_Long_Long_Integer;
8342 Ityp := Standard_Integer;
8345 Rewrite (Expr, Unchecked_Convert_To (Ityp, Expr));
8348 -- Reset overflow flag, since the range check will include
8349 -- dealing with possible overflow, and generate the check If
8350 -- Address is either a source type or target type, suppress
8351 -- range check to avoid typing anomalies when it is a visible
8354 Set_Do_Overflow_Check (N, False);
8355 if not Is_Descendent_Of_Address (Etype (Expr))
8356 and then not Is_Descendent_Of_Address (Target_Type)
8358 Generate_Range_Check
8359 (Expr, Target_Type, CE_Range_Check_Failed);
8365 -- Final step, if the result is a type conversion involving Vax_Float
8366 -- types, then it is subject for further special processing.
8368 if Nkind (N) = N_Type_Conversion
8369 and then (Vax_Float (Operand_Type) or else Vax_Float (Target_Type))
8371 Expand_Vax_Conversion (N);
8374 end Expand_N_Type_Conversion;
8376 -----------------------------------
8377 -- Expand_N_Unchecked_Expression --
8378 -----------------------------------
8380 -- Remove the unchecked expression node from the tree. It's job was simply
8381 -- to make sure that its constituent expression was handled with checks
8382 -- off, and now that that is done, we can remove it from the tree, and
8383 -- indeed must, since gigi does not expect to see these nodes.
8385 procedure Expand_N_Unchecked_Expression (N : Node_Id) is
8386 Exp : constant Node_Id := Expression (N);
8389 Set_Assignment_OK (Exp, Assignment_OK (N) or Assignment_OK (Exp));
8391 end Expand_N_Unchecked_Expression;
8393 ----------------------------------------
8394 -- Expand_N_Unchecked_Type_Conversion --
8395 ----------------------------------------
8397 -- If this cannot be handled by Gigi and we haven't already made a
8398 -- temporary for it, do it now.
8400 procedure Expand_N_Unchecked_Type_Conversion (N : Node_Id) is
8401 Target_Type : constant Entity_Id := Etype (N);
8402 Operand : constant Node_Id := Expression (N);
8403 Operand_Type : constant Entity_Id := Etype (Operand);
8406 -- If we have a conversion of a compile time known value to a target
8407 -- type and the value is in range of the target type, then we can simply
8408 -- replace the construct by an integer literal of the correct type. We
8409 -- only apply this to integer types being converted. Possibly it may
8410 -- apply in other cases, but it is too much trouble to worry about.
8412 -- Note that we do not do this transformation if the Kill_Range_Check
8413 -- flag is set, since then the value may be outside the expected range.
8414 -- This happens in the Normalize_Scalars case.
8416 -- We also skip this if either the target or operand type is biased
8417 -- because in this case, the unchecked conversion is supposed to
8418 -- preserve the bit pattern, not the integer value.
8420 if Is_Integer_Type (Target_Type)
8421 and then not Has_Biased_Representation (Target_Type)
8422 and then Is_Integer_Type (Operand_Type)
8423 and then not Has_Biased_Representation (Operand_Type)
8424 and then Compile_Time_Known_Value (Operand)
8425 and then not Kill_Range_Check (N)
8428 Val : constant Uint := Expr_Value (Operand);
8431 if Compile_Time_Known_Value (Type_Low_Bound (Target_Type))
8433 Compile_Time_Known_Value (Type_High_Bound (Target_Type))
8435 Val >= Expr_Value (Type_Low_Bound (Target_Type))
8437 Val <= Expr_Value (Type_High_Bound (Target_Type))
8439 Rewrite (N, Make_Integer_Literal (Sloc (N), Val));
8441 -- If Address is the target type, just set the type to avoid a
8442 -- spurious type error on the literal when Address is a visible
8445 if Is_Descendent_Of_Address (Target_Type) then
8446 Set_Etype (N, Target_Type);
8448 Analyze_And_Resolve (N, Target_Type);
8456 -- Nothing to do if conversion is safe
8458 if Safe_Unchecked_Type_Conversion (N) then
8462 -- Otherwise force evaluation unless Assignment_OK flag is set (this
8463 -- flag indicates ??? -- more comments needed here)
8465 if Assignment_OK (N) then
8468 Force_Evaluation (N);
8470 end Expand_N_Unchecked_Type_Conversion;
8472 ----------------------------
8473 -- Expand_Record_Equality --
8474 ----------------------------
8476 -- For non-variant records, Equality is expanded when needed into:
8478 -- and then Lhs.Discr1 = Rhs.Discr1
8480 -- and then Lhs.Discrn = Rhs.Discrn
8481 -- and then Lhs.Cmp1 = Rhs.Cmp1
8483 -- and then Lhs.Cmpn = Rhs.Cmpn
8485 -- The expression is folded by the back-end for adjacent fields. This
8486 -- function is called for tagged record in only one occasion: for imple-
8487 -- menting predefined primitive equality (see Predefined_Primitives_Bodies)
8488 -- otherwise the primitive "=" is used directly.
8490 function Expand_Record_Equality
8495 Bodies : List_Id) return Node_Id
8497 Loc : constant Source_Ptr := Sloc (Nod);
8502 First_Time : Boolean := True;
8504 function Suitable_Element (C : Entity_Id) return Entity_Id;
8505 -- Return the first field to compare beginning with C, skipping the
8506 -- inherited components.
8508 ----------------------
8509 -- Suitable_Element --
8510 ----------------------
8512 function Suitable_Element (C : Entity_Id) return Entity_Id is
8517 elsif Ekind (C) /= E_Discriminant
8518 and then Ekind (C) /= E_Component
8520 return Suitable_Element (Next_Entity (C));
8522 elsif Is_Tagged_Type (Typ)
8523 and then C /= Original_Record_Component (C)
8525 return Suitable_Element (Next_Entity (C));
8527 elsif Chars (C) = Name_uController
8528 or else Chars (C) = Name_uTag
8530 return Suitable_Element (Next_Entity (C));
8532 elsif Is_Interface (Etype (C)) then
8533 return Suitable_Element (Next_Entity (C));
8538 end Suitable_Element;
8540 -- Start of processing for Expand_Record_Equality
8543 -- Generates the following code: (assuming that Typ has one Discr and
8544 -- component C2 is also a record)
8547 -- and then Lhs.Discr1 = Rhs.Discr1
8548 -- and then Lhs.C1 = Rhs.C1
8549 -- and then Lhs.C2.C1=Rhs.C2.C1 and then ... Lhs.C2.Cn=Rhs.C2.Cn
8551 -- and then Lhs.Cmpn = Rhs.Cmpn
8553 Result := New_Reference_To (Standard_True, Loc);
8554 C := Suitable_Element (First_Entity (Typ));
8556 while Present (C) loop
8564 First_Time := False;
8568 New_Lhs := New_Copy_Tree (Lhs);
8569 New_Rhs := New_Copy_Tree (Rhs);
8573 Expand_Composite_Equality (Nod, Etype (C),
8575 Make_Selected_Component (Loc,
8577 Selector_Name => New_Reference_To (C, Loc)),
8579 Make_Selected_Component (Loc,
8581 Selector_Name => New_Reference_To (C, Loc)),
8584 -- If some (sub)component is an unchecked_union, the whole
8585 -- operation will raise program error.
8587 if Nkind (Check) = N_Raise_Program_Error then
8589 Set_Etype (Result, Standard_Boolean);
8594 Left_Opnd => Result,
8595 Right_Opnd => Check);
8599 C := Suitable_Element (Next_Entity (C));
8603 end Expand_Record_Equality;
8605 -------------------------------------
8606 -- Fixup_Universal_Fixed_Operation --
8607 -------------------------------------
8609 procedure Fixup_Universal_Fixed_Operation (N : Node_Id) is
8610 Conv : constant Node_Id := Parent (N);
8613 -- We must have a type conversion immediately above us
8615 pragma Assert (Nkind (Conv) = N_Type_Conversion);
8617 -- Normally the type conversion gives our target type. The exception
8618 -- occurs in the case of the Round attribute, where the conversion
8619 -- will be to universal real, and our real type comes from the Round
8620 -- attribute (as well as an indication that we must round the result)
8622 if Nkind (Parent (Conv)) = N_Attribute_Reference
8623 and then Attribute_Name (Parent (Conv)) = Name_Round
8625 Set_Etype (N, Etype (Parent (Conv)));
8626 Set_Rounded_Result (N);
8628 -- Normal case where type comes from conversion above us
8631 Set_Etype (N, Etype (Conv));
8633 end Fixup_Universal_Fixed_Operation;
8635 ------------------------------
8636 -- Get_Allocator_Final_List --
8637 ------------------------------
8639 function Get_Allocator_Final_List
8642 PtrT : Entity_Id) return Entity_Id
8644 Loc : constant Source_Ptr := Sloc (N);
8646 Owner : Entity_Id := PtrT;
8647 -- The entity whose finalization list must be used to attach the
8648 -- allocated object.
8651 if Ekind (PtrT) = E_Anonymous_Access_Type then
8653 -- If the context is an access parameter, we need to create a
8654 -- non-anonymous access type in order to have a usable final list,
8655 -- because there is otherwise no pool to which the allocated object
8656 -- can belong. We create both the type and the finalization chain
8657 -- here, because freezing an internal type does not create such a
8658 -- chain. The Final_Chain that is thus created is shared by the
8659 -- access parameter. The access type is tested against the result
8660 -- type of the function to exclude allocators whose type is an
8661 -- anonymous access result type. We freeze the type at once to
8662 -- ensure that it is properly decorated for the back-end, even
8663 -- if the context and current scope is a loop.
8665 if Nkind (Associated_Node_For_Itype (PtrT))
8666 in N_Subprogram_Specification
8669 Etype (Defining_Unit_Name (Associated_Node_For_Itype (PtrT)))
8671 Owner := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
8673 Make_Full_Type_Declaration (Loc,
8674 Defining_Identifier => Owner,
8676 Make_Access_To_Object_Definition (Loc,
8677 Subtype_Indication =>
8678 New_Occurrence_Of (T, Loc))));
8680 Freeze_Before (N, Owner);
8681 Build_Final_List (N, Owner);
8682 Set_Associated_Final_Chain (PtrT, Associated_Final_Chain (Owner));
8684 -- Ada 2005 (AI-318-02): If the context is a return object
8685 -- declaration, then the anonymous return subtype is defined to have
8686 -- the same accessibility level as that of the function's result
8687 -- subtype, which means that we want the scope where the function is
8690 elsif Nkind (Associated_Node_For_Itype (PtrT)) = N_Object_Declaration
8691 and then Ekind (Scope (PtrT)) = E_Return_Statement
8693 Owner := Scope (Return_Applies_To (Scope (PtrT)));
8695 -- Case of an access discriminant, or (Ada 2005), of an anonymous
8696 -- access component or anonymous access function result: find the
8697 -- final list associated with the scope of the type. (In the
8698 -- anonymous access component kind, a list controller will have
8699 -- been allocated when freezing the record type, and PtrT has an
8700 -- Associated_Final_Chain attribute designating it.)
8702 elsif No (Associated_Final_Chain (PtrT)) then
8703 Owner := Scope (PtrT);
8707 return Find_Final_List (Owner);
8708 end Get_Allocator_Final_List;
8710 ---------------------------------
8711 -- Has_Inferable_Discriminants --
8712 ---------------------------------
8714 function Has_Inferable_Discriminants (N : Node_Id) return Boolean is
8716 function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean;
8717 -- Determines whether the left-most prefix of a selected component is a
8718 -- formal parameter in a subprogram. Assumes N is a selected component.
8720 --------------------------------
8721 -- Prefix_Is_Formal_Parameter --
8722 --------------------------------
8724 function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean is
8725 Sel_Comp : Node_Id := N;
8728 -- Move to the left-most prefix by climbing up the tree
8730 while Present (Parent (Sel_Comp))
8731 and then Nkind (Parent (Sel_Comp)) = N_Selected_Component
8733 Sel_Comp := Parent (Sel_Comp);
8736 return Ekind (Entity (Prefix (Sel_Comp))) in Formal_Kind;
8737 end Prefix_Is_Formal_Parameter;
8739 -- Start of processing for Has_Inferable_Discriminants
8742 -- For identifiers and indexed components, it is sufficient to have a
8743 -- constrained Unchecked_Union nominal subtype.
8745 if Nkind_In (N, N_Identifier, N_Indexed_Component) then
8746 return Is_Unchecked_Union (Base_Type (Etype (N)))
8748 Is_Constrained (Etype (N));
8750 -- For selected components, the subtype of the selector must be a
8751 -- constrained Unchecked_Union. If the component is subject to a
8752 -- per-object constraint, then the enclosing object must have inferable
8755 elsif Nkind (N) = N_Selected_Component then
8756 if Has_Per_Object_Constraint (Entity (Selector_Name (N))) then
8758 -- A small hack. If we have a per-object constrained selected
8759 -- component of a formal parameter, return True since we do not
8760 -- know the actual parameter association yet.
8762 if Prefix_Is_Formal_Parameter (N) then
8766 -- Otherwise, check the enclosing object and the selector
8768 return Has_Inferable_Discriminants (Prefix (N))
8770 Has_Inferable_Discriminants (Selector_Name (N));
8773 -- The call to Has_Inferable_Discriminants will determine whether
8774 -- the selector has a constrained Unchecked_Union nominal type.
8776 return Has_Inferable_Discriminants (Selector_Name (N));
8778 -- A qualified expression has inferable discriminants if its subtype
8779 -- mark is a constrained Unchecked_Union subtype.
8781 elsif Nkind (N) = N_Qualified_Expression then
8782 return Is_Unchecked_Union (Subtype_Mark (N))
8784 Is_Constrained (Subtype_Mark (N));
8789 end Has_Inferable_Discriminants;
8791 -------------------------------
8792 -- Insert_Dereference_Action --
8793 -------------------------------
8795 procedure Insert_Dereference_Action (N : Node_Id) is
8796 Loc : constant Source_Ptr := Sloc (N);
8797 Typ : constant Entity_Id := Etype (N);
8798 Pool : constant Entity_Id := Associated_Storage_Pool (Typ);
8799 Pnod : constant Node_Id := Parent (N);
8801 function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean;
8802 -- Return true if type of P is derived from Checked_Pool;
8804 -----------------------------
8805 -- Is_Checked_Storage_Pool --
8806 -----------------------------
8808 function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean is
8817 while T /= Etype (T) loop
8818 if Is_RTE (T, RE_Checked_Pool) then
8826 end Is_Checked_Storage_Pool;
8828 -- Start of processing for Insert_Dereference_Action
8831 pragma Assert (Nkind (Pnod) = N_Explicit_Dereference);
8833 if not (Is_Checked_Storage_Pool (Pool)
8834 and then Comes_From_Source (Original_Node (Pnod)))
8840 Make_Procedure_Call_Statement (Loc,
8841 Name => New_Reference_To (
8842 Find_Prim_Op (Etype (Pool), Name_Dereference), Loc),
8844 Parameter_Associations => New_List (
8848 New_Reference_To (Pool, Loc),
8850 -- Storage_Address. We use the attribute Pool_Address, which uses
8851 -- the pointer itself to find the address of the object, and which
8852 -- handles unconstrained arrays properly by computing the address
8853 -- of the template. i.e. the correct address of the corresponding
8856 Make_Attribute_Reference (Loc,
8857 Prefix => Duplicate_Subexpr_Move_Checks (N),
8858 Attribute_Name => Name_Pool_Address),
8860 -- Size_In_Storage_Elements
8862 Make_Op_Divide (Loc,
8864 Make_Attribute_Reference (Loc,
8866 Make_Explicit_Dereference (Loc,
8867 Duplicate_Subexpr_Move_Checks (N)),
8868 Attribute_Name => Name_Size),
8870 Make_Integer_Literal (Loc, System_Storage_Unit)),
8874 Make_Attribute_Reference (Loc,
8876 Make_Explicit_Dereference (Loc,
8877 Duplicate_Subexpr_Move_Checks (N)),
8878 Attribute_Name => Name_Alignment))));
8881 when RE_Not_Available =>
8883 end Insert_Dereference_Action;
8885 ------------------------------
8886 -- Make_Array_Comparison_Op --
8887 ------------------------------
8889 -- This is a hand-coded expansion of the following generic function:
8892 -- type elem is (<>);
8893 -- type index is (<>);
8894 -- type a is array (index range <>) of elem;
8896 -- function Gnnn (X : a; Y: a) return boolean is
8897 -- J : index := Y'first;
8900 -- if X'length = 0 then
8903 -- elsif Y'length = 0 then
8907 -- for I in X'range loop
8908 -- if X (I) = Y (J) then
8909 -- if J = Y'last then
8912 -- J := index'succ (J);
8916 -- return X (I) > Y (J);
8920 -- return X'length > Y'length;
8924 -- Note that since we are essentially doing this expansion by hand, we
8925 -- do not need to generate an actual or formal generic part, just the
8926 -- instantiated function itself.
8928 function Make_Array_Comparison_Op
8930 Nod : Node_Id) return Node_Id
8932 Loc : constant Source_Ptr := Sloc (Nod);
8934 X : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uX);
8935 Y : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uY);
8936 I : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uI);
8937 J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ);
8939 Index : constant Entity_Id := Base_Type (Etype (First_Index (Typ)));
8941 Loop_Statement : Node_Id;
8942 Loop_Body : Node_Id;
8945 Final_Expr : Node_Id;
8946 Func_Body : Node_Id;
8947 Func_Name : Entity_Id;
8953 -- if J = Y'last then
8956 -- J := index'succ (J);
8960 Make_Implicit_If_Statement (Nod,
8963 Left_Opnd => New_Reference_To (J, Loc),
8965 Make_Attribute_Reference (Loc,
8966 Prefix => New_Reference_To (Y, Loc),
8967 Attribute_Name => Name_Last)),
8969 Then_Statements => New_List (
8970 Make_Exit_Statement (Loc)),
8974 Make_Assignment_Statement (Loc,
8975 Name => New_Reference_To (J, Loc),
8977 Make_Attribute_Reference (Loc,
8978 Prefix => New_Reference_To (Index, Loc),
8979 Attribute_Name => Name_Succ,
8980 Expressions => New_List (New_Reference_To (J, Loc))))));
8982 -- if X (I) = Y (J) then
8985 -- return X (I) > Y (J);
8989 Make_Implicit_If_Statement (Nod,
8993 Make_Indexed_Component (Loc,
8994 Prefix => New_Reference_To (X, Loc),
8995 Expressions => New_List (New_Reference_To (I, Loc))),
8998 Make_Indexed_Component (Loc,
8999 Prefix => New_Reference_To (Y, Loc),
9000 Expressions => New_List (New_Reference_To (J, Loc)))),
9002 Then_Statements => New_List (Inner_If),
9004 Else_Statements => New_List (
9005 Make_Simple_Return_Statement (Loc,
9009 Make_Indexed_Component (Loc,
9010 Prefix => New_Reference_To (X, Loc),
9011 Expressions => New_List (New_Reference_To (I, Loc))),
9014 Make_Indexed_Component (Loc,
9015 Prefix => New_Reference_To (Y, Loc),
9016 Expressions => New_List (
9017 New_Reference_To (J, Loc)))))));
9019 -- for I in X'range loop
9024 Make_Implicit_Loop_Statement (Nod,
9025 Identifier => Empty,
9028 Make_Iteration_Scheme (Loc,
9029 Loop_Parameter_Specification =>
9030 Make_Loop_Parameter_Specification (Loc,
9031 Defining_Identifier => I,
9032 Discrete_Subtype_Definition =>
9033 Make_Attribute_Reference (Loc,
9034 Prefix => New_Reference_To (X, Loc),
9035 Attribute_Name => Name_Range))),
9037 Statements => New_List (Loop_Body));
9039 -- if X'length = 0 then
9041 -- elsif Y'length = 0 then
9044 -- for ... loop ... end loop;
9045 -- return X'length > Y'length;
9049 Make_Attribute_Reference (Loc,
9050 Prefix => New_Reference_To (X, Loc),
9051 Attribute_Name => Name_Length);
9054 Make_Attribute_Reference (Loc,
9055 Prefix => New_Reference_To (Y, Loc),
9056 Attribute_Name => Name_Length);
9060 Left_Opnd => Length1,
9061 Right_Opnd => Length2);
9064 Make_Implicit_If_Statement (Nod,
9068 Make_Attribute_Reference (Loc,
9069 Prefix => New_Reference_To (X, Loc),
9070 Attribute_Name => Name_Length),
9072 Make_Integer_Literal (Loc, 0)),
9076 Make_Simple_Return_Statement (Loc,
9077 Expression => New_Reference_To (Standard_False, Loc))),
9079 Elsif_Parts => New_List (
9080 Make_Elsif_Part (Loc,
9084 Make_Attribute_Reference (Loc,
9085 Prefix => New_Reference_To (Y, Loc),
9086 Attribute_Name => Name_Length),
9088 Make_Integer_Literal (Loc, 0)),
9092 Make_Simple_Return_Statement (Loc,
9093 Expression => New_Reference_To (Standard_True, Loc))))),
9095 Else_Statements => New_List (
9097 Make_Simple_Return_Statement (Loc,
9098 Expression => Final_Expr)));
9102 Formals := New_List (
9103 Make_Parameter_Specification (Loc,
9104 Defining_Identifier => X,
9105 Parameter_Type => New_Reference_To (Typ, Loc)),
9107 Make_Parameter_Specification (Loc,
9108 Defining_Identifier => Y,
9109 Parameter_Type => New_Reference_To (Typ, Loc)));
9111 -- function Gnnn (...) return boolean is
9112 -- J : index := Y'first;
9117 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('G'));
9120 Make_Subprogram_Body (Loc,
9122 Make_Function_Specification (Loc,
9123 Defining_Unit_Name => Func_Name,
9124 Parameter_Specifications => Formals,
9125 Result_Definition => New_Reference_To (Standard_Boolean, Loc)),
9127 Declarations => New_List (
9128 Make_Object_Declaration (Loc,
9129 Defining_Identifier => J,
9130 Object_Definition => New_Reference_To (Index, Loc),
9132 Make_Attribute_Reference (Loc,
9133 Prefix => New_Reference_To (Y, Loc),
9134 Attribute_Name => Name_First))),
9136 Handled_Statement_Sequence =>
9137 Make_Handled_Sequence_Of_Statements (Loc,
9138 Statements => New_List (If_Stat)));
9141 end Make_Array_Comparison_Op;
9143 ---------------------------
9144 -- Make_Boolean_Array_Op --
9145 ---------------------------
9147 -- For logical operations on boolean arrays, expand in line the following,
9148 -- replacing 'and' with 'or' or 'xor' where needed:
9150 -- function Annn (A : typ; B: typ) return typ is
9153 -- for J in A'range loop
9154 -- C (J) := A (J) op B (J);
9159 -- Here typ is the boolean array type
9161 function Make_Boolean_Array_Op
9163 N : Node_Id) return Node_Id
9165 Loc : constant Source_Ptr := Sloc (N);
9167 A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA);
9168 B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB);
9169 C : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uC);
9170 J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ);
9178 Func_Name : Entity_Id;
9179 Func_Body : Node_Id;
9180 Loop_Statement : Node_Id;
9184 Make_Indexed_Component (Loc,
9185 Prefix => New_Reference_To (A, Loc),
9186 Expressions => New_List (New_Reference_To (J, Loc)));
9189 Make_Indexed_Component (Loc,
9190 Prefix => New_Reference_To (B, Loc),
9191 Expressions => New_List (New_Reference_To (J, Loc)));
9194 Make_Indexed_Component (Loc,
9195 Prefix => New_Reference_To (C, Loc),
9196 Expressions => New_List (New_Reference_To (J, Loc)));
9198 if Nkind (N) = N_Op_And then
9204 elsif Nkind (N) = N_Op_Or then
9218 Make_Implicit_Loop_Statement (N,
9219 Identifier => Empty,
9222 Make_Iteration_Scheme (Loc,
9223 Loop_Parameter_Specification =>
9224 Make_Loop_Parameter_Specification (Loc,
9225 Defining_Identifier => J,
9226 Discrete_Subtype_Definition =>
9227 Make_Attribute_Reference (Loc,
9228 Prefix => New_Reference_To (A, Loc),
9229 Attribute_Name => Name_Range))),
9231 Statements => New_List (
9232 Make_Assignment_Statement (Loc,
9234 Expression => Op)));
9236 Formals := New_List (
9237 Make_Parameter_Specification (Loc,
9238 Defining_Identifier => A,
9239 Parameter_Type => New_Reference_To (Typ, Loc)),
9241 Make_Parameter_Specification (Loc,
9242 Defining_Identifier => B,
9243 Parameter_Type => New_Reference_To (Typ, Loc)));
9246 Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
9247 Set_Is_Inlined (Func_Name);
9250 Make_Subprogram_Body (Loc,
9252 Make_Function_Specification (Loc,
9253 Defining_Unit_Name => Func_Name,
9254 Parameter_Specifications => Formals,
9255 Result_Definition => New_Reference_To (Typ, Loc)),
9257 Declarations => New_List (
9258 Make_Object_Declaration (Loc,
9259 Defining_Identifier => C,
9260 Object_Definition => New_Reference_To (Typ, Loc))),
9262 Handled_Statement_Sequence =>
9263 Make_Handled_Sequence_Of_Statements (Loc,
9264 Statements => New_List (
9266 Make_Simple_Return_Statement (Loc,
9267 Expression => New_Reference_To (C, Loc)))));
9270 end Make_Boolean_Array_Op;
9272 ------------------------
9273 -- Rewrite_Comparison --
9274 ------------------------
9276 procedure Rewrite_Comparison (N : Node_Id) is
9277 Warning_Generated : Boolean := False;
9278 -- Set to True if first pass with Assume_Valid generates a warning in
9279 -- which case we skip the second pass to avoid warning overloaded.
9282 -- Set to Standard_True or Standard_False
9285 if Nkind (N) = N_Type_Conversion then
9286 Rewrite_Comparison (Expression (N));
9289 elsif Nkind (N) not in N_Op_Compare then
9293 -- Now start looking at the comparison in detail. We potentially go
9294 -- through this loop twice. The first time, Assume_Valid is set False
9295 -- in the call to Compile_Time_Compare. If this call results in a
9296 -- clear result of always True or Always False, that's decisive and
9297 -- we are done. Otherwise we repeat the processing with Assume_Valid
9298 -- set to True to generate additional warnings. We can stil that step
9299 -- if Constant_Condition_Warnings is False.
9301 for AV in False .. True loop
9303 Typ : constant Entity_Id := Etype (N);
9304 Op1 : constant Node_Id := Left_Opnd (N);
9305 Op2 : constant Node_Id := Right_Opnd (N);
9307 Res : constant Compare_Result :=
9308 Compile_Time_Compare (Op1, Op2, Assume_Valid => AV);
9309 -- Res indicates if compare outcome can be compile time determined
9311 True_Result : Boolean;
9312 False_Result : Boolean;
9315 case N_Op_Compare (Nkind (N)) is
9317 True_Result := Res = EQ;
9318 False_Result := Res = LT or else Res = GT or else Res = NE;
9321 True_Result := Res in Compare_GE;
9322 False_Result := Res = LT;
9325 and then Constant_Condition_Warnings
9326 and then Comes_From_Source (Original_Node (N))
9327 and then Nkind (Original_Node (N)) = N_Op_Ge
9328 and then not In_Instance
9329 and then Is_Integer_Type (Etype (Left_Opnd (N)))
9330 and then not Has_Warnings_Off (Etype (Left_Opnd (N)))
9333 ("can never be greater than, could replace by ""'=""?", N);
9334 Warning_Generated := True;
9338 True_Result := Res = GT;
9339 False_Result := Res in Compare_LE;
9342 True_Result := Res = LT;
9343 False_Result := Res in Compare_GE;
9346 True_Result := Res in Compare_LE;
9347 False_Result := Res = GT;
9350 and then Constant_Condition_Warnings
9351 and then Comes_From_Source (Original_Node (N))
9352 and then Nkind (Original_Node (N)) = N_Op_Le
9353 and then not In_Instance
9354 and then Is_Integer_Type (Etype (Left_Opnd (N)))
9355 and then not Has_Warnings_Off (Etype (Left_Opnd (N)))
9358 ("can never be less than, could replace by ""'=""?", N);
9359 Warning_Generated := True;
9363 True_Result := Res = NE or else Res = GT or else Res = LT;
9364 False_Result := Res = EQ;
9367 -- If this is the first iteration, then we actually convert the
9368 -- comparison into True or False, if the result is certain.
9371 if True_Result or False_Result then
9373 Result := Standard_True;
9375 Result := Standard_False;
9380 New_Occurrence_Of (Result, Sloc (N))));
9381 Analyze_And_Resolve (N, Typ);
9382 Warn_On_Known_Condition (N);
9386 -- If this is the second iteration (AV = True), and the original
9387 -- node comes from source and we are not in an instance, then
9388 -- give a warning if we know result would be True or False. Note
9389 -- we know Constant_Condition_Warnings is set if we get here.
9391 elsif Comes_From_Source (Original_Node (N))
9392 and then not In_Instance
9396 ("condition can only be False if invalid values present?",
9398 elsif False_Result then
9400 ("condition can only be True if invalid values present?",
9406 -- Skip second iteration if not warning on constant conditions or
9407 -- if the first iteration already generated a warning of some kind
9408 -- or if we are in any case assuming all values are valid (so that
9409 -- the first iteration took care of the valid case).
9411 exit when not Constant_Condition_Warnings;
9412 exit when Warning_Generated;
9413 exit when Assume_No_Invalid_Values;
9415 end Rewrite_Comparison;
9417 ----------------------------
9418 -- Safe_In_Place_Array_Op --
9419 ----------------------------
9421 function Safe_In_Place_Array_Op
9424 Op2 : Node_Id) return Boolean
9428 function Is_Safe_Operand (Op : Node_Id) return Boolean;
9429 -- Operand is safe if it cannot overlap part of the target of the
9430 -- operation. If the operand and the target are identical, the operand
9431 -- is safe. The operand can be empty in the case of negation.
9433 function Is_Unaliased (N : Node_Id) return Boolean;
9434 -- Check that N is a stand-alone entity
9440 function Is_Unaliased (N : Node_Id) return Boolean is
9444 and then No (Address_Clause (Entity (N)))
9445 and then No (Renamed_Object (Entity (N)));
9448 ---------------------
9449 -- Is_Safe_Operand --
9450 ---------------------
9452 function Is_Safe_Operand (Op : Node_Id) return Boolean is
9457 elsif Is_Entity_Name (Op) then
9458 return Is_Unaliased (Op);
9460 elsif Nkind_In (Op, N_Indexed_Component, N_Selected_Component) then
9461 return Is_Unaliased (Prefix (Op));
9463 elsif Nkind (Op) = N_Slice then
9465 Is_Unaliased (Prefix (Op))
9466 and then Entity (Prefix (Op)) /= Target;
9468 elsif Nkind (Op) = N_Op_Not then
9469 return Is_Safe_Operand (Right_Opnd (Op));
9474 end Is_Safe_Operand;
9476 -- Start of processing for Is_Safe_In_Place_Array_Op
9479 -- Skip this processing if the component size is different from system
9480 -- storage unit (since at least for NOT this would cause problems).
9482 if Component_Size (Etype (Lhs)) /= System_Storage_Unit then
9485 -- Cannot do in place stuff on VM_Target since cannot pass addresses
9487 elsif VM_Target /= No_VM then
9490 -- Cannot do in place stuff if non-standard Boolean representation
9492 elsif Has_Non_Standard_Rep (Component_Type (Etype (Lhs))) then
9495 elsif not Is_Unaliased (Lhs) then
9498 Target := Entity (Lhs);
9501 Is_Safe_Operand (Op1)
9502 and then Is_Safe_Operand (Op2);
9504 end Safe_In_Place_Array_Op;
9506 -----------------------
9507 -- Tagged_Membership --
9508 -----------------------
9510 -- There are two different cases to consider depending on whether the right
9511 -- operand is a class-wide type or not. If not we just compare the actual
9512 -- tag of the left expr to the target type tag:
9514 -- Left_Expr.Tag = Right_Type'Tag;
9516 -- If it is a class-wide type we use the RT function CW_Membership which is
9517 -- usually implemented by looking in the ancestor tables contained in the
9518 -- dispatch table pointed by Left_Expr.Tag for Typ'Tag
9520 -- Ada 2005 (AI-251): If it is a class-wide interface type we use the RT
9521 -- function IW_Membership which is usually implemented by looking in the
9522 -- table of abstract interface types plus the ancestor table contained in
9523 -- the dispatch table pointed by Left_Expr.Tag for Typ'Tag
9525 function Tagged_Membership (N : Node_Id) return Node_Id is
9526 Left : constant Node_Id := Left_Opnd (N);
9527 Right : constant Node_Id := Right_Opnd (N);
9528 Loc : constant Source_Ptr := Sloc (N);
9530 Left_Type : Entity_Id;
9531 Right_Type : Entity_Id;
9535 -- Handle entities from the limited view
9537 Left_Type := Available_View (Etype (Left));
9538 Right_Type := Available_View (Etype (Right));
9540 if Is_Class_Wide_Type (Left_Type) then
9541 Left_Type := Root_Type (Left_Type);
9545 Make_Selected_Component (Loc,
9546 Prefix => Relocate_Node (Left),
9548 New_Reference_To (First_Tag_Component (Left_Type), Loc));
9550 if Is_Class_Wide_Type (Right_Type) then
9552 -- No need to issue a run-time check if we statically know that the
9553 -- result of this membership test is always true. For example,
9554 -- considering the following declarations:
9556 -- type Iface is interface;
9557 -- type T is tagged null record;
9558 -- type DT is new T and Iface with null record;
9563 -- These membership tests are always true:
9567 -- Obj2 in Iface'Class;
9569 -- We do not need to handle cases where the membership is illegal.
9572 -- Obj1 in DT'Class; -- Compile time error
9573 -- Obj1 in Iface'Class; -- Compile time error
9575 if not Is_Class_Wide_Type (Left_Type)
9576 and then (Is_Ancestor (Etype (Right_Type), Left_Type)
9577 or else (Is_Interface (Etype (Right_Type))
9578 and then Interface_Present_In_Ancestor
9580 Iface => Etype (Right_Type))))
9582 return New_Reference_To (Standard_True, Loc);
9585 -- Ada 2005 (AI-251): Class-wide applied to interfaces
9587 if Is_Interface (Etype (Class_Wide_Type (Right_Type)))
9589 -- Support to: "Iface_CW_Typ in Typ'Class"
9591 or else Is_Interface (Left_Type)
9593 -- Issue error if IW_Membership operation not available in a
9594 -- configurable run time setting.
9596 if not RTE_Available (RE_IW_Membership) then
9598 ("dynamic membership test on interface types", N);
9603 Make_Function_Call (Loc,
9604 Name => New_Occurrence_Of (RTE (RE_IW_Membership), Loc),
9605 Parameter_Associations => New_List (
9606 Make_Attribute_Reference (Loc,
9608 Attribute_Name => Name_Address),
9611 (Access_Disp_Table (Root_Type (Right_Type)))),
9614 -- Ada 95: Normal case
9618 Build_CW_Membership (Loc,
9619 Obj_Tag_Node => Obj_Tag,
9623 (Access_Disp_Table (Root_Type (Right_Type)))),
9627 -- Right_Type is not a class-wide type
9630 -- No need to check the tag of the object if Right_Typ is abstract
9632 if Is_Abstract_Type (Right_Type) then
9633 return New_Reference_To (Standard_False, Loc);
9638 Left_Opnd => Obj_Tag,
9641 (Node (First_Elmt (Access_Disp_Table (Right_Type))), Loc));
9644 end Tagged_Membership;
9646 ------------------------------
9647 -- Unary_Op_Validity_Checks --
9648 ------------------------------
9650 procedure Unary_Op_Validity_Checks (N : Node_Id) is
9652 if Validity_Checks_On and Validity_Check_Operands then
9653 Ensure_Valid (Right_Opnd (N));
9655 end Unary_Op_Validity_Checks;
projects / platform / upstream / gcc.git / blob