1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2004, 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 2, 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 COPYING. If not, write --
19 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
20 -- MA 02111-1307, USA. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 with Atree; use Atree;
28 with Checks; use Checks;
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_Ch3; use Exp_Ch3;
34 with Exp_Ch7; use Exp_Ch7;
35 with Exp_Ch9; use Exp_Ch9;
36 with Exp_Disp; use Exp_Disp;
37 with Exp_Fixd; use Exp_Fixd;
38 with Exp_Pakd; use Exp_Pakd;
39 with Exp_Tss; use Exp_Tss;
40 with Exp_Util; use Exp_Util;
41 with Exp_VFpt; use Exp_VFpt;
42 with Hostparm; use Hostparm;
43 with Inline; use Inline;
44 with Nlists; use Nlists;
45 with Nmake; use Nmake;
47 with Rtsfind; use Rtsfind;
49 with Sem_Cat; use Sem_Cat;
50 with Sem_Ch13; use Sem_Ch13;
51 with Sem_Eval; use Sem_Eval;
52 with Sem_Res; use Sem_Res;
53 with Sem_Type; use Sem_Type;
54 with Sem_Util; use Sem_Util;
55 with Sem_Warn; use Sem_Warn;
56 with Sinfo; use Sinfo;
57 with Sinfo.CN; use Sinfo.CN;
58 with Snames; use Snames;
59 with Stand; use Stand;
60 with Targparm; use Targparm;
61 with Tbuild; use Tbuild;
62 with Ttypes; use Ttypes;
63 with Uintp; use Uintp;
64 with Urealp; use Urealp;
65 with Validsw; use Validsw;
67 package body Exp_Ch4 is
69 ------------------------
70 -- Local Subprograms --
71 ------------------------
73 procedure Binary_Op_Validity_Checks (N : Node_Id);
74 pragma Inline (Binary_Op_Validity_Checks);
75 -- Performs validity checks for a binary operator
77 procedure Build_Boolean_Array_Proc_Call
81 -- If an boolean array assignment can be done in place, build call to
82 -- corresponding library procedure.
84 procedure Expand_Allocator_Expression (N : Node_Id);
85 -- Subsidiary to Expand_N_Allocator, for the case when the expression
86 -- is a qualified expression or an aggregate.
88 procedure Expand_Array_Comparison (N : Node_Id);
89 -- This routine handles expansion of the comparison operators (N_Op_Lt,
90 -- N_Op_Le, N_Op_Gt, N_Op_Ge) when operating on an array type. The basic
91 -- code for these operators is similar, differing only in the details of
92 -- the actual comparison call that is made. Special processing (call a
95 function Expand_Array_Equality
103 -- Expand an array equality into a call to a function implementing this
104 -- equality, and a call to it. Loc is the location for the generated
105 -- nodes. Typ is the type of the array, and Lhs, Rhs are the array
106 -- expressions to be compared. A_Typ is the type of the arguments,
107 -- which may be a private type, in which case Typ is its full view.
108 -- Bodies is a list on which to attach bodies of local functions that
109 -- are created in the process. This is the responsibility of the
110 -- caller to insert those bodies at the right place. Nod provides
111 -- the Sloc value for the generated code.
113 procedure Expand_Boolean_Operator (N : Node_Id);
114 -- Common expansion processing for Boolean operators (And, Or, Xor)
115 -- for the case of array type arguments.
117 function Expand_Composite_Equality
124 -- Local recursive function used to expand equality for nested
125 -- composite types. Used by Expand_Record/Array_Equality, Bodies
126 -- is a list on which to attach bodies of local functions that are
127 -- created in the process. This is the responsability of the caller
128 -- to insert those bodies at the right place. Nod provides the Sloc
129 -- value for generated code.
131 procedure Expand_Concatenate_Other (Cnode : Node_Id; Opnds : List_Id);
132 -- This routine handles expansion of concatenation operations, where
133 -- N is the N_Op_Concat node being expanded and Operands is the list
134 -- of operands (at least two are present). The caller has dealt with
135 -- converting any singleton operands into singleton aggregates.
137 procedure Expand_Concatenate_String (Cnode : Node_Id; Opnds : List_Id);
138 -- Routine to expand concatenation of 2-5 operands (in the list Operands)
139 -- and replace node Cnode with the result of the contatenation. If there
140 -- are two operands, they can be string or character. If there are more
141 -- than two operands, then are always of type string (i.e. the caller has
142 -- already converted character operands to strings in this case).
144 procedure Fixup_Universal_Fixed_Operation (N : Node_Id);
145 -- N is either an N_Op_Divide or N_Op_Multiply node whose result is
146 -- universal fixed. We do not have such a type at runtime, so the
147 -- purpose of this routine is to find the real type by looking up
148 -- the tree. We also determine if the operation must be rounded.
150 function Get_Allocator_Final_List
155 -- If the designated type is controlled, build final_list expression
156 -- for created object. If context is an access parameter, create a
157 -- local access type to have a usable finalization list.
159 procedure Insert_Dereference_Action (N : Node_Id);
160 -- N is an expression whose type is an access. When the type is derived
161 -- from Checked_Pool, expands a call to the primitive 'dereference'.
163 function Make_Array_Comparison_Op
167 -- Comparisons between arrays are expanded in line. This function
168 -- produces the body of the implementation of (a > b), where a and b
169 -- are one-dimensional arrays of some discrete type. The original
170 -- node is then expanded into the appropriate call to this function.
171 -- Nod provides the Sloc value for the generated code.
173 function Make_Boolean_Array_Op
177 -- Boolean operations on boolean arrays are expanded in line. This
178 -- function produce the body for the node N, which is (a and b),
179 -- (a or b), or (a xor b). It is used only the normal case and not
180 -- the packed case. The type involved, Typ, is the Boolean array type,
181 -- and the logical operations in the body are simple boolean operations.
182 -- Note that Typ is always a constrained type (the caller has ensured
183 -- this by using Convert_To_Actual_Subtype if necessary).
185 procedure Rewrite_Comparison (N : Node_Id);
186 -- N is the node for a compile time comparison. If this outcome of this
187 -- comparison can be determined at compile time, then the node N can be
188 -- rewritten with True or False. If the outcome cannot be determined at
189 -- compile time, the call has no effect.
191 function Tagged_Membership (N : Node_Id) return Node_Id;
192 -- Construct the expression corresponding to the tagged membership test.
193 -- Deals with a second operand being (or not) a class-wide type.
195 function Safe_In_Place_Array_Op
200 -- In the context of an assignment, where the right-hand side is a
201 -- boolean operation on arrays, check whether operation can be performed
204 procedure Unary_Op_Validity_Checks (N : Node_Id);
205 pragma Inline (Unary_Op_Validity_Checks);
206 -- Performs validity checks for a unary operator
208 -------------------------------
209 -- Binary_Op_Validity_Checks --
210 -------------------------------
212 procedure Binary_Op_Validity_Checks (N : Node_Id) is
214 if Validity_Checks_On and Validity_Check_Operands then
215 Ensure_Valid (Left_Opnd (N));
216 Ensure_Valid (Right_Opnd (N));
218 end Binary_Op_Validity_Checks;
220 ------------------------------------
221 -- Build_Boolean_Array_Proc_Call --
222 ------------------------------------
224 procedure Build_Boolean_Array_Proc_Call
229 Loc : constant Source_Ptr := Sloc (N);
230 Kind : constant Node_Kind := Nkind (Expression (N));
231 Target : constant Node_Id :=
232 Make_Attribute_Reference (Loc,
234 Attribute_Name => Name_Address);
236 Arg1 : constant Node_Id := Op1;
237 Arg2 : Node_Id := Op2;
239 Proc_Name : Entity_Id;
242 if Kind = N_Op_Not then
243 if Nkind (Op1) in N_Binary_Op then
245 -- Use negated version of the binary operators.
247 if Nkind (Op1) = N_Op_And then
248 Proc_Name := RTE (RE_Vector_Nand);
250 elsif Nkind (Op1) = N_Op_Or then
251 Proc_Name := RTE (RE_Vector_Nor);
253 else pragma Assert (Nkind (Op1) = N_Op_Xor);
254 Proc_Name := RTE (RE_Vector_Xor);
258 Make_Procedure_Call_Statement (Loc,
259 Name => New_Occurrence_Of (Proc_Name, Loc),
261 Parameter_Associations => New_List (
263 Make_Attribute_Reference (Loc,
264 Prefix => Left_Opnd (Op1),
265 Attribute_Name => Name_Address),
267 Make_Attribute_Reference (Loc,
268 Prefix => Right_Opnd (Op1),
269 Attribute_Name => Name_Address),
271 Make_Attribute_Reference (Loc,
272 Prefix => Left_Opnd (Op1),
273 Attribute_Name => Name_Length)));
276 Proc_Name := RTE (RE_Vector_Not);
279 Make_Procedure_Call_Statement (Loc,
280 Name => New_Occurrence_Of (Proc_Name, Loc),
281 Parameter_Associations => New_List (
284 Make_Attribute_Reference (Loc,
286 Attribute_Name => Name_Address),
288 Make_Attribute_Reference (Loc,
290 Attribute_Name => Name_Length)));
294 -- We use the following equivalences:
296 -- (not X) or (not Y) = not (X and Y) = Nand (X, Y)
297 -- (not X) and (not Y) = not (X or Y) = Nor (X, Y)
298 -- (not X) xor (not Y) = X xor Y
299 -- X xor (not Y) = not (X xor Y) = Nxor (X, Y)
301 if Nkind (Op1) = N_Op_Not then
302 if Kind = N_Op_And then
303 Proc_Name := RTE (RE_Vector_Nor);
305 elsif Kind = N_Op_Or then
306 Proc_Name := RTE (RE_Vector_Nand);
309 Proc_Name := RTE (RE_Vector_Xor);
313 if Kind = N_Op_And then
314 Proc_Name := RTE (RE_Vector_And);
316 elsif Kind = N_Op_Or then
317 Proc_Name := RTE (RE_Vector_Or);
319 elsif Nkind (Op2) = N_Op_Not then
320 Proc_Name := RTE (RE_Vector_Nxor);
321 Arg2 := Right_Opnd (Op2);
324 Proc_Name := RTE (RE_Vector_Xor);
329 Make_Procedure_Call_Statement (Loc,
330 Name => New_Occurrence_Of (Proc_Name, Loc),
331 Parameter_Associations => New_List (
333 Make_Attribute_Reference (Loc,
335 Attribute_Name => Name_Address),
336 Make_Attribute_Reference (Loc,
338 Attribute_Name => Name_Address),
339 Make_Attribute_Reference (Loc,
341 Attribute_Name => Name_Length)));
344 Rewrite (N, Call_Node);
348 when RE_Not_Available =>
350 end Build_Boolean_Array_Proc_Call;
352 ---------------------------------
353 -- Expand_Allocator_Expression --
354 ---------------------------------
356 procedure Expand_Allocator_Expression (N : Node_Id) is
357 Loc : constant Source_Ptr := Sloc (N);
358 Exp : constant Node_Id := Expression (Expression (N));
359 Indic : constant Node_Id := Subtype_Mark (Expression (N));
360 PtrT : constant Entity_Id := Etype (N);
361 T : constant Entity_Id := Entity (Indic);
366 Aggr_In_Place : constant Boolean := Is_Delayed_Aggregate (Exp);
368 Tag_Assign : Node_Id;
372 if Is_Tagged_Type (T) or else Controlled_Type (T) then
374 -- Actions inserted before:
375 -- Temp : constant ptr_T := new T'(Expression);
376 -- <no CW> Temp._tag := T'tag;
377 -- <CTRL> Adjust (Finalizable (Temp.all));
378 -- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
380 -- We analyze by hand the new internal allocator to avoid
381 -- any recursion and inappropriate call to Initialize
382 if not Aggr_In_Place then
383 Remove_Side_Effects (Exp);
387 Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
389 -- For a class wide allocation generate the following code:
391 -- type Equiv_Record is record ... end record;
392 -- implicit subtype CW is <Class_Wide_Subytpe>;
393 -- temp : PtrT := new CW'(CW!(expr));
395 if Is_Class_Wide_Type (T) then
396 Expand_Subtype_From_Expr (Empty, T, Indic, Exp);
398 Set_Expression (Expression (N),
399 Unchecked_Convert_To (Entity (Indic), Exp));
401 Analyze_And_Resolve (Expression (N), Entity (Indic));
404 if Aggr_In_Place then
406 Make_Object_Declaration (Loc,
407 Defining_Identifier => Temp,
408 Object_Definition => New_Reference_To (PtrT, Loc),
411 New_Reference_To (Etype (Exp), Loc)));
413 Set_Comes_From_Source
414 (Expression (Tmp_Node), Comes_From_Source (N));
416 Set_No_Initialization (Expression (Tmp_Node));
417 Insert_Action (N, Tmp_Node);
419 if Controlled_Type (T)
420 and then Ekind (PtrT) = E_Anonymous_Access_Type
422 -- Create local finalization list for access parameter.
424 Flist := Get_Allocator_Final_List (N, Base_Type (T), PtrT);
427 Convert_Aggr_In_Allocator (Tmp_Node, Exp);
429 Node := Relocate_Node (N);
432 Make_Object_Declaration (Loc,
433 Defining_Identifier => Temp,
434 Constant_Present => True,
435 Object_Definition => New_Reference_To (PtrT, Loc),
436 Expression => Node));
439 -- Suppress the tag assignment when Java_VM because JVM tags
440 -- are represented implicitly in objects.
442 if Is_Tagged_Type (T)
443 and then not Is_Class_Wide_Type (T)
447 Make_Assignment_Statement (Loc,
449 Make_Selected_Component (Loc,
450 Prefix => New_Reference_To (Temp, Loc),
452 New_Reference_To (Tag_Component (T), Loc)),
455 Unchecked_Convert_To (RTE (RE_Tag),
456 New_Reference_To (Access_Disp_Table (T), Loc)));
458 -- The previous assignment has to be done in any case
460 Set_Assignment_OK (Name (Tag_Assign));
461 Insert_Action (N, Tag_Assign);
463 elsif Is_Private_Type (T)
464 and then Is_Tagged_Type (Underlying_Type (T))
468 Utyp : constant Entity_Id := Underlying_Type (T);
469 Ref : constant Node_Id :=
470 Unchecked_Convert_To (Utyp,
471 Make_Explicit_Dereference (Loc,
472 New_Reference_To (Temp, Loc)));
476 Make_Assignment_Statement (Loc,
478 Make_Selected_Component (Loc,
481 New_Reference_To (Tag_Component (Utyp), Loc)),
484 Unchecked_Convert_To (RTE (RE_Tag),
486 Access_Disp_Table (Utyp), Loc)));
488 Set_Assignment_OK (Name (Tag_Assign));
489 Insert_Action (N, Tag_Assign);
493 if Controlled_Type (Designated_Type (PtrT))
494 and then Controlled_Type (T)
498 Apool : constant Entity_Id :=
499 Associated_Storage_Pool (PtrT);
502 -- If it is an allocation on the secondary stack
503 -- (i.e. a value returned from a function), the object
504 -- is attached on the caller side as soon as the call
505 -- is completed (see Expand_Ctrl_Function_Call)
507 if Is_RTE (Apool, RE_SS_Pool) then
509 F : constant Entity_Id :=
510 Make_Defining_Identifier (Loc,
511 New_Internal_Name ('F'));
514 Make_Object_Declaration (Loc,
515 Defining_Identifier => F,
516 Object_Definition => New_Reference_To (RTE
517 (RE_Finalizable_Ptr), Loc)));
519 Flist := New_Reference_To (F, Loc);
520 Attach := Make_Integer_Literal (Loc, 1);
523 -- Normal case, not a secondary stack allocation
526 Flist := Find_Final_List (PtrT);
527 Attach := Make_Integer_Literal (Loc, 2);
530 if not Aggr_In_Place then
535 -- An unchecked conversion is needed in the
536 -- classwide case because the designated type
537 -- can be an ancestor of the subtype mark of
540 Unchecked_Convert_To (T,
541 Make_Explicit_Dereference (Loc,
542 New_Reference_To (Temp, Loc))),
546 With_Attach => Attach));
551 Rewrite (N, New_Reference_To (Temp, Loc));
552 Analyze_And_Resolve (N, PtrT);
554 elsif Aggr_In_Place then
556 Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
558 Make_Object_Declaration (Loc,
559 Defining_Identifier => Temp,
560 Object_Definition => New_Reference_To (PtrT, Loc),
561 Expression => Make_Allocator (Loc,
562 New_Reference_To (Etype (Exp), Loc)));
564 Set_Comes_From_Source
565 (Expression (Tmp_Node), Comes_From_Source (N));
567 Set_No_Initialization (Expression (Tmp_Node));
568 Insert_Action (N, Tmp_Node);
569 Convert_Aggr_In_Allocator (Tmp_Node, Exp);
570 Rewrite (N, New_Reference_To (Temp, Loc));
571 Analyze_And_Resolve (N, PtrT);
573 elsif Is_Access_Type (Designated_Type (PtrT))
574 and then Nkind (Exp) = N_Allocator
575 and then Nkind (Expression (Exp)) /= N_Qualified_Expression
577 -- Apply constraint to designated subtype indication.
579 Apply_Constraint_Check (Expression (Exp),
580 Designated_Type (Designated_Type (PtrT)),
583 if Nkind (Expression (Exp)) = N_Raise_Constraint_Error then
585 -- Propagate constraint_error to enclosing allocator
587 Rewrite (Exp, New_Copy (Expression (Exp)));
590 -- First check against the type of the qualified expression
592 -- NOTE: The commented call should be correct, but for
593 -- some reason causes the compiler to bomb (sigsegv) on
594 -- ACVC test c34007g, so for now we just perform the old
595 -- (incorrect) test against the designated subtype with
596 -- no sliding in the else part of the if statement below.
599 -- Apply_Constraint_Check (Exp, T, No_Sliding => True);
601 -- A check is also needed in cases where the designated
602 -- subtype is constrained and differs from the subtype
603 -- given in the qualified expression. Note that the check
604 -- on the qualified expression does not allow sliding,
605 -- but this check does (a relaxation from Ada 83).
607 if Is_Constrained (Designated_Type (PtrT))
608 and then not Subtypes_Statically_Match
609 (T, Designated_Type (PtrT))
611 Apply_Constraint_Check
612 (Exp, Designated_Type (PtrT), No_Sliding => False);
614 -- The nonsliding check should really be performed
615 -- (unconditionally) against the subtype of the
616 -- qualified expression, but that causes a problem
617 -- with c34007g (see above), so for now we retain this.
620 Apply_Constraint_Check
621 (Exp, Designated_Type (PtrT), No_Sliding => True);
626 when RE_Not_Available =>
628 end Expand_Allocator_Expression;
630 -----------------------------
631 -- Expand_Array_Comparison --
632 -----------------------------
634 -- Expansion is only required in the case of array types. For the
635 -- unpacked case, an appropriate runtime routine is called. For
636 -- packed cases, and also in some other cases where a runtime
637 -- routine cannot be called, the form of the expansion is:
639 -- [body for greater_nn; boolean_expression]
641 -- The body is built by Make_Array_Comparison_Op, and the form of the
642 -- Boolean expression depends on the operator involved.
644 procedure Expand_Array_Comparison (N : Node_Id) is
645 Loc : constant Source_Ptr := Sloc (N);
646 Op1 : Node_Id := Left_Opnd (N);
647 Op2 : Node_Id := Right_Opnd (N);
648 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
649 Ctyp : constant Entity_Id := Component_Type (Typ1);
653 Func_Name : Entity_Id;
657 Stg_Unit_Is_Byte : constant Boolean := System_Storage_Unit = Byte'Size;
659 function Length_Less_Than_4 (Opnd : Node_Id) return Boolean;
660 -- Returns True if the length of the given operand is known to be
661 -- less than 4. Returns False if this length is known to be four
662 -- or greater or is not known at compile time.
664 ------------------------
665 -- Length_Less_Than_4 --
666 ------------------------
668 function Length_Less_Than_4 (Opnd : Node_Id) return Boolean is
669 Otyp : constant Entity_Id := Etype (Opnd);
672 if Ekind (Otyp) = E_String_Literal_Subtype then
673 return String_Literal_Length (Otyp) < 4;
677 Ityp : constant Entity_Id := Etype (First_Index (Otyp));
678 Lo : constant Node_Id := Type_Low_Bound (Ityp);
679 Hi : constant Node_Id := Type_High_Bound (Ityp);
684 if Compile_Time_Known_Value (Lo) then
685 Lov := Expr_Value (Lo);
690 if Compile_Time_Known_Value (Hi) then
691 Hiv := Expr_Value (Hi);
696 return Hiv < Lov + 3;
699 end Length_Less_Than_4;
701 -- Start of processing for Expand_Array_Comparison
704 -- Deal first with unpacked case, where we can call a runtime routine
705 -- except that we avoid this for targets for which are not addressable
706 -- by bytes, and for the JVM, since the JVM does not support direct
707 -- addressing of array components.
709 if not Is_Bit_Packed_Array (Typ1)
710 and then Stg_Unit_Is_Byte
713 -- The call we generate is:
715 -- Compare_Array_xn[_Unaligned]
716 -- (left'address, right'address, left'length, right'length) <op> 0
718 -- x = U for unsigned, S for signed
719 -- n = 8,16,32,64 for component size
720 -- Add _Unaligned if length < 4 and component size is 8.
721 -- <op> is the standard comparison operator
723 if Component_Size (Typ1) = 8 then
724 if Length_Less_Than_4 (Op1)
726 Length_Less_Than_4 (Op2)
728 if Is_Unsigned_Type (Ctyp) then
729 Comp := RE_Compare_Array_U8_Unaligned;
731 Comp := RE_Compare_Array_S8_Unaligned;
735 if Is_Unsigned_Type (Ctyp) then
736 Comp := RE_Compare_Array_U8;
738 Comp := RE_Compare_Array_S8;
742 elsif Component_Size (Typ1) = 16 then
743 if Is_Unsigned_Type (Ctyp) then
744 Comp := RE_Compare_Array_U16;
746 Comp := RE_Compare_Array_S16;
749 elsif Component_Size (Typ1) = 32 then
750 if Is_Unsigned_Type (Ctyp) then
751 Comp := RE_Compare_Array_U32;
753 Comp := RE_Compare_Array_S32;
756 else pragma Assert (Component_Size (Typ1) = 64);
757 if Is_Unsigned_Type (Ctyp) then
758 Comp := RE_Compare_Array_U64;
760 Comp := RE_Compare_Array_S64;
764 Remove_Side_Effects (Op1, Name_Req => True);
765 Remove_Side_Effects (Op2, Name_Req => True);
768 Make_Function_Call (Sloc (Op1),
769 Name => New_Occurrence_Of (RTE (Comp), Loc),
771 Parameter_Associations => New_List (
772 Make_Attribute_Reference (Loc,
773 Prefix => Relocate_Node (Op1),
774 Attribute_Name => Name_Address),
776 Make_Attribute_Reference (Loc,
777 Prefix => Relocate_Node (Op2),
778 Attribute_Name => Name_Address),
780 Make_Attribute_Reference (Loc,
781 Prefix => Relocate_Node (Op1),
782 Attribute_Name => Name_Length),
784 Make_Attribute_Reference (Loc,
785 Prefix => Relocate_Node (Op2),
786 Attribute_Name => Name_Length))));
789 Make_Integer_Literal (Sloc (Op2),
792 Analyze_And_Resolve (Op1, Standard_Integer);
793 Analyze_And_Resolve (Op2, Standard_Integer);
797 -- Cases where we cannot make runtime call
799 -- For (a <= b) we convert to not (a > b)
801 if Chars (N) = Name_Op_Le then
807 Right_Opnd => Op2)));
808 Analyze_And_Resolve (N, Standard_Boolean);
811 -- For < the Boolean expression is
812 -- greater__nn (op2, op1)
814 elsif Chars (N) = Name_Op_Lt then
815 Func_Body := Make_Array_Comparison_Op (Typ1, N);
819 Op1 := Right_Opnd (N);
820 Op2 := Left_Opnd (N);
822 -- For (a >= b) we convert to not (a < b)
824 elsif Chars (N) = Name_Op_Ge then
830 Right_Opnd => Op2)));
831 Analyze_And_Resolve (N, Standard_Boolean);
834 -- For > the Boolean expression is
835 -- greater__nn (op1, op2)
838 pragma Assert (Chars (N) = Name_Op_Gt);
839 Func_Body := Make_Array_Comparison_Op (Typ1, N);
842 Func_Name := Defining_Unit_Name (Specification (Func_Body));
844 Make_Function_Call (Loc,
845 Name => New_Reference_To (Func_Name, Loc),
846 Parameter_Associations => New_List (Op1, Op2));
848 Insert_Action (N, Func_Body);
850 Analyze_And_Resolve (N, Standard_Boolean);
853 when RE_Not_Available =>
855 end Expand_Array_Comparison;
857 ---------------------------
858 -- Expand_Array_Equality --
859 ---------------------------
861 -- Expand an equality function for multi-dimensional arrays. Here is
862 -- an example of such a function for Nb_Dimension = 2
864 -- function Enn (A : arr; B : arr) return boolean is
866 -- if (A'length (1) = 0 or else A'length (2) = 0)
868 -- (B'length (1) = 0 or else B'length (2) = 0)
870 -- return True; -- RM 4.5.2(22)
873 -- if A'length (1) /= B'length (1)
875 -- A'length (2) /= B'length (2)
877 -- return False; -- RM 4.5.2(23)
881 -- A1 : Index_type_1 := A'first (1)
882 -- B1 : Index_Type_1 := B'first (1)
886 -- A2 : Index_type_2 := A'first (2);
887 -- B2 : Index_type_2 := B'first (2)
890 -- if A (A1, A2) /= B (B1, B2) then
894 -- exit when A2 = A'last (2);
895 -- A2 := Index_type2'succ (A2);
896 -- B2 := Index_type2'succ (B2);
900 -- exit when A1 = A'last (1);
901 -- A1 := Index_type1'succ (A1);
902 -- B1 := Index_type1'succ (B1);
909 function Expand_Array_Equality
918 Loc : constant Source_Ptr := Sloc (Nod);
919 Decls : constant List_Id := New_List;
920 Index_List1 : constant List_Id := New_List;
921 Index_List2 : constant List_Id := New_List;
925 Func_Name : Entity_Id;
928 A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA);
929 B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB);
936 -- This builds the attribute reference Arr'Nam (Expr).
938 function Component_Equality (Typ : Entity_Id) return Node_Id;
939 -- Create one statement to compare corresponding components,
940 -- designated by a full set of indices.
942 function Handle_One_Dimension
946 -- This procedure returns a declare block:
949 -- An : Index_Type_n := A'First (n);
950 -- Bn : Index_Type_n := B'First (n);
954 -- exit when An = A'Last (n);
955 -- An := Index_Type_n'Succ (An)
956 -- Bn := Index_Type_n'Succ (Bn)
960 -- where N is the value of "n" in the above code. Index is the
961 -- N'th index node, whose Etype is Index_Type_n in the above code.
962 -- The xxx statement is either the declare block for the next
963 -- dimension or if this is the last dimension the comparison
964 -- of corresponding components of the arrays.
966 -- The actual way the code works is to return the comparison
967 -- of corresponding components for the N+1 call. That's neater!
969 function Test_Empty_Arrays return Node_Id;
970 -- This function constructs the test for both arrays being empty
971 -- (A'length (1) = 0 or else A'length (2) = 0 or else ...)
973 -- (B'length (1) = 0 or else B'length (2) = 0 or else ...)
975 function Test_Lengths_Correspond return Node_Id;
976 -- This function constructs the test for arrays having different
977 -- lengths in at least one index position, in which case resull
979 -- A'length (1) /= B'length (1)
981 -- A'length (2) /= B'length (2)
997 Make_Attribute_Reference (Loc,
998 Attribute_Name => Nam,
999 Prefix => New_Reference_To (Arr, Loc),
1000 Expressions => New_List (Make_Integer_Literal (Loc, Num)));
1003 ------------------------
1004 -- Component_Equality --
1005 ------------------------
1007 function Component_Equality (Typ : Entity_Id) return Node_Id is
1012 -- if a(i1...) /= b(j1...) then return false; end if;
1015 Make_Indexed_Component (Loc,
1016 Prefix => Make_Identifier (Loc, Chars (A)),
1017 Expressions => Index_List1);
1020 Make_Indexed_Component (Loc,
1021 Prefix => Make_Identifier (Loc, Chars (B)),
1022 Expressions => Index_List2);
1024 Test := Expand_Composite_Equality
1025 (Nod, Component_Type (Typ), L, R, Decls);
1028 Make_Implicit_If_Statement (Nod,
1029 Condition => Make_Op_Not (Loc, Right_Opnd => Test),
1030 Then_Statements => New_List (
1031 Make_Return_Statement (Loc,
1032 Expression => New_Occurrence_Of (Standard_False, Loc))));
1033 end Component_Equality;
1035 --------------------------
1036 -- Handle_One_Dimension --
1037 ---------------------------
1039 function Handle_One_Dimension
1044 An : constant Entity_Id := Make_Defining_Identifier (Loc,
1045 Chars => New_Internal_Name ('A'));
1046 Bn : constant Entity_Id := Make_Defining_Identifier (Loc,
1047 Chars => New_Internal_Name ('B'));
1048 Index_Type_n : Entity_Id;
1051 if N > Number_Dimensions (Typ) then
1052 return Component_Equality (Typ);
1055 -- Case where we generate a declare block
1057 Index_Type_n := Base_Type (Etype (Index));
1058 Append (New_Reference_To (An, Loc), Index_List1);
1059 Append (New_Reference_To (Bn, Loc), Index_List2);
1062 Make_Block_Statement (Loc,
1063 Declarations => New_List (
1064 Make_Object_Declaration (Loc,
1065 Defining_Identifier => An,
1066 Object_Definition =>
1067 New_Reference_To (Index_Type_n, Loc),
1068 Expression => Arr_Attr (A, Name_First, N)),
1070 Make_Object_Declaration (Loc,
1071 Defining_Identifier => Bn,
1072 Object_Definition =>
1073 New_Reference_To (Index_Type_n, Loc),
1074 Expression => Arr_Attr (B, Name_First, N))),
1076 Handled_Statement_Sequence =>
1077 Make_Handled_Sequence_Of_Statements (Loc,
1078 Statements => New_List (
1079 Make_Implicit_Loop_Statement (Nod,
1080 Statements => New_List (
1081 Handle_One_Dimension (N + 1, Next_Index (Index)),
1083 Make_Exit_Statement (Loc,
1086 Left_Opnd => New_Reference_To (An, Loc),
1087 Right_Opnd => Arr_Attr (A, Name_Last, N))),
1089 Make_Assignment_Statement (Loc,
1090 Name => New_Reference_To (An, Loc),
1092 Make_Attribute_Reference (Loc,
1094 New_Reference_To (Index_Type_n, Loc),
1095 Attribute_Name => Name_Succ,
1096 Expressions => New_List (
1097 New_Reference_To (An, Loc)))),
1099 Make_Assignment_Statement (Loc,
1100 Name => New_Reference_To (Bn, Loc),
1102 Make_Attribute_Reference (Loc,
1104 New_Reference_To (Index_Type_n, Loc),
1105 Attribute_Name => Name_Succ,
1106 Expressions => New_List (
1107 New_Reference_To (Bn, Loc)))))))));
1108 end Handle_One_Dimension;
1110 -----------------------
1111 -- Test_Empty_Arrays --
1112 -----------------------
1114 function Test_Empty_Arrays return Node_Id is
1124 for J in 1 .. Number_Dimensions (Typ) loop
1127 Left_Opnd => Arr_Attr (A, Name_Length, J),
1128 Right_Opnd => Make_Integer_Literal (Loc, 0));
1132 Left_Opnd => Arr_Attr (B, Name_Length, J),
1133 Right_Opnd => Make_Integer_Literal (Loc, 0));
1142 Left_Opnd => Relocate_Node (Alist),
1143 Right_Opnd => Atest);
1147 Left_Opnd => Relocate_Node (Blist),
1148 Right_Opnd => Btest);
1155 Right_Opnd => Blist);
1156 end Test_Empty_Arrays;
1158 -----------------------------
1159 -- Test_Lengths_Correspond --
1160 -----------------------------
1162 function Test_Lengths_Correspond return Node_Id is
1168 for J in 1 .. Number_Dimensions (Typ) loop
1171 Left_Opnd => Arr_Attr (A, Name_Length, J),
1172 Right_Opnd => Arr_Attr (B, Name_Length, J));
1179 Left_Opnd => Relocate_Node (Result),
1180 Right_Opnd => Rtest);
1185 end Test_Lengths_Correspond;
1187 -- Start of processing for Expand_Array_Equality
1190 Formals := New_List (
1191 Make_Parameter_Specification (Loc,
1192 Defining_Identifier => A,
1193 Parameter_Type => New_Reference_To (Typ, Loc)),
1195 Make_Parameter_Specification (Loc,
1196 Defining_Identifier => B,
1197 Parameter_Type => New_Reference_To (Typ, Loc)));
1199 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('E'));
1201 -- Build statement sequence for function
1204 Make_Subprogram_Body (Loc,
1206 Make_Function_Specification (Loc,
1207 Defining_Unit_Name => Func_Name,
1208 Parameter_Specifications => Formals,
1209 Subtype_Mark => New_Reference_To (Standard_Boolean, Loc)),
1211 Declarations => Decls,
1213 Handled_Statement_Sequence =>
1214 Make_Handled_Sequence_Of_Statements (Loc,
1215 Statements => New_List (
1217 Make_Implicit_If_Statement (Nod,
1218 Condition => Test_Empty_Arrays,
1219 Then_Statements => New_List (
1220 Make_Return_Statement (Loc,
1222 New_Occurrence_Of (Standard_True, Loc)))),
1224 Make_Implicit_If_Statement (Nod,
1225 Condition => Test_Lengths_Correspond,
1226 Then_Statements => New_List (
1227 Make_Return_Statement (Loc,
1229 New_Occurrence_Of (Standard_False, Loc)))),
1231 Handle_One_Dimension (1, First_Index (Typ)),
1233 Make_Return_Statement (Loc,
1234 Expression => New_Occurrence_Of (Standard_True, Loc)))));
1236 Set_Has_Completion (Func_Name, True);
1238 -- If the array type is distinct from the type of the arguments,
1239 -- it is the full view of a private type. Apply an unchecked
1240 -- conversion to insure that analysis of the call succeeds.
1242 if Base_Type (A_Typ) /= Base_Type (Typ) then
1243 Actuals := New_List (
1244 OK_Convert_To (Typ, Lhs),
1245 OK_Convert_To (Typ, Rhs));
1247 Actuals := New_List (Lhs, Rhs);
1250 Append_To (Bodies, Func_Body);
1253 Make_Function_Call (Loc,
1254 Name => New_Reference_To (Func_Name, Loc),
1255 Parameter_Associations => Actuals);
1256 end Expand_Array_Equality;
1258 -----------------------------
1259 -- Expand_Boolean_Operator --
1260 -----------------------------
1262 -- Note that we first get the actual subtypes of the operands,
1263 -- since we always want to deal with types that have bounds.
1265 procedure Expand_Boolean_Operator (N : Node_Id) is
1266 Typ : constant Entity_Id := Etype (N);
1269 if Is_Bit_Packed_Array (Typ) then
1270 Expand_Packed_Boolean_Operator (N);
1273 -- For the normal non-packed case, the general expansion is
1274 -- to build a function for carrying out the comparison (using
1275 -- Make_Boolean_Array_Op) and then inserting it into the tree.
1276 -- The original operator node is then rewritten as a call to
1280 Loc : constant Source_Ptr := Sloc (N);
1281 L : constant Node_Id := Relocate_Node (Left_Opnd (N));
1282 R : constant Node_Id := Relocate_Node (Right_Opnd (N));
1283 Func_Body : Node_Id;
1284 Func_Name : Entity_Id;
1287 Convert_To_Actual_Subtype (L);
1288 Convert_To_Actual_Subtype (R);
1289 Ensure_Defined (Etype (L), N);
1290 Ensure_Defined (Etype (R), N);
1291 Apply_Length_Check (R, Etype (L));
1293 if Nkind (Parent (N)) = N_Assignment_Statement
1294 and then Safe_In_Place_Array_Op (Name (Parent (N)), L, R)
1296 Build_Boolean_Array_Proc_Call (Parent (N), L, R);
1298 elsif Nkind (Parent (N)) = N_Op_Not
1299 and then Nkind (N) = N_Op_And
1301 Safe_In_Place_Array_Op (Name (Parent (Parent (N))), L, R)
1306 Func_Body := Make_Boolean_Array_Op (Etype (L), N);
1307 Func_Name := Defining_Unit_Name (Specification (Func_Body));
1308 Insert_Action (N, Func_Body);
1310 -- Now rewrite the expression with a call
1313 Make_Function_Call (Loc,
1314 Name => New_Reference_To (Func_Name, Loc),
1315 Parameter_Associations =>
1317 (L, Make_Type_Conversion
1318 (Loc, New_Reference_To (Etype (L), Loc), R))));
1320 Analyze_And_Resolve (N, Typ);
1324 end Expand_Boolean_Operator;
1326 -------------------------------
1327 -- Expand_Composite_Equality --
1328 -------------------------------
1330 -- This function is only called for comparing internal fields of composite
1331 -- types when these fields are themselves composites. This is a special
1332 -- case because it is not possible to respect normal Ada visibility rules.
1334 function Expand_Composite_Equality
1342 Loc : constant Source_Ptr := Sloc (Nod);
1343 Full_Type : Entity_Id;
1348 if Is_Private_Type (Typ) then
1349 Full_Type := Underlying_Type (Typ);
1354 -- Defense against malformed private types with no completion
1355 -- the error will be diagnosed later by check_completion
1357 if No (Full_Type) then
1358 return New_Reference_To (Standard_False, Loc);
1361 Full_Type := Base_Type (Full_Type);
1363 if Is_Array_Type (Full_Type) then
1365 -- If the operand is an elementary type other than a floating-point
1366 -- type, then we can simply use the built-in block bitwise equality,
1367 -- since the predefined equality operators always apply and bitwise
1368 -- equality is fine for all these cases.
1370 if Is_Elementary_Type (Component_Type (Full_Type))
1371 and then not Is_Floating_Point_Type (Component_Type (Full_Type))
1373 return Make_Op_Eq (Loc, Left_Opnd => Lhs, Right_Opnd => Rhs);
1375 -- For composite component types, and floating-point types, use
1376 -- the expansion. This deals with tagged component types (where
1377 -- we use the applicable equality routine) and floating-point,
1378 -- (where we need to worry about negative zeroes), and also the
1379 -- case of any composite type recursively containing such fields.
1382 return Expand_Array_Equality
1383 (Nod, Full_Type, Typ, Lhs, Rhs, Bodies);
1386 elsif Is_Tagged_Type (Full_Type) then
1388 -- Call the primitive operation "=" of this type
1390 if Is_Class_Wide_Type (Full_Type) then
1391 Full_Type := Root_Type (Full_Type);
1394 -- If this is derived from an untagged private type completed
1395 -- with a tagged type, it does not have a full view, so we
1396 -- use the primitive operations of the private type.
1397 -- This check should no longer be necessary when these
1398 -- types receive their full views ???
1400 if Is_Private_Type (Typ)
1401 and then not Is_Tagged_Type (Typ)
1402 and then not Is_Controlled (Typ)
1403 and then Is_Derived_Type (Typ)
1404 and then No (Full_View (Typ))
1406 Prim := First_Elmt (Collect_Primitive_Operations (Typ));
1408 Prim := First_Elmt (Primitive_Operations (Full_Type));
1412 Eq_Op := Node (Prim);
1413 exit when Chars (Eq_Op) = Name_Op_Eq
1414 and then Etype (First_Formal (Eq_Op)) =
1415 Etype (Next_Formal (First_Formal (Eq_Op)));
1417 pragma Assert (Present (Prim));
1420 Eq_Op := Node (Prim);
1423 Make_Function_Call (Loc,
1424 Name => New_Reference_To (Eq_Op, Loc),
1425 Parameter_Associations =>
1427 (Unchecked_Convert_To (Etype (First_Formal (Eq_Op)), Lhs),
1428 Unchecked_Convert_To (Etype (First_Formal (Eq_Op)), Rhs)));
1430 elsif Is_Record_Type (Full_Type) then
1431 Eq_Op := TSS (Full_Type, TSS_Composite_Equality);
1433 if Present (Eq_Op) then
1434 if Etype (First_Formal (Eq_Op)) /= Full_Type then
1436 -- Inherited equality from parent type. Convert the actuals
1437 -- to match signature of operation.
1440 T : constant Entity_Id := Etype (First_Formal (Eq_Op));
1444 Make_Function_Call (Loc,
1445 Name => New_Reference_To (Eq_Op, Loc),
1446 Parameter_Associations =>
1447 New_List (OK_Convert_To (T, Lhs),
1448 OK_Convert_To (T, Rhs)));
1453 Make_Function_Call (Loc,
1454 Name => New_Reference_To (Eq_Op, Loc),
1455 Parameter_Associations => New_List (Lhs, Rhs));
1459 return Expand_Record_Equality (Nod, Full_Type, Lhs, Rhs, Bodies);
1463 -- It can be a simple record or the full view of a scalar private
1465 return Make_Op_Eq (Loc, Left_Opnd => Lhs, Right_Opnd => Rhs);
1467 end Expand_Composite_Equality;
1469 ------------------------------
1470 -- Expand_Concatenate_Other --
1471 ------------------------------
1473 -- Let n be the number of array operands to be concatenated, Base_Typ
1474 -- their base type, Ind_Typ their index type, and Arr_Typ the original
1475 -- array type to which the concatenantion operator applies, then the
1476 -- following subprogram is constructed:
1478 -- [function Cnn (S1 : Base_Typ; ...; Sn : Base_Typ) return Base_Typ is
1481 -- if S1'Length /= 0 then
1482 -- L := XXX; --> XXX = S1'First if Arr_Typ is unconstrained
1483 -- XXX = Arr_Typ'First otherwise
1484 -- elsif S2'Length /= 0 then
1485 -- L := YYY; --> YYY = S2'First if Arr_Typ is unconstrained
1486 -- YYY = Arr_Typ'First otherwise
1488 -- elsif Sn-1'Length /= 0 then
1489 -- L := ZZZ; --> ZZZ = Sn-1'First if Arr_Typ is unconstrained
1490 -- ZZZ = Arr_Typ'First otherwise
1498 -- Ind_Typ'Val ((((S1'Length - 1) + S2'Length) + ... + Sn'Length)
1499 -- + Ind_Typ'Pos (L));
1500 -- R : Base_Typ (L .. H);
1502 -- if S1'Length /= 0 then
1506 -- L := Ind_Typ'Succ (L);
1507 -- exit when P = S1'Last;
1508 -- P := Ind_Typ'Succ (P);
1512 -- if S2'Length /= 0 then
1513 -- L := Ind_Typ'Succ (L);
1516 -- L := Ind_Typ'Succ (L);
1517 -- exit when P = S2'Last;
1518 -- P := Ind_Typ'Succ (P);
1524 -- if Sn'Length /= 0 then
1528 -- L := Ind_Typ'Succ (L);
1529 -- exit when P = Sn'Last;
1530 -- P := Ind_Typ'Succ (P);
1538 procedure Expand_Concatenate_Other (Cnode : Node_Id; Opnds : List_Id) is
1539 Loc : constant Source_Ptr := Sloc (Cnode);
1540 Nb_Opnds : constant Nat := List_Length (Opnds);
1542 Arr_Typ : constant Entity_Id := Etype (Entity (Cnode));
1543 Base_Typ : constant Entity_Id := Base_Type (Etype (Cnode));
1544 Ind_Typ : constant Entity_Id := Etype (First_Index (Base_Typ));
1547 Func_Spec : Node_Id;
1548 Param_Specs : List_Id;
1550 Func_Body : Node_Id;
1551 Func_Decls : List_Id;
1552 Func_Stmts : List_Id;
1557 Elsif_List : List_Id;
1559 Declare_Block : Node_Id;
1560 Declare_Decls : List_Id;
1561 Declare_Stmts : List_Id;
1573 function Copy_Into_R_S (I : Nat; Last : Boolean) return List_Id;
1574 -- Builds the sequence of statement:
1578 -- L := Ind_Typ'Succ (L);
1579 -- exit when P = Si'Last;
1580 -- P := Ind_Typ'Succ (P);
1583 -- where i is the input parameter I given.
1584 -- If the flag Last is true, the exit statement is emitted before
1585 -- incrementing the lower bound, to prevent the creation out of
1588 function Init_L (I : Nat) return Node_Id;
1589 -- Builds the statement:
1590 -- L := Arr_Typ'First; If Arr_Typ is constrained
1591 -- L := Si'First; otherwise (where I is the input param given)
1593 function H return Node_Id;
1594 -- Builds reference to identifier H.
1596 function Ind_Val (E : Node_Id) return Node_Id;
1597 -- Builds expression Ind_Typ'Val (E);
1599 function L return Node_Id;
1600 -- Builds reference to identifier L.
1602 function L_Pos return Node_Id;
1603 -- Builds expression Integer_Type'(Ind_Typ'Pos (L)).
1604 -- We qualify the expression to avoid universal_integer computations
1605 -- whenever possible, in the expression for the upper bound H.
1607 function L_Succ return Node_Id;
1608 -- Builds expression Ind_Typ'Succ (L).
1610 function One return Node_Id;
1611 -- Builds integer literal one.
1613 function P return Node_Id;
1614 -- Builds reference to identifier P.
1616 function P_Succ return Node_Id;
1617 -- Builds expression Ind_Typ'Succ (P).
1619 function R return Node_Id;
1620 -- Builds reference to identifier R.
1622 function S (I : Nat) return Node_Id;
1623 -- Builds reference to identifier Si, where I is the value given.
1625 function S_First (I : Nat) return Node_Id;
1626 -- Builds expression Si'First, where I is the value given.
1628 function S_Last (I : Nat) return Node_Id;
1629 -- Builds expression Si'Last, where I is the value given.
1631 function S_Length (I : Nat) return Node_Id;
1632 -- Builds expression Si'Length, where I is the value given.
1634 function S_Length_Test (I : Nat) return Node_Id;
1635 -- Builds expression Si'Length /= 0, where I is the value given.
1641 function Copy_Into_R_S (I : Nat; Last : Boolean) return List_Id is
1642 Stmts : constant List_Id := New_List;
1644 Loop_Stmt : Node_Id;
1646 Exit_Stmt : Node_Id;
1651 -- First construct the initializations
1653 P_Start := Make_Assignment_Statement (Loc,
1655 Expression => S_First (I));
1656 Append_To (Stmts, P_Start);
1658 -- Then build the loop
1660 R_Copy := Make_Assignment_Statement (Loc,
1661 Name => Make_Indexed_Component (Loc,
1663 Expressions => New_List (L)),
1664 Expression => Make_Indexed_Component (Loc,
1666 Expressions => New_List (P)));
1668 L_Inc := Make_Assignment_Statement (Loc,
1670 Expression => L_Succ);
1672 Exit_Stmt := Make_Exit_Statement (Loc,
1673 Condition => Make_Op_Eq (Loc, P, S_Last (I)));
1675 P_Inc := Make_Assignment_Statement (Loc,
1677 Expression => P_Succ);
1681 Make_Implicit_Loop_Statement (Cnode,
1682 Statements => New_List (R_Copy, Exit_Stmt, L_Inc, P_Inc));
1685 Make_Implicit_Loop_Statement (Cnode,
1686 Statements => New_List (R_Copy, L_Inc, Exit_Stmt, P_Inc));
1689 Append_To (Stmts, Loop_Stmt);
1698 function H return Node_Id is
1700 return Make_Identifier (Loc, Name_uH);
1707 function Ind_Val (E : Node_Id) return Node_Id is
1710 Make_Attribute_Reference (Loc,
1711 Prefix => New_Reference_To (Ind_Typ, Loc),
1712 Attribute_Name => Name_Val,
1713 Expressions => New_List (E));
1720 function Init_L (I : Nat) return Node_Id is
1724 if Is_Constrained (Arr_Typ) then
1725 E := Make_Attribute_Reference (Loc,
1726 Prefix => New_Reference_To (Arr_Typ, Loc),
1727 Attribute_Name => Name_First);
1733 return Make_Assignment_Statement (Loc, Name => L, Expression => E);
1740 function L return Node_Id is
1742 return Make_Identifier (Loc, Name_uL);
1749 function L_Pos return Node_Id is
1750 Target_Type : Entity_Id;
1753 -- If the index type is an enumeration type, the computation
1754 -- can be done in standard integer. Otherwise, choose a large
1755 -- enough integer type.
1757 if Is_Enumeration_Type (Ind_Typ)
1758 or else Root_Type (Ind_Typ) = Standard_Integer
1759 or else Root_Type (Ind_Typ) = Standard_Short_Integer
1760 or else Root_Type (Ind_Typ) = Standard_Short_Short_Integer
1762 Target_Type := Standard_Integer;
1764 Target_Type := Root_Type (Ind_Typ);
1768 Make_Qualified_Expression (Loc,
1769 Subtype_Mark => New_Reference_To (Target_Type, Loc),
1771 Make_Attribute_Reference (Loc,
1772 Prefix => New_Reference_To (Ind_Typ, Loc),
1773 Attribute_Name => Name_Pos,
1774 Expressions => New_List (L)));
1781 function L_Succ return Node_Id is
1784 Make_Attribute_Reference (Loc,
1785 Prefix => New_Reference_To (Ind_Typ, Loc),
1786 Attribute_Name => Name_Succ,
1787 Expressions => New_List (L));
1794 function One return Node_Id is
1796 return Make_Integer_Literal (Loc, 1);
1803 function P return Node_Id is
1805 return Make_Identifier (Loc, Name_uP);
1812 function P_Succ return Node_Id is
1815 Make_Attribute_Reference (Loc,
1816 Prefix => New_Reference_To (Ind_Typ, Loc),
1817 Attribute_Name => Name_Succ,
1818 Expressions => New_List (P));
1825 function R return Node_Id is
1827 return Make_Identifier (Loc, Name_uR);
1834 function S (I : Nat) return Node_Id is
1836 return Make_Identifier (Loc, New_External_Name ('S', I));
1843 function S_First (I : Nat) return Node_Id is
1845 return Make_Attribute_Reference (Loc,
1847 Attribute_Name => Name_First);
1854 function S_Last (I : Nat) return Node_Id is
1856 return Make_Attribute_Reference (Loc,
1858 Attribute_Name => Name_Last);
1865 function S_Length (I : Nat) return Node_Id is
1867 return Make_Attribute_Reference (Loc,
1869 Attribute_Name => Name_Length);
1876 function S_Length_Test (I : Nat) return Node_Id is
1880 Left_Opnd => S_Length (I),
1881 Right_Opnd => Make_Integer_Literal (Loc, 0));
1884 -- Start of processing for Expand_Concatenate_Other
1887 -- Construct the parameter specs and the overall function spec
1889 Param_Specs := New_List;
1890 for I in 1 .. Nb_Opnds loop
1893 Make_Parameter_Specification (Loc,
1894 Defining_Identifier =>
1895 Make_Defining_Identifier (Loc, New_External_Name ('S', I)),
1896 Parameter_Type => New_Reference_To (Base_Typ, Loc)));
1899 Func_Id := Make_Defining_Identifier (Loc, New_Internal_Name ('C'));
1901 Make_Function_Specification (Loc,
1902 Defining_Unit_Name => Func_Id,
1903 Parameter_Specifications => Param_Specs,
1904 Subtype_Mark => New_Reference_To (Base_Typ, Loc));
1906 -- Construct L's object declaration
1909 Make_Object_Declaration (Loc,
1910 Defining_Identifier => Make_Defining_Identifier (Loc, Name_uL),
1911 Object_Definition => New_Reference_To (Ind_Typ, Loc));
1913 Func_Decls := New_List (L_Decl);
1915 -- Construct the if-then-elsif statements
1917 Elsif_List := New_List;
1918 for I in 2 .. Nb_Opnds - 1 loop
1919 Append_To (Elsif_List, Make_Elsif_Part (Loc,
1920 Condition => S_Length_Test (I),
1921 Then_Statements => New_List (Init_L (I))));
1925 Make_Implicit_If_Statement (Cnode,
1926 Condition => S_Length_Test (1),
1927 Then_Statements => New_List (Init_L (1)),
1928 Elsif_Parts => Elsif_List,
1929 Else_Statements => New_List (Make_Return_Statement (Loc,
1930 Expression => S (Nb_Opnds))));
1932 -- Construct the declaration for H
1935 Make_Object_Declaration (Loc,
1936 Defining_Identifier => Make_Defining_Identifier (Loc, Name_uP),
1937 Object_Definition => New_Reference_To (Ind_Typ, Loc));
1939 H_Init := Make_Op_Subtract (Loc, S_Length (1), One);
1940 for I in 2 .. Nb_Opnds loop
1941 H_Init := Make_Op_Add (Loc, H_Init, S_Length (I));
1943 H_Init := Ind_Val (Make_Op_Add (Loc, H_Init, L_Pos));
1946 Make_Object_Declaration (Loc,
1947 Defining_Identifier => Make_Defining_Identifier (Loc, Name_uH),
1948 Object_Definition => New_Reference_To (Ind_Typ, Loc),
1949 Expression => H_Init);
1951 -- Construct the declaration for R
1953 R_Range := Make_Range (Loc, Low_Bound => L, High_Bound => H);
1955 Make_Index_Or_Discriminant_Constraint (Loc,
1956 Constraints => New_List (R_Range));
1959 Make_Object_Declaration (Loc,
1960 Defining_Identifier => Make_Defining_Identifier (Loc, Name_uR),
1961 Object_Definition =>
1962 Make_Subtype_Indication (Loc,
1963 Subtype_Mark => New_Reference_To (Base_Typ, Loc),
1964 Constraint => R_Constr));
1966 -- Construct the declarations for the declare block
1968 Declare_Decls := New_List (P_Decl, H_Decl, R_Decl);
1970 -- Construct list of statements for the declare block
1972 Declare_Stmts := New_List;
1973 for I in 1 .. Nb_Opnds loop
1974 Append_To (Declare_Stmts,
1975 Make_Implicit_If_Statement (Cnode,
1976 Condition => S_Length_Test (I),
1977 Then_Statements => Copy_Into_R_S (I, I = Nb_Opnds)));
1980 Append_To (Declare_Stmts, Make_Return_Statement (Loc, Expression => R));
1982 -- Construct the declare block
1984 Declare_Block := Make_Block_Statement (Loc,
1985 Declarations => Declare_Decls,
1986 Handled_Statement_Sequence =>
1987 Make_Handled_Sequence_Of_Statements (Loc, Declare_Stmts));
1989 -- Construct the list of function statements
1991 Func_Stmts := New_List (If_Stmt, Declare_Block);
1993 -- Construct the function body
1996 Make_Subprogram_Body (Loc,
1997 Specification => Func_Spec,
1998 Declarations => Func_Decls,
1999 Handled_Statement_Sequence =>
2000 Make_Handled_Sequence_Of_Statements (Loc, Func_Stmts));
2002 -- Insert the newly generated function in the code. This is analyzed
2003 -- with all checks off, since we have completed all the checks.
2005 -- Note that this does *not* fix the array concatenation bug when the
2006 -- low bound is Integer'first sibce that bug comes from the pointer
2007 -- dereferencing an unconstrained array. An there we need a constraint
2008 -- check to make sure the length of the concatenated array is ok. ???
2010 Insert_Action (Cnode, Func_Body, Suppress => All_Checks);
2012 -- Construct list of arguments for the function call
2015 Operand := First (Opnds);
2016 for I in 1 .. Nb_Opnds loop
2017 Append_To (Params, Relocate_Node (Operand));
2021 -- Insert the function call
2025 Make_Function_Call (Loc, New_Reference_To (Func_Id, Loc), Params));
2027 Analyze_And_Resolve (Cnode, Base_Typ);
2028 Set_Is_Inlined (Func_Id);
2029 end Expand_Concatenate_Other;
2031 -------------------------------
2032 -- Expand_Concatenate_String --
2033 -------------------------------
2035 procedure Expand_Concatenate_String (Cnode : Node_Id; Opnds : List_Id) is
2036 Loc : constant Source_Ptr := Sloc (Cnode);
2037 Opnd1 : constant Node_Id := First (Opnds);
2038 Opnd2 : constant Node_Id := Next (Opnd1);
2039 Typ1 : constant Entity_Id := Base_Type (Etype (Opnd1));
2040 Typ2 : constant Entity_Id := Base_Type (Etype (Opnd2));
2043 -- RE_Id value for function to be called
2046 -- In all cases, we build a call to a routine giving the list of
2047 -- arguments as the parameter list to the routine.
2049 case List_Length (Opnds) is
2051 if Typ1 = Standard_Character then
2052 if Typ2 = Standard_Character then
2053 R := RE_Str_Concat_CC;
2056 pragma Assert (Typ2 = Standard_String);
2057 R := RE_Str_Concat_CS;
2060 elsif Typ1 = Standard_String then
2061 if Typ2 = Standard_Character then
2062 R := RE_Str_Concat_SC;
2065 pragma Assert (Typ2 = Standard_String);
2069 -- If we have anything other than Standard_Character or
2070 -- Standard_String, then we must have had a serious error
2071 -- earlier, so we just abandon the attempt at expansion.
2074 pragma Assert (Serious_Errors_Detected > 0);
2079 R := RE_Str_Concat_3;
2082 R := RE_Str_Concat_4;
2085 R := RE_Str_Concat_5;
2089 raise Program_Error;
2092 -- Now generate the appropriate call
2095 Make_Function_Call (Sloc (Cnode),
2096 Name => New_Occurrence_Of (RTE (R), Loc),
2097 Parameter_Associations => Opnds));
2099 Analyze_And_Resolve (Cnode, Standard_String);
2102 when RE_Not_Available =>
2104 end Expand_Concatenate_String;
2106 ------------------------
2107 -- Expand_N_Allocator --
2108 ------------------------
2110 procedure Expand_N_Allocator (N : Node_Id) is
2111 PtrT : constant Entity_Id := Etype (N);
2113 Loc : constant Source_Ptr := Sloc (N);
2118 -- RM E.2.3(22). We enforce that the expected type of an allocator
2119 -- shall not be a remote access-to-class-wide-limited-private type
2121 -- Why is this being done at expansion time, seems clearly wrong ???
2123 Validate_Remote_Access_To_Class_Wide_Type (N);
2125 -- Set the Storage Pool
2127 Set_Storage_Pool (N, Associated_Storage_Pool (Root_Type (PtrT)));
2129 if Present (Storage_Pool (N)) then
2130 if Is_RTE (Storage_Pool (N), RE_SS_Pool) then
2132 Set_Procedure_To_Call (N, RTE (RE_SS_Allocate));
2135 elsif Is_Class_Wide_Type (Etype (Storage_Pool (N))) then
2136 Set_Procedure_To_Call (N, RTE (RE_Allocate_Any));
2139 Set_Procedure_To_Call (N,
2140 Find_Prim_Op (Etype (Storage_Pool (N)), Name_Allocate));
2144 -- Under certain circumstances we can replace an allocator by an
2145 -- access to statically allocated storage. The conditions, as noted
2146 -- in AARM 3.10 (10c) are as follows:
2148 -- Size and initial value is known at compile time
2149 -- Access type is access-to-constant
2151 -- The allocator is not part of a constraint on a record component,
2152 -- because in that case the inserted actions are delayed until the
2153 -- record declaration is fully analyzed, which is too late for the
2154 -- analysis of the rewritten allocator.
2156 if Is_Access_Constant (PtrT)
2157 and then Nkind (Expression (N)) = N_Qualified_Expression
2158 and then Compile_Time_Known_Value (Expression (Expression (N)))
2159 and then Size_Known_At_Compile_Time (Etype (Expression
2161 and then not Is_Record_Type (Current_Scope)
2163 -- Here we can do the optimization. For the allocator
2167 -- We insert an object declaration
2169 -- Tnn : aliased x := y;
2171 -- and replace the allocator by Tnn'Unrestricted_Access.
2172 -- Tnn is marked as requiring static allocation.
2175 Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
2177 Desig := Subtype_Mark (Expression (N));
2179 -- If context is constrained, use constrained subtype directly,
2180 -- so that the constant is not labelled as having a nomimally
2181 -- unconstrained subtype.
2183 if Entity (Desig) = Base_Type (Designated_Type (PtrT)) then
2184 Desig := New_Occurrence_Of (Designated_Type (PtrT), Loc);
2188 Make_Object_Declaration (Loc,
2189 Defining_Identifier => Temp,
2190 Aliased_Present => True,
2191 Constant_Present => Is_Access_Constant (PtrT),
2192 Object_Definition => Desig,
2193 Expression => Expression (Expression (N))));
2196 Make_Attribute_Reference (Loc,
2197 Prefix => New_Occurrence_Of (Temp, Loc),
2198 Attribute_Name => Name_Unrestricted_Access));
2200 Analyze_And_Resolve (N, PtrT);
2202 -- We set the variable as statically allocated, since we don't
2203 -- want it going on the stack of the current procedure!
2205 Set_Is_Statically_Allocated (Temp);
2209 if Nkind (Expression (N)) = N_Qualified_Expression then
2210 Expand_Allocator_Expression (N);
2212 -- If the allocator is for a type which requires initialization, and
2213 -- there is no initial value (i.e. operand is a subtype indication
2214 -- rather than a qualifed expression), then we must generate a call
2215 -- to the initialization routine. This is done using an expression
2218 -- [Pnnn : constant ptr_T := new (T); Init (Pnnn.all,...); Pnnn]
2220 -- Here ptr_T is the pointer type for the allocator, and T is the
2221 -- subtype of the allocator. A special case arises if the designated
2222 -- type of the access type is a task or contains tasks. In this case
2223 -- the call to Init (Temp.all ...) is replaced by code that ensures
2224 -- that tasks get activated (see Exp_Ch9.Build_Task_Allocate_Block
2225 -- for details). In addition, if the type T is a task T, then the
2226 -- first argument to Init must be converted to the task record type.
2230 T : constant Entity_Id := Entity (Expression (N));
2238 Temp_Decl : Node_Id;
2239 Temp_Type : Entity_Id;
2243 if No_Initialization (N) then
2246 -- Case of no initialization procedure present
2248 elsif not Has_Non_Null_Base_Init_Proc (T) then
2250 -- Case of simple initialization required
2252 if Needs_Simple_Initialization (T) then
2253 Rewrite (Expression (N),
2254 Make_Qualified_Expression (Loc,
2255 Subtype_Mark => New_Occurrence_Of (T, Loc),
2256 Expression => Get_Simple_Init_Val (T, Loc)));
2258 Analyze_And_Resolve (Expression (Expression (N)), T);
2259 Analyze_And_Resolve (Expression (N), T);
2260 Set_Paren_Count (Expression (Expression (N)), 1);
2261 Expand_N_Allocator (N);
2263 -- No initialization required
2269 -- Case of initialization procedure present, must be called
2272 Init := Base_Init_Proc (T);
2275 Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
2277 -- Construct argument list for the initialization routine call
2278 -- The CPP constructor needs the address directly
2280 if Is_CPP_Class (T) then
2281 Arg1 := New_Reference_To (Temp, Loc);
2286 Make_Explicit_Dereference (Loc,
2287 Prefix => New_Reference_To (Temp, Loc));
2288 Set_Assignment_OK (Arg1);
2291 -- The initialization procedure expects a specific type.
2292 -- if the context is access to class wide, indicate that
2293 -- the object being allocated has the right specific type.
2295 if Is_Class_Wide_Type (Designated_Type (PtrT)) then
2296 Arg1 := Unchecked_Convert_To (T, Arg1);
2300 -- If designated type is a concurrent type or if it is a
2301 -- private type whose definition is a concurrent type,
2302 -- the first argument in the Init routine has to be
2303 -- unchecked conversion to the corresponding record type.
2304 -- If the designated type is a derived type, we also
2305 -- convert the argument to its root type.
2307 if Is_Concurrent_Type (T) then
2309 Unchecked_Convert_To (Corresponding_Record_Type (T), Arg1);
2311 elsif Is_Private_Type (T)
2312 and then Present (Full_View (T))
2313 and then Is_Concurrent_Type (Full_View (T))
2316 Unchecked_Convert_To
2317 (Corresponding_Record_Type (Full_View (T)), Arg1);
2319 elsif Etype (First_Formal (Init)) /= Base_Type (T) then
2322 Ftyp : constant Entity_Id := Etype (First_Formal (Init));
2325 Arg1 := OK_Convert_To (Etype (Ftyp), Arg1);
2326 Set_Etype (Arg1, Ftyp);
2330 Args := New_List (Arg1);
2332 -- For the task case, pass the Master_Id of the access type
2333 -- as the value of the _Master parameter, and _Chain as the
2334 -- value of the _Chain parameter (_Chain will be defined as
2335 -- part of the generated code for the allocator).
2337 if Has_Task (T) then
2339 if No (Master_Id (Base_Type (PtrT))) then
2341 -- The designated type was an incomplete type, and
2342 -- the access type did not get expanded. Salvage
2345 Expand_N_Full_Type_Declaration
2346 (Parent (Base_Type (PtrT)));
2349 -- If the context of the allocator is a declaration or
2350 -- an assignment, we can generate a meaningful image for
2351 -- it, even though subsequent assignments might remove
2352 -- the connection between task and entity. We build this
2353 -- image when the left-hand side is a simple variable,
2354 -- a simple indexed assignment or a simple selected
2357 if Nkind (Parent (N)) = N_Assignment_Statement then
2359 Nam : constant Node_Id := Name (Parent (N));
2362 if Is_Entity_Name (Nam) then
2364 Build_Task_Image_Decls (
2367 (Entity (Nam), Sloc (Nam)), T);
2369 elsif (Nkind (Nam) = N_Indexed_Component
2370 or else Nkind (Nam) = N_Selected_Component)
2371 and then Is_Entity_Name (Prefix (Nam))
2374 Build_Task_Image_Decls
2375 (Loc, Nam, Etype (Prefix (Nam)));
2377 Decls := Build_Task_Image_Decls (Loc, T, T);
2381 elsif Nkind (Parent (N)) = N_Object_Declaration then
2383 Build_Task_Image_Decls (
2384 Loc, Defining_Identifier (Parent (N)), T);
2387 Decls := Build_Task_Image_Decls (Loc, T, T);
2392 (Master_Id (Base_Type (Root_Type (PtrT))), Loc));
2393 Append_To (Args, Make_Identifier (Loc, Name_uChain));
2395 Decl := Last (Decls);
2397 New_Occurrence_Of (Defining_Identifier (Decl), Loc));
2399 -- Has_Task is false, Decls not used
2405 -- Add discriminants if discriminated type
2407 if Has_Discriminants (T) then
2408 Discr := First_Elmt (Discriminant_Constraint (T));
2410 while Present (Discr) loop
2411 Append (New_Copy_Tree (Elists.Node (Discr)), Args);
2415 elsif Is_Private_Type (T)
2416 and then Present (Full_View (T))
2417 and then Has_Discriminants (Full_View (T))
2420 First_Elmt (Discriminant_Constraint (Full_View (T)));
2422 while Present (Discr) loop
2423 Append (New_Copy_Tree (Elists.Node (Discr)), Args);
2428 -- We set the allocator as analyzed so that when we analyze the
2429 -- expression actions node, we do not get an unwanted recursive
2430 -- expansion of the allocator expression.
2432 Set_Analyzed (N, True);
2433 Node := Relocate_Node (N);
2435 -- Here is the transformation:
2437 -- output: Temp : constant ptr_T := new T;
2438 -- Init (Temp.all, ...);
2439 -- <CTRL> Attach_To_Final_List (Finalizable (Temp.all));
2440 -- <CTRL> Initialize (Finalizable (Temp.all));
2442 -- Here ptr_T is the pointer type for the allocator, and T
2443 -- is the subtype of the allocator.
2446 Make_Object_Declaration (Loc,
2447 Defining_Identifier => Temp,
2448 Constant_Present => True,
2449 Object_Definition => New_Reference_To (Temp_Type, Loc),
2450 Expression => Node);
2452 Set_Assignment_OK (Temp_Decl);
2454 if Is_CPP_Class (T) then
2455 Set_Aliased_Present (Temp_Decl);
2458 Insert_Action (N, Temp_Decl, Suppress => All_Checks);
2460 -- If the designated type is task type or contains tasks,
2461 -- Create block to activate created tasks, and insert
2462 -- declaration for Task_Image variable ahead of call.
2464 if Has_Task (T) then
2466 L : constant List_Id := New_List;
2470 Build_Task_Allocate_Block (L, Node, Args);
2473 Insert_List_Before (First (Declarations (Blk)), Decls);
2474 Insert_Actions (N, L);
2479 Make_Procedure_Call_Statement (Loc,
2480 Name => New_Reference_To (Init, Loc),
2481 Parameter_Associations => Args));
2484 if Controlled_Type (T) then
2485 Flist := Get_Allocator_Final_List (N, Base_Type (T), PtrT);
2489 Ref => New_Copy_Tree (Arg1),
2492 With_Attach => Make_Integer_Literal (Loc, 2)));
2495 if Is_CPP_Class (T) then
2497 Make_Attribute_Reference (Loc,
2498 Prefix => New_Reference_To (Temp, Loc),
2499 Attribute_Name => Name_Unchecked_Access));
2501 Rewrite (N, New_Reference_To (Temp, Loc));
2504 Analyze_And_Resolve (N, PtrT);
2510 when RE_Not_Available =>
2512 end Expand_N_Allocator;
2514 -----------------------
2515 -- Expand_N_And_Then --
2516 -----------------------
2518 -- Expand into conditional expression if Actions present, and also
2519 -- deal with optimizing case of arguments being True or False.
2521 procedure Expand_N_And_Then (N : Node_Id) is
2522 Loc : constant Source_Ptr := Sloc (N);
2523 Typ : constant Entity_Id := Etype (N);
2524 Left : constant Node_Id := Left_Opnd (N);
2525 Right : constant Node_Id := Right_Opnd (N);
2529 -- Deal with non-standard booleans
2531 if Is_Boolean_Type (Typ) then
2532 Adjust_Condition (Left);
2533 Adjust_Condition (Right);
2534 Set_Etype (N, Standard_Boolean);
2537 -- Check for cases of left argument is True or False
2539 if Nkind (Left) = N_Identifier then
2541 -- If left argument is True, change (True and then Right) to Right.
2542 -- Any actions associated with Right will be executed unconditionally
2543 -- and can thus be inserted into the tree unconditionally.
2545 if Entity (Left) = Standard_True then
2546 if Present (Actions (N)) then
2547 Insert_Actions (N, Actions (N));
2551 Adjust_Result_Type (N, Typ);
2554 -- If left argument is False, change (False and then Right) to
2555 -- False. In this case we can forget the actions associated with
2556 -- Right, since they will never be executed.
2558 elsif Entity (Left) = Standard_False then
2559 Kill_Dead_Code (Right);
2560 Kill_Dead_Code (Actions (N));
2561 Rewrite (N, New_Occurrence_Of (Standard_False, Loc));
2562 Adjust_Result_Type (N, Typ);
2567 -- If Actions are present, we expand
2569 -- left and then right
2573 -- if left then right else false end
2575 -- with the actions becoming the Then_Actions of the conditional
2576 -- expression. This conditional expression is then further expanded
2577 -- (and will eventually disappear)
2579 if Present (Actions (N)) then
2580 Actlist := Actions (N);
2582 Make_Conditional_Expression (Loc,
2583 Expressions => New_List (
2586 New_Occurrence_Of (Standard_False, Loc))));
2588 Set_Then_Actions (N, Actlist);
2589 Analyze_And_Resolve (N, Standard_Boolean);
2590 Adjust_Result_Type (N, Typ);
2594 -- No actions present, check for cases of right argument True/False
2596 if Nkind (Right) = N_Identifier then
2598 -- Change (Left and then True) to Left. Note that we know there
2599 -- are no actions associated with the True operand, since we
2600 -- just checked for this case above.
2602 if Entity (Right) = Standard_True then
2605 -- Change (Left and then False) to False, making sure to preserve
2606 -- any side effects associated with the Left operand.
2608 elsif Entity (Right) = Standard_False then
2609 Remove_Side_Effects (Left);
2611 (N, New_Occurrence_Of (Standard_False, Loc));
2615 Adjust_Result_Type (N, Typ);
2616 end Expand_N_And_Then;
2618 -------------------------------------
2619 -- Expand_N_Conditional_Expression --
2620 -------------------------------------
2622 -- Expand into expression actions if then/else actions present
2624 procedure Expand_N_Conditional_Expression (N : Node_Id) is
2625 Loc : constant Source_Ptr := Sloc (N);
2626 Cond : constant Node_Id := First (Expressions (N));
2627 Thenx : constant Node_Id := Next (Cond);
2628 Elsex : constant Node_Id := Next (Thenx);
2629 Typ : constant Entity_Id := Etype (N);
2634 -- If either then or else actions are present, then given:
2636 -- if cond then then-expr else else-expr end
2638 -- we insert the following sequence of actions (using Insert_Actions):
2643 -- Cnn := then-expr;
2649 -- and replace the conditional expression by a reference to Cnn.
2651 if Present (Then_Actions (N)) or else Present (Else_Actions (N)) then
2652 Cnn := Make_Defining_Identifier (Loc, New_Internal_Name ('C'));
2655 Make_Implicit_If_Statement (N,
2656 Condition => Relocate_Node (Cond),
2658 Then_Statements => New_List (
2659 Make_Assignment_Statement (Sloc (Thenx),
2660 Name => New_Occurrence_Of (Cnn, Sloc (Thenx)),
2661 Expression => Relocate_Node (Thenx))),
2663 Else_Statements => New_List (
2664 Make_Assignment_Statement (Sloc (Elsex),
2665 Name => New_Occurrence_Of (Cnn, Sloc (Elsex)),
2666 Expression => Relocate_Node (Elsex))));
2668 Set_Assignment_OK (Name (First (Then_Statements (New_If))));
2669 Set_Assignment_OK (Name (First (Else_Statements (New_If))));
2671 if Present (Then_Actions (N)) then
2673 (First (Then_Statements (New_If)), Then_Actions (N));
2676 if Present (Else_Actions (N)) then
2678 (First (Else_Statements (New_If)), Else_Actions (N));
2681 Rewrite (N, New_Occurrence_Of (Cnn, Loc));
2684 Make_Object_Declaration (Loc,
2685 Defining_Identifier => Cnn,
2686 Object_Definition => New_Occurrence_Of (Typ, Loc)));
2688 Insert_Action (N, New_If);
2689 Analyze_And_Resolve (N, Typ);
2691 end Expand_N_Conditional_Expression;
2693 -----------------------------------
2694 -- Expand_N_Explicit_Dereference --
2695 -----------------------------------
2697 procedure Expand_N_Explicit_Dereference (N : Node_Id) is
2699 -- The only processing required is an insertion of an explicit
2700 -- dereference call for the checked storage pool case.
2702 Insert_Dereference_Action (Prefix (N));
2703 end Expand_N_Explicit_Dereference;
2709 procedure Expand_N_In (N : Node_Id) is
2710 Loc : constant Source_Ptr := Sloc (N);
2711 Rtyp : constant Entity_Id := Etype (N);
2712 Lop : constant Node_Id := Left_Opnd (N);
2713 Rop : constant Node_Id := Right_Opnd (N);
2716 -- If we have an explicit range, do a bit of optimization based
2717 -- on range analysis (we may be able to kill one or both checks).
2719 if Nkind (Rop) = N_Range then
2721 Lcheck : constant Compare_Result :=
2722 Compile_Time_Compare (Lop, Low_Bound (Rop));
2723 Ucheck : constant Compare_Result :=
2724 Compile_Time_Compare (Lop, High_Bound (Rop));
2727 -- If either check is known to fail, replace result
2728 -- by False, since the other check does not matter.
2730 if Lcheck = LT or else Ucheck = GT then
2732 New_Reference_To (Standard_False, Loc));
2733 Analyze_And_Resolve (N, Rtyp);
2736 -- If both checks are known to succeed, replace result
2737 -- by True, since we know we are in range.
2739 elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then
2741 New_Reference_To (Standard_True, Loc));
2742 Analyze_And_Resolve (N, Rtyp);
2745 -- If lower bound check succeeds and upper bound check is
2746 -- not known to succeed or fail, then replace the range check
2747 -- with a comparison against the upper bound.
2749 elsif Lcheck in Compare_GE then
2753 Right_Opnd => High_Bound (Rop)));
2754 Analyze_And_Resolve (N, Rtyp);
2757 -- If upper bound check succeeds and lower bound check is
2758 -- not known to succeed or fail, then replace the range check
2759 -- with a comparison against the lower bound.
2761 elsif Ucheck in Compare_LE then
2765 Right_Opnd => Low_Bound (Rop)));
2766 Analyze_And_Resolve (N, Rtyp);
2771 -- For all other cases of an explicit range, nothing to be done
2775 -- Here right operand is a subtype mark
2779 Typ : Entity_Id := Etype (Rop);
2780 Is_Acc : constant Boolean := Is_Access_Type (Typ);
2781 Obj : Node_Id := Lop;
2782 Cond : Node_Id := Empty;
2785 Remove_Side_Effects (Obj);
2787 -- For tagged type, do tagged membership operation
2789 if Is_Tagged_Type (Typ) then
2791 -- No expansion will be performed when Java_VM, as the
2792 -- JVM back end will handle the membership tests directly
2793 -- (tags are not explicitly represented in Java objects,
2794 -- so the normal tagged membership expansion is not what
2798 Rewrite (N, Tagged_Membership (N));
2799 Analyze_And_Resolve (N, Rtyp);
2804 -- If type is scalar type, rewrite as x in t'first .. t'last
2805 -- This reason we do this is that the bounds may have the wrong
2806 -- type if they come from the original type definition.
2808 elsif Is_Scalar_Type (Typ) then
2812 Make_Attribute_Reference (Loc,
2813 Attribute_Name => Name_First,
2814 Prefix => New_Reference_To (Typ, Loc)),
2817 Make_Attribute_Reference (Loc,
2818 Attribute_Name => Name_Last,
2819 Prefix => New_Reference_To (Typ, Loc))));
2820 Analyze_And_Resolve (N, Rtyp);
2824 -- Here we have a non-scalar type
2827 Typ := Designated_Type (Typ);
2830 if not Is_Constrained (Typ) then
2832 New_Reference_To (Standard_True, Loc));
2833 Analyze_And_Resolve (N, Rtyp);
2835 -- For the constrained array case, we have to check the
2836 -- subscripts for an exact match if the lengths are
2837 -- non-zero (the lengths must match in any case).
2839 elsif Is_Array_Type (Typ) then
2841 Check_Subscripts : declare
2842 function Construct_Attribute_Reference
2847 -- Build attribute reference E'Nam(Dim)
2849 -----------------------------------
2850 -- Construct_Attribute_Reference --
2851 -----------------------------------
2853 function Construct_Attribute_Reference
2861 Make_Attribute_Reference (Loc,
2863 Attribute_Name => Nam,
2864 Expressions => New_List (
2865 Make_Integer_Literal (Loc, Dim)));
2866 end Construct_Attribute_Reference;
2868 -- Start processing for Check_Subscripts
2871 for J in 1 .. Number_Dimensions (Typ) loop
2872 Evolve_And_Then (Cond,
2875 Construct_Attribute_Reference
2876 (Duplicate_Subexpr_No_Checks (Obj),
2879 Construct_Attribute_Reference
2880 (New_Occurrence_Of (Typ, Loc), Name_First, J)));
2882 Evolve_And_Then (Cond,
2885 Construct_Attribute_Reference
2886 (Duplicate_Subexpr_No_Checks (Obj),
2889 Construct_Attribute_Reference
2890 (New_Occurrence_Of (Typ, Loc), Name_Last, J)));
2899 Right_Opnd => Make_Null (Loc)),
2900 Right_Opnd => Cond);
2904 Analyze_And_Resolve (N, Rtyp);
2905 end Check_Subscripts;
2907 -- These are the cases where constraint checks may be
2908 -- required, e.g. records with possible discriminants
2911 -- Expand the test into a series of discriminant comparisons.
2912 -- The expression that is built is the negation of the one
2913 -- that is used for checking discriminant constraints.
2915 Obj := Relocate_Node (Left_Opnd (N));
2917 if Has_Discriminants (Typ) then
2918 Cond := Make_Op_Not (Loc,
2919 Right_Opnd => Build_Discriminant_Checks (Obj, Typ));
2922 Cond := Make_Or_Else (Loc,
2926 Right_Opnd => Make_Null (Loc)),
2927 Right_Opnd => Cond);
2931 Cond := New_Occurrence_Of (Standard_True, Loc);
2935 Analyze_And_Resolve (N, Rtyp);
2941 --------------------------------
2942 -- Expand_N_Indexed_Component --
2943 --------------------------------
2945 procedure Expand_N_Indexed_Component (N : Node_Id) is
2946 Loc : constant Source_Ptr := Sloc (N);
2947 Typ : constant Entity_Id := Etype (N);
2948 P : constant Node_Id := Prefix (N);
2949 T : constant Entity_Id := Etype (P);
2952 -- A special optimization, if we have an indexed component that
2953 -- is selecting from a slice, then we can eliminate the slice,
2954 -- since, for example, x (i .. j)(k) is identical to x(k). The
2955 -- only difference is the range check required by the slice. The
2956 -- range check for the slice itself has already been generated.
2957 -- The range check for the subscripting operation is ensured
2958 -- by converting the subject to the subtype of the slice.
2960 -- This optimization not only generates better code, avoiding
2961 -- slice messing especially in the packed case, but more importantly
2962 -- bypasses some problems in handling this peculiar case, for
2963 -- example, the issue of dealing specially with object renamings.
2965 if Nkind (P) = N_Slice then
2967 Make_Indexed_Component (Loc,
2968 Prefix => Prefix (P),
2969 Expressions => New_List (
2971 (Etype (First_Index (Etype (P))),
2972 First (Expressions (N))))));
2973 Analyze_And_Resolve (N, Typ);
2977 -- If the prefix is an access type, then we unconditionally rewrite
2978 -- if as an explicit deference. This simplifies processing for several
2979 -- cases, including packed array cases and certain cases in which
2980 -- checks must be generated. We used to try to do this only when it
2981 -- was necessary, but it cleans up the code to do it all the time.
2983 if Is_Access_Type (T) then
2985 -- Check whether the prefix comes from a debug pool, and generate
2986 -- the check before rewriting.
2988 Insert_Dereference_Action (P);
2991 Make_Explicit_Dereference (Sloc (N),
2992 Prefix => Relocate_Node (P)));
2993 Analyze_And_Resolve (P, Designated_Type (T));
2996 -- Generate index and validity checks
2998 Generate_Index_Checks (N);
3000 if Validity_Checks_On and then Validity_Check_Subscripts then
3001 Apply_Subscript_Validity_Checks (N);
3004 -- All done for the non-packed case
3006 if not Is_Packed (Etype (Prefix (N))) then
3010 -- For packed arrays that are not bit-packed (i.e. the case of an array
3011 -- with one or more index types with a non-coniguous enumeration type),
3012 -- we can always use the normal packed element get circuit.
3014 if not Is_Bit_Packed_Array (Etype (Prefix (N))) then
3015 Expand_Packed_Element_Reference (N);
3019 -- For a reference to a component of a bit packed array, we have to
3020 -- convert it to a reference to the corresponding Packed_Array_Type.
3021 -- We only want to do this for simple references, and not for:
3023 -- Left side of assignment, or prefix of left side of assignment,
3024 -- or prefix of the prefix, to handle packed arrays of packed arrays,
3025 -- This case is handled in Exp_Ch5.Expand_N_Assignment_Statement
3027 -- Renaming objects in renaming associations
3028 -- This case is handled when a use of the renamed variable occurs
3030 -- Actual parameters for a procedure call
3031 -- This case is handled in Exp_Ch6.Expand_Actuals
3033 -- The second expression in a 'Read attribute reference
3035 -- The prefix of an address or size attribute reference
3037 -- The following circuit detects these exceptions
3040 Child : Node_Id := N;
3041 Parnt : Node_Id := Parent (N);
3045 if Nkind (Parnt) = N_Unchecked_Expression then
3048 elsif Nkind (Parnt) = N_Object_Renaming_Declaration
3049 or else Nkind (Parnt) = N_Procedure_Call_Statement
3050 or else (Nkind (Parnt) = N_Parameter_Association
3052 Nkind (Parent (Parnt)) = N_Procedure_Call_Statement)
3056 elsif Nkind (Parnt) = N_Attribute_Reference
3057 and then (Attribute_Name (Parnt) = Name_Address
3059 Attribute_Name (Parnt) = Name_Size)
3060 and then Prefix (Parnt) = Child
3064 elsif Nkind (Parnt) = N_Assignment_Statement
3065 and then Name (Parnt) = Child
3069 -- If the expression is an index of an indexed component,
3070 -- it must be expanded regardless of context.
3072 elsif Nkind (Parnt) = N_Indexed_Component
3073 and then Child /= Prefix (Parnt)
3075 Expand_Packed_Element_Reference (N);
3078 elsif Nkind (Parent (Parnt)) = N_Assignment_Statement
3079 and then Name (Parent (Parnt)) = Parnt
3083 elsif Nkind (Parnt) = N_Attribute_Reference
3084 and then Attribute_Name (Parnt) = Name_Read
3085 and then Next (First (Expressions (Parnt))) = Child
3089 elsif (Nkind (Parnt) = N_Indexed_Component
3090 or else Nkind (Parnt) = N_Selected_Component)
3091 and then Prefix (Parnt) = Child
3096 Expand_Packed_Element_Reference (N);
3100 -- Keep looking up tree for unchecked expression, or if we are
3101 -- the prefix of a possible assignment left side.
3104 Parnt := Parent (Child);
3108 end Expand_N_Indexed_Component;
3110 ---------------------
3111 -- Expand_N_Not_In --
3112 ---------------------
3114 -- Replace a not in b by not (a in b) so that the expansions for (a in b)
3115 -- can be done. This avoids needing to duplicate this expansion code.
3117 procedure Expand_N_Not_In (N : Node_Id) is
3118 Loc : constant Source_Ptr := Sloc (N);
3119 Typ : constant Entity_Id := Etype (N);
3126 Left_Opnd => Left_Opnd (N),
3127 Right_Opnd => Right_Opnd (N))));
3128 Analyze_And_Resolve (N, Typ);
3129 end Expand_N_Not_In;
3135 -- The only replacement required is for the case of a null of type
3136 -- that is an access to protected subprogram. We represent such
3137 -- access values as a record, and so we must replace the occurrence
3138 -- of null by the equivalent record (with a null address and a null
3139 -- pointer in it), so that the backend creates the proper value.
3141 procedure Expand_N_Null (N : Node_Id) is
3142 Loc : constant Source_Ptr := Sloc (N);
3143 Typ : constant Entity_Id := Etype (N);
3147 if Ekind (Typ) = E_Access_Protected_Subprogram_Type then
3149 Make_Aggregate (Loc,
3150 Expressions => New_List (
3151 New_Occurrence_Of (RTE (RE_Null_Address), Loc),
3155 Analyze_And_Resolve (N, Equivalent_Type (Typ));
3157 -- For subsequent semantic analysis, the node must retain its
3158 -- type. Gigi in any case replaces this type by the corresponding
3159 -- record type before processing the node.
3165 when RE_Not_Available =>
3169 ---------------------
3170 -- Expand_N_Op_Abs --
3171 ---------------------
3173 procedure Expand_N_Op_Abs (N : Node_Id) is
3174 Loc : constant Source_Ptr := Sloc (N);
3175 Expr : constant Node_Id := Right_Opnd (N);
3178 Unary_Op_Validity_Checks (N);
3180 -- Deal with software overflow checking
3182 if not Backend_Overflow_Checks_On_Target
3183 and then Is_Signed_Integer_Type (Etype (N))
3184 and then Do_Overflow_Check (N)
3186 -- The only case to worry about is when the argument is
3187 -- equal to the largest negative number, so what we do is
3188 -- to insert the check:
3190 -- [constraint_error when Expr = typ'Base'First]
3192 -- with the usual Duplicate_Subexpr use coding for expr
3195 Make_Raise_Constraint_Error (Loc,
3198 Left_Opnd => Duplicate_Subexpr (Expr),
3200 Make_Attribute_Reference (Loc,
3202 New_Occurrence_Of (Base_Type (Etype (Expr)), Loc),
3203 Attribute_Name => Name_First)),
3204 Reason => CE_Overflow_Check_Failed));
3207 -- Vax floating-point types case
3209 if Vax_Float (Etype (N)) then
3210 Expand_Vax_Arith (N);
3212 end Expand_N_Op_Abs;
3214 ---------------------
3215 -- Expand_N_Op_Add --
3216 ---------------------
3218 procedure Expand_N_Op_Add (N : Node_Id) is
3219 Typ : constant Entity_Id := Etype (N);
3222 Binary_Op_Validity_Checks (N);
3224 -- N + 0 = 0 + N = N for integer types
3226 if Is_Integer_Type (Typ) then
3227 if Compile_Time_Known_Value (Right_Opnd (N))
3228 and then Expr_Value (Right_Opnd (N)) = Uint_0
3230 Rewrite (N, Left_Opnd (N));
3233 elsif Compile_Time_Known_Value (Left_Opnd (N))
3234 and then Expr_Value (Left_Opnd (N)) = Uint_0
3236 Rewrite (N, Right_Opnd (N));
3241 -- Arithmetic overflow checks for signed integer/fixed point types
3243 if Is_Signed_Integer_Type (Typ)
3244 or else Is_Fixed_Point_Type (Typ)
3246 Apply_Arithmetic_Overflow_Check (N);
3249 -- Vax floating-point types case
3251 elsif Vax_Float (Typ) then
3252 Expand_Vax_Arith (N);
3254 end Expand_N_Op_Add;
3256 ---------------------
3257 -- Expand_N_Op_And --
3258 ---------------------
3260 procedure Expand_N_Op_And (N : Node_Id) is
3261 Typ : constant Entity_Id := Etype (N);
3264 Binary_Op_Validity_Checks (N);
3266 if Is_Array_Type (Etype (N)) then
3267 Expand_Boolean_Operator (N);
3269 elsif Is_Boolean_Type (Etype (N)) then
3270 Adjust_Condition (Left_Opnd (N));
3271 Adjust_Condition (Right_Opnd (N));
3272 Set_Etype (N, Standard_Boolean);
3273 Adjust_Result_Type (N, Typ);
3275 end Expand_N_Op_And;
3277 ------------------------
3278 -- Expand_N_Op_Concat --
3279 ------------------------
3281 Max_Available_String_Operands : Int := -1;
3282 -- This is initialized the first time this routine is called. It records
3283 -- a value of 0,2,3,4,5 depending on what Str_Concat_n procedures are
3284 -- available in the run-time:
3287 -- 2 RE_Str_Concat available, RE_Str_Concat_3 not available
3288 -- 3 RE_Str_Concat/Concat_2 available, RE_Str_Concat_4 not available
3289 -- 4 RE_Str_Concat/Concat_2/3 available, RE_Str_Concat_5 not available
3290 -- 5 All routines including RE_Str_Concat_5 available
3292 Char_Concat_Available : Boolean;
3293 -- Records if the routines RE_Str_Concat_CC/CS/SC are available. True if
3294 -- all three are available, False if any one of these is unavailable.
3296 procedure Expand_N_Op_Concat (N : Node_Id) is
3299 -- List of operands to be concatenated
3302 -- Single operand for concatenation
3305 -- Node which is to be replaced by the result of concatenating
3306 -- the nodes in the list Opnds.
3309 -- Array type of concatenation result type
3312 -- Component type of concatenation represented by Cnode
3315 -- Initialize global variables showing run-time status
3317 if Max_Available_String_Operands < 1 then
3318 if not RTE_Available (RE_Str_Concat) then
3319 Max_Available_String_Operands := 0;
3320 elsif not RTE_Available (RE_Str_Concat_3) then
3321 Max_Available_String_Operands := 2;
3322 elsif not RTE_Available (RE_Str_Concat_4) then
3323 Max_Available_String_Operands := 3;
3324 elsif not RTE_Available (RE_Str_Concat_5) then
3325 Max_Available_String_Operands := 4;
3327 Max_Available_String_Operands := 5;
3330 Char_Concat_Available :=
3331 RTE_Available (RE_Str_Concat_CC)
3333 RTE_Available (RE_Str_Concat_CS)
3335 RTE_Available (RE_Str_Concat_SC);
3338 -- Ensure validity of both operands
3340 Binary_Op_Validity_Checks (N);
3342 -- If we are the left operand of a concatenation higher up the
3343 -- tree, then do nothing for now, since we want to deal with a
3344 -- series of concatenations as a unit.
3346 if Nkind (Parent (N)) = N_Op_Concat
3347 and then N = Left_Opnd (Parent (N))
3352 -- We get here with a concatenation whose left operand may be a
3353 -- concatenation itself with a consistent type. We need to process
3354 -- these concatenation operands from left to right, which means
3355 -- from the deepest node in the tree to the highest node.
3358 while Nkind (Left_Opnd (Cnode)) = N_Op_Concat loop
3359 Cnode := Left_Opnd (Cnode);
3362 -- Now Opnd is the deepest Opnd, and its parents are the concatenation
3363 -- nodes above, so now we process bottom up, doing the operations. We
3364 -- gather a string that is as long as possible up to five operands
3366 -- The outer loop runs more than once if there are more than five
3367 -- concatenations of type Standard.String, the most we handle for
3368 -- this case, or if more than one concatenation type is involved.
3371 Opnds := New_List (Left_Opnd (Cnode), Right_Opnd (Cnode));
3372 Set_Parent (Opnds, N);
3374 -- The inner loop gathers concatenation operands. We gather any
3375 -- number of these in the non-string case, or if no concatenation
3376 -- routines are available for string (since in that case we will
3377 -- treat string like any other non-string case). Otherwise we only
3378 -- gather as many operands as can be handled by the available
3379 -- procedures in the run-time library (normally 5, but may be
3380 -- less for the configurable run-time case).
3382 Inner : while Cnode /= N
3383 and then (Base_Type (Etype (Cnode)) /= Standard_String
3385 Max_Available_String_Operands = 0
3387 List_Length (Opnds) <
3388 Max_Available_String_Operands)
3389 and then Base_Type (Etype (Cnode)) =
3390 Base_Type (Etype (Parent (Cnode)))
3392 Cnode := Parent (Cnode);
3393 Append (Right_Opnd (Cnode), Opnds);
3396 -- Here we process the collected operands. First we convert
3397 -- singleton operands to singleton aggregates. This is skipped
3398 -- however for the case of two operands of type String, since
3399 -- we have special routines for these cases.
3401 Atyp := Base_Type (Etype (Cnode));
3402 Ctyp := Base_Type (Component_Type (Etype (Cnode)));
3404 if (List_Length (Opnds) > 2 or else Atyp /= Standard_String)
3405 or else not Char_Concat_Available
3407 Opnd := First (Opnds);
3409 if Base_Type (Etype (Opnd)) = Ctyp then
3411 Make_Aggregate (Sloc (Cnode),
3412 Expressions => New_List (Relocate_Node (Opnd))));
3413 Analyze_And_Resolve (Opnd, Atyp);
3417 exit when No (Opnd);
3421 -- Now call appropriate continuation routine
3423 if Atyp = Standard_String
3424 and then Max_Available_String_Operands > 0
3426 Expand_Concatenate_String (Cnode, Opnds);
3428 Expand_Concatenate_Other (Cnode, Opnds);
3431 exit Outer when Cnode = N;
3432 Cnode := Parent (Cnode);
3434 end Expand_N_Op_Concat;
3436 ------------------------
3437 -- Expand_N_Op_Divide --
3438 ------------------------
3440 procedure Expand_N_Op_Divide (N : Node_Id) is
3441 Loc : constant Source_Ptr := Sloc (N);
3442 Ltyp : constant Entity_Id := Etype (Left_Opnd (N));
3443 Rtyp : constant Entity_Id := Etype (Right_Opnd (N));
3444 Typ : Entity_Id := Etype (N);
3447 Binary_Op_Validity_Checks (N);
3449 -- Vax_Float is a special case
3451 if Vax_Float (Typ) then
3452 Expand_Vax_Arith (N);
3456 -- N / 1 = N for integer types
3458 if Is_Integer_Type (Typ)
3459 and then Compile_Time_Known_Value (Right_Opnd (N))
3460 and then Expr_Value (Right_Opnd (N)) = Uint_1
3462 Rewrite (N, Left_Opnd (N));
3466 -- Convert x / 2 ** y to Shift_Right (x, y). Note that the fact that
3467 -- Is_Power_Of_2_For_Shift is set means that we know that our left
3468 -- operand is an unsigned integer, as required for this to work.
3470 if Nkind (Right_Opnd (N)) = N_Op_Expon
3471 and then Is_Power_Of_2_For_Shift (Right_Opnd (N))
3473 -- We cannot do this transformation in configurable run time mode if we
3474 -- have 64-bit -- integers and long shifts are not available.
3478 or else Support_Long_Shifts_On_Target)
3481 Make_Op_Shift_Right (Loc,
3482 Left_Opnd => Left_Opnd (N),
3484 Convert_To (Standard_Natural, Right_Opnd (Right_Opnd (N)))));
3485 Analyze_And_Resolve (N, Typ);
3489 -- Do required fixup of universal fixed operation
3491 if Typ = Universal_Fixed then
3492 Fixup_Universal_Fixed_Operation (N);
3496 -- Divisions with fixed-point results
3498 if Is_Fixed_Point_Type (Typ) then
3500 -- No special processing if Treat_Fixed_As_Integer is set,
3501 -- since from a semantic point of view such operations are
3502 -- simply integer operations and will be treated that way.
3504 if not Treat_Fixed_As_Integer (N) then
3505 if Is_Integer_Type (Rtyp) then
3506 Expand_Divide_Fixed_By_Integer_Giving_Fixed (N);
3508 Expand_Divide_Fixed_By_Fixed_Giving_Fixed (N);
3512 -- Other cases of division of fixed-point operands. Again we
3513 -- exclude the case where Treat_Fixed_As_Integer is set.
3515 elsif (Is_Fixed_Point_Type (Ltyp) or else
3516 Is_Fixed_Point_Type (Rtyp))
3517 and then not Treat_Fixed_As_Integer (N)
3519 if Is_Integer_Type (Typ) then
3520 Expand_Divide_Fixed_By_Fixed_Giving_Integer (N);
3522 pragma Assert (Is_Floating_Point_Type (Typ));
3523 Expand_Divide_Fixed_By_Fixed_Giving_Float (N);
3526 -- Mixed-mode operations can appear in a non-static universal
3527 -- context, in which case the integer argument must be converted
3530 elsif Typ = Universal_Real
3531 and then Is_Integer_Type (Rtyp)
3533 Rewrite (Right_Opnd (N),
3534 Convert_To (Universal_Real, Relocate_Node (Right_Opnd (N))));
3536 Analyze_And_Resolve (Right_Opnd (N), Universal_Real);
3538 elsif Typ = Universal_Real
3539 and then Is_Integer_Type (Ltyp)
3541 Rewrite (Left_Opnd (N),
3542 Convert_To (Universal_Real, Relocate_Node (Left_Opnd (N))));
3544 Analyze_And_Resolve (Left_Opnd (N), Universal_Real);
3546 -- Non-fixed point cases, do zero divide and overflow checks
3548 elsif Is_Integer_Type (Typ) then
3549 Apply_Divide_Check (N);
3551 -- Check for 64-bit division available
3553 if Esize (Ltyp) > 32
3554 and then not Support_64_Bit_Divides_On_Target
3556 Error_Msg_CRT ("64-bit division", N);
3559 end Expand_N_Op_Divide;
3561 --------------------
3562 -- Expand_N_Op_Eq --
3563 --------------------
3565 procedure Expand_N_Op_Eq (N : Node_Id) is
3566 Loc : constant Source_Ptr := Sloc (N);
3567 Typ : constant Entity_Id := Etype (N);
3568 Lhs : constant Node_Id := Left_Opnd (N);
3569 Rhs : constant Node_Id := Right_Opnd (N);
3570 Bodies : constant List_Id := New_List;
3571 A_Typ : constant Entity_Id := Etype (Lhs);
3573 Typl : Entity_Id := A_Typ;
3574 Op_Name : Entity_Id;
3577 procedure Build_Equality_Call (Eq : Entity_Id);
3578 -- If a constructed equality exists for the type or for its parent,
3579 -- build and analyze call, adding conversions if the operation is
3582 -------------------------
3583 -- Build_Equality_Call --
3584 -------------------------
3586 procedure Build_Equality_Call (Eq : Entity_Id) is
3587 Op_Type : constant Entity_Id := Etype (First_Formal (Eq));
3588 L_Exp : Node_Id := Relocate_Node (Lhs);
3589 R_Exp : Node_Id := Relocate_Node (Rhs);
3592 if Base_Type (Op_Type) /= Base_Type (A_Typ)
3593 and then not Is_Class_Wide_Type (A_Typ)
3595 L_Exp := OK_Convert_To (Op_Type, L_Exp);
3596 R_Exp := OK_Convert_To (Op_Type, R_Exp);
3600 Make_Function_Call (Loc,
3601 Name => New_Reference_To (Eq, Loc),
3602 Parameter_Associations => New_List (L_Exp, R_Exp)));
3604 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
3605 end Build_Equality_Call;
3607 -- Start of processing for Expand_N_Op_Eq
3610 Binary_Op_Validity_Checks (N);
3612 if Ekind (Typl) = E_Private_Type then
3613 Typl := Underlying_Type (Typl);
3615 elsif Ekind (Typl) = E_Private_Subtype then
3616 Typl := Underlying_Type (Base_Type (Typl));
3619 -- It may happen in error situations that the underlying type is not
3620 -- set. The error will be detected later, here we just defend the
3627 Typl := Base_Type (Typl);
3631 if Vax_Float (Typl) then
3632 Expand_Vax_Comparison (N);
3635 -- Boolean types (requiring handling of non-standard case)
3637 elsif Is_Boolean_Type (Typl) then
3638 Adjust_Condition (Left_Opnd (N));
3639 Adjust_Condition (Right_Opnd (N));
3640 Set_Etype (N, Standard_Boolean);
3641 Adjust_Result_Type (N, Typ);
3645 elsif Is_Array_Type (Typl) then
3647 -- If we are doing full validity checking, then expand out array
3648 -- comparisons to make sure that we check the array elements.
3650 if Validity_Check_Operands then
3652 Save_Force_Validity_Checks : constant Boolean :=
3653 Force_Validity_Checks;
3655 Force_Validity_Checks := True;
3657 Expand_Array_Equality (N, Typl, A_Typ,
3658 Relocate_Node (Lhs), Relocate_Node (Rhs), Bodies));
3660 Insert_Actions (N, Bodies);
3661 Analyze_And_Resolve (N, Standard_Boolean);
3662 Force_Validity_Checks := Save_Force_Validity_Checks;
3667 elsif Is_Bit_Packed_Array (Typl) then
3668 Expand_Packed_Eq (N);
3670 -- For non-floating-point elementary types, the primitive equality
3671 -- always applies, and block-bit comparison is fine. Floating-point
3672 -- is an exception because of negative zeroes.
3674 elsif Is_Elementary_Type (Component_Type (Typl))
3675 and then not Is_Floating_Point_Type (Component_Type (Typl))
3676 and then Support_Composite_Compare_On_Target
3680 -- For composite and floating-point cases, expand equality loop
3681 -- to make sure of using proper comparisons for tagged types,
3682 -- and correctly handling the floating-point case.
3686 Expand_Array_Equality (N, Typl, A_Typ,
3687 Relocate_Node (Lhs), Relocate_Node (Rhs), Bodies));
3689 Insert_Actions (N, Bodies, Suppress => All_Checks);
3690 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
3695 elsif Is_Record_Type (Typl) then
3697 -- For tagged types, use the primitive "="
3699 if Is_Tagged_Type (Typl) then
3701 -- If this is derived from an untagged private type completed
3702 -- with a tagged type, it does not have a full view, so we
3703 -- use the primitive operations of the private type.
3704 -- This check should no longer be necessary when these
3705 -- types receive their full views ???
3707 if Is_Private_Type (A_Typ)
3708 and then not Is_Tagged_Type (A_Typ)
3709 and then Is_Derived_Type (A_Typ)
3710 and then No (Full_View (A_Typ))
3712 Prim := First_Elmt (Collect_Primitive_Operations (A_Typ));
3714 while Chars (Node (Prim)) /= Name_Op_Eq loop
3716 pragma Assert (Present (Prim));
3719 Op_Name := Node (Prim);
3721 -- Find the type's predefined equality or an overriding
3722 -- user-defined equality. The reason for not simply calling
3723 -- Find_Prim_Op here is that there may be a user-defined
3724 -- overloaded equality op that precedes the equality that
3725 -- we want, so we have to explicitly search (e.g., there
3726 -- could be an equality with two different parameter types).
3729 if Is_Class_Wide_Type (Typl) then
3730 Typl := Root_Type (Typl);
3733 Prim := First_Elmt (Primitive_Operations (Typl));
3735 while Present (Prim) loop
3736 exit when Chars (Node (Prim)) = Name_Op_Eq
3737 and then Etype (First_Formal (Node (Prim))) =
3738 Etype (Next_Formal (First_Formal (Node (Prim))))
3740 Base_Type (Etype (Node (Prim))) = Standard_Boolean;
3743 pragma Assert (Present (Prim));
3746 Op_Name := Node (Prim);
3749 Build_Equality_Call (Op_Name);
3751 -- If a type support function is present (for complex cases), use it
3753 elsif Present (TSS (Root_Type (Typl), TSS_Composite_Equality)) then
3755 (TSS (Root_Type (Typl), TSS_Composite_Equality));
3757 -- Otherwise expand the component by component equality. Note that
3758 -- we never use block-bit coparisons for records, because of the
3759 -- problems with gaps. The backend will often be able to recombine
3760 -- the separate comparisons that we generate here.
3763 Remove_Side_Effects (Lhs);
3764 Remove_Side_Effects (Rhs);
3766 Expand_Record_Equality (N, Typl, Lhs, Rhs, Bodies));
3768 Insert_Actions (N, Bodies, Suppress => All_Checks);
3769 Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks);
3773 -- If we still have an equality comparison (i.e. it was not rewritten
3774 -- in some way), then we can test if result is needed at compile time).
3776 if Nkind (N) = N_Op_Eq then
3777 Rewrite_Comparison (N);
3781 -----------------------
3782 -- Expand_N_Op_Expon --
3783 -----------------------
3785 procedure Expand_N_Op_Expon (N : Node_Id) is
3786 Loc : constant Source_Ptr := Sloc (N);
3787 Typ : constant Entity_Id := Etype (N);
3788 Rtyp : constant Entity_Id := Root_Type (Typ);
3789 Base : constant Node_Id := Relocate_Node (Left_Opnd (N));
3790 Bastyp : constant Node_Id := Etype (Base);
3791 Exp : constant Node_Id := Relocate_Node (Right_Opnd (N));
3792 Exptyp : constant Entity_Id := Etype (Exp);
3793 Ovflo : constant Boolean := Do_Overflow_Check (N);
3802 Binary_Op_Validity_Checks (N);
3804 -- If either operand is of a private type, then we have the use of
3805 -- an intrinsic operator, and we get rid of the privateness, by using
3806 -- root types of underlying types for the actual operation. Otherwise
3807 -- the private types will cause trouble if we expand multiplications
3808 -- or shifts etc. We also do this transformation if the result type
3809 -- is different from the base type.
3811 if Is_Private_Type (Etype (Base))
3813 Is_Private_Type (Typ)
3815 Is_Private_Type (Exptyp)
3817 Rtyp /= Root_Type (Bastyp)
3820 Bt : constant Entity_Id := Root_Type (Underlying_Type (Bastyp));
3821 Et : constant Entity_Id := Root_Type (Underlying_Type (Exptyp));
3825 Unchecked_Convert_To (Typ,
3827 Left_Opnd => Unchecked_Convert_To (Bt, Base),
3828 Right_Opnd => Unchecked_Convert_To (Et, Exp))));
3829 Analyze_And_Resolve (N, Typ);
3834 -- Test for case of known right argument
3836 if Compile_Time_Known_Value (Exp) then
3837 Expv := Expr_Value (Exp);
3839 -- We only fold small non-negative exponents. You might think we
3840 -- could fold small negative exponents for the real case, but we
3841 -- can't because we are required to raise Constraint_Error for
3842 -- the case of 0.0 ** (negative) even if Machine_Overflows = False.
3843 -- See ACVC test C4A012B.
3845 if Expv >= 0 and then Expv <= 4 then
3847 -- X ** 0 = 1 (or 1.0)
3850 if Ekind (Typ) in Integer_Kind then
3851 Xnode := Make_Integer_Literal (Loc, Intval => 1);
3853 Xnode := Make_Real_Literal (Loc, Ureal_1);
3865 Make_Op_Multiply (Loc,
3866 Left_Opnd => Duplicate_Subexpr (Base),
3867 Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
3869 -- X ** 3 = X * X * X
3873 Make_Op_Multiply (Loc,
3875 Make_Op_Multiply (Loc,
3876 Left_Opnd => Duplicate_Subexpr (Base),
3877 Right_Opnd => Duplicate_Subexpr_No_Checks (Base)),
3878 Right_Opnd => Duplicate_Subexpr_No_Checks (Base));
3881 -- En : constant base'type := base * base;
3887 Make_Defining_Identifier (Loc, New_Internal_Name ('E'));
3889 Insert_Actions (N, New_List (
3890 Make_Object_Declaration (Loc,
3891 Defining_Identifier => Temp,
3892 Constant_Present => True,
3893 Object_Definition => New_Reference_To (Typ, Loc),
3895 Make_Op_Multiply (Loc,
3896 Left_Opnd => Duplicate_Subexpr (Base),
3897 Right_Opnd => Duplicate_Subexpr_No_Checks (Base)))));
3900 Make_Op_Multiply (Loc,
3901 Left_Opnd => New_Reference_To (Temp, Loc),
3902 Right_Opnd => New_Reference_To (Temp, Loc));
3906 Analyze_And_Resolve (N, Typ);
3911 -- Case of (2 ** expression) appearing as an argument of an integer
3912 -- multiplication, or as the right argument of a division of a non-
3913 -- negative integer. In such cases we leave the node untouched, setting
3914 -- the flag Is_Natural_Power_Of_2_for_Shift set, then the expansion
3915 -- of the higher level node converts it into a shift.
3917 if Nkind (Base) = N_Integer_Literal
3918 and then Intval (Base) = 2
3919 and then Is_Integer_Type (Root_Type (Exptyp))
3920 and then Esize (Root_Type (Exptyp)) <= Esize (Standard_Integer)
3921 and then Is_Unsigned_Type (Exptyp)
3923 and then Nkind (Parent (N)) in N_Binary_Op
3926 P : constant Node_Id := Parent (N);
3927 L : constant Node_Id := Left_Opnd (P);
3928 R : constant Node_Id := Right_Opnd (P);
3931 if (Nkind (P) = N_Op_Multiply
3933 ((Is_Integer_Type (Etype (L)) and then R = N)
3935 (Is_Integer_Type (Etype (R)) and then L = N))
3936 and then not Do_Overflow_Check (P))
3939 (Nkind (P) = N_Op_Divide
3940 and then Is_Integer_Type (Etype (L))
3941 and then Is_Unsigned_Type (Etype (L))
3943 and then not Do_Overflow_Check (P))
3945 Set_Is_Power_Of_2_For_Shift (N);
3951 -- Fall through if exponentiation must be done using a runtime routine
3953 -- First deal with modular case
3955 if Is_Modular_Integer_Type (Rtyp) then
3957 -- Non-binary case, we call the special exponentiation routine for
3958 -- the non-binary case, converting the argument to Long_Long_Integer
3959 -- and passing the modulus value. Then the result is converted back
3960 -- to the base type.
3962 if Non_Binary_Modulus (Rtyp) then
3965 Make_Function_Call (Loc,
3966 Name => New_Reference_To (RTE (RE_Exp_Modular), Loc),
3967 Parameter_Associations => New_List (
3968 Convert_To (Standard_Integer, Base),
3969 Make_Integer_Literal (Loc, Modulus (Rtyp)),
3972 -- Binary case, in this case, we call one of two routines, either
3973 -- the unsigned integer case, or the unsigned long long integer
3974 -- case, with a final "and" operation to do the required mod.
3977 if UI_To_Int (Esize (Rtyp)) <= Standard_Integer_Size then
3978 Ent := RTE (RE_Exp_Unsigned);
3980 Ent := RTE (RE_Exp_Long_Long_Unsigned);
3987 Make_Function_Call (Loc,
3988 Name => New_Reference_To (Ent, Loc),
3989 Parameter_Associations => New_List (
3990 Convert_To (Etype (First_Formal (Ent)), Base),
3993 Make_Integer_Literal (Loc, Modulus (Rtyp) - 1))));
3997 -- Common exit point for modular type case
3999 Analyze_And_Resolve (N, Typ);
4002 -- Signed integer cases, done using either Integer or Long_Long_Integer.
4003 -- It is not worth having routines for Short_[Short_]Integer, since for
4004 -- most machines it would not help, and it would generate more code that
4005 -- might need certification in the HI-E case.
4007 -- In the integer cases, we have two routines, one for when overflow
4008 -- checks are required, and one when they are not required, since
4009 -- there is a real gain in ommitting checks on many machines.
4011 elsif Rtyp = Base_Type (Standard_Long_Long_Integer)
4012 or else (Rtyp = Base_Type (Standard_Long_Integer)
4014 Esize (Standard_Long_Integer) > Esize (Standard_Integer))
4015 or else (Rtyp = Universal_Integer)
4017 Etyp := Standard_Long_Long_Integer;
4020 Rent := RE_Exp_Long_Long_Integer;
4022 Rent := RE_Exn_Long_Long_Integer;
4025 elsif Is_Signed_Integer_Type (Rtyp) then
4026 Etyp := Standard_Integer;
4029 Rent := RE_Exp_Integer;
4031 Rent := RE_Exn_Integer;
4034 -- Floating-point cases, always done using Long_Long_Float. We do not
4035 -- need separate routines for the overflow case here, since in the case
4036 -- of floating-point, we generate infinities anyway as a rule (either
4037 -- that or we automatically trap overflow), and if there is an infinity
4038 -- generated and a range check is required, the check will fail anyway.
4041 pragma Assert (Is_Floating_Point_Type (Rtyp));
4042 Etyp := Standard_Long_Long_Float;
4043 Rent := RE_Exn_Long_Long_Float;
4046 -- Common processing for integer cases and floating-point cases.
4047 -- If we are in the right type, we can call runtime routine directly
4050 and then Rtyp /= Universal_Integer
4051 and then Rtyp /= Universal_Real
4054 Make_Function_Call (Loc,
4055 Name => New_Reference_To (RTE (Rent), Loc),
4056 Parameter_Associations => New_List (Base, Exp)));
4058 -- Otherwise we have to introduce conversions (conversions are also
4059 -- required in the universal cases, since the runtime routine is
4060 -- typed using one of the standard types.
4065 Make_Function_Call (Loc,
4066 Name => New_Reference_To (RTE (Rent), Loc),
4067 Parameter_Associations => New_List (
4068 Convert_To (Etyp, Base),
4072 Analyze_And_Resolve (N, Typ);
4076 when RE_Not_Available =>
4078 end Expand_N_Op_Expon;
4080 --------------------
4081 -- Expand_N_Op_Ge --
4082 --------------------
4084 procedure Expand_N_Op_Ge (N : Node_Id) is
4085 Typ : constant Entity_Id := Etype (N);
4086 Op1 : constant Node_Id := Left_Opnd (N);
4087 Op2 : constant Node_Id := Right_Opnd (N);
4088 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
4091 Binary_Op_Validity_Checks (N);
4093 if Vax_Float (Typ1) then
4094 Expand_Vax_Comparison (N);
4097 elsif Is_Array_Type (Typ1) then
4098 Expand_Array_Comparison (N);
4102 if Is_Boolean_Type (Typ1) then
4103 Adjust_Condition (Op1);
4104 Adjust_Condition (Op2);
4105 Set_Etype (N, Standard_Boolean);
4106 Adjust_Result_Type (N, Typ);
4109 Rewrite_Comparison (N);
4112 --------------------
4113 -- Expand_N_Op_Gt --
4114 --------------------
4116 procedure Expand_N_Op_Gt (N : Node_Id) is
4117 Typ : constant Entity_Id := Etype (N);
4118 Op1 : constant Node_Id := Left_Opnd (N);
4119 Op2 : constant Node_Id := Right_Opnd (N);
4120 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
4123 Binary_Op_Validity_Checks (N);
4125 if Vax_Float (Typ1) then
4126 Expand_Vax_Comparison (N);
4129 elsif Is_Array_Type (Typ1) then
4130 Expand_Array_Comparison (N);
4134 if Is_Boolean_Type (Typ1) then
4135 Adjust_Condition (Op1);
4136 Adjust_Condition (Op2);
4137 Set_Etype (N, Standard_Boolean);
4138 Adjust_Result_Type (N, Typ);
4141 Rewrite_Comparison (N);
4144 --------------------
4145 -- Expand_N_Op_Le --
4146 --------------------
4148 procedure Expand_N_Op_Le (N : Node_Id) is
4149 Typ : constant Entity_Id := Etype (N);
4150 Op1 : constant Node_Id := Left_Opnd (N);
4151 Op2 : constant Node_Id := Right_Opnd (N);
4152 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
4155 Binary_Op_Validity_Checks (N);
4157 if Vax_Float (Typ1) then
4158 Expand_Vax_Comparison (N);
4161 elsif Is_Array_Type (Typ1) then
4162 Expand_Array_Comparison (N);
4166 if Is_Boolean_Type (Typ1) then
4167 Adjust_Condition (Op1);
4168 Adjust_Condition (Op2);
4169 Set_Etype (N, Standard_Boolean);
4170 Adjust_Result_Type (N, Typ);
4173 Rewrite_Comparison (N);
4176 --------------------
4177 -- Expand_N_Op_Lt --
4178 --------------------
4180 procedure Expand_N_Op_Lt (N : Node_Id) is
4181 Typ : constant Entity_Id := Etype (N);
4182 Op1 : constant Node_Id := Left_Opnd (N);
4183 Op2 : constant Node_Id := Right_Opnd (N);
4184 Typ1 : constant Entity_Id := Base_Type (Etype (Op1));
4187 Binary_Op_Validity_Checks (N);
4189 if Vax_Float (Typ1) then
4190 Expand_Vax_Comparison (N);
4193 elsif Is_Array_Type (Typ1) then
4194 Expand_Array_Comparison (N);
4198 if Is_Boolean_Type (Typ1) then
4199 Adjust_Condition (Op1);
4200 Adjust_Condition (Op2);
4201 Set_Etype (N, Standard_Boolean);
4202 Adjust_Result_Type (N, Typ);
4205 Rewrite_Comparison (N);
4208 -----------------------
4209 -- Expand_N_Op_Minus --
4210 -----------------------
4212 procedure Expand_N_Op_Minus (N : Node_Id) is
4213 Loc : constant Source_Ptr := Sloc (N);
4214 Typ : constant Entity_Id := Etype (N);
4217 Unary_Op_Validity_Checks (N);
4219 if not Backend_Overflow_Checks_On_Target
4220 and then Is_Signed_Integer_Type (Etype (N))
4221 and then Do_Overflow_Check (N)
4223 -- Software overflow checking expands -expr into (0 - expr)
4226 Make_Op_Subtract (Loc,
4227 Left_Opnd => Make_Integer_Literal (Loc, 0),
4228 Right_Opnd => Right_Opnd (N)));
4230 Analyze_And_Resolve (N, Typ);
4232 -- Vax floating-point types case
4234 elsif Vax_Float (Etype (N)) then
4235 Expand_Vax_Arith (N);
4237 end Expand_N_Op_Minus;
4239 ---------------------
4240 -- Expand_N_Op_Mod --
4241 ---------------------
4243 procedure Expand_N_Op_Mod (N : Node_Id) is
4244 Loc : constant Source_Ptr := Sloc (N);
4245 Typ : constant Entity_Id := Etype (N);
4246 Left : constant Node_Id := Left_Opnd (N);
4247 Right : constant Node_Id := Right_Opnd (N);
4248 DOC : constant Boolean := Do_Overflow_Check (N);
4249 DDC : constant Boolean := Do_Division_Check (N);
4260 Binary_Op_Validity_Checks (N);
4262 Determine_Range (Right, ROK, Rlo, Rhi);
4263 Determine_Range (Left, LOK, Llo, Lhi);
4265 -- Convert mod to rem if operands are known non-negative. We do this
4266 -- since it is quite likely that this will improve the quality of code,
4267 -- (the operation now corresponds to the hardware remainder), and it
4268 -- does not seem likely that it could be harmful.
4270 if LOK and then Llo >= 0
4272 ROK and then Rlo >= 0
4275 Make_Op_Rem (Sloc (N),
4276 Left_Opnd => Left_Opnd (N),
4277 Right_Opnd => Right_Opnd (N)));
4279 -- Instead of reanalyzing the node we do the analysis manually.
4280 -- This avoids anomalies when the replacement is done in an
4281 -- instance and is epsilon more efficient.
4283 Set_Entity (N, Standard_Entity (S_Op_Rem));
4285 Set_Do_Overflow_Check (N, DOC);
4286 Set_Do_Division_Check (N, DDC);
4287 Expand_N_Op_Rem (N);
4290 -- Otherwise, normal mod processing
4293 if Is_Integer_Type (Etype (N)) then
4294 Apply_Divide_Check (N);
4297 -- Apply optimization x mod 1 = 0. We don't really need that with
4298 -- gcc, but it is useful with other back ends (e.g. AAMP), and is
4299 -- certainly harmless.
4301 if Is_Integer_Type (Etype (N))
4302 and then Compile_Time_Known_Value (Right)
4303 and then Expr_Value (Right) = Uint_1
4305 Rewrite (N, Make_Integer_Literal (Loc, 0));
4306 Analyze_And_Resolve (N, Typ);
4310 -- Deal with annoying case of largest negative number remainder
4311 -- minus one. Gigi does not handle this case correctly, because
4312 -- it generates a divide instruction which may trap in this case.
4314 -- In fact the check is quite easy, if the right operand is -1,
4315 -- then the mod value is always 0, and we can just ignore the
4316 -- left operand completely in this case.
4318 -- The operand type may be private (e.g. in the expansion of an
4319 -- an intrinsic operation) so we must use the underlying type to
4320 -- get the bounds, and convert the literals explicitly.
4324 (Type_Low_Bound (Base_Type (Underlying_Type (Etype (Left)))));
4326 if ((not ROK) or else (Rlo <= (-1) and then (-1) <= Rhi))
4328 ((not LOK) or else (Llo = LLB))
4331 Make_Conditional_Expression (Loc,
4332 Expressions => New_List (
4334 Left_Opnd => Duplicate_Subexpr (Right),
4336 Unchecked_Convert_To (Typ,
4337 Make_Integer_Literal (Loc, -1))),
4338 Unchecked_Convert_To (Typ,
4339 Make_Integer_Literal (Loc, Uint_0)),
4340 Relocate_Node (N))));
4342 Set_Analyzed (Next (Next (First (Expressions (N)))));
4343 Analyze_And_Resolve (N, Typ);
4346 end Expand_N_Op_Mod;
4348 --------------------------
4349 -- Expand_N_Op_Multiply --
4350 --------------------------
4352 procedure Expand_N_Op_Multiply (N : Node_Id) is
4353 Loc : constant Source_Ptr := Sloc (N);
4354 Lop : constant Node_Id := Left_Opnd (N);
4355 Rop : constant Node_Id := Right_Opnd (N);
4357 Lp2 : constant Boolean :=
4358 Nkind (Lop) = N_Op_Expon
4359 and then Is_Power_Of_2_For_Shift (Lop);
4361 Rp2 : constant Boolean :=
4362 Nkind (Rop) = N_Op_Expon
4363 and then Is_Power_Of_2_For_Shift (Rop);
4365 Ltyp : constant Entity_Id := Etype (Lop);
4366 Rtyp : constant Entity_Id := Etype (Rop);
4367 Typ : Entity_Id := Etype (N);
4370 Binary_Op_Validity_Checks (N);
4372 -- Special optimizations for integer types
4374 if Is_Integer_Type (Typ) then
4376 -- N * 0 = 0 * N = 0 for integer types
4378 if (Compile_Time_Known_Value (Rop)
4379 and then Expr_Value (Rop) = Uint_0)
4381 (Compile_Time_Known_Value (Lop)
4382 and then Expr_Value (Lop) = Uint_0)
4384 Rewrite (N, Make_Integer_Literal (Loc, Uint_0));
4385 Analyze_And_Resolve (N, Typ);
4389 -- N * 1 = 1 * N = N for integer types
4391 -- This optimisation is not done if we are going to
4392 -- rewrite the product 1 * 2 ** N to a shift.
4394 if Compile_Time_Known_Value (Rop)
4395 and then Expr_Value (Rop) = Uint_1
4401 elsif Compile_Time_Known_Value (Lop)
4402 and then Expr_Value (Lop) = Uint_1
4410 -- Deal with VAX float case
4412 if Vax_Float (Typ) then
4413 Expand_Vax_Arith (N);
4417 -- Convert x * 2 ** y to Shift_Left (x, y). Note that the fact that
4418 -- Is_Power_Of_2_For_Shift is set means that we know that our left
4419 -- operand is an integer, as required for this to work.
4424 -- Convert 2 ** A * 2 ** B into 2 ** (A + B)
4428 Left_Opnd => Make_Integer_Literal (Loc, 2),
4431 Left_Opnd => Right_Opnd (Lop),
4432 Right_Opnd => Right_Opnd (Rop))));
4433 Analyze_And_Resolve (N, Typ);
4438 Make_Op_Shift_Left (Loc,
4441 Convert_To (Standard_Natural, Right_Opnd (Rop))));
4442 Analyze_And_Resolve (N, Typ);
4446 -- Same processing for the operands the other way round
4450 Make_Op_Shift_Left (Loc,
4453 Convert_To (Standard_Natural, Right_Opnd (Lop))));
4454 Analyze_And_Resolve (N, Typ);
4458 -- Do required fixup of universal fixed operation
4460 if Typ = Universal_Fixed then
4461 Fixup_Universal_Fixed_Operation (N);
4465 -- Multiplications with fixed-point results
4467 if Is_Fixed_Point_Type (Typ) then
4469 -- No special processing if Treat_Fixed_As_Integer is set,
4470 -- since from a semantic point of view such operations are
4471 -- simply integer operations and will be treated that way.
4473 if not Treat_Fixed_As_Integer (N) then
4475 -- Case of fixed * integer => fixed
4477 if Is_Integer_Type (Rtyp) then
4478 Expand_Multiply_Fixed_By_Integer_Giving_Fixed (N);
4480 -- Case of integer * fixed => fixed
4482 elsif Is_Integer_Type (Ltyp) then
4483 Expand_Multiply_Integer_By_Fixed_Giving_Fixed (N);
4485 -- Case of fixed * fixed => fixed
4488 Expand_Multiply_Fixed_By_Fixed_Giving_Fixed (N);
4492 -- Other cases of multiplication of fixed-point operands. Again
4493 -- we exclude the cases where Treat_Fixed_As_Integer flag is set.
4495 elsif (Is_Fixed_Point_Type (Ltyp) or else Is_Fixed_Point_Type (Rtyp))
4496 and then not Treat_Fixed_As_Integer (N)
4498 if Is_Integer_Type (Typ) then
4499 Expand_Multiply_Fixed_By_Fixed_Giving_Integer (N);
4501 pragma Assert (Is_Floating_Point_Type (Typ));
4502 Expand_Multiply_Fixed_By_Fixed_Giving_Float (N);
4505 -- Mixed-mode operations can appear in a non-static universal
4506 -- context, in which case the integer argument must be converted
4509 elsif Typ = Universal_Real
4510 and then Is_Integer_Type (Rtyp)
4512 Rewrite (Rop, Convert_To (Universal_Real, Relocate_Node (Rop)));
4514 Analyze_And_Resolve (Rop, Universal_Real);
4516 elsif Typ = Universal_Real
4517 and then Is_Integer_Type (Ltyp)
4519 Rewrite (Lop, Convert_To (Universal_Real, Relocate_Node (Lop)));
4521 Analyze_And_Resolve (Lop, Universal_Real);
4523 -- Non-fixed point cases, check software overflow checking required
4525 elsif Is_Signed_Integer_Type (Etype (N)) then
4526 Apply_Arithmetic_Overflow_Check (N);
4528 end Expand_N_Op_Multiply;
4530 --------------------
4531 -- Expand_N_Op_Ne --
4532 --------------------
4534 -- Rewrite node as the negation of an equality operation, and reanalyze.
4535 -- The equality to be used is defined in the same scope and has the same
4536 -- signature. It must be set explicitly because in an instance it may not
4537 -- have the same visibility as in the generic unit.
4539 procedure Expand_N_Op_Ne (N : Node_Id) is
4540 Loc : constant Source_Ptr := Sloc (N);
4542 Ne : constant Entity_Id := Entity (N);
4545 Binary_Op_Validity_Checks (N);
4551 Left_Opnd => Left_Opnd (N),
4552 Right_Opnd => Right_Opnd (N)));
4553 Set_Paren_Count (Right_Opnd (Neg), 1);
4555 if Scope (Ne) /= Standard_Standard then
4556 Set_Entity (Right_Opnd (Neg), Corresponding_Equality (Ne));
4559 -- For navigation purposes, the inequality is treated as an implicit
4560 -- reference to the corresponding equality. Preserve the Comes_From_
4561 -- source flag so that the proper Xref entry is generated.
4563 Preserve_Comes_From_Source (Neg, N);
4564 Preserve_Comes_From_Source (Right_Opnd (Neg), N);
4566 Analyze_And_Resolve (N, Standard_Boolean);
4569 ---------------------
4570 -- Expand_N_Op_Not --
4571 ---------------------
4573 -- If the argument is other than a Boolean array type, there is no
4574 -- special expansion required.
4576 -- For the packed case, we call the special routine in Exp_Pakd, except
4577 -- that if the component size is greater than one, we use the standard
4578 -- routine generating a gruesome loop (it is so peculiar to have packed
4579 -- arrays with non-standard Boolean representations anyway, so it does
4580 -- not matter that we do not handle this case efficiently).
4582 -- For the unpacked case (and for the special packed case where we have
4583 -- non standard Booleans, as discussed above), we generate and insert
4584 -- into the tree the following function definition:
4586 -- function Nnnn (A : arr) is
4589 -- for J in a'range loop
4590 -- B (J) := not A (J);
4595 -- Here arr is the actual subtype of the parameter (and hence always
4596 -- constrained). Then we replace the not with a call to this function.
4598 procedure Expand_N_Op_Not (N : Node_Id) is
4599 Loc : constant Source_Ptr := Sloc (N);
4600 Typ : constant Entity_Id := Etype (N);
4609 Func_Name : Entity_Id;
4610 Loop_Statement : Node_Id;
4613 Unary_Op_Validity_Checks (N);
4615 -- For boolean operand, deal with non-standard booleans
4617 if Is_Boolean_Type (Typ) then
4618 Adjust_Condition (Right_Opnd (N));
4619 Set_Etype (N, Standard_Boolean);
4620 Adjust_Result_Type (N, Typ);
4624 -- Only array types need any other processing
4626 if not Is_Array_Type (Typ) then
4630 -- Case of array operand. If bit packed, handle it in Exp_Pakd
4632 if Is_Bit_Packed_Array (Typ) and then Component_Size (Typ) = 1 then
4633 Expand_Packed_Not (N);
4637 -- Case of array operand which is not bit-packed. If the context is
4638 -- a safe assignment, call in-place operation, If context is a larger
4639 -- boolean expression in the context of a safe assignment, expansion is
4640 -- done by enclosing operation.
4642 Opnd := Relocate_Node (Right_Opnd (N));
4643 Convert_To_Actual_Subtype (Opnd);
4644 Arr := Etype (Opnd);
4645 Ensure_Defined (Arr, N);
4647 if Nkind (Parent (N)) = N_Assignment_Statement then
4648 if Safe_In_Place_Array_Op (Name (Parent (N)), N, Empty) then
4649 Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
4652 -- Special case the negation of a binary operation.
4654 elsif (Nkind (Opnd) = N_Op_And
4655 or else Nkind (Opnd) = N_Op_Or
4656 or else Nkind (Opnd) = N_Op_Xor)
4657 and then Safe_In_Place_Array_Op
4658 (Name (Parent (N)), Left_Opnd (Opnd), Right_Opnd (Opnd))
4660 Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty);
4664 elsif Nkind (Parent (N)) in N_Binary_Op
4665 and then Nkind (Parent (Parent (N))) = N_Assignment_Statement
4668 Op1 : constant Node_Id := Left_Opnd (Parent (N));
4669 Op2 : constant Node_Id := Right_Opnd (Parent (N));
4670 Lhs : constant Node_Id := Name (Parent (Parent (N)));
4673 if Safe_In_Place_Array_Op (Lhs, Op1, Op2) then
4675 and then Nkind (Op2) = N_Op_Not
4677 -- (not A) op (not B) can be reduced to a single call.
4682 and then Nkind (Parent (N)) = N_Op_Xor
4684 -- A xor (not B) can also be special-cased.
4692 A := Make_Defining_Identifier (Loc, Name_uA);
4693 B := Make_Defining_Identifier (Loc, Name_uB);
4694 J := Make_Defining_Identifier (Loc, Name_uJ);
4697 Make_Indexed_Component (Loc,
4698 Prefix => New_Reference_To (A, Loc),
4699 Expressions => New_List (New_Reference_To (J, Loc)));
4702 Make_Indexed_Component (Loc,
4703 Prefix => New_Reference_To (B, Loc),
4704 Expressions => New_List (New_Reference_To (J, Loc)));
4707 Make_Implicit_Loop_Statement (N,
4708 Identifier => Empty,
4711 Make_Iteration_Scheme (Loc,
4712 Loop_Parameter_Specification =>
4713 Make_Loop_Parameter_Specification (Loc,
4714 Defining_Identifier => J,
4715 Discrete_Subtype_Definition =>
4716 Make_Attribute_Reference (Loc,
4717 Prefix => Make_Identifier (Loc, Chars (A)),
4718 Attribute_Name => Name_Range))),
4720 Statements => New_List (
4721 Make_Assignment_Statement (Loc,
4723 Expression => Make_Op_Not (Loc, A_J))));
4725 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('N'));
4726 Set_Is_Inlined (Func_Name);
4729 Make_Subprogram_Body (Loc,
4731 Make_Function_Specification (Loc,
4732 Defining_Unit_Name => Func_Name,
4733 Parameter_Specifications => New_List (
4734 Make_Parameter_Specification (Loc,
4735 Defining_Identifier => A,
4736 Parameter_Type => New_Reference_To (Typ, Loc))),
4737 Subtype_Mark => New_Reference_To (Typ, Loc)),
4739 Declarations => New_List (
4740 Make_Object_Declaration (Loc,
4741 Defining_Identifier => B,
4742 Object_Definition => New_Reference_To (Arr, Loc))),
4744 Handled_Statement_Sequence =>
4745 Make_Handled_Sequence_Of_Statements (Loc,
4746 Statements => New_List (
4748 Make_Return_Statement (Loc,
4750 Make_Identifier (Loc, Chars (B)))))));
4753 Make_Function_Call (Loc,
4754 Name => New_Reference_To (Func_Name, Loc),
4755 Parameter_Associations => New_List (Opnd)));
4757 Analyze_And_Resolve (N, Typ);
4758 end Expand_N_Op_Not;
4760 --------------------
4761 -- Expand_N_Op_Or --
4762 --------------------
4764 procedure Expand_N_Op_Or (N : Node_Id) is
4765 Typ : constant Entity_Id := Etype (N);
4768 Binary_Op_Validity_Checks (N);
4770 if Is_Array_Type (Etype (N)) then
4771 Expand_Boolean_Operator (N);
4773 elsif Is_Boolean_Type (Etype (N)) then
4774 Adjust_Condition (Left_Opnd (N));
4775 Adjust_Condition (Right_Opnd (N));
4776 Set_Etype (N, Standard_Boolean);
4777 Adjust_Result_Type (N, Typ);
4781 ----------------------
4782 -- Expand_N_Op_Plus --
4783 ----------------------
4785 procedure Expand_N_Op_Plus (N : Node_Id) is
4787 Unary_Op_Validity_Checks (N);
4788 end Expand_N_Op_Plus;
4790 ---------------------
4791 -- Expand_N_Op_Rem --
4792 ---------------------
4794 procedure Expand_N_Op_Rem (N : Node_Id) is
4795 Loc : constant Source_Ptr := Sloc (N);
4796 Typ : constant Entity_Id := Etype (N);
4798 Left : constant Node_Id := Left_Opnd (N);
4799 Right : constant Node_Id := Right_Opnd (N);
4810 Binary_Op_Validity_Checks (N);
4812 if Is_Integer_Type (Etype (N)) then
4813 Apply_Divide_Check (N);
4816 -- Apply optimization x rem 1 = 0. We don't really need that with
4817 -- gcc, but it is useful with other back ends (e.g. AAMP), and is
4818 -- certainly harmless.
4820 if Is_Integer_Type (Etype (N))
4821 and then Compile_Time_Known_Value (Right)
4822 and then Expr_Value (Right) = Uint_1
4824 Rewrite (N, Make_Integer_Literal (Loc, 0));
4825 Analyze_And_Resolve (N, Typ);
4829 -- Deal with annoying case of largest negative number remainder
4830 -- minus one. Gigi does not handle this case correctly, because
4831 -- it generates a divide instruction which may trap in this case.
4833 -- In fact the check is quite easy, if the right operand is -1,
4834 -- then the remainder is always 0, and we can just ignore the
4835 -- left operand completely in this case.
4837 Determine_Range (Right, ROK, Rlo, Rhi);
4838 Determine_Range (Left, LOK, Llo, Lhi);
4840 -- The operand type may be private (e.g. in the expansion of an
4841 -- an intrinsic operation) so we must use the underlying type to
4842 -- get the bounds, and convert the literals explicitly.
4846 (Type_Low_Bound (Base_Type (Underlying_Type (Etype (Left)))));
4848 -- Now perform the test, generating code only if needed
4850 if ((not ROK) or else (Rlo <= (-1) and then (-1) <= Rhi))
4852 ((not LOK) or else (Llo = LLB))
4855 Make_Conditional_Expression (Loc,
4856 Expressions => New_List (
4858 Left_Opnd => Duplicate_Subexpr (Right),
4860 Unchecked_Convert_To (Typ,
4861 Make_Integer_Literal (Loc, -1))),
4863 Unchecked_Convert_To (Typ,
4864 Make_Integer_Literal (Loc, Uint_0)),
4866 Relocate_Node (N))));
4868 Set_Analyzed (Next (Next (First (Expressions (N)))));
4869 Analyze_And_Resolve (N, Typ);
4871 end Expand_N_Op_Rem;
4873 -----------------------------
4874 -- Expand_N_Op_Rotate_Left --
4875 -----------------------------
4877 procedure Expand_N_Op_Rotate_Left (N : Node_Id) is
4879 Binary_Op_Validity_Checks (N);
4880 end Expand_N_Op_Rotate_Left;
4882 ------------------------------
4883 -- Expand_N_Op_Rotate_Right --
4884 ------------------------------
4886 procedure Expand_N_Op_Rotate_Right (N : Node_Id) is
4888 Binary_Op_Validity_Checks (N);
4889 end Expand_N_Op_Rotate_Right;
4891 ----------------------------
4892 -- Expand_N_Op_Shift_Left --
4893 ----------------------------
4895 procedure Expand_N_Op_Shift_Left (N : Node_Id) is
4897 Binary_Op_Validity_Checks (N);
4898 end Expand_N_Op_Shift_Left;
4900 -----------------------------
4901 -- Expand_N_Op_Shift_Right --
4902 -----------------------------
4904 procedure Expand_N_Op_Shift_Right (N : Node_Id) is
4906 Binary_Op_Validity_Checks (N);
4907 end Expand_N_Op_Shift_Right;
4909 ----------------------------------------
4910 -- Expand_N_Op_Shift_Right_Arithmetic --
4911 ----------------------------------------
4913 procedure Expand_N_Op_Shift_Right_Arithmetic (N : Node_Id) is
4915 Binary_Op_Validity_Checks (N);
4916 end Expand_N_Op_Shift_Right_Arithmetic;
4918 --------------------------
4919 -- Expand_N_Op_Subtract --
4920 --------------------------
4922 procedure Expand_N_Op_Subtract (N : Node_Id) is
4923 Typ : constant Entity_Id := Etype (N);
4926 Binary_Op_Validity_Checks (N);
4928 -- N - 0 = N for integer types
4930 if Is_Integer_Type (Typ)
4931 and then Compile_Time_Known_Value (Right_Opnd (N))
4932 and then Expr_Value (Right_Opnd (N)) = 0
4934 Rewrite (N, Left_Opnd (N));
4938 -- Arithemtic overflow checks for signed integer/fixed point types
4940 if Is_Signed_Integer_Type (Typ)
4941 or else Is_Fixed_Point_Type (Typ)
4943 Apply_Arithmetic_Overflow_Check (N);
4945 -- Vax floating-point types case
4947 elsif Vax_Float (Typ) then
4948 Expand_Vax_Arith (N);
4950 end Expand_N_Op_Subtract;
4952 ---------------------
4953 -- Expand_N_Op_Xor --
4954 ---------------------
4956 procedure Expand_N_Op_Xor (N : Node_Id) is
4957 Typ : constant Entity_Id := Etype (N);
4960 Binary_Op_Validity_Checks (N);
4962 if Is_Array_Type (Etype (N)) then
4963 Expand_Boolean_Operator (N);
4965 elsif Is_Boolean_Type (Etype (N)) then
4966 Adjust_Condition (Left_Opnd (N));
4967 Adjust_Condition (Right_Opnd (N));
4968 Set_Etype (N, Standard_Boolean);
4969 Adjust_Result_Type (N, Typ);
4971 end Expand_N_Op_Xor;
4973 ----------------------
4974 -- Expand_N_Or_Else --
4975 ----------------------
4977 -- Expand into conditional expression if Actions present, and also
4978 -- deal with optimizing case of arguments being True or False.
4980 procedure Expand_N_Or_Else (N : Node_Id) is
4981 Loc : constant Source_Ptr := Sloc (N);
4982 Typ : constant Entity_Id := Etype (N);
4983 Left : constant Node_Id := Left_Opnd (N);
4984 Right : constant Node_Id := Right_Opnd (N);
4988 -- Deal with non-standard booleans
4990 if Is_Boolean_Type (Typ) then
4991 Adjust_Condition (Left);
4992 Adjust_Condition (Right);
4993 Set_Etype (N, Standard_Boolean);
4996 -- Check for cases of left argument is True or False
4998 if Nkind (Left) = N_Identifier then
5000 -- If left argument is False, change (False or else Right) to Right.
5001 -- Any actions associated with Right will be executed unconditionally
5002 -- and can thus be inserted into the tree unconditionally.
5004 if Entity (Left) = Standard_False then
5005 if Present (Actions (N)) then
5006 Insert_Actions (N, Actions (N));
5010 Adjust_Result_Type (N, Typ);
5013 -- If left argument is True, change (True and then Right) to
5014 -- True. In this case we can forget the actions associated with
5015 -- Right, since they will never be executed.
5017 elsif Entity (Left) = Standard_True then
5018 Kill_Dead_Code (Right);
5019 Kill_Dead_Code (Actions (N));
5020 Rewrite (N, New_Occurrence_Of (Standard_True, Loc));
5021 Adjust_Result_Type (N, Typ);
5026 -- If Actions are present, we expand
5028 -- left or else right
5032 -- if left then True else right end
5034 -- with the actions becoming the Else_Actions of the conditional
5035 -- expression. This conditional expression is then further expanded
5036 -- (and will eventually disappear)
5038 if Present (Actions (N)) then
5039 Actlist := Actions (N);
5041 Make_Conditional_Expression (Loc,
5042 Expressions => New_List (
5044 New_Occurrence_Of (Standard_True, Loc),
5047 Set_Else_Actions (N, Actlist);
5048 Analyze_And_Resolve (N, Standard_Boolean);
5049 Adjust_Result_Type (N, Typ);
5053 -- No actions present, check for cases of right argument True/False
5055 if Nkind (Right) = N_Identifier then
5057 -- Change (Left or else False) to Left. Note that we know there
5058 -- are no actions associated with the True operand, since we
5059 -- just checked for this case above.
5061 if Entity (Right) = Standard_False then
5064 -- Change (Left or else True) to True, making sure to preserve
5065 -- any side effects associated with the Left operand.
5067 elsif Entity (Right) = Standard_True then
5068 Remove_Side_Effects (Left);
5070 (N, New_Occurrence_Of (Standard_True, Loc));
5074 Adjust_Result_Type (N, Typ);
5075 end Expand_N_Or_Else;
5077 -----------------------------------
5078 -- Expand_N_Qualified_Expression --
5079 -----------------------------------
5081 procedure Expand_N_Qualified_Expression (N : Node_Id) is
5082 Operand : constant Node_Id := Expression (N);
5083 Target_Type : constant Entity_Id := Entity (Subtype_Mark (N));
5086 Apply_Constraint_Check (Operand, Target_Type, No_Sliding => True);
5087 end Expand_N_Qualified_Expression;
5089 ---------------------------------
5090 -- Expand_N_Selected_Component --
5091 ---------------------------------
5093 -- If the selector is a discriminant of a concurrent object, rewrite the
5094 -- prefix to denote the corresponding record type.
5096 procedure Expand_N_Selected_Component (N : Node_Id) is
5097 Loc : constant Source_Ptr := Sloc (N);
5098 Par : constant Node_Id := Parent (N);
5099 P : constant Node_Id := Prefix (N);
5100 Ptyp : Entity_Id := Underlying_Type (Etype (P));
5105 function In_Left_Hand_Side (Comp : Node_Id) return Boolean;
5106 -- Gigi needs a temporary for prefixes that depend on a discriminant,
5107 -- unless the context of an assignment can provide size information.
5108 -- Don't we have a general routine that does this???
5110 -----------------------
5111 -- In_Left_Hand_Side --
5112 -----------------------
5114 function In_Left_Hand_Side (Comp : Node_Id) return Boolean is
5116 return (Nkind (Parent (Comp)) = N_Assignment_Statement
5117 and then Comp = Name (Parent (Comp)))
5118 or else (Present (Parent (Comp))
5119 and then Nkind (Parent (Comp)) in N_Subexpr
5120 and then In_Left_Hand_Side (Parent (Comp)));
5121 end In_Left_Hand_Side;
5123 -- Start of processing for Expand_N_Selected_Component
5126 -- Insert explicit dereference if required
5128 if Is_Access_Type (Ptyp) then
5129 Insert_Explicit_Dereference (P);
5131 if Ekind (Etype (P)) = E_Private_Subtype
5132 and then Is_For_Access_Subtype (Etype (P))
5134 Set_Etype (P, Base_Type (Etype (P)));
5140 -- Deal with discriminant check required
5142 if Do_Discriminant_Check (N) then
5144 -- Present the discrminant checking function to the backend,
5145 -- so that it can inline the call to the function.
5148 (Discriminant_Checking_Func
5149 (Original_Record_Component (Entity (Selector_Name (N)))));
5151 -- Now reset the flag and generate the call
5153 Set_Do_Discriminant_Check (N, False);
5154 Generate_Discriminant_Check (N);
5157 -- Gigi cannot handle unchecked conversions that are the prefix of a
5158 -- selected component with discriminants. This must be checked during
5159 -- expansion, because during analysis the type of the selector is not
5160 -- known at the point the prefix is analyzed. If the conversion is the
5161 -- target of an assignment, then we cannot force the evaluation.
5163 if Nkind (Prefix (N)) = N_Unchecked_Type_Conversion
5164 and then Has_Discriminants (Etype (N))
5165 and then not In_Left_Hand_Side (N)
5167 Force_Evaluation (Prefix (N));
5170 -- Remaining processing applies only if selector is a discriminant
5172 if Ekind (Entity (Selector_Name (N))) = E_Discriminant then
5174 -- If the selector is a discriminant of a constrained record type,
5175 -- we may be able to rewrite the expression with the actual value
5176 -- of the discriminant, a useful optimization in some cases.
5178 if Is_Record_Type (Ptyp)
5179 and then Has_Discriminants (Ptyp)
5180 and then Is_Constrained (Ptyp)
5182 -- Do this optimization for discrete types only, and not for
5183 -- access types (access discriminants get us into trouble!)
5185 if not Is_Discrete_Type (Etype (N)) then
5188 -- Don't do this on the left hand of an assignment statement.
5189 -- Normally one would think that references like this would
5190 -- not occur, but they do in generated code, and mean that
5191 -- we really do want to assign the discriminant!
5193 elsif Nkind (Par) = N_Assignment_Statement
5194 and then Name (Par) = N
5198 -- Don't do this optimization for the prefix of an attribute
5199 -- or the operand of an object renaming declaration since these
5200 -- are contexts where we do not want the value anyway.
5202 elsif (Nkind (Par) = N_Attribute_Reference
5203 and then Prefix (Par) = N)
5204 or else Is_Renamed_Object (N)
5208 -- Don't do this optimization if we are within the code for a
5209 -- discriminant check, since the whole point of such a check may
5210 -- be to verify the condition on which the code below depends!
5212 elsif Is_In_Discriminant_Check (N) then
5215 -- Green light to see if we can do the optimization. There is
5216 -- still one condition that inhibits the optimization below
5217 -- but now is the time to check the particular discriminant.
5220 -- Loop through discriminants to find the matching
5221 -- discriminant constraint to see if we can copy it.
5223 Disc := First_Discriminant (Ptyp);
5224 Dcon := First_Elmt (Discriminant_Constraint (Ptyp));
5225 Discr_Loop : while Present (Dcon) loop
5227 -- Check if this is the matching discriminant
5229 if Disc = Entity (Selector_Name (N)) then
5231 -- Here we have the matching discriminant. Check for
5232 -- the case of a discriminant of a component that is
5233 -- constrained by an outer discriminant, which cannot
5234 -- be optimized away.
5237 Denotes_Discriminant
5238 (Node (Dcon), Check_Protected => True)
5242 -- In the context of a case statement, the expression
5243 -- may have the base type of the discriminant, and we
5244 -- need to preserve the constraint to avoid spurious
5245 -- errors on missing cases.
5247 elsif Nkind (Parent (N)) = N_Case_Statement
5248 and then Etype (Node (Dcon)) /= Etype (Disc)
5250 -- RBKD is suspicious of the following code. The
5251 -- call to New_Copy instead of New_Copy_Tree is
5252 -- suspicious, and the call to Analyze instead
5253 -- of Analyze_And_Resolve is also suspicious ???
5255 -- Wouldn't it be good enough to do a perfectly
5256 -- normal Analyze_And_Resolve call using the
5257 -- subtype of the discriminant here???
5260 Make_Qualified_Expression (Loc,
5262 New_Occurrence_Of (Etype (Disc), Loc),
5264 New_Copy (Node (Dcon))));
5267 -- In case that comes out as a static expression,
5268 -- reset it (a selected component is never static).
5270 Set_Is_Static_Expression (N, False);
5273 -- Otherwise we can just copy the constraint, but the
5274 -- result is certainly not static!
5276 -- Again the New_Copy here and the failure to even
5277 -- to an analyze call is uneasy ???
5280 Rewrite (N, New_Copy (Node (Dcon)));
5281 Set_Is_Static_Expression (N, False);
5287 Next_Discriminant (Disc);
5288 end loop Discr_Loop;
5290 -- Note: the above loop should always find a matching
5291 -- discriminant, but if it does not, we just missed an
5292 -- optimization due to some glitch (perhaps a previous
5293 -- error), so ignore.
5298 -- The only remaining processing is in the case of a discriminant of
5299 -- a concurrent object, where we rewrite the prefix to denote the
5300 -- corresponding record type. If the type is derived and has renamed
5301 -- discriminants, use corresponding discriminant, which is the one
5302 -- that appears in the corresponding record.
5304 if not Is_Concurrent_Type (Ptyp) then
5308 Disc := Entity (Selector_Name (N));
5310 if Is_Derived_Type (Ptyp)
5311 and then Present (Corresponding_Discriminant (Disc))
5313 Disc := Corresponding_Discriminant (Disc);
5317 Make_Selected_Component (Loc,
5319 Unchecked_Convert_To (Corresponding_Record_Type (Ptyp),
5321 Selector_Name => Make_Identifier (Loc, Chars (Disc)));
5326 end Expand_N_Selected_Component;
5328 --------------------
5329 -- Expand_N_Slice --
5330 --------------------
5332 procedure Expand_N_Slice (N : Node_Id) is
5333 Loc : constant Source_Ptr := Sloc (N);
5334 Typ : constant Entity_Id := Etype (N);
5335 Pfx : constant Node_Id := Prefix (N);
5336 Ptp : Entity_Id := Etype (Pfx);
5338 function Is_Procedure_Actual (N : Node_Id) return Boolean;
5339 -- Check whether context is a procedure call, in which case
5340 -- expansion of a bit-packed slice is deferred until the call
5341 -- itself is expanded.
5343 procedure Make_Temporary;
5344 -- Create a named variable for the value of the slice, in
5345 -- cases where the back-end cannot handle it properly, e.g.
5346 -- when packed types or unaligned slices are involved.
5348 -------------------------
5349 -- Is_Procedure_Actual --
5350 -------------------------
5352 function Is_Procedure_Actual (N : Node_Id) return Boolean is
5353 Par : Node_Id := Parent (N);
5357 and then Nkind (Par) not in N_Statement_Other_Than_Procedure_Call
5359 if Nkind (Par) = N_Procedure_Call_Statement then
5362 Par := Parent (Par);
5367 end Is_Procedure_Actual;
5369 --------------------
5370 -- Make_Temporary --
5371 --------------------
5373 procedure Make_Temporary is
5375 Ent : constant Entity_Id :=
5376 Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
5379 Make_Object_Declaration (Loc,
5380 Defining_Identifier => Ent,
5381 Object_Definition => New_Occurrence_Of (Typ, Loc));
5383 Set_No_Initialization (Decl);
5385 Insert_Actions (N, New_List (
5387 Make_Assignment_Statement (Loc,
5388 Name => New_Occurrence_Of (Ent, Loc),
5389 Expression => Relocate_Node (N))));
5391 Rewrite (N, New_Occurrence_Of (Ent, Loc));
5392 Analyze_And_Resolve (N, Typ);
5395 -- Start of processing for Expand_N_Slice
5398 -- Special handling for access types
5400 if Is_Access_Type (Ptp) then
5402 -- Check for explicit dereference required for checked pool
5404 Insert_Dereference_Action (Pfx);
5406 -- If we have an access to a packed array type, then put in an
5407 -- explicit dereference. We do this in case the slice must be
5408 -- expanded, and we want to make sure we get an access check.
5410 Ptp := Designated_Type (Ptp);
5412 if Is_Array_Type (Ptp) and then Is_Packed (Ptp) then
5414 Make_Explicit_Dereference (Sloc (N),
5415 Prefix => Relocate_Node (Pfx)));
5417 Analyze_And_Resolve (Pfx, Ptp);
5421 -- Range checks are potentially also needed for cases involving
5422 -- a slice indexed by a subtype indication, but Do_Range_Check
5423 -- can currently only be set for expressions ???
5425 if not Index_Checks_Suppressed (Ptp)
5426 and then (not Is_Entity_Name (Pfx)
5427 or else not Index_Checks_Suppressed (Entity (Pfx)))
5428 and then Nkind (Discrete_Range (N)) /= N_Subtype_Indication
5430 Enable_Range_Check (Discrete_Range (N));
5433 -- The remaining case to be handled is packed slices. We can leave
5434 -- packed slices as they are in the following situations:
5436 -- 1. Right or left side of an assignment (we can handle this
5437 -- situation correctly in the assignment statement expansion).
5439 -- 2. Prefix of indexed component (the slide is optimized away
5440 -- in this case, see the start of Expand_N_Slice.
5442 -- 3. Object renaming declaration, since we want the name of
5443 -- the slice, not the value.
5445 -- 4. Argument to procedure call, since copy-in/copy-out handling
5446 -- may be required, and this is handled in the expansion of
5449 -- 5. Prefix of an address attribute (this is an error which
5450 -- is caught elsewhere, and the expansion would intefere
5451 -- with generating the error message).
5453 if not Is_Packed (Typ) then
5455 -- Apply transformation for actuals of a function call,
5456 -- where Expand_Actuals is not used.
5458 if Nkind (Parent (N)) = N_Function_Call
5459 and then Is_Possibly_Unaligned_Slice (N)
5464 elsif Nkind (Parent (N)) = N_Assignment_Statement
5465 or else (Nkind (Parent (Parent (N))) = N_Assignment_Statement
5466 and then Parent (N) = Name (Parent (Parent (N))))
5470 elsif Nkind (Parent (N)) = N_Indexed_Component
5471 or else Is_Renamed_Object (N)
5472 or else Is_Procedure_Actual (N)
5476 elsif Nkind (Parent (N)) = N_Attribute_Reference
5477 and then Attribute_Name (Parent (N)) = Name_Address
5486 ------------------------------
5487 -- Expand_N_Type_Conversion --
5488 ------------------------------
5490 procedure Expand_N_Type_Conversion (N : Node_Id) is
5491 Loc : constant Source_Ptr := Sloc (N);
5492 Operand : constant Node_Id := Expression (N);
5493 Target_Type : constant Entity_Id := Etype (N);
5494 Operand_Type : Entity_Id := Etype (Operand);
5496 procedure Handle_Changed_Representation;
5497 -- This is called in the case of record and array type conversions
5498 -- to see if there is a change of representation to be handled.
5499 -- Change of representation is actually handled at the assignment
5500 -- statement level, and what this procedure does is rewrite node N
5501 -- conversion as an assignment to temporary. If there is no change
5502 -- of representation, then the conversion node is unchanged.
5504 procedure Real_Range_Check;
5505 -- Handles generation of range check for real target value
5507 -----------------------------------
5508 -- Handle_Changed_Representation --
5509 -----------------------------------
5511 procedure Handle_Changed_Representation is
5520 -- Nothing to do if no change of representation
5522 if Same_Representation (Operand_Type, Target_Type) then
5525 -- The real change of representation work is done by the assignment
5526 -- statement processing. So if this type conversion is appearing as
5527 -- the expression of an assignment statement, nothing needs to be
5528 -- done to the conversion.
5530 elsif Nkind (Parent (N)) = N_Assignment_Statement then
5533 -- Otherwise we need to generate a temporary variable, and do the
5534 -- change of representation assignment into that temporary variable.
5535 -- The conversion is then replaced by a reference to this variable.
5540 -- If type is unconstrained we have to add a constraint,
5541 -- copied from the actual value of the left hand side.
5543 if not Is_Constrained (Target_Type) then
5544 if Has_Discriminants (Operand_Type) then
5545 Disc := First_Discriminant (Operand_Type);
5547 if Disc /= First_Stored_Discriminant (Operand_Type) then
5548 Disc := First_Stored_Discriminant (Operand_Type);
5552 while Present (Disc) loop
5554 Make_Selected_Component (Loc,
5555 Prefix => Duplicate_Subexpr_Move_Checks (Operand),
5557 Make_Identifier (Loc, Chars (Disc))));
5558 Next_Discriminant (Disc);
5561 elsif Is_Array_Type (Operand_Type) then
5562 N_Ix := First_Index (Target_Type);
5565 for J in 1 .. Number_Dimensions (Operand_Type) loop
5567 -- We convert the bounds explicitly. We use an unchecked
5568 -- conversion because bounds checks are done elsewhere.
5573 Unchecked_Convert_To (Etype (N_Ix),
5574 Make_Attribute_Reference (Loc,
5576 Duplicate_Subexpr_No_Checks
5577 (Operand, Name_Req => True),
5578 Attribute_Name => Name_First,
5579 Expressions => New_List (
5580 Make_Integer_Literal (Loc, J)))),
5583 Unchecked_Convert_To (Etype (N_Ix),
5584 Make_Attribute_Reference (Loc,
5586 Duplicate_Subexpr_No_Checks
5587 (Operand, Name_Req => True),
5588 Attribute_Name => Name_Last,
5589 Expressions => New_List (
5590 Make_Integer_Literal (Loc, J))))));
5597 Odef := New_Occurrence_Of (Target_Type, Loc);
5599 if Present (Cons) then
5601 Make_Subtype_Indication (Loc,
5602 Subtype_Mark => Odef,
5604 Make_Index_Or_Discriminant_Constraint (Loc,
5605 Constraints => Cons));
5608 Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('C'));
5610 Make_Object_Declaration (Loc,
5611 Defining_Identifier => Temp,
5612 Object_Definition => Odef);
5614 Set_No_Initialization (Decl, True);
5616 -- Insert required actions. It is essential to suppress checks
5617 -- since we have suppressed default initialization, which means
5618 -- that the variable we create may have no discriminants.
5623 Make_Assignment_Statement (Loc,
5624 Name => New_Occurrence_Of (Temp, Loc),
5625 Expression => Relocate_Node (N))),
5626 Suppress => All_Checks);
5628 Rewrite (N, New_Occurrence_Of (Temp, Loc));
5631 end Handle_Changed_Representation;
5633 ----------------------
5634 -- Real_Range_Check --
5635 ----------------------
5637 -- Case of conversions to floating-point or fixed-point. If range
5638 -- checks are enabled and the target type has a range constraint,
5645 -- Tnn : typ'Base := typ'Base (x);
5646 -- [constraint_error when Tnn < typ'First or else Tnn > typ'Last]
5649 -- This is necessary when there is a conversion of integer to float
5650 -- or to fixed-point to ensure that the correct checks are made. It
5651 -- is not necessary for float to float where it is enough to simply
5652 -- set the Do_Range_Check flag.
5654 procedure Real_Range_Check is
5655 Btyp : constant Entity_Id := Base_Type (Target_Type);
5656 Lo : constant Node_Id := Type_Low_Bound (Target_Type);
5657 Hi : constant Node_Id := Type_High_Bound (Target_Type);
5658 Xtyp : constant Entity_Id := Etype (Operand);
5663 -- Nothing to do if conversion was rewritten
5665 if Nkind (N) /= N_Type_Conversion then
5669 -- Nothing to do if range checks suppressed, or target has the
5670 -- same range as the base type (or is the base type).
5672 if Range_Checks_Suppressed (Target_Type)
5673 or else (Lo = Type_Low_Bound (Btyp)
5675 Hi = Type_High_Bound (Btyp))
5680 -- Nothing to do if expression is an entity on which checks
5681 -- have been suppressed.
5683 if Is_Entity_Name (Operand)
5684 and then Range_Checks_Suppressed (Entity (Operand))
5689 -- Nothing to do if bounds are all static and we can tell that
5690 -- the expression is within the bounds of the target. Note that
5691 -- if the operand is of an unconstrained floating-point type,
5692 -- then we do not trust it to be in range (might be infinite)
5695 S_Lo : constant Node_Id := Type_Low_Bound (Xtyp);
5696 S_Hi : constant Node_Id := Type_High_Bound (Xtyp);
5699 if (not Is_Floating_Point_Type (Xtyp)
5700 or else Is_Constrained (Xtyp))
5701 and then Compile_Time_Known_Value (S_Lo)
5702 and then Compile_Time_Known_Value (S_Hi)
5703 and then Compile_Time_Known_Value (Hi)
5704 and then Compile_Time_Known_Value (Lo)
5707 D_Lov : constant Ureal := Expr_Value_R (Lo);
5708 D_Hiv : constant Ureal := Expr_Value_R (Hi);
5713 if Is_Real_Type (Xtyp) then
5714 S_Lov := Expr_Value_R (S_Lo);
5715 S_Hiv := Expr_Value_R (S_Hi);
5717 S_Lov := UR_From_Uint (Expr_Value (S_Lo));
5718 S_Hiv := UR_From_Uint (Expr_Value (S_Hi));
5722 and then S_Lov >= D_Lov
5723 and then S_Hiv <= D_Hiv
5725 Set_Do_Range_Check (Operand, False);
5732 -- For float to float conversions, we are done
5734 if Is_Floating_Point_Type (Xtyp)
5736 Is_Floating_Point_Type (Btyp)
5741 -- Otherwise rewrite the conversion as described above
5743 Conv := Relocate_Node (N);
5745 (Subtype_Mark (Conv), New_Occurrence_Of (Btyp, Loc));
5746 Set_Etype (Conv, Btyp);
5748 -- Enable overflow except in the case of integer to float
5749 -- conversions, where it is never required, since we can
5750 -- never have overflow in this case.
5752 if not Is_Integer_Type (Etype (Operand)) then
5753 Enable_Overflow_Check (Conv);
5757 Make_Defining_Identifier (Loc,
5758 Chars => New_Internal_Name ('T'));
5760 Insert_Actions (N, New_List (
5761 Make_Object_Declaration (Loc,
5762 Defining_Identifier => Tnn,
5763 Object_Definition => New_Occurrence_Of (Btyp, Loc),
5764 Expression => Conv),
5766 Make_Raise_Constraint_Error (Loc,
5771 Left_Opnd => New_Occurrence_Of (Tnn, Loc),
5773 Make_Attribute_Reference (Loc,
5774 Attribute_Name => Name_First,
5776 New_Occurrence_Of (Target_Type, Loc))),
5780 Left_Opnd => New_Occurrence_Of (Tnn, Loc),
5782 Make_Attribute_Reference (Loc,
5783 Attribute_Name => Name_Last,
5785 New_Occurrence_Of (Target_Type, Loc)))),
5786 Reason => CE_Range_Check_Failed)));
5788 Rewrite (N, New_Occurrence_Of (Tnn, Loc));
5789 Analyze_And_Resolve (N, Btyp);
5790 end Real_Range_Check;
5792 -- Start of processing for Expand_N_Type_Conversion
5795 -- Nothing at all to do if conversion is to the identical type
5796 -- so remove the conversion completely, it is useless.
5798 if Operand_Type = Target_Type then
5799 Rewrite (N, Relocate_Node (Operand));
5803 -- Deal with Vax floating-point cases
5805 if Vax_Float (Operand_Type) or else Vax_Float (Target_Type) then
5806 Expand_Vax_Conversion (N);
5810 -- Nothing to do if this is the second argument of read. This
5811 -- is a "backwards" conversion that will be handled by the
5812 -- specialized code in attribute processing.
5814 if Nkind (Parent (N)) = N_Attribute_Reference
5815 and then Attribute_Name (Parent (N)) = Name_Read
5816 and then Next (First (Expressions (Parent (N)))) = N
5821 -- Here if we may need to expand conversion
5823 -- Special case of converting from non-standard boolean type
5825 if Is_Boolean_Type (Operand_Type)
5826 and then (Nonzero_Is_True (Operand_Type))
5828 Adjust_Condition (Operand);
5829 Set_Etype (Operand, Standard_Boolean);
5830 Operand_Type := Standard_Boolean;
5833 -- Case of converting to an access type
5835 if Is_Access_Type (Target_Type) then
5837 -- Apply an accessibility check if the operand is an
5838 -- access parameter. Note that other checks may still
5839 -- need to be applied below (such as tagged type checks).
5841 if Is_Entity_Name (Operand)
5842 and then Ekind (Entity (Operand)) in Formal_Kind
5843 and then Ekind (Etype (Operand)) = E_Anonymous_Access_Type
5845 Apply_Accessibility_Check (Operand, Target_Type);
5847 -- If the level of the operand type is statically deeper
5848 -- then the level of the target type, then force Program_Error.
5849 -- Note that this can only occur for cases where the attribute
5850 -- is within the body of an instantiation (otherwise the
5851 -- conversion will already have been rejected as illegal).
5852 -- Note: warnings are issued by the analyzer for the instance
5855 elsif In_Instance_Body
5856 and then Type_Access_Level (Operand_Type) >
5857 Type_Access_Level (Target_Type)
5860 Make_Raise_Program_Error (Sloc (N),
5861 Reason => PE_Accessibility_Check_Failed));
5862 Set_Etype (N, Target_Type);
5864 -- When the operand is a selected access discriminant
5865 -- the check needs to be made against the level of the
5866 -- object denoted by the prefix of the selected name.
5867 -- Force Program_Error for this case as well (this
5868 -- accessibility violation can only happen if within
5869 -- the body of an instantiation).
5871 elsif In_Instance_Body
5872 and then Ekind (Operand_Type) = E_Anonymous_Access_Type
5873 and then Nkind (Operand) = N_Selected_Component
5874 and then Object_Access_Level (Operand) >
5875 Type_Access_Level (Target_Type)
5878 Make_Raise_Program_Error (Sloc (N),
5879 Reason => PE_Accessibility_Check_Failed));
5880 Set_Etype (N, Target_Type);
5884 -- Case of conversions of tagged types and access to tagged types
5886 -- When needed, that is to say when the expression is class-wide,
5887 -- Add runtime a tag check for (strict) downward conversion by using
5888 -- the membership test, generating:
5890 -- [constraint_error when Operand not in Target_Type'Class]
5892 -- or in the access type case
5894 -- [constraint_error
5895 -- when Operand /= null
5896 -- and then Operand.all not in
5897 -- Designated_Type (Target_Type)'Class]
5899 if (Is_Access_Type (Target_Type)
5900 and then Is_Tagged_Type (Designated_Type (Target_Type)))
5901 or else Is_Tagged_Type (Target_Type)
5903 -- Do not do any expansion in the access type case if the
5904 -- parent is a renaming, since this is an error situation
5905 -- which will be caught by Sem_Ch8, and the expansion can
5906 -- intefere with this error check.
5908 if Is_Access_Type (Target_Type)
5909 and then Is_Renamed_Object (N)
5914 -- Oherwise, proceed with processing tagged conversion
5917 Actual_Operand_Type : Entity_Id;
5918 Actual_Target_Type : Entity_Id;
5923 if Is_Access_Type (Target_Type) then
5924 Actual_Operand_Type := Designated_Type (Operand_Type);
5925 Actual_Target_Type := Designated_Type (Target_Type);
5928 Actual_Operand_Type := Operand_Type;
5929 Actual_Target_Type := Target_Type;
5932 if Is_Class_Wide_Type (Actual_Operand_Type)
5933 and then Root_Type (Actual_Operand_Type) /= Actual_Target_Type
5934 and then Is_Ancestor
5935 (Root_Type (Actual_Operand_Type),
5937 and then not Tag_Checks_Suppressed (Actual_Target_Type)
5939 -- The conversion is valid for any descendant of the
5942 Actual_Target_Type := Class_Wide_Type (Actual_Target_Type);
5944 if Is_Access_Type (Target_Type) then
5949 Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
5950 Right_Opnd => Make_Null (Loc)),
5955 Make_Explicit_Dereference (Loc,
5957 Duplicate_Subexpr_No_Checks (Operand)),
5959 New_Reference_To (Actual_Target_Type, Loc)));
5964 Left_Opnd => Duplicate_Subexpr_No_Checks (Operand),
5966 New_Reference_To (Actual_Target_Type, Loc));
5970 Make_Raise_Constraint_Error (Loc,
5972 Reason => CE_Tag_Check_Failed));
5974 Change_Conversion_To_Unchecked (N);
5975 Analyze_And_Resolve (N, Target_Type);
5979 -- Case of other access type conversions
5981 elsif Is_Access_Type (Target_Type) then
5982 Apply_Constraint_Check (Operand, Target_Type);
5984 -- Case of conversions from a fixed-point type
5986 -- These conversions require special expansion and processing, found
5987 -- in the Exp_Fixd package. We ignore cases where Conversion_OK is
5988 -- set, since from a semantic point of view, these are simple integer
5989 -- conversions, which do not need further processing.
5991 elsif Is_Fixed_Point_Type (Operand_Type)
5992 and then not Conversion_OK (N)
5994 -- We should never see universal fixed at this case, since the
5995 -- expansion of the constituent divide or multiply should have
5996 -- eliminated the explicit mention of universal fixed.
5998 pragma Assert (Operand_Type /= Universal_Fixed);
6000 -- Check for special case of the conversion to universal real
6001 -- that occurs as a result of the use of a round attribute.
6002 -- In this case, the real type for the conversion is taken
6003 -- from the target type of the Round attribute and the
6004 -- result must be marked as rounded.
6006 if Target_Type = Universal_Real
6007 and then Nkind (Parent (N)) = N_Attribute_Reference
6008 and then Attribute_Name (Parent (N)) = Name_Round
6010 Set_Rounded_Result (N);
6011 Set_Etype (N, Etype (Parent (N)));
6014 -- Otherwise do correct fixed-conversion, but skip these if the
6015 -- Conversion_OK flag is set, because from a semantic point of
6016 -- view these are simple integer conversions needing no further
6017 -- processing (the backend will simply treat them as integers)
6019 if not Conversion_OK (N) then
6020 if Is_Fixed_Point_Type (Etype (N)) then
6021 Expand_Convert_Fixed_To_Fixed (N);
6024 elsif Is_Integer_Type (Etype (N)) then
6025 Expand_Convert_Fixed_To_Integer (N);
6028 pragma Assert (Is_Floating_Point_Type (Etype (N)));
6029 Expand_Convert_Fixed_To_Float (N);
6034 -- Case of conversions to a fixed-point type
6036 -- These conversions require special expansion and processing, found
6037 -- in the Exp_Fixd package. Again, ignore cases where Conversion_OK
6038 -- is set, since from a semantic point of view, these are simple
6039 -- integer conversions, which do not need further processing.
6041 elsif Is_Fixed_Point_Type (Target_Type)
6042 and then not Conversion_OK (N)
6044 if Is_Integer_Type (Operand_Type) then
6045 Expand_Convert_Integer_To_Fixed (N);
6048 pragma Assert (Is_Floating_Point_Type (Operand_Type));
6049 Expand_Convert_Float_To_Fixed (N);
6053 -- Case of float-to-integer conversions
6055 -- We also handle float-to-fixed conversions with Conversion_OK set
6056 -- since semantically the fixed-point target is treated as though it
6057 -- were an integer in such cases.
6059 elsif Is_Floating_Point_Type (Operand_Type)
6061 (Is_Integer_Type (Target_Type)
6063 (Is_Fixed_Point_Type (Target_Type) and then Conversion_OK (N)))
6065 -- Special processing required if the conversion is the expression
6066 -- of a Truncation attribute reference. In this case we replace:
6068 -- ityp (ftyp'Truncation (x))
6074 -- with the Float_Truncate flag set. This is clearly more efficient.
6076 if Nkind (Operand) = N_Attribute_Reference
6077 and then Attribute_Name (Operand) = Name_Truncation
6080 Relocate_Node (First (Expressions (Operand))));
6081 Set_Float_Truncate (N, True);
6084 -- One more check here, gcc is still not able to do conversions of
6085 -- this type with proper overflow checking, and so gigi is doing an
6086 -- approximation of what is required by doing floating-point compares
6087 -- with the end-point. But that can lose precision in some cases, and
6088 -- give a wrong result. Converting the operand to Long_Long_Float is
6089 -- helpful, but still does not catch all cases with 64-bit integers
6090 -- on targets with only 64-bit floats ???
6092 if Do_Range_Check (Operand) then
6094 Make_Type_Conversion (Loc,
6096 New_Occurrence_Of (Standard_Long_Long_Float, Loc),
6098 Relocate_Node (Operand)));
6100 Set_Etype (Operand, Standard_Long_Long_Float);
6101 Enable_Range_Check (Operand);
6102 Set_Do_Range_Check (Expression (Operand), False);
6105 -- Case of array conversions
6107 -- Expansion of array conversions, add required length/range checks
6108 -- but only do this if there is no change of representation. For
6109 -- handling of this case, see Handle_Changed_Representation.
6111 elsif Is_Array_Type (Target_Type) then
6113 if Is_Constrained (Target_Type) then
6114 Apply_Length_Check (Operand, Target_Type);
6116 Apply_Range_Check (Operand, Target_Type);
6119 Handle_Changed_Representation;
6121 -- Case of conversions of discriminated types
6123 -- Add required discriminant checks if target is constrained. Again
6124 -- this change is skipped if we have a change of representation.
6126 elsif Has_Discriminants (Target_Type)
6127 and then Is_Constrained (Target_Type)
6129 Apply_Discriminant_Check (Operand, Target_Type);
6130 Handle_Changed_Representation;
6132 -- Case of all other record conversions. The only processing required
6133 -- is to check for a change of representation requiring the special
6134 -- assignment processing.
6136 elsif Is_Record_Type (Target_Type) then
6137 Handle_Changed_Representation;
6139 -- Case of conversions of enumeration types
6141 elsif Is_Enumeration_Type (Target_Type) then
6143 -- Special processing is required if there is a change of
6144 -- representation (from enumeration representation clauses)
6146 if not Same_Representation (Target_Type, Operand_Type) then
6148 -- Convert: x(y) to x'val (ytyp'val (y))
6151 Make_Attribute_Reference (Loc,
6152 Prefix => New_Occurrence_Of (Target_Type, Loc),
6153 Attribute_Name => Name_Val,
6154 Expressions => New_List (
6155 Make_Attribute_Reference (Loc,
6156 Prefix => New_Occurrence_Of (Operand_Type, Loc),
6157 Attribute_Name => Name_Pos,
6158 Expressions => New_List (Operand)))));
6160 Analyze_And_Resolve (N, Target_Type);
6163 -- Case of conversions to floating-point
6165 elsif Is_Floating_Point_Type (Target_Type) then
6168 -- The remaining cases require no front end processing
6174 -- At this stage, either the conversion node has been transformed
6175 -- into some other equivalent expression, or left as a conversion
6176 -- that can be handled by Gigi. The conversions that Gigi can handle
6177 -- are the following:
6179 -- Conversions with no change of representation or type
6181 -- Numeric conversions involving integer values, floating-point
6182 -- values, and fixed-point values. Fixed-point values are allowed
6183 -- only if Conversion_OK is set, i.e. if the fixed-point values
6184 -- are to be treated as integers.
6186 -- No other conversions should be passed to Gigi.
6188 -- The only remaining step is to generate a range check if we still
6189 -- have a type conversion at this stage and Do_Range_Check is set.
6190 -- For now we do this only for conversions of discrete types.
6192 if Nkind (N) = N_Type_Conversion
6193 and then Is_Discrete_Type (Etype (N))
6196 Expr : constant Node_Id := Expression (N);
6201 if Do_Range_Check (Expr)
6202 and then Is_Discrete_Type (Etype (Expr))
6204 Set_Do_Range_Check (Expr, False);
6206 -- Before we do a range check, we have to deal with treating
6207 -- a fixed-point operand as an integer. The way we do this
6208 -- is simply to do an unchecked conversion to an appropriate
6209 -- integer type large enough to hold the result.
6211 -- This code is not active yet, because we are only dealing
6212 -- with discrete types so far ???
6214 if Nkind (Expr) in N_Has_Treat_Fixed_As_Integer
6215 and then Treat_Fixed_As_Integer (Expr)
6217 Ftyp := Base_Type (Etype (Expr));
6219 if Esize (Ftyp) >= Esize (Standard_Integer) then
6220 Ityp := Standard_Long_Long_Integer;
6222 Ityp := Standard_Integer;
6225 Rewrite (Expr, Unchecked_Convert_To (Ityp, Expr));
6228 -- Reset overflow flag, since the range check will include
6229 -- dealing with possible overflow, and generate the check
6231 Set_Do_Overflow_Check (N, False);
6232 Generate_Range_Check
6233 (Expr, Target_Type, CE_Range_Check_Failed);
6237 end Expand_N_Type_Conversion;
6239 -----------------------------------
6240 -- Expand_N_Unchecked_Expression --
6241 -----------------------------------
6243 -- Remove the unchecked expression node from the tree. It's job was simply
6244 -- to make sure that its constituent expression was handled with checks
6245 -- off, and now that that is done, we can remove it from the tree, and
6246 -- indeed must, since gigi does not expect to see these nodes.
6248 procedure Expand_N_Unchecked_Expression (N : Node_Id) is
6249 Exp : constant Node_Id := Expression (N);
6252 Set_Assignment_OK (Exp, Assignment_OK (N) or Assignment_OK (Exp));
6254 end Expand_N_Unchecked_Expression;
6256 ----------------------------------------
6257 -- Expand_N_Unchecked_Type_Conversion --
6258 ----------------------------------------
6260 -- If this cannot be handled by Gigi and we haven't already made
6261 -- a temporary for it, do it now.
6263 procedure Expand_N_Unchecked_Type_Conversion (N : Node_Id) is
6264 Target_Type : constant Entity_Id := Etype (N);
6265 Operand : constant Node_Id := Expression (N);
6266 Operand_Type : constant Entity_Id := Etype (Operand);
6269 -- If we have a conversion of a compile time known value to a target
6270 -- type and the value is in range of the target type, then we can simply
6271 -- replace the construct by an integer literal of the correct type. We
6272 -- only apply this to integer types being converted. Possibly it may
6273 -- apply in other cases, but it is too much trouble to worry about.
6275 -- Note that we do not do this transformation if the Kill_Range_Check
6276 -- flag is set, since then the value may be outside the expected range.
6277 -- This happens in the Normalize_Scalars case.
6279 if Is_Integer_Type (Target_Type)
6280 and then Is_Integer_Type (Operand_Type)
6281 and then Compile_Time_Known_Value (Operand)
6282 and then not Kill_Range_Check (N)
6285 Val : constant Uint := Expr_Value (Operand);
6288 if Compile_Time_Known_Value (Type_Low_Bound (Target_Type))
6290 Compile_Time_Known_Value (Type_High_Bound (Target_Type))
6292 Val >= Expr_Value (Type_Low_Bound (Target_Type))
6294 Val <= Expr_Value (Type_High_Bound (Target_Type))
6296 Rewrite (N, Make_Integer_Literal (Sloc (N), Val));
6297 Analyze_And_Resolve (N, Target_Type);
6303 -- Nothing to do if conversion is safe
6305 if Safe_Unchecked_Type_Conversion (N) then
6309 -- Otherwise force evaluation unless Assignment_OK flag is set (this
6310 -- flag indicates ??? -- more comments needed here)
6312 if Assignment_OK (N) then
6315 Force_Evaluation (N);
6317 end Expand_N_Unchecked_Type_Conversion;
6319 ----------------------------
6320 -- Expand_Record_Equality --
6321 ----------------------------
6323 -- For non-variant records, Equality is expanded when needed into:
6325 -- and then Lhs.Discr1 = Rhs.Discr1
6327 -- and then Lhs.Discrn = Rhs.Discrn
6328 -- and then Lhs.Cmp1 = Rhs.Cmp1
6330 -- and then Lhs.Cmpn = Rhs.Cmpn
6332 -- The expression is folded by the back-end for adjacent fields. This
6333 -- function is called for tagged record in only one occasion: for imple-
6334 -- menting predefined primitive equality (see Predefined_Primitives_Bodies)
6335 -- otherwise the primitive "=" is used directly.
6337 function Expand_Record_Equality
6345 Loc : constant Source_Ptr := Sloc (Nod);
6347 function Suitable_Element (C : Entity_Id) return Entity_Id;
6348 -- Return the first field to compare beginning with C, skipping the
6349 -- inherited components
6351 function Suitable_Element (C : Entity_Id) return Entity_Id is
6356 elsif Ekind (C) /= E_Discriminant
6357 and then Ekind (C) /= E_Component
6359 return Suitable_Element (Next_Entity (C));
6361 elsif Is_Tagged_Type (Typ)
6362 and then C /= Original_Record_Component (C)
6364 return Suitable_Element (Next_Entity (C));
6366 elsif Chars (C) = Name_uController
6367 or else Chars (C) = Name_uTag
6369 return Suitable_Element (Next_Entity (C));
6374 end Suitable_Element;
6379 First_Time : Boolean := True;
6381 -- Start of processing for Expand_Record_Equality
6384 -- Special processing for the unchecked union case, which will occur
6385 -- only in the context of tagged types and dynamic dispatching, since
6386 -- other cases are handled statically. We return True, but insert a
6387 -- raise Program_Error statement.
6389 if Is_Unchecked_Union (Typ) then
6391 -- If this is a component of an enclosing record, return the Raise
6392 -- statement directly.
6394 if No (Parent (Lhs)) then
6396 Make_Raise_Program_Error (Loc,
6397 Reason => PE_Unchecked_Union_Restriction);
6398 Set_Etype (Result, Standard_Boolean);
6403 Make_Raise_Program_Error (Loc,
6404 Reason => PE_Unchecked_Union_Restriction));
6405 return New_Occurrence_Of (Standard_True, Loc);
6409 -- Generates the following code: (assuming that Typ has one Discr and
6410 -- component C2 is also a record)
6413 -- and then Lhs.Discr1 = Rhs.Discr1
6414 -- and then Lhs.C1 = Rhs.C1
6415 -- and then Lhs.C2.C1=Rhs.C2.C1 and then ... Lhs.C2.Cn=Rhs.C2.Cn
6417 -- and then Lhs.Cmpn = Rhs.Cmpn
6419 Result := New_Reference_To (Standard_True, Loc);
6420 C := Suitable_Element (First_Entity (Typ));
6422 while Present (C) loop
6430 First_Time := False;
6435 New_Lhs := New_Copy_Tree (Lhs);
6436 New_Rhs := New_Copy_Tree (Rhs);
6441 Left_Opnd => Result,
6443 Expand_Composite_Equality (Nod, Etype (C),
6445 Make_Selected_Component (Loc,
6447 Selector_Name => New_Reference_To (C, Loc)),
6449 Make_Selected_Component (Loc,
6451 Selector_Name => New_Reference_To (C, Loc)),
6455 C := Suitable_Element (Next_Entity (C));
6459 end Expand_Record_Equality;
6461 -------------------------------------
6462 -- Fixup_Universal_Fixed_Operation --
6463 -------------------------------------
6465 procedure Fixup_Universal_Fixed_Operation (N : Node_Id) is
6466 Conv : constant Node_Id := Parent (N);
6469 -- We must have a type conversion immediately above us
6471 pragma Assert (Nkind (Conv) = N_Type_Conversion);
6473 -- Normally the type conversion gives our target type. The exception
6474 -- occurs in the case of the Round attribute, where the conversion
6475 -- will be to universal real, and our real type comes from the Round
6476 -- attribute (as well as an indication that we must round the result)
6478 if Nkind (Parent (Conv)) = N_Attribute_Reference
6479 and then Attribute_Name (Parent (Conv)) = Name_Round
6481 Set_Etype (N, Etype (Parent (Conv)));
6482 Set_Rounded_Result (N);
6484 -- Normal case where type comes from conversion above us
6487 Set_Etype (N, Etype (Conv));
6489 end Fixup_Universal_Fixed_Operation;
6491 ------------------------------
6492 -- Get_Allocator_Final_List --
6493 ------------------------------
6495 function Get_Allocator_Final_List
6501 Loc : constant Source_Ptr := Sloc (N);
6505 -- If the context is an access parameter, we need to create
6506 -- a non-anonymous access type in order to have a usable
6507 -- final list, because there is otherwise no pool to which
6508 -- the allocated object can belong. We create both the type
6509 -- and the finalization chain here, because freezing an
6510 -- internal type does not create such a chain. The Final_Chain
6511 -- that is thus created is shared by the access parameter.
6513 if Ekind (PtrT) = E_Anonymous_Access_Type then
6514 Acc := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
6516 Make_Full_Type_Declaration (Loc,
6517 Defining_Identifier => Acc,
6519 Make_Access_To_Object_Definition (Loc,
6520 Subtype_Indication =>
6521 New_Occurrence_Of (T, Loc))));
6523 Build_Final_List (N, Acc);
6524 Set_Associated_Final_Chain (PtrT, Associated_Final_Chain (Acc));
6525 return Find_Final_List (Acc);
6528 return Find_Final_List (PtrT);
6530 end Get_Allocator_Final_List;
6532 -------------------------------
6533 -- Insert_Dereference_Action --
6534 -------------------------------
6536 procedure Insert_Dereference_Action (N : Node_Id) is
6537 Loc : constant Source_Ptr := Sloc (N);
6538 Typ : constant Entity_Id := Etype (N);
6539 Pool : constant Entity_Id := Associated_Storage_Pool (Typ);
6541 function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean;
6542 -- return true if type of P is derived from Checked_Pool;
6544 function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean is
6553 while T /= Etype (T) loop
6554 if Is_RTE (T, RE_Checked_Pool) then
6562 end Is_Checked_Storage_Pool;
6564 -- Start of processing for Insert_Dereference_Action
6567 if not Comes_From_Source (Parent (N)) then
6570 elsif not Is_Checked_Storage_Pool (Pool) then
6575 Make_Procedure_Call_Statement (Loc,
6576 Name => New_Reference_To (
6577 Find_Prim_Op (Etype (Pool), Name_Dereference), Loc),
6579 Parameter_Associations => New_List (
6583 New_Reference_To (Pool, Loc),
6585 -- Storage_Address. We use the attribute Pool_Address,
6586 -- which uses the pointer itself to find the address of
6587 -- the object, and which handles unconstrained arrays
6588 -- properly by computing the address of the template.
6589 -- i.e. the correct address of the corresponding allocation.
6591 Make_Attribute_Reference (Loc,
6592 Prefix => Duplicate_Subexpr_Move_Checks (N),
6593 Attribute_Name => Name_Pool_Address),
6595 -- Size_In_Storage_Elements
6597 Make_Op_Divide (Loc,
6599 Make_Attribute_Reference (Loc,
6601 Make_Explicit_Dereference (Loc,
6602 Duplicate_Subexpr_Move_Checks (N)),
6603 Attribute_Name => Name_Size),
6605 Make_Integer_Literal (Loc, System_Storage_Unit)),
6609 Make_Attribute_Reference (Loc,
6611 Make_Explicit_Dereference (Loc,
6612 Duplicate_Subexpr_Move_Checks (N)),
6613 Attribute_Name => Name_Alignment))));
6616 when RE_Not_Available =>
6618 end Insert_Dereference_Action;
6620 ------------------------------
6621 -- Make_Array_Comparison_Op --
6622 ------------------------------
6624 -- This is a hand-coded expansion of the following generic function:
6627 -- type elem is (<>);
6628 -- type index is (<>);
6629 -- type a is array (index range <>) of elem;
6631 -- function Gnnn (X : a; Y: a) return boolean is
6632 -- J : index := Y'first;
6635 -- if X'length = 0 then
6638 -- elsif Y'length = 0 then
6642 -- for I in X'range loop
6643 -- if X (I) = Y (J) then
6644 -- if J = Y'last then
6647 -- J := index'succ (J);
6651 -- return X (I) > Y (J);
6655 -- return X'length > Y'length;
6659 -- Note that since we are essentially doing this expansion by hand, we
6660 -- do not need to generate an actual or formal generic part, just the
6661 -- instantiated function itself.
6663 function Make_Array_Comparison_Op
6668 Loc : constant Source_Ptr := Sloc (Nod);
6670 X : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uX);
6671 Y : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uY);
6672 I : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uI);
6673 J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ);
6675 Index : constant Entity_Id := Base_Type (Etype (First_Index (Typ)));
6677 Loop_Statement : Node_Id;
6678 Loop_Body : Node_Id;
6681 Final_Expr : Node_Id;
6682 Func_Body : Node_Id;
6683 Func_Name : Entity_Id;
6689 -- if J = Y'last then
6692 -- J := index'succ (J);
6696 Make_Implicit_If_Statement (Nod,
6699 Left_Opnd => New_Reference_To (J, Loc),
6701 Make_Attribute_Reference (Loc,
6702 Prefix => New_Reference_To (Y, Loc),
6703 Attribute_Name => Name_Last)),
6705 Then_Statements => New_List (
6706 Make_Exit_Statement (Loc)),
6710 Make_Assignment_Statement (Loc,
6711 Name => New_Reference_To (J, Loc),
6713 Make_Attribute_Reference (Loc,
6714 Prefix => New_Reference_To (Index, Loc),
6715 Attribute_Name => Name_Succ,
6716 Expressions => New_List (New_Reference_To (J, Loc))))));
6718 -- if X (I) = Y (J) then
6721 -- return X (I) > Y (J);
6725 Make_Implicit_If_Statement (Nod,
6729 Make_Indexed_Component (Loc,
6730 Prefix => New_Reference_To (X, Loc),
6731 Expressions => New_List (New_Reference_To (I, Loc))),
6734 Make_Indexed_Component (Loc,
6735 Prefix => New_Reference_To (Y, Loc),
6736 Expressions => New_List (New_Reference_To (J, Loc)))),
6738 Then_Statements => New_List (Inner_If),
6740 Else_Statements => New_List (
6741 Make_Return_Statement (Loc,
6745 Make_Indexed_Component (Loc,
6746 Prefix => New_Reference_To (X, Loc),
6747 Expressions => New_List (New_Reference_To (I, Loc))),
6750 Make_Indexed_Component (Loc,
6751 Prefix => New_Reference_To (Y, Loc),
6752 Expressions => New_List (
6753 New_Reference_To (J, Loc)))))));
6755 -- for I in X'range loop
6760 Make_Implicit_Loop_Statement (Nod,
6761 Identifier => Empty,
6764 Make_Iteration_Scheme (Loc,
6765 Loop_Parameter_Specification =>
6766 Make_Loop_Parameter_Specification (Loc,
6767 Defining_Identifier => I,
6768 Discrete_Subtype_Definition =>
6769 Make_Attribute_Reference (Loc,
6770 Prefix => New_Reference_To (X, Loc),
6771 Attribute_Name => Name_Range))),
6773 Statements => New_List (Loop_Body));
6775 -- if X'length = 0 then
6777 -- elsif Y'length = 0 then
6780 -- for ... loop ... end loop;
6781 -- return X'length > Y'length;
6785 Make_Attribute_Reference (Loc,
6786 Prefix => New_Reference_To (X, Loc),
6787 Attribute_Name => Name_Length);
6790 Make_Attribute_Reference (Loc,
6791 Prefix => New_Reference_To (Y, Loc),
6792 Attribute_Name => Name_Length);
6796 Left_Opnd => Length1,
6797 Right_Opnd => Length2);
6800 Make_Implicit_If_Statement (Nod,
6804 Make_Attribute_Reference (Loc,
6805 Prefix => New_Reference_To (X, Loc),
6806 Attribute_Name => Name_Length),
6808 Make_Integer_Literal (Loc, 0)),
6812 Make_Return_Statement (Loc,
6813 Expression => New_Reference_To (Standard_False, Loc))),
6815 Elsif_Parts => New_List (
6816 Make_Elsif_Part (Loc,
6820 Make_Attribute_Reference (Loc,
6821 Prefix => New_Reference_To (Y, Loc),
6822 Attribute_Name => Name_Length),
6824 Make_Integer_Literal (Loc, 0)),
6828 Make_Return_Statement (Loc,
6829 Expression => New_Reference_To (Standard_True, Loc))))),
6831 Else_Statements => New_List (
6833 Make_Return_Statement (Loc,
6834 Expression => Final_Expr)));
6838 Formals := New_List (
6839 Make_Parameter_Specification (Loc,
6840 Defining_Identifier => X,
6841 Parameter_Type => New_Reference_To (Typ, Loc)),
6843 Make_Parameter_Specification (Loc,
6844 Defining_Identifier => Y,
6845 Parameter_Type => New_Reference_To (Typ, Loc)));
6847 -- function Gnnn (...) return boolean is
6848 -- J : index := Y'first;
6853 Func_Name := Make_Defining_Identifier (Loc, New_Internal_Name ('G'));
6856 Make_Subprogram_Body (Loc,
6858 Make_Function_Specification (Loc,
6859 Defining_Unit_Name => Func_Name,
6860 Parameter_Specifications => Formals,
6861 Subtype_Mark => New_Reference_To (Standard_Boolean, Loc)),
6863 Declarations => New_List (
6864 Make_Object_Declaration (Loc,
6865 Defining_Identifier => J,
6866 Object_Definition => New_Reference_To (Index, Loc),
6868 Make_Attribute_Reference (Loc,
6869 Prefix => New_Reference_To (Y, Loc),
6870 Attribute_Name => Name_First))),
6872 Handled_Statement_Sequence =>
6873 Make_Handled_Sequence_Of_Statements (Loc,
6874 Statements => New_List (If_Stat)));
6878 end Make_Array_Comparison_Op;
6880 ---------------------------
6881 -- Make_Boolean_Array_Op --
6882 ---------------------------
6884 -- For logical operations on boolean arrays, expand in line the
6885 -- following, replacing 'and' with 'or' or 'xor' where needed:
6887 -- function Annn (A : typ; B: typ) return typ is
6890 -- for J in A'range loop
6891 -- C (J) := A (J) op B (J);
6896 -- Here typ is the boolean array type
6898 function Make_Boolean_Array_Op
6903 Loc : constant Source_Ptr := Sloc (N);
6905 A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA);
6906 B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB);
6907 C : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uC);
6908 J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ);
6916 Func_Name : Entity_Id;
6917 Func_Body : Node_Id;
6918 Loop_Statement : Node_Id;
6922 Make_Indexed_Component (Loc,
6923 Prefix => New_Reference_To (A, Loc),
6924 Expressions => New_List (New_Reference_To (J, Loc)));
6927 Make_Indexed_Component (Loc,
6928 Prefix => New_Reference_To (B, Loc),
6929 Expressions => New_List (New_Reference_To (J, Loc)));
6932 Make_Indexed_Component (Loc,
6933 Prefix => New_Reference_To (C, Loc),
6934 Expressions => New_List (New_Reference_To (J, Loc)));
6936 if Nkind (N) = N_Op_And then
6942 elsif Nkind (N) = N_Op_Or then
6956 Make_Implicit_Loop_Statement (N,
6957 Identifier => Empty,
6960 Make_Iteration_Scheme (Loc,
6961 Loop_Parameter_Specification =>
6962 Make_Loop_Parameter_Specification (Loc,
6963 Defining_Identifier => J,
6964 Discrete_Subtype_Definition =>
6965 Make_Attribute_Reference (Loc,
6966 Prefix => New_Reference_To (A, Loc),
6967 Attribute_Name => Name_Range))),
6969 Statements => New_List (
6970 Make_Assignment_Statement (Loc,
6972 Expression => Op)));
6974 Formals := New_List (
6975 Make_Parameter_Specification (Loc,
6976 Defining_Identifier => A,
6977 Parameter_Type => New_Reference_To (Typ, Loc)),
6979 Make_Parameter_Specification (Loc,
6980 Defining_Identifier => B,
6981 Parameter_Type => New_Reference_To (Typ, Loc)));
6984 Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
6985 Set_Is_Inlined (Func_Name);
6988 Make_Subprogram_Body (Loc,
6990 Make_Function_Specification (Loc,
6991 Defining_Unit_Name => Func_Name,
6992 Parameter_Specifications => Formals,
6993 Subtype_Mark => New_Reference_To (Typ, Loc)),
6995 Declarations => New_List (
6996 Make_Object_Declaration (Loc,
6997 Defining_Identifier => C,
6998 Object_Definition => New_Reference_To (Typ, Loc))),
7000 Handled_Statement_Sequence =>
7001 Make_Handled_Sequence_Of_Statements (Loc,
7002 Statements => New_List (
7004 Make_Return_Statement (Loc,
7005 Expression => New_Reference_To (C, Loc)))));
7008 end Make_Boolean_Array_Op;
7010 ------------------------
7011 -- Rewrite_Comparison --
7012 ------------------------
7014 procedure Rewrite_Comparison (N : Node_Id) is
7015 Typ : constant Entity_Id := Etype (N);
7016 Op1 : constant Node_Id := Left_Opnd (N);
7017 Op2 : constant Node_Id := Right_Opnd (N);
7019 Res : constant Compare_Result := Compile_Time_Compare (Op1, Op2);
7020 -- Res indicates if compare outcome can be determined at compile time
7022 True_Result : Boolean;
7023 False_Result : Boolean;
7026 case N_Op_Compare (Nkind (N)) is
7028 True_Result := Res = EQ;
7029 False_Result := Res = LT or else Res = GT or else Res = NE;
7032 True_Result := Res in Compare_GE;
7033 False_Result := Res = LT;
7036 True_Result := Res = GT;
7037 False_Result := Res in Compare_LE;
7040 True_Result := Res = LT;
7041 False_Result := Res in Compare_GE;
7044 True_Result := Res in Compare_LE;
7045 False_Result := Res = GT;
7048 True_Result := Res = NE;
7049 False_Result := Res = LT or else Res = GT or else Res = EQ;
7054 Convert_To (Typ, New_Occurrence_Of (Standard_True, Sloc (N))));
7055 Analyze_And_Resolve (N, Typ);
7056 Warn_On_Known_Condition (N);
7058 elsif False_Result then
7060 Convert_To (Typ, New_Occurrence_Of (Standard_False, Sloc (N))));
7061 Analyze_And_Resolve (N, Typ);
7062 Warn_On_Known_Condition (N);
7064 end Rewrite_Comparison;
7066 ----------------------------
7067 -- Safe_In_Place_Array_Op --
7068 ----------------------------
7070 function Safe_In_Place_Array_Op
7078 function Is_Safe_Operand (Op : Node_Id) return Boolean;
7079 -- Operand is safe if it cannot overlap part of the target of the
7080 -- operation. If the operand and the target are identical, the operand
7081 -- is safe. The operand can be empty in the case of negation.
7083 function Is_Unaliased (N : Node_Id) return Boolean;
7084 -- Check that N is a stand-alone entity.
7090 function Is_Unaliased (N : Node_Id) return Boolean is
7094 and then No (Address_Clause (Entity (N)))
7095 and then No (Renamed_Object (Entity (N)));
7098 ---------------------
7099 -- Is_Safe_Operand --
7100 ---------------------
7102 function Is_Safe_Operand (Op : Node_Id) return Boolean is
7107 elsif Is_Entity_Name (Op) then
7108 return Is_Unaliased (Op);
7110 elsif Nkind (Op) = N_Indexed_Component
7111 or else Nkind (Op) = N_Selected_Component
7113 return Is_Unaliased (Prefix (Op));
7115 elsif Nkind (Op) = N_Slice then
7117 Is_Unaliased (Prefix (Op))
7118 and then Entity (Prefix (Op)) /= Target;
7120 elsif Nkind (Op) = N_Op_Not then
7121 return Is_Safe_Operand (Right_Opnd (Op));
7126 end Is_Safe_Operand;
7128 -- Start of processing for Is_Safe_In_Place_Array_Op
7131 -- We skip this processing if the component size is not the
7132 -- same as a system storage unit (since at least for NOT
7133 -- this would cause problems).
7135 if Component_Size (Etype (Lhs)) /= System_Storage_Unit then
7138 -- Cannot do in place stuff on Java_VM since cannot pass addresses
7143 -- Cannot do in place stuff if non-standard Boolean representation
7145 elsif Has_Non_Standard_Rep (Component_Type (Etype (Lhs))) then
7148 elsif not Is_Unaliased (Lhs) then
7151 Target := Entity (Lhs);
7154 Is_Safe_Operand (Op1)
7155 and then Is_Safe_Operand (Op2);
7157 end Safe_In_Place_Array_Op;
7159 -----------------------
7160 -- Tagged_Membership --
7161 -----------------------
7163 -- There are two different cases to consider depending on whether
7164 -- the right operand is a class-wide type or not. If not we just
7165 -- compare the actual tag of the left expr to the target type tag:
7167 -- Left_Expr.Tag = Right_Type'Tag;
7169 -- If it is a class-wide type we use the RT function CW_Membership which
7170 -- is usually implemented by looking in the ancestor tables contained in
7171 -- the dispatch table pointed by Left_Expr.Tag for Typ'Tag
7173 function Tagged_Membership (N : Node_Id) return Node_Id is
7174 Left : constant Node_Id := Left_Opnd (N);
7175 Right : constant Node_Id := Right_Opnd (N);
7176 Loc : constant Source_Ptr := Sloc (N);
7178 Left_Type : Entity_Id;
7179 Right_Type : Entity_Id;
7183 Left_Type := Etype (Left);
7184 Right_Type := Etype (Right);
7186 if Is_Class_Wide_Type (Left_Type) then
7187 Left_Type := Root_Type (Left_Type);
7191 Make_Selected_Component (Loc,
7192 Prefix => Relocate_Node (Left),
7193 Selector_Name => New_Reference_To (Tag_Component (Left_Type), Loc));
7195 if Is_Class_Wide_Type (Right_Type) then
7197 Make_DT_Access_Action (Left_Type,
7198 Action => CW_Membership,
7202 Access_Disp_Table (Root_Type (Right_Type)), Loc)));
7206 Left_Opnd => Obj_Tag,
7208 New_Reference_To (Access_Disp_Table (Right_Type), Loc));
7211 end Tagged_Membership;
7213 ------------------------------
7214 -- Unary_Op_Validity_Checks --
7215 ------------------------------
7217 procedure Unary_Op_Validity_Checks (N : Node_Id) is
7219 if Validity_Checks_On and Validity_Check_Operands then
7220 Ensure_Valid (Right_Opnd (N));
7222 end Unary_Op_Validity_Checks;