1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2007, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 2, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 with Atree; use Atree;
28 with Debug; use Debug;
29 with Einfo; use Einfo;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Exp_Ch7; use Exp_Ch7;
33 with Exp_Pakd; use Exp_Pakd;
34 with Exp_Util; use Exp_Util;
35 with Exp_Tss; use Exp_Tss;
36 with Layout; use Layout;
37 with Lib.Xref; use Lib.Xref;
38 with Namet; use Namet;
39 with Nlists; use Nlists;
40 with Nmake; use Nmake;
42 with Restrict; use Restrict;
43 with Rident; use Rident;
45 with Sem_Cat; use Sem_Cat;
46 with Sem_Ch6; use Sem_Ch6;
47 with Sem_Ch7; use Sem_Ch7;
48 with Sem_Ch8; use Sem_Ch8;
49 with Sem_Ch13; use Sem_Ch13;
50 with Sem_Eval; use Sem_Eval;
51 with Sem_Mech; use Sem_Mech;
52 with Sem_Prag; use Sem_Prag;
53 with Sem_Res; use Sem_Res;
54 with Sem_Util; use Sem_Util;
55 with Sinfo; use Sinfo;
56 with Snames; use Snames;
57 with Stand; use Stand;
58 with Targparm; use Targparm;
59 with Tbuild; use Tbuild;
60 with Ttypes; use Ttypes;
61 with Uintp; use Uintp;
62 with Urealp; use Urealp;
64 package body Freeze is
66 -----------------------
67 -- Local Subprograms --
68 -----------------------
70 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id);
71 -- Typ is a type that is being frozen. If no size clause is given,
72 -- but a default Esize has been computed, then this default Esize is
73 -- adjusted up if necessary to be consistent with a given alignment,
74 -- but never to a value greater than Long_Long_Integer'Size. This
75 -- is used for all discrete types and for fixed-point types.
77 procedure Build_And_Analyze_Renamed_Body
80 After : in out Node_Id);
81 -- Build body for a renaming declaration, insert in tree and analyze
83 procedure Check_Address_Clause (E : Entity_Id);
84 -- Apply legality checks to address clauses for object declarations,
85 -- at the point the object is frozen.
87 procedure Check_Strict_Alignment (E : Entity_Id);
88 -- E is a base type. If E is tagged or has a component that is aliased
89 -- or tagged or contains something this is aliased or tagged, set
92 procedure Check_Unsigned_Type (E : Entity_Id);
93 pragma Inline (Check_Unsigned_Type);
94 -- If E is a fixed-point or discrete type, then all the necessary work
95 -- to freeze it is completed except for possible setting of the flag
96 -- Is_Unsigned_Type, which is done by this procedure. The call has no
97 -- effect if the entity E is not a discrete or fixed-point type.
99 procedure Freeze_And_Append
102 Result : in out List_Id);
103 -- Freezes Ent using Freeze_Entity, and appends the resulting list of
104 -- nodes to Result, modifying Result from No_List if necessary.
106 procedure Freeze_Enumeration_Type (Typ : Entity_Id);
107 -- Freeze enumeration type. The Esize field is set as processing
108 -- proceeds (i.e. set by default when the type is declared and then
109 -- adjusted by rep clauses. What this procedure does is to make sure
110 -- that if a foreign convention is specified, and no specific size
111 -- is given, then the size must be at least Integer'Size.
113 procedure Freeze_Static_Object (E : Entity_Id);
114 -- If an object is frozen which has Is_Statically_Allocated set, then
115 -- all referenced types must also be marked with this flag. This routine
116 -- is in charge of meeting this requirement for the object entity E.
118 procedure Freeze_Subprogram (E : Entity_Id);
119 -- Perform freezing actions for a subprogram (create extra formals,
120 -- and set proper default mechanism values). Note that this routine
121 -- is not called for internal subprograms, for which neither of these
122 -- actions is needed (or desirable, we do not want for example to have
123 -- these extra formals present in initialization procedures, where they
124 -- would serve no purpose). In this call E is either a subprogram or
125 -- a subprogram type (i.e. an access to a subprogram).
127 function Is_Fully_Defined (T : Entity_Id) return Boolean;
128 -- True if T is not private and has no private components, or has a full
129 -- view. Used to determine whether the designated type of an access type
130 -- should be frozen when the access type is frozen. This is done when an
131 -- allocator is frozen, or an expression that may involve attributes of
132 -- the designated type. Otherwise freezing the access type does not freeze
133 -- the designated type.
135 procedure Process_Default_Expressions
137 After : in out Node_Id);
138 -- This procedure is called for each subprogram to complete processing
139 -- of default expressions at the point where all types are known to be
140 -- frozen. The expressions must be analyzed in full, to make sure that
141 -- all error processing is done (they have only been pre-analyzed). If
142 -- the expression is not an entity or literal, its analysis may generate
143 -- code which must not be executed. In that case we build a function
144 -- body to hold that code. This wrapper function serves no other purpose
145 -- (it used to be called to evaluate the default, but now the default is
146 -- inlined at each point of call).
148 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id);
149 -- Typ is a record or array type that is being frozen. This routine
150 -- sets the default component alignment from the scope stack values
151 -- if the alignment is otherwise not specified.
153 procedure Check_Debug_Info_Needed (T : Entity_Id);
154 -- As each entity is frozen, this routine is called to deal with the
155 -- setting of Debug_Info_Needed for the entity. This flag is set if
156 -- the entity comes from source, or if we are in Debug_Generated_Code
157 -- mode or if the -gnatdV debug flag is set. However, it never sets
158 -- the flag if Debug_Info_Off is set.
160 procedure Set_Debug_Info_Needed (T : Entity_Id);
161 -- Sets the Debug_Info_Needed flag on entity T if not already set, and
162 -- also on any entities that are needed by T (for an object, the type
163 -- of the object is needed, and for a type, the subsidiary types are
164 -- needed -- see body for details). Never has any effect on T if the
165 -- Debug_Info_Off flag is set.
167 procedure Undelay_Type (T : Entity_Id);
168 -- T is a type of a component that we know to be an Itype.
169 -- We don't want this to have a Freeze_Node, so ensure it doesn't.
170 -- Do the same for any Full_View or Corresponding_Record_Type.
172 procedure Warn_Overlay
176 -- Expr is the expression for an address clause for entity Nam whose type
177 -- is Typ. If Typ has a default initialization, and there is no explicit
178 -- initialization in the source declaration, check whether the address
179 -- clause might cause overlaying of an entity, and emit a warning on the
180 -- side effect that the initialization will cause.
182 -------------------------------
183 -- Adjust_Esize_For_Alignment --
184 -------------------------------
186 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id) is
190 if Known_Esize (Typ) and then Known_Alignment (Typ) then
191 Align := Alignment_In_Bits (Typ);
193 if Align > Esize (Typ)
194 and then Align <= Standard_Long_Long_Integer_Size
196 Set_Esize (Typ, Align);
199 end Adjust_Esize_For_Alignment;
201 ------------------------------------
202 -- Build_And_Analyze_Renamed_Body --
203 ------------------------------------
205 procedure Build_And_Analyze_Renamed_Body
208 After : in out Node_Id)
210 Body_Node : constant Node_Id := Build_Renamed_Body (Decl, New_S);
212 Insert_After (After, Body_Node);
213 Mark_Rewrite_Insertion (Body_Node);
216 end Build_And_Analyze_Renamed_Body;
218 ------------------------
219 -- Build_Renamed_Body --
220 ------------------------
222 function Build_Renamed_Body
224 New_S : Entity_Id) return Node_Id
226 Loc : constant Source_Ptr := Sloc (New_S);
227 -- We use for the source location of the renamed body, the location
228 -- of the spec entity. It might seem more natural to use the location
229 -- of the renaming declaration itself, but that would be wrong, since
230 -- then the body we create would look as though it was created far
231 -- too late, and this could cause problems with elaboration order
232 -- analysis, particularly in connection with instantiations.
234 N : constant Node_Id := Unit_Declaration_Node (New_S);
235 Nam : constant Node_Id := Name (N);
237 Spec : constant Node_Id := New_Copy_Tree (Specification (Decl));
238 Actuals : List_Id := No_List;
243 O_Formal : Entity_Id;
244 Param_Spec : Node_Id;
247 -- Determine the entity being renamed, which is the target of the
248 -- call statement. If the name is an explicit dereference, this is
249 -- a renaming of a subprogram type rather than a subprogram. The
250 -- name itself is fully analyzed.
252 if Nkind (Nam) = N_Selected_Component then
253 Old_S := Entity (Selector_Name (Nam));
255 elsif Nkind (Nam) = N_Explicit_Dereference then
256 Old_S := Etype (Nam);
258 elsif Nkind (Nam) = N_Indexed_Component then
259 if Is_Entity_Name (Prefix (Nam)) then
260 Old_S := Entity (Prefix (Nam));
262 Old_S := Entity (Selector_Name (Prefix (Nam)));
265 elsif Nkind (Nam) = N_Character_Literal then
266 Old_S := Etype (New_S);
269 Old_S := Entity (Nam);
272 if Is_Entity_Name (Nam) then
274 -- If the renamed entity is a predefined operator, retain full
275 -- name to ensure its visibility.
277 if Ekind (Old_S) = E_Operator
278 and then Nkind (Nam) = N_Expanded_Name
280 Call_Name := New_Copy (Name (N));
282 Call_Name := New_Reference_To (Old_S, Loc);
286 Call_Name := New_Copy (Name (N));
288 -- The original name may have been overloaded, but
289 -- is fully resolved now.
291 Set_Is_Overloaded (Call_Name, False);
294 -- For simple renamings, subsequent calls can be expanded directly
295 -- as called to the renamed entity. The body must be generated in
296 -- any case for calls they may appear elsewhere.
298 if (Ekind (Old_S) = E_Function
299 or else Ekind (Old_S) = E_Procedure)
300 and then Nkind (Decl) = N_Subprogram_Declaration
302 Set_Body_To_Inline (Decl, Old_S);
305 -- The body generated for this renaming is an internal artifact, and
306 -- does not constitute a freeze point for the called entity.
308 Set_Must_Not_Freeze (Call_Name);
310 Formal := First_Formal (Defining_Entity (Decl));
312 if Present (Formal) then
315 while Present (Formal) loop
316 Append (New_Reference_To (Formal, Loc), Actuals);
317 Next_Formal (Formal);
321 -- If the renamed entity is an entry, inherit its profile. For
322 -- other renamings as bodies, both profiles must be subtype
323 -- conformant, so it is not necessary to replace the profile given
324 -- in the declaration. However, default values that are aggregates
325 -- are rewritten when partially analyzed, so we recover the original
326 -- aggregate to insure that subsequent conformity checking works.
327 -- Similarly, if the default expression was constant-folded, recover
328 -- the original expression.
330 Formal := First_Formal (Defining_Entity (Decl));
332 if Present (Formal) then
333 O_Formal := First_Formal (Old_S);
334 Param_Spec := First (Parameter_Specifications (Spec));
336 while Present (Formal) loop
337 if Is_Entry (Old_S) then
339 if Nkind (Parameter_Type (Param_Spec)) /=
342 Set_Etype (Formal, Etype (O_Formal));
343 Set_Entity (Parameter_Type (Param_Spec), Etype (O_Formal));
346 elsif Nkind (Default_Value (O_Formal)) = N_Aggregate
347 or else Nkind (Original_Node (Default_Value (O_Formal))) /=
348 Nkind (Default_Value (O_Formal))
350 Set_Expression (Param_Spec,
351 New_Copy_Tree (Original_Node (Default_Value (O_Formal))));
354 Next_Formal (Formal);
355 Next_Formal (O_Formal);
360 -- If the renamed entity is a function, the generated body contains a
361 -- return statement. Otherwise, build a procedure call. If the entity is
362 -- an entry, subsequent analysis of the call will transform it into the
363 -- proper entry or protected operation call. If the renamed entity is
364 -- a character literal, return it directly.
366 if Ekind (Old_S) = E_Function
367 or else Ekind (Old_S) = E_Operator
368 or else (Ekind (Old_S) = E_Subprogram_Type
369 and then Etype (Old_S) /= Standard_Void_Type)
372 Make_Return_Statement (Loc,
374 Make_Function_Call (Loc,
376 Parameter_Associations => Actuals));
378 elsif Ekind (Old_S) = E_Enumeration_Literal then
380 Make_Return_Statement (Loc,
381 Expression => New_Occurrence_Of (Old_S, Loc));
383 elsif Nkind (Nam) = N_Character_Literal then
385 Make_Return_Statement (Loc,
386 Expression => Call_Name);
390 Make_Procedure_Call_Statement (Loc,
392 Parameter_Associations => Actuals);
395 -- Create entities for subprogram body and formals
397 Set_Defining_Unit_Name (Spec,
398 Make_Defining_Identifier (Loc, Chars => Chars (New_S)));
400 Param_Spec := First (Parameter_Specifications (Spec));
402 while Present (Param_Spec) loop
403 Set_Defining_Identifier (Param_Spec,
404 Make_Defining_Identifier (Loc,
405 Chars => Chars (Defining_Identifier (Param_Spec))));
410 Make_Subprogram_Body (Loc,
411 Specification => Spec,
412 Declarations => New_List,
413 Handled_Statement_Sequence =>
414 Make_Handled_Sequence_Of_Statements (Loc,
415 Statements => New_List (Call_Node)));
417 if Nkind (Decl) /= N_Subprogram_Declaration then
419 Make_Subprogram_Declaration (Loc,
420 Specification => Specification (N)));
423 -- Link the body to the entity whose declaration it completes. If
424 -- the body is analyzed when the renamed entity is frozen, it may be
425 -- necessary to restore the proper scope (see package Exp_Ch13).
427 if Nkind (N) = N_Subprogram_Renaming_Declaration
428 and then Present (Corresponding_Spec (N))
430 Set_Corresponding_Spec (Body_Node, Corresponding_Spec (N));
432 Set_Corresponding_Spec (Body_Node, New_S);
436 end Build_Renamed_Body;
438 --------------------------
439 -- Check_Address_Clause --
440 --------------------------
442 procedure Check_Address_Clause (E : Entity_Id) is
443 Addr : constant Node_Id := Address_Clause (E);
445 Decl : constant Node_Id := Declaration_Node (E);
446 Typ : constant Entity_Id := Etype (E);
449 if Present (Addr) then
450 Expr := Expression (Addr);
452 -- If we have no initialization of any kind, then we don't
453 -- need to place any restrictions on the address clause, because
454 -- the object will be elaborated after the address clause is
455 -- evaluated. This happens if the declaration has no initial
456 -- expression, or the type has no implicit initialization, or
457 -- the object is imported.
459 -- The same holds for all initialized scalar types and all
460 -- access types. Packed bit arrays of size up to 64 are
461 -- represented using a modular type with an initialization
462 -- (to zero) and can be processed like other initialized
465 -- If the type is controlled, code to attach the object to a
466 -- finalization chain is generated at the point of declaration,
467 -- and therefore the elaboration of the object cannot be delayed:
468 -- the address expression must be a constant.
470 if (No (Expression (Decl))
471 and then not Controlled_Type (Typ)
473 (not Has_Non_Null_Base_Init_Proc (Typ)
474 or else Is_Imported (E)))
477 (Present (Expression (Decl))
478 and then Is_Scalar_Type (Typ))
484 (Is_Bit_Packed_Array (Typ)
486 Is_Modular_Integer_Type (Packed_Array_Type (Typ)))
490 -- Otherwise, we require the address clause to be constant
491 -- because the call to the initialization procedure (or the
492 -- attach code) has to happen at the point of the declaration.
495 Check_Constant_Address_Clause (Expr, E);
496 Set_Has_Delayed_Freeze (E, False);
499 if not Error_Posted (Expr)
500 and then not Controlled_Type (Typ)
502 Warn_Overlay (Expr, Typ, Name (Addr));
505 end Check_Address_Clause;
507 -----------------------------
508 -- Check_Compile_Time_Size --
509 -----------------------------
511 procedure Check_Compile_Time_Size (T : Entity_Id) is
513 procedure Set_Small_Size (T : Entity_Id; S : Uint);
514 -- Sets the compile time known size (32 bits or less) in the Esize
515 -- field, of T checking for a size clause that was given which attempts
516 -- to give a smaller size.
518 function Size_Known (T : Entity_Id) return Boolean;
519 -- Recursive function that does all the work
521 function Static_Discriminated_Components (T : Entity_Id) return Boolean;
522 -- If T is a constrained subtype, its size is not known if any of its
523 -- discriminant constraints is not static and it is not a null record.
524 -- The test is conservative and doesn't check that the components are
525 -- in fact constrained by non-static discriminant values. Could be made
532 procedure Set_Small_Size (T : Entity_Id; S : Uint) is
537 elsif Has_Size_Clause (T) then
538 if RM_Size (T) < S then
539 Error_Msg_Uint_1 := S;
541 ("size for & too small, minimum allowed is ^",
544 elsif Unknown_Esize (T) then
548 -- Set sizes if not set already
551 if Unknown_Esize (T) then
555 if Unknown_RM_Size (T) then
565 function Size_Known (T : Entity_Id) return Boolean is
573 if Size_Known_At_Compile_Time (T) then
576 elsif Is_Scalar_Type (T)
577 or else Is_Task_Type (T)
579 return not Is_Generic_Type (T);
581 elsif Is_Array_Type (T) then
582 if Ekind (T) = E_String_Literal_Subtype then
583 Set_Small_Size (T, Component_Size (T)
584 * String_Literal_Length (T));
587 elsif not Is_Constrained (T) then
590 -- Don't do any recursion on type with error posted, since
591 -- we may have a malformed type that leads us into a loop
593 elsif Error_Posted (T) then
596 elsif not Size_Known (Component_Type (T)) then
600 -- Check for all indexes static, and also compute possible
601 -- size (in case it is less than 32 and may be packable).
604 Esiz : Uint := Component_Size (T);
608 Index := First_Index (T);
609 while Present (Index) loop
610 if Nkind (Index) = N_Range then
611 Get_Index_Bounds (Index, Low, High);
613 elsif Error_Posted (Scalar_Range (Etype (Index))) then
617 Low := Type_Low_Bound (Etype (Index));
618 High := Type_High_Bound (Etype (Index));
621 if not Compile_Time_Known_Value (Low)
622 or else not Compile_Time_Known_Value (High)
623 or else Etype (Index) = Any_Type
628 Dim := Expr_Value (High) - Expr_Value (Low) + 1;
640 Set_Small_Size (T, Esiz);
644 elsif Is_Access_Type (T) then
647 elsif Is_Private_Type (T)
648 and then not Is_Generic_Type (T)
649 and then Present (Underlying_Type (T))
651 -- Don't do any recursion on type with error posted, since
652 -- we may have a malformed type that leads us into a loop
654 if Error_Posted (T) then
657 return Size_Known (Underlying_Type (T));
660 elsif Is_Record_Type (T) then
662 -- A class-wide type is never considered to have a known size
664 if Is_Class_Wide_Type (T) then
667 -- A subtype of a variant record must not have non-static
668 -- discriminanted components.
670 elsif T /= Base_Type (T)
671 and then not Static_Discriminated_Components (T)
675 -- Don't do any recursion on type with error posted, since
676 -- we may have a malformed type that leads us into a loop
678 elsif Error_Posted (T) then
682 -- Now look at the components of the record
685 -- The following two variables are used to keep track of
686 -- the size of packed records if we can tell the size of
687 -- the packed record in the front end. Packed_Size_Known
688 -- is True if so far we can figure out the size. It is
689 -- initialized to True for a packed record, unless the
690 -- record has discriminants. The reason we eliminate the
691 -- discriminated case is that we don't know the way the
692 -- back end lays out discriminated packed records. If
693 -- Packed_Size_Known is True, then Packed_Size is the
694 -- size in bits so far.
696 Packed_Size_Known : Boolean :=
698 and then not Has_Discriminants (T);
700 Packed_Size : Uint := Uint_0;
703 -- Test for variant part present
705 if Has_Discriminants (T)
706 and then Present (Parent (T))
707 and then Nkind (Parent (T)) = N_Full_Type_Declaration
708 and then Nkind (Type_Definition (Parent (T))) =
710 and then not Null_Present (Type_Definition (Parent (T)))
711 and then Present (Variant_Part
712 (Component_List (Type_Definition (Parent (T)))))
714 -- If variant part is present, and type is unconstrained,
715 -- then we must have defaulted discriminants, or a size
716 -- clause must be present for the type, or else the size
717 -- is definitely not known at compile time.
719 if not Is_Constrained (T)
721 No (Discriminant_Default_Value
722 (First_Discriminant (T)))
723 and then Unknown_Esize (T)
729 -- Loop through components
731 Comp := First_Component_Or_Discriminant (T);
732 while Present (Comp) loop
733 Ctyp := Etype (Comp);
735 -- We do not know the packed size if there is a component
736 -- clause present (we possibly could, but this would only
737 -- help in the case of a record with partial rep clauses.
738 -- That's because in the case of full rep clauses, the
739 -- size gets figured out anyway by a different circuit).
741 if Present (Component_Clause (Comp)) then
742 Packed_Size_Known := False;
745 -- We need to identify a component that is an array where
746 -- the index type is an enumeration type with non-standard
747 -- representation, and some bound of the type depends on a
750 -- This is because gigi computes the size by doing a
751 -- substituation of the appropriate discriminant value in
752 -- the size expression for the base type, and gigi is not
753 -- clever enough to evaluate the resulting expression (which
754 -- involves a call to rep_to_pos) at compile time.
756 -- It would be nice if gigi would either recognize that
757 -- this expression can be computed at compile time, or
758 -- alternatively figured out the size from the subtype
759 -- directly, where all the information is at hand ???
761 if Is_Array_Type (Etype (Comp))
762 and then Present (Packed_Array_Type (Etype (Comp)))
765 Ocomp : constant Entity_Id :=
766 Original_Record_Component (Comp);
767 OCtyp : constant Entity_Id := Etype (Ocomp);
773 Ind := First_Index (OCtyp);
774 while Present (Ind) loop
775 Indtyp := Etype (Ind);
777 if Is_Enumeration_Type (Indtyp)
778 and then Has_Non_Standard_Rep (Indtyp)
780 Lo := Type_Low_Bound (Indtyp);
781 Hi := Type_High_Bound (Indtyp);
783 if Is_Entity_Name (Lo)
784 and then Ekind (Entity (Lo)) = E_Discriminant
788 elsif Is_Entity_Name (Hi)
789 and then Ekind (Entity (Hi)) = E_Discriminant
800 -- Clearly size of record is not known if the size of
801 -- one of the components is not known.
803 if not Size_Known (Ctyp) then
807 -- Accumulate packed size if possible
809 if Packed_Size_Known then
811 -- We can only deal with elementary types, since for
812 -- non-elementary components, alignment enters into the
813 -- picture, and we don't know enough to handle proper
814 -- alignment in this context. Packed arrays count as
815 -- elementary if the representation is a modular type.
817 if Is_Elementary_Type (Ctyp)
818 or else (Is_Array_Type (Ctyp)
819 and then Present (Packed_Array_Type (Ctyp))
820 and then Is_Modular_Integer_Type
821 (Packed_Array_Type (Ctyp)))
823 -- If RM_Size is known and static, then we can
824 -- keep accumulating the packed size.
826 if Known_Static_RM_Size (Ctyp) then
828 -- A little glitch, to be removed sometime ???
829 -- gigi does not understand zero sizes yet.
831 if RM_Size (Ctyp) = Uint_0 then
832 Packed_Size_Known := False;
834 -- Normal case where we can keep accumulating the
835 -- packed array size.
838 Packed_Size := Packed_Size + RM_Size (Ctyp);
841 -- If we have a field whose RM_Size is not known then
842 -- we can't figure out the packed size here.
845 Packed_Size_Known := False;
848 -- If we have a non-elementary type we can't figure out
849 -- the packed array size (alignment issues).
852 Packed_Size_Known := False;
856 Next_Component_Or_Discriminant (Comp);
859 if Packed_Size_Known then
860 Set_Small_Size (T, Packed_Size);
871 -------------------------------------
872 -- Static_Discriminated_Components --
873 -------------------------------------
875 function Static_Discriminated_Components
876 (T : Entity_Id) return Boolean
878 Constraint : Elmt_Id;
881 if Has_Discriminants (T)
882 and then Present (Discriminant_Constraint (T))
883 and then Present (First_Component (T))
885 Constraint := First_Elmt (Discriminant_Constraint (T));
886 while Present (Constraint) loop
887 if not Compile_Time_Known_Value (Node (Constraint)) then
891 Next_Elmt (Constraint);
896 end Static_Discriminated_Components;
898 -- Start of processing for Check_Compile_Time_Size
901 Set_Size_Known_At_Compile_Time (T, Size_Known (T));
902 end Check_Compile_Time_Size;
904 -----------------------------
905 -- Check_Debug_Info_Needed --
906 -----------------------------
908 procedure Check_Debug_Info_Needed (T : Entity_Id) is
910 if Needs_Debug_Info (T) or else Debug_Info_Off (T) then
913 elsif Comes_From_Source (T)
914 or else Debug_Generated_Code
915 or else Debug_Flag_VV
917 Set_Debug_Info_Needed (T);
919 end Check_Debug_Info_Needed;
921 ----------------------------
922 -- Check_Strict_Alignment --
923 ----------------------------
925 procedure Check_Strict_Alignment (E : Entity_Id) is
929 if Is_Tagged_Type (E) or else Is_Concurrent_Type (E) then
930 Set_Strict_Alignment (E);
932 elsif Is_Array_Type (E) then
933 Set_Strict_Alignment (E, Strict_Alignment (Component_Type (E)));
935 elsif Is_Record_Type (E) then
936 if Is_Limited_Record (E) then
937 Set_Strict_Alignment (E);
941 Comp := First_Component (E);
943 while Present (Comp) loop
944 if not Is_Type (Comp)
945 and then (Strict_Alignment (Etype (Comp))
946 or else Is_Aliased (Comp))
948 Set_Strict_Alignment (E);
952 Next_Component (Comp);
955 end Check_Strict_Alignment;
957 -------------------------
958 -- Check_Unsigned_Type --
959 -------------------------
961 procedure Check_Unsigned_Type (E : Entity_Id) is
962 Ancestor : Entity_Id;
967 if not Is_Discrete_Or_Fixed_Point_Type (E) then
971 -- Do not attempt to analyze case where range was in error
973 if Error_Posted (Scalar_Range (E)) then
977 -- The situation that is non trivial is something like
979 -- subtype x1 is integer range -10 .. +10;
980 -- subtype x2 is x1 range 0 .. V1;
981 -- subtype x3 is x2 range V2 .. V3;
982 -- subtype x4 is x3 range V4 .. V5;
984 -- where Vn are variables. Here the base type is signed, but we still
985 -- know that x4 is unsigned because of the lower bound of x2.
987 -- The only way to deal with this is to look up the ancestor chain
991 if Ancestor = Any_Type or else Etype (Ancestor) = Any_Type then
995 Lo_Bound := Type_Low_Bound (Ancestor);
997 if Compile_Time_Known_Value (Lo_Bound) then
999 if Expr_Rep_Value (Lo_Bound) >= 0 then
1000 Set_Is_Unsigned_Type (E, True);
1006 Ancestor := Ancestor_Subtype (Ancestor);
1008 -- If no ancestor had a static lower bound, go to base type
1010 if No (Ancestor) then
1012 -- Note: the reason we still check for a compile time known
1013 -- value for the base type is that at least in the case of
1014 -- generic formals, we can have bounds that fail this test,
1015 -- and there may be other cases in error situations.
1017 Btyp := Base_Type (E);
1019 if Btyp = Any_Type or else Etype (Btyp) = Any_Type then
1023 Lo_Bound := Type_Low_Bound (Base_Type (E));
1025 if Compile_Time_Known_Value (Lo_Bound)
1026 and then Expr_Rep_Value (Lo_Bound) >= 0
1028 Set_Is_Unsigned_Type (E, True);
1035 end Check_Unsigned_Type;
1037 -----------------------------
1038 -- Expand_Atomic_Aggregate --
1039 -----------------------------
1041 procedure Expand_Atomic_Aggregate (E : Entity_Id; Typ : Entity_Id) is
1042 Loc : constant Source_Ptr := Sloc (E);
1047 if (Nkind (Parent (E)) = N_Object_Declaration
1048 or else Nkind (Parent (E)) = N_Assignment_Statement)
1049 and then Comes_From_Source (Parent (E))
1050 and then Nkind (E) = N_Aggregate
1053 Make_Defining_Identifier (Loc,
1054 New_Internal_Name ('T'));
1057 Make_Object_Declaration (Loc,
1058 Defining_Identifier => Temp,
1059 Object_definition => New_Occurrence_Of (Typ, Loc),
1060 Expression => Relocate_Node (E));
1061 Insert_Before (Parent (E), New_N);
1064 Set_Expression (Parent (E), New_Occurrence_Of (Temp, Loc));
1066 -- To prevent the temporary from being constant-folded (which
1067 -- would lead to the same piecemeal assignment on the original
1068 -- target) indicate to the back-end that the temporary is a
1069 -- variable with real storage. See description of this flag
1070 -- in Einfo, and the notes on N_Assignment_Statement and
1071 -- N_Object_Declaration in Sinfo.
1073 Set_Is_True_Constant (Temp, False);
1075 end Expand_Atomic_Aggregate;
1081 -- Note: the easy coding for this procedure would be to just build a
1082 -- single list of freeze nodes and then insert them and analyze them
1083 -- all at once. This won't work, because the analysis of earlier freeze
1084 -- nodes may recursively freeze types which would otherwise appear later
1085 -- on in the freeze list. So we must analyze and expand the freeze nodes
1086 -- as they are generated.
1088 procedure Freeze_All (From : Entity_Id; After : in out Node_Id) is
1089 Loc : constant Source_Ptr := Sloc (After);
1093 procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id);
1094 -- This is the internal recursive routine that does freezing of
1095 -- entities (but NOT the analysis of default expressions, which
1096 -- should not be recursive, we don't want to analyze those till
1097 -- we are sure that ALL the types are frozen).
1099 --------------------
1100 -- Freeze_All_Ent --
1101 --------------------
1103 procedure Freeze_All_Ent
1105 After : in out Node_Id)
1111 procedure Process_Flist;
1112 -- If freeze nodes are present, insert and analyze, and reset
1113 -- cursor for next insertion.
1119 procedure Process_Flist is
1121 if Is_Non_Empty_List (Flist) then
1122 Lastn := Next (After);
1123 Insert_List_After_And_Analyze (After, Flist);
1125 if Present (Lastn) then
1126 After := Prev (Lastn);
1128 After := Last (List_Containing (After));
1133 -- Start or processing for Freeze_All_Ent
1137 while Present (E) loop
1139 -- If the entity is an inner package which is not a package
1140 -- renaming, then its entities must be frozen at this point.
1141 -- Note that such entities do NOT get frozen at the end of
1142 -- the nested package itself (only library packages freeze).
1144 -- Same is true for task declarations, where anonymous records
1145 -- created for entry parameters must be frozen.
1147 if Ekind (E) = E_Package
1148 and then No (Renamed_Object (E))
1149 and then not Is_Child_Unit (E)
1150 and then not Is_Frozen (E)
1153 Install_Visible_Declarations (E);
1154 Install_Private_Declarations (E);
1156 Freeze_All (First_Entity (E), After);
1158 End_Package_Scope (E);
1160 elsif Ekind (E) in Task_Kind
1162 (Nkind (Parent (E)) = N_Task_Type_Declaration
1164 Nkind (Parent (E)) = N_Single_Task_Declaration)
1167 Freeze_All (First_Entity (E), After);
1170 -- For a derived tagged type, we must ensure that all the
1171 -- primitive operations of the parent have been frozen, so
1172 -- that their addresses will be in the parent's dispatch table
1173 -- at the point it is inherited.
1175 elsif Ekind (E) = E_Record_Type
1176 and then Is_Tagged_Type (E)
1177 and then Is_Tagged_Type (Etype (E))
1178 and then Is_Derived_Type (E)
1181 Prim_List : constant Elist_Id :=
1182 Primitive_Operations (Etype (E));
1188 Prim := First_Elmt (Prim_List);
1190 while Present (Prim) loop
1191 Subp := Node (Prim);
1193 if Comes_From_Source (Subp)
1194 and then not Is_Frozen (Subp)
1196 Flist := Freeze_Entity (Subp, Loc);
1205 if not Is_Frozen (E) then
1206 Flist := Freeze_Entity (E, Loc);
1210 -- If an incomplete type is still not frozen, this may be
1211 -- a premature freezing because of a body declaration that
1212 -- follows. Indicate where the freezing took place.
1214 -- If the freezing is caused by the end of the current
1215 -- declarative part, it is a Taft Amendment type, and there
1218 if not Is_Frozen (E)
1219 and then Ekind (E) = E_Incomplete_Type
1222 Bod : constant Node_Id := Next (After);
1225 if (Nkind (Bod) = N_Subprogram_Body
1226 or else Nkind (Bod) = N_Entry_Body
1227 or else Nkind (Bod) = N_Package_Body
1228 or else Nkind (Bod) = N_Protected_Body
1229 or else Nkind (Bod) = N_Task_Body
1230 or else Nkind (Bod) in N_Body_Stub)
1232 List_Containing (After) = List_Containing (Parent (E))
1234 Error_Msg_Sloc := Sloc (Next (After));
1236 ("type& is frozen# before its full declaration",
1246 -- Start of processing for Freeze_All
1249 Freeze_All_Ent (From, After);
1251 -- Now that all types are frozen, we can deal with default expressions
1252 -- that require us to build a default expression functions. This is the
1253 -- point at which such functions are constructed (after all types that
1254 -- might be used in such expressions have been frozen).
1256 -- We also add finalization chains to access types whose designated
1257 -- types are controlled. This is normally done when freezing the type,
1258 -- but this misses recursive type definitions where the later members
1259 -- of the recursion introduce controlled components (e.g. 5624-001).
1261 -- Loop through entities
1264 while Present (E) loop
1265 if Is_Subprogram (E) then
1267 if not Default_Expressions_Processed (E) then
1268 Process_Default_Expressions (E, After);
1271 if not Has_Completion (E) then
1272 Decl := Unit_Declaration_Node (E);
1274 if Nkind (Decl) = N_Subprogram_Renaming_Declaration then
1275 Build_And_Analyze_Renamed_Body (Decl, E, After);
1277 elsif Nkind (Decl) = N_Subprogram_Declaration
1278 and then Present (Corresponding_Body (Decl))
1280 Nkind (Unit_Declaration_Node (Corresponding_Body (Decl)))
1281 = N_Subprogram_Renaming_Declaration
1283 Build_And_Analyze_Renamed_Body
1284 (Decl, Corresponding_Body (Decl), After);
1288 elsif Ekind (E) in Task_Kind
1290 (Nkind (Parent (E)) = N_Task_Type_Declaration
1292 Nkind (Parent (E)) = N_Single_Task_Declaration)
1297 Ent := First_Entity (E);
1299 while Present (Ent) loop
1302 and then not Default_Expressions_Processed (Ent)
1304 Process_Default_Expressions (Ent, After);
1311 elsif Is_Access_Type (E)
1312 and then Comes_From_Source (E)
1313 and then Ekind (Directly_Designated_Type (E)) = E_Incomplete_Type
1314 and then Controlled_Type (Designated_Type (E))
1315 and then No (Associated_Final_Chain (E))
1317 Build_Final_List (Parent (E), E);
1324 -----------------------
1325 -- Freeze_And_Append --
1326 -----------------------
1328 procedure Freeze_And_Append
1331 Result : in out List_Id)
1333 L : constant List_Id := Freeze_Entity (Ent, Loc);
1335 if Is_Non_Empty_List (L) then
1336 if Result = No_List then
1339 Append_List (L, Result);
1342 end Freeze_And_Append;
1348 procedure Freeze_Before (N : Node_Id; T : Entity_Id) is
1349 Freeze_Nodes : constant List_Id := Freeze_Entity (T, Sloc (N));
1351 if Is_Non_Empty_List (Freeze_Nodes) then
1352 Insert_Actions (N, Freeze_Nodes);
1360 function Freeze_Entity (E : Entity_Id; Loc : Source_Ptr) return List_Id is
1361 Test_E : Entity_Id := E;
1369 procedure Check_Current_Instance (Comp_Decl : Node_Id);
1370 -- Check that an Access or Unchecked_Access attribute with a prefix
1371 -- which is the current instance type can only be applied when the type
1374 function After_Last_Declaration return Boolean;
1375 -- If Loc is a freeze_entity that appears after the last declaration
1376 -- in the scope, inhibit error messages on late completion.
1378 procedure Freeze_Record_Type (Rec : Entity_Id);
1379 -- Freeze each component, handle some representation clauses, and freeze
1380 -- primitive operations if this is a tagged type.
1382 ----------------------------
1383 -- After_Last_Declaration --
1384 ----------------------------
1386 function After_Last_Declaration return Boolean is
1387 Spec : constant Node_Id := Parent (Current_Scope);
1389 if Nkind (Spec) = N_Package_Specification then
1390 if Present (Private_Declarations (Spec)) then
1391 return Loc >= Sloc (Last (Private_Declarations (Spec)));
1392 elsif Present (Visible_Declarations (Spec)) then
1393 return Loc >= Sloc (Last (Visible_Declarations (Spec)));
1400 end After_Last_Declaration;
1402 ----------------------------
1403 -- Check_Current_Instance --
1404 ----------------------------
1406 procedure Check_Current_Instance (Comp_Decl : Node_Id) is
1408 function Process (N : Node_Id) return Traverse_Result;
1409 -- Process routine to apply check to given node
1415 function Process (N : Node_Id) return Traverse_Result is
1418 when N_Attribute_Reference =>
1419 if (Attribute_Name (N) = Name_Access
1421 Attribute_Name (N) = Name_Unchecked_Access)
1422 and then Is_Entity_Name (Prefix (N))
1423 and then Is_Type (Entity (Prefix (N)))
1424 and then Entity (Prefix (N)) = E
1427 ("current instance must be a limited type", Prefix (N));
1433 when others => return OK;
1437 procedure Traverse is new Traverse_Proc (Process);
1439 -- Start of processing for Check_Current_Instance
1442 Traverse (Comp_Decl);
1443 end Check_Current_Instance;
1445 ------------------------
1446 -- Freeze_Record_Type --
1447 ------------------------
1449 procedure Freeze_Record_Type (Rec : Entity_Id) is
1456 Unplaced_Component : Boolean := False;
1457 -- Set True if we find at least one component with no component
1458 -- clause (used to warn about useless Pack pragmas).
1460 Placed_Component : Boolean := False;
1461 -- Set True if we find at least one component with a component
1462 -- clause (used to warn about useless Bit_Order pragmas).
1464 procedure Check_Itype (Typ : Entity_Id);
1465 -- If the component subtype is an access to a constrained subtype of
1466 -- an already frozen type, make the subtype frozen as well. It might
1467 -- otherwise be frozen in the wrong scope, and a freeze node on
1468 -- subtype has no effect. Similarly, if the component subtype is a
1469 -- regular (not protected) access to subprogram, set the anonymous
1470 -- subprogram type to frozen as well, to prevent an out-of-scope
1471 -- freeze node at some eventual point of call. Protected operations
1472 -- are handled elsewhere.
1478 procedure Check_Itype (Typ : Entity_Id) is
1479 Desig : constant Entity_Id := Designated_Type (Typ);
1482 if not Is_Frozen (Desig)
1483 and then Is_Frozen (Base_Type (Desig))
1485 Set_Is_Frozen (Desig);
1487 -- In addition, add an Itype_Reference to ensure that the
1488 -- access subtype is elaborated early enough. This cannot be
1489 -- done if the subtype may depend on discriminants.
1491 if Ekind (Comp) = E_Component
1492 and then Is_Itype (Etype (Comp))
1493 and then not Has_Discriminants (Rec)
1495 IR := Make_Itype_Reference (Sloc (Comp));
1496 Set_Itype (IR, Desig);
1499 Result := New_List (IR);
1501 Append (IR, Result);
1505 elsif Ekind (Typ) = E_Anonymous_Access_Subprogram_Type
1506 and then Convention (Desig) /= Convention_Protected
1508 Set_Is_Frozen (Desig);
1512 -- Start of processing for Freeze_Record_Type
1515 -- If this is a subtype of a controlled type, declared without a
1516 -- constraint, the _controller may not appear in the component list
1517 -- if the parent was not frozen at the point of subtype declaration.
1518 -- Inherit the _controller component now.
1520 if Rec /= Base_Type (Rec)
1521 and then Has_Controlled_Component (Rec)
1523 if Nkind (Parent (Rec)) = N_Subtype_Declaration
1524 and then Is_Entity_Name (Subtype_Indication (Parent (Rec)))
1526 Set_First_Entity (Rec, First_Entity (Base_Type (Rec)));
1528 -- If this is an internal type without a declaration, as for
1529 -- record component, the base type may not yet be frozen, and its
1530 -- controller has not been created. Add an explicit freeze node
1531 -- for the itype, so it will be frozen after the base type. This
1532 -- freeze node is used to communicate with the expander, in order
1533 -- to create the controller for the enclosing record, and it is
1534 -- deleted afterwards (see exp_ch3). It must not be created when
1535 -- expansion is off, because it might appear in the wrong context
1536 -- for the back end.
1538 elsif Is_Itype (Rec)
1539 and then Has_Delayed_Freeze (Base_Type (Rec))
1541 Nkind (Associated_Node_For_Itype (Rec)) =
1542 N_Component_Declaration
1543 and then Expander_Active
1545 Ensure_Freeze_Node (Rec);
1549 -- Freeze components and embedded subtypes
1551 Comp := First_Entity (Rec);
1553 while Present (Comp) loop
1555 -- First handle the (real) component case
1557 if Ekind (Comp) = E_Component
1558 or else Ekind (Comp) = E_Discriminant
1561 CC : constant Node_Id := Component_Clause (Comp);
1564 -- Freezing a record type freezes the type of each of its
1565 -- components. However, if the type of the component is
1566 -- part of this record, we do not want or need a separate
1567 -- Freeze_Node. Note that Is_Itype is wrong because that's
1568 -- also set in private type cases. We also can't check for
1569 -- the Scope being exactly Rec because of private types and
1570 -- record extensions.
1572 if Is_Itype (Etype (Comp))
1573 and then Is_Record_Type (Underlying_Type
1574 (Scope (Etype (Comp))))
1576 Undelay_Type (Etype (Comp));
1579 Freeze_And_Append (Etype (Comp), Loc, Result);
1581 -- Check for error of component clause given for variable
1582 -- sized type. We have to delay this test till this point,
1583 -- since the component type has to be frozen for us to know
1584 -- if it is variable length. We omit this test in a generic
1585 -- context, it will be applied at instantiation time.
1587 if Present (CC) then
1588 Placed_Component := True;
1590 if Inside_A_Generic then
1594 Size_Known_At_Compile_Time
1595 (Underlying_Type (Etype (Comp)))
1598 ("component clause not allowed for variable " &
1599 "length component", CC);
1603 Unplaced_Component := True;
1606 -- Case of component requires byte alignment
1608 if Must_Be_On_Byte_Boundary (Etype (Comp)) then
1610 -- Set the enclosing record to also require byte align
1612 Set_Must_Be_On_Byte_Boundary (Rec);
1614 -- Check for component clause that is inconsistent with
1615 -- the required byte boundary alignment.
1618 and then Normalized_First_Bit (Comp) mod
1619 System_Storage_Unit /= 0
1622 ("component & must be byte aligned",
1623 Component_Name (Component_Clause (Comp)));
1627 -- If component clause is present, then deal with the non-
1628 -- default bit order case for Ada 95 mode. The required
1629 -- processing for Ada 2005 mode is handled separately after
1630 -- processing all components.
1632 -- We only do this processing for the base type, and in
1633 -- fact that's important, since otherwise if there are
1634 -- record subtypes, we could reverse the bits once for
1635 -- each subtype, which would be incorrect.
1638 and then Reverse_Bit_Order (Rec)
1639 and then Ekind (E) = E_Record_Type
1640 and then Ada_Version <= Ada_95
1643 CFB : constant Uint := Component_Bit_Offset (Comp);
1644 CSZ : constant Uint := Esize (Comp);
1645 CLC : constant Node_Id := Component_Clause (Comp);
1646 Pos : constant Node_Id := Position (CLC);
1647 FB : constant Node_Id := First_Bit (CLC);
1649 Storage_Unit_Offset : constant Uint :=
1650 CFB / System_Storage_Unit;
1652 Start_Bit : constant Uint :=
1653 CFB mod System_Storage_Unit;
1656 -- Cases where field goes over storage unit boundary
1658 if Start_Bit + CSZ > System_Storage_Unit then
1660 -- Allow multi-byte field but generate warning
1662 if Start_Bit mod System_Storage_Unit = 0
1663 and then CSZ mod System_Storage_Unit = 0
1666 ("multi-byte field specified with non-standard"
1667 & " Bit_Order?", CLC);
1669 if Bytes_Big_Endian then
1671 ("bytes are not reversed "
1672 & "(component is big-endian)?", CLC);
1675 ("bytes are not reversed "
1676 & "(component is little-endian)?", CLC);
1679 -- Do not allow non-contiguous field
1683 ("attempt to specify non-contiguous field"
1684 & " not permitted", CLC);
1686 ("\(caused by non-standard Bit_Order "
1687 & "specified)", CLC);
1690 -- Case where field fits in one storage unit
1693 -- Give warning if suspicious component clause
1695 if Intval (FB) >= System_Storage_Unit
1696 and then Warn_On_Reverse_Bit_Order
1699 ("?Bit_Order clause does not affect " &
1700 "byte ordering", Pos);
1702 Intval (Pos) + Intval (FB) /
1703 System_Storage_Unit;
1705 ("?position normalized to ^ before bit " &
1706 "order interpreted", Pos);
1709 -- Here is where we fix up the Component_Bit_Offset
1710 -- value to account for the reverse bit order.
1711 -- Some examples of what needs to be done are:
1713 -- First_Bit .. Last_Bit Component_Bit_Offset
1716 -- 0 .. 0 7 .. 7 0 7
1717 -- 0 .. 1 6 .. 7 0 6
1718 -- 0 .. 2 5 .. 7 0 5
1719 -- 0 .. 7 0 .. 7 0 4
1721 -- 1 .. 1 6 .. 6 1 6
1722 -- 1 .. 4 3 .. 6 1 3
1723 -- 4 .. 7 0 .. 3 4 0
1725 -- The general rule is that the first bit is
1726 -- is obtained by subtracting the old ending bit
1727 -- from storage_unit - 1.
1729 Set_Component_Bit_Offset
1731 (Storage_Unit_Offset * System_Storage_Unit) +
1732 (System_Storage_Unit - 1) -
1733 (Start_Bit + CSZ - 1));
1735 Set_Normalized_First_Bit
1737 Component_Bit_Offset (Comp) mod
1738 System_Storage_Unit);
1745 -- If the component is an Itype with Delayed_Freeze and is either
1746 -- a record or array subtype and its base type has not yet been
1747 -- frozen, we must remove this from the entity list of this
1748 -- record and put it on the entity list of the scope of its base
1749 -- type. Note that we know that this is not the type of a
1750 -- component since we cleared Has_Delayed_Freeze for it in the
1751 -- previous loop. Thus this must be the Designated_Type of an
1752 -- access type, which is the type of a component.
1755 and then Is_Type (Scope (Comp))
1756 and then Is_Composite_Type (Comp)
1757 and then Base_Type (Comp) /= Comp
1758 and then Has_Delayed_Freeze (Comp)
1759 and then not Is_Frozen (Base_Type (Comp))
1762 Will_Be_Frozen : Boolean := False;
1763 S : Entity_Id := Scope (Rec);
1766 -- We have a pretty bad kludge here. Suppose Rec is subtype
1767 -- being defined in a subprogram that's created as part of
1768 -- the freezing of Rec'Base. In that case, we know that
1769 -- Comp'Base must have already been frozen by the time we
1770 -- get to elaborate this because Gigi doesn't elaborate any
1771 -- bodies until it has elaborated all of the declarative
1772 -- part. But Is_Frozen will not be set at this point because
1773 -- we are processing code in lexical order.
1775 -- We detect this case by going up the Scope chain of Rec
1776 -- and seeing if we have a subprogram scope before reaching
1777 -- the top of the scope chain or that of Comp'Base. If we
1778 -- do, then mark that Comp'Base will actually be frozen. If
1779 -- so, we merely undelay it.
1781 while Present (S) loop
1782 if Is_Subprogram (S) then
1783 Will_Be_Frozen := True;
1785 elsif S = Scope (Base_Type (Comp)) then
1792 if Will_Be_Frozen then
1793 Undelay_Type (Comp);
1795 if Present (Prev) then
1796 Set_Next_Entity (Prev, Next_Entity (Comp));
1798 Set_First_Entity (Rec, Next_Entity (Comp));
1801 -- Insert in entity list of scope of base type (which
1802 -- must be an enclosing scope, because still unfrozen).
1804 Append_Entity (Comp, Scope (Base_Type (Comp)));
1808 -- If the component is an access type with an allocator as
1809 -- default value, the designated type will be frozen by the
1810 -- corresponding expression in init_proc. In order to place the
1811 -- freeze node for the designated type before that for the
1812 -- current record type, freeze it now.
1814 -- Same process if the component is an array of access types,
1815 -- initialized with an aggregate. If the designated type is
1816 -- private, it cannot contain allocators, and it is premature to
1817 -- freeze the type, so we check for this as well.
1819 elsif Is_Access_Type (Etype (Comp))
1820 and then Present (Parent (Comp))
1821 and then Present (Expression (Parent (Comp)))
1822 and then Nkind (Expression (Parent (Comp))) = N_Allocator
1825 Alloc : constant Node_Id := Expression (Parent (Comp));
1828 -- If component is pointer to a classwide type, freeze
1829 -- the specific type in the expression being allocated.
1830 -- The expression may be a subtype indication, in which
1831 -- case freeze the subtype mark.
1833 if Is_Class_Wide_Type (Designated_Type (Etype (Comp))) then
1834 if Is_Entity_Name (Expression (Alloc)) then
1836 (Entity (Expression (Alloc)), Loc, Result);
1838 Nkind (Expression (Alloc)) = N_Subtype_Indication
1841 (Entity (Subtype_Mark (Expression (Alloc))),
1845 elsif Is_Itype (Designated_Type (Etype (Comp))) then
1846 Check_Itype (Etype (Comp));
1850 (Designated_Type (Etype (Comp)), Loc, Result);
1854 elsif Is_Access_Type (Etype (Comp))
1855 and then Is_Itype (Designated_Type (Etype (Comp)))
1857 Check_Itype (Etype (Comp));
1859 elsif Is_Array_Type (Etype (Comp))
1860 and then Is_Access_Type (Component_Type (Etype (Comp)))
1861 and then Present (Parent (Comp))
1862 and then Nkind (Parent (Comp)) = N_Component_Declaration
1863 and then Present (Expression (Parent (Comp)))
1864 and then Nkind (Expression (Parent (Comp))) = N_Aggregate
1865 and then Is_Fully_Defined
1866 (Designated_Type (Component_Type (Etype (Comp))))
1870 (Component_Type (Etype (Comp))), Loc, Result);
1877 -- Deal with pragma Bit_Order
1879 if Reverse_Bit_Order (Rec) and then Base_Type (Rec) = Rec then
1880 if not Placed_Component then
1882 Get_Attribute_Definition_Clause (Rec, Attribute_Bit_Order);
1884 ("?Bit_Order specification has no effect", ADC);
1886 ("\?since no component clauses were specified", ADC);
1888 -- Here is where we do Ada 2005 processing for bit order (the
1889 -- Ada 95 case was already taken care of above).
1891 elsif Ada_Version >= Ada_05 then
1892 Adjust_Record_For_Reverse_Bit_Order (Rec);
1896 -- Check for useless pragma Pack when all components placed. We only
1897 -- do this check for record types, not subtypes, since a subtype may
1898 -- have all its components placed, and it still makes perfectly good
1899 -- sense to pack other subtypes or the parent type.
1901 if Ekind (Rec) = E_Record_Type
1902 and then Is_Packed (Rec)
1903 and then not Unplaced_Component
1905 -- Reset packed status. Probably not necessary, but we do it
1906 -- so that there is no chance of the back end doing something
1907 -- strange with this redundant indication of packing.
1909 Set_Is_Packed (Rec, False);
1911 -- Give warning if redundant constructs warnings on
1913 if Warn_On_Redundant_Constructs then
1915 ("?pragma Pack has no effect, no unplaced components",
1916 Get_Rep_Pragma (Rec, Name_Pack));
1920 -- If this is the record corresponding to a remote type, freeze the
1921 -- remote type here since that is what we are semantically freezing.
1922 -- This prevents the freeze node for that type in an inner scope.
1924 -- Also, Check for controlled components and unchecked unions.
1925 -- Finally, enforce the restriction that access attributes with a
1926 -- current instance prefix can only apply to limited types.
1928 if Ekind (Rec) = E_Record_Type then
1929 if Present (Corresponding_Remote_Type (Rec)) then
1931 (Corresponding_Remote_Type (Rec), Loc, Result);
1934 Comp := First_Component (Rec);
1935 while Present (Comp) loop
1936 if Has_Controlled_Component (Etype (Comp))
1937 or else (Chars (Comp) /= Name_uParent
1938 and then Is_Controlled (Etype (Comp)))
1939 or else (Is_Protected_Type (Etype (Comp))
1941 (Corresponding_Record_Type (Etype (Comp)))
1942 and then Has_Controlled_Component
1943 (Corresponding_Record_Type (Etype (Comp))))
1945 Set_Has_Controlled_Component (Rec);
1949 if Has_Unchecked_Union (Etype (Comp)) then
1950 Set_Has_Unchecked_Union (Rec);
1953 if Has_Per_Object_Constraint (Comp)
1954 and then not Is_Limited_Type (Rec)
1956 -- Scan component declaration for likely misuses of current
1957 -- instance, either in a constraint or a default expression.
1959 Check_Current_Instance (Parent (Comp));
1962 Next_Component (Comp);
1966 Set_Component_Alignment_If_Not_Set (Rec);
1968 -- For first subtypes, check if there are any fixed-point fields with
1969 -- component clauses, where we must check the size. This is not done
1970 -- till the freeze point, since for fixed-point types, we do not know
1971 -- the size until the type is frozen. Similar processing applies to
1972 -- bit packed arrays.
1974 if Is_First_Subtype (Rec) then
1975 Comp := First_Component (Rec);
1977 while Present (Comp) loop
1978 if Present (Component_Clause (Comp))
1979 and then (Is_Fixed_Point_Type (Etype (Comp))
1981 Is_Bit_Packed_Array (Etype (Comp)))
1984 (Component_Name (Component_Clause (Comp)),
1990 Next_Component (Comp);
1994 -- Generate warning for applying C or C++ convention to a record
1995 -- with discriminants. This is suppressed for the unchecked union
1996 -- case, since the whole point in this case is interface C.
1998 if Has_Discriminants (E)
1999 and then not Is_Unchecked_Union (E)
2000 and then not Warnings_Off (E)
2001 and then not Warnings_Off (Base_Type (E))
2002 and then (Convention (E) = Convention_C
2004 Convention (E) = Convention_CPP)
2005 and then Comes_From_Source (E)
2008 Cprag : constant Node_Id := Get_Rep_Pragma (E, Name_Convention);
2012 if Present (Cprag) then
2013 A2 := Next (First (Pragma_Argument_Associations (Cprag)));
2015 if Convention (E) = Convention_C then
2017 ("?variant record has no direct equivalent in C", A2);
2020 ("?variant record has no direct equivalent in C++", A2);
2024 ("\?use of convention for type& is dubious", A2, E);
2028 end Freeze_Record_Type;
2030 -- Start of processing for Freeze_Entity
2033 -- We are going to test for various reasons why this entity need not be
2034 -- frozen here, but in the case of an Itype that's defined within a
2035 -- record, that test actually applies to the record.
2037 if Is_Itype (E) and then Is_Record_Type (Scope (E)) then
2038 Test_E := Scope (E);
2039 elsif Is_Itype (E) and then Present (Underlying_Type (Scope (E)))
2040 and then Is_Record_Type (Underlying_Type (Scope (E)))
2042 Test_E := Underlying_Type (Scope (E));
2045 -- Do not freeze if already frozen since we only need one freeze node
2047 if Is_Frozen (E) then
2050 -- It is improper to freeze an external entity within a generic because
2051 -- its freeze node will appear in a non-valid context. The entity will
2052 -- be frozen in the proper scope after the current generic is analyzed.
2054 elsif Inside_A_Generic and then External_Ref_In_Generic (Test_E) then
2057 -- Do not freeze a global entity within an inner scope created during
2058 -- expansion. A call to subprogram E within some internal procedure
2059 -- (a stream attribute for example) might require freezing E, but the
2060 -- freeze node must appear in the same declarative part as E itself.
2061 -- The two-pass elaboration mechanism in gigi guarantees that E will
2062 -- be frozen before the inner call is elaborated. We exclude constants
2063 -- from this test, because deferred constants may be frozen early, and
2064 -- must be diagnosed (see e.g. 1522-005). If the enclosing subprogram
2065 -- comes from source, or is a generic instance, then the freeze point
2066 -- is the one mandated by the language. and we freze the entity.
2067 -- A subprogram that is a child unit body that acts as a spec does not
2068 -- have a spec that comes from source, but can only come from source.
2070 elsif In_Open_Scopes (Scope (Test_E))
2071 and then Scope (Test_E) /= Current_Scope
2072 and then Ekind (Test_E) /= E_Constant
2075 S : Entity_Id := Current_Scope;
2078 while Present (S) loop
2079 if Is_Overloadable (S) then
2080 if Comes_From_Source (S)
2081 or else Is_Generic_Instance (S)
2082 or else Is_Child_Unit (S)
2094 -- Similarly, an inlined instance body may make reference to global
2095 -- entities, but these references cannot be the proper freezing point
2096 -- for them, and in the absence of inlining freezing will take place
2097 -- in their own scope. Normally instance bodies are analyzed after
2098 -- the enclosing compilation, and everything has been frozen at the
2099 -- proper place, but with front-end inlining an instance body is
2100 -- compiled before the end of the enclosing scope, and as a result
2101 -- out-of-order freezing must be prevented.
2103 elsif Front_End_Inlining
2104 and then In_Instance_Body
2105 and then Present (Scope (Test_E))
2108 S : Entity_Id := Scope (Test_E);
2111 while Present (S) loop
2112 if Is_Generic_Instance (S) then
2125 -- Here to freeze the entity
2130 -- Case of entity being frozen is other than a type
2132 if not Is_Type (E) then
2134 -- If entity is exported or imported and does not have an external
2135 -- name, now is the time to provide the appropriate default name.
2136 -- Skip this if the entity is stubbed, since we don't need a name
2137 -- for any stubbed routine.
2139 if (Is_Imported (E) or else Is_Exported (E))
2140 and then No (Interface_Name (E))
2141 and then Convention (E) /= Convention_Stubbed
2143 Set_Encoded_Interface_Name
2144 (E, Get_Default_External_Name (E));
2146 -- Special processing for atomic objects appearing in object decls
2149 and then Nkind (Parent (E)) = N_Object_Declaration
2150 and then Present (Expression (Parent (E)))
2153 Expr : constant Node_Id := Expression (Parent (E));
2156 -- If expression is an aggregate, assign to a temporary to
2157 -- ensure that the actual assignment is done atomically rather
2158 -- than component-wise (the assignment to the temp may be done
2159 -- component-wise, but that is harmless).
2161 if Nkind (Expr) = N_Aggregate then
2162 Expand_Atomic_Aggregate (Expr, Etype (E));
2164 -- If the expression is a reference to a record or array object
2165 -- entity, then reset Is_True_Constant to False so that the
2166 -- compiler will not optimize away the intermediate object,
2167 -- which we need in this case for the same reason (to ensure
2168 -- that the actual assignment is atomic, rather than
2171 elsif Is_Entity_Name (Expr)
2172 and then (Is_Record_Type (Etype (Expr))
2174 Is_Array_Type (Etype (Expr)))
2176 Set_Is_True_Constant (Entity (Expr), False);
2181 -- For a subprogram, freeze all parameter types and also the return
2182 -- type (RM 13.14(14)). However skip this for internal subprograms.
2183 -- This is also the point where any extra formal parameters are
2184 -- created since we now know whether the subprogram will use
2185 -- a foreign convention.
2187 if Is_Subprogram (E) then
2188 if not Is_Internal (E) then
2191 Warn_Node : Node_Id;
2193 function Is_Fat_C_Ptr_Type (T : Entity_Id) return Boolean;
2194 -- Determines if given type entity is a fat pointer type
2195 -- used as an argument type or return type to a subprogram
2196 -- with C or C++ convention set.
2198 --------------------------
2199 -- Is_Fat_C_Access_Type --
2200 --------------------------
2202 function Is_Fat_C_Ptr_Type (T : Entity_Id) return Boolean is
2204 return (Convention (E) = Convention_C
2206 Convention (E) = Convention_CPP)
2207 and then Is_Access_Type (T)
2208 and then Esize (T) > Ttypes.System_Address_Size;
2209 end Is_Fat_C_Ptr_Type;
2212 -- Loop through formals
2214 Formal := First_Formal (E);
2215 while Present (Formal) loop
2216 F_Type := Etype (Formal);
2217 Freeze_And_Append (F_Type, Loc, Result);
2219 if Is_Private_Type (F_Type)
2220 and then Is_Private_Type (Base_Type (F_Type))
2221 and then No (Full_View (Base_Type (F_Type)))
2222 and then not Is_Generic_Type (F_Type)
2223 and then not Is_Derived_Type (F_Type)
2225 -- If the type of a formal is incomplete, subprogram
2226 -- is being frozen prematurely. Within an instance
2227 -- (but not within a wrapper package) this is an
2228 -- an artifact of our need to regard the end of an
2229 -- instantiation as a freeze point. Otherwise it is
2230 -- a definite error.
2232 -- and then not Is_Wrapper_Package (Current_Scope) ???
2235 Set_Is_Frozen (E, False);
2238 elsif not After_Last_Declaration then
2239 Error_Msg_Node_1 := F_Type;
2241 ("type& must be fully defined before this point",
2246 -- Check bad use of fat C pointer
2248 if Warn_On_Export_Import and then
2249 Is_Fat_C_Ptr_Type (F_Type)
2251 Error_Msg_Qual_Level := 1;
2253 ("?type of & does not correspond to C pointer",
2255 Error_Msg_Qual_Level := 0;
2258 -- Check for unconstrained array in exported foreign
2261 if Convention (E) in Foreign_Convention
2262 and then not Is_Imported (E)
2263 and then Is_Array_Type (F_Type)
2264 and then not Is_Constrained (F_Type)
2265 and then Warn_On_Export_Import
2267 Error_Msg_Qual_Level := 1;
2269 -- If this is an inherited operation, place the
2270 -- warning on the derived type declaration, rather
2271 -- than on the original subprogram.
2273 if Nkind (Original_Node (Parent (E))) =
2274 N_Full_Type_Declaration
2276 Warn_Node := Parent (E);
2278 if Formal = First_Formal (E) then
2280 ("?in inherited operation&", Warn_Node, E);
2283 Warn_Node := Formal;
2287 ("?type of argument& is unconstrained array",
2290 ("?foreign caller must pass bounds explicitly",
2292 Error_Msg_Qual_Level := 0;
2295 -- Ada 2005 (AI-326): Check wrong use of tag incomplete
2296 -- types with unknown discriminants. For example:
2298 -- type T (<>) is tagged;
2299 -- procedure P (X : access T); -- ERROR
2300 -- procedure P (X : T); -- ERROR
2302 if not From_With_Type (F_Type) then
2303 if Is_Access_Type (F_Type) then
2304 F_Type := Designated_Type (F_Type);
2307 if Ekind (F_Type) = E_Incomplete_Type
2308 and then Is_Tagged_Type (F_Type)
2309 and then not Is_Class_Wide_Type (F_Type)
2310 and then No (Full_View (F_Type))
2311 and then Unknown_Discriminants_Present
2313 and then No (Stored_Constraint (F_Type))
2316 ("(Ada 2005): invalid use of unconstrained tagged"
2317 & " incomplete type", E);
2319 -- If the formal is an anonymous_access_to_subprogram
2320 -- freeze the subprogram type as well, to prevent
2321 -- scope anomalies in gigi, because there is no other
2322 -- clear point at which it could be frozen.
2324 elsif Is_Itype (Etype (Formal))
2325 and then Ekind (F_Type) = E_Subprogram_Type
2327 Freeze_And_Append (F_Type, Loc, Result);
2331 Next_Formal (Formal);
2334 -- Check return type
2336 if Ekind (E) = E_Function then
2337 Freeze_And_Append (Etype (E), Loc, Result);
2339 if Warn_On_Export_Import
2340 and then Is_Fat_C_Ptr_Type (Etype (E))
2343 ("?return type of& does not correspond to C pointer",
2346 elsif Is_Array_Type (Etype (E))
2347 and then not Is_Constrained (Etype (E))
2348 and then not Is_Imported (E)
2349 and then Convention (E) in Foreign_Convention
2350 and then Warn_On_Export_Import
2353 ("?foreign convention function& should not " &
2354 "return unconstrained array", E);
2356 -- Ada 2005 (AI-326): Check wrong use of tagged
2359 -- type T is tagged;
2360 -- function F (X : Boolean) return T; -- ERROR
2362 elsif Ekind (Etype (E)) = E_Incomplete_Type
2363 and then Is_Tagged_Type (Etype (E))
2364 and then No (Full_View (Etype (E)))
2365 and then not Is_Value_Type (Etype (E))
2368 ("(Ada 2005): invalid use of tagged incomplete type",
2375 -- Must freeze its parent first if it is a derived subprogram
2377 if Present (Alias (E)) then
2378 Freeze_And_Append (Alias (E), Loc, Result);
2381 if not Is_Internal (E) then
2382 Freeze_Subprogram (E);
2385 -- Here for other than a subprogram or type
2388 -- If entity has a type, and it is not a generic unit, then
2389 -- freeze it first (RM 13.14(10)).
2391 if Present (Etype (E))
2392 and then Ekind (E) /= E_Generic_Function
2394 Freeze_And_Append (Etype (E), Loc, Result);
2397 -- Special processing for objects created by object declaration
2399 if Nkind (Declaration_Node (E)) = N_Object_Declaration then
2401 -- For object created by object declaration, perform required
2402 -- categorization (preelaborate and pure) checks. Defer these
2403 -- checks to freeze time since pragma Import inhibits default
2404 -- initialization and thus pragma Import affects these checks.
2406 Validate_Object_Declaration (Declaration_Node (E));
2408 -- If there is an address clause, check it is valid
2410 Check_Address_Clause (E);
2412 -- For imported objects, set Is_Public unless there is also
2413 -- an address clause, which means that there is no external
2414 -- symbol needed for the Import (Is_Public may still be set
2415 -- for other unrelated reasons). Note that we delayed this
2416 -- processing till freeze time so that we can be sure not
2417 -- to set the flag if there is an address clause. If there
2418 -- is such a clause, then the only purpose of the Import
2419 -- pragma is to suppress implicit initialization.
2422 and then No (Address_Clause (E))
2427 -- For convention C objects of an enumeration type, warn if
2428 -- the size is not integer size and no explicit size given.
2429 -- Skip warning for Boolean, and Character, assume programmer
2430 -- expects 8-bit sizes for these cases.
2432 if (Convention (E) = Convention_C
2434 Convention (E) = Convention_CPP)
2435 and then Is_Enumeration_Type (Etype (E))
2436 and then not Is_Character_Type (Etype (E))
2437 and then not Is_Boolean_Type (Etype (E))
2438 and then Esize (Etype (E)) < Standard_Integer_Size
2439 and then not Has_Size_Clause (E)
2441 Error_Msg_Uint_1 := UI_From_Int (Standard_Integer_Size);
2443 ("?convention C enumeration object has size less than ^",
2445 Error_Msg_N ("\?use explicit size clause to set size", E);
2449 -- Check that a constant which has a pragma Volatile[_Components]
2450 -- or Atomic[_Components] also has a pragma Import (RM C.6(13)).
2452 -- Note: Atomic[_Components] also sets Volatile[_Components]
2454 if Ekind (E) = E_Constant
2455 and then (Has_Volatile_Components (E) or else Is_Volatile (E))
2456 and then not Is_Imported (E)
2458 -- Make sure we actually have a pragma, and have not merely
2459 -- inherited the indication from elsewhere (e.g. an address
2460 -- clause, which is not good enough in RM terms!)
2462 if Has_Rep_Pragma (E, Name_Atomic)
2464 Has_Rep_Pragma (E, Name_Atomic_Components)
2467 ("stand alone atomic constant must be " &
2468 "imported ('R'M 'C.6(13))", E);
2470 elsif Has_Rep_Pragma (E, Name_Volatile)
2472 Has_Rep_Pragma (E, Name_Volatile_Components)
2475 ("stand alone volatile constant must be " &
2476 "imported ('R'M 'C.6(13))", E);
2480 -- Static objects require special handling
2482 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
2483 and then Is_Statically_Allocated (E)
2485 Freeze_Static_Object (E);
2488 -- Remaining step is to layout objects
2490 if Ekind (E) = E_Variable
2492 Ekind (E) = E_Constant
2494 Ekind (E) = E_Loop_Parameter
2502 -- Case of a type or subtype being frozen
2505 -- Check preelaborable initialization for full type completing a
2506 -- private type for which pragma Preelaborable_Initialization given.
2508 if Must_Have_Preelab_Init (E)
2509 and then not Has_Preelaborable_Initialization (E)
2512 ("full view of & does not have preelaborable initialization", E);
2515 -- The type may be defined in a generic unit. This can occur when
2516 -- freezing a generic function that returns the type (which is
2517 -- defined in a parent unit). It is clearly meaningless to freeze
2518 -- this type. However, if it is a subtype, its size may be determi-
2519 -- nable and used in subsequent checks, so might as well try to
2522 if Present (Scope (E))
2523 and then Is_Generic_Unit (Scope (E))
2525 Check_Compile_Time_Size (E);
2529 -- Deal with special cases of freezing for subtype
2531 if E /= Base_Type (E) then
2533 -- If ancestor subtype present, freeze that first.
2534 -- Note that this will also get the base type frozen.
2536 Atype := Ancestor_Subtype (E);
2538 if Present (Atype) then
2539 Freeze_And_Append (Atype, Loc, Result);
2541 -- Otherwise freeze the base type of the entity before
2542 -- freezing the entity itself (RM 13.14(15)).
2544 elsif E /= Base_Type (E) then
2545 Freeze_And_Append (Base_Type (E), Loc, Result);
2548 -- For a derived type, freeze its parent type first (RM 13.14(15))
2550 elsif Is_Derived_Type (E) then
2551 Freeze_And_Append (Etype (E), Loc, Result);
2552 Freeze_And_Append (First_Subtype (Etype (E)), Loc, Result);
2555 -- For array type, freeze index types and component type first
2556 -- before freezing the array (RM 13.14(15)).
2558 if Is_Array_Type (E) then
2560 Ctyp : constant Entity_Id := Component_Type (E);
2563 Non_Standard_Enum : Boolean := False;
2564 -- Set true if any of the index types is an enumeration type
2565 -- with a non-standard representation.
2568 Freeze_And_Append (Ctyp, Loc, Result);
2570 Indx := First_Index (E);
2571 while Present (Indx) loop
2572 Freeze_And_Append (Etype (Indx), Loc, Result);
2574 if Is_Enumeration_Type (Etype (Indx))
2575 and then Has_Non_Standard_Rep (Etype (Indx))
2577 Non_Standard_Enum := True;
2583 -- Processing that is done only for base types
2585 if Ekind (E) = E_Array_Type then
2587 -- Propagate flags for component type
2589 if Is_Controlled (Component_Type (E))
2590 or else Has_Controlled_Component (Ctyp)
2592 Set_Has_Controlled_Component (E);
2595 if Has_Unchecked_Union (Component_Type (E)) then
2596 Set_Has_Unchecked_Union (E);
2599 -- If packing was requested or if the component size was set
2600 -- explicitly, then see if bit packing is required. This
2601 -- processing is only done for base types, since all the
2602 -- representation aspects involved are type-related. This
2603 -- is not just an optimization, if we start processing the
2604 -- subtypes, they intefere with the settings on the base
2605 -- type (this is because Is_Packed has a slightly different
2606 -- meaning before and after freezing).
2613 if (Is_Packed (E) or else Has_Pragma_Pack (E))
2614 and then not Has_Atomic_Components (E)
2615 and then Known_Static_RM_Size (Ctyp)
2617 Csiz := UI_Max (RM_Size (Ctyp), 1);
2619 elsif Known_Component_Size (E) then
2620 Csiz := Component_Size (E);
2622 elsif not Known_Static_Esize (Ctyp) then
2626 Esiz := Esize (Ctyp);
2628 -- We can set the component size if it is less than
2629 -- 16, rounding it up to the next storage unit size.
2633 elsif Esiz <= 16 then
2639 -- Set component size up to match alignment if it
2640 -- would otherwise be less than the alignment. This
2641 -- deals with cases of types whose alignment exceeds
2642 -- their size (padded types).
2646 A : constant Uint := Alignment_In_Bits (Ctyp);
2657 if 1 <= Csiz and then Csiz <= 64 then
2659 -- We set the component size for all cases 1-64
2661 Set_Component_Size (Base_Type (E), Csiz);
2663 -- Check for base type of 8, 16, 32 bits, where the
2664 -- subtype has a length one less than the base type
2665 -- and is unsigned (e.g. Natural subtype of Integer).
2667 -- In such cases, if a component size was not set
2668 -- explicitly, then generate a warning.
2670 if Has_Pragma_Pack (E)
2671 and then not Has_Component_Size_Clause (E)
2673 (Csiz = 7 or else Csiz = 15 or else Csiz = 31)
2674 and then Esize (Base_Type (Ctyp)) = Csiz + 1
2676 Error_Msg_Uint_1 := Csiz;
2678 Get_Rep_Pragma (First_Subtype (E), Name_Pack);
2680 if Present (Pnod) then
2682 ("pragma Pack causes component size to be ^?",
2685 ("\use Component_Size to set desired value",
2690 -- Actual packing is not needed for 8, 16, 32, 64.
2691 -- Also not needed for 24 if alignment is 1.
2697 or else (Csiz = 24 and then Alignment (Ctyp) = 1)
2699 -- Here the array was requested to be packed, but
2700 -- the packing request had no effect, so Is_Packed
2703 -- Note: semantically this means that we lose track
2704 -- of the fact that a derived type inherited a
2705 -- pragma Pack that was non-effective, but that
2708 -- We regard a Pack pragma as a request to set a
2709 -- representation characteristic, and this request
2712 Set_Is_Packed (Base_Type (E), False);
2714 -- In all other cases, packing is indeed needed
2717 Set_Has_Non_Standard_Rep (Base_Type (E));
2718 Set_Is_Bit_Packed_Array (Base_Type (E));
2719 Set_Is_Packed (Base_Type (E));
2724 -- Processing that is done only for subtypes
2727 -- Acquire alignment from base type
2729 if Unknown_Alignment (E) then
2730 Set_Alignment (E, Alignment (Base_Type (E)));
2731 Adjust_Esize_Alignment (E);
2735 -- For bit-packed arrays, check the size
2737 if Is_Bit_Packed_Array (E)
2738 and then Known_RM_Size (E)
2742 SizC : constant Node_Id := Size_Clause (E);
2745 -- It is not clear if it is possible to have no size
2746 -- clause at this stage, but it is not worth worrying
2747 -- about. Post error on the entity name in the size
2748 -- clause if present, else on the type entity itself.
2750 if Present (SizC) then
2751 Check_Size (Name (SizC), E, RM_Size (E), Discard);
2753 Check_Size (E, E, RM_Size (E), Discard);
2758 -- Check one common case of a size given where the array
2759 -- needs to be packed, but was not so the size cannot be
2760 -- honored. This would of course be caught by the backend,
2761 -- and indeed we don't catch all cases. The point is that
2762 -- we can give a better error message in those cases that
2763 -- we do catch with the circuitry here.
2767 Ctyp : constant Entity_Id := Component_Type (E);
2770 if Present (Size_Clause (E))
2771 and then Known_Static_Esize (E)
2772 and then not Is_Bit_Packed_Array (E)
2773 and then not Has_Pragma_Pack (E)
2774 and then Number_Dimensions (E) = 1
2775 and then not Has_Component_Size_Clause (E)
2776 and then Known_Static_Esize (Ctyp)
2778 Get_Index_Bounds (First_Index (E), Lo, Hi);
2780 if Compile_Time_Known_Value (Lo)
2781 and then Compile_Time_Known_Value (Hi)
2782 and then Known_Static_RM_Size (Ctyp)
2783 and then RM_Size (Ctyp) < 64
2786 Lov : constant Uint := Expr_Value (Lo);
2787 Hiv : constant Uint := Expr_Value (Hi);
2788 Len : constant Uint :=
2789 UI_Max (Uint_0, Hiv - Lov + 1);
2790 Rsiz : constant Uint := RM_Size (Ctyp);
2792 -- What we are looking for here is the situation where
2793 -- the RM_Size given would be exactly right if there
2794 -- was a pragma Pack (resulting in the component size
2795 -- being the same as the RM_Size). Furthermore, the
2796 -- component type size must be an odd size (not a
2797 -- multiple of storage unit)
2800 if RM_Size (E) = Len * Rsiz
2801 and then Rsiz mod System_Storage_Unit /= 0
2804 ("size given for& too small",
2805 Size_Clause (E), E);
2807 ("\explicit pragma Pack is required",
2815 -- If any of the index types was an enumeration type with
2816 -- a non-standard rep clause, then we indicate that the
2817 -- array type is always packed (even if it is not bit packed).
2819 if Non_Standard_Enum then
2820 Set_Has_Non_Standard_Rep (Base_Type (E));
2821 Set_Is_Packed (Base_Type (E));
2824 Set_Component_Alignment_If_Not_Set (E);
2826 -- If the array is packed, we must create the packed array
2827 -- type to be used to actually implement the type. This is
2828 -- only needed for real array types (not for string literal
2829 -- types, since they are present only for the front end).
2832 and then Ekind (E) /= E_String_Literal_Subtype
2834 Create_Packed_Array_Type (E);
2835 Freeze_And_Append (Packed_Array_Type (E), Loc, Result);
2837 -- Size information of packed array type is copied to the
2838 -- array type, since this is really the representation. But
2839 -- do not override explicit existing size values.
2841 if not Has_Size_Clause (E) then
2842 Set_Esize (E, Esize (Packed_Array_Type (E)));
2843 Set_RM_Size (E, RM_Size (Packed_Array_Type (E)));
2846 if not Has_Alignment_Clause (E) then
2847 Set_Alignment (E, Alignment (Packed_Array_Type (E)));
2851 -- For non-packed arrays set the alignment of the array
2852 -- to the alignment of the component type if it is unknown.
2853 -- Skip this in the atomic case, since atomic arrays may
2854 -- need larger alignments.
2856 if not Is_Packed (E)
2857 and then Unknown_Alignment (E)
2858 and then Known_Alignment (Ctyp)
2859 and then Known_Static_Component_Size (E)
2860 and then Known_Static_Esize (Ctyp)
2861 and then Esize (Ctyp) = Component_Size (E)
2862 and then not Is_Atomic (E)
2864 Set_Alignment (E, Alignment (Component_Type (E)));
2868 -- For a class-wide type, the corresponding specific type is
2869 -- frozen as well (RM 13.14(15))
2871 elsif Is_Class_Wide_Type (E) then
2872 Freeze_And_Append (Root_Type (E), Loc, Result);
2874 -- If the Class_Wide_Type is an Itype (when type is the anonymous
2875 -- parent of a derived type) and it is a library-level entity,
2876 -- generate an itype reference for it. Otherwise, its first
2877 -- explicit reference may be in an inner scope, which will be
2878 -- rejected by the back-end.
2881 and then Is_Compilation_Unit (Scope (E))
2884 Ref : constant Node_Id := Make_Itype_Reference (Loc);
2889 Result := New_List (Ref);
2891 Append (Ref, Result);
2896 -- The equivalent type associated with a class-wide subtype
2897 -- needs to be frozen to ensure that its layout is done.
2898 -- Class-wide subtypes are currently only frozen on targets
2899 -- requiring front-end layout (see New_Class_Wide_Subtype
2900 -- and Make_CW_Equivalent_Type in exp_util.adb).
2902 if Ekind (E) = E_Class_Wide_Subtype
2903 and then Present (Equivalent_Type (E))
2905 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
2908 -- For a record (sub)type, freeze all the component types (RM
2909 -- 13.14(15). We test for E_Record_(sub)Type here, rather than
2910 -- using Is_Record_Type, because we don't want to attempt the
2911 -- freeze for the case of a private type with record extension
2912 -- (we will do that later when the full type is frozen).
2914 elsif Ekind (E) = E_Record_Type
2915 or else Ekind (E) = E_Record_Subtype
2917 Freeze_Record_Type (E);
2919 -- For a concurrent type, freeze corresponding record type. This
2920 -- does not correpond to any specific rule in the RM, but the
2921 -- record type is essentially part of the concurrent type.
2922 -- Freeze as well all local entities. This includes record types
2923 -- created for entry parameter blocks, and whatever local entities
2924 -- may appear in the private part.
2926 elsif Is_Concurrent_Type (E) then
2927 if Present (Corresponding_Record_Type (E)) then
2929 (Corresponding_Record_Type (E), Loc, Result);
2932 Comp := First_Entity (E);
2934 while Present (Comp) loop
2935 if Is_Type (Comp) then
2936 Freeze_And_Append (Comp, Loc, Result);
2938 elsif (Ekind (Comp)) /= E_Function then
2939 if Is_Itype (Etype (Comp))
2940 and then Underlying_Type (Scope (Etype (Comp))) = E
2942 Undelay_Type (Etype (Comp));
2945 Freeze_And_Append (Etype (Comp), Loc, Result);
2951 -- Private types are required to point to the same freeze node as
2952 -- their corresponding full views. The freeze node itself has to
2953 -- point to the partial view of the entity (because from the partial
2954 -- view, we can retrieve the full view, but not the reverse).
2955 -- However, in order to freeze correctly, we need to freeze the full
2956 -- view. If we are freezing at the end of a scope (or within the
2957 -- scope of the private type), the partial and full views will have
2958 -- been swapped, the full view appears first in the entity chain and
2959 -- the swapping mechanism ensures that the pointers are properly set
2962 -- If we encounter the partial view before the full view (e.g. when
2963 -- freezing from another scope), we freeze the full view, and then
2964 -- set the pointers appropriately since we cannot rely on swapping to
2965 -- fix things up (subtypes in an outer scope might not get swapped).
2967 elsif Is_Incomplete_Or_Private_Type (E)
2968 and then not Is_Generic_Type (E)
2970 -- Case of full view present
2972 if Present (Full_View (E)) then
2974 -- If full view has already been frozen, then no further
2975 -- processing is required
2977 if Is_Frozen (Full_View (E)) then
2979 Set_Has_Delayed_Freeze (E, False);
2980 Set_Freeze_Node (E, Empty);
2981 Check_Debug_Info_Needed (E);
2983 -- Otherwise freeze full view and patch the pointers so that
2984 -- the freeze node will elaborate both views in the back-end.
2988 Full : constant Entity_Id := Full_View (E);
2991 if Is_Private_Type (Full)
2992 and then Present (Underlying_Full_View (Full))
2995 (Underlying_Full_View (Full), Loc, Result);
2998 Freeze_And_Append (Full, Loc, Result);
3000 if Has_Delayed_Freeze (E) then
3001 F_Node := Freeze_Node (Full);
3003 if Present (F_Node) then
3004 Set_Freeze_Node (E, F_Node);
3005 Set_Entity (F_Node, E);
3008 -- {Incomplete,Private}_Subtypes
3009 -- with Full_Views constrained by discriminants
3011 Set_Has_Delayed_Freeze (E, False);
3012 Set_Freeze_Node (E, Empty);
3017 Check_Debug_Info_Needed (E);
3020 -- AI-117 requires that the convention of a partial view be the
3021 -- same as the convention of the full view. Note that this is a
3022 -- recognized breach of privacy, but it's essential for logical
3023 -- consistency of representation, and the lack of a rule in
3024 -- RM95 was an oversight.
3026 Set_Convention (E, Convention (Full_View (E)));
3028 Set_Size_Known_At_Compile_Time (E,
3029 Size_Known_At_Compile_Time (Full_View (E)));
3031 -- Size information is copied from the full view to the
3032 -- incomplete or private view for consistency
3034 -- We skip this is the full view is not a type. This is very
3035 -- strange of course, and can only happen as a result of
3036 -- certain illegalities, such as a premature attempt to derive
3037 -- from an incomplete type.
3039 if Is_Type (Full_View (E)) then
3040 Set_Size_Info (E, Full_View (E));
3041 Set_RM_Size (E, RM_Size (Full_View (E)));
3046 -- Case of no full view present. If entity is derived or subtype,
3047 -- it is safe to freeze, correctness depends on the frozen status
3048 -- of parent. Otherwise it is either premature usage, or a Taft
3049 -- amendment type, so diagnosis is at the point of use and the
3050 -- type might be frozen later.
3052 elsif E /= Base_Type (E)
3053 or else Is_Derived_Type (E)
3058 Set_Is_Frozen (E, False);
3062 -- For access subprogram, freeze types of all formals, the return
3063 -- type was already frozen, since it is the Etype of the function.
3065 elsif Ekind (E) = E_Subprogram_Type then
3066 Formal := First_Formal (E);
3067 while Present (Formal) loop
3068 Freeze_And_Append (Etype (Formal), Loc, Result);
3069 Next_Formal (Formal);
3072 Freeze_Subprogram (E);
3074 -- Ada 2005 (AI-326): Check wrong use of tag incomplete type
3076 -- type T is tagged;
3077 -- type Acc is access function (X : T) return T; -- ERROR
3079 if Ekind (Etype (E)) = E_Incomplete_Type
3080 and then Is_Tagged_Type (Etype (E))
3081 and then No (Full_View (Etype (E)))
3082 and then not Is_Value_Type (Etype (E))
3085 ("(Ada 2005): invalid use of tagged incomplete type", E);
3088 -- For access to a protected subprogram, freeze the equivalent type
3089 -- (however this is not set if we are not generating code or if this
3090 -- is an anonymous type used just for resolution).
3092 elsif Is_Access_Protected_Subprogram_Type (E) then
3094 -- AI-326: Check wrong use of tagged incomplete types
3096 -- type T is tagged;
3097 -- type As3D is access protected
3098 -- function (X : Float) return T; -- ERROR
3104 Etyp := Etype (Directly_Designated_Type (E));
3106 if Is_Class_Wide_Type (Etyp) then
3107 Etyp := Etype (Etyp);
3110 if Ekind (Etyp) = E_Incomplete_Type
3111 and then Is_Tagged_Type (Etyp)
3112 and then No (Full_View (Etyp))
3113 and then not Is_Value_Type (Etype (E))
3116 ("(Ada 2005): invalid use of tagged incomplete type", E);
3120 if Present (Equivalent_Type (E)) then
3121 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3125 -- Generic types are never seen by the back-end, and are also not
3126 -- processed by the expander (since the expander is turned off for
3127 -- generic processing), so we never need freeze nodes for them.
3129 if Is_Generic_Type (E) then
3133 -- Some special processing for non-generic types to complete
3134 -- representation details not known till the freeze point.
3136 if Is_Fixed_Point_Type (E) then
3137 Freeze_Fixed_Point_Type (E);
3139 -- Some error checks required for ordinary fixed-point type. Defer
3140 -- these till the freeze-point since we need the small and range
3141 -- values. We only do these checks for base types
3143 if Is_Ordinary_Fixed_Point_Type (E)
3144 and then E = Base_Type (E)
3146 if Small_Value (E) < Ureal_2_M_80 then
3147 Error_Msg_Name_1 := Name_Small;
3149 ("`&''%` too small, minimum allowed is 2.0'*'*(-80)", E);
3151 elsif Small_Value (E) > Ureal_2_80 then
3152 Error_Msg_Name_1 := Name_Small;
3154 ("`&''%` too large, maximum allowed is 2.0'*'*80", E);
3157 if Expr_Value_R (Type_Low_Bound (E)) < Ureal_M_10_36 then
3158 Error_Msg_Name_1 := Name_First;
3160 ("`&''%` too small, minimum allowed is -10.0'*'*36", E);
3163 if Expr_Value_R (Type_High_Bound (E)) > Ureal_10_36 then
3164 Error_Msg_Name_1 := Name_Last;
3166 ("`&''%` too large, maximum allowed is 10.0'*'*36", E);
3170 elsif Is_Enumeration_Type (E) then
3171 Freeze_Enumeration_Type (E);
3173 elsif Is_Integer_Type (E) then
3174 Adjust_Esize_For_Alignment (E);
3176 elsif Is_Access_Type (E) then
3178 -- Check restriction for standard storage pool
3180 if No (Associated_Storage_Pool (E)) then
3181 Check_Restriction (No_Standard_Storage_Pools, E);
3184 -- Deal with error message for pure access type. This is not an
3185 -- error in Ada 2005 if there is no pool (see AI-366).
3187 if Is_Pure_Unit_Access_Type (E)
3188 and then (Ada_Version < Ada_05
3189 or else not No_Pool_Assigned (E))
3191 Error_Msg_N ("named access type not allowed in pure unit", E);
3195 -- Case of composite types
3197 if Is_Composite_Type (E) then
3199 -- AI-117 requires that all new primitives of a tagged type must
3200 -- inherit the convention of the full view of the type. Inherited
3201 -- and overriding operations are defined to inherit the convention
3202 -- of their parent or overridden subprogram (also specified in
3203 -- AI-117), which will have occurred earlier (in Derive_Subprogram
3204 -- and New_Overloaded_Entity). Here we set the convention of
3205 -- primitives that are still convention Ada, which will ensure
3206 -- that any new primitives inherit the type's convention.
3207 -- Class-wide types can have a foreign convention inherited from
3208 -- their specific type, but are excluded from this since they
3209 -- don't have any associated primitives.
3211 if Is_Tagged_Type (E)
3212 and then not Is_Class_Wide_Type (E)
3213 and then Convention (E) /= Convention_Ada
3216 Prim_List : constant Elist_Id := Primitive_Operations (E);
3219 Prim := First_Elmt (Prim_List);
3220 while Present (Prim) loop
3221 if Convention (Node (Prim)) = Convention_Ada then
3222 Set_Convention (Node (Prim), Convention (E));
3231 -- Generate primitive operation references for a tagged type
3233 if Is_Tagged_Type (E)
3234 and then not Is_Class_Wide_Type (E)
3237 Prim_List : Elist_Id;
3245 if Ekind (E) = E_Protected_Subtype
3246 or else Ekind (E) = E_Task_Subtype
3253 -- Ada 2005 (AI-345): In case of concurrent type generate
3254 -- reference to the wrapper that allow us to dispatch calls
3255 -- through their implemented abstract interface types.
3257 -- The check for Present here is to protect against previously
3258 -- reported critical errors.
3260 if Is_Concurrent_Type (Aux_E)
3261 and then Present (Corresponding_Record_Type (Aux_E))
3263 Prim_List := Primitive_Operations
3264 (Corresponding_Record_Type (Aux_E));
3266 Prim_List := Primitive_Operations (Aux_E);
3269 -- Loop to generate references for primitive operations
3271 if Present (Prim_List) then
3272 Prim := First_Elmt (Prim_List);
3273 while Present (Prim) loop
3275 -- If the operation is derived, get the original for
3276 -- cross-reference purposes (it is the original for
3277 -- which we want the xref, and for which the comes
3278 -- from source test needs to be performed).
3281 while Present (Alias (Ent)) loop
3285 Generate_Reference (E, Ent, 'p', Set_Ref => False);
3292 -- Now that all types from which E may depend are frozen, see if the
3293 -- size is known at compile time, if it must be unsigned, or if
3294 -- strict alignment is required
3296 Check_Compile_Time_Size (E);
3297 Check_Unsigned_Type (E);
3299 if Base_Type (E) = E then
3300 Check_Strict_Alignment (E);
3303 -- Do not allow a size clause for a type which does not have a size
3304 -- that is known at compile time
3306 if Has_Size_Clause (E)
3307 and then not Size_Known_At_Compile_Time (E)
3309 -- Supress this message if errors posted on E, even if we are
3310 -- in all errors mode, since this is often a junk message
3312 if not Error_Posted (E) then
3314 ("size clause not allowed for variable length type",
3319 -- Remaining process is to set/verify the representation information,
3320 -- in particular the size and alignment values. This processing is
3321 -- not required for generic types, since generic types do not play
3322 -- any part in code generation, and so the size and alignment values
3323 -- for such types are irrelevant.
3325 if Is_Generic_Type (E) then
3328 -- Otherwise we call the layout procedure
3334 -- End of freeze processing for type entities
3337 -- Here is where we logically freeze the current entity. If it has a
3338 -- freeze node, then this is the point at which the freeze node is
3339 -- linked into the result list.
3341 if Has_Delayed_Freeze (E) then
3343 -- If a freeze node is already allocated, use it, otherwise allocate
3344 -- a new one. The preallocation happens in the case of anonymous base
3345 -- types, where we preallocate so that we can set First_Subtype_Link.
3346 -- Note that we reset the Sloc to the current freeze location.
3348 if Present (Freeze_Node (E)) then
3349 F_Node := Freeze_Node (E);
3350 Set_Sloc (F_Node, Loc);
3353 F_Node := New_Node (N_Freeze_Entity, Loc);
3354 Set_Freeze_Node (E, F_Node);
3355 Set_Access_Types_To_Process (F_Node, No_Elist);
3356 Set_TSS_Elist (F_Node, No_Elist);
3357 Set_Actions (F_Node, No_List);
3360 Set_Entity (F_Node, E);
3362 if Result = No_List then
3363 Result := New_List (F_Node);
3365 Append (F_Node, Result);
3368 -- A final pass over record types with discriminants. If the type
3369 -- has an incomplete declaration, there may be constrained access
3370 -- subtypes declared elsewhere, which do not depend on the discrimi-
3371 -- nants of the type, and which are used as component types (i.e.
3372 -- the full view is a recursive type). The designated types of these
3373 -- subtypes can only be elaborated after the type itself, and they
3374 -- need an itype reference.
3376 if Ekind (E) = E_Record_Type
3377 and then Has_Discriminants (E)
3385 Comp := First_Component (E);
3387 while Present (Comp) loop
3388 Typ := Etype (Comp);
3390 if Ekind (Comp) = E_Component
3391 and then Is_Access_Type (Typ)
3392 and then Scope (Typ) /= E
3393 and then Base_Type (Designated_Type (Typ)) = E
3394 and then Is_Itype (Designated_Type (Typ))
3396 IR := Make_Itype_Reference (Sloc (Comp));
3397 Set_Itype (IR, Designated_Type (Typ));
3398 Append (IR, Result);
3401 Next_Component (Comp);
3407 -- When a type is frozen, the first subtype of the type is frozen as
3408 -- well (RM 13.14(15)). This has to be done after freezing the type,
3409 -- since obviously the first subtype depends on its own base type.
3412 Freeze_And_Append (First_Subtype (E), Loc, Result);
3414 -- If we just froze a tagged non-class wide record, then freeze the
3415 -- corresponding class-wide type. This must be done after the tagged
3416 -- type itself is frozen, because the class-wide type refers to the
3417 -- tagged type which generates the class.
3419 if Is_Tagged_Type (E)
3420 and then not Is_Class_Wide_Type (E)
3421 and then Present (Class_Wide_Type (E))
3423 Freeze_And_Append (Class_Wide_Type (E), Loc, Result);
3427 Check_Debug_Info_Needed (E);
3429 -- Special handling for subprograms
3431 if Is_Subprogram (E) then
3433 -- If subprogram has address clause then reset Is_Public flag, since
3434 -- we do not want the backend to generate external references.
3436 if Present (Address_Clause (E))
3437 and then not Is_Library_Level_Entity (E)
3439 Set_Is_Public (E, False);
3441 -- If no address clause and not intrinsic, then for imported
3442 -- subprogram in main unit, generate descriptor if we are in
3443 -- Propagate_Exceptions mode.
3445 elsif Propagate_Exceptions
3446 and then Is_Imported (E)
3447 and then not Is_Intrinsic_Subprogram (E)
3448 and then Convention (E) /= Convention_Stubbed
3450 if Result = No_List then
3451 Result := Empty_List;
3459 -----------------------------
3460 -- Freeze_Enumeration_Type --
3461 -----------------------------
3463 procedure Freeze_Enumeration_Type (Typ : Entity_Id) is
3465 if Has_Foreign_Convention (Typ)
3466 and then not Has_Size_Clause (Typ)
3467 and then Esize (Typ) < Standard_Integer_Size
3469 Init_Esize (Typ, Standard_Integer_Size);
3471 Adjust_Esize_For_Alignment (Typ);
3473 end Freeze_Enumeration_Type;
3475 -----------------------
3476 -- Freeze_Expression --
3477 -----------------------
3479 procedure Freeze_Expression (N : Node_Id) is
3480 In_Def_Exp : constant Boolean := In_Default_Expression;
3483 Desig_Typ : Entity_Id;
3487 Freeze_Outside : Boolean := False;
3488 -- This flag is set true if the entity must be frozen outside the
3489 -- current subprogram. This happens in the case of expander generated
3490 -- subprograms (_Init_Proc, _Input, _Output, _Read, _Write) which do
3491 -- not freeze all entities like other bodies, but which nevertheless
3492 -- may reference entities that have to be frozen before the body and
3493 -- obviously cannot be frozen inside the body.
3495 function In_Exp_Body (N : Node_Id) return Boolean;
3496 -- Given an N_Handled_Sequence_Of_Statements node N, determines whether
3497 -- it is the handled statement sequence of an expander-generated
3498 -- subprogram (init proc, stream subprogram, or renaming as body).
3499 -- If so, this is not a freezing context.
3505 function In_Exp_Body (N : Node_Id) return Boolean is
3510 if Nkind (N) = N_Subprogram_Body then
3516 if Nkind (P) /= N_Subprogram_Body then
3520 Id := Defining_Unit_Name (Specification (P));
3522 if Nkind (Id) = N_Defining_Identifier
3523 and then (Is_Init_Proc (Id) or else
3524 Is_TSS (Id, TSS_Stream_Input) or else
3525 Is_TSS (Id, TSS_Stream_Output) or else
3526 Is_TSS (Id, TSS_Stream_Read) or else
3527 Is_TSS (Id, TSS_Stream_Write) or else
3528 Nkind (Original_Node (P)) =
3529 N_Subprogram_Renaming_Declaration)
3538 -- Start of processing for Freeze_Expression
3541 -- Immediate return if freezing is inhibited. This flag is set by the
3542 -- analyzer to stop freezing on generated expressions that would cause
3543 -- freezing if they were in the source program, but which are not
3544 -- supposed to freeze, since they are created.
3546 if Must_Not_Freeze (N) then
3550 -- If expression is non-static, then it does not freeze in a default
3551 -- expression, see section "Handling of Default Expressions" in the
3552 -- spec of package Sem for further details. Note that we have to
3553 -- make sure that we actually have a real expression (if we have
3554 -- a subtype indication, we can't test Is_Static_Expression!)
3557 and then Nkind (N) in N_Subexpr
3558 and then not Is_Static_Expression (N)
3563 -- Freeze type of expression if not frozen already
3567 if Nkind (N) in N_Has_Etype then
3568 if not Is_Frozen (Etype (N)) then
3571 -- Base type may be an derived numeric type that is frozen at
3572 -- the point of declaration, but first_subtype is still unfrozen.
3574 elsif not Is_Frozen (First_Subtype (Etype (N))) then
3575 Typ := First_Subtype (Etype (N));
3579 -- For entity name, freeze entity if not frozen already. A special
3580 -- exception occurs for an identifier that did not come from source.
3581 -- We don't let such identifiers freeze a non-internal entity, i.e.
3582 -- an entity that did come from source, since such an identifier was
3583 -- generated by the expander, and cannot have any semantic effect on
3584 -- the freezing semantics. For example, this stops the parameter of
3585 -- an initialization procedure from freezing the variable.
3587 if Is_Entity_Name (N)
3588 and then not Is_Frozen (Entity (N))
3589 and then (Nkind (N) /= N_Identifier
3590 or else Comes_From_Source (N)
3591 or else not Comes_From_Source (Entity (N)))
3598 -- For an allocator freeze designated type if not frozen already
3600 -- For an aggregate whose component type is an access type, freeze the
3601 -- designated type now, so that its freeze does not appear within the
3602 -- loop that might be created in the expansion of the aggregate. If the
3603 -- designated type is a private type without full view, the expression
3604 -- cannot contain an allocator, so the type is not frozen.
3610 Desig_Typ := Designated_Type (Etype (N));
3613 if Is_Array_Type (Etype (N))
3614 and then Is_Access_Type (Component_Type (Etype (N)))
3616 Desig_Typ := Designated_Type (Component_Type (Etype (N)));
3619 when N_Selected_Component |
3620 N_Indexed_Component |
3623 if Is_Access_Type (Etype (Prefix (N))) then
3624 Desig_Typ := Designated_Type (Etype (Prefix (N)));
3631 if Desig_Typ /= Empty
3632 and then (Is_Frozen (Desig_Typ)
3633 or else (not Is_Fully_Defined (Desig_Typ)))
3638 -- All done if nothing needs freezing
3642 and then No (Desig_Typ)
3647 -- Loop for looking at the right place to insert the freeze nodes
3648 -- exiting from the loop when it is appropriate to insert the freeze
3649 -- node before the current node P.
3651 -- Also checks some special exceptions to the freezing rules. These
3652 -- cases result in a direct return, bypassing the freeze action.
3656 Parent_P := Parent (P);
3658 -- If we don't have a parent, then we are not in a well-formed tree.
3659 -- This is an unusual case, but there are some legitimate situations
3660 -- in which this occurs, notably when the expressions in the range of
3661 -- a type declaration are resolved. We simply ignore the freeze
3662 -- request in this case. Is this right ???
3664 if No (Parent_P) then
3668 -- See if we have got to an appropriate point in the tree
3670 case Nkind (Parent_P) is
3672 -- A special test for the exception of (RM 13.14(8)) for the case
3673 -- of per-object expressions (RM 3.8(18)) occurring in component
3674 -- definition or a discrete subtype definition. Note that we test
3675 -- for a component declaration which includes both cases we are
3676 -- interested in, and furthermore the tree does not have explicit
3677 -- nodes for either of these two constructs.
3679 when N_Component_Declaration =>
3681 -- The case we want to test for here is an identifier that is
3682 -- a per-object expression, this is either a discriminant that
3683 -- appears in a context other than the component declaration
3684 -- or it is a reference to the type of the enclosing construct.
3686 -- For either of these cases, we skip the freezing
3688 if not In_Default_Expression
3689 and then Nkind (N) = N_Identifier
3690 and then (Present (Entity (N)))
3692 -- We recognize the discriminant case by just looking for
3693 -- a reference to a discriminant. It can only be one for
3694 -- the enclosing construct. Skip freezing in this case.
3696 if Ekind (Entity (N)) = E_Discriminant then
3699 -- For the case of a reference to the enclosing record,
3700 -- (or task or protected type), we look for a type that
3701 -- matches the current scope.
3703 elsif Entity (N) = Current_Scope then
3708 -- If we have an enumeration literal that appears as the choice in
3709 -- the aggregate of an enumeration representation clause, then
3710 -- freezing does not occur (RM 13.14(10)).
3712 when N_Enumeration_Representation_Clause =>
3714 -- The case we are looking for is an enumeration literal
3716 if (Nkind (N) = N_Identifier or Nkind (N) = N_Character_Literal)
3717 and then Is_Enumeration_Type (Etype (N))
3719 -- If enumeration literal appears directly as the choice,
3720 -- do not freeze (this is the normal non-overloade case)
3722 if Nkind (Parent (N)) = N_Component_Association
3723 and then First (Choices (Parent (N))) = N
3727 -- If enumeration literal appears as the name of function
3728 -- which is the choice, then also do not freeze. This
3729 -- happens in the overloaded literal case, where the
3730 -- enumeration literal is temporarily changed to a function
3731 -- call for overloading analysis purposes.
3733 elsif Nkind (Parent (N)) = N_Function_Call
3735 Nkind (Parent (Parent (N))) = N_Component_Association
3737 First (Choices (Parent (Parent (N)))) = Parent (N)
3743 -- Normally if the parent is a handled sequence of statements,
3744 -- then the current node must be a statement, and that is an
3745 -- appropriate place to insert a freeze node.
3747 when N_Handled_Sequence_Of_Statements =>
3749 -- An exception occurs when the sequence of statements is for
3750 -- an expander generated body that did not do the usual freeze
3751 -- all operation. In this case we usually want to freeze
3752 -- outside this body, not inside it, and we skip past the
3753 -- subprogram body that we are inside.
3755 if In_Exp_Body (Parent_P) then
3757 -- However, we *do* want to freeze at this point if we have
3758 -- an entity to freeze, and that entity is declared *inside*
3759 -- the body of the expander generated procedure. This case
3760 -- is recognized by the scope of the type, which is either
3761 -- the spec for some enclosing body, or (in the case of
3762 -- init_procs, for which there are no separate specs) the
3766 Subp : constant Node_Id := Parent (Parent_P);
3770 if Nkind (Subp) = N_Subprogram_Body then
3771 Cspc := Corresponding_Spec (Subp);
3773 if (Present (Typ) and then Scope (Typ) = Cspc)
3775 (Present (Nam) and then Scope (Nam) = Cspc)
3780 and then Scope (Typ) = Current_Scope
3781 and then Current_Scope = Defining_Entity (Subp)
3788 -- If not that exception to the exception, then this is
3789 -- where we delay the freeze till outside the body.
3791 Parent_P := Parent (Parent_P);
3792 Freeze_Outside := True;
3794 -- Here if normal case where we are in handled statement
3795 -- sequence and want to do the insertion right there.
3801 -- If parent is a body or a spec or a block, then the current node
3802 -- is a statement or declaration and we can insert the freeze node
3805 when N_Package_Specification |
3811 N_Block_Statement => exit;
3813 -- The expander is allowed to define types in any statements list,
3814 -- so any of the following parent nodes also mark a freezing point
3815 -- if the actual node is in a list of statements or declarations.
3817 when N_Exception_Handler |
3820 N_Case_Statement_Alternative |
3821 N_Compilation_Unit_Aux |
3822 N_Selective_Accept |
3823 N_Accept_Alternative |
3824 N_Delay_Alternative |
3825 N_Conditional_Entry_Call |
3826 N_Entry_Call_Alternative |
3827 N_Triggering_Alternative |
3831 exit when Is_List_Member (P);
3833 -- Note: The N_Loop_Statement is a special case. A type that
3834 -- appears in the source can never be frozen in a loop (this
3835 -- occurs only because of a loop expanded by the expander), so we
3836 -- keep on going. Otherwise we terminate the search. Same is true
3837 -- of any entity which comes from source. (if they have predefined
3838 -- type, that type does not appear to come from source, but the
3839 -- entity should not be frozen here).
3841 when N_Loop_Statement =>
3842 exit when not Comes_From_Source (Etype (N))
3843 and then (No (Nam) or else not Comes_From_Source (Nam));
3845 -- For all other cases, keep looking at parents
3851 -- We fall through the case if we did not yet find the proper
3852 -- place in the free for inserting the freeze node, so climb!
3857 -- If the expression appears in a record or an initialization procedure,
3858 -- the freeze nodes are collected and attached to the current scope, to
3859 -- be inserted and analyzed on exit from the scope, to insure that
3860 -- generated entities appear in the correct scope. If the expression is
3861 -- a default for a discriminant specification, the scope is still void.
3862 -- The expression can also appear in the discriminant part of a private
3863 -- or concurrent type.
3865 -- If the expression appears in a constrained subcomponent of an
3866 -- enclosing record declaration, the freeze nodes must be attached to
3867 -- the outer record type so they can eventually be placed in the
3868 -- enclosing declaration list.
3870 -- The other case requiring this special handling is if we are in a
3871 -- default expression, since in that case we are about to freeze a
3872 -- static type, and the freeze scope needs to be the outer scope, not
3873 -- the scope of the subprogram with the default parameter.
3875 -- For default expressions in generic units, the Move_Freeze_Nodes
3876 -- mechanism (see sem_ch12.adb) takes care of placing them at the proper
3877 -- place, after the generic unit.
3879 if (In_Def_Exp and not Inside_A_Generic)
3880 or else Freeze_Outside
3881 or else (Is_Type (Current_Scope)
3882 and then (not Is_Concurrent_Type (Current_Scope)
3883 or else not Has_Completion (Current_Scope)))
3884 or else Ekind (Current_Scope) = E_Void
3887 Loc : constant Source_Ptr := Sloc (Current_Scope);
3888 Freeze_Nodes : List_Id := No_List;
3889 Pos : Int := Scope_Stack.Last;
3892 if Present (Desig_Typ) then
3893 Freeze_And_Append (Desig_Typ, Loc, Freeze_Nodes);
3896 if Present (Typ) then
3897 Freeze_And_Append (Typ, Loc, Freeze_Nodes);
3900 if Present (Nam) then
3901 Freeze_And_Append (Nam, Loc, Freeze_Nodes);
3904 -- The current scope may be that of a constrained component of
3905 -- an enclosing record declaration, which is above the current
3906 -- scope in the scope stack.
3908 if Is_Record_Type (Scope (Current_Scope)) then
3912 if Is_Non_Empty_List (Freeze_Nodes) then
3913 if No (Scope_Stack.Table (Pos).Pending_Freeze_Actions) then
3914 Scope_Stack.Table (Pos).Pending_Freeze_Actions :=
3917 Append_List (Freeze_Nodes, Scope_Stack.Table
3918 (Pos).Pending_Freeze_Actions);
3926 -- Now we have the right place to do the freezing. First, a special
3927 -- adjustment, if we are in default expression analysis mode, these
3928 -- freeze actions must not be thrown away (normally all inserted actions
3929 -- are thrown away in this mode. However, the freeze actions are from
3930 -- static expressions and one of the important reasons we are doing this
3931 -- special analysis is to get these freeze actions. Therefore we turn
3932 -- off the In_Default_Expression mode to propagate these freeze actions.
3933 -- This also means they get properly analyzed and expanded.
3935 In_Default_Expression := False;
3937 -- Freeze the designated type of an allocator (RM 13.14(13))
3939 if Present (Desig_Typ) then
3940 Freeze_Before (P, Desig_Typ);
3943 -- Freeze type of expression (RM 13.14(10)). Note that we took care of
3944 -- the enumeration representation clause exception in the loop above.
3946 if Present (Typ) then
3947 Freeze_Before (P, Typ);
3950 -- Freeze name if one is present (RM 13.14(11))
3952 if Present (Nam) then
3953 Freeze_Before (P, Nam);
3956 In_Default_Expression := In_Def_Exp;
3957 end Freeze_Expression;
3959 -----------------------------
3960 -- Freeze_Fixed_Point_Type --
3961 -----------------------------
3963 -- Certain fixed-point types and subtypes, including implicit base types
3964 -- and declared first subtypes, have not yet set up a range. This is
3965 -- because the range cannot be set until the Small and Size values are
3966 -- known, and these are not known till the type is frozen.
3968 -- To signal this case, Scalar_Range contains an unanalyzed syntactic range
3969 -- whose bounds are unanalyzed real literals. This routine will recognize
3970 -- this case, and transform this range node into a properly typed range
3971 -- with properly analyzed and resolved values.
3973 procedure Freeze_Fixed_Point_Type (Typ : Entity_Id) is
3974 Rng : constant Node_Id := Scalar_Range (Typ);
3975 Lo : constant Node_Id := Low_Bound (Rng);
3976 Hi : constant Node_Id := High_Bound (Rng);
3977 Btyp : constant Entity_Id := Base_Type (Typ);
3978 Brng : constant Node_Id := Scalar_Range (Btyp);
3979 BLo : constant Node_Id := Low_Bound (Brng);
3980 BHi : constant Node_Id := High_Bound (Brng);
3981 Small : constant Ureal := Small_Value (Typ);
3988 function Fsize (Lov, Hiv : Ureal) return Nat;
3989 -- Returns size of type with given bounds. Also leaves these
3990 -- bounds set as the current bounds of the Typ.
3996 function Fsize (Lov, Hiv : Ureal) return Nat is
3998 Set_Realval (Lo, Lov);
3999 Set_Realval (Hi, Hiv);
4000 return Minimum_Size (Typ);
4003 -- Start of processing for Freeze_Fixed_Point_Type
4006 -- If Esize of a subtype has not previously been set, set it now
4008 if Unknown_Esize (Typ) then
4009 Atype := Ancestor_Subtype (Typ);
4011 if Present (Atype) then
4012 Set_Esize (Typ, Esize (Atype));
4014 Set_Esize (Typ, Esize (Base_Type (Typ)));
4018 -- Immediate return if the range is already analyzed. This means that
4019 -- the range is already set, and does not need to be computed by this
4022 if Analyzed (Rng) then
4026 -- Immediate return if either of the bounds raises Constraint_Error
4028 if Raises_Constraint_Error (Lo)
4029 or else Raises_Constraint_Error (Hi)
4034 Loval := Realval (Lo);
4035 Hival := Realval (Hi);
4037 -- Ordinary fixed-point case
4039 if Is_Ordinary_Fixed_Point_Type (Typ) then
4041 -- For the ordinary fixed-point case, we are allowed to fudge the
4042 -- end-points up or down by small. Generally we prefer to fudge up,
4043 -- i.e. widen the bounds for non-model numbers so that the end points
4044 -- are included. However there are cases in which this cannot be
4045 -- done, and indeed cases in which we may need to narrow the bounds.
4046 -- The following circuit makes the decision.
4048 -- Note: our terminology here is that Incl_EP means that the bounds
4049 -- are widened by Small if necessary to include the end points, and
4050 -- Excl_EP means that the bounds are narrowed by Small to exclude the
4051 -- end-points if this reduces the size.
4053 -- Note that in the Incl case, all we care about is including the
4054 -- end-points. In the Excl case, we want to narrow the bounds as
4055 -- much as permitted by the RM, to give the smallest possible size.
4058 Loval_Incl_EP : Ureal;
4059 Hival_Incl_EP : Ureal;
4061 Loval_Excl_EP : Ureal;
4062 Hival_Excl_EP : Ureal;
4068 First_Subt : Entity_Id;
4073 -- First step. Base types are required to be symmetrical. Right
4074 -- now, the base type range is a copy of the first subtype range.
4075 -- This will be corrected before we are done, but right away we
4076 -- need to deal with the case where both bounds are non-negative.
4077 -- In this case, we set the low bound to the negative of the high
4078 -- bound, to make sure that the size is computed to include the
4079 -- required sign. Note that we do not need to worry about the
4080 -- case of both bounds negative, because the sign will be dealt
4081 -- with anyway. Furthermore we can't just go making such a bound
4082 -- symmetrical, since in a twos-complement system, there is an
4083 -- extra negative value which could not be accomodated on the
4087 and then not UR_Is_Negative (Loval)
4088 and then Hival > Loval
4091 Set_Realval (Lo, Loval);
4094 -- Compute the fudged bounds. If the number is a model number,
4095 -- then we do nothing to include it, but we are allowed to backoff
4096 -- to the next adjacent model number when we exclude it. If it is
4097 -- not a model number then we straddle the two values with the
4098 -- model numbers on either side.
4100 Model_Num := UR_Trunc (Loval / Small) * Small;
4102 if Loval = Model_Num then
4103 Loval_Incl_EP := Model_Num;
4105 Loval_Incl_EP := Model_Num - Small;
4108 -- The low value excluding the end point is Small greater, but
4109 -- we do not do this exclusion if the low value is positive,
4110 -- since it can't help the size and could actually hurt by
4111 -- crossing the high bound.
4113 if UR_Is_Negative (Loval_Incl_EP) then
4114 Loval_Excl_EP := Loval_Incl_EP + Small;
4116 Loval_Excl_EP := Loval_Incl_EP;
4119 -- Similar processing for upper bound and high value
4121 Model_Num := UR_Trunc (Hival / Small) * Small;
4123 if Hival = Model_Num then
4124 Hival_Incl_EP := Model_Num;
4126 Hival_Incl_EP := Model_Num + Small;
4129 if UR_Is_Positive (Hival_Incl_EP) then
4130 Hival_Excl_EP := Hival_Incl_EP - Small;
4132 Hival_Excl_EP := Hival_Incl_EP;
4135 -- One further adjustment is needed. In the case of subtypes, we
4136 -- cannot go outside the range of the base type, or we get
4137 -- peculiarities, and the base type range is already set. This
4138 -- only applies to the Incl values, since clearly the Excl values
4139 -- are already as restricted as they are allowed to be.
4142 Loval_Incl_EP := UR_Max (Loval_Incl_EP, Realval (BLo));
4143 Hival_Incl_EP := UR_Min (Hival_Incl_EP, Realval (BHi));
4146 -- Get size including and excluding end points
4148 Size_Incl_EP := Fsize (Loval_Incl_EP, Hival_Incl_EP);
4149 Size_Excl_EP := Fsize (Loval_Excl_EP, Hival_Excl_EP);
4151 -- No need to exclude end-points if it does not reduce size
4153 if Fsize (Loval_Incl_EP, Hival_Excl_EP) = Size_Excl_EP then
4154 Loval_Excl_EP := Loval_Incl_EP;
4157 if Fsize (Loval_Excl_EP, Hival_Incl_EP) = Size_Excl_EP then
4158 Hival_Excl_EP := Hival_Incl_EP;
4161 -- Now we set the actual size to be used. We want to use the
4162 -- bounds fudged up to include the end-points but only if this
4163 -- can be done without violating a specifically given size
4164 -- size clause or causing an unacceptable increase in size.
4166 -- Case of size clause given
4168 if Has_Size_Clause (Typ) then
4170 -- Use the inclusive size only if it is consistent with
4171 -- the explicitly specified size.
4173 if Size_Incl_EP <= RM_Size (Typ) then
4174 Actual_Lo := Loval_Incl_EP;
4175 Actual_Hi := Hival_Incl_EP;
4176 Actual_Size := Size_Incl_EP;
4178 -- If the inclusive size is too large, we try excluding
4179 -- the end-points (will be caught later if does not work).
4182 Actual_Lo := Loval_Excl_EP;
4183 Actual_Hi := Hival_Excl_EP;
4184 Actual_Size := Size_Excl_EP;
4187 -- Case of size clause not given
4190 -- If we have a base type whose corresponding first subtype
4191 -- has an explicit size that is large enough to include our
4192 -- end-points, then do so. There is no point in working hard
4193 -- to get a base type whose size is smaller than the specified
4194 -- size of the first subtype.
4196 First_Subt := First_Subtype (Typ);
4198 if Has_Size_Clause (First_Subt)
4199 and then Size_Incl_EP <= Esize (First_Subt)
4201 Actual_Size := Size_Incl_EP;
4202 Actual_Lo := Loval_Incl_EP;
4203 Actual_Hi := Hival_Incl_EP;
4205 -- If excluding the end-points makes the size smaller and
4206 -- results in a size of 8,16,32,64, then we take the smaller
4207 -- size. For the 64 case, this is compulsory. For the other
4208 -- cases, it seems reasonable. We like to include end points
4209 -- if we can, but not at the expense of moving to the next
4210 -- natural boundary of size.
4212 elsif Size_Incl_EP /= Size_Excl_EP
4214 (Size_Excl_EP = 8 or else
4215 Size_Excl_EP = 16 or else
4216 Size_Excl_EP = 32 or else
4219 Actual_Size := Size_Excl_EP;
4220 Actual_Lo := Loval_Excl_EP;
4221 Actual_Hi := Hival_Excl_EP;
4223 -- Otherwise we can definitely include the end points
4226 Actual_Size := Size_Incl_EP;
4227 Actual_Lo := Loval_Incl_EP;
4228 Actual_Hi := Hival_Incl_EP;
4231 -- One pathological case: normally we never fudge a low bound
4232 -- down, since it would seem to increase the size (if it has
4233 -- any effect), but for ranges containing single value, or no
4234 -- values, the high bound can be small too large. Consider:
4236 -- type t is delta 2.0**(-14)
4237 -- range 131072.0 .. 0;
4239 -- That lower bound is *just* outside the range of 32 bits, and
4240 -- does need fudging down in this case. Note that the bounds
4241 -- will always have crossed here, since the high bound will be
4242 -- fudged down if necessary, as in the case of:
4244 -- type t is delta 2.0**(-14)
4245 -- range 131072.0 .. 131072.0;
4247 -- So we detect the situation by looking for crossed bounds,
4248 -- and if the bounds are crossed, and the low bound is greater
4249 -- than zero, we will always back it off by small, since this
4250 -- is completely harmless.
4252 if Actual_Lo > Actual_Hi then
4253 if UR_Is_Positive (Actual_Lo) then
4254 Actual_Lo := Loval_Incl_EP - Small;
4255 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4257 -- And of course, we need to do exactly the same parallel
4258 -- fudge for flat ranges in the negative region.
4260 elsif UR_Is_Negative (Actual_Hi) then
4261 Actual_Hi := Hival_Incl_EP + Small;
4262 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4267 Set_Realval (Lo, Actual_Lo);
4268 Set_Realval (Hi, Actual_Hi);
4271 -- For the decimal case, none of this fudging is required, since there
4272 -- are no end-point problems in the decimal case (the end-points are
4273 -- always included).
4276 Actual_Size := Fsize (Loval, Hival);
4279 -- At this stage, the actual size has been calculated and the proper
4280 -- required bounds are stored in the low and high bounds.
4282 if Actual_Size > 64 then
4283 Error_Msg_Uint_1 := UI_From_Int (Actual_Size);
4285 ("size required (^) for type& too large, maximum allowed is 64",
4290 -- Check size against explicit given size
4292 if Has_Size_Clause (Typ) then
4293 if Actual_Size > RM_Size (Typ) then
4294 Error_Msg_Uint_1 := RM_Size (Typ);
4295 Error_Msg_Uint_2 := UI_From_Int (Actual_Size);
4297 ("size given (^) for type& too small, minimum allowed is ^",
4298 Size_Clause (Typ), Typ);
4301 Actual_Size := UI_To_Int (Esize (Typ));
4304 -- Increase size to next natural boundary if no size clause given
4307 if Actual_Size <= 8 then
4309 elsif Actual_Size <= 16 then
4311 elsif Actual_Size <= 32 then
4317 Init_Esize (Typ, Actual_Size);
4318 Adjust_Esize_For_Alignment (Typ);
4321 -- If we have a base type, then expand the bounds so that they extend to
4322 -- the full width of the allocated size in bits, to avoid junk range
4323 -- checks on intermediate computations.
4325 if Base_Type (Typ) = Typ then
4326 Set_Realval (Lo, -(Small * (Uint_2 ** (Actual_Size - 1))));
4327 Set_Realval (Hi, (Small * (Uint_2 ** (Actual_Size - 1) - 1)));
4330 -- Final step is to reanalyze the bounds using the proper type
4331 -- and set the Corresponding_Integer_Value fields of the literals.
4333 Set_Etype (Lo, Empty);
4334 Set_Analyzed (Lo, False);
4337 -- Resolve with universal fixed if the base type, and the base type if
4338 -- it is a subtype. Note we can't resolve the base type with itself,
4339 -- that would be a reference before definition.
4342 Resolve (Lo, Universal_Fixed);
4347 -- Set corresponding integer value for bound
4349 Set_Corresponding_Integer_Value
4350 (Lo, UR_To_Uint (Realval (Lo) / Small));
4352 -- Similar processing for high bound
4354 Set_Etype (Hi, Empty);
4355 Set_Analyzed (Hi, False);
4359 Resolve (Hi, Universal_Fixed);
4364 Set_Corresponding_Integer_Value
4365 (Hi, UR_To_Uint (Realval (Hi) / Small));
4367 -- Set type of range to correspond to bounds
4369 Set_Etype (Rng, Etype (Lo));
4371 -- Set Esize to calculated size if not set already
4373 if Unknown_Esize (Typ) then
4374 Init_Esize (Typ, Actual_Size);
4377 -- Set RM_Size if not already set. If already set, check value
4380 Minsiz : constant Uint := UI_From_Int (Minimum_Size (Typ));
4383 if RM_Size (Typ) /= Uint_0 then
4384 if RM_Size (Typ) < Minsiz then
4385 Error_Msg_Uint_1 := RM_Size (Typ);
4386 Error_Msg_Uint_2 := Minsiz;
4388 ("size given (^) for type& too small, minimum allowed is ^",
4389 Size_Clause (Typ), Typ);
4393 Set_RM_Size (Typ, Minsiz);
4396 end Freeze_Fixed_Point_Type;
4402 procedure Freeze_Itype (T : Entity_Id; N : Node_Id) is
4406 Set_Has_Delayed_Freeze (T);
4407 L := Freeze_Entity (T, Sloc (N));
4409 if Is_Non_Empty_List (L) then
4410 Insert_Actions (N, L);
4414 --------------------------
4415 -- Freeze_Static_Object --
4416 --------------------------
4418 procedure Freeze_Static_Object (E : Entity_Id) is
4420 Cannot_Be_Static : exception;
4421 -- Exception raised if the type of a static object cannot be made
4422 -- static. This happens if the type depends on non-global objects.
4424 procedure Ensure_Expression_Is_SA (N : Node_Id);
4425 -- Called to ensure that an expression used as part of a type definition
4426 -- is statically allocatable, which means that the expression type is
4427 -- statically allocatable, and the expression is either static, or a
4428 -- reference to a library level constant.
4430 procedure Ensure_Type_Is_SA (Typ : Entity_Id);
4431 -- Called to mark a type as static, checking that it is possible
4432 -- to set the type as static. If it is not possible, then the
4433 -- exception Cannot_Be_Static is raised.
4435 -----------------------------
4436 -- Ensure_Expression_Is_SA --
4437 -----------------------------
4439 procedure Ensure_Expression_Is_SA (N : Node_Id) is
4443 Ensure_Type_Is_SA (Etype (N));
4445 if Is_Static_Expression (N) then
4448 elsif Nkind (N) = N_Identifier then
4452 and then Ekind (Ent) = E_Constant
4453 and then Is_Library_Level_Entity (Ent)
4459 raise Cannot_Be_Static;
4460 end Ensure_Expression_Is_SA;
4462 -----------------------
4463 -- Ensure_Type_Is_SA --
4464 -----------------------
4466 procedure Ensure_Type_Is_SA (Typ : Entity_Id) is
4471 -- If type is library level, we are all set
4473 if Is_Library_Level_Entity (Typ) then
4477 -- We are also OK if the type already marked as statically allocated,
4478 -- which means we processed it before.
4480 if Is_Statically_Allocated (Typ) then
4484 -- Mark type as statically allocated
4486 Set_Is_Statically_Allocated (Typ);
4488 -- Check that it is safe to statically allocate this type
4490 if Is_Scalar_Type (Typ) or else Is_Real_Type (Typ) then
4491 Ensure_Expression_Is_SA (Type_Low_Bound (Typ));
4492 Ensure_Expression_Is_SA (Type_High_Bound (Typ));
4494 elsif Is_Array_Type (Typ) then
4495 N := First_Index (Typ);
4496 while Present (N) loop
4497 Ensure_Type_Is_SA (Etype (N));
4501 Ensure_Type_Is_SA (Component_Type (Typ));
4503 elsif Is_Access_Type (Typ) then
4504 if Ekind (Designated_Type (Typ)) = E_Subprogram_Type then
4508 T : constant Entity_Id := Etype (Designated_Type (Typ));
4511 if T /= Standard_Void_Type then
4512 Ensure_Type_Is_SA (T);
4515 F := First_Formal (Designated_Type (Typ));
4517 while Present (F) loop
4518 Ensure_Type_Is_SA (Etype (F));
4524 Ensure_Type_Is_SA (Designated_Type (Typ));
4527 elsif Is_Record_Type (Typ) then
4528 C := First_Entity (Typ);
4529 while Present (C) loop
4530 if Ekind (C) = E_Discriminant
4531 or else Ekind (C) = E_Component
4533 Ensure_Type_Is_SA (Etype (C));
4535 elsif Is_Type (C) then
4536 Ensure_Type_Is_SA (C);
4542 elsif Ekind (Typ) = E_Subprogram_Type then
4543 Ensure_Type_Is_SA (Etype (Typ));
4545 C := First_Formal (Typ);
4546 while Present (C) loop
4547 Ensure_Type_Is_SA (Etype (C));
4552 raise Cannot_Be_Static;
4554 end Ensure_Type_Is_SA;
4556 -- Start of processing for Freeze_Static_Object
4559 Ensure_Type_Is_SA (Etype (E));
4561 -- Reset True_Constant flag, since something strange is going on with
4562 -- the scoping here, and our simple value tracing may not be sufficient
4563 -- for this indication to be reliable. We kill the Constant_Value
4564 -- and Last_Assignment indications for the same reason.
4566 Set_Is_True_Constant (E, False);
4567 Set_Current_Value (E, Empty);
4569 if Ekind (E) = E_Variable then
4570 Set_Last_Assignment (E, Empty);
4574 when Cannot_Be_Static =>
4576 -- If the object that cannot be static is imported or exported,
4577 -- then we give an error message saying that this object cannot
4578 -- be imported or exported.
4580 if Is_Imported (E) then
4582 ("& cannot be imported (local type is not constant)", E);
4584 -- Otherwise must be exported, something is wrong if compiler
4585 -- is marking something as statically allocated which cannot be).
4587 else pragma Assert (Is_Exported (E));
4589 ("& cannot be exported (local type is not constant)", E);
4591 end Freeze_Static_Object;
4593 -----------------------
4594 -- Freeze_Subprogram --
4595 -----------------------
4597 procedure Freeze_Subprogram (E : Entity_Id) is
4602 -- Subprogram may not have an address clause unless it is imported
4604 if Present (Address_Clause (E)) then
4605 if not Is_Imported (E) then
4607 ("address clause can only be given " &
4608 "for imported subprogram",
4609 Name (Address_Clause (E)));
4613 -- Reset the Pure indication on an imported subprogram unless an
4614 -- explicit Pure_Function pragma was present. We do this because
4615 -- otherwise it is an insidious error to call a non-pure function from
4616 -- pure unit and have calls mysteriously optimized away. What happens
4617 -- here is that the Import can bypass the normal check to ensure that
4618 -- pure units call only pure subprograms.
4621 and then Is_Pure (E)
4622 and then not Has_Pragma_Pure_Function (E)
4624 Set_Is_Pure (E, False);
4627 -- For non-foreign convention subprograms, this is where we create
4628 -- the extra formals (for accessibility level and constrained bit
4629 -- information). We delay this till the freeze point precisely so
4630 -- that we know the convention!
4632 if not Has_Foreign_Convention (E) then
4633 Create_Extra_Formals (E);
4636 -- If this is convention Ada and a Valued_Procedure, that's odd
4638 if Ekind (E) = E_Procedure
4639 and then Is_Valued_Procedure (E)
4640 and then Convention (E) = Convention_Ada
4641 and then Warn_On_Export_Import
4644 ("?Valued_Procedure has no effect for convention Ada", E);
4645 Set_Is_Valued_Procedure (E, False);
4648 -- Case of foreign convention
4653 -- For foreign conventions, warn about return of an
4654 -- unconstrained array.
4656 -- Note: we *do* allow a return by descriptor for the VMS case,
4657 -- though here there is probably more to be done ???
4659 if Ekind (E) = E_Function then
4660 Retype := Underlying_Type (Etype (E));
4662 -- If no return type, probably some other error, e.g. a
4663 -- missing full declaration, so ignore.
4668 -- If the return type is generic, we have emitted a warning
4669 -- earlier on, and there is nothing else to check here. Specific
4670 -- instantiations may lead to erroneous behavior.
4672 elsif Is_Generic_Type (Etype (E)) then
4675 elsif Is_Array_Type (Retype)
4676 and then not Is_Constrained (Retype)
4677 and then Mechanism (E) not in Descriptor_Codes
4678 and then Warn_On_Export_Import
4681 ("?foreign convention function& should not return " &
4682 "unconstrained array", E);
4687 -- If any of the formals for an exported foreign convention
4688 -- subprogram have defaults, then emit an appropriate warning since
4689 -- this is odd (default cannot be used from non-Ada code)
4691 if Is_Exported (E) then
4692 F := First_Formal (E);
4693 while Present (F) loop
4694 if Warn_On_Export_Import
4695 and then Present (Default_Value (F))
4698 ("?parameter cannot be defaulted in non-Ada call",
4707 -- For VMS, descriptor mechanisms for parameters are allowed only
4708 -- for imported/exported subprograms. Moreover, the NCA descriptor
4709 -- is not allowed for parameters of exported subprograms.
4711 if OpenVMS_On_Target then
4712 if Is_Exported (E) then
4713 F := First_Formal (E);
4714 while Present (F) loop
4715 if Mechanism (F) = By_Descriptor_NCA then
4717 ("'N'C'A' descriptor for parameter not permitted", F);
4719 ("\can only be used for imported subprogram", F);
4725 elsif not Is_Imported (E) then
4726 F := First_Formal (E);
4727 while Present (F) loop
4728 if Mechanism (F) in Descriptor_Codes then
4730 ("descriptor mechanism for parameter not permitted", F);
4732 ("\can only be used for imported/exported subprogram", F);
4740 -- Pragma Inline_Always is disallowed for dispatching subprograms
4741 -- because the address of such subprograms is saved in the dispatch
4742 -- table to support dispatching calls, and dispatching calls cannot
4743 -- be inlined. This is consistent with the restriction against using
4744 -- 'Access or 'Address on an Inline_Always subprogram.
4746 if Is_Dispatching_Operation (E) and then Is_Always_Inlined (E) then
4748 ("pragma Inline_Always not allowed for dispatching subprograms", E);
4750 end Freeze_Subprogram;
4752 ----------------------
4753 -- Is_Fully_Defined --
4754 ----------------------
4756 function Is_Fully_Defined (T : Entity_Id) return Boolean is
4758 if Ekind (T) = E_Class_Wide_Type then
4759 return Is_Fully_Defined (Etype (T));
4761 elsif Is_Array_Type (T) then
4762 return Is_Fully_Defined (Component_Type (T));
4764 elsif Is_Record_Type (T)
4765 and not Is_Private_Type (T)
4767 -- Verify that the record type has no components with private types
4768 -- without completion.
4774 Comp := First_Component (T);
4776 while Present (Comp) loop
4777 if not Is_Fully_Defined (Etype (Comp)) then
4781 Next_Component (Comp);
4786 else return not Is_Private_Type (T)
4787 or else Present (Full_View (Base_Type (T)));
4789 end Is_Fully_Defined;
4791 ---------------------------------
4792 -- Process_Default_Expressions --
4793 ---------------------------------
4795 procedure Process_Default_Expressions
4797 After : in out Node_Id)
4799 Loc : constant Source_Ptr := Sloc (E);
4806 Set_Default_Expressions_Processed (E);
4808 -- A subprogram instance and its associated anonymous subprogram share
4809 -- their signature. The default expression functions are defined in the
4810 -- wrapper packages for the anonymous subprogram, and should not be
4811 -- generated again for the instance.
4813 if Is_Generic_Instance (E)
4814 and then Present (Alias (E))
4815 and then Default_Expressions_Processed (Alias (E))
4820 Formal := First_Formal (E);
4822 while Present (Formal) loop
4823 if Present (Default_Value (Formal)) then
4825 -- We work with a copy of the default expression because we
4826 -- do not want to disturb the original, since this would mess
4827 -- up the conformance checking.
4829 Dcopy := New_Copy_Tree (Default_Value (Formal));
4831 -- The analysis of the expression may generate insert actions,
4832 -- which of course must not be executed. We wrap those actions
4833 -- in a procedure that is not called, and later on eliminated.
4834 -- The following cases have no side-effects, and are analyzed
4837 if Nkind (Dcopy) = N_Identifier
4838 or else Nkind (Dcopy) = N_Expanded_Name
4839 or else Nkind (Dcopy) = N_Integer_Literal
4840 or else (Nkind (Dcopy) = N_Real_Literal
4841 and then not Vax_Float (Etype (Dcopy)))
4842 or else Nkind (Dcopy) = N_Character_Literal
4843 or else Nkind (Dcopy) = N_String_Literal
4844 or else Nkind (Dcopy) = N_Null
4845 or else (Nkind (Dcopy) = N_Attribute_Reference
4847 Attribute_Name (Dcopy) = Name_Null_Parameter)
4850 -- If there is no default function, we must still do a full
4851 -- analyze call on the default value, to ensure that all error
4852 -- checks are performed, e.g. those associated with static
4853 -- evaluation. Note: this branch will always be taken if the
4854 -- analyzer is turned off (but we still need the error checks).
4856 -- Note: the setting of parent here is to meet the requirement
4857 -- that we can only analyze the expression while attached to
4858 -- the tree. Really the requirement is that the parent chain
4859 -- be set, we don't actually need to be in the tree.
4861 Set_Parent (Dcopy, Declaration_Node (Formal));
4864 -- Default expressions are resolved with their own type if the
4865 -- context is generic, to avoid anomalies with private types.
4867 if Ekind (Scope (E)) = E_Generic_Package then
4870 Resolve (Dcopy, Etype (Formal));
4873 -- If that resolved expression will raise constraint error,
4874 -- then flag the default value as raising constraint error.
4875 -- This allows a proper error message on the calls.
4877 if Raises_Constraint_Error (Dcopy) then
4878 Set_Raises_Constraint_Error (Default_Value (Formal));
4881 -- If the default is a parameterless call, we use the name of
4882 -- the called function directly, and there is no body to build.
4884 elsif Nkind (Dcopy) = N_Function_Call
4885 and then No (Parameter_Associations (Dcopy))
4889 -- Else construct and analyze the body of a wrapper procedure
4890 -- that contains an object declaration to hold the expression.
4891 -- Given that this is done only to complete the analysis, it
4892 -- simpler to build a procedure than a function which might
4893 -- involve secondary stack expansion.
4897 Make_Defining_Identifier (Loc, New_Internal_Name ('D'));
4900 Make_Subprogram_Body (Loc,
4902 Make_Procedure_Specification (Loc,
4903 Defining_Unit_Name => Dnam),
4905 Declarations => New_List (
4906 Make_Object_Declaration (Loc,
4907 Defining_Identifier =>
4908 Make_Defining_Identifier (Loc,
4909 New_Internal_Name ('T')),
4910 Object_Definition =>
4911 New_Occurrence_Of (Etype (Formal), Loc),
4912 Expression => New_Copy_Tree (Dcopy))),
4914 Handled_Statement_Sequence =>
4915 Make_Handled_Sequence_Of_Statements (Loc,
4916 Statements => New_List));
4918 Set_Scope (Dnam, Scope (E));
4919 Set_Assignment_OK (First (Declarations (Dbody)));
4920 Set_Is_Eliminated (Dnam);
4921 Insert_After (After, Dbody);
4927 Next_Formal (Formal);
4930 end Process_Default_Expressions;
4932 ----------------------------------------
4933 -- Set_Component_Alignment_If_Not_Set --
4934 ----------------------------------------
4936 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id) is
4938 -- Ignore if not base type, subtypes don't need anything
4940 if Typ /= Base_Type (Typ) then
4944 -- Do not override existing representation
4946 if Is_Packed (Typ) then
4949 elsif Has_Specified_Layout (Typ) then
4952 elsif Component_Alignment (Typ) /= Calign_Default then
4956 Set_Component_Alignment
4957 (Typ, Scope_Stack.Table
4958 (Scope_Stack.Last).Component_Alignment_Default);
4960 end Set_Component_Alignment_If_Not_Set;
4962 ---------------------------
4963 -- Set_Debug_Info_Needed --
4964 ---------------------------
4966 procedure Set_Debug_Info_Needed (T : Entity_Id) is
4969 or else Needs_Debug_Info (T)
4970 or else Debug_Info_Off (T)
4974 Set_Needs_Debug_Info (T);
4977 if Is_Object (T) then
4978 Set_Debug_Info_Needed (Etype (T));
4980 elsif Is_Type (T) then
4981 Set_Debug_Info_Needed (Etype (T));
4983 if Is_Record_Type (T) then
4985 Ent : Entity_Id := First_Entity (T);
4987 while Present (Ent) loop
4988 Set_Debug_Info_Needed (Ent);
4993 elsif Is_Array_Type (T) then
4994 Set_Debug_Info_Needed (Component_Type (T));
4997 Indx : Node_Id := First_Index (T);
4999 while Present (Indx) loop
5000 Set_Debug_Info_Needed (Etype (Indx));
5001 Indx := Next_Index (Indx);
5005 if Is_Packed (T) then
5006 Set_Debug_Info_Needed (Packed_Array_Type (T));
5009 elsif Is_Access_Type (T) then
5010 Set_Debug_Info_Needed (Directly_Designated_Type (T));
5012 elsif Is_Private_Type (T) then
5013 Set_Debug_Info_Needed (Full_View (T));
5015 elsif Is_Protected_Type (T) then
5016 Set_Debug_Info_Needed (Corresponding_Record_Type (T));
5019 end Set_Debug_Info_Needed;
5025 procedure Undelay_Type (T : Entity_Id) is
5027 Set_Has_Delayed_Freeze (T, False);
5028 Set_Freeze_Node (T, Empty);
5030 -- Since we don't want T to have a Freeze_Node, we don't want its
5031 -- Full_View or Corresponding_Record_Type to have one either.
5033 -- ??? Fundamentally, this whole handling is a kludge. What we really
5034 -- want is to be sure that for an Itype that's part of record R and is a
5035 -- subtype of type T, that it's frozen after the later of the freeze
5036 -- points of R and T. We have no way of doing that directly, so what we
5037 -- do is force most such Itypes to be frozen as part of freezing R via
5038 -- this procedure and only delay the ones that need to be delayed
5039 -- (mostly the designated types of access types that are defined as part
5042 if Is_Private_Type (T)
5043 and then Present (Full_View (T))
5044 and then Is_Itype (Full_View (T))
5045 and then Is_Record_Type (Scope (Full_View (T)))
5047 Undelay_Type (Full_View (T));
5050 if Is_Concurrent_Type (T)
5051 and then Present (Corresponding_Record_Type (T))
5052 and then Is_Itype (Corresponding_Record_Type (T))
5053 and then Is_Record_Type (Scope (Corresponding_Record_Type (T)))
5055 Undelay_Type (Corresponding_Record_Type (T));
5063 procedure Warn_Overlay
5068 Ent : constant Entity_Id := Entity (Nam);
5069 -- The object to which the address clause applies
5072 Old : Entity_Id := Empty;
5076 -- No warning if address clause overlay warnings are off
5078 if not Address_Clause_Overlay_Warnings then
5082 -- No warning if there is an explicit initialization
5084 Init := Original_Node (Expression (Declaration_Node (Ent)));
5086 if Present (Init) and then Comes_From_Source (Init) then
5090 -- We only give the warning for non-imported entities of a type for
5091 -- which a non-null base init proc is defined (or for access types which
5092 -- have implicit null initialization).
5095 and then (Has_Non_Null_Base_Init_Proc (Typ)
5096 or else Is_Access_Type (Typ))
5097 and then not Is_Imported (Ent)
5099 if Nkind (Expr) = N_Attribute_Reference
5100 and then Is_Entity_Name (Prefix (Expr))
5102 Old := Entity (Prefix (Expr));
5104 elsif Is_Entity_Name (Expr)
5105 and then Ekind (Entity (Expr)) = E_Constant
5107 Decl := Declaration_Node (Entity (Expr));
5109 if Nkind (Decl) = N_Object_Declaration
5110 and then Present (Expression (Decl))
5111 and then Nkind (Expression (Decl)) = N_Attribute_Reference
5112 and then Is_Entity_Name (Prefix (Expression (Decl)))
5114 Old := Entity (Prefix (Expression (Decl)));
5116 elsif Nkind (Expr) = N_Function_Call then
5120 -- A function call (most likely to To_Address) is probably not an
5121 -- overlay, so skip warning. Ditto if the function call was inlined
5122 -- and transformed into an entity.
5124 elsif Nkind (Original_Node (Expr)) = N_Function_Call then
5128 Decl := Next (Parent (Expr));
5130 -- If a pragma Import follows, we assume that it is for the current
5131 -- target of the address clause, and skip the warning.
5134 and then Nkind (Decl) = N_Pragma
5135 and then Chars (Decl) = Name_Import
5140 if Present (Old) then
5141 Error_Msg_Node_2 := Old;
5143 ("default initialization of & may modify &?",
5147 ("default initialization of & may modify overlaid storage?",
5151 -- Add friendly warning if initialization comes from a packed array
5154 if Is_Record_Type (Typ) then
5159 Comp := First_Component (Typ);
5161 while Present (Comp) loop
5162 if Nkind (Parent (Comp)) = N_Component_Declaration
5163 and then Present (Expression (Parent (Comp)))
5166 elsif Is_Array_Type (Etype (Comp))
5167 and then Present (Packed_Array_Type (Etype (Comp)))
5170 ("\packed array component& " &
5171 "will be initialized to zero?",
5175 Next_Component (Comp);
5182 ("\use pragma Import for & to " &
5183 "suppress initialization ('R'M B.1(24))?",
OSDN Git Service
