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_Interface_ADT --
1403 ------------------------
1405 function Find_Interface_ADT
1407 Iface : Entity_Id) return Elmt_Id
1410 Typ : Entity_Id := T;
1413 pragma Assert (Is_Interface (Iface));
1415 -- Handle private types
1417 if Has_Private_Declaration (Typ)
1418 and then Present (Full_View (Typ))
1420 Typ := Full_View (Typ);
1423 -- Handle access types
1425 if Is_Access_Type (Typ) then
1426 Typ := Directly_Designated_Type (Typ);
1429 -- Handle task and protected types implementing interfaces
1431 if Is_Concurrent_Type (Typ) then
1432 Typ := Corresponding_Record_Type (Typ);
1436 (not Is_Class_Wide_Type (Typ)
1437 and then Ekind (Typ) /= E_Incomplete_Type);
1439 if Is_Ancestor (Iface, Typ) then
1440 return First_Elmt (Access_Disp_Table (Typ));
1444 Next_Elmt (Next_Elmt (First_Elmt (Access_Disp_Table (Typ))));
1446 and then Present (Related_Type (Node (ADT)))
1447 and then Related_Type (Node (ADT)) /= Iface
1448 and then not Is_Ancestor (Iface, Related_Type (Node (ADT)))
1453 pragma Assert (Present (Related_Type (Node (ADT))));
1456 end Find_Interface_ADT;
1458 ------------------------
1459 -- Find_Interface_Tag --
1460 ------------------------
1462 function Find_Interface_Tag
1464 Iface : Entity_Id) return Entity_Id
1467 Found : Boolean := False;
1468 Typ : Entity_Id := T;
1470 procedure Find_Tag (Typ : Entity_Id);
1471 -- Internal subprogram used to recursively climb to the ancestors
1477 procedure Find_Tag (Typ : Entity_Id) is
1482 -- Check if the interface is an immediate ancestor of the type and
1483 -- therefore shares the main tag.
1486 pragma Assert (Etype (First_Tag_Component (Typ)) = RTE (RE_Tag));
1487 AI_Tag := First_Tag_Component (Typ);
1492 -- Climb to the root type handling private types
1494 if Present (Full_View (Etype (Typ))) then
1495 if Full_View (Etype (Typ)) /= Typ then
1496 Find_Tag (Full_View (Etype (Typ)));
1499 elsif Etype (Typ) /= Typ then
1500 Find_Tag (Etype (Typ));
1503 -- Traverse the list of interfaces implemented by the type
1506 and then Present (Interfaces (Typ))
1507 and then not (Is_Empty_Elmt_List (Interfaces (Typ)))
1509 -- Skip the tag associated with the primary table
1511 pragma Assert (Etype (First_Tag_Component (Typ)) = RTE (RE_Tag));
1512 AI_Tag := Next_Tag_Component (First_Tag_Component (Typ));
1513 pragma Assert (Present (AI_Tag));
1515 AI_Elmt := First_Elmt (Interfaces (Typ));
1516 while Present (AI_Elmt) loop
1517 AI := Node (AI_Elmt);
1519 if AI = Iface or else Is_Ancestor (Iface, AI) then
1524 AI_Tag := Next_Tag_Component (AI_Tag);
1525 Next_Elmt (AI_Elmt);
1530 -- Start of processing for Find_Interface_Tag
1533 pragma Assert (Is_Interface (Iface));
1535 -- Handle private types
1537 if Has_Private_Declaration (Typ)
1538 and then Present (Full_View (Typ))
1540 Typ := Full_View (Typ);
1543 -- Handle access types
1545 if Is_Access_Type (Typ) then
1546 Typ := Directly_Designated_Type (Typ);
1549 -- Handle task and protected types implementing interfaces
1551 if Is_Concurrent_Type (Typ) then
1552 Typ := Corresponding_Record_Type (Typ);
1555 if Is_Class_Wide_Type (Typ) then
1559 -- Handle entities from the limited view
1561 if Ekind (Typ) = E_Incomplete_Type then
1562 pragma Assert (Present (Non_Limited_View (Typ)));
1563 Typ := Non_Limited_View (Typ);
1567 pragma Assert (Found);
1569 end Find_Interface_Tag;
1575 function Find_Prim_Op (T : Entity_Id; Name : Name_Id) return Entity_Id is
1577 Typ : Entity_Id := T;
1581 if Is_Class_Wide_Type (Typ) then
1582 Typ := Root_Type (Typ);
1585 Typ := Underlying_Type (Typ);
1587 -- Loop through primitive operations
1589 Prim := First_Elmt (Primitive_Operations (Typ));
1590 while Present (Prim) loop
1593 -- We can retrieve primitive operations by name if it is an internal
1594 -- name. For equality we must check that both of its operands have
1595 -- the same type, to avoid confusion with user-defined equalities
1596 -- than may have a non-symmetric signature.
1598 exit when Chars (Op) = Name
1601 or else Etype (First_Entity (Op)) = Etype (Last_Entity (Op)));
1605 -- Raise Program_Error if no primitive found
1608 raise Program_Error;
1619 function Find_Prim_Op
1621 Name : TSS_Name_Type) return Entity_Id
1624 Typ : Entity_Id := T;
1627 if Is_Class_Wide_Type (Typ) then
1628 Typ := Root_Type (Typ);
1631 Typ := Underlying_Type (Typ);
1633 Prim := First_Elmt (Primitive_Operations (Typ));
1634 while not Is_TSS (Node (Prim), Name) loop
1637 -- Raise program error if no primitive found
1640 raise Program_Error;
1647 ----------------------------
1648 -- Find_Protection_Object --
1649 ----------------------------
1651 function Find_Protection_Object (Scop : Entity_Id) return Entity_Id is
1656 while Present (S) loop
1657 if (Ekind (S) = E_Entry
1658 or else Ekind (S) = E_Entry_Family
1659 or else Ekind (S) = E_Function
1660 or else Ekind (S) = E_Procedure)
1661 and then Present (Protection_Object (S))
1663 return Protection_Object (S);
1669 -- If we do not find a Protection object in the scope chain, then
1670 -- something has gone wrong, most likely the object was never created.
1672 raise Program_Error;
1673 end Find_Protection_Object;
1675 ----------------------
1676 -- Force_Evaluation --
1677 ----------------------
1679 procedure Force_Evaluation (Exp : Node_Id; Name_Req : Boolean := False) is
1681 Remove_Side_Effects (Exp, Name_Req, Variable_Ref => True);
1682 end Force_Evaluation;
1684 ------------------------
1685 -- Generate_Poll_Call --
1686 ------------------------
1688 procedure Generate_Poll_Call (N : Node_Id) is
1690 -- No poll call if polling not active
1692 if not Polling_Required then
1695 -- Otherwise generate require poll call
1698 Insert_Before_And_Analyze (N,
1699 Make_Procedure_Call_Statement (Sloc (N),
1700 Name => New_Occurrence_Of (RTE (RE_Poll), Sloc (N))));
1702 end Generate_Poll_Call;
1704 ---------------------------------
1705 -- Get_Current_Value_Condition --
1706 ---------------------------------
1708 -- Note: the implementation of this procedure is very closely tied to the
1709 -- implementation of Set_Current_Value_Condition. In the Get procedure, we
1710 -- interpret Current_Value fields set by the Set procedure, so the two
1711 -- procedures need to be closely coordinated.
1713 procedure Get_Current_Value_Condition
1718 Loc : constant Source_Ptr := Sloc (Var);
1719 Ent : constant Entity_Id := Entity (Var);
1721 procedure Process_Current_Value_Condition
1724 -- N is an expression which holds either True (S = True) or False (S =
1725 -- False) in the condition. This procedure digs out the expression and
1726 -- if it refers to Ent, sets Op and Val appropriately.
1728 -------------------------------------
1729 -- Process_Current_Value_Condition --
1730 -------------------------------------
1732 procedure Process_Current_Value_Condition
1743 -- Deal with NOT operators, inverting sense
1745 while Nkind (Cond) = N_Op_Not loop
1746 Cond := Right_Opnd (Cond);
1750 -- Deal with AND THEN and AND cases
1752 if Nkind (Cond) = N_And_Then
1753 or else Nkind (Cond) = N_Op_And
1755 -- Don't ever try to invert a condition that is of the form
1756 -- of an AND or AND THEN (since we are not doing sufficiently
1757 -- general processing to allow this).
1759 if Sens = False then
1765 -- Recursively process AND and AND THEN branches
1767 Process_Current_Value_Condition (Left_Opnd (Cond), True);
1769 if Op /= N_Empty then
1773 Process_Current_Value_Condition (Right_Opnd (Cond), True);
1776 -- Case of relational operator
1778 elsif Nkind (Cond) in N_Op_Compare then
1781 -- Invert sense of test if inverted test
1783 if Sens = False then
1785 when N_Op_Eq => Op := N_Op_Ne;
1786 when N_Op_Ne => Op := N_Op_Eq;
1787 when N_Op_Lt => Op := N_Op_Ge;
1788 when N_Op_Gt => Op := N_Op_Le;
1789 when N_Op_Le => Op := N_Op_Gt;
1790 when N_Op_Ge => Op := N_Op_Lt;
1791 when others => raise Program_Error;
1795 -- Case of entity op value
1797 if Is_Entity_Name (Left_Opnd (Cond))
1798 and then Ent = Entity (Left_Opnd (Cond))
1799 and then Compile_Time_Known_Value (Right_Opnd (Cond))
1801 Val := Right_Opnd (Cond);
1803 -- Case of value op entity
1805 elsif Is_Entity_Name (Right_Opnd (Cond))
1806 and then Ent = Entity (Right_Opnd (Cond))
1807 and then Compile_Time_Known_Value (Left_Opnd (Cond))
1809 Val := Left_Opnd (Cond);
1811 -- We are effectively swapping operands
1814 when N_Op_Eq => null;
1815 when N_Op_Ne => null;
1816 when N_Op_Lt => Op := N_Op_Gt;
1817 when N_Op_Gt => Op := N_Op_Lt;
1818 when N_Op_Le => Op := N_Op_Ge;
1819 when N_Op_Ge => Op := N_Op_Le;
1820 when others => raise Program_Error;
1829 -- Case of Boolean variable reference, return as though the
1830 -- reference had said var = True.
1833 if Is_Entity_Name (Cond)
1834 and then Ent = Entity (Cond)
1836 Val := New_Occurrence_Of (Standard_True, Sloc (Cond));
1838 if Sens = False then
1845 end Process_Current_Value_Condition;
1847 -- Start of processing for Get_Current_Value_Condition
1853 -- Immediate return, nothing doing, if this is not an object
1855 if Ekind (Ent) not in Object_Kind then
1859 -- Otherwise examine current value
1862 CV : constant Node_Id := Current_Value (Ent);
1867 -- If statement. Condition is known true in THEN section, known False
1868 -- in any ELSIF or ELSE part, and unknown outside the IF statement.
1870 if Nkind (CV) = N_If_Statement then
1872 -- Before start of IF statement
1874 if Loc < Sloc (CV) then
1877 -- After end of IF statement
1879 elsif Loc >= Sloc (CV) + Text_Ptr (UI_To_Int (End_Span (CV))) then
1883 -- At this stage we know that we are within the IF statement, but
1884 -- unfortunately, the tree does not record the SLOC of the ELSE so
1885 -- we cannot use a simple SLOC comparison to distinguish between
1886 -- the then/else statements, so we have to climb the tree.
1893 while Parent (N) /= CV loop
1896 -- If we fall off the top of the tree, then that's odd, but
1897 -- perhaps it could occur in some error situation, and the
1898 -- safest response is simply to assume that the outcome of
1899 -- the condition is unknown. No point in bombing during an
1900 -- attempt to optimize things.
1907 -- Now we have N pointing to a node whose parent is the IF
1908 -- statement in question, so now we can tell if we are within
1909 -- the THEN statements.
1911 if Is_List_Member (N)
1912 and then List_Containing (N) = Then_Statements (CV)
1916 -- If the variable reference does not come from source, we
1917 -- cannot reliably tell whether it appears in the else part.
1918 -- In particular, if it appears in generated code for a node
1919 -- that requires finalization, it may be attached to a list
1920 -- that has not been yet inserted into the code. For now,
1921 -- treat it as unknown.
1923 elsif not Comes_From_Source (N) then
1926 -- Otherwise we must be in ELSIF or ELSE part
1933 -- ELSIF part. Condition is known true within the referenced
1934 -- ELSIF, known False in any subsequent ELSIF or ELSE part, and
1935 -- unknown before the ELSE part or after the IF statement.
1937 elsif Nkind (CV) = N_Elsif_Part then
1940 -- Before start of ELSIF part
1942 if Loc < Sloc (CV) then
1945 -- After end of IF statement
1947 elsif Loc >= Sloc (Stm) +
1948 Text_Ptr (UI_To_Int (End_Span (Stm)))
1953 -- Again we lack the SLOC of the ELSE, so we need to climb the
1954 -- tree to see if we are within the ELSIF part in question.
1961 while Parent (N) /= Stm 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 see if is the ELSIF part we want.
1977 -- the THEN statements.
1982 -- Otherwise we must be in subsequent ELSIF or ELSE part
1989 -- Iteration scheme of while loop. The condition is known to be
1990 -- true within the body of the loop.
1992 elsif Nkind (CV) = N_Iteration_Scheme then
1994 Loop_Stmt : constant Node_Id := Parent (CV);
1997 -- Before start of body of loop
1999 if Loc < Sloc (Loop_Stmt) then
2002 -- After end of LOOP statement
2004 elsif Loc >= Sloc (End_Label (Loop_Stmt)) then
2007 -- We are within the body of the loop
2014 -- All other cases of Current_Value settings
2020 -- If we fall through here, then we have a reportable condition, Sens
2021 -- is True if the condition is true and False if it needs inverting.
2023 Process_Current_Value_Condition (Condition (CV), Sens);
2025 end Get_Current_Value_Condition;
2027 ---------------------------------
2028 -- Has_Controlled_Coextensions --
2029 ---------------------------------
2031 function Has_Controlled_Coextensions (Typ : Entity_Id) return Boolean is
2036 -- Only consider record types
2038 if Ekind (Typ) /= E_Record_Type
2039 and then Ekind (Typ) /= E_Record_Subtype
2044 if Has_Discriminants (Typ) then
2045 Discr := First_Discriminant (Typ);
2046 while Present (Discr) loop
2047 D_Typ := Etype (Discr);
2049 if Ekind (D_Typ) = E_Anonymous_Access_Type
2051 (Is_Controlled (Directly_Designated_Type (D_Typ))
2053 Is_Concurrent_Type (Directly_Designated_Type (D_Typ)))
2058 Next_Discriminant (Discr);
2063 end Has_Controlled_Coextensions;
2065 --------------------
2066 -- Homonym_Number --
2067 --------------------
2069 function Homonym_Number (Subp : Entity_Id) return Nat is
2075 Hom := Homonym (Subp);
2076 while Present (Hom) loop
2077 if Scope (Hom) = Scope (Subp) then
2081 Hom := Homonym (Hom);
2087 ------------------------------
2088 -- In_Unconditional_Context --
2089 ------------------------------
2091 function In_Unconditional_Context (Node : Node_Id) return Boolean is
2096 while Present (P) loop
2098 when N_Subprogram_Body =>
2101 when N_If_Statement =>
2104 when N_Loop_Statement =>
2107 when N_Case_Statement =>
2116 end In_Unconditional_Context;
2122 procedure Insert_Action (Assoc_Node : Node_Id; Ins_Action : Node_Id) is
2124 if Present (Ins_Action) then
2125 Insert_Actions (Assoc_Node, New_List (Ins_Action));
2129 -- Version with check(s) suppressed
2131 procedure Insert_Action
2132 (Assoc_Node : Node_Id; Ins_Action : Node_Id; Suppress : Check_Id)
2135 Insert_Actions (Assoc_Node, New_List (Ins_Action), Suppress);
2138 --------------------
2139 -- Insert_Actions --
2140 --------------------
2142 procedure Insert_Actions (Assoc_Node : Node_Id; Ins_Actions : List_Id) is
2146 Wrapped_Node : Node_Id := Empty;
2149 if No (Ins_Actions) or else Is_Empty_List (Ins_Actions) then
2153 -- Ignore insert of actions from inside default expression (or other
2154 -- similar "spec expression") in the special spec-expression analyze
2155 -- mode. Any insertions at this point have no relevance, since we are
2156 -- only doing the analyze to freeze the types of any static expressions.
2157 -- See section "Handling of Default Expressions" in the spec of package
2158 -- Sem for further details.
2160 if In_Spec_Expression then
2164 -- If the action derives from stuff inside a record, then the actions
2165 -- are attached to the current scope, to be inserted and analyzed on
2166 -- exit from the scope. The reason for this is that we may also
2167 -- be generating freeze actions at the same time, and they must
2168 -- eventually be elaborated in the correct order.
2170 if Is_Record_Type (Current_Scope)
2171 and then not Is_Frozen (Current_Scope)
2173 if No (Scope_Stack.Table
2174 (Scope_Stack.Last).Pending_Freeze_Actions)
2176 Scope_Stack.Table (Scope_Stack.Last).Pending_Freeze_Actions :=
2181 Scope_Stack.Table (Scope_Stack.Last).Pending_Freeze_Actions);
2187 -- We now intend to climb up the tree to find the right point to
2188 -- insert the actions. We start at Assoc_Node, unless this node is
2189 -- a subexpression in which case we start with its parent. We do this
2190 -- for two reasons. First it speeds things up. Second, if Assoc_Node
2191 -- is itself one of the special nodes like N_And_Then, then we assume
2192 -- that an initial request to insert actions for such a node does not
2193 -- expect the actions to get deposited in the node for later handling
2194 -- when the node is expanded, since clearly the node is being dealt
2195 -- with by the caller. Note that in the subexpression case, N is
2196 -- always the child we came from.
2198 -- N_Raise_xxx_Error is an annoying special case, it is a statement
2199 -- if it has type Standard_Void_Type, and a subexpression otherwise.
2200 -- otherwise. Procedure attribute references are also statements.
2202 if Nkind (Assoc_Node) in N_Subexpr
2203 and then (Nkind (Assoc_Node) in N_Raise_xxx_Error
2204 or else Etype (Assoc_Node) /= Standard_Void_Type)
2205 and then (Nkind (Assoc_Node) /= N_Attribute_Reference
2207 not Is_Procedure_Attribute_Name
2208 (Attribute_Name (Assoc_Node)))
2210 P := Assoc_Node; -- ??? does not agree with above!
2211 N := Parent (Assoc_Node);
2213 -- Non-subexpression case. Note that N is initially Empty in this
2214 -- case (N is only guaranteed Non-Empty in the subexpr case).
2221 -- Capture root of the transient scope
2223 if Scope_Is_Transient then
2224 Wrapped_Node := Node_To_Be_Wrapped;
2228 pragma Assert (Present (P));
2232 -- Case of right operand of AND THEN or OR ELSE. Put the actions
2233 -- in the Actions field of the right operand. They will be moved
2234 -- out further when the AND THEN or OR ELSE operator is expanded.
2235 -- Nothing special needs to be done for the left operand since
2236 -- in that case the actions are executed unconditionally.
2238 when N_And_Then | N_Or_Else =>
2239 if N = Right_Opnd (P) then
2241 -- We are now going to either append the actions to the
2242 -- actions field of the short-circuit operation. We will
2243 -- also analyze the actions now.
2245 -- This analysis is really too early, the proper thing would
2246 -- be to just park them there now, and only analyze them if
2247 -- we find we really need them, and to it at the proper
2248 -- final insertion point. However attempting to this proved
2249 -- tricky, so for now we just kill current values before and
2250 -- after the analyze call to make sure we avoid peculiar
2251 -- optimizations from this out of order insertion.
2253 Kill_Current_Values;
2255 if Present (Actions (P)) then
2256 Insert_List_After_And_Analyze
2257 (Last (Actions (P)), Ins_Actions);
2259 Set_Actions (P, Ins_Actions);
2260 Analyze_List (Actions (P));
2263 Kill_Current_Values;
2268 -- Then or Else operand of conditional expression. Add actions to
2269 -- Then_Actions or Else_Actions field as appropriate. The actions
2270 -- will be moved further out when the conditional is expanded.
2272 when N_Conditional_Expression =>
2274 ThenX : constant Node_Id := Next (First (Expressions (P)));
2275 ElseX : constant Node_Id := Next (ThenX);
2278 -- Actions belong to the then expression, temporarily
2279 -- place them as Then_Actions of the conditional expr.
2280 -- They will be moved to the proper place later when
2281 -- the conditional expression is expanded.
2284 if Present (Then_Actions (P)) then
2285 Insert_List_After_And_Analyze
2286 (Last (Then_Actions (P)), Ins_Actions);
2288 Set_Then_Actions (P, Ins_Actions);
2289 Analyze_List (Then_Actions (P));
2294 -- Actions belong to the else expression, temporarily
2295 -- place them as Else_Actions of the conditional expr.
2296 -- They will be moved to the proper place later when
2297 -- the conditional expression is expanded.
2299 elsif N = ElseX then
2300 if Present (Else_Actions (P)) then
2301 Insert_List_After_And_Analyze
2302 (Last (Else_Actions (P)), Ins_Actions);
2304 Set_Else_Actions (P, Ins_Actions);
2305 Analyze_List (Else_Actions (P));
2310 -- Actions belong to the condition. In this case they are
2311 -- unconditionally executed, and so we can continue the
2312 -- search for the proper insert point.
2319 -- Case of appearing in the condition of a while expression or
2320 -- elsif. We insert the actions into the Condition_Actions field.
2321 -- They will be moved further out when the while loop or elsif
2324 when N_Iteration_Scheme |
2327 if N = Condition (P) then
2328 if Present (Condition_Actions (P)) then
2329 Insert_List_After_And_Analyze
2330 (Last (Condition_Actions (P)), Ins_Actions);
2332 Set_Condition_Actions (P, Ins_Actions);
2334 -- Set the parent of the insert actions explicitly.
2335 -- This is not a syntactic field, but we need the
2336 -- parent field set, in particular so that freeze
2337 -- can understand that it is dealing with condition
2338 -- actions, and properly insert the freezing actions.
2340 Set_Parent (Ins_Actions, P);
2341 Analyze_List (Condition_Actions (P));
2347 -- Statements, declarations, pragmas, representation clauses
2352 N_Procedure_Call_Statement |
2353 N_Statement_Other_Than_Procedure_Call |
2359 -- Representation_Clause
2362 N_Attribute_Definition_Clause |
2363 N_Enumeration_Representation_Clause |
2364 N_Record_Representation_Clause |
2368 N_Abstract_Subprogram_Declaration |
2370 N_Exception_Declaration |
2371 N_Exception_Renaming_Declaration |
2372 N_Formal_Abstract_Subprogram_Declaration |
2373 N_Formal_Concrete_Subprogram_Declaration |
2374 N_Formal_Object_Declaration |
2375 N_Formal_Type_Declaration |
2376 N_Full_Type_Declaration |
2377 N_Function_Instantiation |
2378 N_Generic_Function_Renaming_Declaration |
2379 N_Generic_Package_Declaration |
2380 N_Generic_Package_Renaming_Declaration |
2381 N_Generic_Procedure_Renaming_Declaration |
2382 N_Generic_Subprogram_Declaration |
2383 N_Implicit_Label_Declaration |
2384 N_Incomplete_Type_Declaration |
2385 N_Number_Declaration |
2386 N_Object_Declaration |
2387 N_Object_Renaming_Declaration |
2389 N_Package_Body_Stub |
2390 N_Package_Declaration |
2391 N_Package_Instantiation |
2392 N_Package_Renaming_Declaration |
2393 N_Private_Extension_Declaration |
2394 N_Private_Type_Declaration |
2395 N_Procedure_Instantiation |
2397 N_Protected_Body_Stub |
2398 N_Protected_Type_Declaration |
2399 N_Single_Task_Declaration |
2401 N_Subprogram_Body_Stub |
2402 N_Subprogram_Declaration |
2403 N_Subprogram_Renaming_Declaration |
2404 N_Subtype_Declaration |
2407 N_Task_Type_Declaration |
2409 -- Freeze entity behaves like a declaration or statement
2413 -- Do not insert here if the item is not a list member (this
2414 -- happens for example with a triggering statement, and the
2415 -- proper approach is to insert before the entire select).
2417 if not Is_List_Member (P) then
2420 -- Do not insert if parent of P is an N_Component_Association
2421 -- node (i.e. we are in the context of an N_Aggregate or
2422 -- N_Extension_Aggregate node. In this case we want to insert
2423 -- before the entire aggregate.
2425 elsif Nkind (Parent (P)) = N_Component_Association then
2428 -- Do not insert if the parent of P is either an N_Variant
2429 -- node or an N_Record_Definition node, meaning in either
2430 -- case that P is a member of a component list, and that
2431 -- therefore the actions should be inserted outside the
2432 -- complete record declaration.
2434 elsif Nkind (Parent (P)) = N_Variant
2435 or else Nkind (Parent (P)) = N_Record_Definition
2439 -- Do not insert freeze nodes within the loop generated for
2440 -- an aggregate, because they may be elaborated too late for
2441 -- subsequent use in the back end: within a package spec the
2442 -- loop is part of the elaboration procedure and is only
2443 -- elaborated during the second pass.
2444 -- If the loop comes from source, or the entity is local to
2445 -- the loop itself it must remain within.
2447 elsif Nkind (Parent (P)) = N_Loop_Statement
2448 and then not Comes_From_Source (Parent (P))
2449 and then Nkind (First (Ins_Actions)) = N_Freeze_Entity
2451 Scope (Entity (First (Ins_Actions))) /= Current_Scope
2455 -- Otherwise we can go ahead and do the insertion
2457 elsif P = Wrapped_Node then
2458 Store_Before_Actions_In_Scope (Ins_Actions);
2462 Insert_List_Before_And_Analyze (P, Ins_Actions);
2466 -- A special case, N_Raise_xxx_Error can act either as a
2467 -- statement or a subexpression. We tell the difference
2468 -- by looking at the Etype. It is set to Standard_Void_Type
2469 -- in the statement case.
2472 N_Raise_xxx_Error =>
2473 if Etype (P) = Standard_Void_Type then
2474 if P = Wrapped_Node then
2475 Store_Before_Actions_In_Scope (Ins_Actions);
2477 Insert_List_Before_And_Analyze (P, Ins_Actions);
2482 -- In the subexpression case, keep climbing
2488 -- If a component association appears within a loop created for
2489 -- an array aggregate, attach the actions to the association so
2490 -- they can be subsequently inserted within the loop. For other
2491 -- component associations insert outside of the aggregate. For
2492 -- an association that will generate a loop, its Loop_Actions
2493 -- attribute is already initialized (see exp_aggr.adb).
2495 -- The list of loop_actions can in turn generate additional ones,
2496 -- that are inserted before the associated node. If the associated
2497 -- node is outside the aggregate, the new actions are collected
2498 -- at the end of the loop actions, to respect the order in which
2499 -- they are to be elaborated.
2502 N_Component_Association =>
2503 if Nkind (Parent (P)) = N_Aggregate
2504 and then Present (Loop_Actions (P))
2506 if Is_Empty_List (Loop_Actions (P)) then
2507 Set_Loop_Actions (P, Ins_Actions);
2508 Analyze_List (Ins_Actions);
2515 -- Check whether these actions were generated
2516 -- by a declaration that is part of the loop_
2517 -- actions for the component_association.
2520 while Present (Decl) loop
2521 exit when Parent (Decl) = P
2522 and then Is_List_Member (Decl)
2524 List_Containing (Decl) = Loop_Actions (P);
2525 Decl := Parent (Decl);
2528 if Present (Decl) then
2529 Insert_List_Before_And_Analyze
2530 (Decl, Ins_Actions);
2532 Insert_List_After_And_Analyze
2533 (Last (Loop_Actions (P)), Ins_Actions);
2544 -- Another special case, an attribute denoting a procedure call
2547 N_Attribute_Reference =>
2548 if Is_Procedure_Attribute_Name (Attribute_Name (P)) then
2549 if P = Wrapped_Node then
2550 Store_Before_Actions_In_Scope (Ins_Actions);
2552 Insert_List_Before_And_Analyze (P, Ins_Actions);
2557 -- In the subexpression case, keep climbing
2563 -- For all other node types, keep climbing tree
2567 N_Accept_Alternative |
2568 N_Access_Definition |
2569 N_Access_Function_Definition |
2570 N_Access_Procedure_Definition |
2571 N_Access_To_Object_Definition |
2574 N_Case_Statement_Alternative |
2575 N_Character_Literal |
2576 N_Compilation_Unit |
2577 N_Compilation_Unit_Aux |
2578 N_Component_Clause |
2579 N_Component_Declaration |
2580 N_Component_Definition |
2582 N_Constrained_Array_Definition |
2583 N_Decimal_Fixed_Point_Definition |
2584 N_Defining_Character_Literal |
2585 N_Defining_Identifier |
2586 N_Defining_Operator_Symbol |
2587 N_Defining_Program_Unit_Name |
2588 N_Delay_Alternative |
2589 N_Delta_Constraint |
2590 N_Derived_Type_Definition |
2592 N_Digits_Constraint |
2593 N_Discriminant_Association |
2594 N_Discriminant_Specification |
2596 N_Entry_Body_Formal_Part |
2597 N_Entry_Call_Alternative |
2598 N_Entry_Declaration |
2599 N_Entry_Index_Specification |
2600 N_Enumeration_Type_Definition |
2602 N_Exception_Handler |
2604 N_Explicit_Dereference |
2605 N_Extension_Aggregate |
2606 N_Floating_Point_Definition |
2607 N_Formal_Decimal_Fixed_Point_Definition |
2608 N_Formal_Derived_Type_Definition |
2609 N_Formal_Discrete_Type_Definition |
2610 N_Formal_Floating_Point_Definition |
2611 N_Formal_Modular_Type_Definition |
2612 N_Formal_Ordinary_Fixed_Point_Definition |
2613 N_Formal_Package_Declaration |
2614 N_Formal_Private_Type_Definition |
2615 N_Formal_Signed_Integer_Type_Definition |
2617 N_Function_Specification |
2618 N_Generic_Association |
2619 N_Handled_Sequence_Of_Statements |
2622 N_Index_Or_Discriminant_Constraint |
2623 N_Indexed_Component |
2627 N_Loop_Parameter_Specification |
2629 N_Modular_Type_Definition |
2655 N_Op_Shift_Right_Arithmetic |
2659 N_Ordinary_Fixed_Point_Definition |
2661 N_Package_Specification |
2662 N_Parameter_Association |
2663 N_Parameter_Specification |
2664 N_Pop_Constraint_Error_Label |
2665 N_Pop_Program_Error_Label |
2666 N_Pop_Storage_Error_Label |
2667 N_Pragma_Argument_Association |
2668 N_Procedure_Specification |
2669 N_Protected_Definition |
2670 N_Push_Constraint_Error_Label |
2671 N_Push_Program_Error_Label |
2672 N_Push_Storage_Error_Label |
2673 N_Qualified_Expression |
2675 N_Range_Constraint |
2677 N_Real_Range_Specification |
2678 N_Record_Definition |
2680 N_Selected_Component |
2681 N_Signed_Integer_Type_Definition |
2682 N_Single_Protected_Declaration |
2686 N_Subtype_Indication |
2689 N_Terminate_Alternative |
2690 N_Triggering_Alternative |
2692 N_Unchecked_Expression |
2693 N_Unchecked_Type_Conversion |
2694 N_Unconstrained_Array_Definition |
2697 N_Use_Package_Clause |
2701 N_Validate_Unchecked_Conversion |
2708 -- Make sure that inserted actions stay in the transient scope
2710 if P = Wrapped_Node then
2711 Store_Before_Actions_In_Scope (Ins_Actions);
2715 -- If we fall through above tests, keep climbing tree
2719 if Nkind (Parent (N)) = N_Subunit then
2721 -- This is the proper body corresponding to a stub. Insertion
2722 -- must be done at the point of the stub, which is in the decla-
2723 -- rative part of the parent unit.
2725 P := Corresponding_Stub (Parent (N));
2733 -- Version with check(s) suppressed
2735 procedure Insert_Actions
2736 (Assoc_Node : Node_Id;
2737 Ins_Actions : List_Id;
2738 Suppress : Check_Id)
2741 if Suppress = All_Checks then
2743 Svg : constant Suppress_Array := Scope_Suppress;
2745 Scope_Suppress := (others => True);
2746 Insert_Actions (Assoc_Node, Ins_Actions);
2747 Scope_Suppress := Svg;
2752 Svg : constant Boolean := Scope_Suppress (Suppress);
2754 Scope_Suppress (Suppress) := True;
2755 Insert_Actions (Assoc_Node, Ins_Actions);
2756 Scope_Suppress (Suppress) := Svg;
2761 --------------------------
2762 -- Insert_Actions_After --
2763 --------------------------
2765 procedure Insert_Actions_After
2766 (Assoc_Node : Node_Id;
2767 Ins_Actions : List_Id)
2770 if Scope_Is_Transient
2771 and then Assoc_Node = Node_To_Be_Wrapped
2773 Store_After_Actions_In_Scope (Ins_Actions);
2775 Insert_List_After_And_Analyze (Assoc_Node, Ins_Actions);
2777 end Insert_Actions_After;
2779 ---------------------------------
2780 -- Insert_Library_Level_Action --
2781 ---------------------------------
2783 procedure Insert_Library_Level_Action (N : Node_Id) is
2784 Aux : constant Node_Id := Aux_Decls_Node (Cunit (Main_Unit));
2787 Push_Scope (Cunit_Entity (Main_Unit));
2788 -- ??? should this be Current_Sem_Unit instead of Main_Unit?
2790 if No (Actions (Aux)) then
2791 Set_Actions (Aux, New_List (N));
2793 Append (N, Actions (Aux));
2798 end Insert_Library_Level_Action;
2800 ----------------------------------
2801 -- Insert_Library_Level_Actions --
2802 ----------------------------------
2804 procedure Insert_Library_Level_Actions (L : List_Id) is
2805 Aux : constant Node_Id := Aux_Decls_Node (Cunit (Main_Unit));
2808 if Is_Non_Empty_List (L) then
2809 Push_Scope (Cunit_Entity (Main_Unit));
2810 -- ??? should this be Current_Sem_Unit instead of Main_Unit?
2812 if No (Actions (Aux)) then
2813 Set_Actions (Aux, L);
2816 Insert_List_After_And_Analyze (Last (Actions (Aux)), L);
2821 end Insert_Library_Level_Actions;
2823 ----------------------
2824 -- Inside_Init_Proc --
2825 ----------------------
2827 function Inside_Init_Proc return Boolean is
2833 and then S /= Standard_Standard
2835 if Is_Init_Proc (S) then
2843 end Inside_Init_Proc;
2845 ----------------------------
2846 -- Is_All_Null_Statements --
2847 ----------------------------
2849 function Is_All_Null_Statements (L : List_Id) return Boolean is
2854 while Present (Stm) loop
2855 if Nkind (Stm) /= N_Null_Statement then
2863 end Is_All_Null_Statements;
2865 ----------------------------------
2866 -- Is_Library_Level_Tagged_Type --
2867 ----------------------------------
2869 function Is_Library_Level_Tagged_Type (Typ : Entity_Id) return Boolean is
2871 return Is_Tagged_Type (Typ)
2872 and then Is_Library_Level_Entity (Typ);
2873 end Is_Library_Level_Tagged_Type;
2875 ----------------------------------
2876 -- Is_Possibly_Unaligned_Object --
2877 ----------------------------------
2879 function Is_Possibly_Unaligned_Object (N : Node_Id) return Boolean is
2880 T : constant Entity_Id := Etype (N);
2883 -- If renamed object, apply test to underlying object
2885 if Is_Entity_Name (N)
2886 and then Is_Object (Entity (N))
2887 and then Present (Renamed_Object (Entity (N)))
2889 return Is_Possibly_Unaligned_Object (Renamed_Object (Entity (N)));
2892 -- Tagged and controlled types and aliased types are always aligned,
2893 -- as are concurrent types.
2896 or else Has_Controlled_Component (T)
2897 or else Is_Concurrent_Type (T)
2898 or else Is_Tagged_Type (T)
2899 or else Is_Controlled (T)
2904 -- If this is an element of a packed array, may be unaligned
2906 if Is_Ref_To_Bit_Packed_Array (N) then
2910 -- Case of component reference
2912 if Nkind (N) = N_Selected_Component then
2914 P : constant Node_Id := Prefix (N);
2915 C : constant Entity_Id := Entity (Selector_Name (N));
2920 -- If component reference is for an array with non-static bounds,
2921 -- then it is always aligned: we can only process unaligned
2922 -- arrays with static bounds (more accurately bounds known at
2925 if Is_Array_Type (T)
2926 and then not Compile_Time_Known_Bounds (T)
2931 -- If component is aliased, it is definitely properly aligned
2933 if Is_Aliased (C) then
2937 -- If component is for a type implemented as a scalar, and the
2938 -- record is packed, and the component is other than the first
2939 -- component of the record, then the component may be unaligned.
2941 if Is_Packed (Etype (P))
2942 and then Represented_As_Scalar (Etype (C))
2943 and then First_Entity (Scope (C)) /= C
2948 -- Compute maximum possible alignment for T
2950 -- If alignment is known, then that settles things
2952 if Known_Alignment (T) then
2953 M := UI_To_Int (Alignment (T));
2955 -- If alignment is not known, tentatively set max alignment
2958 M := Ttypes.Maximum_Alignment;
2960 -- We can reduce this if the Esize is known since the default
2961 -- alignment will never be more than the smallest power of 2
2962 -- that does not exceed this Esize value.
2964 if Known_Esize (T) then
2965 S := UI_To_Int (Esize (T));
2967 while (M / 2) >= S loop
2973 -- If the component reference is for a record that has a specified
2974 -- alignment, and we either know it is too small, or cannot tell,
2975 -- then the component may be unaligned
2977 if Known_Alignment (Etype (P))
2978 and then Alignment (Etype (P)) < Ttypes.Maximum_Alignment
2979 and then M > Alignment (Etype (P))
2984 -- Case of component clause present which may specify an
2985 -- unaligned position.
2987 if Present (Component_Clause (C)) then
2989 -- Otherwise we can do a test to make sure that the actual
2990 -- start position in the record, and the length, are both
2991 -- consistent with the required alignment. If not, we know
2992 -- that we are unaligned.
2995 Align_In_Bits : constant Nat := M * System_Storage_Unit;
2997 if Component_Bit_Offset (C) mod Align_In_Bits /= 0
2998 or else Esize (C) mod Align_In_Bits /= 0
3005 -- Otherwise, for a component reference, test prefix
3007 return Is_Possibly_Unaligned_Object (P);
3010 -- If not a component reference, must be aligned
3015 end Is_Possibly_Unaligned_Object;
3017 ---------------------------------
3018 -- Is_Possibly_Unaligned_Slice --
3019 ---------------------------------
3021 function Is_Possibly_Unaligned_Slice (N : Node_Id) return Boolean is
3023 -- Go to renamed object
3025 if Is_Entity_Name (N)
3026 and then Is_Object (Entity (N))
3027 and then Present (Renamed_Object (Entity (N)))
3029 return Is_Possibly_Unaligned_Slice (Renamed_Object (Entity (N)));
3032 -- The reference must be a slice
3034 if Nkind (N) /= N_Slice then
3038 -- Always assume the worst for a nested record component with a
3039 -- component clause, which gigi/gcc does not appear to handle well.
3040 -- It is not clear why this special test is needed at all ???
3042 if Nkind (Prefix (N)) = N_Selected_Component
3043 and then Nkind (Prefix (Prefix (N))) = N_Selected_Component
3045 Present (Component_Clause (Entity (Selector_Name (Prefix (N)))))
3050 -- We only need to worry if the target has strict alignment
3052 if not Target_Strict_Alignment then
3056 -- If it is a slice, then look at the array type being sliced
3059 Sarr : constant Node_Id := Prefix (N);
3060 -- Prefix of the slice, i.e. the array being sliced
3062 Styp : constant Entity_Id := Etype (Prefix (N));
3063 -- Type of the array being sliced
3069 -- The problems arise if the array object that is being sliced
3070 -- is a component of a record or array, and we cannot guarantee
3071 -- the alignment of the array within its containing object.
3073 -- To investigate this, we look at successive prefixes to see
3074 -- if we have a worrisome indexed or selected component.
3078 -- Case of array is part of an indexed component reference
3080 if Nkind (Pref) = N_Indexed_Component then
3081 Ptyp := Etype (Prefix (Pref));
3083 -- The only problematic case is when the array is packed,
3084 -- in which case we really know nothing about the alignment
3085 -- of individual components.
3087 if Is_Bit_Packed_Array (Ptyp) then
3091 -- Case of array is part of a selected component reference
3093 elsif Nkind (Pref) = N_Selected_Component then
3094 Ptyp := Etype (Prefix (Pref));
3096 -- We are definitely in trouble if the record in question
3097 -- has an alignment, and either we know this alignment is
3098 -- inconsistent with the alignment of the slice, or we
3099 -- don't know what the alignment of the slice should be.
3101 if Known_Alignment (Ptyp)
3102 and then (Unknown_Alignment (Styp)
3103 or else Alignment (Styp) > Alignment (Ptyp))
3108 -- We are in potential trouble if the record type is packed.
3109 -- We could special case when we know that the array is the
3110 -- first component, but that's not such a simple case ???
3112 if Is_Packed (Ptyp) then
3116 -- We are in trouble if there is a component clause, and
3117 -- either we do not know the alignment of the slice, or
3118 -- the alignment of the slice is inconsistent with the
3119 -- bit position specified by the component clause.
3122 Field : constant Entity_Id := Entity (Selector_Name (Pref));
3124 if Present (Component_Clause (Field))
3126 (Unknown_Alignment (Styp)
3128 (Component_Bit_Offset (Field) mod
3129 (System_Storage_Unit * Alignment (Styp))) /= 0)
3135 -- For cases other than selected or indexed components we
3136 -- know we are OK, since no issues arise over alignment.
3142 -- We processed an indexed component or selected component
3143 -- reference that looked safe, so keep checking prefixes.
3145 Pref := Prefix (Pref);
3148 end Is_Possibly_Unaligned_Slice;
3150 --------------------------------
3151 -- Is_Ref_To_Bit_Packed_Array --
3152 --------------------------------
3154 function Is_Ref_To_Bit_Packed_Array (N : Node_Id) return Boolean is
3159 if Is_Entity_Name (N)
3160 and then Is_Object (Entity (N))
3161 and then Present (Renamed_Object (Entity (N)))
3163 return Is_Ref_To_Bit_Packed_Array (Renamed_Object (Entity (N)));
3166 if Nkind (N) = N_Indexed_Component
3168 Nkind (N) = N_Selected_Component
3170 if Is_Bit_Packed_Array (Etype (Prefix (N))) then
3173 Result := Is_Ref_To_Bit_Packed_Array (Prefix (N));
3176 if Result and then Nkind (N) = N_Indexed_Component then
3177 Expr := First (Expressions (N));
3178 while Present (Expr) loop
3179 Force_Evaluation (Expr);
3189 end Is_Ref_To_Bit_Packed_Array;
3191 --------------------------------
3192 -- Is_Ref_To_Bit_Packed_Slice --
3193 --------------------------------
3195 function Is_Ref_To_Bit_Packed_Slice (N : Node_Id) return Boolean is
3197 if Nkind (N) = N_Type_Conversion then
3198 return Is_Ref_To_Bit_Packed_Slice (Expression (N));
3200 elsif Is_Entity_Name (N)
3201 and then Is_Object (Entity (N))
3202 and then Present (Renamed_Object (Entity (N)))
3204 return Is_Ref_To_Bit_Packed_Slice (Renamed_Object (Entity (N)));
3206 elsif Nkind (N) = N_Slice
3207 and then Is_Bit_Packed_Array (Etype (Prefix (N)))
3211 elsif Nkind (N) = N_Indexed_Component
3213 Nkind (N) = N_Selected_Component
3215 return Is_Ref_To_Bit_Packed_Slice (Prefix (N));
3220 end Is_Ref_To_Bit_Packed_Slice;
3222 -----------------------
3223 -- Is_Renamed_Object --
3224 -----------------------
3226 function Is_Renamed_Object (N : Node_Id) return Boolean is
3227 Pnod : constant Node_Id := Parent (N);
3228 Kind : constant Node_Kind := Nkind (Pnod);
3231 if Kind = N_Object_Renaming_Declaration then
3234 elsif Kind = N_Indexed_Component
3235 or else Kind = N_Selected_Component
3237 return Is_Renamed_Object (Pnod);
3242 end Is_Renamed_Object;
3244 ----------------------------
3245 -- Is_Untagged_Derivation --
3246 ----------------------------
3248 function Is_Untagged_Derivation (T : Entity_Id) return Boolean is
3250 return (not Is_Tagged_Type (T) and then Is_Derived_Type (T))
3252 (Is_Private_Type (T) and then Present (Full_View (T))
3253 and then not Is_Tagged_Type (Full_View (T))
3254 and then Is_Derived_Type (Full_View (T))
3255 and then Etype (Full_View (T)) /= T);
3256 end Is_Untagged_Derivation;
3258 ---------------------------
3259 -- Is_Volatile_Reference --
3260 ---------------------------
3262 function Is_Volatile_Reference (N : Node_Id) return Boolean is
3264 if Nkind (N) in N_Has_Etype
3265 and then Present (Etype (N))
3266 and then Treat_As_Volatile (Etype (N))
3270 elsif Is_Entity_Name (N) then
3271 return Treat_As_Volatile (Entity (N));
3273 elsif Nkind (N) = N_Slice then
3274 return Is_Volatile_Reference (Prefix (N));
3276 elsif Nkind_In (N, N_Indexed_Component, N_Selected_Component) then
3277 if (Is_Entity_Name (Prefix (N))
3278 and then Has_Volatile_Components (Entity (Prefix (N))))
3279 or else (Present (Etype (Prefix (N)))
3280 and then Has_Volatile_Components (Etype (Prefix (N))))
3284 return Is_Volatile_Reference (Prefix (N));
3290 end Is_Volatile_Reference;
3292 --------------------
3293 -- Kill_Dead_Code --
3294 --------------------
3296 procedure Kill_Dead_Code (N : Node_Id; Warn : Boolean := False) is
3299 Remove_Warning_Messages (N);
3303 ("?this code can never be executed and has been deleted!", N);
3306 -- Recurse into block statements and bodies to process declarations
3309 if Nkind (N) = N_Block_Statement
3310 or else Nkind (N) = N_Subprogram_Body
3311 or else Nkind (N) = N_Package_Body
3313 Kill_Dead_Code (Declarations (N), False);
3314 Kill_Dead_Code (Statements (Handled_Statement_Sequence (N)));
3316 if Nkind (N) = N_Subprogram_Body then
3317 Set_Is_Eliminated (Defining_Entity (N));
3320 elsif Nkind (N) = N_Package_Declaration then
3321 Kill_Dead_Code (Visible_Declarations (Specification (N)));
3322 Kill_Dead_Code (Private_Declarations (Specification (N)));
3324 -- ??? After this point, Delete_Tree has been called on all
3325 -- declarations in Specification (N), so references to
3326 -- entities therein look suspicious.
3329 E : Entity_Id := First_Entity (Defining_Entity (N));
3331 while Present (E) loop
3332 if Ekind (E) = E_Operator then
3333 Set_Is_Eliminated (E);
3340 -- Recurse into composite statement to kill individual statements,
3341 -- in particular instantiations.
3343 elsif Nkind (N) = N_If_Statement then
3344 Kill_Dead_Code (Then_Statements (N));
3345 Kill_Dead_Code (Elsif_Parts (N));
3346 Kill_Dead_Code (Else_Statements (N));
3348 elsif Nkind (N) = N_Loop_Statement then
3349 Kill_Dead_Code (Statements (N));
3351 elsif Nkind (N) = N_Case_Statement then
3355 Alt := First (Alternatives (N));
3356 while Present (Alt) loop
3357 Kill_Dead_Code (Statements (Alt));
3362 elsif Nkind (N) = N_Case_Statement_Alternative then
3363 Kill_Dead_Code (Statements (N));
3365 -- Deal with dead instances caused by deleting instantiations
3367 elsif Nkind (N) in N_Generic_Instantiation then
3368 Remove_Dead_Instance (N);
3373 -- Case where argument is a list of nodes to be killed
3375 procedure Kill_Dead_Code (L : List_Id; Warn : Boolean := False) is
3380 if Is_Non_Empty_List (L) then
3382 while Present (N) loop
3383 Kill_Dead_Code (N, W);
3390 ------------------------
3391 -- Known_Non_Negative --
3392 ------------------------
3394 function Known_Non_Negative (Opnd : Node_Id) return Boolean is
3396 if Is_OK_Static_Expression (Opnd)
3397 and then Expr_Value (Opnd) >= 0
3403 Lo : constant Node_Id := Type_Low_Bound (Etype (Opnd));
3407 Is_OK_Static_Expression (Lo) and then Expr_Value (Lo) >= 0;
3410 end Known_Non_Negative;
3412 --------------------
3413 -- Known_Non_Null --
3414 --------------------
3416 function Known_Non_Null (N : Node_Id) return Boolean is
3418 -- Checks for case where N is an entity reference
3420 if Is_Entity_Name (N) and then Present (Entity (N)) then
3422 E : constant Entity_Id := Entity (N);
3427 -- First check if we are in decisive conditional
3429 Get_Current_Value_Condition (N, Op, Val);
3431 if Known_Null (Val) then
3432 if Op = N_Op_Eq then
3434 elsif Op = N_Op_Ne then
3439 -- If OK to do replacement, test Is_Known_Non_Null flag
3441 if OK_To_Do_Constant_Replacement (E) then
3442 return Is_Known_Non_Null (E);
3444 -- Otherwise if not safe to do replacement, then say so
3451 -- True if access attribute
3453 elsif Nkind (N) = N_Attribute_Reference
3454 and then (Attribute_Name (N) = Name_Access
3456 Attribute_Name (N) = Name_Unchecked_Access
3458 Attribute_Name (N) = Name_Unrestricted_Access)
3462 -- True if allocator
3464 elsif Nkind (N) = N_Allocator then
3467 -- For a conversion, true if expression is known non-null
3469 elsif Nkind (N) = N_Type_Conversion then
3470 return Known_Non_Null (Expression (N));
3472 -- Above are all cases where the value could be determined to be
3473 -- non-null. In all other cases, we don't know, so return False.
3484 function Known_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 -- Constant null value is for sure null
3497 if Ekind (E) = E_Constant
3498 and then Known_Null (Constant_Value (E))
3503 -- First check if we are in decisive conditional
3505 Get_Current_Value_Condition (N, Op, Val);
3507 if Known_Null (Val) then
3508 if Op = N_Op_Eq then
3510 elsif Op = N_Op_Ne then
3515 -- If OK to do replacement, test Is_Known_Null flag
3517 if OK_To_Do_Constant_Replacement (E) then
3518 return Is_Known_Null (E);
3520 -- Otherwise if not safe to do replacement, then say so
3527 -- True if explicit reference to null
3529 elsif Nkind (N) = N_Null then
3532 -- For a conversion, true if expression is known null
3534 elsif Nkind (N) = N_Type_Conversion then
3535 return Known_Null (Expression (N));
3537 -- Above are all cases where the value could be determined to be null.
3538 -- In all other cases, we don't know, so return False.
3545 -----------------------------
3546 -- Make_CW_Equivalent_Type --
3547 -----------------------------
3549 -- Create a record type used as an equivalent of any member
3550 -- of the class which takes its size from exp.
3552 -- Generate the following code:
3554 -- type Equiv_T is record
3555 -- _parent : T (List of discriminant constraints taken from Exp);
3556 -- Ext__50 : Storage_Array (1 .. (Exp'size - Typ'object_size)/8);
3559 -- ??? Note that this type does not guarantee same alignment as all
3562 function Make_CW_Equivalent_Type
3564 E : Node_Id) return Entity_Id
3566 Loc : constant Source_Ptr := Sloc (E);
3567 Root_Typ : constant Entity_Id := Root_Type (T);
3568 List_Def : constant List_Id := Empty_List;
3569 Comp_List : constant List_Id := New_List;
3570 Equiv_Type : Entity_Id;
3571 Range_Type : Entity_Id;
3572 Str_Type : Entity_Id;
3573 Constr_Root : Entity_Id;
3577 if not Has_Discriminants (Root_Typ) then
3578 Constr_Root := Root_Typ;
3581 Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
3583 -- subtype cstr__n is T (List of discr constraints taken from Exp)
3585 Append_To (List_Def,
3586 Make_Subtype_Declaration (Loc,
3587 Defining_Identifier => Constr_Root,
3588 Subtype_Indication =>
3589 Make_Subtype_From_Expr (E, Root_Typ)));
3592 -- Generate the range subtype declaration
3594 Range_Type := Make_Defining_Identifier (Loc, New_Internal_Name ('G'));
3596 if not Is_Interface (Root_Typ) then
3597 -- subtype rg__xx is
3598 -- Storage_Offset range 1 .. (Expr'size - typ'size) / Storage_Unit
3601 Make_Op_Subtract (Loc,
3603 Make_Attribute_Reference (Loc,
3605 OK_Convert_To (T, Duplicate_Subexpr_No_Checks (E)),
3606 Attribute_Name => Name_Size),
3608 Make_Attribute_Reference (Loc,
3609 Prefix => New_Reference_To (Constr_Root, Loc),
3610 Attribute_Name => Name_Object_Size));
3612 -- subtype rg__xx is
3613 -- Storage_Offset range 1 .. Expr'size / Storage_Unit
3616 Make_Attribute_Reference (Loc,
3618 OK_Convert_To (T, Duplicate_Subexpr_No_Checks (E)),
3619 Attribute_Name => Name_Size);
3622 Set_Paren_Count (Sizexpr, 1);
3624 Append_To (List_Def,
3625 Make_Subtype_Declaration (Loc,
3626 Defining_Identifier => Range_Type,
3627 Subtype_Indication =>
3628 Make_Subtype_Indication (Loc,
3629 Subtype_Mark => New_Reference_To (RTE (RE_Storage_Offset), Loc),
3630 Constraint => Make_Range_Constraint (Loc,
3633 Low_Bound => Make_Integer_Literal (Loc, 1),
3635 Make_Op_Divide (Loc,
3636 Left_Opnd => Sizexpr,
3637 Right_Opnd => Make_Integer_Literal (Loc,
3638 Intval => System_Storage_Unit)))))));
3640 -- subtype str__nn is Storage_Array (rg__x);
3642 Str_Type := Make_Defining_Identifier (Loc, New_Internal_Name ('S'));
3643 Append_To (List_Def,
3644 Make_Subtype_Declaration (Loc,
3645 Defining_Identifier => Str_Type,
3646 Subtype_Indication =>
3647 Make_Subtype_Indication (Loc,
3648 Subtype_Mark => New_Reference_To (RTE (RE_Storage_Array), Loc),
3650 Make_Index_Or_Discriminant_Constraint (Loc,
3652 New_List (New_Reference_To (Range_Type, Loc))))));
3654 -- type Equiv_T is record
3655 -- [ _parent : Tnn; ]
3659 Equiv_Type := Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
3661 -- When the target requires front-end layout, it's necessary to allow
3662 -- the equivalent type to be frozen so that layout can occur (when the
3663 -- associated class-wide subtype is frozen, the equivalent type will
3664 -- be frozen, see freeze.adb). For other targets, Gigi wants to have
3665 -- the equivalent type marked as frozen and deals with this type itself.
3666 -- In the Gigi case this will also avoid the generation of an init
3667 -- procedure for the type.
3669 if not Frontend_Layout_On_Target then
3670 Set_Is_Frozen (Equiv_Type);
3673 Set_Ekind (Equiv_Type, E_Record_Type);
3674 Set_Parent_Subtype (Equiv_Type, Constr_Root);
3676 if not Is_Interface (Root_Typ) then
3677 Append_To (Comp_List,
3678 Make_Component_Declaration (Loc,
3679 Defining_Identifier =>
3680 Make_Defining_Identifier (Loc, Name_uParent),
3681 Component_Definition =>
3682 Make_Component_Definition (Loc,
3683 Aliased_Present => False,
3684 Subtype_Indication => New_Reference_To (Constr_Root, Loc))));
3687 Append_To (Comp_List,
3688 Make_Component_Declaration (Loc,
3689 Defining_Identifier =>
3690 Make_Defining_Identifier (Loc,
3691 Chars => New_Internal_Name ('C')),
3692 Component_Definition =>
3693 Make_Component_Definition (Loc,
3694 Aliased_Present => False,
3695 Subtype_Indication => New_Reference_To (Str_Type, Loc))));
3697 Append_To (List_Def,
3698 Make_Full_Type_Declaration (Loc,
3699 Defining_Identifier => Equiv_Type,
3701 Make_Record_Definition (Loc,
3703 Make_Component_List (Loc,
3704 Component_Items => Comp_List,
3705 Variant_Part => Empty))));
3707 -- Suppress all checks during the analysis of the expanded code
3708 -- to avoid the generation of spurious warnings under ZFP run-time.
3710 Insert_Actions (E, List_Def, Suppress => All_Checks);
3712 end Make_CW_Equivalent_Type;
3714 ------------------------
3715 -- Make_Literal_Range --
3716 ------------------------
3718 function Make_Literal_Range
3720 Literal_Typ : Entity_Id) return Node_Id
3722 Lo : constant Node_Id :=
3723 New_Copy_Tree (String_Literal_Low_Bound (Literal_Typ));
3724 Index : constant Entity_Id := Etype (Lo);
3727 Length_Expr : constant Node_Id :=
3728 Make_Op_Subtract (Loc,
3730 Make_Integer_Literal (Loc,
3731 Intval => String_Literal_Length (Literal_Typ)),
3733 Make_Integer_Literal (Loc, 1));
3736 Set_Analyzed (Lo, False);
3738 if Is_Integer_Type (Index) then
3741 Left_Opnd => New_Copy_Tree (Lo),
3742 Right_Opnd => Length_Expr);
3745 Make_Attribute_Reference (Loc,
3746 Attribute_Name => Name_Val,
3747 Prefix => New_Occurrence_Of (Index, Loc),
3748 Expressions => New_List (
3751 Make_Attribute_Reference (Loc,
3752 Attribute_Name => Name_Pos,
3753 Prefix => New_Occurrence_Of (Index, Loc),
3754 Expressions => New_List (New_Copy_Tree (Lo))),
3755 Right_Opnd => Length_Expr)));
3762 end Make_Literal_Range;
3764 --------------------------
3765 -- Make_Non_Empty_Check --
3766 --------------------------
3768 function Make_Non_Empty_Check
3770 N : Node_Id) return Node_Id
3776 Make_Attribute_Reference (Loc,
3777 Attribute_Name => Name_Length,
3778 Prefix => Duplicate_Subexpr_No_Checks (N, Name_Req => True)),
3780 Make_Integer_Literal (Loc, 0));
3781 end Make_Non_Empty_Check;
3783 ----------------------------
3784 -- Make_Subtype_From_Expr --
3785 ----------------------------
3787 -- 1. If Expr is an unconstrained array expression, creates
3788 -- Unc_Type(Expr'first(1)..Expr'last(1),..., Expr'first(n)..Expr'last(n))
3790 -- 2. If Expr is a unconstrained discriminated type expression, creates
3791 -- Unc_Type(Expr.Discr1, ... , Expr.Discr_n)
3793 -- 3. If Expr is class-wide, creates an implicit class wide subtype
3795 function Make_Subtype_From_Expr
3797 Unc_Typ : Entity_Id) return Node_Id
3799 Loc : constant Source_Ptr := Sloc (E);
3800 List_Constr : constant List_Id := New_List;
3803 Full_Subtyp : Entity_Id;
3804 Priv_Subtyp : Entity_Id;
3809 if Is_Private_Type (Unc_Typ)
3810 and then Has_Unknown_Discriminants (Unc_Typ)
3812 -- Prepare the subtype completion, Go to base type to
3813 -- find underlying type, because the type may be a generic
3814 -- actual or an explicit subtype.
3816 Utyp := Underlying_Type (Base_Type (Unc_Typ));
3817 Full_Subtyp := Make_Defining_Identifier (Loc,
3818 New_Internal_Name ('C'));
3820 Unchecked_Convert_To
3821 (Utyp, Duplicate_Subexpr_No_Checks (E));
3822 Set_Parent (Full_Exp, Parent (E));
3825 Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
3828 Make_Subtype_Declaration (Loc,
3829 Defining_Identifier => Full_Subtyp,
3830 Subtype_Indication => Make_Subtype_From_Expr (Full_Exp, Utyp)));
3832 -- Define the dummy private subtype
3834 Set_Ekind (Priv_Subtyp, Subtype_Kind (Ekind (Unc_Typ)));
3835 Set_Etype (Priv_Subtyp, Base_Type (Unc_Typ));
3836 Set_Scope (Priv_Subtyp, Full_Subtyp);
3837 Set_Is_Constrained (Priv_Subtyp);
3838 Set_Is_Tagged_Type (Priv_Subtyp, Is_Tagged_Type (Unc_Typ));
3839 Set_Is_Itype (Priv_Subtyp);
3840 Set_Associated_Node_For_Itype (Priv_Subtyp, E);
3842 if Is_Tagged_Type (Priv_Subtyp) then
3844 (Base_Type (Priv_Subtyp), Class_Wide_Type (Unc_Typ));
3845 Set_Primitive_Operations (Priv_Subtyp,
3846 Primitive_Operations (Unc_Typ));
3849 Set_Full_View (Priv_Subtyp, Full_Subtyp);
3851 return New_Reference_To (Priv_Subtyp, Loc);
3853 elsif Is_Array_Type (Unc_Typ) then
3854 for J in 1 .. Number_Dimensions (Unc_Typ) loop
3855 Append_To (List_Constr,
3858 Make_Attribute_Reference (Loc,
3859 Prefix => Duplicate_Subexpr_No_Checks (E),
3860 Attribute_Name => Name_First,
3861 Expressions => New_List (
3862 Make_Integer_Literal (Loc, J))),
3865 Make_Attribute_Reference (Loc,
3866 Prefix => Duplicate_Subexpr_No_Checks (E),
3867 Attribute_Name => Name_Last,
3868 Expressions => New_List (
3869 Make_Integer_Literal (Loc, J)))));
3872 elsif Is_Class_Wide_Type (Unc_Typ) then
3874 CW_Subtype : Entity_Id;
3875 EQ_Typ : Entity_Id := Empty;
3878 -- A class-wide equivalent type is not needed when VM_Target
3879 -- because the VM back-ends handle the class-wide object
3880 -- initialization itself (and doesn't need or want the
3881 -- additional intermediate type to handle the assignment).
3883 if Expander_Active and then Tagged_Type_Expansion then
3884 EQ_Typ := Make_CW_Equivalent_Type (Unc_Typ, E);
3887 CW_Subtype := New_Class_Wide_Subtype (Unc_Typ, E);
3888 Set_Equivalent_Type (CW_Subtype, EQ_Typ);
3890 if Present (EQ_Typ) then
3891 Set_Is_Class_Wide_Equivalent_Type (EQ_Typ);
3894 Set_Cloned_Subtype (CW_Subtype, Base_Type (Unc_Typ));
3896 return New_Occurrence_Of (CW_Subtype, Loc);
3899 -- Indefinite record type with discriminants
3902 D := First_Discriminant (Unc_Typ);
3903 while Present (D) loop
3904 Append_To (List_Constr,
3905 Make_Selected_Component (Loc,
3906 Prefix => Duplicate_Subexpr_No_Checks (E),
3907 Selector_Name => New_Reference_To (D, Loc)));
3909 Next_Discriminant (D);
3914 Make_Subtype_Indication (Loc,
3915 Subtype_Mark => New_Reference_To (Unc_Typ, Loc),
3917 Make_Index_Or_Discriminant_Constraint (Loc,
3918 Constraints => List_Constr));
3919 end Make_Subtype_From_Expr;
3921 -----------------------------
3922 -- May_Generate_Large_Temp --
3923 -----------------------------
3925 -- At the current time, the only types that we return False for (i.e.
3926 -- where we decide we know they cannot generate large temps) are ones
3927 -- where we know the size is 256 bits or less at compile time, and we
3928 -- are still not doing a thorough job on arrays and records ???
3930 function May_Generate_Large_Temp (Typ : Entity_Id) return Boolean is
3932 if not Size_Known_At_Compile_Time (Typ) then
3935 elsif Esize (Typ) /= 0 and then Esize (Typ) <= 256 then
3938 elsif Is_Array_Type (Typ)
3939 and then Present (Packed_Array_Type (Typ))
3941 return May_Generate_Large_Temp (Packed_Array_Type (Typ));
3943 -- We could do more here to find other small types ???
3948 end May_Generate_Large_Temp;
3950 ----------------------------
3951 -- New_Class_Wide_Subtype --
3952 ----------------------------
3954 function New_Class_Wide_Subtype
3955 (CW_Typ : Entity_Id;
3956 N : Node_Id) return Entity_Id
3958 Res : constant Entity_Id := Create_Itype (E_Void, N);
3959 Res_Name : constant Name_Id := Chars (Res);
3960 Res_Scope : constant Entity_Id := Scope (Res);
3963 Copy_Node (CW_Typ, Res);
3964 Set_Comes_From_Source (Res, False);
3965 Set_Sloc (Res, Sloc (N));
3967 Set_Associated_Node_For_Itype (Res, N);
3968 Set_Is_Public (Res, False); -- By default, may be changed below.
3969 Set_Public_Status (Res);
3970 Set_Chars (Res, Res_Name);
3971 Set_Scope (Res, Res_Scope);
3972 Set_Ekind (Res, E_Class_Wide_Subtype);
3973 Set_Next_Entity (Res, Empty);
3974 Set_Etype (Res, Base_Type (CW_Typ));
3976 -- For targets where front-end layout is required, reset the Is_Frozen
3977 -- status of the subtype to False (it can be implicitly set to true
3978 -- from the copy of the class-wide type). For other targets, Gigi
3979 -- doesn't want the class-wide subtype to go through the freezing
3980 -- process (though it's unclear why that causes problems and it would
3981 -- be nice to allow freezing to occur normally for all targets ???).
3983 if Frontend_Layout_On_Target then
3984 Set_Is_Frozen (Res, False);
3987 Set_Freeze_Node (Res, Empty);
3989 end New_Class_Wide_Subtype;
3991 --------------------------------
3992 -- Non_Limited_Designated_Type --
3993 ---------------------------------
3995 function Non_Limited_Designated_Type (T : Entity_Id) return Entity_Id is
3996 Desig : constant Entity_Id := Designated_Type (T);
3998 if Ekind (Desig) = E_Incomplete_Type
3999 and then Present (Non_Limited_View (Desig))
4001 return Non_Limited_View (Desig);
4005 end Non_Limited_Designated_Type;
4007 -----------------------------------
4008 -- OK_To_Do_Constant_Replacement --
4009 -----------------------------------
4011 function OK_To_Do_Constant_Replacement (E : Entity_Id) return Boolean is
4012 ES : constant Entity_Id := Scope (E);
4016 -- Do not replace statically allocated objects, because they may be
4017 -- modified outside the current scope.
4019 if Is_Statically_Allocated (E) then
4022 -- Do not replace aliased or volatile objects, since we don't know what
4023 -- else might change the value.
4025 elsif Is_Aliased (E) or else Treat_As_Volatile (E) then
4028 -- Debug flag -gnatdM disconnects this optimization
4030 elsif Debug_Flag_MM then
4033 -- Otherwise check scopes
4036 CS := Current_Scope;
4039 -- If we are in right scope, replacement is safe
4044 -- Packages do not affect the determination of safety
4046 elsif Ekind (CS) = E_Package then
4047 exit when CS = Standard_Standard;
4050 -- Blocks do not affect the determination of safety
4052 elsif Ekind (CS) = E_Block then
4055 -- Loops do not affect the determination of safety. Note that we
4056 -- kill all current values on entry to a loop, so we are just
4057 -- talking about processing within a loop here.
4059 elsif Ekind (CS) = E_Loop then
4062 -- Otherwise, the reference is dubious, and we cannot be sure that
4063 -- it is safe to do the replacement.
4072 end OK_To_Do_Constant_Replacement;
4074 ------------------------------------
4075 -- Possible_Bit_Aligned_Component --
4076 ------------------------------------
4078 function Possible_Bit_Aligned_Component (N : Node_Id) return Boolean is
4082 -- Case of indexed component
4084 when N_Indexed_Component =>
4086 P : constant Node_Id := Prefix (N);
4087 Ptyp : constant Entity_Id := Etype (P);
4090 -- If we know the component size and it is less than 64, then
4091 -- we are definitely OK. The back end always does assignment of
4092 -- misaligned small objects correctly.
4094 if Known_Static_Component_Size (Ptyp)
4095 and then Component_Size (Ptyp) <= 64
4099 -- Otherwise, we need to test the prefix, to see if we are
4100 -- indexing from a possibly unaligned component.
4103 return Possible_Bit_Aligned_Component (P);
4107 -- Case of selected component
4109 when N_Selected_Component =>
4111 P : constant Node_Id := Prefix (N);
4112 Comp : constant Entity_Id := Entity (Selector_Name (N));
4115 -- If there is no component clause, then we are in the clear
4116 -- since the back end will never misalign a large component
4117 -- unless it is forced to do so. In the clear means we need
4118 -- only the recursive test on the prefix.
4120 if Component_May_Be_Bit_Aligned (Comp) then
4123 return Possible_Bit_Aligned_Component (P);
4127 -- For a slice, test the prefix, if that is possibly misaligned,
4128 -- then for sure the slice is!
4131 return Possible_Bit_Aligned_Component (Prefix (N));
4133 -- If we have none of the above, it means that we have fallen off the
4134 -- top testing prefixes recursively, and we now have a stand alone
4135 -- object, where we don't have a problem.
4141 end Possible_Bit_Aligned_Component;
4143 -------------------------
4144 -- Remove_Side_Effects --
4145 -------------------------
4147 procedure Remove_Side_Effects
4149 Name_Req : Boolean := False;
4150 Variable_Ref : Boolean := False)
4152 Loc : constant Source_Ptr := Sloc (Exp);
4153 Exp_Type : constant Entity_Id := Etype (Exp);
4154 Svg_Suppress : constant Suppress_Array := Scope_Suppress;
4156 Ref_Type : Entity_Id;
4158 Ptr_Typ_Decl : Node_Id;
4162 function Side_Effect_Free (N : Node_Id) return Boolean;
4163 -- Determines if the tree N represents an expression that is known not
4164 -- to have side effects, and for which no processing is required.
4166 function Side_Effect_Free (L : List_Id) return Boolean;
4167 -- Determines if all elements of the list L are side effect free
4169 function Safe_Prefixed_Reference (N : Node_Id) return Boolean;
4170 -- The argument N is a construct where the Prefix is dereferenced if it
4171 -- is an access type and the result is a variable. The call returns True
4172 -- if the construct is side effect free (not considering side effects in
4173 -- other than the prefix which are to be tested by the caller).
4175 function Within_In_Parameter (N : Node_Id) return Boolean;
4176 -- Determines if N is a subcomponent of a composite in-parameter. If so,
4177 -- N is not side-effect free when the actual is global and modifiable
4178 -- indirectly from within a subprogram, because it may be passed by
4179 -- reference. The front-end must be conservative here and assume that
4180 -- this may happen with any array or record type. On the other hand, we
4181 -- cannot create temporaries for all expressions for which this
4182 -- condition is true, for various reasons that might require clearing up
4183 -- ??? For example, discriminant references that appear out of place, or
4184 -- spurious type errors with class-wide expressions. As a result, we
4185 -- limit the transformation to loop bounds, which is so far the only
4186 -- case that requires it.
4188 -----------------------------
4189 -- Safe_Prefixed_Reference --
4190 -----------------------------
4192 function Safe_Prefixed_Reference (N : Node_Id) return Boolean is
4194 -- If prefix is not side effect free, definitely not safe
4196 if not Side_Effect_Free (Prefix (N)) then
4199 -- If the prefix is of an access type that is not access-to-constant,
4200 -- then this construct is a variable reference, which means it is to
4201 -- be considered to have side effects if Variable_Ref is set True
4202 -- Exception is an access to an entity that is a constant or an
4203 -- in-parameter which does not come from source, and is the result
4204 -- of a previous removal of side-effects.
4206 elsif Is_Access_Type (Etype (Prefix (N)))
4207 and then not Is_Access_Constant (Etype (Prefix (N)))
4208 and then Variable_Ref
4210 if not Is_Entity_Name (Prefix (N)) then
4213 return Ekind (Entity (Prefix (N))) = E_Constant
4214 or else Ekind (Entity (Prefix (N))) = E_In_Parameter;
4217 -- The following test is the simplest way of solving a complex
4218 -- problem uncovered by BB08-010: Side effect on loop bound that
4219 -- is a subcomponent of a global variable:
4220 -- If a loop bound is a subcomponent of a global variable, a
4221 -- modification of that variable within the loop may incorrectly
4222 -- affect the execution of the loop.
4225 (Nkind (Parent (Parent (N))) /= N_Loop_Parameter_Specification
4226 or else not Within_In_Parameter (Prefix (N)))
4230 -- All other cases are side effect free
4235 end Safe_Prefixed_Reference;
4237 ----------------------
4238 -- Side_Effect_Free --
4239 ----------------------
4241 function Side_Effect_Free (N : Node_Id) return Boolean is
4243 -- Note on checks that could raise Constraint_Error. Strictly, if
4244 -- we take advantage of 11.6, these checks do not count as side
4245 -- effects. However, we would just as soon consider that they are
4246 -- side effects, since the backend CSE does not work very well on
4247 -- expressions which can raise Constraint_Error. On the other
4248 -- hand, if we do not consider them to be side effect free, then
4249 -- we get some awkward expansions in -gnato mode, resulting in
4250 -- code insertions at a point where we do not have a clear model
4251 -- for performing the insertions.
4253 -- Special handling for entity names
4255 if Is_Entity_Name (N) then
4257 -- If the entity is a constant, it is definitely side effect
4258 -- free. Note that the test of Is_Variable (N) below might
4259 -- be expected to catch this case, but it does not, because
4260 -- this test goes to the original tree, and we may have
4261 -- already rewritten a variable node with a constant as
4262 -- a result of an earlier Force_Evaluation call.
4264 if Ekind (Entity (N)) = E_Constant
4265 or else Ekind (Entity (N)) = E_In_Parameter
4269 -- Functions are not side effect free
4271 elsif Ekind (Entity (N)) = E_Function then
4274 -- Variables are considered to be a side effect if Variable_Ref
4275 -- is set or if we have a volatile reference and Name_Req is off.
4276 -- If Name_Req is True then we can't help returning a name which
4277 -- effectively allows multiple references in any case.
4279 elsif Is_Variable (N) then
4280 return not Variable_Ref
4281 and then (not Is_Volatile_Reference (N) or else Name_Req);
4283 -- Any other entity (e.g. a subtype name) is definitely side
4290 -- A value known at compile time is always side effect free
4292 elsif Compile_Time_Known_Value (N) then
4295 -- A variable renaming is not side-effect free, because the
4296 -- renaming will function like a macro in the front-end in
4297 -- some cases, and an assignment can modify the component
4298 -- designated by N, so we need to create a temporary for it.
4300 elsif Is_Entity_Name (Original_Node (N))
4301 and then Is_Renaming_Of_Object (Entity (Original_Node (N)))
4302 and then Ekind (Entity (Original_Node (N))) /= E_Constant
4307 -- For other than entity names and compile time known values,
4308 -- check the node kind for special processing.
4312 -- An attribute reference is side effect free if its expressions
4313 -- are side effect free and its prefix is side effect free or
4314 -- is an entity reference.
4316 -- Is this right? what about x'first where x is a variable???
4318 when N_Attribute_Reference =>
4319 return Side_Effect_Free (Expressions (N))
4320 and then Attribute_Name (N) /= Name_Input
4321 and then (Is_Entity_Name (Prefix (N))
4322 or else Side_Effect_Free (Prefix (N)));
4324 -- A binary operator is side effect free if and both operands
4325 -- are side effect free. For this purpose binary operators
4326 -- include membership tests and short circuit forms
4332 return Side_Effect_Free (Left_Opnd (N))
4333 and then Side_Effect_Free (Right_Opnd (N));
4335 -- An explicit dereference is side effect free only if it is
4336 -- a side effect free prefixed reference.
4338 when N_Explicit_Dereference =>
4339 return Safe_Prefixed_Reference (N);
4341 -- A call to _rep_to_pos is side effect free, since we generate
4342 -- this pure function call ourselves. Moreover it is critically
4343 -- important to make this exception, since otherwise we can
4344 -- have discriminants in array components which don't look
4345 -- side effect free in the case of an array whose index type
4346 -- is an enumeration type with an enumeration rep clause.
4348 -- All other function calls are not side effect free
4350 when N_Function_Call =>
4351 return Nkind (Name (N)) = N_Identifier
4352 and then Is_TSS (Name (N), TSS_Rep_To_Pos)
4354 Side_Effect_Free (First (Parameter_Associations (N)));
4356 -- An indexed component is side effect free if it is a side
4357 -- effect free prefixed reference and all the indexing
4358 -- expressions are side effect free.
4360 when N_Indexed_Component =>
4361 return Side_Effect_Free (Expressions (N))
4362 and then Safe_Prefixed_Reference (N);
4364 -- A type qualification is side effect free if the expression
4365 -- is side effect free.
4367 when N_Qualified_Expression =>
4368 return Side_Effect_Free (Expression (N));
4370 -- A selected component is side effect free only if it is a
4371 -- side effect free prefixed reference. If it designates a
4372 -- component with a rep. clause it must be treated has having
4373 -- a potential side effect, because it may be modified through
4374 -- a renaming, and a subsequent use of the renaming as a macro
4375 -- will yield the wrong value. This complex interaction between
4376 -- renaming and removing side effects is a reminder that the
4377 -- latter has become a headache to maintain, and that it should
4378 -- be removed in favor of the gcc mechanism to capture values ???
4380 when N_Selected_Component =>
4381 if Nkind (Parent (N)) = N_Explicit_Dereference
4382 and then Has_Non_Standard_Rep (Designated_Type (Etype (N)))
4386 return Safe_Prefixed_Reference (N);
4389 -- A range is side effect free if the bounds are side effect free
4392 return Side_Effect_Free (Low_Bound (N))
4393 and then Side_Effect_Free (High_Bound (N));
4395 -- A slice is side effect free if it is a side effect free
4396 -- prefixed reference and the bounds are side effect free.
4399 return Side_Effect_Free (Discrete_Range (N))
4400 and then Safe_Prefixed_Reference (N);
4402 -- A type conversion is side effect free if the expression to be
4403 -- converted is side effect free.
4405 when N_Type_Conversion =>
4406 return Side_Effect_Free (Expression (N));
4408 -- A unary operator is side effect free if the operand
4409 -- is side effect free.
4412 return Side_Effect_Free (Right_Opnd (N));
4414 -- An unchecked type conversion is side effect free only if it
4415 -- is safe and its argument is side effect free.
4417 when N_Unchecked_Type_Conversion =>
4418 return Safe_Unchecked_Type_Conversion (N)
4419 and then Side_Effect_Free (Expression (N));
4421 -- An unchecked expression is side effect free if its expression
4422 -- is side effect free.
4424 when N_Unchecked_Expression =>
4425 return Side_Effect_Free (Expression (N));
4427 -- A literal is side effect free
4429 when N_Character_Literal |
4435 -- We consider that anything else has side effects. This is a bit
4436 -- crude, but we are pretty close for most common cases, and we
4437 -- are certainly correct (i.e. we never return True when the
4438 -- answer should be False).
4443 end Side_Effect_Free;
4445 -- A list is side effect free if all elements of the list are
4446 -- side effect free.
4448 function Side_Effect_Free (L : List_Id) return Boolean is
4452 if L = No_List or else L = Error_List then
4457 while Present (N) loop
4458 if not Side_Effect_Free (N) then
4467 end Side_Effect_Free;
4469 -------------------------
4470 -- Within_In_Parameter --
4471 -------------------------
4473 function Within_In_Parameter (N : Node_Id) return Boolean is
4475 if not Comes_From_Source (N) then
4478 elsif Is_Entity_Name (N) then
4479 return Ekind (Entity (N)) = E_In_Parameter;
4481 elsif Nkind (N) = N_Indexed_Component
4482 or else Nkind (N) = N_Selected_Component
4484 return Within_In_Parameter (Prefix (N));
4489 end Within_In_Parameter;
4491 -- Start of processing for Remove_Side_Effects
4494 -- If we are side effect free already or expansion is disabled,
4495 -- there is nothing to do.
4497 if Side_Effect_Free (Exp) or else not Expander_Active then
4501 -- All this must not have any checks
4503 Scope_Suppress := (others => True);
4505 -- If it is a scalar type and we need to capture the value, just make
4506 -- a copy. Likewise for a function call, an attribute reference or an
4507 -- operator. And if we have a volatile reference and Name_Req is not
4508 -- set (see comments above for Side_Effect_Free).
4510 if Is_Elementary_Type (Exp_Type)
4511 and then (Variable_Ref
4512 or else Nkind (Exp) = N_Function_Call
4513 or else Nkind (Exp) = N_Attribute_Reference
4514 or else Nkind (Exp) in N_Op
4515 or else (not Name_Req and then Is_Volatile_Reference (Exp)))
4517 Def_Id := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
4518 Set_Etype (Def_Id, Exp_Type);
4519 Res := New_Reference_To (Def_Id, Loc);
4522 Make_Object_Declaration (Loc,
4523 Defining_Identifier => Def_Id,
4524 Object_Definition => New_Reference_To (Exp_Type, Loc),
4525 Constant_Present => True,
4526 Expression => Relocate_Node (Exp));
4528 Set_Assignment_OK (E);
4529 Insert_Action (Exp, E);
4531 -- If the expression has the form v.all then we can just capture
4532 -- the pointer, and then do an explicit dereference on the result.
4534 elsif Nkind (Exp) = N_Explicit_Dereference then
4536 Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
4538 Make_Explicit_Dereference (Loc, New_Reference_To (Def_Id, Loc));
4541 Make_Object_Declaration (Loc,
4542 Defining_Identifier => Def_Id,
4543 Object_Definition =>
4544 New_Reference_To (Etype (Prefix (Exp)), Loc),
4545 Constant_Present => True,
4546 Expression => Relocate_Node (Prefix (Exp))));
4548 -- Similar processing for an unchecked conversion of an expression
4549 -- of the form v.all, where we want the same kind of treatment.
4551 elsif Nkind (Exp) = N_Unchecked_Type_Conversion
4552 and then Nkind (Expression (Exp)) = N_Explicit_Dereference
4554 Remove_Side_Effects (Expression (Exp), Name_Req, Variable_Ref);
4555 Scope_Suppress := Svg_Suppress;
4558 -- If this is a type conversion, leave the type conversion and remove
4559 -- the side effects in the expression. This is important in several
4560 -- circumstances: for change of representations, and also when this is
4561 -- a view conversion to a smaller object, where gigi can end up creating
4562 -- its own temporary of the wrong size.
4564 elsif Nkind (Exp) = N_Type_Conversion then
4565 Remove_Side_Effects (Expression (Exp), Name_Req, Variable_Ref);
4566 Scope_Suppress := Svg_Suppress;
4569 -- If this is an unchecked conversion that Gigi can't handle, make
4570 -- a copy or a use a renaming to capture the value.
4572 elsif Nkind (Exp) = N_Unchecked_Type_Conversion
4573 and then not Safe_Unchecked_Type_Conversion (Exp)
4575 if CW_Or_Has_Controlled_Part (Exp_Type) then
4577 -- Use a renaming to capture the expression, rather than create
4578 -- a controlled temporary.
4580 Def_Id := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
4581 Res := New_Reference_To (Def_Id, Loc);
4584 Make_Object_Renaming_Declaration (Loc,
4585 Defining_Identifier => Def_Id,
4586 Subtype_Mark => New_Reference_To (Exp_Type, Loc),
4587 Name => Relocate_Node (Exp)));
4590 Def_Id := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
4591 Set_Etype (Def_Id, Exp_Type);
4592 Res := New_Reference_To (Def_Id, Loc);
4595 Make_Object_Declaration (Loc,
4596 Defining_Identifier => Def_Id,
4597 Object_Definition => New_Reference_To (Exp_Type, Loc),
4598 Constant_Present => not Is_Variable (Exp),
4599 Expression => Relocate_Node (Exp));
4601 Set_Assignment_OK (E);
4602 Insert_Action (Exp, E);
4605 -- For expressions that denote objects, we can use a renaming scheme.
4606 -- We skip using this if we have a volatile reference and we do not
4607 -- have Name_Req set true (see comments above for Side_Effect_Free).
4609 elsif Is_Object_Reference (Exp)
4610 and then Nkind (Exp) /= N_Function_Call
4611 and then (Name_Req or else not Is_Volatile_Reference (Exp))
4613 Def_Id := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
4615 if Nkind (Exp) = N_Selected_Component
4616 and then Nkind (Prefix (Exp)) = N_Function_Call
4617 and then Is_Array_Type (Exp_Type)
4619 -- Avoid generating a variable-sized temporary, by generating
4620 -- the renaming declaration just for the function call. The
4621 -- transformation could be refined to apply only when the array
4622 -- component is constrained by a discriminant???
4625 Make_Selected_Component (Loc,
4626 Prefix => New_Occurrence_Of (Def_Id, Loc),
4627 Selector_Name => Selector_Name (Exp));
4630 Make_Object_Renaming_Declaration (Loc,
4631 Defining_Identifier => Def_Id,
4633 New_Reference_To (Base_Type (Etype (Prefix (Exp))), Loc),
4634 Name => Relocate_Node (Prefix (Exp))));
4637 Res := New_Reference_To (Def_Id, Loc);
4640 Make_Object_Renaming_Declaration (Loc,
4641 Defining_Identifier => Def_Id,
4642 Subtype_Mark => New_Reference_To (Exp_Type, Loc),
4643 Name => Relocate_Node (Exp)));
4647 -- If this is a packed reference, or a selected component with a
4648 -- non-standard representation, a reference to the temporary will
4649 -- be replaced by a copy of the original expression (see
4650 -- Exp_Ch2.Expand_Renaming). Otherwise the temporary must be
4651 -- elaborated by gigi, and is of course not to be replaced in-line
4652 -- by the expression it renames, which would defeat the purpose of
4653 -- removing the side-effect.
4655 if (Nkind (Exp) = N_Selected_Component
4656 or else Nkind (Exp) = N_Indexed_Component)
4657 and then Has_Non_Standard_Rep (Etype (Prefix (Exp)))
4661 Set_Is_Renaming_Of_Object (Def_Id, False);
4664 -- Otherwise we generate a reference to the value
4667 -- Special processing for function calls that return a task. We need
4668 -- to build a declaration that will enable build-in-place expansion
4671 -- This is relevant only in Ada 2005 mode. In Ada 95 programs we have
4672 -- to accommodate functions returning limited objects by reference.
4674 if Nkind (Exp) = N_Function_Call
4675 and then Is_Task_Type (Etype (Exp))
4676 and then Ada_Version >= Ada_05
4679 Obj : constant Entity_Id :=
4680 Make_Defining_Identifier (Loc,
4681 Chars => New_Internal_Name ('F'));
4686 Make_Object_Declaration (Loc,
4687 Defining_Identifier => Obj,
4688 Object_Definition => New_Occurrence_Of (Exp_Type, Loc),
4689 Expression => Relocate_Node (Exp));
4690 Insert_Action (Exp, Decl);
4691 Set_Etype (Obj, Exp_Type);
4692 Rewrite (Exp, New_Occurrence_Of (Obj, Loc));
4697 Ref_Type := Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
4700 Make_Full_Type_Declaration (Loc,
4701 Defining_Identifier => Ref_Type,
4703 Make_Access_To_Object_Definition (Loc,
4704 All_Present => True,
4705 Subtype_Indication =>
4706 New_Reference_To (Exp_Type, Loc)));
4709 Insert_Action (Exp, Ptr_Typ_Decl);
4711 Def_Id := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
4712 Set_Etype (Def_Id, Exp_Type);
4715 Make_Explicit_Dereference (Loc,
4716 Prefix => New_Reference_To (Def_Id, Loc));
4718 if Nkind (E) = N_Explicit_Dereference then
4719 New_Exp := Relocate_Node (Prefix (E));
4721 E := Relocate_Node (E);
4722 New_Exp := Make_Reference (Loc, E);
4725 if Is_Delayed_Aggregate (E) then
4727 -- The expansion of nested aggregates is delayed until the
4728 -- enclosing aggregate is expanded. As aggregates are often
4729 -- qualified, the predicate applies to qualified expressions
4730 -- as well, indicating that the enclosing aggregate has not
4731 -- been expanded yet. At this point the aggregate is part of
4732 -- a stand-alone declaration, and must be fully expanded.
4734 if Nkind (E) = N_Qualified_Expression then
4735 Set_Expansion_Delayed (Expression (E), False);
4736 Set_Analyzed (Expression (E), False);
4738 Set_Expansion_Delayed (E, False);
4741 Set_Analyzed (E, False);
4745 Make_Object_Declaration (Loc,
4746 Defining_Identifier => Def_Id,
4747 Object_Definition => New_Reference_To (Ref_Type, Loc),
4748 Expression => New_Exp));
4751 -- Preserve the Assignment_OK flag in all copies, since at least
4752 -- one copy may be used in a context where this flag must be set
4753 -- (otherwise why would the flag be set in the first place).
4755 Set_Assignment_OK (Res, Assignment_OK (Exp));
4757 -- Finally rewrite the original expression and we are done
4760 Analyze_And_Resolve (Exp, Exp_Type);
4761 Scope_Suppress := Svg_Suppress;
4762 end Remove_Side_Effects;
4764 ---------------------------
4765 -- Represented_As_Scalar --
4766 ---------------------------
4768 function Represented_As_Scalar (T : Entity_Id) return Boolean is
4769 UT : constant Entity_Id := Underlying_Type (T);
4771 return Is_Scalar_Type (UT)
4772 or else (Is_Bit_Packed_Array (UT)
4773 and then Is_Scalar_Type (Packed_Array_Type (UT)));
4774 end Represented_As_Scalar;
4776 ------------------------------------
4777 -- Safe_Unchecked_Type_Conversion --
4778 ------------------------------------
4780 -- Note: this function knows quite a bit about the exact requirements
4781 -- of Gigi with respect to unchecked type conversions, and its code
4782 -- must be coordinated with any changes in Gigi in this area.
4784 -- The above requirements should be documented in Sinfo ???
4786 function Safe_Unchecked_Type_Conversion (Exp : Node_Id) return Boolean is
4791 Pexp : constant Node_Id := Parent (Exp);
4794 -- If the expression is the RHS of an assignment or object declaration
4795 -- we are always OK because there will always be a target.
4797 -- Object renaming declarations, (generated for view conversions of
4798 -- actuals in inlined calls), like object declarations, provide an
4799 -- explicit type, and are safe as well.
4801 if (Nkind (Pexp) = N_Assignment_Statement
4802 and then Expression (Pexp) = Exp)
4803 or else Nkind (Pexp) = N_Object_Declaration
4804 or else Nkind (Pexp) = N_Object_Renaming_Declaration
4808 -- If the expression is the prefix of an N_Selected_Component
4809 -- we should also be OK because GCC knows to look inside the
4810 -- conversion except if the type is discriminated. We assume
4811 -- that we are OK anyway if the type is not set yet or if it is
4812 -- controlled since we can't afford to introduce a temporary in
4815 elsif Nkind (Pexp) = N_Selected_Component
4816 and then Prefix (Pexp) = Exp
4818 if No (Etype (Pexp)) then
4822 not Has_Discriminants (Etype (Pexp))
4823 or else Is_Constrained (Etype (Pexp));
4827 -- Set the output type, this comes from Etype if it is set, otherwise
4828 -- we take it from the subtype mark, which we assume was already
4831 if Present (Etype (Exp)) then
4832 Otyp := Etype (Exp);
4834 Otyp := Entity (Subtype_Mark (Exp));
4837 -- The input type always comes from the expression, and we assume
4838 -- this is indeed always analyzed, so we can simply get the Etype.
4840 Ityp := Etype (Expression (Exp));
4842 -- Initialize alignments to unknown so far
4847 -- Replace a concurrent type by its corresponding record type
4848 -- and each type by its underlying type and do the tests on those.
4849 -- The original type may be a private type whose completion is a
4850 -- concurrent type, so find the underlying type first.
4852 if Present (Underlying_Type (Otyp)) then
4853 Otyp := Underlying_Type (Otyp);
4856 if Present (Underlying_Type (Ityp)) then
4857 Ityp := Underlying_Type (Ityp);
4860 if Is_Concurrent_Type (Otyp) then
4861 Otyp := Corresponding_Record_Type (Otyp);
4864 if Is_Concurrent_Type (Ityp) then
4865 Ityp := Corresponding_Record_Type (Ityp);
4868 -- If the base types are the same, we know there is no problem since
4869 -- this conversion will be a noop.
4871 if Implementation_Base_Type (Otyp) = Implementation_Base_Type (Ityp) then
4874 -- Same if this is an upwards conversion of an untagged type, and there
4875 -- are no constraints involved (could be more general???)
4877 elsif Etype (Ityp) = Otyp
4878 and then not Is_Tagged_Type (Ityp)
4879 and then not Has_Discriminants (Ityp)
4880 and then No (First_Rep_Item (Base_Type (Ityp)))
4884 -- If the expression has an access type (object or subprogram) we
4885 -- assume that the conversion is safe, because the size of the target
4886 -- is safe, even if it is a record (which might be treated as having
4887 -- unknown size at this point).
4889 elsif Is_Access_Type (Ityp) then
4892 -- If the size of output type is known at compile time, there is
4893 -- never a problem. Note that unconstrained records are considered
4894 -- to be of known size, but we can't consider them that way here,
4895 -- because we are talking about the actual size of the object.
4897 -- We also make sure that in addition to the size being known, we do
4898 -- not have a case which might generate an embarrassingly large temp
4899 -- in stack checking mode.
4901 elsif Size_Known_At_Compile_Time (Otyp)
4903 (not Stack_Checking_Enabled
4904 or else not May_Generate_Large_Temp (Otyp))
4905 and then not (Is_Record_Type (Otyp) and then not Is_Constrained (Otyp))
4909 -- If either type is tagged, then we know the alignment is OK so
4910 -- Gigi will be able to use pointer punning.
4912 elsif Is_Tagged_Type (Otyp) or else Is_Tagged_Type (Ityp) then
4915 -- If either type is a limited record type, we cannot do a copy, so
4916 -- say safe since there's nothing else we can do.
4918 elsif Is_Limited_Record (Otyp) or else Is_Limited_Record (Ityp) then
4921 -- Conversions to and from packed array types are always ignored and
4924 elsif Is_Packed_Array_Type (Otyp)
4925 or else Is_Packed_Array_Type (Ityp)
4930 -- The only other cases known to be safe is if the input type's
4931 -- alignment is known to be at least the maximum alignment for the
4932 -- target or if both alignments are known and the output type's
4933 -- alignment is no stricter than the input's. We can use the alignment
4934 -- of the component type of an array if a type is an unpacked
4937 if Present (Alignment_Clause (Otyp)) then
4938 Oalign := Expr_Value (Expression (Alignment_Clause (Otyp)));
4940 elsif Is_Array_Type (Otyp)
4941 and then Present (Alignment_Clause (Component_Type (Otyp)))
4943 Oalign := Expr_Value (Expression (Alignment_Clause
4944 (Component_Type (Otyp))));
4947 if Present (Alignment_Clause (Ityp)) then
4948 Ialign := Expr_Value (Expression (Alignment_Clause (Ityp)));
4950 elsif Is_Array_Type (Ityp)
4951 and then Present (Alignment_Clause (Component_Type (Ityp)))
4953 Ialign := Expr_Value (Expression (Alignment_Clause
4954 (Component_Type (Ityp))));
4957 if Ialign /= No_Uint and then Ialign > Maximum_Alignment then
4960 elsif Ialign /= No_Uint and then Oalign /= No_Uint
4961 and then Ialign <= Oalign
4965 -- Otherwise, Gigi cannot handle this and we must make a temporary
4970 end Safe_Unchecked_Type_Conversion;
4972 ---------------------------------
4973 -- Set_Current_Value_Condition --
4974 ---------------------------------
4976 -- Note: the implementation of this procedure is very closely tied to the
4977 -- implementation of Get_Current_Value_Condition. Here we set required
4978 -- Current_Value fields, and in Get_Current_Value_Condition, we interpret
4979 -- them, so they must have a consistent view.
4981 procedure Set_Current_Value_Condition (Cnode : Node_Id) is
4983 procedure Set_Entity_Current_Value (N : Node_Id);
4984 -- If N is an entity reference, where the entity is of an appropriate
4985 -- kind, then set the current value of this entity to Cnode, unless
4986 -- there is already a definite value set there.
4988 procedure Set_Expression_Current_Value (N : Node_Id);
4989 -- If N is of an appropriate form, sets an appropriate entry in current
4990 -- value fields of relevant entities. Multiple entities can be affected
4991 -- in the case of an AND or AND THEN.
4993 ------------------------------
4994 -- Set_Entity_Current_Value --
4995 ------------------------------
4997 procedure Set_Entity_Current_Value (N : Node_Id) is
4999 if Is_Entity_Name (N) then
5001 Ent : constant Entity_Id := Entity (N);
5004 -- Don't capture if not safe to do so
5006 if not Safe_To_Capture_Value (N, Ent, Cond => True) then
5010 -- Here we have a case where the Current_Value field may
5011 -- need to be set. We set it if it is not already set to a
5012 -- compile time expression value.
5014 -- Note that this represents a decision that one condition
5015 -- blots out another previous one. That's certainly right
5016 -- if they occur at the same level. If the second one is
5017 -- nested, then the decision is neither right nor wrong (it
5018 -- would be equally OK to leave the outer one in place, or
5019 -- take the new inner one. Really we should record both, but
5020 -- our data structures are not that elaborate.
5022 if Nkind (Current_Value (Ent)) not in N_Subexpr then
5023 Set_Current_Value (Ent, Cnode);
5027 end Set_Entity_Current_Value;
5029 ----------------------------------
5030 -- Set_Expression_Current_Value --
5031 ----------------------------------
5033 procedure Set_Expression_Current_Value (N : Node_Id) is
5039 -- Loop to deal with (ignore for now) any NOT operators present. The
5040 -- presence of NOT operators will be handled properly when we call
5041 -- Get_Current_Value_Condition.
5043 while Nkind (Cond) = N_Op_Not loop
5044 Cond := Right_Opnd (Cond);
5047 -- For an AND or AND THEN, recursively process operands
5049 if Nkind (Cond) = N_Op_And or else Nkind (Cond) = N_And_Then then
5050 Set_Expression_Current_Value (Left_Opnd (Cond));
5051 Set_Expression_Current_Value (Right_Opnd (Cond));
5055 -- Check possible relational operator
5057 if Nkind (Cond) in N_Op_Compare then
5058 if Compile_Time_Known_Value (Right_Opnd (Cond)) then
5059 Set_Entity_Current_Value (Left_Opnd (Cond));
5060 elsif Compile_Time_Known_Value (Left_Opnd (Cond)) then
5061 Set_Entity_Current_Value (Right_Opnd (Cond));
5064 -- Check possible boolean variable reference
5067 Set_Entity_Current_Value (Cond);
5069 end Set_Expression_Current_Value;
5071 -- Start of processing for Set_Current_Value_Condition
5074 Set_Expression_Current_Value (Condition (Cnode));
5075 end Set_Current_Value_Condition;
5077 --------------------------
5078 -- Set_Elaboration_Flag --
5079 --------------------------
5081 procedure Set_Elaboration_Flag (N : Node_Id; Spec_Id : Entity_Id) is
5082 Loc : constant Source_Ptr := Sloc (N);
5083 Ent : constant Entity_Id := Elaboration_Entity (Spec_Id);
5087 if Present (Ent) then
5089 -- Nothing to do if at the compilation unit level, because in this
5090 -- case the flag is set by the binder generated elaboration routine.
5092 if Nkind (Parent (N)) = N_Compilation_Unit then
5095 -- Here we do need to generate an assignment statement
5098 Check_Restriction (No_Elaboration_Code, N);
5100 Make_Assignment_Statement (Loc,
5101 Name => New_Occurrence_Of (Ent, Loc),
5102 Expression => New_Occurrence_Of (Standard_True, Loc));
5104 if Nkind (Parent (N)) = N_Subunit then
5105 Insert_After (Corresponding_Stub (Parent (N)), Asn);
5107 Insert_After (N, Asn);
5112 -- Kill current value indication. This is necessary because the
5113 -- tests of this flag are inserted out of sequence and must not
5114 -- pick up bogus indications of the wrong constant value.
5116 Set_Current_Value (Ent, Empty);
5119 end Set_Elaboration_Flag;
5121 ----------------------------
5122 -- Set_Renamed_Subprogram --
5123 ----------------------------
5125 procedure Set_Renamed_Subprogram (N : Node_Id; E : Entity_Id) is
5127 -- If input node is an identifier, we can just reset it
5129 if Nkind (N) = N_Identifier then
5130 Set_Chars (N, Chars (E));
5133 -- Otherwise we have to do a rewrite, preserving Comes_From_Source
5137 CS : constant Boolean := Comes_From_Source (N);
5139 Rewrite (N, Make_Identifier (Sloc (N), Chars => Chars (E)));
5141 Set_Comes_From_Source (N, CS);
5142 Set_Analyzed (N, True);
5145 end Set_Renamed_Subprogram;
5147 ----------------------------------
5148 -- Silly_Boolean_Array_Not_Test --
5149 ----------------------------------
5151 -- This procedure implements an odd and silly test. We explicitly check
5152 -- for the case where the 'First of the component type is equal to the
5153 -- 'Last of this component type, and if this is the case, we make sure
5154 -- that constraint error is raised. The reason is that the NOT is bound
5155 -- to cause CE in this case, and we will not otherwise catch it.
5157 -- No such check is required for AND and OR, since for both these cases
5158 -- False op False = False, and True op True = True. For the XOR case,
5159 -- see Silly_Boolean_Array_Xor_Test.
5161 -- Believe it or not, this was reported as a bug. Note that nearly
5162 -- always, the test will evaluate statically to False, so the code will
5163 -- be statically removed, and no extra overhead caused.
5165 procedure Silly_Boolean_Array_Not_Test (N : Node_Id; T : Entity_Id) is
5166 Loc : constant Source_Ptr := Sloc (N);
5167 CT : constant Entity_Id := Component_Type (T);
5170 -- The check we install is
5172 -- constraint_error when
5173 -- component_type'first = component_type'last
5174 -- and then array_type'Length /= 0)
5176 -- We need the last guard because we don't want to raise CE for empty
5177 -- arrays since no out of range values result. (Empty arrays with a
5178 -- component type of True .. True -- very useful -- even the ACATS
5179 -- does not test that marginal case!)
5182 Make_Raise_Constraint_Error (Loc,
5188 Make_Attribute_Reference (Loc,
5189 Prefix => New_Occurrence_Of (CT, Loc),
5190 Attribute_Name => Name_First),
5193 Make_Attribute_Reference (Loc,
5194 Prefix => New_Occurrence_Of (CT, Loc),
5195 Attribute_Name => Name_Last)),
5197 Right_Opnd => Make_Non_Empty_Check (Loc, Right_Opnd (N))),
5198 Reason => CE_Range_Check_Failed));
5199 end Silly_Boolean_Array_Not_Test;
5201 ----------------------------------
5202 -- Silly_Boolean_Array_Xor_Test --
5203 ----------------------------------
5205 -- This procedure implements an odd and silly test. We explicitly check
5206 -- for the XOR case where the component type is True .. True, since this
5207 -- will raise constraint error. A special check is required since CE
5208 -- will not be generated otherwise (cf Expand_Packed_Not).
5210 -- No such check is required for AND and OR, since for both these cases
5211 -- False op False = False, and True op True = True, and no check is
5212 -- required for the case of False .. False, since False xor False = False.
5213 -- See also Silly_Boolean_Array_Not_Test
5215 procedure Silly_Boolean_Array_Xor_Test (N : Node_Id; T : Entity_Id) is
5216 Loc : constant Source_Ptr := Sloc (N);
5217 CT : constant Entity_Id := Component_Type (T);
5220 -- The check we install is
5222 -- constraint_error when
5223 -- Boolean (component_type'First)
5224 -- and then Boolean (component_type'Last)
5225 -- and then array_type'Length /= 0)
5227 -- We need the last guard because we don't want to raise CE for empty
5228 -- arrays since no out of range values result (Empty arrays with a
5229 -- component type of True .. True -- very useful -- even the ACATS
5230 -- does not test that marginal case!).
5233 Make_Raise_Constraint_Error (Loc,
5239 Convert_To (Standard_Boolean,
5240 Make_Attribute_Reference (Loc,
5241 Prefix => New_Occurrence_Of (CT, Loc),
5242 Attribute_Name => Name_First)),
5245 Convert_To (Standard_Boolean,
5246 Make_Attribute_Reference (Loc,
5247 Prefix => New_Occurrence_Of (CT, Loc),
5248 Attribute_Name => Name_Last))),
5250 Right_Opnd => Make_Non_Empty_Check (Loc, Right_Opnd (N))),
5251 Reason => CE_Range_Check_Failed));
5252 end Silly_Boolean_Array_Xor_Test;
5254 --------------------------
5255 -- Target_Has_Fixed_Ops --
5256 --------------------------
5258 Integer_Sized_Small : Ureal;
5259 -- Set to 2.0 ** -(Integer'Size - 1) the first time that this
5260 -- function is called (we don't want to compute it more than once!)
5262 Long_Integer_Sized_Small : Ureal;
5263 -- Set to 2.0 ** -(Long_Integer'Size - 1) the first time that this
5264 -- function is called (we don't want to compute it more than once)
5266 First_Time_For_THFO : Boolean := True;
5267 -- Set to False after first call (if Fractional_Fixed_Ops_On_Target)
5269 function Target_Has_Fixed_Ops
5270 (Left_Typ : Entity_Id;
5271 Right_Typ : Entity_Id;
5272 Result_Typ : Entity_Id) return Boolean
5274 function Is_Fractional_Type (Typ : Entity_Id) return Boolean;
5275 -- Return True if the given type is a fixed-point type with a small
5276 -- value equal to 2 ** (-(T'Object_Size - 1)) and whose values have
5277 -- an absolute value less than 1.0. This is currently limited
5278 -- to fixed-point types that map to Integer or Long_Integer.
5280 ------------------------
5281 -- Is_Fractional_Type --
5282 ------------------------
5284 function Is_Fractional_Type (Typ : Entity_Id) return Boolean is
5286 if Esize (Typ) = Standard_Integer_Size then
5287 return Small_Value (Typ) = Integer_Sized_Small;
5289 elsif Esize (Typ) = Standard_Long_Integer_Size then
5290 return Small_Value (Typ) = Long_Integer_Sized_Small;
5295 end Is_Fractional_Type;
5297 -- Start of processing for Target_Has_Fixed_Ops
5300 -- Return False if Fractional_Fixed_Ops_On_Target is false
5302 if not Fractional_Fixed_Ops_On_Target then
5306 -- Here the target has Fractional_Fixed_Ops, if first time, compute
5307 -- standard constants used by Is_Fractional_Type.
5309 if First_Time_For_THFO then
5310 First_Time_For_THFO := False;
5312 Integer_Sized_Small :=
5315 Den => UI_From_Int (Standard_Integer_Size - 1),
5318 Long_Integer_Sized_Small :=
5321 Den => UI_From_Int (Standard_Long_Integer_Size - 1),
5325 -- Return True if target supports fixed-by-fixed multiply/divide
5326 -- for fractional fixed-point types (see Is_Fractional_Type) and
5327 -- the operand and result types are equivalent fractional types.
5329 return Is_Fractional_Type (Base_Type (Left_Typ))
5330 and then Is_Fractional_Type (Base_Type (Right_Typ))
5331 and then Is_Fractional_Type (Base_Type (Result_Typ))
5332 and then Esize (Left_Typ) = Esize (Right_Typ)
5333 and then Esize (Left_Typ) = Esize (Result_Typ);
5334 end Target_Has_Fixed_Ops;
5336 ------------------------------------------
5337 -- Type_May_Have_Bit_Aligned_Components --
5338 ------------------------------------------
5340 function Type_May_Have_Bit_Aligned_Components
5341 (Typ : Entity_Id) return Boolean
5344 -- Array type, check component type
5346 if Is_Array_Type (Typ) then
5348 Type_May_Have_Bit_Aligned_Components (Component_Type (Typ));
5350 -- Record type, check components
5352 elsif Is_Record_Type (Typ) then
5357 E := First_Component_Or_Discriminant (Typ);
5358 while Present (E) loop
5359 if Component_May_Be_Bit_Aligned (E)
5360 or else Type_May_Have_Bit_Aligned_Components (Etype (E))
5365 Next_Component_Or_Discriminant (E);
5371 -- Type other than array or record is always OK
5376 end Type_May_Have_Bit_Aligned_Components;
5378 ----------------------------
5379 -- Wrap_Cleanup_Procedure --
5380 ----------------------------
5382 procedure Wrap_Cleanup_Procedure (N : Node_Id) is
5383 Loc : constant Source_Ptr := Sloc (N);
5384 Stseq : constant Node_Id := Handled_Statement_Sequence (N);
5385 Stmts : constant List_Id := Statements (Stseq);
5388 if Abort_Allowed then
5389 Prepend_To (Stmts, Build_Runtime_Call (Loc, RE_Abort_Defer));
5390 Append_To (Stmts, Build_Runtime_Call (Loc, RE_Abort_Undefer));
5392 end Wrap_Cleanup_Procedure;