1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Checks; use Checks;
28 with Debug; use Debug;
29 with Einfo; use Einfo;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Exp_Aggr; use Exp_Aggr;
33 with Exp_Ch6; use Exp_Ch6;
34 with Exp_Ch7; use Exp_Ch7;
35 with Inline; use Inline;
36 with Itypes; use Itypes;
38 with Nlists; use Nlists;
39 with Nmake; use Nmake;
41 with Restrict; use Restrict;
42 with Rident; use Rident;
44 with Sem_Aux; use Sem_Aux;
45 with Sem_Ch8; use Sem_Ch8;
46 with Sem_Eval; use Sem_Eval;
47 with Sem_Res; use Sem_Res;
48 with Sem_Type; use Sem_Type;
49 with Sem_Util; use Sem_Util;
50 with Snames; use Snames;
51 with Stand; use Stand;
52 with Stringt; use Stringt;
53 with Targparm; use Targparm;
54 with Tbuild; use Tbuild;
55 with Ttypes; use Ttypes;
56 with Uintp; use Uintp;
57 with Urealp; use Urealp;
58 with Validsw; use Validsw;
60 package body Exp_Util is
62 -----------------------
63 -- Local Subprograms --
64 -----------------------
66 function Build_Task_Array_Image
70 Dyn : Boolean := False) return Node_Id;
71 -- Build function to generate the image string for a task that is an
72 -- array component, concatenating the images of each index. To avoid
73 -- storage leaks, the string is built with successive slice assignments.
74 -- The flag Dyn indicates whether this is called for the initialization
75 -- procedure of an array of tasks, or for the name of a dynamically
76 -- created task that is assigned to an indexed component.
78 function Build_Task_Image_Function
82 Res : Entity_Id) return Node_Id;
83 -- Common processing for Task_Array_Image and Task_Record_Image.
84 -- Build function body that computes image.
86 procedure Build_Task_Image_Prefix
95 -- Common processing for Task_Array_Image and Task_Record_Image.
96 -- Create local variables and assign prefix of name to result string.
98 function Build_Task_Record_Image
101 Dyn : Boolean := False) return Node_Id;
102 -- Build function to generate the image string for a task that is a
103 -- record component. Concatenate name of variable with that of selector.
104 -- The flag Dyn indicates whether this is called for the initialization
105 -- procedure of record with task components, or for a dynamically
106 -- created task that is assigned to a selected component.
108 function Make_CW_Equivalent_Type
110 E : Node_Id) return Entity_Id;
111 -- T is a class-wide type entity, E is the initial expression node that
112 -- constrains T in case such as: " X: T := E" or "new T'(E)"
113 -- This function returns the entity of the Equivalent type and inserts
114 -- on the fly the necessary declaration such as:
116 -- type anon is record
117 -- _parent : Root_Type (T); constrained with E discriminants (if any)
118 -- Extension : String (1 .. expr to match size of E);
121 -- This record is compatible with any object of the class of T thanks
122 -- to the first field and has the same size as E thanks to the second.
124 function Make_Literal_Range
126 Literal_Typ : Entity_Id) return Node_Id;
127 -- Produce a Range node whose bounds are:
128 -- Low_Bound (Literal_Type) ..
129 -- Low_Bound (Literal_Type) + (Length (Literal_Typ) - 1)
130 -- this is used for expanding declarations like X : String := "sdfgdfg";
132 -- If the index type of the target array is not integer, we generate:
133 -- Low_Bound (Literal_Type) ..
135 -- (Literal_Type'Pos (Low_Bound (Literal_Type))
136 -- + (Length (Literal_Typ) -1))
138 function Make_Non_Empty_Check
140 N : Node_Id) return Node_Id;
141 -- Produce a boolean expression checking that the unidimensional array
142 -- node N is not empty.
144 function New_Class_Wide_Subtype
146 N : Node_Id) return Entity_Id;
147 -- Create an implicit subtype of CW_Typ attached to node N
149 ----------------------
150 -- Adjust_Condition --
151 ----------------------
153 procedure Adjust_Condition (N : Node_Id) is
160 Loc : constant Source_Ptr := Sloc (N);
161 T : constant Entity_Id := Etype (N);
165 -- For now, we simply ignore a call where the argument has no
166 -- type (probably case of unanalyzed condition), or has a type
167 -- that is not Boolean. This is because this is a pretty marginal
168 -- piece of functionality, and violations of these rules are
169 -- likely to be truly marginal (how much code uses Fortran Logical
170 -- as the barrier to a protected entry?) and we do not want to
171 -- blow up existing programs. We can change this to an assertion
172 -- after 3.12a is released ???
174 if No (T) or else not Is_Boolean_Type (T) then
178 -- Apply validity checking if needed
180 if Validity_Checks_On and Validity_Check_Tests then
184 -- Immediate return if standard boolean, the most common case,
185 -- where nothing needs to be done.
187 if Base_Type (T) = Standard_Boolean then
191 -- Case of zero/non-zero semantics or non-standard enumeration
192 -- representation. In each case, we rewrite the node as:
194 -- ityp!(N) /= False'Enum_Rep
196 -- where ityp is an integer type with large enough size to hold
197 -- any value of type T.
199 if Nonzero_Is_True (T) or else Has_Non_Standard_Rep (T) then
200 if Esize (T) <= Esize (Standard_Integer) then
201 Ti := Standard_Integer;
203 Ti := Standard_Long_Long_Integer;
208 Left_Opnd => Unchecked_Convert_To (Ti, N),
210 Make_Attribute_Reference (Loc,
211 Attribute_Name => Name_Enum_Rep,
213 New_Occurrence_Of (First_Literal (T), Loc))));
214 Analyze_And_Resolve (N, Standard_Boolean);
217 Rewrite (N, Convert_To (Standard_Boolean, N));
218 Analyze_And_Resolve (N, Standard_Boolean);
221 end Adjust_Condition;
223 ------------------------
224 -- Adjust_Result_Type --
225 ------------------------
227 procedure Adjust_Result_Type (N : Node_Id; T : Entity_Id) is
229 -- Ignore call if current type is not Standard.Boolean
231 if Etype (N) /= Standard_Boolean then
235 -- If result is already of correct type, nothing to do. Note that
236 -- this will get the most common case where everything has a type
237 -- of Standard.Boolean.
239 if Base_Type (T) = Standard_Boolean then
244 KP : constant Node_Kind := Nkind (Parent (N));
247 -- If result is to be used as a Condition in the syntax, no need
248 -- to convert it back, since if it was changed to Standard.Boolean
249 -- using Adjust_Condition, that is just fine for this usage.
251 if KP in N_Raise_xxx_Error or else KP in N_Has_Condition then
254 -- If result is an operand of another logical operation, no need
255 -- to reset its type, since Standard.Boolean is just fine, and
256 -- such operations always do Adjust_Condition on their operands.
258 elsif KP in N_Op_Boolean
259 or else KP = N_And_Then
260 or else KP = N_Or_Else
261 or else KP = N_Op_Not
265 -- Otherwise we perform a conversion from the current type,
266 -- which must be Standard.Boolean, to the desired type.
270 Rewrite (N, Convert_To (T, N));
271 Analyze_And_Resolve (N, T);
275 end Adjust_Result_Type;
277 --------------------------
278 -- Append_Freeze_Action --
279 --------------------------
281 procedure Append_Freeze_Action (T : Entity_Id; N : Node_Id) is
285 Ensure_Freeze_Node (T);
286 Fnode := Freeze_Node (T);
288 if No (Actions (Fnode)) then
289 Set_Actions (Fnode, New_List);
292 Append (N, Actions (Fnode));
293 end Append_Freeze_Action;
295 ---------------------------
296 -- Append_Freeze_Actions --
297 ---------------------------
299 procedure Append_Freeze_Actions (T : Entity_Id; L : List_Id) is
300 Fnode : constant Node_Id := Freeze_Node (T);
307 if No (Actions (Fnode)) then
308 Set_Actions (Fnode, L);
311 Append_List (L, Actions (Fnode));
315 end Append_Freeze_Actions;
317 ------------------------
318 -- Build_Runtime_Call --
319 ------------------------
321 function Build_Runtime_Call (Loc : Source_Ptr; RE : RE_Id) return Node_Id is
323 -- If entity is not available, we can skip making the call (this avoids
324 -- junk duplicated error messages in a number of cases).
326 if not RTE_Available (RE) then
327 return Make_Null_Statement (Loc);
330 Make_Procedure_Call_Statement (Loc,
331 Name => New_Reference_To (RTE (RE), Loc));
333 end Build_Runtime_Call;
335 ----------------------------
336 -- Build_Task_Array_Image --
337 ----------------------------
339 -- This function generates the body for a function that constructs the
340 -- image string for a task that is an array component. The function is
341 -- local to the init proc for the array type, and is called for each one
342 -- of the components. The constructed image has the form of an indexed
343 -- component, whose prefix is the outer variable of the array type.
344 -- The n-dimensional array type has known indices Index, Index2...
345 -- Id_Ref is an indexed component form created by the enclosing init proc.
346 -- Its successive indices are Val1, Val2, ... which are the loop variables
347 -- in the loops that call the individual task init proc on each component.
349 -- The generated function has the following structure:
351 -- function F return String is
352 -- Pref : string renames Task_Name;
353 -- T1 : String := Index1'Image (Val1);
355 -- Tn : String := indexn'image (Valn);
356 -- Len : Integer := T1'Length + ... + Tn'Length + n + 1;
357 -- -- Len includes commas and the end parentheses.
358 -- Res : String (1..Len);
359 -- Pos : Integer := Pref'Length;
362 -- Res (1 .. Pos) := Pref;
366 -- Res (Pos .. Pos + T1'Length - 1) := T1;
367 -- Pos := Pos + T1'Length;
371 -- Res (Pos .. Pos + Tn'Length - 1) := Tn;
377 -- Needless to say, multidimensional arrays of tasks are rare enough
378 -- that the bulkiness of this code is not really a concern.
380 function Build_Task_Array_Image
384 Dyn : Boolean := False) return Node_Id
386 Dims : constant Nat := Number_Dimensions (A_Type);
387 -- Number of dimensions for array of tasks
389 Temps : array (1 .. Dims) of Entity_Id;
390 -- Array of temporaries to hold string for each index
396 -- Total length of generated name
399 -- Running index for substring assignments
402 -- Name of enclosing variable, prefix of resulting name
405 -- String to hold result
408 -- Value of successive indices
411 -- Expression to compute total size of string
414 -- Entity for name at one index position
416 Decls : constant List_Id := New_List;
417 Stats : constant List_Id := New_List;
420 Pref := Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
422 -- For a dynamic task, the name comes from the target variable.
423 -- For a static one it is a formal of the enclosing init proc.
426 Get_Name_String (Chars (Entity (Prefix (Id_Ref))));
428 Make_Object_Declaration (Loc,
429 Defining_Identifier => Pref,
430 Object_Definition => New_Occurrence_Of (Standard_String, Loc),
432 Make_String_Literal (Loc,
433 Strval => String_From_Name_Buffer)));
437 Make_Object_Renaming_Declaration (Loc,
438 Defining_Identifier => Pref,
439 Subtype_Mark => New_Occurrence_Of (Standard_String, Loc),
440 Name => Make_Identifier (Loc, Name_uTask_Name)));
443 Indx := First_Index (A_Type);
444 Val := First (Expressions (Id_Ref));
446 for J in 1 .. Dims loop
447 T := Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
451 Make_Object_Declaration (Loc,
452 Defining_Identifier => T,
453 Object_Definition => New_Occurrence_Of (Standard_String, Loc),
455 Make_Attribute_Reference (Loc,
456 Attribute_Name => Name_Image,
458 New_Occurrence_Of (Etype (Indx), Loc),
459 Expressions => New_List (
460 New_Copy_Tree (Val)))));
466 Sum := Make_Integer_Literal (Loc, Dims + 1);
472 Make_Attribute_Reference (Loc,
473 Attribute_Name => Name_Length,
475 New_Occurrence_Of (Pref, Loc),
476 Expressions => New_List (Make_Integer_Literal (Loc, 1))));
478 for J in 1 .. Dims loop
483 Make_Attribute_Reference (Loc,
484 Attribute_Name => Name_Length,
486 New_Occurrence_Of (Temps (J), Loc),
487 Expressions => New_List (Make_Integer_Literal (Loc, 1))));
490 Build_Task_Image_Prefix (Loc, Len, Res, Pos, Pref, Sum, Decls, Stats);
492 Set_Character_Literal_Name (Char_Code (Character'Pos ('(')));
495 Make_Assignment_Statement (Loc,
496 Name => Make_Indexed_Component (Loc,
497 Prefix => New_Occurrence_Of (Res, Loc),
498 Expressions => New_List (New_Occurrence_Of (Pos, Loc))),
500 Make_Character_Literal (Loc,
502 Char_Literal_Value =>
503 UI_From_Int (Character'Pos ('(')))));
506 Make_Assignment_Statement (Loc,
507 Name => New_Occurrence_Of (Pos, Loc),
510 Left_Opnd => New_Occurrence_Of (Pos, Loc),
511 Right_Opnd => Make_Integer_Literal (Loc, 1))));
513 for J in 1 .. Dims loop
516 Make_Assignment_Statement (Loc,
517 Name => Make_Slice (Loc,
518 Prefix => New_Occurrence_Of (Res, Loc),
521 Low_Bound => New_Occurrence_Of (Pos, Loc),
522 High_Bound => Make_Op_Subtract (Loc,
525 Left_Opnd => New_Occurrence_Of (Pos, Loc),
527 Make_Attribute_Reference (Loc,
528 Attribute_Name => Name_Length,
530 New_Occurrence_Of (Temps (J), Loc),
532 New_List (Make_Integer_Literal (Loc, 1)))),
533 Right_Opnd => Make_Integer_Literal (Loc, 1)))),
535 Expression => New_Occurrence_Of (Temps (J), Loc)));
539 Make_Assignment_Statement (Loc,
540 Name => New_Occurrence_Of (Pos, Loc),
543 Left_Opnd => New_Occurrence_Of (Pos, Loc),
545 Make_Attribute_Reference (Loc,
546 Attribute_Name => Name_Length,
547 Prefix => New_Occurrence_Of (Temps (J), Loc),
549 New_List (Make_Integer_Literal (Loc, 1))))));
551 Set_Character_Literal_Name (Char_Code (Character'Pos (',')));
554 Make_Assignment_Statement (Loc,
555 Name => Make_Indexed_Component (Loc,
556 Prefix => New_Occurrence_Of (Res, Loc),
557 Expressions => New_List (New_Occurrence_Of (Pos, Loc))),
559 Make_Character_Literal (Loc,
561 Char_Literal_Value =>
562 UI_From_Int (Character'Pos (',')))));
565 Make_Assignment_Statement (Loc,
566 Name => New_Occurrence_Of (Pos, Loc),
569 Left_Opnd => New_Occurrence_Of (Pos, Loc),
570 Right_Opnd => Make_Integer_Literal (Loc, 1))));
574 Set_Character_Literal_Name (Char_Code (Character'Pos (')')));
577 Make_Assignment_Statement (Loc,
578 Name => Make_Indexed_Component (Loc,
579 Prefix => New_Occurrence_Of (Res, Loc),
580 Expressions => New_List (New_Occurrence_Of (Len, Loc))),
582 Make_Character_Literal (Loc,
584 Char_Literal_Value =>
585 UI_From_Int (Character'Pos (')')))));
586 return Build_Task_Image_Function (Loc, Decls, Stats, Res);
587 end Build_Task_Array_Image;
589 ----------------------------
590 -- Build_Task_Image_Decls --
591 ----------------------------
593 function Build_Task_Image_Decls
597 In_Init_Proc : Boolean := False) return List_Id
599 Decls : constant List_Id := New_List;
600 T_Id : Entity_Id := Empty;
602 Expr : Node_Id := Empty;
603 Fun : Node_Id := Empty;
604 Is_Dyn : constant Boolean :=
605 Nkind (Parent (Id_Ref)) = N_Assignment_Statement
607 Nkind (Expression (Parent (Id_Ref))) = N_Allocator;
610 -- If Discard_Names or No_Implicit_Heap_Allocations are in effect,
611 -- generate a dummy declaration only.
613 if Restriction_Active (No_Implicit_Heap_Allocations)
614 or else Global_Discard_Names
616 T_Id := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
621 Make_Object_Declaration (Loc,
622 Defining_Identifier => T_Id,
623 Object_Definition => New_Occurrence_Of (Standard_String, Loc),
625 Make_String_Literal (Loc,
626 Strval => String_From_Name_Buffer)));
629 if Nkind (Id_Ref) = N_Identifier
630 or else Nkind (Id_Ref) = N_Defining_Identifier
632 -- For a simple variable, the image of the task is built from
633 -- the name of the variable. To avoid possible conflict with
634 -- the anonymous type created for a single protected object,
635 -- add a numeric suffix.
638 Make_Defining_Identifier (Loc,
639 New_External_Name (Chars (Id_Ref), 'T', 1));
641 Get_Name_String (Chars (Id_Ref));
644 Make_String_Literal (Loc,
645 Strval => String_From_Name_Buffer);
647 elsif Nkind (Id_Ref) = N_Selected_Component then
649 Make_Defining_Identifier (Loc,
650 New_External_Name (Chars (Selector_Name (Id_Ref)), 'T'));
651 Fun := Build_Task_Record_Image (Loc, Id_Ref, Is_Dyn);
653 elsif Nkind (Id_Ref) = N_Indexed_Component then
655 Make_Defining_Identifier (Loc,
656 New_External_Name (Chars (A_Type), 'N'));
658 Fun := Build_Task_Array_Image (Loc, Id_Ref, A_Type, Is_Dyn);
662 if Present (Fun) then
664 Expr := Make_Function_Call (Loc,
665 Name => New_Occurrence_Of (Defining_Entity (Fun), Loc));
667 if not In_Init_Proc and then VM_Target = No_VM then
668 Set_Uses_Sec_Stack (Defining_Entity (Fun));
672 Decl := Make_Object_Declaration (Loc,
673 Defining_Identifier => T_Id,
674 Object_Definition => New_Occurrence_Of (Standard_String, Loc),
675 Constant_Present => True,
678 Append (Decl, Decls);
680 end Build_Task_Image_Decls;
682 -------------------------------
683 -- Build_Task_Image_Function --
684 -------------------------------
686 function Build_Task_Image_Function
690 Res : Entity_Id) return Node_Id
696 Make_Simple_Return_Statement (Loc,
697 Expression => New_Occurrence_Of (Res, Loc)));
699 Spec := Make_Function_Specification (Loc,
700 Defining_Unit_Name =>
701 Make_Defining_Identifier (Loc, New_Internal_Name ('F')),
702 Result_Definition => New_Occurrence_Of (Standard_String, Loc));
704 -- Calls to 'Image use the secondary stack, which must be cleaned
705 -- up after the task name is built.
707 return Make_Subprogram_Body (Loc,
708 Specification => Spec,
709 Declarations => Decls,
710 Handled_Statement_Sequence =>
711 Make_Handled_Sequence_Of_Statements (Loc, Statements => Stats));
712 end Build_Task_Image_Function;
714 -----------------------------
715 -- Build_Task_Image_Prefix --
716 -----------------------------
718 procedure Build_Task_Image_Prefix
729 Len := Make_Defining_Identifier (Loc, New_Internal_Name ('L'));
732 Make_Object_Declaration (Loc,
733 Defining_Identifier => Len,
734 Object_Definition => New_Occurrence_Of (Standard_Integer, Loc),
737 Res := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
740 Make_Object_Declaration (Loc,
741 Defining_Identifier => Res,
743 Make_Subtype_Indication (Loc,
744 Subtype_Mark => New_Occurrence_Of (Standard_String, Loc),
746 Make_Index_Or_Discriminant_Constraint (Loc,
750 Low_Bound => Make_Integer_Literal (Loc, 1),
751 High_Bound => New_Occurrence_Of (Len, Loc)))))));
753 Pos := Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
756 Make_Object_Declaration (Loc,
757 Defining_Identifier => Pos,
758 Object_Definition => New_Occurrence_Of (Standard_Integer, Loc)));
760 -- Pos := Prefix'Length;
763 Make_Assignment_Statement (Loc,
764 Name => New_Occurrence_Of (Pos, Loc),
766 Make_Attribute_Reference (Loc,
767 Attribute_Name => Name_Length,
768 Prefix => New_Occurrence_Of (Prefix, Loc),
770 New_List (Make_Integer_Literal (Loc, 1)))));
772 -- Res (1 .. Pos) := Prefix;
775 Make_Assignment_Statement (Loc,
776 Name => Make_Slice (Loc,
777 Prefix => New_Occurrence_Of (Res, Loc),
780 Low_Bound => Make_Integer_Literal (Loc, 1),
781 High_Bound => New_Occurrence_Of (Pos, Loc))),
783 Expression => New_Occurrence_Of (Prefix, Loc)));
786 Make_Assignment_Statement (Loc,
787 Name => New_Occurrence_Of (Pos, Loc),
790 Left_Opnd => New_Occurrence_Of (Pos, Loc),
791 Right_Opnd => Make_Integer_Literal (Loc, 1))));
792 end Build_Task_Image_Prefix;
794 -----------------------------
795 -- Build_Task_Record_Image --
796 -----------------------------
798 function Build_Task_Record_Image
801 Dyn : Boolean := False) return Node_Id
804 -- Total length of generated name
810 -- String to hold result
813 -- Name of enclosing variable, prefix of resulting name
816 -- Expression to compute total size of string
819 -- Entity for selector name
821 Decls : constant List_Id := New_List;
822 Stats : constant List_Id := New_List;
825 Pref := Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
827 -- For a dynamic task, the name comes from the target variable.
828 -- For a static one it is a formal of the enclosing init proc.
831 Get_Name_String (Chars (Entity (Prefix (Id_Ref))));
833 Make_Object_Declaration (Loc,
834 Defining_Identifier => Pref,
835 Object_Definition => New_Occurrence_Of (Standard_String, Loc),
837 Make_String_Literal (Loc,
838 Strval => String_From_Name_Buffer)));
842 Make_Object_Renaming_Declaration (Loc,
843 Defining_Identifier => Pref,
844 Subtype_Mark => New_Occurrence_Of (Standard_String, Loc),
845 Name => Make_Identifier (Loc, Name_uTask_Name)));
848 Sel := Make_Defining_Identifier (Loc, New_Internal_Name ('S'));
850 Get_Name_String (Chars (Selector_Name (Id_Ref)));
853 Make_Object_Declaration (Loc,
854 Defining_Identifier => Sel,
855 Object_Definition => New_Occurrence_Of (Standard_String, Loc),
857 Make_String_Literal (Loc,
858 Strval => String_From_Name_Buffer)));
860 Sum := Make_Integer_Literal (Loc, Nat (Name_Len + 1));
866 Make_Attribute_Reference (Loc,
867 Attribute_Name => Name_Length,
869 New_Occurrence_Of (Pref, Loc),
870 Expressions => New_List (Make_Integer_Literal (Loc, 1))));
872 Build_Task_Image_Prefix (Loc, Len, Res, Pos, Pref, Sum, Decls, Stats);
874 Set_Character_Literal_Name (Char_Code (Character'Pos ('.')));
879 Make_Assignment_Statement (Loc,
880 Name => Make_Indexed_Component (Loc,
881 Prefix => New_Occurrence_Of (Res, Loc),
882 Expressions => New_List (New_Occurrence_Of (Pos, Loc))),
884 Make_Character_Literal (Loc,
886 Char_Literal_Value =>
887 UI_From_Int (Character'Pos ('.')))));
890 Make_Assignment_Statement (Loc,
891 Name => New_Occurrence_Of (Pos, Loc),
894 Left_Opnd => New_Occurrence_Of (Pos, Loc),
895 Right_Opnd => Make_Integer_Literal (Loc, 1))));
897 -- Res (Pos .. Len) := Selector;
900 Make_Assignment_Statement (Loc,
901 Name => Make_Slice (Loc,
902 Prefix => New_Occurrence_Of (Res, Loc),
905 Low_Bound => New_Occurrence_Of (Pos, Loc),
906 High_Bound => New_Occurrence_Of (Len, Loc))),
907 Expression => New_Occurrence_Of (Sel, Loc)));
909 return Build_Task_Image_Function (Loc, Decls, Stats, Res);
910 end Build_Task_Record_Image;
912 ----------------------------------
913 -- Component_May_Be_Bit_Aligned --
914 ----------------------------------
916 function Component_May_Be_Bit_Aligned (Comp : Entity_Id) return Boolean is
918 -- If no component clause, then everything is fine, since the back end
919 -- never bit-misaligns by default, even if there is a pragma Packed for
922 if No (Component_Clause (Comp)) then
926 -- It is only array and record types that cause trouble
928 if not Is_Record_Type (Etype (Comp))
929 and then not Is_Array_Type (Etype (Comp))
933 -- If we know that we have a small (64 bits or less) record
934 -- or bit-packed array, then everything is fine, since the
935 -- back end can handle these cases correctly.
937 elsif Esize (Comp) <= 64
938 and then (Is_Record_Type (Etype (Comp))
939 or else Is_Bit_Packed_Array (Etype (Comp)))
943 -- Otherwise if the component is not byte aligned, we know we have the
944 -- nasty unaligned case.
946 elsif Normalized_First_Bit (Comp) /= Uint_0
947 or else Esize (Comp) mod System_Storage_Unit /= Uint_0
951 -- If we are large and byte aligned, then OK at this level
956 end Component_May_Be_Bit_Aligned;
958 -----------------------------------
959 -- Corresponding_Runtime_Package --
960 -----------------------------------
962 function Corresponding_Runtime_Package (Typ : Entity_Id) return RTU_Id is
963 Pkg_Id : RTU_Id := RTU_Null;
966 pragma Assert (Is_Concurrent_Type (Typ));
968 if Ekind (Typ) in Protected_Kind then
970 or else Has_Interrupt_Handler (Typ)
971 or else (Has_Attach_Handler (Typ)
972 and then not Restricted_Profile)
974 -- A protected type without entries that covers an interface and
975 -- overrides the abstract routines with protected procedures is
976 -- considered equivalent to a protected type with entries in the
977 -- context of dispatching select statements. It is sufficient to
978 -- check for the presence of an interface list in the declaration
979 -- node to recognize this case.
981 or else Present (Interface_List (Parent (Typ)))
984 or else Restriction_Active (No_Entry_Queue) = False
985 or else Number_Entries (Typ) > 1
986 or else (Has_Attach_Handler (Typ)
987 and then not Restricted_Profile)
989 Pkg_Id := System_Tasking_Protected_Objects_Entries;
991 Pkg_Id := System_Tasking_Protected_Objects_Single_Entry;
995 Pkg_Id := System_Tasking_Protected_Objects;
1000 end Corresponding_Runtime_Package;
1002 -------------------------------
1003 -- Convert_To_Actual_Subtype --
1004 -------------------------------
1006 procedure Convert_To_Actual_Subtype (Exp : Entity_Id) is
1010 Act_ST := Get_Actual_Subtype (Exp);
1012 if Act_ST = Etype (Exp) then
1017 Convert_To (Act_ST, Relocate_Node (Exp)));
1018 Analyze_And_Resolve (Exp, Act_ST);
1020 end Convert_To_Actual_Subtype;
1022 -----------------------------------
1023 -- Current_Sem_Unit_Declarations --
1024 -----------------------------------
1026 function Current_Sem_Unit_Declarations return List_Id is
1027 U : Node_Id := Unit (Cunit (Current_Sem_Unit));
1031 -- If the current unit is a package body, locate the visible
1032 -- declarations of the package spec.
1034 if Nkind (U) = N_Package_Body then
1035 U := Unit (Library_Unit (Cunit (Current_Sem_Unit)));
1038 if Nkind (U) = N_Package_Declaration then
1039 U := Specification (U);
1040 Decls := Visible_Declarations (U);
1044 Set_Visible_Declarations (U, Decls);
1048 Decls := Declarations (U);
1052 Set_Declarations (U, Decls);
1057 end Current_Sem_Unit_Declarations;
1059 -----------------------
1060 -- Duplicate_Subexpr --
1061 -----------------------
1063 function Duplicate_Subexpr
1065 Name_Req : Boolean := False) return Node_Id
1068 Remove_Side_Effects (Exp, Name_Req);
1069 return New_Copy_Tree (Exp);
1070 end Duplicate_Subexpr;
1072 ---------------------------------
1073 -- Duplicate_Subexpr_No_Checks --
1074 ---------------------------------
1076 function Duplicate_Subexpr_No_Checks
1078 Name_Req : Boolean := False) return Node_Id
1083 Remove_Side_Effects (Exp, Name_Req);
1084 New_Exp := New_Copy_Tree (Exp);
1085 Remove_Checks (New_Exp);
1087 end Duplicate_Subexpr_No_Checks;
1089 -----------------------------------
1090 -- Duplicate_Subexpr_Move_Checks --
1091 -----------------------------------
1093 function Duplicate_Subexpr_Move_Checks
1095 Name_Req : Boolean := False) return Node_Id
1100 Remove_Side_Effects (Exp, Name_Req);
1101 New_Exp := New_Copy_Tree (Exp);
1102 Remove_Checks (Exp);
1104 end Duplicate_Subexpr_Move_Checks;
1106 --------------------
1107 -- Ensure_Defined --
1108 --------------------
1110 procedure Ensure_Defined (Typ : Entity_Id; N : Node_Id) is
1114 -- An itype reference must only be created if this is a local
1115 -- itype, so that gigi can elaborate it on the proper objstack.
1118 and then Scope (Typ) = Current_Scope
1120 IR := Make_Itype_Reference (Sloc (N));
1121 Set_Itype (IR, Typ);
1122 Insert_Action (N, IR);
1126 --------------------
1127 -- Entry_Names_OK --
1128 --------------------
1130 function Entry_Names_OK return Boolean is
1133 not Restricted_Profile
1134 and then not Global_Discard_Names
1135 and then not Restriction_Active (No_Implicit_Heap_Allocations)
1136 and then not Restriction_Active (No_Local_Allocators);
1139 ---------------------
1140 -- Evolve_And_Then --
1141 ---------------------
1143 procedure Evolve_And_Then (Cond : in out Node_Id; Cond1 : Node_Id) is
1149 Make_And_Then (Sloc (Cond1),
1151 Right_Opnd => Cond1);
1153 end Evolve_And_Then;
1155 --------------------
1156 -- Evolve_Or_Else --
1157 --------------------
1159 procedure Evolve_Or_Else (Cond : in out Node_Id; Cond1 : Node_Id) is
1165 Make_Or_Else (Sloc (Cond1),
1167 Right_Opnd => Cond1);
1171 ------------------------------
1172 -- Expand_Subtype_From_Expr --
1173 ------------------------------
1175 -- This function is applicable for both static and dynamic allocation of
1176 -- objects which are constrained by an initial expression. Basically it
1177 -- transforms an unconstrained subtype indication into a constrained one.
1178 -- The expression may also be transformed in certain cases in order to
1179 -- avoid multiple evaluation. In the static allocation case, the general
1184 -- is transformed into
1186 -- Val : Constrained_Subtype_of_T := Maybe_Modified_Expr;
1188 -- Here are the main cases :
1190 -- <if Expr is a Slice>
1191 -- Val : T ([Index_Subtype (Expr)]) := Expr;
1193 -- <elsif Expr is a String Literal>
1194 -- Val : T (T'First .. T'First + Length (string literal) - 1) := Expr;
1196 -- <elsif Expr is Constrained>
1197 -- subtype T is Type_Of_Expr
1200 -- <elsif Expr is an entity_name>
1201 -- Val : T (constraints taken from Expr) := Expr;
1204 -- type Axxx is access all T;
1205 -- Rval : Axxx := Expr'ref;
1206 -- Val : T (constraints taken from Rval) := Rval.all;
1208 -- ??? note: when the Expression is allocated in the secondary stack
1209 -- we could use it directly instead of copying it by declaring
1210 -- Val : T (...) renames Rval.all
1212 procedure Expand_Subtype_From_Expr
1214 Unc_Type : Entity_Id;
1215 Subtype_Indic : Node_Id;
1218 Loc : constant Source_Ptr := Sloc (N);
1219 Exp_Typ : constant Entity_Id := Etype (Exp);
1223 -- In general we cannot build the subtype if expansion is disabled,
1224 -- because internal entities may not have been defined. However, to
1225 -- avoid some cascaded errors, we try to continue when the expression
1226 -- is an array (or string), because it is safe to compute the bounds.
1227 -- It is in fact required to do so even in a generic context, because
1228 -- there may be constants that depend on bounds of string literal.
1230 if not Expander_Active
1231 and then (No (Etype (Exp))
1232 or else Base_Type (Etype (Exp)) /= Standard_String)
1237 if Nkind (Exp) = N_Slice then
1239 Slice_Type : constant Entity_Id := Etype (First_Index (Exp_Typ));
1242 Rewrite (Subtype_Indic,
1243 Make_Subtype_Indication (Loc,
1244 Subtype_Mark => New_Reference_To (Unc_Type, Loc),
1246 Make_Index_Or_Discriminant_Constraint (Loc,
1247 Constraints => New_List
1248 (New_Reference_To (Slice_Type, Loc)))));
1250 -- This subtype indication may be used later for constraint checks
1251 -- we better make sure that if a variable was used as a bound of
1252 -- of the original slice, its value is frozen.
1254 Force_Evaluation (Low_Bound (Scalar_Range (Slice_Type)));
1255 Force_Evaluation (High_Bound (Scalar_Range (Slice_Type)));
1258 elsif Ekind (Exp_Typ) = E_String_Literal_Subtype then
1259 Rewrite (Subtype_Indic,
1260 Make_Subtype_Indication (Loc,
1261 Subtype_Mark => New_Reference_To (Unc_Type, Loc),
1263 Make_Index_Or_Discriminant_Constraint (Loc,
1264 Constraints => New_List (
1265 Make_Literal_Range (Loc,
1266 Literal_Typ => Exp_Typ)))));
1268 elsif Is_Constrained (Exp_Typ)
1269 and then not Is_Class_Wide_Type (Unc_Type)
1271 if Is_Itype (Exp_Typ) then
1273 -- Within an initialization procedure, a selected component
1274 -- denotes a component of the enclosing record, and it appears
1275 -- as an actual in a call to its own initialization procedure.
1276 -- If this component depends on the outer discriminant, we must
1277 -- generate the proper actual subtype for it.
1279 if Nkind (Exp) = N_Selected_Component
1280 and then Within_Init_Proc
1283 Decl : constant Node_Id :=
1284 Build_Actual_Subtype_Of_Component (Exp_Typ, Exp);
1286 if Present (Decl) then
1287 Insert_Action (N, Decl);
1288 T := Defining_Identifier (Decl);
1294 -- No need to generate a new one (new what???)
1302 Make_Defining_Identifier (Loc,
1303 Chars => New_Internal_Name ('T'));
1306 Make_Subtype_Declaration (Loc,
1307 Defining_Identifier => T,
1308 Subtype_Indication => New_Reference_To (Exp_Typ, Loc)));
1310 -- This type is marked as an itype even though it has an
1311 -- explicit declaration because otherwise it can be marked
1312 -- with Is_Generic_Actual_Type and generate spurious errors.
1313 -- (see sem_ch8.Analyze_Package_Renaming and sem_type.covers)
1316 Set_Associated_Node_For_Itype (T, Exp);
1319 Rewrite (Subtype_Indic, New_Reference_To (T, Loc));
1321 -- nothing needs to be done for private types with unknown discriminants
1322 -- if the underlying type is not an unconstrained composite type.
1324 elsif Is_Private_Type (Unc_Type)
1325 and then Has_Unknown_Discriminants (Unc_Type)
1326 and then (not Is_Composite_Type (Underlying_Type (Unc_Type))
1327 or else Is_Constrained (Underlying_Type (Unc_Type)))
1331 -- Case of derived type with unknown discriminants where the parent type
1332 -- also has unknown discriminants.
1334 elsif Is_Record_Type (Unc_Type)
1335 and then not Is_Class_Wide_Type (Unc_Type)
1336 and then Has_Unknown_Discriminants (Unc_Type)
1337 and then Has_Unknown_Discriminants (Underlying_Type (Unc_Type))
1339 -- Nothing to be done if no underlying record view available
1341 if No (Underlying_Record_View (Unc_Type)) then
1344 -- Otherwise use the Underlying_Record_View to create the proper
1345 -- constrained subtype for an object of a derived type with unknown
1349 Remove_Side_Effects (Exp);
1350 Rewrite (Subtype_Indic,
1351 Make_Subtype_From_Expr (Exp, Underlying_Record_View (Unc_Type)));
1354 -- In Ada95, Nothing to be done if the type of the expression is
1355 -- limited, because in this case the expression cannot be copied,
1356 -- and its use can only be by reference.
1358 -- In Ada2005, the context can be an object declaration whose expression
1359 -- is a function that returns in place. If the nominal subtype has
1360 -- unknown discriminants, the call still provides constraints on the
1361 -- object, and we have to create an actual subtype from it.
1363 -- If the type is class-wide, the expression is dynamically tagged and
1364 -- we do not create an actual subtype either. Ditto for an interface.
1366 elsif Is_Limited_Type (Exp_Typ)
1368 (Is_Class_Wide_Type (Exp_Typ)
1369 or else Is_Interface (Exp_Typ)
1370 or else not Has_Unknown_Discriminants (Exp_Typ)
1371 or else not Is_Composite_Type (Unc_Type))
1375 -- For limited interfaces, nothing to be done
1377 -- This branch may be redundant once the limited interface issue is
1380 elsif Is_Interface (Exp_Typ)
1381 and then Is_Limited_Interface (Exp_Typ)
1385 -- For limited objects initialized with build in place function calls,
1386 -- nothing to be done; otherwise we prematurely introduce an N_Reference
1387 -- node in the expression initializing the object, which breaks the
1388 -- circuitry that detects and adds the additional arguments to the
1391 elsif Is_Build_In_Place_Function_Call (Exp) then
1395 Remove_Side_Effects (Exp);
1396 Rewrite (Subtype_Indic,
1397 Make_Subtype_From_Expr (Exp, Unc_Type));
1399 end Expand_Subtype_From_Expr;
1401 --------------------
1402 -- Find_Init_Call --
1403 --------------------
1405 function Find_Init_Call
1407 Rep_Clause : Node_Id) return Node_Id
1409 Typ : constant Entity_Id := Etype (Var);
1411 Init_Proc : Entity_Id;
1412 -- Initialization procedure for Typ
1414 function Find_Init_Call_In_List (From : Node_Id) return Node_Id;
1415 -- Look for init call for Var starting at From and scanning the
1416 -- enclosing list until Rep_Clause or the end of the list is reached.
1418 ----------------------------
1419 -- Find_Init_Call_In_List --
1420 ----------------------------
1422 function Find_Init_Call_In_List (From : Node_Id) return Node_Id is
1423 Init_Call : Node_Id;
1427 while Present (Init_Call) and then Init_Call /= Rep_Clause loop
1428 if Nkind (Init_Call) = N_Procedure_Call_Statement
1429 and then Is_Entity_Name (Name (Init_Call))
1430 and then Entity (Name (Init_Call)) = Init_Proc
1438 end Find_Init_Call_In_List;
1440 Init_Call : Node_Id;
1442 -- Start of processing for Find_Init_Call
1445 if not Has_Non_Null_Base_Init_Proc (Typ) then
1446 -- No init proc for the type, so obviously no call to be found
1451 Init_Proc := Base_Init_Proc (Typ);
1453 -- First scan the list containing the declaration of Var
1455 Init_Call := Find_Init_Call_In_List (From => Next (Parent (Var)));
1457 -- If not found, also look on Var's freeze actions list, if any, since
1458 -- the init call may have been moved there (case of an address clause
1459 -- applying to Var).
1461 if No (Init_Call) and then Present (Freeze_Node (Var)) then
1462 Init_Call := Find_Init_Call_In_List
1463 (First (Actions (Freeze_Node (Var))));
1469 ------------------------
1470 -- Find_Interface_ADT --
1471 ------------------------
1473 function Find_Interface_ADT
1475 Iface : Entity_Id) return Elmt_Id
1478 Typ : Entity_Id := T;
1481 pragma Assert (Is_Interface (Iface));
1483 -- Handle private types
1485 if Has_Private_Declaration (Typ)
1486 and then Present (Full_View (Typ))
1488 Typ := Full_View (Typ);
1491 -- Handle access types
1493 if Is_Access_Type (Typ) then
1494 Typ := Directly_Designated_Type (Typ);
1497 -- Handle task and protected types implementing interfaces
1499 if Is_Concurrent_Type (Typ) then
1500 Typ := Corresponding_Record_Type (Typ);
1504 (not Is_Class_Wide_Type (Typ)
1505 and then Ekind (Typ) /= E_Incomplete_Type);
1507 if Is_Ancestor (Iface, Typ) then
1508 return First_Elmt (Access_Disp_Table (Typ));
1512 Next_Elmt (Next_Elmt (First_Elmt (Access_Disp_Table (Typ))));
1514 and then Present (Related_Type (Node (ADT)))
1515 and then Related_Type (Node (ADT)) /= Iface
1516 and then not Is_Ancestor (Iface, Related_Type (Node (ADT)))
1521 pragma Assert (Present (Related_Type (Node (ADT))));
1524 end Find_Interface_ADT;
1526 ------------------------
1527 -- Find_Interface_Tag --
1528 ------------------------
1530 function Find_Interface_Tag
1532 Iface : Entity_Id) return Entity_Id
1535 Found : Boolean := False;
1536 Typ : Entity_Id := T;
1538 procedure Find_Tag (Typ : Entity_Id);
1539 -- Internal subprogram used to recursively climb to the ancestors
1545 procedure Find_Tag (Typ : Entity_Id) is
1550 -- Check if the interface is an immediate ancestor of the type and
1551 -- therefore shares the main tag.
1554 pragma Assert (Etype (First_Tag_Component (Typ)) = RTE (RE_Tag));
1555 AI_Tag := First_Tag_Component (Typ);
1560 -- Climb to the root type handling private types
1562 if Present (Full_View (Etype (Typ))) then
1563 if Full_View (Etype (Typ)) /= Typ then
1564 Find_Tag (Full_View (Etype (Typ)));
1567 elsif Etype (Typ) /= Typ then
1568 Find_Tag (Etype (Typ));
1571 -- Traverse the list of interfaces implemented by the type
1574 and then Present (Interfaces (Typ))
1575 and then not (Is_Empty_Elmt_List (Interfaces (Typ)))
1577 -- Skip the tag associated with the primary table
1579 pragma Assert (Etype (First_Tag_Component (Typ)) = RTE (RE_Tag));
1580 AI_Tag := Next_Tag_Component (First_Tag_Component (Typ));
1581 pragma Assert (Present (AI_Tag));
1583 AI_Elmt := First_Elmt (Interfaces (Typ));
1584 while Present (AI_Elmt) loop
1585 AI := Node (AI_Elmt);
1587 if AI = Iface or else Is_Ancestor (Iface, AI) then
1592 AI_Tag := Next_Tag_Component (AI_Tag);
1593 Next_Elmt (AI_Elmt);
1598 -- Start of processing for Find_Interface_Tag
1601 pragma Assert (Is_Interface (Iface));
1603 -- Handle private types
1605 if Has_Private_Declaration (Typ)
1606 and then Present (Full_View (Typ))
1608 Typ := Full_View (Typ);
1611 -- Handle access types
1613 if Is_Access_Type (Typ) then
1614 Typ := Directly_Designated_Type (Typ);
1617 -- Handle task and protected types implementing interfaces
1619 if Is_Concurrent_Type (Typ) then
1620 Typ := Corresponding_Record_Type (Typ);
1623 if Is_Class_Wide_Type (Typ) then
1627 -- Handle entities from the limited view
1629 if Ekind (Typ) = E_Incomplete_Type then
1630 pragma Assert (Present (Non_Limited_View (Typ)));
1631 Typ := Non_Limited_View (Typ);
1635 pragma Assert (Found);
1637 end Find_Interface_Tag;
1643 function Find_Prim_Op (T : Entity_Id; Name : Name_Id) return Entity_Id is
1645 Typ : Entity_Id := T;
1649 if Is_Class_Wide_Type (Typ) then
1650 Typ := Root_Type (Typ);
1653 Typ := Underlying_Type (Typ);
1655 -- Loop through primitive operations
1657 Prim := First_Elmt (Primitive_Operations (Typ));
1658 while Present (Prim) loop
1661 -- We can retrieve primitive operations by name if it is an internal
1662 -- name. For equality we must check that both of its operands have
1663 -- the same type, to avoid confusion with user-defined equalities
1664 -- than may have a non-symmetric signature.
1666 exit when Chars (Op) = Name
1669 or else Etype (First_Entity (Op)) = Etype (Last_Entity (Op)));
1673 -- Raise Program_Error if no primitive found
1676 raise Program_Error;
1687 function Find_Prim_Op
1689 Name : TSS_Name_Type) return Entity_Id
1692 Typ : Entity_Id := T;
1695 if Is_Class_Wide_Type (Typ) then
1696 Typ := Root_Type (Typ);
1699 Typ := Underlying_Type (Typ);
1701 Prim := First_Elmt (Primitive_Operations (Typ));
1702 while not Is_TSS (Node (Prim), Name) loop
1705 -- Raise program error if no primitive found
1708 raise Program_Error;
1715 ----------------------------
1716 -- Find_Protection_Object --
1717 ----------------------------
1719 function Find_Protection_Object (Scop : Entity_Id) return Entity_Id is
1724 while Present (S) loop
1725 if (Ekind (S) = E_Entry
1726 or else Ekind (S) = E_Entry_Family
1727 or else Ekind (S) = E_Function
1728 or else Ekind (S) = E_Procedure)
1729 and then Present (Protection_Object (S))
1731 return Protection_Object (S);
1737 -- If we do not find a Protection object in the scope chain, then
1738 -- something has gone wrong, most likely the object was never created.
1740 raise Program_Error;
1741 end Find_Protection_Object;
1743 ----------------------
1744 -- Force_Evaluation --
1745 ----------------------
1747 procedure Force_Evaluation (Exp : Node_Id; Name_Req : Boolean := False) is
1749 Remove_Side_Effects (Exp, Name_Req, Variable_Ref => True);
1750 end Force_Evaluation;
1752 ------------------------
1753 -- Generate_Poll_Call --
1754 ------------------------
1756 procedure Generate_Poll_Call (N : Node_Id) is
1758 -- No poll call if polling not active
1760 if not Polling_Required then
1763 -- Otherwise generate require poll call
1766 Insert_Before_And_Analyze (N,
1767 Make_Procedure_Call_Statement (Sloc (N),
1768 Name => New_Occurrence_Of (RTE (RE_Poll), Sloc (N))));
1770 end Generate_Poll_Call;
1772 ---------------------------------
1773 -- Get_Current_Value_Condition --
1774 ---------------------------------
1776 -- Note: the implementation of this procedure is very closely tied to the
1777 -- implementation of Set_Current_Value_Condition. In the Get procedure, we
1778 -- interpret Current_Value fields set by the Set procedure, so the two
1779 -- procedures need to be closely coordinated.
1781 procedure Get_Current_Value_Condition
1786 Loc : constant Source_Ptr := Sloc (Var);
1787 Ent : constant Entity_Id := Entity (Var);
1789 procedure Process_Current_Value_Condition
1792 -- N is an expression which holds either True (S = True) or False (S =
1793 -- False) in the condition. This procedure digs out the expression and
1794 -- if it refers to Ent, sets Op and Val appropriately.
1796 -------------------------------------
1797 -- Process_Current_Value_Condition --
1798 -------------------------------------
1800 procedure Process_Current_Value_Condition
1811 -- Deal with NOT operators, inverting sense
1813 while Nkind (Cond) = N_Op_Not loop
1814 Cond := Right_Opnd (Cond);
1818 -- Deal with AND THEN and AND cases
1820 if Nkind (Cond) = N_And_Then
1821 or else Nkind (Cond) = N_Op_And
1823 -- Don't ever try to invert a condition that is of the form
1824 -- of an AND or AND THEN (since we are not doing sufficiently
1825 -- general processing to allow this).
1827 if Sens = False then
1833 -- Recursively process AND and AND THEN branches
1835 Process_Current_Value_Condition (Left_Opnd (Cond), True);
1837 if Op /= N_Empty then
1841 Process_Current_Value_Condition (Right_Opnd (Cond), True);
1844 -- Case of relational operator
1846 elsif Nkind (Cond) in N_Op_Compare then
1849 -- Invert sense of test if inverted test
1851 if Sens = False then
1853 when N_Op_Eq => Op := N_Op_Ne;
1854 when N_Op_Ne => Op := N_Op_Eq;
1855 when N_Op_Lt => Op := N_Op_Ge;
1856 when N_Op_Gt => Op := N_Op_Le;
1857 when N_Op_Le => Op := N_Op_Gt;
1858 when N_Op_Ge => Op := N_Op_Lt;
1859 when others => raise Program_Error;
1863 -- Case of entity op value
1865 if Is_Entity_Name (Left_Opnd (Cond))
1866 and then Ent = Entity (Left_Opnd (Cond))
1867 and then Compile_Time_Known_Value (Right_Opnd (Cond))
1869 Val := Right_Opnd (Cond);
1871 -- Case of value op entity
1873 elsif Is_Entity_Name (Right_Opnd (Cond))
1874 and then Ent = Entity (Right_Opnd (Cond))
1875 and then Compile_Time_Known_Value (Left_Opnd (Cond))
1877 Val := Left_Opnd (Cond);
1879 -- We are effectively swapping operands
1882 when N_Op_Eq => null;
1883 when N_Op_Ne => null;
1884 when N_Op_Lt => Op := N_Op_Gt;
1885 when N_Op_Gt => Op := N_Op_Lt;
1886 when N_Op_Le => Op := N_Op_Ge;
1887 when N_Op_Ge => Op := N_Op_Le;
1888 when others => raise Program_Error;
1897 -- Case of Boolean variable reference, return as though the
1898 -- reference had said var = True.
1901 if Is_Entity_Name (Cond)
1902 and then Ent = Entity (Cond)
1904 Val := New_Occurrence_Of (Standard_True, Sloc (Cond));
1906 if Sens = False then
1913 end Process_Current_Value_Condition;
1915 -- Start of processing for Get_Current_Value_Condition
1921 -- Immediate return, nothing doing, if this is not an object
1923 if Ekind (Ent) not in Object_Kind then
1927 -- Otherwise examine current value
1930 CV : constant Node_Id := Current_Value (Ent);
1935 -- If statement. Condition is known true in THEN section, known False
1936 -- in any ELSIF or ELSE part, and unknown outside the IF statement.
1938 if Nkind (CV) = N_If_Statement then
1940 -- Before start of IF statement
1942 if Loc < Sloc (CV) then
1945 -- After end of IF statement
1947 elsif Loc >= Sloc (CV) + Text_Ptr (UI_To_Int (End_Span (CV))) then
1951 -- At this stage we know that we are within the IF statement, but
1952 -- unfortunately, the tree does not record the SLOC of the ELSE so
1953 -- we cannot use a simple SLOC comparison to distinguish between
1954 -- the then/else statements, so we have to climb the tree.
1961 while Parent (N) /= CV loop
1964 -- If we fall off the top of the tree, then that's odd, but
1965 -- perhaps it could occur in some error situation, and the
1966 -- safest response is simply to assume that the outcome of
1967 -- the condition is unknown. No point in bombing during an
1968 -- attempt to optimize things.
1975 -- Now we have N pointing to a node whose parent is the IF
1976 -- statement in question, so now we can tell if we are within
1977 -- the THEN statements.
1979 if Is_List_Member (N)
1980 and then List_Containing (N) = Then_Statements (CV)
1984 -- If the variable reference does not come from source, we
1985 -- cannot reliably tell whether it appears in the else part.
1986 -- In particular, if it appears in generated code for a node
1987 -- that requires finalization, it may be attached to a list
1988 -- that has not been yet inserted into the code. For now,
1989 -- treat it as unknown.
1991 elsif not Comes_From_Source (N) then
1994 -- Otherwise we must be in ELSIF or ELSE part
2001 -- ELSIF part. Condition is known true within the referenced
2002 -- ELSIF, known False in any subsequent ELSIF or ELSE part, and
2003 -- unknown before the ELSE part or after the IF statement.
2005 elsif Nkind (CV) = N_Elsif_Part then
2008 -- Before start of ELSIF part
2010 if Loc < Sloc (CV) then
2013 -- After end of IF statement
2015 elsif Loc >= Sloc (Stm) +
2016 Text_Ptr (UI_To_Int (End_Span (Stm)))
2021 -- Again we lack the SLOC of the ELSE, so we need to climb the
2022 -- tree to see if we are within the ELSIF part in question.
2029 while Parent (N) /= Stm loop
2032 -- If we fall off the top of the tree, then that's odd, but
2033 -- perhaps it could occur in some error situation, and the
2034 -- safest response is simply to assume that the outcome of
2035 -- the condition is unknown. No point in bombing during an
2036 -- attempt to optimize things.
2043 -- Now we have N pointing to a node whose parent is the IF
2044 -- statement in question, so see if is the ELSIF part we want.
2045 -- the THEN statements.
2050 -- Otherwise we must be in subsequent ELSIF or ELSE part
2057 -- Iteration scheme of while loop. The condition is known to be
2058 -- true within the body of the loop.
2060 elsif Nkind (CV) = N_Iteration_Scheme then
2062 Loop_Stmt : constant Node_Id := Parent (CV);
2065 -- Before start of body of loop
2067 if Loc < Sloc (Loop_Stmt) then
2070 -- After end of LOOP statement
2072 elsif Loc >= Sloc (End_Label (Loop_Stmt)) then
2075 -- We are within the body of the loop
2082 -- All other cases of Current_Value settings
2088 -- If we fall through here, then we have a reportable condition, Sens
2089 -- is True if the condition is true and False if it needs inverting.
2091 Process_Current_Value_Condition (Condition (CV), Sens);
2093 end Get_Current_Value_Condition;
2095 ---------------------------------
2096 -- Has_Controlled_Coextensions --
2097 ---------------------------------
2099 function Has_Controlled_Coextensions (Typ : Entity_Id) return Boolean is
2104 -- Only consider record types
2106 if Ekind (Typ) /= E_Record_Type
2107 and then Ekind (Typ) /= E_Record_Subtype
2112 if Has_Discriminants (Typ) then
2113 Discr := First_Discriminant (Typ);
2114 while Present (Discr) loop
2115 D_Typ := Etype (Discr);
2117 if Ekind (D_Typ) = E_Anonymous_Access_Type
2119 (Is_Controlled (Directly_Designated_Type (D_Typ))
2121 Is_Concurrent_Type (Directly_Designated_Type (D_Typ)))
2126 Next_Discriminant (Discr);
2131 end Has_Controlled_Coextensions;
2133 --------------------
2134 -- Homonym_Number --
2135 --------------------
2137 function Homonym_Number (Subp : Entity_Id) return Nat is
2143 Hom := Homonym (Subp);
2144 while Present (Hom) loop
2145 if Scope (Hom) = Scope (Subp) then
2149 Hom := Homonym (Hom);
2155 ------------------------------
2156 -- In_Unconditional_Context --
2157 ------------------------------
2159 function In_Unconditional_Context (Node : Node_Id) return Boolean is
2164 while Present (P) loop
2166 when N_Subprogram_Body =>
2169 when N_If_Statement =>
2172 when N_Loop_Statement =>
2175 when N_Case_Statement =>
2184 end In_Unconditional_Context;
2190 procedure Insert_Action (Assoc_Node : Node_Id; Ins_Action : Node_Id) is
2192 if Present (Ins_Action) then
2193 Insert_Actions (Assoc_Node, New_List (Ins_Action));
2197 -- Version with check(s) suppressed
2199 procedure Insert_Action
2200 (Assoc_Node : Node_Id; Ins_Action : Node_Id; Suppress : Check_Id)
2203 Insert_Actions (Assoc_Node, New_List (Ins_Action), Suppress);
2206 --------------------
2207 -- Insert_Actions --
2208 --------------------
2210 procedure Insert_Actions (Assoc_Node : Node_Id; Ins_Actions : List_Id) is
2214 Wrapped_Node : Node_Id := Empty;
2217 if No (Ins_Actions) or else Is_Empty_List (Ins_Actions) then
2221 -- Ignore insert of actions from inside default expression (or other
2222 -- similar "spec expression") in the special spec-expression analyze
2223 -- mode. Any insertions at this point have no relevance, since we are
2224 -- only doing the analyze to freeze the types of any static expressions.
2225 -- See section "Handling of Default Expressions" in the spec of package
2226 -- Sem for further details.
2228 if In_Spec_Expression then
2232 -- If the action derives from stuff inside a record, then the actions
2233 -- are attached to the current scope, to be inserted and analyzed on
2234 -- exit from the scope. The reason for this is that we may also
2235 -- be generating freeze actions at the same time, and they must
2236 -- eventually be elaborated in the correct order.
2238 if Is_Record_Type (Current_Scope)
2239 and then not Is_Frozen (Current_Scope)
2241 if No (Scope_Stack.Table
2242 (Scope_Stack.Last).Pending_Freeze_Actions)
2244 Scope_Stack.Table (Scope_Stack.Last).Pending_Freeze_Actions :=
2249 Scope_Stack.Table (Scope_Stack.Last).Pending_Freeze_Actions);
2255 -- We now intend to climb up the tree to find the right point to
2256 -- insert the actions. We start at Assoc_Node, unless this node is
2257 -- a subexpression in which case we start with its parent. We do this
2258 -- for two reasons. First it speeds things up. Second, if Assoc_Node
2259 -- is itself one of the special nodes like N_And_Then, then we assume
2260 -- that an initial request to insert actions for such a node does not
2261 -- expect the actions to get deposited in the node for later handling
2262 -- when the node is expanded, since clearly the node is being dealt
2263 -- with by the caller. Note that in the subexpression case, N is
2264 -- always the child we came from.
2266 -- N_Raise_xxx_Error is an annoying special case, it is a statement
2267 -- if it has type Standard_Void_Type, and a subexpression otherwise.
2268 -- otherwise. Procedure attribute references are also statements.
2270 if Nkind (Assoc_Node) in N_Subexpr
2271 and then (Nkind (Assoc_Node) in N_Raise_xxx_Error
2272 or else Etype (Assoc_Node) /= Standard_Void_Type)
2273 and then (Nkind (Assoc_Node) /= N_Attribute_Reference
2275 not Is_Procedure_Attribute_Name
2276 (Attribute_Name (Assoc_Node)))
2278 P := Assoc_Node; -- ??? does not agree with above!
2279 N := Parent (Assoc_Node);
2281 -- Non-subexpression case. Note that N is initially Empty in this
2282 -- case (N is only guaranteed Non-Empty in the subexpr case).
2289 -- Capture root of the transient scope
2291 if Scope_Is_Transient then
2292 Wrapped_Node := Node_To_Be_Wrapped;
2296 pragma Assert (Present (P));
2300 -- Case of right operand of AND THEN or OR ELSE. Put the actions
2301 -- in the Actions field of the right operand. They will be moved
2302 -- out further when the AND THEN or OR ELSE operator is expanded.
2303 -- Nothing special needs to be done for the left operand since
2304 -- in that case the actions are executed unconditionally.
2306 when N_And_Then | N_Or_Else =>
2307 if N = Right_Opnd (P) then
2309 -- We are now going to either append the actions to the
2310 -- actions field of the short-circuit operation. We will
2311 -- also analyze the actions now.
2313 -- This analysis is really too early, the proper thing would
2314 -- be to just park them there now, and only analyze them if
2315 -- we find we really need them, and to it at the proper
2316 -- final insertion point. However attempting to this proved
2317 -- tricky, so for now we just kill current values before and
2318 -- after the analyze call to make sure we avoid peculiar
2319 -- optimizations from this out of order insertion.
2321 Kill_Current_Values;
2323 if Present (Actions (P)) then
2324 Insert_List_After_And_Analyze
2325 (Last (Actions (P)), Ins_Actions);
2327 Set_Actions (P, Ins_Actions);
2328 Analyze_List (Actions (P));
2331 Kill_Current_Values;
2336 -- Then or Else operand of conditional expression. Add actions to
2337 -- Then_Actions or Else_Actions field as appropriate. The actions
2338 -- will be moved further out when the conditional is expanded.
2340 when N_Conditional_Expression =>
2342 ThenX : constant Node_Id := Next (First (Expressions (P)));
2343 ElseX : constant Node_Id := Next (ThenX);
2346 -- Actions belong to the then expression, temporarily
2347 -- place them as Then_Actions of the conditional expr.
2348 -- They will be moved to the proper place later when
2349 -- the conditional expression is expanded.
2352 if Present (Then_Actions (P)) then
2353 Insert_List_After_And_Analyze
2354 (Last (Then_Actions (P)), Ins_Actions);
2356 Set_Then_Actions (P, Ins_Actions);
2357 Analyze_List (Then_Actions (P));
2362 -- Actions belong to the else expression, temporarily
2363 -- place them as Else_Actions of the conditional expr.
2364 -- They will be moved to the proper place later when
2365 -- the conditional expression is expanded.
2367 elsif N = ElseX then
2368 if Present (Else_Actions (P)) then
2369 Insert_List_After_And_Analyze
2370 (Last (Else_Actions (P)), Ins_Actions);
2372 Set_Else_Actions (P, Ins_Actions);
2373 Analyze_List (Else_Actions (P));
2378 -- Actions belong to the condition. In this case they are
2379 -- unconditionally executed, and so we can continue the
2380 -- search for the proper insert point.
2387 -- Case of appearing in the condition of a while expression or
2388 -- elsif. We insert the actions into the Condition_Actions field.
2389 -- They will be moved further out when the while loop or elsif
2392 when N_Iteration_Scheme |
2395 if N = Condition (P) then
2396 if Present (Condition_Actions (P)) then
2397 Insert_List_After_And_Analyze
2398 (Last (Condition_Actions (P)), Ins_Actions);
2400 Set_Condition_Actions (P, Ins_Actions);
2402 -- Set the parent of the insert actions explicitly.
2403 -- This is not a syntactic field, but we need the
2404 -- parent field set, in particular so that freeze
2405 -- can understand that it is dealing with condition
2406 -- actions, and properly insert the freezing actions.
2408 Set_Parent (Ins_Actions, P);
2409 Analyze_List (Condition_Actions (P));
2415 -- Statements, declarations, pragmas, representation clauses
2420 N_Procedure_Call_Statement |
2421 N_Statement_Other_Than_Procedure_Call |
2427 -- Representation_Clause
2430 N_Attribute_Definition_Clause |
2431 N_Enumeration_Representation_Clause |
2432 N_Record_Representation_Clause |
2436 N_Abstract_Subprogram_Declaration |
2438 N_Exception_Declaration |
2439 N_Exception_Renaming_Declaration |
2440 N_Formal_Abstract_Subprogram_Declaration |
2441 N_Formal_Concrete_Subprogram_Declaration |
2442 N_Formal_Object_Declaration |
2443 N_Formal_Type_Declaration |
2444 N_Full_Type_Declaration |
2445 N_Function_Instantiation |
2446 N_Generic_Function_Renaming_Declaration |
2447 N_Generic_Package_Declaration |
2448 N_Generic_Package_Renaming_Declaration |
2449 N_Generic_Procedure_Renaming_Declaration |
2450 N_Generic_Subprogram_Declaration |
2451 N_Implicit_Label_Declaration |
2452 N_Incomplete_Type_Declaration |
2453 N_Number_Declaration |
2454 N_Object_Declaration |
2455 N_Object_Renaming_Declaration |
2457 N_Package_Body_Stub |
2458 N_Package_Declaration |
2459 N_Package_Instantiation |
2460 N_Package_Renaming_Declaration |
2461 N_Private_Extension_Declaration |
2462 N_Private_Type_Declaration |
2463 N_Procedure_Instantiation |
2465 N_Protected_Body_Stub |
2466 N_Protected_Type_Declaration |
2467 N_Single_Task_Declaration |
2469 N_Subprogram_Body_Stub |
2470 N_Subprogram_Declaration |
2471 N_Subprogram_Renaming_Declaration |
2472 N_Subtype_Declaration |
2475 N_Task_Type_Declaration |
2477 -- Freeze entity behaves like a declaration or statement
2481 -- Do not insert here if the item is not a list member (this
2482 -- happens for example with a triggering statement, and the
2483 -- proper approach is to insert before the entire select).
2485 if not Is_List_Member (P) then
2488 -- Do not insert if parent of P is an N_Component_Association
2489 -- node (i.e. we are in the context of an N_Aggregate or
2490 -- N_Extension_Aggregate node. In this case we want to insert
2491 -- before the entire aggregate.
2493 elsif Nkind (Parent (P)) = N_Component_Association then
2496 -- Do not insert if the parent of P is either an N_Variant
2497 -- node or an N_Record_Definition node, meaning in either
2498 -- case that P is a member of a component list, and that
2499 -- therefore the actions should be inserted outside the
2500 -- complete record declaration.
2502 elsif Nkind (Parent (P)) = N_Variant
2503 or else Nkind (Parent (P)) = N_Record_Definition
2507 -- Do not insert freeze nodes within the loop generated for
2508 -- an aggregate, because they may be elaborated too late for
2509 -- subsequent use in the back end: within a package spec the
2510 -- loop is part of the elaboration procedure and is only
2511 -- elaborated during the second pass.
2512 -- If the loop comes from source, or the entity is local to
2513 -- the loop itself it must remain within.
2515 elsif Nkind (Parent (P)) = N_Loop_Statement
2516 and then not Comes_From_Source (Parent (P))
2517 and then Nkind (First (Ins_Actions)) = N_Freeze_Entity
2519 Scope (Entity (First (Ins_Actions))) /= Current_Scope
2523 -- Otherwise we can go ahead and do the insertion
2525 elsif P = Wrapped_Node then
2526 Store_Before_Actions_In_Scope (Ins_Actions);
2530 Insert_List_Before_And_Analyze (P, Ins_Actions);
2534 -- A special case, N_Raise_xxx_Error can act either as a
2535 -- statement or a subexpression. We tell the difference
2536 -- by looking at the Etype. It is set to Standard_Void_Type
2537 -- in the statement case.
2540 N_Raise_xxx_Error =>
2541 if Etype (P) = Standard_Void_Type then
2542 if P = Wrapped_Node then
2543 Store_Before_Actions_In_Scope (Ins_Actions);
2545 Insert_List_Before_And_Analyze (P, Ins_Actions);
2550 -- In the subexpression case, keep climbing
2556 -- If a component association appears within a loop created for
2557 -- an array aggregate, attach the actions to the association so
2558 -- they can be subsequently inserted within the loop. For other
2559 -- component associations insert outside of the aggregate. For
2560 -- an association that will generate a loop, its Loop_Actions
2561 -- attribute is already initialized (see exp_aggr.adb).
2563 -- The list of loop_actions can in turn generate additional ones,
2564 -- that are inserted before the associated node. If the associated
2565 -- node is outside the aggregate, the new actions are collected
2566 -- at the end of the loop actions, to respect the order in which
2567 -- they are to be elaborated.
2570 N_Component_Association =>
2571 if Nkind (Parent (P)) = N_Aggregate
2572 and then Present (Loop_Actions (P))
2574 if Is_Empty_List (Loop_Actions (P)) then
2575 Set_Loop_Actions (P, Ins_Actions);
2576 Analyze_List (Ins_Actions);
2583 -- Check whether these actions were generated
2584 -- by a declaration that is part of the loop_
2585 -- actions for the component_association.
2588 while Present (Decl) loop
2589 exit when Parent (Decl) = P
2590 and then Is_List_Member (Decl)
2592 List_Containing (Decl) = Loop_Actions (P);
2593 Decl := Parent (Decl);
2596 if Present (Decl) then
2597 Insert_List_Before_And_Analyze
2598 (Decl, Ins_Actions);
2600 Insert_List_After_And_Analyze
2601 (Last (Loop_Actions (P)), Ins_Actions);
2612 -- Another special case, an attribute denoting a procedure call
2615 N_Attribute_Reference =>
2616 if Is_Procedure_Attribute_Name (Attribute_Name (P)) then
2617 if P = Wrapped_Node then
2618 Store_Before_Actions_In_Scope (Ins_Actions);
2620 Insert_List_Before_And_Analyze (P, Ins_Actions);
2625 -- In the subexpression case, keep climbing
2631 -- For all other node types, keep climbing tree
2635 N_Accept_Alternative |
2636 N_Access_Definition |
2637 N_Access_Function_Definition |
2638 N_Access_Procedure_Definition |
2639 N_Access_To_Object_Definition |
2642 N_Case_Statement_Alternative |
2643 N_Character_Literal |
2644 N_Compilation_Unit |
2645 N_Compilation_Unit_Aux |
2646 N_Component_Clause |
2647 N_Component_Declaration |
2648 N_Component_Definition |
2650 N_Constrained_Array_Definition |
2651 N_Decimal_Fixed_Point_Definition |
2652 N_Defining_Character_Literal |
2653 N_Defining_Identifier |
2654 N_Defining_Operator_Symbol |
2655 N_Defining_Program_Unit_Name |
2656 N_Delay_Alternative |
2657 N_Delta_Constraint |
2658 N_Derived_Type_Definition |
2660 N_Digits_Constraint |
2661 N_Discriminant_Association |
2662 N_Discriminant_Specification |
2664 N_Entry_Body_Formal_Part |
2665 N_Entry_Call_Alternative |
2666 N_Entry_Declaration |
2667 N_Entry_Index_Specification |
2668 N_Enumeration_Type_Definition |
2670 N_Exception_Handler |
2672 N_Explicit_Dereference |
2673 N_Extension_Aggregate |
2674 N_Floating_Point_Definition |
2675 N_Formal_Decimal_Fixed_Point_Definition |
2676 N_Formal_Derived_Type_Definition |
2677 N_Formal_Discrete_Type_Definition |
2678 N_Formal_Floating_Point_Definition |
2679 N_Formal_Modular_Type_Definition |
2680 N_Formal_Ordinary_Fixed_Point_Definition |
2681 N_Formal_Package_Declaration |
2682 N_Formal_Private_Type_Definition |
2683 N_Formal_Signed_Integer_Type_Definition |
2685 N_Function_Specification |
2686 N_Generic_Association |
2687 N_Handled_Sequence_Of_Statements |
2690 N_Index_Or_Discriminant_Constraint |
2691 N_Indexed_Component |
2695 N_Loop_Parameter_Specification |
2697 N_Modular_Type_Definition |
2723 N_Op_Shift_Right_Arithmetic |
2727 N_Ordinary_Fixed_Point_Definition |
2729 N_Package_Specification |
2730 N_Parameter_Association |
2731 N_Parameter_Specification |
2732 N_Pop_Constraint_Error_Label |
2733 N_Pop_Program_Error_Label |
2734 N_Pop_Storage_Error_Label |
2735 N_Pragma_Argument_Association |
2736 N_Procedure_Specification |
2737 N_Protected_Definition |
2738 N_Push_Constraint_Error_Label |
2739 N_Push_Program_Error_Label |
2740 N_Push_Storage_Error_Label |
2741 N_Qualified_Expression |
2743 N_Range_Constraint |
2745 N_Real_Range_Specification |
2746 N_Record_Definition |
2748 N_Selected_Component |
2749 N_Signed_Integer_Type_Definition |
2750 N_Single_Protected_Declaration |
2754 N_Subtype_Indication |
2757 N_Terminate_Alternative |
2758 N_Triggering_Alternative |
2760 N_Unchecked_Expression |
2761 N_Unchecked_Type_Conversion |
2762 N_Unconstrained_Array_Definition |
2765 N_Use_Package_Clause |
2769 N_Validate_Unchecked_Conversion |
2776 -- Make sure that inserted actions stay in the transient scope
2778 if P = Wrapped_Node then
2779 Store_Before_Actions_In_Scope (Ins_Actions);
2783 -- If we fall through above tests, keep climbing tree
2787 if Nkind (Parent (N)) = N_Subunit then
2789 -- This is the proper body corresponding to a stub. Insertion
2790 -- must be done at the point of the stub, which is in the decla-
2791 -- rative part of the parent unit.
2793 P := Corresponding_Stub (Parent (N));
2801 -- Version with check(s) suppressed
2803 procedure Insert_Actions
2804 (Assoc_Node : Node_Id;
2805 Ins_Actions : List_Id;
2806 Suppress : Check_Id)
2809 if Suppress = All_Checks then
2811 Svg : constant Suppress_Array := Scope_Suppress;
2813 Scope_Suppress := (others => True);
2814 Insert_Actions (Assoc_Node, Ins_Actions);
2815 Scope_Suppress := Svg;
2820 Svg : constant Boolean := Scope_Suppress (Suppress);
2822 Scope_Suppress (Suppress) := True;
2823 Insert_Actions (Assoc_Node, Ins_Actions);
2824 Scope_Suppress (Suppress) := Svg;
2829 --------------------------
2830 -- Insert_Actions_After --
2831 --------------------------
2833 procedure Insert_Actions_After
2834 (Assoc_Node : Node_Id;
2835 Ins_Actions : List_Id)
2838 if Scope_Is_Transient
2839 and then Assoc_Node = Node_To_Be_Wrapped
2841 Store_After_Actions_In_Scope (Ins_Actions);
2843 Insert_List_After_And_Analyze (Assoc_Node, Ins_Actions);
2845 end Insert_Actions_After;
2847 ---------------------------------
2848 -- Insert_Library_Level_Action --
2849 ---------------------------------
2851 procedure Insert_Library_Level_Action (N : Node_Id) is
2852 Aux : constant Node_Id := Aux_Decls_Node (Cunit (Main_Unit));
2855 Push_Scope (Cunit_Entity (Main_Unit));
2856 -- ??? should this be Current_Sem_Unit instead of Main_Unit?
2858 if No (Actions (Aux)) then
2859 Set_Actions (Aux, New_List (N));
2861 Append (N, Actions (Aux));
2866 end Insert_Library_Level_Action;
2868 ----------------------------------
2869 -- Insert_Library_Level_Actions --
2870 ----------------------------------
2872 procedure Insert_Library_Level_Actions (L : List_Id) is
2873 Aux : constant Node_Id := Aux_Decls_Node (Cunit (Main_Unit));
2876 if Is_Non_Empty_List (L) then
2877 Push_Scope (Cunit_Entity (Main_Unit));
2878 -- ??? should this be Current_Sem_Unit instead of Main_Unit?
2880 if No (Actions (Aux)) then
2881 Set_Actions (Aux, L);
2884 Insert_List_After_And_Analyze (Last (Actions (Aux)), L);
2889 end Insert_Library_Level_Actions;
2891 ----------------------
2892 -- Inside_Init_Proc --
2893 ----------------------
2895 function Inside_Init_Proc return Boolean is
2901 and then S /= Standard_Standard
2903 if Is_Init_Proc (S) then
2911 end Inside_Init_Proc;
2913 ----------------------------
2914 -- Is_All_Null_Statements --
2915 ----------------------------
2917 function Is_All_Null_Statements (L : List_Id) return Boolean is
2922 while Present (Stm) loop
2923 if Nkind (Stm) /= N_Null_Statement then
2931 end Is_All_Null_Statements;
2933 ----------------------------------
2934 -- Is_Library_Level_Tagged_Type --
2935 ----------------------------------
2937 function Is_Library_Level_Tagged_Type (Typ : Entity_Id) return Boolean is
2939 return Is_Tagged_Type (Typ)
2940 and then Is_Library_Level_Entity (Typ);
2941 end Is_Library_Level_Tagged_Type;
2943 ----------------------------------
2944 -- Is_Possibly_Unaligned_Object --
2945 ----------------------------------
2947 function Is_Possibly_Unaligned_Object (N : Node_Id) return Boolean is
2948 T : constant Entity_Id := Etype (N);
2951 -- If renamed object, apply test to underlying object
2953 if Is_Entity_Name (N)
2954 and then Is_Object (Entity (N))
2955 and then Present (Renamed_Object (Entity (N)))
2957 return Is_Possibly_Unaligned_Object (Renamed_Object (Entity (N)));
2960 -- Tagged and controlled types and aliased types are always aligned,
2961 -- as are concurrent types.
2964 or else Has_Controlled_Component (T)
2965 or else Is_Concurrent_Type (T)
2966 or else Is_Tagged_Type (T)
2967 or else Is_Controlled (T)
2972 -- If this is an element of a packed array, may be unaligned
2974 if Is_Ref_To_Bit_Packed_Array (N) then
2978 -- Case of component reference
2980 if Nkind (N) = N_Selected_Component then
2982 P : constant Node_Id := Prefix (N);
2983 C : constant Entity_Id := Entity (Selector_Name (N));
2988 -- If component reference is for an array with non-static bounds,
2989 -- then it is always aligned: we can only process unaligned
2990 -- arrays with static bounds (more accurately bounds known at
2993 if Is_Array_Type (T)
2994 and then not Compile_Time_Known_Bounds (T)
2999 -- If component is aliased, it is definitely properly aligned
3001 if Is_Aliased (C) then
3005 -- If component is for a type implemented as a scalar, and the
3006 -- record is packed, and the component is other than the first
3007 -- component of the record, then the component may be unaligned.
3009 if Is_Packed (Etype (P))
3010 and then Represented_As_Scalar (Etype (C))
3011 and then First_Entity (Scope (C)) /= C
3016 -- Compute maximum possible alignment for T
3018 -- If alignment is known, then that settles things
3020 if Known_Alignment (T) then
3021 M := UI_To_Int (Alignment (T));
3023 -- If alignment is not known, tentatively set max alignment
3026 M := Ttypes.Maximum_Alignment;
3028 -- We can reduce this if the Esize is known since the default
3029 -- alignment will never be more than the smallest power of 2
3030 -- that does not exceed this Esize value.
3032 if Known_Esize (T) then
3033 S := UI_To_Int (Esize (T));
3035 while (M / 2) >= S loop
3041 -- If the component reference is for a record that has a specified
3042 -- alignment, and we either know it is too small, or cannot tell,
3043 -- then the component may be unaligned
3045 if Known_Alignment (Etype (P))
3046 and then Alignment (Etype (P)) < Ttypes.Maximum_Alignment
3047 and then M > Alignment (Etype (P))
3052 -- Case of component clause present which may specify an
3053 -- unaligned position.
3055 if Present (Component_Clause (C)) then
3057 -- Otherwise we can do a test to make sure that the actual
3058 -- start position in the record, and the length, are both
3059 -- consistent with the required alignment. If not, we know
3060 -- that we are unaligned.
3063 Align_In_Bits : constant Nat := M * System_Storage_Unit;
3065 if Component_Bit_Offset (C) mod Align_In_Bits /= 0
3066 or else Esize (C) mod Align_In_Bits /= 0
3073 -- Otherwise, for a component reference, test prefix
3075 return Is_Possibly_Unaligned_Object (P);
3078 -- If not a component reference, must be aligned
3083 end Is_Possibly_Unaligned_Object;
3085 ---------------------------------
3086 -- Is_Possibly_Unaligned_Slice --
3087 ---------------------------------
3089 function Is_Possibly_Unaligned_Slice (N : Node_Id) return Boolean is
3091 -- Go to renamed object
3093 if Is_Entity_Name (N)
3094 and then Is_Object (Entity (N))
3095 and then Present (Renamed_Object (Entity (N)))
3097 return Is_Possibly_Unaligned_Slice (Renamed_Object (Entity (N)));
3100 -- The reference must be a slice
3102 if Nkind (N) /= N_Slice then
3106 -- Always assume the worst for a nested record component with a
3107 -- component clause, which gigi/gcc does not appear to handle well.
3108 -- It is not clear why this special test is needed at all ???
3110 if Nkind (Prefix (N)) = N_Selected_Component
3111 and then Nkind (Prefix (Prefix (N))) = N_Selected_Component
3113 Present (Component_Clause (Entity (Selector_Name (Prefix (N)))))
3118 -- We only need to worry if the target has strict alignment
3120 if not Target_Strict_Alignment then
3124 -- If it is a slice, then look at the array type being sliced
3127 Sarr : constant Node_Id := Prefix (N);
3128 -- Prefix of the slice, i.e. the array being sliced
3130 Styp : constant Entity_Id := Etype (Prefix (N));
3131 -- Type of the array being sliced
3137 -- The problems arise if the array object that is being sliced
3138 -- is a component of a record or array, and we cannot guarantee
3139 -- the alignment of the array within its containing object.
3141 -- To investigate this, we look at successive prefixes to see
3142 -- if we have a worrisome indexed or selected component.
3146 -- Case of array is part of an indexed component reference
3148 if Nkind (Pref) = N_Indexed_Component then
3149 Ptyp := Etype (Prefix (Pref));
3151 -- The only problematic case is when the array is packed,
3152 -- in which case we really know nothing about the alignment
3153 -- of individual components.
3155 if Is_Bit_Packed_Array (Ptyp) then
3159 -- Case of array is part of a selected component reference
3161 elsif Nkind (Pref) = N_Selected_Component then
3162 Ptyp := Etype (Prefix (Pref));
3164 -- We are definitely in trouble if the record in question
3165 -- has an alignment, and either we know this alignment is
3166 -- inconsistent with the alignment of the slice, or we
3167 -- don't know what the alignment of the slice should be.
3169 if Known_Alignment (Ptyp)
3170 and then (Unknown_Alignment (Styp)
3171 or else Alignment (Styp) > Alignment (Ptyp))
3176 -- We are in potential trouble if the record type is packed.
3177 -- We could special case when we know that the array is the
3178 -- first component, but that's not such a simple case ???
3180 if Is_Packed (Ptyp) then
3184 -- We are in trouble if there is a component clause, and
3185 -- either we do not know the alignment of the slice, or
3186 -- the alignment of the slice is inconsistent with the
3187 -- bit position specified by the component clause.
3190 Field : constant Entity_Id := Entity (Selector_Name (Pref));
3192 if Present (Component_Clause (Field))
3194 (Unknown_Alignment (Styp)
3196 (Component_Bit_Offset (Field) mod
3197 (System_Storage_Unit * Alignment (Styp))) /= 0)
3203 -- For cases other than selected or indexed components we
3204 -- know we are OK, since no issues arise over alignment.
3210 -- We processed an indexed component or selected component
3211 -- reference that looked safe, so keep checking prefixes.
3213 Pref := Prefix (Pref);
3216 end Is_Possibly_Unaligned_Slice;
3218 --------------------------------
3219 -- Is_Ref_To_Bit_Packed_Array --
3220 --------------------------------
3222 function Is_Ref_To_Bit_Packed_Array (N : Node_Id) return Boolean is
3227 if Is_Entity_Name (N)
3228 and then Is_Object (Entity (N))
3229 and then Present (Renamed_Object (Entity (N)))
3231 return Is_Ref_To_Bit_Packed_Array (Renamed_Object (Entity (N)));
3234 if Nkind (N) = N_Indexed_Component
3236 Nkind (N) = N_Selected_Component
3238 if Is_Bit_Packed_Array (Etype (Prefix (N))) then
3241 Result := Is_Ref_To_Bit_Packed_Array (Prefix (N));
3244 if Result and then Nkind (N) = N_Indexed_Component then
3245 Expr := First (Expressions (N));
3246 while Present (Expr) loop
3247 Force_Evaluation (Expr);
3257 end Is_Ref_To_Bit_Packed_Array;
3259 --------------------------------
3260 -- Is_Ref_To_Bit_Packed_Slice --
3261 --------------------------------
3263 function Is_Ref_To_Bit_Packed_Slice (N : Node_Id) return Boolean is
3265 if Nkind (N) = N_Type_Conversion then
3266 return Is_Ref_To_Bit_Packed_Slice (Expression (N));
3268 elsif Is_Entity_Name (N)
3269 and then Is_Object (Entity (N))
3270 and then Present (Renamed_Object (Entity (N)))
3272 return Is_Ref_To_Bit_Packed_Slice (Renamed_Object (Entity (N)));
3274 elsif Nkind (N) = N_Slice
3275 and then Is_Bit_Packed_Array (Etype (Prefix (N)))
3279 elsif Nkind (N) = N_Indexed_Component
3281 Nkind (N) = N_Selected_Component
3283 return Is_Ref_To_Bit_Packed_Slice (Prefix (N));
3288 end Is_Ref_To_Bit_Packed_Slice;
3290 -----------------------
3291 -- Is_Renamed_Object --
3292 -----------------------
3294 function Is_Renamed_Object (N : Node_Id) return Boolean is
3295 Pnod : constant Node_Id := Parent (N);
3296 Kind : constant Node_Kind := Nkind (Pnod);
3299 if Kind = N_Object_Renaming_Declaration then
3302 elsif Kind = N_Indexed_Component
3303 or else Kind = N_Selected_Component
3305 return Is_Renamed_Object (Pnod);
3310 end Is_Renamed_Object;
3312 ----------------------------
3313 -- Is_Untagged_Derivation --
3314 ----------------------------
3316 function Is_Untagged_Derivation (T : Entity_Id) return Boolean is
3318 return (not Is_Tagged_Type (T) and then Is_Derived_Type (T))
3320 (Is_Private_Type (T) and then Present (Full_View (T))
3321 and then not Is_Tagged_Type (Full_View (T))
3322 and then Is_Derived_Type (Full_View (T))
3323 and then Etype (Full_View (T)) /= T);
3324 end Is_Untagged_Derivation;
3326 ---------------------------
3327 -- Is_Volatile_Reference --
3328 ---------------------------
3330 function Is_Volatile_Reference (N : Node_Id) return Boolean is
3332 if Nkind (N) in N_Has_Etype
3333 and then Present (Etype (N))
3334 and then Treat_As_Volatile (Etype (N))
3338 elsif Is_Entity_Name (N) then
3339 return Treat_As_Volatile (Entity (N));
3341 elsif Nkind (N) = N_Slice then
3342 return Is_Volatile_Reference (Prefix (N));
3344 elsif Nkind_In (N, N_Indexed_Component, N_Selected_Component) then
3345 if (Is_Entity_Name (Prefix (N))
3346 and then Has_Volatile_Components (Entity (Prefix (N))))
3347 or else (Present (Etype (Prefix (N)))
3348 and then Has_Volatile_Components (Etype (Prefix (N))))
3352 return Is_Volatile_Reference (Prefix (N));
3358 end Is_Volatile_Reference;
3360 --------------------
3361 -- Kill_Dead_Code --
3362 --------------------
3364 procedure Kill_Dead_Code (N : Node_Id; Warn : Boolean := False) is
3367 Remove_Warning_Messages (N);
3371 ("?this code can never be executed and has been deleted!", N);
3374 -- Recurse into block statements and bodies to process declarations
3377 if Nkind (N) = N_Block_Statement
3378 or else Nkind (N) = N_Subprogram_Body
3379 or else Nkind (N) = N_Package_Body
3381 Kill_Dead_Code (Declarations (N), False);
3382 Kill_Dead_Code (Statements (Handled_Statement_Sequence (N)));
3384 if Nkind (N) = N_Subprogram_Body then
3385 Set_Is_Eliminated (Defining_Entity (N));
3388 elsif Nkind (N) = N_Package_Declaration then
3389 Kill_Dead_Code (Visible_Declarations (Specification (N)));
3390 Kill_Dead_Code (Private_Declarations (Specification (N)));
3392 -- ??? After this point, Delete_Tree has been called on all
3393 -- declarations in Specification (N), so references to
3394 -- entities therein look suspicious.
3397 E : Entity_Id := First_Entity (Defining_Entity (N));
3399 while Present (E) loop
3400 if Ekind (E) = E_Operator then
3401 Set_Is_Eliminated (E);
3408 -- Recurse into composite statement to kill individual statements,
3409 -- in particular instantiations.
3411 elsif Nkind (N) = N_If_Statement then
3412 Kill_Dead_Code (Then_Statements (N));
3413 Kill_Dead_Code (Elsif_Parts (N));
3414 Kill_Dead_Code (Else_Statements (N));
3416 elsif Nkind (N) = N_Loop_Statement then
3417 Kill_Dead_Code (Statements (N));
3419 elsif Nkind (N) = N_Case_Statement then
3423 Alt := First (Alternatives (N));
3424 while Present (Alt) loop
3425 Kill_Dead_Code (Statements (Alt));
3430 elsif Nkind (N) = N_Case_Statement_Alternative then
3431 Kill_Dead_Code (Statements (N));
3433 -- Deal with dead instances caused by deleting instantiations
3435 elsif Nkind (N) in N_Generic_Instantiation then
3436 Remove_Dead_Instance (N);
3441 -- Case where argument is a list of nodes to be killed
3443 procedure Kill_Dead_Code (L : List_Id; Warn : Boolean := False) is
3448 if Is_Non_Empty_List (L) then
3450 while Present (N) loop
3451 Kill_Dead_Code (N, W);
3458 ------------------------
3459 -- Known_Non_Negative --
3460 ------------------------
3462 function Known_Non_Negative (Opnd : Node_Id) return Boolean is
3464 if Is_OK_Static_Expression (Opnd)
3465 and then Expr_Value (Opnd) >= 0
3471 Lo : constant Node_Id := Type_Low_Bound (Etype (Opnd));
3475 Is_OK_Static_Expression (Lo) and then Expr_Value (Lo) >= 0;
3478 end Known_Non_Negative;
3480 --------------------
3481 -- Known_Non_Null --
3482 --------------------
3484 function Known_Non_Null (N : Node_Id) return Boolean is
3486 -- Checks for case where N is an entity reference
3488 if Is_Entity_Name (N) and then Present (Entity (N)) then
3490 E : constant Entity_Id := Entity (N);
3495 -- First check if we are in decisive conditional
3497 Get_Current_Value_Condition (N, Op, Val);
3499 if Known_Null (Val) then
3500 if Op = N_Op_Eq then
3502 elsif Op = N_Op_Ne then
3507 -- If OK to do replacement, test Is_Known_Non_Null flag
3509 if OK_To_Do_Constant_Replacement (E) then
3510 return Is_Known_Non_Null (E);
3512 -- Otherwise if not safe to do replacement, then say so
3519 -- True if access attribute
3521 elsif Nkind (N) = N_Attribute_Reference
3522 and then (Attribute_Name (N) = Name_Access
3524 Attribute_Name (N) = Name_Unchecked_Access
3526 Attribute_Name (N) = Name_Unrestricted_Access)
3530 -- True if allocator
3532 elsif Nkind (N) = N_Allocator then
3535 -- For a conversion, true if expression is known non-null
3537 elsif Nkind (N) = N_Type_Conversion then
3538 return Known_Non_Null (Expression (N));
3540 -- Above are all cases where the value could be determined to be
3541 -- non-null. In all other cases, we don't know, so return False.
3552 function Known_Null (N : Node_Id) return Boolean is
3554 -- Checks for case where N is an entity reference
3556 if Is_Entity_Name (N) and then Present (Entity (N)) then
3558 E : constant Entity_Id := Entity (N);
3563 -- Constant null value is for sure null
3565 if Ekind (E) = E_Constant
3566 and then Known_Null (Constant_Value (E))
3571 -- First check if we are in decisive conditional
3573 Get_Current_Value_Condition (N, Op, Val);
3575 if Known_Null (Val) then
3576 if Op = N_Op_Eq then
3578 elsif Op = N_Op_Ne then
3583 -- If OK to do replacement, test Is_Known_Null flag
3585 if OK_To_Do_Constant_Replacement (E) then
3586 return Is_Known_Null (E);
3588 -- Otherwise if not safe to do replacement, then say so
3595 -- True if explicit reference to null
3597 elsif Nkind (N) = N_Null then
3600 -- For a conversion, true if expression is known null
3602 elsif Nkind (N) = N_Type_Conversion then
3603 return Known_Null (Expression (N));
3605 -- Above are all cases where the value could be determined to be null.
3606 -- In all other cases, we don't know, so return False.
3613 -----------------------------
3614 -- Make_CW_Equivalent_Type --
3615 -----------------------------
3617 -- Create a record type used as an equivalent of any member
3618 -- of the class which takes its size from exp.
3620 -- Generate the following code:
3622 -- type Equiv_T is record
3623 -- _parent : T (List of discriminant constraints taken from Exp);
3624 -- Ext__50 : Storage_Array (1 .. (Exp'size - Typ'object_size)/8);
3627 -- ??? Note that this type does not guarantee same alignment as all
3630 function Make_CW_Equivalent_Type
3632 E : Node_Id) return Entity_Id
3634 Loc : constant Source_Ptr := Sloc (E);
3635 Root_Typ : constant Entity_Id := Root_Type (T);
3636 List_Def : constant List_Id := Empty_List;
3637 Comp_List : constant List_Id := New_List;
3638 Equiv_Type : Entity_Id;
3639 Range_Type : Entity_Id;
3640 Str_Type : Entity_Id;
3641 Constr_Root : Entity_Id;
3645 if not Has_Discriminants (Root_Typ) then
3646 Constr_Root := Root_Typ;
3649 Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
3651 -- subtype cstr__n is T (List of discr constraints taken from Exp)
3653 Append_To (List_Def,
3654 Make_Subtype_Declaration (Loc,
3655 Defining_Identifier => Constr_Root,
3656 Subtype_Indication =>
3657 Make_Subtype_From_Expr (E, Root_Typ)));
3660 -- Generate the range subtype declaration
3662 Range_Type := Make_Defining_Identifier (Loc, New_Internal_Name ('G'));
3664 if not Is_Interface (Root_Typ) then
3665 -- subtype rg__xx is
3666 -- Storage_Offset range 1 .. (Expr'size - typ'size) / Storage_Unit
3669 Make_Op_Subtract (Loc,
3671 Make_Attribute_Reference (Loc,
3673 OK_Convert_To (T, Duplicate_Subexpr_No_Checks (E)),
3674 Attribute_Name => Name_Size),
3676 Make_Attribute_Reference (Loc,
3677 Prefix => New_Reference_To (Constr_Root, Loc),
3678 Attribute_Name => Name_Object_Size));
3680 -- subtype rg__xx is
3681 -- Storage_Offset range 1 .. Expr'size / Storage_Unit
3684 Make_Attribute_Reference (Loc,
3686 OK_Convert_To (T, Duplicate_Subexpr_No_Checks (E)),
3687 Attribute_Name => Name_Size);
3690 Set_Paren_Count (Sizexpr, 1);
3692 Append_To (List_Def,
3693 Make_Subtype_Declaration (Loc,
3694 Defining_Identifier => Range_Type,
3695 Subtype_Indication =>
3696 Make_Subtype_Indication (Loc,
3697 Subtype_Mark => New_Reference_To (RTE (RE_Storage_Offset), Loc),
3698 Constraint => Make_Range_Constraint (Loc,
3701 Low_Bound => Make_Integer_Literal (Loc, 1),
3703 Make_Op_Divide (Loc,
3704 Left_Opnd => Sizexpr,
3705 Right_Opnd => Make_Integer_Literal (Loc,
3706 Intval => System_Storage_Unit)))))));
3708 -- subtype str__nn is Storage_Array (rg__x);
3710 Str_Type := Make_Defining_Identifier (Loc, New_Internal_Name ('S'));
3711 Append_To (List_Def,
3712 Make_Subtype_Declaration (Loc,
3713 Defining_Identifier => Str_Type,
3714 Subtype_Indication =>
3715 Make_Subtype_Indication (Loc,
3716 Subtype_Mark => New_Reference_To (RTE (RE_Storage_Array), Loc),
3718 Make_Index_Or_Discriminant_Constraint (Loc,
3720 New_List (New_Reference_To (Range_Type, Loc))))));
3722 -- type Equiv_T is record
3723 -- [ _parent : Tnn; ]
3727 Equiv_Type := Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
3729 -- When the target requires front-end layout, it's necessary to allow
3730 -- the equivalent type to be frozen so that layout can occur (when the
3731 -- associated class-wide subtype is frozen, the equivalent type will
3732 -- be frozen, see freeze.adb). For other targets, Gigi wants to have
3733 -- the equivalent type marked as frozen and deals with this type itself.
3734 -- In the Gigi case this will also avoid the generation of an init
3735 -- procedure for the type.
3737 if not Frontend_Layout_On_Target then
3738 Set_Is_Frozen (Equiv_Type);
3741 Set_Ekind (Equiv_Type, E_Record_Type);
3742 Set_Parent_Subtype (Equiv_Type, Constr_Root);
3744 if not Is_Interface (Root_Typ) then
3745 Append_To (Comp_List,
3746 Make_Component_Declaration (Loc,
3747 Defining_Identifier =>
3748 Make_Defining_Identifier (Loc, Name_uParent),
3749 Component_Definition =>
3750 Make_Component_Definition (Loc,
3751 Aliased_Present => False,
3752 Subtype_Indication => New_Reference_To (Constr_Root, Loc))));
3755 Append_To (Comp_List,
3756 Make_Component_Declaration (Loc,
3757 Defining_Identifier =>
3758 Make_Defining_Identifier (Loc,
3759 Chars => New_Internal_Name ('C')),
3760 Component_Definition =>
3761 Make_Component_Definition (Loc,
3762 Aliased_Present => False,
3763 Subtype_Indication => New_Reference_To (Str_Type, Loc))));
3765 Append_To (List_Def,
3766 Make_Full_Type_Declaration (Loc,
3767 Defining_Identifier => Equiv_Type,
3769 Make_Record_Definition (Loc,
3771 Make_Component_List (Loc,
3772 Component_Items => Comp_List,
3773 Variant_Part => Empty))));
3775 -- Suppress all checks during the analysis of the expanded code
3776 -- to avoid the generation of spurious warnings under ZFP run-time.
3778 Insert_Actions (E, List_Def, Suppress => All_Checks);
3780 end Make_CW_Equivalent_Type;
3782 ------------------------
3783 -- Make_Literal_Range --
3784 ------------------------
3786 function Make_Literal_Range
3788 Literal_Typ : Entity_Id) return Node_Id
3790 Lo : constant Node_Id :=
3791 New_Copy_Tree (String_Literal_Low_Bound (Literal_Typ));
3792 Index : constant Entity_Id := Etype (Lo);
3795 Length_Expr : constant Node_Id :=
3796 Make_Op_Subtract (Loc,
3798 Make_Integer_Literal (Loc,
3799 Intval => String_Literal_Length (Literal_Typ)),
3801 Make_Integer_Literal (Loc, 1));
3804 Set_Analyzed (Lo, False);
3806 if Is_Integer_Type (Index) then
3809 Left_Opnd => New_Copy_Tree (Lo),
3810 Right_Opnd => Length_Expr);
3813 Make_Attribute_Reference (Loc,
3814 Attribute_Name => Name_Val,
3815 Prefix => New_Occurrence_Of (Index, Loc),
3816 Expressions => New_List (
3819 Make_Attribute_Reference (Loc,
3820 Attribute_Name => Name_Pos,
3821 Prefix => New_Occurrence_Of (Index, Loc),
3822 Expressions => New_List (New_Copy_Tree (Lo))),
3823 Right_Opnd => Length_Expr)));
3830 end Make_Literal_Range;
3832 --------------------------
3833 -- Make_Non_Empty_Check --
3834 --------------------------
3836 function Make_Non_Empty_Check
3838 N : Node_Id) return Node_Id
3844 Make_Attribute_Reference (Loc,
3845 Attribute_Name => Name_Length,
3846 Prefix => Duplicate_Subexpr_No_Checks (N, Name_Req => True)),
3848 Make_Integer_Literal (Loc, 0));
3849 end Make_Non_Empty_Check;
3851 ----------------------------
3852 -- Make_Subtype_From_Expr --
3853 ----------------------------
3855 -- 1. If Expr is an unconstrained array expression, creates
3856 -- Unc_Type(Expr'first(1)..Expr'last(1),..., Expr'first(n)..Expr'last(n))
3858 -- 2. If Expr is a unconstrained discriminated type expression, creates
3859 -- Unc_Type(Expr.Discr1, ... , Expr.Discr_n)
3861 -- 3. If Expr is class-wide, creates an implicit class wide subtype
3863 function Make_Subtype_From_Expr
3865 Unc_Typ : Entity_Id) return Node_Id
3867 Loc : constant Source_Ptr := Sloc (E);
3868 List_Constr : constant List_Id := New_List;
3871 Full_Subtyp : Entity_Id;
3872 Priv_Subtyp : Entity_Id;
3877 if Is_Private_Type (Unc_Typ)
3878 and then Has_Unknown_Discriminants (Unc_Typ)
3880 -- Prepare the subtype completion, Go to base type to
3881 -- find underlying type, because the type may be a generic
3882 -- actual or an explicit subtype.
3884 Utyp := Underlying_Type (Base_Type (Unc_Typ));
3885 Full_Subtyp := Make_Defining_Identifier (Loc,
3886 New_Internal_Name ('C'));
3888 Unchecked_Convert_To
3889 (Utyp, Duplicate_Subexpr_No_Checks (E));
3890 Set_Parent (Full_Exp, Parent (E));
3893 Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
3896 Make_Subtype_Declaration (Loc,
3897 Defining_Identifier => Full_Subtyp,
3898 Subtype_Indication => Make_Subtype_From_Expr (Full_Exp, Utyp)));
3900 -- Define the dummy private subtype
3902 Set_Ekind (Priv_Subtyp, Subtype_Kind (Ekind (Unc_Typ)));
3903 Set_Etype (Priv_Subtyp, Base_Type (Unc_Typ));
3904 Set_Scope (Priv_Subtyp, Full_Subtyp);
3905 Set_Is_Constrained (Priv_Subtyp);
3906 Set_Is_Tagged_Type (Priv_Subtyp, Is_Tagged_Type (Unc_Typ));
3907 Set_Is_Itype (Priv_Subtyp);
3908 Set_Associated_Node_For_Itype (Priv_Subtyp, E);
3910 if Is_Tagged_Type (Priv_Subtyp) then
3912 (Base_Type (Priv_Subtyp), Class_Wide_Type (Unc_Typ));
3913 Set_Primitive_Operations (Priv_Subtyp,
3914 Primitive_Operations (Unc_Typ));
3917 Set_Full_View (Priv_Subtyp, Full_Subtyp);
3919 return New_Reference_To (Priv_Subtyp, Loc);
3921 elsif Is_Array_Type (Unc_Typ) then
3922 for J in 1 .. Number_Dimensions (Unc_Typ) loop
3923 Append_To (List_Constr,
3926 Make_Attribute_Reference (Loc,
3927 Prefix => Duplicate_Subexpr_No_Checks (E),
3928 Attribute_Name => Name_First,
3929 Expressions => New_List (
3930 Make_Integer_Literal (Loc, J))),
3933 Make_Attribute_Reference (Loc,
3934 Prefix => Duplicate_Subexpr_No_Checks (E),
3935 Attribute_Name => Name_Last,
3936 Expressions => New_List (
3937 Make_Integer_Literal (Loc, J)))));
3940 elsif Is_Class_Wide_Type (Unc_Typ) then
3942 CW_Subtype : Entity_Id;
3943 EQ_Typ : Entity_Id := Empty;
3946 -- A class-wide equivalent type is not needed when VM_Target
3947 -- because the VM back-ends handle the class-wide object
3948 -- initialization itself (and doesn't need or want the
3949 -- additional intermediate type to handle the assignment).
3951 if Expander_Active and then Tagged_Type_Expansion then
3952 EQ_Typ := Make_CW_Equivalent_Type (Unc_Typ, E);
3955 CW_Subtype := New_Class_Wide_Subtype (Unc_Typ, E);
3956 Set_Equivalent_Type (CW_Subtype, EQ_Typ);
3958 if Present (EQ_Typ) then
3959 Set_Is_Class_Wide_Equivalent_Type (EQ_Typ);
3962 Set_Cloned_Subtype (CW_Subtype, Base_Type (Unc_Typ));
3964 return New_Occurrence_Of (CW_Subtype, Loc);
3967 -- Indefinite record type with discriminants
3970 D := First_Discriminant (Unc_Typ);
3971 while Present (D) loop
3972 Append_To (List_Constr,
3973 Make_Selected_Component (Loc,
3974 Prefix => Duplicate_Subexpr_No_Checks (E),
3975 Selector_Name => New_Reference_To (D, Loc)));
3977 Next_Discriminant (D);
3982 Make_Subtype_Indication (Loc,
3983 Subtype_Mark => New_Reference_To (Unc_Typ, Loc),
3985 Make_Index_Or_Discriminant_Constraint (Loc,
3986 Constraints => List_Constr));
3987 end Make_Subtype_From_Expr;
3989 -----------------------------
3990 -- May_Generate_Large_Temp --
3991 -----------------------------
3993 -- At the current time, the only types that we return False for (i.e.
3994 -- where we decide we know they cannot generate large temps) are ones
3995 -- where we know the size is 256 bits or less at compile time, and we
3996 -- are still not doing a thorough job on arrays and records ???
3998 function May_Generate_Large_Temp (Typ : Entity_Id) return Boolean is
4000 if not Size_Known_At_Compile_Time (Typ) then
4003 elsif Esize (Typ) /= 0 and then Esize (Typ) <= 256 then
4006 elsif Is_Array_Type (Typ)
4007 and then Present (Packed_Array_Type (Typ))
4009 return May_Generate_Large_Temp (Packed_Array_Type (Typ));
4011 -- We could do more here to find other small types ???
4016 end May_Generate_Large_Temp;
4018 ----------------------------
4019 -- New_Class_Wide_Subtype --
4020 ----------------------------
4022 function New_Class_Wide_Subtype
4023 (CW_Typ : Entity_Id;
4024 N : Node_Id) return Entity_Id
4026 Res : constant Entity_Id := Create_Itype (E_Void, N);
4027 Res_Name : constant Name_Id := Chars (Res);
4028 Res_Scope : constant Entity_Id := Scope (Res);
4031 Copy_Node (CW_Typ, Res);
4032 Set_Comes_From_Source (Res, False);
4033 Set_Sloc (Res, Sloc (N));
4035 Set_Associated_Node_For_Itype (Res, N);
4036 Set_Is_Public (Res, False); -- By default, may be changed below.
4037 Set_Public_Status (Res);
4038 Set_Chars (Res, Res_Name);
4039 Set_Scope (Res, Res_Scope);
4040 Set_Ekind (Res, E_Class_Wide_Subtype);
4041 Set_Next_Entity (Res, Empty);
4042 Set_Etype (Res, Base_Type (CW_Typ));
4044 -- For targets where front-end layout is required, reset the Is_Frozen
4045 -- status of the subtype to False (it can be implicitly set to true
4046 -- from the copy of the class-wide type). For other targets, Gigi
4047 -- doesn't want the class-wide subtype to go through the freezing
4048 -- process (though it's unclear why that causes problems and it would
4049 -- be nice to allow freezing to occur normally for all targets ???).
4051 if Frontend_Layout_On_Target then
4052 Set_Is_Frozen (Res, False);
4055 Set_Freeze_Node (Res, Empty);
4057 end New_Class_Wide_Subtype;
4059 --------------------------------
4060 -- Non_Limited_Designated_Type --
4061 ---------------------------------
4063 function Non_Limited_Designated_Type (T : Entity_Id) return Entity_Id is
4064 Desig : constant Entity_Id := Designated_Type (T);
4066 if Ekind (Desig) = E_Incomplete_Type
4067 and then Present (Non_Limited_View (Desig))
4069 return Non_Limited_View (Desig);
4073 end Non_Limited_Designated_Type;
4075 -----------------------------------
4076 -- OK_To_Do_Constant_Replacement --
4077 -----------------------------------
4079 function OK_To_Do_Constant_Replacement (E : Entity_Id) return Boolean is
4080 ES : constant Entity_Id := Scope (E);
4084 -- Do not replace statically allocated objects, because they may be
4085 -- modified outside the current scope.
4087 if Is_Statically_Allocated (E) then
4090 -- Do not replace aliased or volatile objects, since we don't know what
4091 -- else might change the value.
4093 elsif Is_Aliased (E) or else Treat_As_Volatile (E) then
4096 -- Debug flag -gnatdM disconnects this optimization
4098 elsif Debug_Flag_MM then
4101 -- Otherwise check scopes
4104 CS := Current_Scope;
4107 -- If we are in right scope, replacement is safe
4112 -- Packages do not affect the determination of safety
4114 elsif Ekind (CS) = E_Package then
4115 exit when CS = Standard_Standard;
4118 -- Blocks do not affect the determination of safety
4120 elsif Ekind (CS) = E_Block then
4123 -- Loops do not affect the determination of safety. Note that we
4124 -- kill all current values on entry to a loop, so we are just
4125 -- talking about processing within a loop here.
4127 elsif Ekind (CS) = E_Loop then
4130 -- Otherwise, the reference is dubious, and we cannot be sure that
4131 -- it is safe to do the replacement.
4140 end OK_To_Do_Constant_Replacement;
4142 ------------------------------------
4143 -- Possible_Bit_Aligned_Component --
4144 ------------------------------------
4146 function Possible_Bit_Aligned_Component (N : Node_Id) return Boolean is
4150 -- Case of indexed component
4152 when N_Indexed_Component =>
4154 P : constant Node_Id := Prefix (N);
4155 Ptyp : constant Entity_Id := Etype (P);
4158 -- If we know the component size and it is less than 64, then
4159 -- we are definitely OK. The back end always does assignment of
4160 -- misaligned small objects correctly.
4162 if Known_Static_Component_Size (Ptyp)
4163 and then Component_Size (Ptyp) <= 64
4167 -- Otherwise, we need to test the prefix, to see if we are
4168 -- indexing from a possibly unaligned component.
4171 return Possible_Bit_Aligned_Component (P);
4175 -- Case of selected component
4177 when N_Selected_Component =>
4179 P : constant Node_Id := Prefix (N);
4180 Comp : constant Entity_Id := Entity (Selector_Name (N));
4183 -- If there is no component clause, then we are in the clear
4184 -- since the back end will never misalign a large component
4185 -- unless it is forced to do so. In the clear means we need
4186 -- only the recursive test on the prefix.
4188 if Component_May_Be_Bit_Aligned (Comp) then
4191 return Possible_Bit_Aligned_Component (P);
4195 -- For a slice, test the prefix, if that is possibly misaligned,
4196 -- then for sure the slice is!
4199 return Possible_Bit_Aligned_Component (Prefix (N));
4201 -- If we have none of the above, it means that we have fallen off the
4202 -- top testing prefixes recursively, and we now have a stand alone
4203 -- object, where we don't have a problem.
4209 end Possible_Bit_Aligned_Component;
4211 -------------------------
4212 -- Remove_Side_Effects --
4213 -------------------------
4215 procedure Remove_Side_Effects
4217 Name_Req : Boolean := False;
4218 Variable_Ref : Boolean := False)
4220 Loc : constant Source_Ptr := Sloc (Exp);
4221 Exp_Type : constant Entity_Id := Etype (Exp);
4222 Svg_Suppress : constant Suppress_Array := Scope_Suppress;
4224 Ref_Type : Entity_Id;
4226 Ptr_Typ_Decl : Node_Id;
4230 function Side_Effect_Free (N : Node_Id) return Boolean;
4231 -- Determines if the tree N represents an expression that is known not
4232 -- to have side effects, and for which no processing is required.
4234 function Side_Effect_Free (L : List_Id) return Boolean;
4235 -- Determines if all elements of the list L are side effect free
4237 function Safe_Prefixed_Reference (N : Node_Id) return Boolean;
4238 -- The argument N is a construct where the Prefix is dereferenced if it
4239 -- is an access type and the result is a variable. The call returns True
4240 -- if the construct is side effect free (not considering side effects in
4241 -- other than the prefix which are to be tested by the caller).
4243 function Within_In_Parameter (N : Node_Id) return Boolean;
4244 -- Determines if N is a subcomponent of a composite in-parameter. If so,
4245 -- N is not side-effect free when the actual is global and modifiable
4246 -- indirectly from within a subprogram, because it may be passed by
4247 -- reference. The front-end must be conservative here and assume that
4248 -- this may happen with any array or record type. On the other hand, we
4249 -- cannot create temporaries for all expressions for which this
4250 -- condition is true, for various reasons that might require clearing up
4251 -- ??? For example, discriminant references that appear out of place, or
4252 -- spurious type errors with class-wide expressions. As a result, we
4253 -- limit the transformation to loop bounds, which is so far the only
4254 -- case that requires it.
4256 -----------------------------
4257 -- Safe_Prefixed_Reference --
4258 -----------------------------
4260 function Safe_Prefixed_Reference (N : Node_Id) return Boolean is
4262 -- If prefix is not side effect free, definitely not safe
4264 if not Side_Effect_Free (Prefix (N)) then
4267 -- If the prefix is of an access type that is not access-to-constant,
4268 -- then this construct is a variable reference, which means it is to
4269 -- be considered to have side effects if Variable_Ref is set True
4270 -- Exception is an access to an entity that is a constant or an
4271 -- in-parameter which does not come from source, and is the result
4272 -- of a previous removal of side-effects.
4274 elsif Is_Access_Type (Etype (Prefix (N)))
4275 and then not Is_Access_Constant (Etype (Prefix (N)))
4276 and then Variable_Ref
4278 if not Is_Entity_Name (Prefix (N)) then
4281 return Ekind (Entity (Prefix (N))) = E_Constant
4282 or else Ekind (Entity (Prefix (N))) = E_In_Parameter;
4285 -- The following test is the simplest way of solving a complex
4286 -- problem uncovered by BB08-010: Side effect on loop bound that
4287 -- is a subcomponent of a global variable:
4288 -- If a loop bound is a subcomponent of a global variable, a
4289 -- modification of that variable within the loop may incorrectly
4290 -- affect the execution of the loop.
4293 (Nkind (Parent (Parent (N))) /= N_Loop_Parameter_Specification
4294 or else not Within_In_Parameter (Prefix (N)))
4298 -- All other cases are side effect free
4303 end Safe_Prefixed_Reference;
4305 ----------------------
4306 -- Side_Effect_Free --
4307 ----------------------
4309 function Side_Effect_Free (N : Node_Id) return Boolean is
4311 -- Note on checks that could raise Constraint_Error. Strictly, if
4312 -- we take advantage of 11.6, these checks do not count as side
4313 -- effects. However, we would just as soon consider that they are
4314 -- side effects, since the backend CSE does not work very well on
4315 -- expressions which can raise Constraint_Error. On the other
4316 -- hand, if we do not consider them to be side effect free, then
4317 -- we get some awkward expansions in -gnato mode, resulting in
4318 -- code insertions at a point where we do not have a clear model
4319 -- for performing the insertions.
4321 -- Special handling for entity names
4323 if Is_Entity_Name (N) then
4325 -- If the entity is a constant, it is definitely side effect
4326 -- free. Note that the test of Is_Variable (N) below might
4327 -- be expected to catch this case, but it does not, because
4328 -- this test goes to the original tree, and we may have
4329 -- already rewritten a variable node with a constant as
4330 -- a result of an earlier Force_Evaluation call.
4332 if Ekind (Entity (N)) = E_Constant
4333 or else Ekind (Entity (N)) = E_In_Parameter
4337 -- Functions are not side effect free
4339 elsif Ekind (Entity (N)) = E_Function then
4342 -- Variables are considered to be a side effect if Variable_Ref
4343 -- is set or if we have a volatile reference and Name_Req is off.
4344 -- If Name_Req is True then we can't help returning a name which
4345 -- effectively allows multiple references in any case.
4347 elsif Is_Variable (N) then
4348 return not Variable_Ref
4349 and then (not Is_Volatile_Reference (N) or else Name_Req);
4351 -- Any other entity (e.g. a subtype name) is definitely side
4358 -- A value known at compile time is always side effect free
4360 elsif Compile_Time_Known_Value (N) then
4363 -- A variable renaming is not side-effect free, because the
4364 -- renaming will function like a macro in the front-end in
4365 -- some cases, and an assignment can modify the component
4366 -- designated by N, so we need to create a temporary for it.
4368 elsif Is_Entity_Name (Original_Node (N))
4369 and then Is_Renaming_Of_Object (Entity (Original_Node (N)))
4370 and then Ekind (Entity (Original_Node (N))) /= E_Constant
4375 -- For other than entity names and compile time known values,
4376 -- check the node kind for special processing.
4380 -- An attribute reference is side effect free if its expressions
4381 -- are side effect free and its prefix is side effect free or
4382 -- is an entity reference.
4384 -- Is this right? what about x'first where x is a variable???
4386 when N_Attribute_Reference =>
4387 return Side_Effect_Free (Expressions (N))
4388 and then Attribute_Name (N) /= Name_Input
4389 and then (Is_Entity_Name (Prefix (N))
4390 or else Side_Effect_Free (Prefix (N)));
4392 -- A binary operator is side effect free if and both operands
4393 -- are side effect free. For this purpose binary operators
4394 -- include membership tests and short circuit forms
4400 return Side_Effect_Free (Left_Opnd (N))
4401 and then Side_Effect_Free (Right_Opnd (N));
4403 -- An explicit dereference is side effect free only if it is
4404 -- a side effect free prefixed reference.
4406 when N_Explicit_Dereference =>
4407 return Safe_Prefixed_Reference (N);
4409 -- A call to _rep_to_pos is side effect free, since we generate
4410 -- this pure function call ourselves. Moreover it is critically
4411 -- important to make this exception, since otherwise we can
4412 -- have discriminants in array components which don't look
4413 -- side effect free in the case of an array whose index type
4414 -- is an enumeration type with an enumeration rep clause.
4416 -- All other function calls are not side effect free
4418 when N_Function_Call =>
4419 return Nkind (Name (N)) = N_Identifier
4420 and then Is_TSS (Name (N), TSS_Rep_To_Pos)
4422 Side_Effect_Free (First (Parameter_Associations (N)));
4424 -- An indexed component is side effect free if it is a side
4425 -- effect free prefixed reference and all the indexing
4426 -- expressions are side effect free.
4428 when N_Indexed_Component =>
4429 return Side_Effect_Free (Expressions (N))
4430 and then Safe_Prefixed_Reference (N);
4432 -- A type qualification is side effect free if the expression
4433 -- is side effect free.
4435 when N_Qualified_Expression =>
4436 return Side_Effect_Free (Expression (N));
4438 -- A selected component is side effect free only if it is a
4439 -- side effect free prefixed reference. If it designates a
4440 -- component with a rep. clause it must be treated has having
4441 -- a potential side effect, because it may be modified through
4442 -- a renaming, and a subsequent use of the renaming as a macro
4443 -- will yield the wrong value. This complex interaction between
4444 -- renaming and removing side effects is a reminder that the
4445 -- latter has become a headache to maintain, and that it should
4446 -- be removed in favor of the gcc mechanism to capture values ???
4448 when N_Selected_Component =>
4449 if Nkind (Parent (N)) = N_Explicit_Dereference
4450 and then Has_Non_Standard_Rep (Designated_Type (Etype (N)))
4454 return Safe_Prefixed_Reference (N);
4457 -- A range is side effect free if the bounds are side effect free
4460 return Side_Effect_Free (Low_Bound (N))
4461 and then Side_Effect_Free (High_Bound (N));
4463 -- A slice is side effect free if it is a side effect free
4464 -- prefixed reference and the bounds are side effect free.
4467 return Side_Effect_Free (Discrete_Range (N))
4468 and then Safe_Prefixed_Reference (N);
4470 -- A type conversion is side effect free if the expression to be
4471 -- converted is side effect free.
4473 when N_Type_Conversion =>
4474 return Side_Effect_Free (Expression (N));
4476 -- A unary operator is side effect free if the operand
4477 -- is side effect free.
4480 return Side_Effect_Free (Right_Opnd (N));
4482 -- An unchecked type conversion is side effect free only if it
4483 -- is safe and its argument is side effect free.
4485 when N_Unchecked_Type_Conversion =>
4486 return Safe_Unchecked_Type_Conversion (N)
4487 and then Side_Effect_Free (Expression (N));
4489 -- An unchecked expression is side effect free if its expression
4490 -- is side effect free.
4492 when N_Unchecked_Expression =>
4493 return Side_Effect_Free (Expression (N));
4495 -- A literal is side effect free
4497 when N_Character_Literal |
4503 -- We consider that anything else has side effects. This is a bit
4504 -- crude, but we are pretty close for most common cases, and we
4505 -- are certainly correct (i.e. we never return True when the
4506 -- answer should be False).
4511 end Side_Effect_Free;
4513 -- A list is side effect free if all elements of the list are
4514 -- side effect free.
4516 function Side_Effect_Free (L : List_Id) return Boolean is
4520 if L = No_List or else L = Error_List then
4525 while Present (N) loop
4526 if not Side_Effect_Free (N) then
4535 end Side_Effect_Free;
4537 -------------------------
4538 -- Within_In_Parameter --
4539 -------------------------
4541 function Within_In_Parameter (N : Node_Id) return Boolean is
4543 if not Comes_From_Source (N) then
4546 elsif Is_Entity_Name (N) then
4547 return Ekind (Entity (N)) = E_In_Parameter;
4549 elsif Nkind (N) = N_Indexed_Component
4550 or else Nkind (N) = N_Selected_Component
4552 return Within_In_Parameter (Prefix (N));
4557 end Within_In_Parameter;
4559 -- Start of processing for Remove_Side_Effects
4562 -- If we are side effect free already or expansion is disabled,
4563 -- there is nothing to do.
4565 if Side_Effect_Free (Exp) or else not Expander_Active then
4569 -- All this must not have any checks
4571 Scope_Suppress := (others => True);
4573 -- If it is a scalar type and we need to capture the value, just make
4574 -- a copy. Likewise for a function call, an attribute reference or an
4575 -- operator. And if we have a volatile reference and Name_Req is not
4576 -- set (see comments above for Side_Effect_Free).
4578 if Is_Elementary_Type (Exp_Type)
4579 and then (Variable_Ref
4580 or else Nkind (Exp) = N_Function_Call
4581 or else Nkind (Exp) = N_Attribute_Reference
4582 or else Nkind (Exp) in N_Op
4583 or else (not Name_Req and then Is_Volatile_Reference (Exp)))
4585 Def_Id := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
4586 Set_Etype (Def_Id, Exp_Type);
4587 Res := New_Reference_To (Def_Id, Loc);
4590 Make_Object_Declaration (Loc,
4591 Defining_Identifier => Def_Id,
4592 Object_Definition => New_Reference_To (Exp_Type, Loc),
4593 Constant_Present => True,
4594 Expression => Relocate_Node (Exp));
4596 Set_Assignment_OK (E);
4597 Insert_Action (Exp, E);
4598 Set_Related_Expression (Def_Id, Exp);
4600 -- If the expression has the form v.all then we can just capture
4601 -- the pointer, and then do an explicit dereference on the result.
4603 elsif Nkind (Exp) = N_Explicit_Dereference then
4605 Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
4607 Make_Explicit_Dereference (Loc, New_Reference_To (Def_Id, Loc));
4610 Make_Object_Declaration (Loc,
4611 Defining_Identifier => Def_Id,
4612 Object_Definition =>
4613 New_Reference_To (Etype (Prefix (Exp)), Loc),
4614 Constant_Present => True,
4615 Expression => Relocate_Node (Prefix (Exp))));
4616 Set_Related_Expression (Def_Id, Exp);
4618 -- Similar processing for an unchecked conversion of an expression
4619 -- of the form v.all, where we want the same kind of treatment.
4621 elsif Nkind (Exp) = N_Unchecked_Type_Conversion
4622 and then Nkind (Expression (Exp)) = N_Explicit_Dereference
4624 Remove_Side_Effects (Expression (Exp), Name_Req, Variable_Ref);
4625 Scope_Suppress := Svg_Suppress;
4628 -- If this is a type conversion, leave the type conversion and remove
4629 -- the side effects in the expression. This is important in several
4630 -- circumstances: for change of representations, and also when this is
4631 -- a view conversion to a smaller object, where gigi can end up creating
4632 -- its own temporary of the wrong size.
4634 elsif Nkind (Exp) = N_Type_Conversion then
4635 Remove_Side_Effects (Expression (Exp), Name_Req, Variable_Ref);
4636 Scope_Suppress := Svg_Suppress;
4639 -- If this is an unchecked conversion that Gigi can't handle, make
4640 -- a copy or a use a renaming to capture the value.
4642 elsif Nkind (Exp) = N_Unchecked_Type_Conversion
4643 and then not Safe_Unchecked_Type_Conversion (Exp)
4645 if CW_Or_Has_Controlled_Part (Exp_Type) then
4647 -- Use a renaming to capture the expression, rather than create
4648 -- a controlled temporary.
4650 Def_Id := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
4651 Res := New_Reference_To (Def_Id, Loc);
4654 Make_Object_Renaming_Declaration (Loc,
4655 Defining_Identifier => Def_Id,
4656 Subtype_Mark => New_Reference_To (Exp_Type, Loc),
4657 Name => Relocate_Node (Exp)));
4658 Set_Related_Expression (Def_Id, Exp);
4661 Def_Id := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
4662 Set_Etype (Def_Id, Exp_Type);
4663 Res := New_Reference_To (Def_Id, Loc);
4666 Make_Object_Declaration (Loc,
4667 Defining_Identifier => Def_Id,
4668 Object_Definition => New_Reference_To (Exp_Type, Loc),
4669 Constant_Present => not Is_Variable (Exp),
4670 Expression => Relocate_Node (Exp));
4672 Set_Assignment_OK (E);
4673 Insert_Action (Exp, E);
4674 Set_Related_Expression (Def_Id, Exp);
4677 -- For expressions that denote objects, we can use a renaming scheme.
4678 -- We skip using this if we have a volatile reference and we do not
4679 -- have Name_Req set true (see comments above for Side_Effect_Free).
4681 elsif Is_Object_Reference (Exp)
4682 and then Nkind (Exp) /= N_Function_Call
4683 and then (Name_Req or else not Is_Volatile_Reference (Exp))
4685 Def_Id := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
4687 if Nkind (Exp) = N_Selected_Component
4688 and then Nkind (Prefix (Exp)) = N_Function_Call
4689 and then Is_Array_Type (Exp_Type)
4691 -- Avoid generating a variable-sized temporary, by generating
4692 -- the renaming declaration just for the function call. The
4693 -- transformation could be refined to apply only when the array
4694 -- component is constrained by a discriminant???
4697 Make_Selected_Component (Loc,
4698 Prefix => New_Occurrence_Of (Def_Id, Loc),
4699 Selector_Name => Selector_Name (Exp));
4702 Make_Object_Renaming_Declaration (Loc,
4703 Defining_Identifier => Def_Id,
4705 New_Reference_To (Base_Type (Etype (Prefix (Exp))), Loc),
4706 Name => Relocate_Node (Prefix (Exp))));
4709 Res := New_Reference_To (Def_Id, Loc);
4712 Make_Object_Renaming_Declaration (Loc,
4713 Defining_Identifier => Def_Id,
4714 Subtype_Mark => New_Reference_To (Exp_Type, Loc),
4715 Name => Relocate_Node (Exp)));
4718 Set_Related_Expression (Def_Id, Exp);
4720 -- If this is a packed reference, or a selected component with a
4721 -- non-standard representation, a reference to the temporary will
4722 -- be replaced by a copy of the original expression (see
4723 -- Exp_Ch2.Expand_Renaming). Otherwise the temporary must be
4724 -- elaborated by gigi, and is of course not to be replaced in-line
4725 -- by the expression it renames, which would defeat the purpose of
4726 -- removing the side-effect.
4728 if (Nkind (Exp) = N_Selected_Component
4729 or else Nkind (Exp) = N_Indexed_Component)
4730 and then Has_Non_Standard_Rep (Etype (Prefix (Exp)))
4734 Set_Is_Renaming_Of_Object (Def_Id, False);
4737 -- Otherwise we generate a reference to the value
4740 -- Special processing for function calls that return a task. We need
4741 -- to build a declaration that will enable build-in-place expansion
4744 -- This is relevant only in Ada 2005 mode. In Ada 95 programs we have
4745 -- to accommodate functions returning limited objects by reference.
4747 if Nkind (Exp) = N_Function_Call
4748 and then Is_Task_Type (Etype (Exp))
4749 and then Ada_Version >= Ada_05
4752 Obj : constant Entity_Id :=
4753 Make_Defining_Identifier (Loc,
4754 Chars => New_Internal_Name ('F'));
4759 Make_Object_Declaration (Loc,
4760 Defining_Identifier => Obj,
4761 Object_Definition => New_Occurrence_Of (Exp_Type, Loc),
4762 Expression => Relocate_Node (Exp));
4763 Insert_Action (Exp, Decl);
4764 Set_Etype (Obj, Exp_Type);
4765 Set_Related_Expression (Obj, Exp);
4766 Rewrite (Exp, New_Occurrence_Of (Obj, Loc));
4771 Ref_Type := Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
4774 Make_Full_Type_Declaration (Loc,
4775 Defining_Identifier => Ref_Type,
4777 Make_Access_To_Object_Definition (Loc,
4778 All_Present => True,
4779 Subtype_Indication =>
4780 New_Reference_To (Exp_Type, Loc)));
4783 Insert_Action (Exp, Ptr_Typ_Decl);
4785 Def_Id := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
4786 Set_Etype (Def_Id, Exp_Type);
4789 Make_Explicit_Dereference (Loc,
4790 Prefix => New_Reference_To (Def_Id, Loc));
4792 if Nkind (E) = N_Explicit_Dereference then
4793 New_Exp := Relocate_Node (Prefix (E));
4795 E := Relocate_Node (E);
4796 New_Exp := Make_Reference (Loc, E);
4799 if Is_Delayed_Aggregate (E) then
4801 -- The expansion of nested aggregates is delayed until the
4802 -- enclosing aggregate is expanded. As aggregates are often
4803 -- qualified, the predicate applies to qualified expressions
4804 -- as well, indicating that the enclosing aggregate has not
4805 -- been expanded yet. At this point the aggregate is part of
4806 -- a stand-alone declaration, and must be fully expanded.
4808 if Nkind (E) = N_Qualified_Expression then
4809 Set_Expansion_Delayed (Expression (E), False);
4810 Set_Analyzed (Expression (E), False);
4812 Set_Expansion_Delayed (E, False);
4815 Set_Analyzed (E, False);
4819 Make_Object_Declaration (Loc,
4820 Defining_Identifier => Def_Id,
4821 Object_Definition => New_Reference_To (Ref_Type, Loc),
4822 Expression => New_Exp));
4823 Set_Related_Expression (Def_Id, Exp);
4826 -- Preserve the Assignment_OK flag in all copies, since at least
4827 -- one copy may be used in a context where this flag must be set
4828 -- (otherwise why would the flag be set in the first place).
4830 Set_Assignment_OK (Res, Assignment_OK (Exp));
4832 -- Finally rewrite the original expression and we are done
4835 Analyze_And_Resolve (Exp, Exp_Type);
4836 Scope_Suppress := Svg_Suppress;
4837 end Remove_Side_Effects;
4839 ---------------------------
4840 -- Represented_As_Scalar --
4841 ---------------------------
4843 function Represented_As_Scalar (T : Entity_Id) return Boolean is
4844 UT : constant Entity_Id := Underlying_Type (T);
4846 return Is_Scalar_Type (UT)
4847 or else (Is_Bit_Packed_Array (UT)
4848 and then Is_Scalar_Type (Packed_Array_Type (UT)));
4849 end Represented_As_Scalar;
4851 ------------------------------------
4852 -- Safe_Unchecked_Type_Conversion --
4853 ------------------------------------
4855 -- Note: this function knows quite a bit about the exact requirements
4856 -- of Gigi with respect to unchecked type conversions, and its code
4857 -- must be coordinated with any changes in Gigi in this area.
4859 -- The above requirements should be documented in Sinfo ???
4861 function Safe_Unchecked_Type_Conversion (Exp : Node_Id) return Boolean is
4866 Pexp : constant Node_Id := Parent (Exp);
4869 -- If the expression is the RHS of an assignment or object declaration
4870 -- we are always OK because there will always be a target.
4872 -- Object renaming declarations, (generated for view conversions of
4873 -- actuals in inlined calls), like object declarations, provide an
4874 -- explicit type, and are safe as well.
4876 if (Nkind (Pexp) = N_Assignment_Statement
4877 and then Expression (Pexp) = Exp)
4878 or else Nkind (Pexp) = N_Object_Declaration
4879 or else Nkind (Pexp) = N_Object_Renaming_Declaration
4883 -- If the expression is the prefix of an N_Selected_Component
4884 -- we should also be OK because GCC knows to look inside the
4885 -- conversion except if the type is discriminated. We assume
4886 -- that we are OK anyway if the type is not set yet or if it is
4887 -- controlled since we can't afford to introduce a temporary in
4890 elsif Nkind (Pexp) = N_Selected_Component
4891 and then Prefix (Pexp) = Exp
4893 if No (Etype (Pexp)) then
4897 not Has_Discriminants (Etype (Pexp))
4898 or else Is_Constrained (Etype (Pexp));
4902 -- Set the output type, this comes from Etype if it is set, otherwise
4903 -- we take it from the subtype mark, which we assume was already
4906 if Present (Etype (Exp)) then
4907 Otyp := Etype (Exp);
4909 Otyp := Entity (Subtype_Mark (Exp));
4912 -- The input type always comes from the expression, and we assume
4913 -- this is indeed always analyzed, so we can simply get the Etype.
4915 Ityp := Etype (Expression (Exp));
4917 -- Initialize alignments to unknown so far
4922 -- Replace a concurrent type by its corresponding record type
4923 -- and each type by its underlying type and do the tests on those.
4924 -- The original type may be a private type whose completion is a
4925 -- concurrent type, so find the underlying type first.
4927 if Present (Underlying_Type (Otyp)) then
4928 Otyp := Underlying_Type (Otyp);
4931 if Present (Underlying_Type (Ityp)) then
4932 Ityp := Underlying_Type (Ityp);
4935 if Is_Concurrent_Type (Otyp) then
4936 Otyp := Corresponding_Record_Type (Otyp);
4939 if Is_Concurrent_Type (Ityp) then
4940 Ityp := Corresponding_Record_Type (Ityp);
4943 -- If the base types are the same, we know there is no problem since
4944 -- this conversion will be a noop.
4946 if Implementation_Base_Type (Otyp) = Implementation_Base_Type (Ityp) then
4949 -- Same if this is an upwards conversion of an untagged type, and there
4950 -- are no constraints involved (could be more general???)
4952 elsif Etype (Ityp) = Otyp
4953 and then not Is_Tagged_Type (Ityp)
4954 and then not Has_Discriminants (Ityp)
4955 and then No (First_Rep_Item (Base_Type (Ityp)))
4959 -- If the expression has an access type (object or subprogram) we
4960 -- assume that the conversion is safe, because the size of the target
4961 -- is safe, even if it is a record (which might be treated as having
4962 -- unknown size at this point).
4964 elsif Is_Access_Type (Ityp) then
4967 -- If the size of output type is known at compile time, there is
4968 -- never a problem. Note that unconstrained records are considered
4969 -- to be of known size, but we can't consider them that way here,
4970 -- because we are talking about the actual size of the object.
4972 -- We also make sure that in addition to the size being known, we do
4973 -- not have a case which might generate an embarrassingly large temp
4974 -- in stack checking mode.
4976 elsif Size_Known_At_Compile_Time (Otyp)
4978 (not Stack_Checking_Enabled
4979 or else not May_Generate_Large_Temp (Otyp))
4980 and then not (Is_Record_Type (Otyp) and then not Is_Constrained (Otyp))
4984 -- If either type is tagged, then we know the alignment is OK so
4985 -- Gigi will be able to use pointer punning.
4987 elsif Is_Tagged_Type (Otyp) or else Is_Tagged_Type (Ityp) then
4990 -- If either type is a limited record type, we cannot do a copy, so
4991 -- say safe since there's nothing else we can do.
4993 elsif Is_Limited_Record (Otyp) or else Is_Limited_Record (Ityp) then
4996 -- Conversions to and from packed array types are always ignored and
4999 elsif Is_Packed_Array_Type (Otyp)
5000 or else Is_Packed_Array_Type (Ityp)
5005 -- The only other cases known to be safe is if the input type's
5006 -- alignment is known to be at least the maximum alignment for the
5007 -- target or if both alignments are known and the output type's
5008 -- alignment is no stricter than the input's. We can use the alignment
5009 -- of the component type of an array if a type is an unpacked
5012 if Present (Alignment_Clause (Otyp)) then
5013 Oalign := Expr_Value (Expression (Alignment_Clause (Otyp)));
5015 elsif Is_Array_Type (Otyp)
5016 and then Present (Alignment_Clause (Component_Type (Otyp)))
5018 Oalign := Expr_Value (Expression (Alignment_Clause
5019 (Component_Type (Otyp))));
5022 if Present (Alignment_Clause (Ityp)) then
5023 Ialign := Expr_Value (Expression (Alignment_Clause (Ityp)));
5025 elsif Is_Array_Type (Ityp)
5026 and then Present (Alignment_Clause (Component_Type (Ityp)))
5028 Ialign := Expr_Value (Expression (Alignment_Clause
5029 (Component_Type (Ityp))));
5032 if Ialign /= No_Uint and then Ialign > Maximum_Alignment then
5035 elsif Ialign /= No_Uint and then Oalign /= No_Uint
5036 and then Ialign <= Oalign
5040 -- Otherwise, Gigi cannot handle this and we must make a temporary
5045 end Safe_Unchecked_Type_Conversion;
5047 ---------------------------------
5048 -- Set_Current_Value_Condition --
5049 ---------------------------------
5051 -- Note: the implementation of this procedure is very closely tied to the
5052 -- implementation of Get_Current_Value_Condition. Here we set required
5053 -- Current_Value fields, and in Get_Current_Value_Condition, we interpret
5054 -- them, so they must have a consistent view.
5056 procedure Set_Current_Value_Condition (Cnode : Node_Id) is
5058 procedure Set_Entity_Current_Value (N : Node_Id);
5059 -- If N is an entity reference, where the entity is of an appropriate
5060 -- kind, then set the current value of this entity to Cnode, unless
5061 -- there is already a definite value set there.
5063 procedure Set_Expression_Current_Value (N : Node_Id);
5064 -- If N is of an appropriate form, sets an appropriate entry in current
5065 -- value fields of relevant entities. Multiple entities can be affected
5066 -- in the case of an AND or AND THEN.
5068 ------------------------------
5069 -- Set_Entity_Current_Value --
5070 ------------------------------
5072 procedure Set_Entity_Current_Value (N : Node_Id) is
5074 if Is_Entity_Name (N) then
5076 Ent : constant Entity_Id := Entity (N);
5079 -- Don't capture if not safe to do so
5081 if not Safe_To_Capture_Value (N, Ent, Cond => True) then
5085 -- Here we have a case where the Current_Value field may
5086 -- need to be set. We set it if it is not already set to a
5087 -- compile time expression value.
5089 -- Note that this represents a decision that one condition
5090 -- blots out another previous one. That's certainly right
5091 -- if they occur at the same level. If the second one is
5092 -- nested, then the decision is neither right nor wrong (it
5093 -- would be equally OK to leave the outer one in place, or
5094 -- take the new inner one. Really we should record both, but
5095 -- our data structures are not that elaborate.
5097 if Nkind (Current_Value (Ent)) not in N_Subexpr then
5098 Set_Current_Value (Ent, Cnode);
5102 end Set_Entity_Current_Value;
5104 ----------------------------------
5105 -- Set_Expression_Current_Value --
5106 ----------------------------------
5108 procedure Set_Expression_Current_Value (N : Node_Id) is
5114 -- Loop to deal with (ignore for now) any NOT operators present. The
5115 -- presence of NOT operators will be handled properly when we call
5116 -- Get_Current_Value_Condition.
5118 while Nkind (Cond) = N_Op_Not loop
5119 Cond := Right_Opnd (Cond);
5122 -- For an AND or AND THEN, recursively process operands
5124 if Nkind (Cond) = N_Op_And or else Nkind (Cond) = N_And_Then then
5125 Set_Expression_Current_Value (Left_Opnd (Cond));
5126 Set_Expression_Current_Value (Right_Opnd (Cond));
5130 -- Check possible relational operator
5132 if Nkind (Cond) in N_Op_Compare then
5133 if Compile_Time_Known_Value (Right_Opnd (Cond)) then
5134 Set_Entity_Current_Value (Left_Opnd (Cond));
5135 elsif Compile_Time_Known_Value (Left_Opnd (Cond)) then
5136 Set_Entity_Current_Value (Right_Opnd (Cond));
5139 -- Check possible boolean variable reference
5142 Set_Entity_Current_Value (Cond);
5144 end Set_Expression_Current_Value;
5146 -- Start of processing for Set_Current_Value_Condition
5149 Set_Expression_Current_Value (Condition (Cnode));
5150 end Set_Current_Value_Condition;
5152 --------------------------
5153 -- Set_Elaboration_Flag --
5154 --------------------------
5156 procedure Set_Elaboration_Flag (N : Node_Id; Spec_Id : Entity_Id) is
5157 Loc : constant Source_Ptr := Sloc (N);
5158 Ent : constant Entity_Id := Elaboration_Entity (Spec_Id);
5162 if Present (Ent) then
5164 -- Nothing to do if at the compilation unit level, because in this
5165 -- case the flag is set by the binder generated elaboration routine.
5167 if Nkind (Parent (N)) = N_Compilation_Unit then
5170 -- Here we do need to generate an assignment statement
5173 Check_Restriction (No_Elaboration_Code, N);
5175 Make_Assignment_Statement (Loc,
5176 Name => New_Occurrence_Of (Ent, Loc),
5177 Expression => New_Occurrence_Of (Standard_True, Loc));
5179 if Nkind (Parent (N)) = N_Subunit then
5180 Insert_After (Corresponding_Stub (Parent (N)), Asn);
5182 Insert_After (N, Asn);
5187 -- Kill current value indication. This is necessary because the
5188 -- tests of this flag are inserted out of sequence and must not
5189 -- pick up bogus indications of the wrong constant value.
5191 Set_Current_Value (Ent, Empty);
5194 end Set_Elaboration_Flag;
5196 ----------------------------
5197 -- Set_Renamed_Subprogram --
5198 ----------------------------
5200 procedure Set_Renamed_Subprogram (N : Node_Id; E : Entity_Id) is
5202 -- If input node is an identifier, we can just reset it
5204 if Nkind (N) = N_Identifier then
5205 Set_Chars (N, Chars (E));
5208 -- Otherwise we have to do a rewrite, preserving Comes_From_Source
5212 CS : constant Boolean := Comes_From_Source (N);
5214 Rewrite (N, Make_Identifier (Sloc (N), Chars => Chars (E)));
5216 Set_Comes_From_Source (N, CS);
5217 Set_Analyzed (N, True);
5220 end Set_Renamed_Subprogram;
5222 ----------------------------------
5223 -- Silly_Boolean_Array_Not_Test --
5224 ----------------------------------
5226 -- This procedure implements an odd and silly test. We explicitly check
5227 -- for the case where the 'First of the component type is equal to the
5228 -- 'Last of this component type, and if this is the case, we make sure
5229 -- that constraint error is raised. The reason is that the NOT is bound
5230 -- to cause CE in this case, and we will not otherwise catch it.
5232 -- No such check is required for AND and OR, since for both these cases
5233 -- False op False = False, and True op True = True. For the XOR case,
5234 -- see Silly_Boolean_Array_Xor_Test.
5236 -- Believe it or not, this was reported as a bug. Note that nearly
5237 -- always, the test will evaluate statically to False, so the code will
5238 -- be statically removed, and no extra overhead caused.
5240 procedure Silly_Boolean_Array_Not_Test (N : Node_Id; T : Entity_Id) is
5241 Loc : constant Source_Ptr := Sloc (N);
5242 CT : constant Entity_Id := Component_Type (T);
5245 -- The check we install is
5247 -- constraint_error when
5248 -- component_type'first = component_type'last
5249 -- and then array_type'Length /= 0)
5251 -- We need the last guard because we don't want to raise CE for empty
5252 -- arrays since no out of range values result. (Empty arrays with a
5253 -- component type of True .. True -- very useful -- even the ACATS
5254 -- does not test that marginal case!)
5257 Make_Raise_Constraint_Error (Loc,
5263 Make_Attribute_Reference (Loc,
5264 Prefix => New_Occurrence_Of (CT, Loc),
5265 Attribute_Name => Name_First),
5268 Make_Attribute_Reference (Loc,
5269 Prefix => New_Occurrence_Of (CT, Loc),
5270 Attribute_Name => Name_Last)),
5272 Right_Opnd => Make_Non_Empty_Check (Loc, Right_Opnd (N))),
5273 Reason => CE_Range_Check_Failed));
5274 end Silly_Boolean_Array_Not_Test;
5276 ----------------------------------
5277 -- Silly_Boolean_Array_Xor_Test --
5278 ----------------------------------
5280 -- This procedure implements an odd and silly test. We explicitly check
5281 -- for the XOR case where the component type is True .. True, since this
5282 -- will raise constraint error. A special check is required since CE
5283 -- will not be generated otherwise (cf Expand_Packed_Not).
5285 -- No such check is required for AND and OR, since for both these cases
5286 -- False op False = False, and True op True = True, and no check is
5287 -- required for the case of False .. False, since False xor False = False.
5288 -- See also Silly_Boolean_Array_Not_Test
5290 procedure Silly_Boolean_Array_Xor_Test (N : Node_Id; T : Entity_Id) is
5291 Loc : constant Source_Ptr := Sloc (N);
5292 CT : constant Entity_Id := Component_Type (T);
5295 -- The check we install is
5297 -- constraint_error when
5298 -- Boolean (component_type'First)
5299 -- and then Boolean (component_type'Last)
5300 -- and then array_type'Length /= 0)
5302 -- We need the last guard because we don't want to raise CE for empty
5303 -- arrays since no out of range values result (Empty arrays with a
5304 -- component type of True .. True -- very useful -- even the ACATS
5305 -- does not test that marginal case!).
5308 Make_Raise_Constraint_Error (Loc,
5314 Convert_To (Standard_Boolean,
5315 Make_Attribute_Reference (Loc,
5316 Prefix => New_Occurrence_Of (CT, Loc),
5317 Attribute_Name => Name_First)),
5320 Convert_To (Standard_Boolean,
5321 Make_Attribute_Reference (Loc,
5322 Prefix => New_Occurrence_Of (CT, Loc),
5323 Attribute_Name => Name_Last))),
5325 Right_Opnd => Make_Non_Empty_Check (Loc, Right_Opnd (N))),
5326 Reason => CE_Range_Check_Failed));
5327 end Silly_Boolean_Array_Xor_Test;
5329 --------------------------
5330 -- Target_Has_Fixed_Ops --
5331 --------------------------
5333 Integer_Sized_Small : Ureal;
5334 -- Set to 2.0 ** -(Integer'Size - 1) the first time that this
5335 -- function is called (we don't want to compute it more than once!)
5337 Long_Integer_Sized_Small : Ureal;
5338 -- Set to 2.0 ** -(Long_Integer'Size - 1) the first time that this
5339 -- function is called (we don't want to compute it more than once)
5341 First_Time_For_THFO : Boolean := True;
5342 -- Set to False after first call (if Fractional_Fixed_Ops_On_Target)
5344 function Target_Has_Fixed_Ops
5345 (Left_Typ : Entity_Id;
5346 Right_Typ : Entity_Id;
5347 Result_Typ : Entity_Id) return Boolean
5349 function Is_Fractional_Type (Typ : Entity_Id) return Boolean;
5350 -- Return True if the given type is a fixed-point type with a small
5351 -- value equal to 2 ** (-(T'Object_Size - 1)) and whose values have
5352 -- an absolute value less than 1.0. This is currently limited
5353 -- to fixed-point types that map to Integer or Long_Integer.
5355 ------------------------
5356 -- Is_Fractional_Type --
5357 ------------------------
5359 function Is_Fractional_Type (Typ : Entity_Id) return Boolean is
5361 if Esize (Typ) = Standard_Integer_Size then
5362 return Small_Value (Typ) = Integer_Sized_Small;
5364 elsif Esize (Typ) = Standard_Long_Integer_Size then
5365 return Small_Value (Typ) = Long_Integer_Sized_Small;
5370 end Is_Fractional_Type;
5372 -- Start of processing for Target_Has_Fixed_Ops
5375 -- Return False if Fractional_Fixed_Ops_On_Target is false
5377 if not Fractional_Fixed_Ops_On_Target then
5381 -- Here the target has Fractional_Fixed_Ops, if first time, compute
5382 -- standard constants used by Is_Fractional_Type.
5384 if First_Time_For_THFO then
5385 First_Time_For_THFO := False;
5387 Integer_Sized_Small :=
5390 Den => UI_From_Int (Standard_Integer_Size - 1),
5393 Long_Integer_Sized_Small :=
5396 Den => UI_From_Int (Standard_Long_Integer_Size - 1),
5400 -- Return True if target supports fixed-by-fixed multiply/divide
5401 -- for fractional fixed-point types (see Is_Fractional_Type) and
5402 -- the operand and result types are equivalent fractional types.
5404 return Is_Fractional_Type (Base_Type (Left_Typ))
5405 and then Is_Fractional_Type (Base_Type (Right_Typ))
5406 and then Is_Fractional_Type (Base_Type (Result_Typ))
5407 and then Esize (Left_Typ) = Esize (Right_Typ)
5408 and then Esize (Left_Typ) = Esize (Result_Typ);
5409 end Target_Has_Fixed_Ops;
5411 ------------------------------------------
5412 -- Type_May_Have_Bit_Aligned_Components --
5413 ------------------------------------------
5415 function Type_May_Have_Bit_Aligned_Components
5416 (Typ : Entity_Id) return Boolean
5419 -- Array type, check component type
5421 if Is_Array_Type (Typ) then
5423 Type_May_Have_Bit_Aligned_Components (Component_Type (Typ));
5425 -- Record type, check components
5427 elsif Is_Record_Type (Typ) then
5432 E := First_Component_Or_Discriminant (Typ);
5433 while Present (E) loop
5434 if Component_May_Be_Bit_Aligned (E)
5435 or else Type_May_Have_Bit_Aligned_Components (Etype (E))
5440 Next_Component_Or_Discriminant (E);
5446 -- Type other than array or record is always OK
5451 end Type_May_Have_Bit_Aligned_Components;
5453 ----------------------------
5454 -- Wrap_Cleanup_Procedure --
5455 ----------------------------
5457 procedure Wrap_Cleanup_Procedure (N : Node_Id) is
5458 Loc : constant Source_Ptr := Sloc (N);
5459 Stseq : constant Node_Id := Handled_Statement_Sequence (N);
5460 Stmts : constant List_Id := Statements (Stseq);
5463 if Abort_Allowed then
5464 Prepend_To (Stmts, Build_Runtime_Call (Loc, RE_Abort_Defer));
5465 Append_To (Stmts, Build_Runtime_Call (Loc, RE_Abort_Undefer));
5467 end Wrap_Cleanup_Procedure;