1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2011, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Debug; use Debug;
28 with Einfo; use Einfo;
29 with Elists; use Elists;
30 with Errout; use Errout;
31 with Exp_Ch3; use Exp_Ch3;
32 with Exp_Ch7; use Exp_Ch7;
33 with Exp_Disp; use Exp_Disp;
34 with Exp_Pakd; use Exp_Pakd;
35 with Exp_Util; use Exp_Util;
36 with Exp_Tss; use Exp_Tss;
37 with Layout; use Layout;
39 with Namet; use Namet;
40 with Nlists; use Nlists;
41 with Nmake; use Nmake;
43 with Restrict; use Restrict;
44 with Rident; use Rident;
46 with Sem_Aux; use Sem_Aux;
47 with Sem_Cat; use Sem_Cat;
48 with Sem_Ch6; use Sem_Ch6;
49 with Sem_Ch7; use Sem_Ch7;
50 with Sem_Ch8; use Sem_Ch8;
51 with Sem_Ch13; use Sem_Ch13;
52 with Sem_Eval; use Sem_Eval;
53 with Sem_Mech; use Sem_Mech;
54 with Sem_Prag; use Sem_Prag;
55 with Sem_Res; use Sem_Res;
56 with Sem_Util; use Sem_Util;
57 with Sinfo; use Sinfo;
58 with Snames; use Snames;
59 with Stand; use Stand;
60 with Targparm; use Targparm;
61 with Tbuild; use Tbuild;
62 with Ttypes; use Ttypes;
63 with Uintp; use Uintp;
64 with Urealp; use Urealp;
66 package body Freeze is
68 -----------------------
69 -- Local Subprograms --
70 -----------------------
72 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id);
73 -- Typ is a type that is being frozen. If no size clause is given,
74 -- but a default Esize has been computed, then this default Esize is
75 -- adjusted up if necessary to be consistent with a given alignment,
76 -- but never to a value greater than Long_Long_Integer'Size. This
77 -- is used for all discrete types and for fixed-point types.
79 procedure Build_And_Analyze_Renamed_Body
82 After : in out Node_Id);
83 -- Build body for a renaming declaration, insert in tree and analyze
85 procedure Check_Address_Clause (E : Entity_Id);
86 -- Apply legality checks to address clauses for object declarations,
87 -- at the point the object is frozen.
89 procedure Check_Strict_Alignment (E : Entity_Id);
90 -- E is a base type. If E is tagged or has a component that is aliased
91 -- or tagged or contains something this is aliased or tagged, set
94 procedure Check_Unsigned_Type (E : Entity_Id);
95 pragma Inline (Check_Unsigned_Type);
96 -- If E is a fixed-point or discrete type, then all the necessary work
97 -- to freeze it is completed except for possible setting of the flag
98 -- Is_Unsigned_Type, which is done by this procedure. The call has no
99 -- effect if the entity E is not a discrete or fixed-point type.
101 procedure Freeze_And_Append
104 Result : in out List_Id);
105 -- Freezes Ent using Freeze_Entity, and appends the resulting list of
106 -- nodes to Result, modifying Result from No_List if necessary. N has
107 -- the same usage as in Freeze_Entity.
109 procedure Freeze_Enumeration_Type (Typ : Entity_Id);
110 -- Freeze enumeration type. The Esize field is set as processing
111 -- proceeds (i.e. set by default when the type is declared and then
112 -- adjusted by rep clauses. What this procedure does is to make sure
113 -- that if a foreign convention is specified, and no specific size
114 -- is given, then the size must be at least Integer'Size.
116 procedure Freeze_Static_Object (E : Entity_Id);
117 -- If an object is frozen which has Is_Statically_Allocated set, then
118 -- all referenced types must also be marked with this flag. This routine
119 -- is in charge of meeting this requirement for the object entity E.
121 procedure Freeze_Subprogram (E : Entity_Id);
122 -- Perform freezing actions for a subprogram (create extra formals,
123 -- and set proper default mechanism values). Note that this routine
124 -- is not called for internal subprograms, for which neither of these
125 -- actions is needed (or desirable, we do not want for example to have
126 -- these extra formals present in initialization procedures, where they
127 -- would serve no purpose). In this call E is either a subprogram or
128 -- a subprogram type (i.e. an access to a subprogram).
130 function Is_Fully_Defined (T : Entity_Id) return Boolean;
131 -- True if T is not private and has no private components, or has a full
132 -- view. Used to determine whether the designated type of an access type
133 -- should be frozen when the access type is frozen. This is done when an
134 -- allocator is frozen, or an expression that may involve attributes of
135 -- the designated type. Otherwise freezing the access type does not freeze
136 -- the designated type.
138 procedure Process_Default_Expressions
140 After : in out Node_Id);
141 -- This procedure is called for each subprogram to complete processing of
142 -- default expressions at the point where all types are known to be frozen.
143 -- The expressions must be analyzed in full, to make sure that all error
144 -- processing is done (they have only been pre-analyzed). If the expression
145 -- is not an entity or literal, its analysis may generate code which must
146 -- not be executed. In that case we build a function body to hold that
147 -- code. This wrapper function serves no other purpose (it used to be
148 -- called to evaluate the default, but now the default is inlined at each
151 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id);
152 -- Typ is a record or array type that is being frozen. This routine sets
153 -- the default component alignment from the scope stack values if the
154 -- alignment is otherwise not specified.
156 procedure Check_Debug_Info_Needed (T : Entity_Id);
157 -- As each entity is frozen, this routine is called to deal with the
158 -- setting of Debug_Info_Needed for the entity. This flag is set if
159 -- the entity comes from source, or if we are in Debug_Generated_Code
160 -- mode or if the -gnatdV debug flag is set. However, it never sets
161 -- the flag if Debug_Info_Off is set. This procedure also ensures that
162 -- subsidiary entities have the flag set as required.
164 procedure Undelay_Type (T : Entity_Id);
165 -- T is a type of a component that we know to be an Itype. We don't want
166 -- this to have a Freeze_Node, so ensure it doesn't. Do the same for any
167 -- Full_View or Corresponding_Record_Type.
169 procedure Warn_Overlay
173 -- Expr is the expression for an address clause for entity Nam whose type
174 -- is Typ. If Typ has a default initialization, and there is no explicit
175 -- initialization in the source declaration, check whether the address
176 -- clause might cause overlaying of an entity, and emit a warning on the
177 -- side effect that the initialization will cause.
179 -------------------------------
180 -- Adjust_Esize_For_Alignment --
181 -------------------------------
183 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id) is
187 if Known_Esize (Typ) and then Known_Alignment (Typ) then
188 Align := Alignment_In_Bits (Typ);
190 if Align > Esize (Typ)
191 and then Align <= Standard_Long_Long_Integer_Size
193 Set_Esize (Typ, Align);
196 end Adjust_Esize_For_Alignment;
198 ------------------------------------
199 -- Build_And_Analyze_Renamed_Body --
200 ------------------------------------
202 procedure Build_And_Analyze_Renamed_Body
205 After : in out Node_Id)
207 Body_Decl : constant Node_Id := Unit_Declaration_Node (New_S);
208 Ent : constant Entity_Id := Defining_Entity (Decl);
210 Renamed_Subp : Entity_Id;
213 -- If the renamed subprogram is intrinsic, there is no need for a
214 -- wrapper body: we set the alias that will be called and expanded which
215 -- completes the declaration. This transformation is only legal if the
216 -- renamed entity has already been elaborated.
218 -- Note that it is legal for a renaming_as_body to rename an intrinsic
219 -- subprogram, as long as the renaming occurs before the new entity
220 -- is frozen. See RM 8.5.4 (5).
222 if Nkind (Body_Decl) = N_Subprogram_Renaming_Declaration
223 and then Is_Entity_Name (Name (Body_Decl))
225 Renamed_Subp := Entity (Name (Body_Decl));
227 Renamed_Subp := Empty;
230 if Present (Renamed_Subp)
231 and then Is_Intrinsic_Subprogram (Renamed_Subp)
233 (not In_Same_Source_Unit (Renamed_Subp, Ent)
234 or else Sloc (Renamed_Subp) < Sloc (Ent))
236 -- We can make the renaming entity intrinsic if the renamed function
237 -- has an interface name, or if it is one of the shift/rotate
238 -- operations known to the compiler.
240 and then (Present (Interface_Name (Renamed_Subp))
241 or else Chars (Renamed_Subp) = Name_Rotate_Left
242 or else Chars (Renamed_Subp) = Name_Rotate_Right
243 or else Chars (Renamed_Subp) = Name_Shift_Left
244 or else Chars (Renamed_Subp) = Name_Shift_Right
245 or else Chars (Renamed_Subp) = Name_Shift_Right_Arithmetic)
247 Set_Interface_Name (Ent, Interface_Name (Renamed_Subp));
249 if Present (Alias (Renamed_Subp)) then
250 Set_Alias (Ent, Alias (Renamed_Subp));
252 Set_Alias (Ent, Renamed_Subp);
255 Set_Is_Intrinsic_Subprogram (Ent);
256 Set_Has_Completion (Ent);
259 Body_Node := Build_Renamed_Body (Decl, New_S);
260 Insert_After (After, Body_Node);
261 Mark_Rewrite_Insertion (Body_Node);
265 end Build_And_Analyze_Renamed_Body;
267 ------------------------
268 -- Build_Renamed_Body --
269 ------------------------
271 function Build_Renamed_Body
273 New_S : Entity_Id) return Node_Id
275 Loc : constant Source_Ptr := Sloc (New_S);
276 -- We use for the source location of the renamed body, the location of
277 -- the spec entity. It might seem more natural to use the location of
278 -- the renaming declaration itself, but that would be wrong, since then
279 -- the body we create would look as though it was created far too late,
280 -- and this could cause problems with elaboration order analysis,
281 -- particularly in connection with instantiations.
283 N : constant Node_Id := Unit_Declaration_Node (New_S);
284 Nam : constant Node_Id := Name (N);
286 Spec : constant Node_Id := New_Copy_Tree (Specification (Decl));
287 Actuals : List_Id := No_List;
292 O_Formal : Entity_Id;
293 Param_Spec : Node_Id;
295 Pref : Node_Id := Empty;
296 -- If the renamed entity is a primitive operation given in prefix form,
297 -- the prefix is the target object and it has to be added as the first
298 -- actual in the generated call.
301 -- Determine the entity being renamed, which is the target of the call
302 -- statement. If the name is an explicit dereference, this is a renaming
303 -- of a subprogram type rather than a subprogram. The name itself is
306 if Nkind (Nam) = N_Selected_Component then
307 Old_S := Entity (Selector_Name (Nam));
309 elsif Nkind (Nam) = N_Explicit_Dereference then
310 Old_S := Etype (Nam);
312 elsif Nkind (Nam) = N_Indexed_Component then
313 if Is_Entity_Name (Prefix (Nam)) then
314 Old_S := Entity (Prefix (Nam));
316 Old_S := Entity (Selector_Name (Prefix (Nam)));
319 elsif Nkind (Nam) = N_Character_Literal then
320 Old_S := Etype (New_S);
323 Old_S := Entity (Nam);
326 if Is_Entity_Name (Nam) then
328 -- If the renamed entity is a predefined operator, retain full name
329 -- to ensure its visibility.
331 if Ekind (Old_S) = E_Operator
332 and then Nkind (Nam) = N_Expanded_Name
334 Call_Name := New_Copy (Name (N));
336 Call_Name := New_Reference_To (Old_S, Loc);
340 if Nkind (Nam) = N_Selected_Component
341 and then Present (First_Formal (Old_S))
343 (Is_Controlling_Formal (First_Formal (Old_S))
344 or else Is_Class_Wide_Type (Etype (First_Formal (Old_S))))
347 -- Retrieve the target object, to be added as a first actual
350 Call_Name := New_Occurrence_Of (Old_S, Loc);
351 Pref := Prefix (Nam);
354 Call_Name := New_Copy (Name (N));
357 -- Original name may have been overloaded, but is fully resolved now
359 Set_Is_Overloaded (Call_Name, False);
362 -- For simple renamings, subsequent calls can be expanded directly as
363 -- calls to the renamed entity. The body must be generated in any case
364 -- for calls that may appear elsewhere. This is not done in the case
365 -- where the subprogram is an instantiation because the actual proper
366 -- body has not been built yet.
368 if Ekind_In (Old_S, E_Function, E_Procedure)
369 and then Nkind (Decl) = N_Subprogram_Declaration
370 and then not Is_Generic_Instance (Old_S)
372 Set_Body_To_Inline (Decl, Old_S);
375 -- The body generated for this renaming is an internal artifact, and
376 -- does not constitute a freeze point for the called entity.
378 Set_Must_Not_Freeze (Call_Name);
380 Formal := First_Formal (Defining_Entity (Decl));
382 if Present (Pref) then
384 Pref_Type : constant Entity_Id := Etype (Pref);
385 Form_Type : constant Entity_Id := Etype (First_Formal (Old_S));
388 -- The controlling formal may be an access parameter, or the
389 -- actual may be an access value, so adjust accordingly.
391 if Is_Access_Type (Pref_Type)
392 and then not Is_Access_Type (Form_Type)
395 (Make_Explicit_Dereference (Loc, Relocate_Node (Pref)));
397 elsif Is_Access_Type (Form_Type)
398 and then not Is_Access_Type (Pref)
401 (Make_Attribute_Reference (Loc,
402 Attribute_Name => Name_Access,
403 Prefix => Relocate_Node (Pref)));
405 Actuals := New_List (Pref);
409 elsif Present (Formal) then
416 if Present (Formal) then
417 while Present (Formal) loop
418 Append (New_Reference_To (Formal, Loc), Actuals);
419 Next_Formal (Formal);
423 -- If the renamed entity is an entry, inherit its profile. For other
424 -- renamings as bodies, both profiles must be subtype conformant, so it
425 -- is not necessary to replace the profile given in the declaration.
426 -- However, default values that are aggregates are rewritten when
427 -- partially analyzed, so we recover the original aggregate to insure
428 -- that subsequent conformity checking works. Similarly, if the default
429 -- expression was constant-folded, recover the original expression.
431 Formal := First_Formal (Defining_Entity (Decl));
433 if Present (Formal) then
434 O_Formal := First_Formal (Old_S);
435 Param_Spec := First (Parameter_Specifications (Spec));
436 while Present (Formal) loop
437 if Is_Entry (Old_S) then
438 if Nkind (Parameter_Type (Param_Spec)) /=
441 Set_Etype (Formal, Etype (O_Formal));
442 Set_Entity (Parameter_Type (Param_Spec), Etype (O_Formal));
445 elsif Nkind (Default_Value (O_Formal)) = N_Aggregate
446 or else Nkind (Original_Node (Default_Value (O_Formal))) /=
447 Nkind (Default_Value (O_Formal))
449 Set_Expression (Param_Spec,
450 New_Copy_Tree (Original_Node (Default_Value (O_Formal))));
453 Next_Formal (Formal);
454 Next_Formal (O_Formal);
459 -- If the renamed entity is a function, the generated body contains a
460 -- return statement. Otherwise, build a procedure call. If the entity is
461 -- an entry, subsequent analysis of the call will transform it into the
462 -- proper entry or protected operation call. If the renamed entity is
463 -- a character literal, return it directly.
465 if Ekind (Old_S) = E_Function
466 or else Ekind (Old_S) = E_Operator
467 or else (Ekind (Old_S) = E_Subprogram_Type
468 and then Etype (Old_S) /= Standard_Void_Type)
471 Make_Simple_Return_Statement (Loc,
473 Make_Function_Call (Loc,
475 Parameter_Associations => Actuals));
477 elsif Ekind (Old_S) = E_Enumeration_Literal then
479 Make_Simple_Return_Statement (Loc,
480 Expression => New_Occurrence_Of (Old_S, Loc));
482 elsif Nkind (Nam) = N_Character_Literal then
484 Make_Simple_Return_Statement (Loc,
485 Expression => Call_Name);
489 Make_Procedure_Call_Statement (Loc,
491 Parameter_Associations => Actuals);
494 -- Create entities for subprogram body and formals
496 Set_Defining_Unit_Name (Spec,
497 Make_Defining_Identifier (Loc, Chars => Chars (New_S)));
499 Param_Spec := First (Parameter_Specifications (Spec));
500 while Present (Param_Spec) loop
501 Set_Defining_Identifier (Param_Spec,
502 Make_Defining_Identifier (Loc,
503 Chars => Chars (Defining_Identifier (Param_Spec))));
508 Make_Subprogram_Body (Loc,
509 Specification => Spec,
510 Declarations => New_List,
511 Handled_Statement_Sequence =>
512 Make_Handled_Sequence_Of_Statements (Loc,
513 Statements => New_List (Call_Node)));
515 if Nkind (Decl) /= N_Subprogram_Declaration then
517 Make_Subprogram_Declaration (Loc,
518 Specification => Specification (N)));
521 -- Link the body to the entity whose declaration it completes. If
522 -- the body is analyzed when the renamed entity is frozen, it may
523 -- be necessary to restore the proper scope (see package Exp_Ch13).
525 if Nkind (N) = N_Subprogram_Renaming_Declaration
526 and then Present (Corresponding_Spec (N))
528 Set_Corresponding_Spec (Body_Node, Corresponding_Spec (N));
530 Set_Corresponding_Spec (Body_Node, New_S);
534 end Build_Renamed_Body;
536 --------------------------
537 -- Check_Address_Clause --
538 --------------------------
540 procedure Check_Address_Clause (E : Entity_Id) is
541 Addr : constant Node_Id := Address_Clause (E);
543 Decl : constant Node_Id := Declaration_Node (E);
544 Typ : constant Entity_Id := Etype (E);
547 if Present (Addr) then
548 Expr := Expression (Addr);
550 if Needs_Constant_Address (Decl, Typ) then
551 Check_Constant_Address_Clause (Expr, E);
553 -- Has_Delayed_Freeze was set on E when the address clause was
554 -- analyzed. Reset the flag now unless freeze actions were
555 -- attached to it in the mean time.
557 if No (Freeze_Node (E)) then
558 Set_Has_Delayed_Freeze (E, False);
562 -- If Rep_Clauses are to be ignored, remove address clause from
563 -- list attached to entity, because it may be illegal for gigi,
564 -- for example by breaking order of elaboration..
566 if Ignore_Rep_Clauses then
571 Rep := First_Rep_Item (E);
574 Set_First_Rep_Item (E, Next_Rep_Item (Addr));
578 and then Next_Rep_Item (Rep) /= Addr
580 Rep := Next_Rep_Item (Rep);
584 if Present (Rep) then
585 Set_Next_Rep_Item (Rep, Next_Rep_Item (Addr));
589 Rewrite (Addr, Make_Null_Statement (Sloc (E)));
591 elsif not Error_Posted (Expr)
592 and then not Needs_Finalization (Typ)
594 Warn_Overlay (Expr, Typ, Name (Addr));
597 end Check_Address_Clause;
599 -----------------------------
600 -- Check_Compile_Time_Size --
601 -----------------------------
603 procedure Check_Compile_Time_Size (T : Entity_Id) is
605 procedure Set_Small_Size (T : Entity_Id; S : Uint);
606 -- Sets the compile time known size (32 bits or less) in the Esize
607 -- field, of T checking for a size clause that was given which attempts
608 -- to give a smaller size, and also checking for an alignment clause.
610 function Size_Known (T : Entity_Id) return Boolean;
611 -- Recursive function that does all the work
613 function Static_Discriminated_Components (T : Entity_Id) return Boolean;
614 -- If T is a constrained subtype, its size is not known if any of its
615 -- discriminant constraints is not static and it is not a null record.
616 -- The test is conservative and doesn't check that the components are
617 -- in fact constrained by non-static discriminant values. Could be made
624 procedure Set_Small_Size (T : Entity_Id; S : Uint) is
629 -- Check for bad size clause given
631 elsif Has_Size_Clause (T) then
632 if RM_Size (T) < S then
633 Error_Msg_Uint_1 := S;
635 ("size for& too small, minimum allowed is ^",
639 -- Set size if not set already
641 elsif Unknown_RM_Size (T) then
650 function Size_Known (T : Entity_Id) return Boolean is
658 if Size_Known_At_Compile_Time (T) then
661 -- Always True for scalar types. This is true even for generic formal
662 -- scalar types. We used to return False in the latter case, but the
663 -- size is known at compile time, even in the template, we just do
664 -- not know the exact size but that's not the point of this routine.
666 elsif Is_Scalar_Type (T)
667 or else Is_Task_Type (T)
673 elsif Is_Array_Type (T) then
675 -- String literals always have known size, and we can set it
677 if Ekind (T) = E_String_Literal_Subtype then
678 Set_Small_Size (T, Component_Size (T)
679 * String_Literal_Length (T));
682 -- Unconstrained types never have known at compile time size
684 elsif not Is_Constrained (T) then
687 -- Don't do any recursion on type with error posted, since we may
688 -- have a malformed type that leads us into a loop.
690 elsif Error_Posted (T) then
693 -- Otherwise if component size unknown, then array size unknown
695 elsif not Size_Known (Component_Type (T)) then
699 -- Check for all indexes static, and also compute possible size
700 -- (in case it is less than 32 and may be packable).
703 Esiz : Uint := Component_Size (T);
707 Index := First_Index (T);
708 while Present (Index) loop
709 if Nkind (Index) = N_Range then
710 Get_Index_Bounds (Index, Low, High);
712 elsif Error_Posted (Scalar_Range (Etype (Index))) then
716 Low := Type_Low_Bound (Etype (Index));
717 High := Type_High_Bound (Etype (Index));
720 if not Compile_Time_Known_Value (Low)
721 or else not Compile_Time_Known_Value (High)
722 or else Etype (Index) = Any_Type
727 Dim := Expr_Value (High) - Expr_Value (Low) + 1;
739 Set_Small_Size (T, Esiz);
743 -- Access types always have known at compile time sizes
745 elsif Is_Access_Type (T) then
748 -- For non-generic private types, go to underlying type if present
750 elsif Is_Private_Type (T)
751 and then not Is_Generic_Type (T)
752 and then Present (Underlying_Type (T))
754 -- Don't do any recursion on type with error posted, since we may
755 -- have a malformed type that leads us into a loop.
757 if Error_Posted (T) then
760 return Size_Known (Underlying_Type (T));
765 elsif Is_Record_Type (T) then
767 -- A class-wide type is never considered to have a known size
769 if Is_Class_Wide_Type (T) then
772 -- A subtype of a variant record must not have non-static
773 -- discriminated components.
775 elsif T /= Base_Type (T)
776 and then not Static_Discriminated_Components (T)
780 -- Don't do any recursion on type with error posted, since we may
781 -- have a malformed type that leads us into a loop.
783 elsif Error_Posted (T) then
787 -- Now look at the components of the record
790 -- The following two variables are used to keep track of the
791 -- size of packed records if we can tell the size of the packed
792 -- record in the front end. Packed_Size_Known is True if so far
793 -- we can figure out the size. It is initialized to True for a
794 -- packed record, unless the record has discriminants. The
795 -- reason we eliminate the discriminated case is that we don't
796 -- know the way the back end lays out discriminated packed
797 -- records. If Packed_Size_Known is True, then Packed_Size is
798 -- the size in bits so far.
800 Packed_Size_Known : Boolean :=
802 and then not Has_Discriminants (T);
804 Packed_Size : Uint := Uint_0;
807 -- Test for variant part present
809 if Has_Discriminants (T)
810 and then Present (Parent (T))
811 and then Nkind (Parent (T)) = N_Full_Type_Declaration
812 and then Nkind (Type_Definition (Parent (T))) =
814 and then not Null_Present (Type_Definition (Parent (T)))
815 and then Present (Variant_Part
816 (Component_List (Type_Definition (Parent (T)))))
818 -- If variant part is present, and type is unconstrained,
819 -- then we must have defaulted discriminants, or a size
820 -- clause must be present for the type, or else the size
821 -- is definitely not known at compile time.
823 if not Is_Constrained (T)
825 No (Discriminant_Default_Value (First_Discriminant (T)))
826 and then Unknown_RM_Size (T)
832 -- Loop through components
834 Comp := First_Component_Or_Discriminant (T);
835 while Present (Comp) loop
836 Ctyp := Etype (Comp);
838 -- We do not know the packed size if there is a component
839 -- clause present (we possibly could, but this would only
840 -- help in the case of a record with partial rep clauses.
841 -- That's because in the case of full rep clauses, the
842 -- size gets figured out anyway by a different circuit).
844 if Present (Component_Clause (Comp)) then
845 Packed_Size_Known := False;
848 -- We need to identify a component that is an array where
849 -- the index type is an enumeration type with non-standard
850 -- representation, and some bound of the type depends on a
853 -- This is because gigi computes the size by doing a
854 -- substitution of the appropriate discriminant value in
855 -- the size expression for the base type, and gigi is not
856 -- clever enough to evaluate the resulting expression (which
857 -- involves a call to rep_to_pos) at compile time.
859 -- It would be nice if gigi would either recognize that
860 -- this expression can be computed at compile time, or
861 -- alternatively figured out the size from the subtype
862 -- directly, where all the information is at hand ???
864 if Is_Array_Type (Etype (Comp))
865 and then Present (Packed_Array_Type (Etype (Comp)))
868 Ocomp : constant Entity_Id :=
869 Original_Record_Component (Comp);
870 OCtyp : constant Entity_Id := Etype (Ocomp);
876 Ind := First_Index (OCtyp);
877 while Present (Ind) loop
878 Indtyp := Etype (Ind);
880 if Is_Enumeration_Type (Indtyp)
881 and then Has_Non_Standard_Rep (Indtyp)
883 Lo := Type_Low_Bound (Indtyp);
884 Hi := Type_High_Bound (Indtyp);
886 if Is_Entity_Name (Lo)
887 and then Ekind (Entity (Lo)) = E_Discriminant
891 elsif Is_Entity_Name (Hi)
892 and then Ekind (Entity (Hi)) = E_Discriminant
903 -- Clearly size of record is not known if the size of one of
904 -- the components is not known.
906 if not Size_Known (Ctyp) then
910 -- Accumulate packed size if possible
912 if Packed_Size_Known then
914 -- We can only deal with elementary types, since for
915 -- non-elementary components, alignment enters into the
916 -- picture, and we don't know enough to handle proper
917 -- alignment in this context. Packed arrays count as
918 -- elementary if the representation is a modular type.
920 if Is_Elementary_Type (Ctyp)
921 or else (Is_Array_Type (Ctyp)
922 and then Present (Packed_Array_Type (Ctyp))
923 and then Is_Modular_Integer_Type
924 (Packed_Array_Type (Ctyp)))
926 -- If RM_Size is known and static, then we can keep
927 -- accumulating the packed size.
929 if Known_Static_RM_Size (Ctyp) then
931 -- A little glitch, to be removed sometime ???
932 -- gigi does not understand zero sizes yet.
934 if RM_Size (Ctyp) = Uint_0 then
935 Packed_Size_Known := False;
937 -- Normal case where we can keep accumulating the
938 -- packed array size.
941 Packed_Size := Packed_Size + RM_Size (Ctyp);
944 -- If we have a field whose RM_Size is not known then
945 -- we can't figure out the packed size here.
948 Packed_Size_Known := False;
951 -- If we have a non-elementary type we can't figure out
952 -- the packed array size (alignment issues).
955 Packed_Size_Known := False;
959 Next_Component_Or_Discriminant (Comp);
962 if Packed_Size_Known then
963 Set_Small_Size (T, Packed_Size);
969 -- All other cases, size not known at compile time
976 -------------------------------------
977 -- Static_Discriminated_Components --
978 -------------------------------------
980 function Static_Discriminated_Components
981 (T : Entity_Id) return Boolean
983 Constraint : Elmt_Id;
986 if Has_Discriminants (T)
987 and then Present (Discriminant_Constraint (T))
988 and then Present (First_Component (T))
990 Constraint := First_Elmt (Discriminant_Constraint (T));
991 while Present (Constraint) loop
992 if not Compile_Time_Known_Value (Node (Constraint)) then
996 Next_Elmt (Constraint);
1001 end Static_Discriminated_Components;
1003 -- Start of processing for Check_Compile_Time_Size
1006 Set_Size_Known_At_Compile_Time (T, Size_Known (T));
1007 end Check_Compile_Time_Size;
1009 -----------------------------
1010 -- Check_Debug_Info_Needed --
1011 -----------------------------
1013 procedure Check_Debug_Info_Needed (T : Entity_Id) is
1015 if Debug_Info_Off (T) then
1018 elsif Comes_From_Source (T)
1019 or else Debug_Generated_Code
1020 or else Debug_Flag_VV
1021 or else Needs_Debug_Info (T)
1023 Set_Debug_Info_Needed (T);
1025 end Check_Debug_Info_Needed;
1027 ----------------------------
1028 -- Check_Strict_Alignment --
1029 ----------------------------
1031 procedure Check_Strict_Alignment (E : Entity_Id) is
1035 if Is_Tagged_Type (E) or else Is_Concurrent_Type (E) then
1036 Set_Strict_Alignment (E);
1038 elsif Is_Array_Type (E) then
1039 Set_Strict_Alignment (E, Strict_Alignment (Component_Type (E)));
1041 elsif Is_Record_Type (E) then
1042 if Is_Limited_Record (E) then
1043 Set_Strict_Alignment (E);
1047 Comp := First_Component (E);
1048 while Present (Comp) loop
1049 if not Is_Type (Comp)
1050 and then (Strict_Alignment (Etype (Comp))
1051 or else Is_Aliased (Comp))
1053 Set_Strict_Alignment (E);
1057 Next_Component (Comp);
1060 end Check_Strict_Alignment;
1062 -------------------------
1063 -- Check_Unsigned_Type --
1064 -------------------------
1066 procedure Check_Unsigned_Type (E : Entity_Id) is
1067 Ancestor : Entity_Id;
1072 if not Is_Discrete_Or_Fixed_Point_Type (E) then
1076 -- Do not attempt to analyze case where range was in error
1078 if No (Scalar_Range (E))
1079 or else Error_Posted (Scalar_Range (E))
1084 -- The situation that is non trivial is something like
1086 -- subtype x1 is integer range -10 .. +10;
1087 -- subtype x2 is x1 range 0 .. V1;
1088 -- subtype x3 is x2 range V2 .. V3;
1089 -- subtype x4 is x3 range V4 .. V5;
1091 -- where Vn are variables. Here the base type is signed, but we still
1092 -- know that x4 is unsigned because of the lower bound of x2.
1094 -- The only way to deal with this is to look up the ancestor chain
1098 if Ancestor = Any_Type or else Etype (Ancestor) = Any_Type then
1102 Lo_Bound := Type_Low_Bound (Ancestor);
1104 if Compile_Time_Known_Value (Lo_Bound) then
1106 if Expr_Rep_Value (Lo_Bound) >= 0 then
1107 Set_Is_Unsigned_Type (E, True);
1113 Ancestor := Ancestor_Subtype (Ancestor);
1115 -- If no ancestor had a static lower bound, go to base type
1117 if No (Ancestor) then
1119 -- Note: the reason we still check for a compile time known
1120 -- value for the base type is that at least in the case of
1121 -- generic formals, we can have bounds that fail this test,
1122 -- and there may be other cases in error situations.
1124 Btyp := Base_Type (E);
1126 if Btyp = Any_Type or else Etype (Btyp) = Any_Type then
1130 Lo_Bound := Type_Low_Bound (Base_Type (E));
1132 if Compile_Time_Known_Value (Lo_Bound)
1133 and then Expr_Rep_Value (Lo_Bound) >= 0
1135 Set_Is_Unsigned_Type (E, True);
1142 end Check_Unsigned_Type;
1144 -------------------------
1145 -- Is_Atomic_Aggregate --
1146 -------------------------
1148 function Is_Atomic_Aggregate
1150 Typ : Entity_Id) return Boolean
1152 Loc : constant Source_Ptr := Sloc (E);
1160 -- Array may be qualified, so find outer context
1162 if Nkind (Par) = N_Qualified_Expression then
1163 Par := Parent (Par);
1166 if Nkind_In (Par, N_Object_Declaration, N_Assignment_Statement)
1167 and then Comes_From_Source (Par)
1169 Temp := Make_Temporary (Loc, 'T', E);
1171 Make_Object_Declaration (Loc,
1172 Defining_Identifier => Temp,
1173 Object_Definition => New_Occurrence_Of (Typ, Loc),
1174 Expression => Relocate_Node (E));
1175 Insert_Before (Par, New_N);
1178 Set_Expression (Par, New_Occurrence_Of (Temp, Loc));
1184 end Is_Atomic_Aggregate;
1190 -- Note: the easy coding for this procedure would be to just build a
1191 -- single list of freeze nodes and then insert them and analyze them
1192 -- all at once. This won't work, because the analysis of earlier freeze
1193 -- nodes may recursively freeze types which would otherwise appear later
1194 -- on in the freeze list. So we must analyze and expand the freeze nodes
1195 -- as they are generated.
1197 procedure Freeze_All (From : Entity_Id; After : in out Node_Id) is
1201 procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id);
1202 -- This is the internal recursive routine that does freezing of entities
1203 -- (but NOT the analysis of default expressions, which should not be
1204 -- recursive, we don't want to analyze those till we are sure that ALL
1205 -- the types are frozen).
1207 --------------------
1208 -- Freeze_All_Ent --
1209 --------------------
1211 procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id) is
1216 procedure Process_Flist;
1217 -- If freeze nodes are present, insert and analyze, and reset cursor
1218 -- for next insertion.
1224 procedure Process_Flist is
1226 if Is_Non_Empty_List (Flist) then
1227 Lastn := Next (After);
1228 Insert_List_After_And_Analyze (After, Flist);
1230 if Present (Lastn) then
1231 After := Prev (Lastn);
1233 After := Last (List_Containing (After));
1238 -- Start or processing for Freeze_All_Ent
1242 while Present (E) loop
1244 -- If the entity is an inner package which is not a package
1245 -- renaming, then its entities must be frozen at this point. Note
1246 -- that such entities do NOT get frozen at the end of the nested
1247 -- package itself (only library packages freeze).
1249 -- Same is true for task declarations, where anonymous records
1250 -- created for entry parameters must be frozen.
1252 if Ekind (E) = E_Package
1253 and then No (Renamed_Object (E))
1254 and then not Is_Child_Unit (E)
1255 and then not Is_Frozen (E)
1258 Install_Visible_Declarations (E);
1259 Install_Private_Declarations (E);
1261 Freeze_All (First_Entity (E), After);
1263 End_Package_Scope (E);
1265 if Is_Generic_Instance (E)
1266 and then Has_Delayed_Freeze (E)
1268 Set_Has_Delayed_Freeze (E, False);
1269 Expand_N_Package_Declaration (Unit_Declaration_Node (E));
1272 elsif Ekind (E) in Task_Kind
1274 (Nkind (Parent (E)) = N_Task_Type_Declaration
1276 Nkind (Parent (E)) = N_Single_Task_Declaration)
1279 Freeze_All (First_Entity (E), After);
1282 -- For a derived tagged type, we must ensure that all the
1283 -- primitive operations of the parent have been frozen, so that
1284 -- their addresses will be in the parent's dispatch table at the
1285 -- point it is inherited.
1287 elsif Ekind (E) = E_Record_Type
1288 and then Is_Tagged_Type (E)
1289 and then Is_Tagged_Type (Etype (E))
1290 and then Is_Derived_Type (E)
1293 Prim_List : constant Elist_Id :=
1294 Primitive_Operations (Etype (E));
1300 Prim := First_Elmt (Prim_List);
1301 while Present (Prim) loop
1302 Subp := Node (Prim);
1304 if Comes_From_Source (Subp)
1305 and then not Is_Frozen (Subp)
1307 Flist := Freeze_Entity (Subp, After);
1316 if not Is_Frozen (E) then
1317 Flist := Freeze_Entity (E, After);
1320 -- If already frozen, and there are delayed aspects, this is where
1321 -- we do the visibility check for these aspects (see Sem_Ch13 spec
1322 -- for a description of how we handle aspect visibility).
1324 elsif Has_Delayed_Aspects (E) then
1329 Ritem := First_Rep_Item (E);
1330 while Present (Ritem) loop
1331 if Nkind (Ritem) = N_Aspect_Specification
1332 and then Entity (Ritem) = E
1333 and then Is_Delayed_Aspect (Ritem)
1335 Check_Aspect_At_End_Of_Declarations (Ritem);
1338 Ritem := Next_Rep_Item (Ritem);
1343 -- If an incomplete type is still not frozen, this may be a
1344 -- premature freezing because of a body declaration that follows.
1345 -- Indicate where the freezing took place.
1347 -- If the freezing is caused by the end of the current declarative
1348 -- part, it is a Taft Amendment type, and there is no error.
1350 if not Is_Frozen (E)
1351 and then Ekind (E) = E_Incomplete_Type
1354 Bod : constant Node_Id := Next (After);
1357 if (Nkind_In (Bod, N_Subprogram_Body,
1362 or else Nkind (Bod) in N_Body_Stub)
1364 List_Containing (After) = List_Containing (Parent (E))
1366 Error_Msg_Sloc := Sloc (Next (After));
1368 ("type& is frozen# before its full declaration",
1378 -- Start of processing for Freeze_All
1381 Freeze_All_Ent (From, After);
1383 -- Now that all types are frozen, we can deal with default expressions
1384 -- that require us to build a default expression functions. This is the
1385 -- point at which such functions are constructed (after all types that
1386 -- might be used in such expressions have been frozen).
1388 -- For subprograms that are renaming_as_body, we create the wrapper
1389 -- bodies as needed.
1391 -- We also add finalization chains to access types whose designated
1392 -- types are controlled. This is normally done when freezing the type,
1393 -- but this misses recursive type definitions where the later members
1394 -- of the recursion introduce controlled components.
1396 -- Loop through entities
1399 while Present (E) loop
1400 if Is_Subprogram (E) then
1402 if not Default_Expressions_Processed (E) then
1403 Process_Default_Expressions (E, After);
1406 if not Has_Completion (E) then
1407 Decl := Unit_Declaration_Node (E);
1409 if Nkind (Decl) = N_Subprogram_Renaming_Declaration then
1410 if Error_Posted (Decl) then
1411 Set_Has_Completion (E);
1413 Build_And_Analyze_Renamed_Body (Decl, E, After);
1416 elsif Nkind (Decl) = N_Subprogram_Declaration
1417 and then Present (Corresponding_Body (Decl))
1419 Nkind (Unit_Declaration_Node (Corresponding_Body (Decl)))
1420 = N_Subprogram_Renaming_Declaration
1422 Build_And_Analyze_Renamed_Body
1423 (Decl, Corresponding_Body (Decl), After);
1427 elsif Ekind (E) in Task_Kind
1429 (Nkind (Parent (E)) = N_Task_Type_Declaration
1431 Nkind (Parent (E)) = N_Single_Task_Declaration)
1437 Ent := First_Entity (E);
1438 while Present (Ent) loop
1440 and then not Default_Expressions_Processed (Ent)
1442 Process_Default_Expressions (Ent, After);
1449 -- We add finalization masters to access types whose designated types
1450 -- require finalization. This is normally done when freezing the
1451 -- type, but this misses recursive type definitions where the later
1452 -- members of the recursion introduce controlled components (such as
1453 -- can happen when incomplete types are involved), as well cases
1454 -- where a component type is private and the controlled full type
1455 -- occurs after the access type is frozen. Cases that don't need a
1456 -- finalization master are generic formal types (the actual type will
1457 -- have it) and types with Java and CIL conventions, since those are
1458 -- used for API bindings. (Are there any other cases that should be
1459 -- excluded here???)
1461 elsif Is_Access_Type (E)
1462 and then Comes_From_Source (E)
1463 and then not Is_Generic_Type (E)
1464 and then Needs_Finalization (Designated_Type (E))
1466 Build_Finalization_Master (E);
1473 -----------------------
1474 -- Freeze_And_Append --
1475 -----------------------
1477 procedure Freeze_And_Append
1480 Result : in out List_Id)
1482 L : constant List_Id := Freeze_Entity (Ent, N);
1484 if Is_Non_Empty_List (L) then
1485 if Result = No_List then
1488 Append_List (L, Result);
1491 end Freeze_And_Append;
1497 procedure Freeze_Before (N : Node_Id; T : Entity_Id) is
1498 Freeze_Nodes : constant List_Id := Freeze_Entity (T, N);
1500 if Is_Non_Empty_List (Freeze_Nodes) then
1501 Insert_Actions (N, Freeze_Nodes);
1509 function Freeze_Entity (E : Entity_Id; N : Node_Id) return List_Id is
1510 Loc : constant Source_Ptr := Sloc (N);
1511 Test_E : Entity_Id := E;
1518 Result : List_Id := No_List;
1519 -- List of freezing actions, left at No_List if none
1521 Has_Default_Initialization : Boolean := False;
1522 -- This flag gets set to true for a variable with default initialization
1524 procedure Add_To_Result (N : Node_Id);
1525 -- N is a freezing action to be appended to the Result
1527 procedure Check_Current_Instance (Comp_Decl : Node_Id);
1528 -- Check that an Access or Unchecked_Access attribute with a prefix
1529 -- which is the current instance type can only be applied when the type
1532 procedure Check_Suspicious_Modulus (Utype : Entity_Id);
1533 -- Give warning for modulus of 8, 16, 32, or 64 given as an explicit
1534 -- integer literal without an explicit corresponding size clause. The
1535 -- caller has checked that Utype is a modular integer type.
1537 function After_Last_Declaration return Boolean;
1538 -- If Loc is a freeze_entity that appears after the last declaration
1539 -- in the scope, inhibit error messages on late completion.
1541 procedure Freeze_Record_Type (Rec : Entity_Id);
1542 -- Freeze each component, handle some representation clauses, and freeze
1543 -- primitive operations if this is a tagged type.
1549 procedure Add_To_Result (N : Node_Id) is
1552 Result := New_List (N);
1558 ----------------------------
1559 -- After_Last_Declaration --
1560 ----------------------------
1562 function After_Last_Declaration return Boolean is
1563 Spec : constant Node_Id := Parent (Current_Scope);
1565 if Nkind (Spec) = N_Package_Specification then
1566 if Present (Private_Declarations (Spec)) then
1567 return Loc >= Sloc (Last (Private_Declarations (Spec)));
1568 elsif Present (Visible_Declarations (Spec)) then
1569 return Loc >= Sloc (Last (Visible_Declarations (Spec)));
1576 end After_Last_Declaration;
1578 ----------------------------
1579 -- Check_Current_Instance --
1580 ----------------------------
1582 procedure Check_Current_Instance (Comp_Decl : Node_Id) is
1584 Rec_Type : constant Entity_Id :=
1585 Scope (Defining_Identifier (Comp_Decl));
1587 Decl : constant Node_Id := Parent (Rec_Type);
1589 function Process (N : Node_Id) return Traverse_Result;
1590 -- Process routine to apply check to given node
1596 function Process (N : Node_Id) return Traverse_Result is
1599 when N_Attribute_Reference =>
1600 if (Attribute_Name (N) = Name_Access
1602 Attribute_Name (N) = Name_Unchecked_Access)
1603 and then Is_Entity_Name (Prefix (N))
1604 and then Is_Type (Entity (Prefix (N)))
1605 and then Entity (Prefix (N)) = E
1608 ("current instance must be a limited type", Prefix (N));
1614 when others => return OK;
1618 procedure Traverse is new Traverse_Proc (Process);
1620 -- Start of processing for Check_Current_Instance
1623 -- In Ada 95, the (imprecise) rule is that the current instance
1624 -- of a limited type is aliased. In Ada 2005, limitedness must be
1625 -- explicit: either a tagged type, or a limited record.
1627 if Is_Limited_Type (Rec_Type)
1628 and then (Ada_Version < Ada_2005 or else Is_Tagged_Type (Rec_Type))
1632 elsif Nkind (Decl) = N_Full_Type_Declaration
1633 and then Limited_Present (Type_Definition (Decl))
1638 Traverse (Comp_Decl);
1640 end Check_Current_Instance;
1642 ------------------------------
1643 -- Check_Suspicious_Modulus --
1644 ------------------------------
1646 procedure Check_Suspicious_Modulus (Utype : Entity_Id) is
1647 Decl : constant Node_Id := Declaration_Node (Underlying_Type (Utype));
1650 if Nkind (Decl) = N_Full_Type_Declaration then
1652 Tdef : constant Node_Id := Type_Definition (Decl);
1655 if Nkind (Tdef) = N_Modular_Type_Definition then
1657 Modulus : constant Node_Id :=
1658 Original_Node (Expression (Tdef));
1660 if Nkind (Modulus) = N_Integer_Literal then
1662 Modv : constant Uint := Intval (Modulus);
1663 Sizv : constant Uint := RM_Size (Utype);
1666 -- First case, modulus and size are the same. This
1667 -- happens if you have something like mod 32, with
1668 -- an explicit size of 32, this is for sure a case
1669 -- where the warning is given, since it is seems
1670 -- very unlikely that someone would want e.g. a
1671 -- five bit type stored in 32 bits. It is much
1672 -- more likely they wanted a 32-bit type.
1677 -- Second case, the modulus is 32 or 64 and no
1678 -- size clause is present. This is a less clear
1679 -- case for giving the warning, but in the case
1680 -- of 32/64 (5-bit or 6-bit types) these seem rare
1681 -- enough that it is a likely error (and in any
1682 -- case using 2**5 or 2**6 in these cases seems
1683 -- clearer. We don't include 8 or 16 here, simply
1684 -- because in practice 3-bit and 4-bit types are
1685 -- more common and too many false positives if
1686 -- we warn in these cases.
1688 elsif not Has_Size_Clause (Utype)
1689 and then (Modv = Uint_32 or else Modv = Uint_64)
1693 -- No warning needed
1699 -- If we fall through, give warning
1701 Error_Msg_Uint_1 := Modv;
1703 ("?2 '*'*^' may have been intended here",
1711 end Check_Suspicious_Modulus;
1713 ------------------------
1714 -- Freeze_Record_Type --
1715 ------------------------
1717 procedure Freeze_Record_Type (Rec : Entity_Id) is
1724 pragma Warnings (Off, Junk);
1726 Unplaced_Component : Boolean := False;
1727 -- Set True if we find at least one component with no component
1728 -- clause (used to warn about useless Pack pragmas).
1730 Placed_Component : Boolean := False;
1731 -- Set True if we find at least one component with a component
1732 -- clause (used to warn about useless Bit_Order pragmas, and also
1733 -- to detect cases where Implicit_Packing may have an effect).
1735 All_Scalar_Components : Boolean := True;
1736 -- Set False if we encounter a component of a non-scalar type
1738 Scalar_Component_Total_RM_Size : Uint := Uint_0;
1739 Scalar_Component_Total_Esize : Uint := Uint_0;
1740 -- Accumulates total RM_Size values and total Esize values of all
1741 -- scalar components. Used for processing of Implicit_Packing.
1743 function Check_Allocator (N : Node_Id) return Node_Id;
1744 -- If N is an allocator, possibly wrapped in one or more level of
1745 -- qualified expression(s), return the inner allocator node, else
1748 procedure Check_Itype (Typ : Entity_Id);
1749 -- If the component subtype is an access to a constrained subtype of
1750 -- an already frozen type, make the subtype frozen as well. It might
1751 -- otherwise be frozen in the wrong scope, and a freeze node on
1752 -- subtype has no effect. Similarly, if the component subtype is a
1753 -- regular (not protected) access to subprogram, set the anonymous
1754 -- subprogram type to frozen as well, to prevent an out-of-scope
1755 -- freeze node at some eventual point of call. Protected operations
1756 -- are handled elsewhere.
1758 ---------------------
1759 -- Check_Allocator --
1760 ---------------------
1762 function Check_Allocator (N : Node_Id) return Node_Id is
1767 if Nkind (Inner) = N_Allocator then
1769 elsif Nkind (Inner) = N_Qualified_Expression then
1770 Inner := Expression (Inner);
1775 end Check_Allocator;
1781 procedure Check_Itype (Typ : Entity_Id) is
1782 Desig : constant Entity_Id := Designated_Type (Typ);
1785 if not Is_Frozen (Desig)
1786 and then Is_Frozen (Base_Type (Desig))
1788 Set_Is_Frozen (Desig);
1790 -- In addition, add an Itype_Reference to ensure that the
1791 -- access subtype is elaborated early enough. This cannot be
1792 -- done if the subtype may depend on discriminants.
1794 if Ekind (Comp) = E_Component
1795 and then Is_Itype (Etype (Comp))
1796 and then not Has_Discriminants (Rec)
1798 IR := Make_Itype_Reference (Sloc (Comp));
1799 Set_Itype (IR, Desig);
1803 elsif Ekind (Typ) = E_Anonymous_Access_Subprogram_Type
1804 and then Convention (Desig) /= Convention_Protected
1806 Set_Is_Frozen (Desig);
1810 -- Start of processing for Freeze_Record_Type
1813 -- Freeze components and embedded subtypes
1815 Comp := First_Entity (Rec);
1817 while Present (Comp) loop
1819 -- First handle the component case
1821 if Ekind (Comp) = E_Component
1822 or else Ekind (Comp) = E_Discriminant
1825 CC : constant Node_Id := Component_Clause (Comp);
1828 -- Freezing a record type freezes the type of each of its
1829 -- components. However, if the type of the component is
1830 -- part of this record, we do not want or need a separate
1831 -- Freeze_Node. Note that Is_Itype is wrong because that's
1832 -- also set in private type cases. We also can't check for
1833 -- the Scope being exactly Rec because of private types and
1834 -- record extensions.
1836 if Is_Itype (Etype (Comp))
1837 and then Is_Record_Type (Underlying_Type
1838 (Scope (Etype (Comp))))
1840 Undelay_Type (Etype (Comp));
1843 Freeze_And_Append (Etype (Comp), N, Result);
1845 -- Check for error of component clause given for variable
1846 -- sized type. We have to delay this test till this point,
1847 -- since the component type has to be frozen for us to know
1848 -- if it is variable length. We omit this test in a generic
1849 -- context, it will be applied at instantiation time.
1851 -- We also omit this test in CodePeer mode, since we do not
1852 -- have sufficient info on size and representation clauses.
1854 if Present (CC) then
1855 Placed_Component := True;
1857 if Inside_A_Generic then
1860 elsif CodePeer_Mode then
1864 Size_Known_At_Compile_Time
1865 (Underlying_Type (Etype (Comp)))
1868 ("component clause not allowed for variable " &
1869 "length component", CC);
1873 Unplaced_Component := True;
1876 -- Case of component requires byte alignment
1878 if Must_Be_On_Byte_Boundary (Etype (Comp)) then
1880 -- Set the enclosing record to also require byte align
1882 Set_Must_Be_On_Byte_Boundary (Rec);
1884 -- Check for component clause that is inconsistent with
1885 -- the required byte boundary alignment.
1888 and then Normalized_First_Bit (Comp) mod
1889 System_Storage_Unit /= 0
1892 ("component & must be byte aligned",
1893 Component_Name (Component_Clause (Comp)));
1899 -- Gather data for possible Implicit_Packing later. Note that at
1900 -- this stage we might be dealing with a real component, or with
1901 -- an implicit subtype declaration.
1903 if not Is_Scalar_Type (Etype (Comp)) then
1904 All_Scalar_Components := False;
1906 Scalar_Component_Total_RM_Size :=
1907 Scalar_Component_Total_RM_Size + RM_Size (Etype (Comp));
1908 Scalar_Component_Total_Esize :=
1909 Scalar_Component_Total_Esize + Esize (Etype (Comp));
1912 -- If the component is an Itype with Delayed_Freeze and is either
1913 -- a record or array subtype and its base type has not yet been
1914 -- frozen, we must remove this from the entity list of this record
1915 -- and put it on the entity list of the scope of its base type.
1916 -- Note that we know that this is not the type of a component
1917 -- since we cleared Has_Delayed_Freeze for it in the previous
1918 -- loop. Thus this must be the Designated_Type of an access type,
1919 -- which is the type of a component.
1922 and then Is_Type (Scope (Comp))
1923 and then Is_Composite_Type (Comp)
1924 and then Base_Type (Comp) /= Comp
1925 and then Has_Delayed_Freeze (Comp)
1926 and then not Is_Frozen (Base_Type (Comp))
1929 Will_Be_Frozen : Boolean := False;
1933 -- We have a pretty bad kludge here. Suppose Rec is subtype
1934 -- being defined in a subprogram that's created as part of
1935 -- the freezing of Rec'Base. In that case, we know that
1936 -- Comp'Base must have already been frozen by the time we
1937 -- get to elaborate this because Gigi doesn't elaborate any
1938 -- bodies until it has elaborated all of the declarative
1939 -- part. But Is_Frozen will not be set at this point because
1940 -- we are processing code in lexical order.
1942 -- We detect this case by going up the Scope chain of Rec
1943 -- and seeing if we have a subprogram scope before reaching
1944 -- the top of the scope chain or that of Comp'Base. If we
1945 -- do, then mark that Comp'Base will actually be frozen. If
1946 -- so, we merely undelay it.
1949 while Present (S) loop
1950 if Is_Subprogram (S) then
1951 Will_Be_Frozen := True;
1953 elsif S = Scope (Base_Type (Comp)) then
1960 if Will_Be_Frozen then
1961 Undelay_Type (Comp);
1963 if Present (Prev) then
1964 Set_Next_Entity (Prev, Next_Entity (Comp));
1966 Set_First_Entity (Rec, Next_Entity (Comp));
1969 -- Insert in entity list of scope of base type (which
1970 -- must be an enclosing scope, because still unfrozen).
1972 Append_Entity (Comp, Scope (Base_Type (Comp)));
1976 -- If the component is an access type with an allocator as default
1977 -- value, the designated type will be frozen by the corresponding
1978 -- expression in init_proc. In order to place the freeze node for
1979 -- the designated type before that for the current record type,
1982 -- Same process if the component is an array of access types,
1983 -- initialized with an aggregate. If the designated type is
1984 -- private, it cannot contain allocators, and it is premature
1985 -- to freeze the type, so we check for this as well.
1987 elsif Is_Access_Type (Etype (Comp))
1988 and then Present (Parent (Comp))
1989 and then Present (Expression (Parent (Comp)))
1992 Alloc : constant Node_Id :=
1993 Check_Allocator (Expression (Parent (Comp)));
1996 if Present (Alloc) then
1998 -- If component is pointer to a classwide type, freeze
1999 -- the specific type in the expression being allocated.
2000 -- The expression may be a subtype indication, in which
2001 -- case freeze the subtype mark.
2003 if Is_Class_Wide_Type
2004 (Designated_Type (Etype (Comp)))
2006 if Is_Entity_Name (Expression (Alloc)) then
2008 (Entity (Expression (Alloc)), N, Result);
2010 Nkind (Expression (Alloc)) = N_Subtype_Indication
2013 (Entity (Subtype_Mark (Expression (Alloc))),
2017 elsif Is_Itype (Designated_Type (Etype (Comp))) then
2018 Check_Itype (Etype (Comp));
2022 (Designated_Type (Etype (Comp)), N, Result);
2027 elsif Is_Access_Type (Etype (Comp))
2028 and then Is_Itype (Designated_Type (Etype (Comp)))
2030 Check_Itype (Etype (Comp));
2032 elsif Is_Array_Type (Etype (Comp))
2033 and then Is_Access_Type (Component_Type (Etype (Comp)))
2034 and then Present (Parent (Comp))
2035 and then Nkind (Parent (Comp)) = N_Component_Declaration
2036 and then Present (Expression (Parent (Comp)))
2037 and then Nkind (Expression (Parent (Comp))) = N_Aggregate
2038 and then Is_Fully_Defined
2039 (Designated_Type (Component_Type (Etype (Comp))))
2043 (Component_Type (Etype (Comp))), N, Result);
2050 -- Deal with Bit_Order aspect specifying a non-default bit order
2052 if Reverse_Bit_Order (Rec) and then Base_Type (Rec) = Rec then
2053 if not Placed_Component then
2055 Get_Attribute_Definition_Clause (Rec, Attribute_Bit_Order);
2056 Error_Msg_N ("?Bit_Order specification has no effect", ADC);
2058 ("\?since no component clauses were specified", ADC);
2060 -- Here is where we do the processing for reversed bit order
2063 Adjust_Record_For_Reverse_Bit_Order (Rec);
2067 -- Complete error checking on record representation clause (e.g.
2068 -- overlap of components). This is called after adjusting the
2069 -- record for reverse bit order.
2072 RRC : constant Node_Id := Get_Record_Representation_Clause (Rec);
2074 if Present (RRC) then
2075 Check_Record_Representation_Clause (RRC);
2079 -- Set OK_To_Reorder_Components depending on debug flags
2081 if Is_Base_Type (Rec) and then Convention (Rec) = Convention_Ada then
2082 if (Has_Discriminants (Rec) and then Debug_Flag_Dot_V)
2084 (not Has_Discriminants (Rec) and then Debug_Flag_Dot_R)
2086 Set_OK_To_Reorder_Components (Rec);
2090 -- Check for useless pragma Pack when all components placed. We only
2091 -- do this check for record types, not subtypes, since a subtype may
2092 -- have all its components placed, and it still makes perfectly good
2093 -- sense to pack other subtypes or the parent type. We do not give
2094 -- this warning if Optimize_Alignment is set to Space, since the
2095 -- pragma Pack does have an effect in this case (it always resets
2096 -- the alignment to one).
2098 if Ekind (Rec) = E_Record_Type
2099 and then Is_Packed (Rec)
2100 and then not Unplaced_Component
2101 and then Optimize_Alignment /= 'S'
2103 -- Reset packed status. Probably not necessary, but we do it so
2104 -- that there is no chance of the back end doing something strange
2105 -- with this redundant indication of packing.
2107 Set_Is_Packed (Rec, False);
2109 -- Give warning if redundant constructs warnings on
2111 if Warn_On_Redundant_Constructs then
2112 Error_Msg_N -- CODEFIX
2113 ("?pragma Pack has no effect, no unplaced components",
2114 Get_Rep_Pragma (Rec, Name_Pack));
2118 -- If this is the record corresponding to a remote type, freeze the
2119 -- remote type here since that is what we are semantically freezing.
2120 -- This prevents the freeze node for that type in an inner scope.
2122 -- Also, Check for controlled components and unchecked unions.
2123 -- Finally, enforce the restriction that access attributes with a
2124 -- current instance prefix can only apply to limited types.
2126 if Ekind (Rec) = E_Record_Type then
2127 if Present (Corresponding_Remote_Type (Rec)) then
2128 Freeze_And_Append (Corresponding_Remote_Type (Rec), N, Result);
2131 Comp := First_Component (Rec);
2132 while Present (Comp) loop
2134 -- Do not set Has_Controlled_Component on a class-wide
2135 -- equivalent type. See Make_CW_Equivalent_Type.
2137 if not Is_Class_Wide_Equivalent_Type (Rec)
2138 and then (Has_Controlled_Component (Etype (Comp))
2139 or else (Chars (Comp) /= Name_uParent
2140 and then Is_Controlled (Etype (Comp)))
2141 or else (Is_Protected_Type (Etype (Comp))
2143 (Corresponding_Record_Type
2145 and then Has_Controlled_Component
2146 (Corresponding_Record_Type
2149 Set_Has_Controlled_Component (Rec);
2153 if Has_Unchecked_Union (Etype (Comp)) then
2154 Set_Has_Unchecked_Union (Rec);
2157 if Has_Per_Object_Constraint (Comp) then
2159 -- Scan component declaration for likely misuses of current
2160 -- instance, either in a constraint or a default expression.
2162 Check_Current_Instance (Parent (Comp));
2165 Next_Component (Comp);
2169 Set_Component_Alignment_If_Not_Set (Rec);
2171 -- For first subtypes, check if there are any fixed-point fields with
2172 -- component clauses, where we must check the size. This is not done
2173 -- till the freeze point, since for fixed-point types, we do not know
2174 -- the size until the type is frozen. Similar processing applies to
2175 -- bit packed arrays.
2177 if Is_First_Subtype (Rec) then
2178 Comp := First_Component (Rec);
2179 while Present (Comp) loop
2180 if Present (Component_Clause (Comp))
2181 and then (Is_Fixed_Point_Type (Etype (Comp))
2183 Is_Bit_Packed_Array (Etype (Comp)))
2186 (Component_Name (Component_Clause (Comp)),
2192 Next_Component (Comp);
2196 -- Generate warning for applying C or C++ convention to a record
2197 -- with discriminants. This is suppressed for the unchecked union
2198 -- case, since the whole point in this case is interface C. We also
2199 -- do not generate this within instantiations, since we will have
2200 -- generated a message on the template.
2202 if Has_Discriminants (E)
2203 and then not Is_Unchecked_Union (E)
2204 and then (Convention (E) = Convention_C
2206 Convention (E) = Convention_CPP)
2207 and then Comes_From_Source (E)
2208 and then not In_Instance
2209 and then not Has_Warnings_Off (E)
2210 and then not Has_Warnings_Off (Base_Type (E))
2213 Cprag : constant Node_Id := Get_Rep_Pragma (E, Name_Convention);
2217 if Present (Cprag) then
2218 A2 := Next (First (Pragma_Argument_Associations (Cprag)));
2220 if Convention (E) = Convention_C then
2222 ("?variant record has no direct equivalent in C", A2);
2225 ("?variant record has no direct equivalent in C++", A2);
2229 ("\?use of convention for type& is dubious", A2, E);
2234 -- See if Size is too small as is (and implicit packing might help)
2236 if not Is_Packed (Rec)
2238 -- No implicit packing if even one component is explicitly placed
2240 and then not Placed_Component
2242 -- Must have size clause and all scalar components
2244 and then Has_Size_Clause (Rec)
2245 and then All_Scalar_Components
2247 -- Do not try implicit packing on records with discriminants, too
2248 -- complicated, especially in the variant record case.
2250 and then not Has_Discriminants (Rec)
2252 -- We can implicitly pack if the specified size of the record is
2253 -- less than the sum of the object sizes (no point in packing if
2254 -- this is not the case).
2256 and then RM_Size (Rec) < Scalar_Component_Total_Esize
2258 -- And the total RM size cannot be greater than the specified size
2259 -- since otherwise packing will not get us where we have to be!
2261 and then RM_Size (Rec) >= Scalar_Component_Total_RM_Size
2263 -- Never do implicit packing in CodePeer or Alfa modes since
2264 -- we don't do any packing in these modes, since this generates
2265 -- over-complex code that confuses static analysis, and in
2266 -- general, neither CodePeer not GNATprove care about the
2267 -- internal representation of objects.
2269 and then not (CodePeer_Mode or Alfa_Mode)
2271 -- If implicit packing enabled, do it
2273 if Implicit_Packing then
2274 Set_Is_Packed (Rec);
2276 -- Otherwise flag the size clause
2280 Sz : constant Node_Id := Size_Clause (Rec);
2282 Error_Msg_NE -- CODEFIX
2283 ("size given for& too small", Sz, Rec);
2284 Error_Msg_N -- CODEFIX
2285 ("\use explicit pragma Pack "
2286 & "or use pragma Implicit_Packing", Sz);
2290 end Freeze_Record_Type;
2292 -- Start of processing for Freeze_Entity
2295 -- We are going to test for various reasons why this entity need not be
2296 -- frozen here, but in the case of an Itype that's defined within a
2297 -- record, that test actually applies to the record.
2299 if Is_Itype (E) and then Is_Record_Type (Scope (E)) then
2300 Test_E := Scope (E);
2301 elsif Is_Itype (E) and then Present (Underlying_Type (Scope (E)))
2302 and then Is_Record_Type (Underlying_Type (Scope (E)))
2304 Test_E := Underlying_Type (Scope (E));
2307 -- Do not freeze if already frozen since we only need one freeze node
2309 if Is_Frozen (E) then
2312 -- It is improper to freeze an external entity within a generic because
2313 -- its freeze node will appear in a non-valid context. The entity will
2314 -- be frozen in the proper scope after the current generic is analyzed.
2316 elsif Inside_A_Generic and then External_Ref_In_Generic (Test_E) then
2319 -- AI05-0213: A formal incomplete type does not freeze the actual. In
2320 -- the instance, the same applies to the subtype renaming the actual.
2322 elsif Is_Private_Type (E)
2323 and then Is_Generic_Actual_Type (E)
2324 and then No (Full_View (Base_Type (E)))
2325 and then Ada_Version >= Ada_2012
2329 -- Do not freeze a global entity within an inner scope created during
2330 -- expansion. A call to subprogram E within some internal procedure
2331 -- (a stream attribute for example) might require freezing E, but the
2332 -- freeze node must appear in the same declarative part as E itself.
2333 -- The two-pass elaboration mechanism in gigi guarantees that E will
2334 -- be frozen before the inner call is elaborated. We exclude constants
2335 -- from this test, because deferred constants may be frozen early, and
2336 -- must be diagnosed (e.g. in the case of a deferred constant being used
2337 -- in a default expression). If the enclosing subprogram comes from
2338 -- source, or is a generic instance, then the freeze point is the one
2339 -- mandated by the language, and we freeze the entity. A subprogram that
2340 -- is a child unit body that acts as a spec does not have a spec that
2341 -- comes from source, but can only come from source.
2343 elsif In_Open_Scopes (Scope (Test_E))
2344 and then Scope (Test_E) /= Current_Scope
2345 and then Ekind (Test_E) /= E_Constant
2352 while Present (S) loop
2353 if Is_Overloadable (S) then
2354 if Comes_From_Source (S)
2355 or else Is_Generic_Instance (S)
2356 or else Is_Child_Unit (S)
2368 -- Similarly, an inlined instance body may make reference to global
2369 -- entities, but these references cannot be the proper freezing point
2370 -- for them, and in the absence of inlining freezing will take place in
2371 -- their own scope. Normally instance bodies are analyzed after the
2372 -- enclosing compilation, and everything has been frozen at the proper
2373 -- place, but with front-end inlining an instance body is compiled
2374 -- before the end of the enclosing scope, and as a result out-of-order
2375 -- freezing must be prevented.
2377 elsif Front_End_Inlining
2378 and then In_Instance_Body
2379 and then Present (Scope (Test_E))
2385 S := Scope (Test_E);
2386 while Present (S) loop
2387 if Is_Generic_Instance (S) then
2400 -- Deal with delayed aspect specifications. The analysis of the aspect
2401 -- is required to be delayed to the freeze point, so we evaluate the
2402 -- pragma or attribute definition clause in the tree at this point.
2404 if Has_Delayed_Aspects (E) then
2410 -- Look for aspect specification entries for this entity
2412 Ritem := First_Rep_Item (E);
2413 while Present (Ritem) loop
2414 if Nkind (Ritem) = N_Aspect_Specification
2415 and then Entity (Ritem) = E
2416 and then Is_Delayed_Aspect (Ritem)
2417 and then Scope (E) = Current_Scope
2419 Aitem := Aspect_Rep_Item (Ritem);
2421 -- Skip if this is an aspect with no corresponding pragma
2422 -- or attribute definition node (such as Default_Value).
2424 if Present (Aitem) then
2425 Set_Parent (Aitem, Ritem);
2430 Next_Rep_Item (Ritem);
2435 -- Here to freeze the entity
2439 -- Case of entity being frozen is other than a type
2441 if not Is_Type (E) then
2443 -- If entity is exported or imported and does not have an external
2444 -- name, now is the time to provide the appropriate default name.
2445 -- Skip this if the entity is stubbed, since we don't need a name
2446 -- for any stubbed routine. For the case on intrinsics, if no
2447 -- external name is specified, then calls will be handled in
2448 -- Exp_Intr.Expand_Intrinsic_Call, and no name is needed. If an
2449 -- external name is provided, then Expand_Intrinsic_Call leaves
2450 -- calls in place for expansion by GIGI.
2452 if (Is_Imported (E) or else Is_Exported (E))
2453 and then No (Interface_Name (E))
2454 and then Convention (E) /= Convention_Stubbed
2455 and then Convention (E) /= Convention_Intrinsic
2457 Set_Encoded_Interface_Name
2458 (E, Get_Default_External_Name (E));
2460 -- If entity is an atomic object appearing in a declaration and
2461 -- the expression is an aggregate, assign it to a temporary to
2462 -- ensure that the actual assignment is done atomically rather
2463 -- than component-wise (the assignment to the temp may be done
2464 -- component-wise, but that is harmless).
2467 and then Nkind (Parent (E)) = N_Object_Declaration
2468 and then Present (Expression (Parent (E)))
2469 and then Nkind (Expression (Parent (E))) = N_Aggregate
2470 and then Is_Atomic_Aggregate (Expression (Parent (E)), Etype (E))
2475 -- For a subprogram, freeze all parameter types and also the return
2476 -- type (RM 13.14(14)). However skip this for internal subprograms.
2477 -- This is also the point where any extra formal parameters are
2478 -- created since we now know whether the subprogram will use a
2479 -- foreign convention.
2481 if Is_Subprogram (E) then
2482 if not Is_Internal (E) then
2486 Warn_Node : Node_Id;
2489 -- Loop through formals
2491 Formal := First_Formal (E);
2492 while Present (Formal) loop
2493 F_Type := Etype (Formal);
2495 -- AI05-0151 : incomplete types can appear in a profile.
2496 -- By the time the entity is frozen, the full view must
2497 -- be available, unless it is a limited view.
2499 if Is_Incomplete_Type (F_Type)
2500 and then Present (Full_View (F_Type))
2502 F_Type := Full_View (F_Type);
2503 Set_Etype (Formal, F_Type);
2506 Freeze_And_Append (F_Type, N, Result);
2508 if Is_Private_Type (F_Type)
2509 and then Is_Private_Type (Base_Type (F_Type))
2510 and then No (Full_View (Base_Type (F_Type)))
2511 and then not Is_Generic_Type (F_Type)
2512 and then not Is_Derived_Type (F_Type)
2514 -- If the type of a formal is incomplete, subprogram
2515 -- is being frozen prematurely. Within an instance
2516 -- (but not within a wrapper package) this is an
2517 -- artifact of our need to regard the end of an
2518 -- instantiation as a freeze point. Otherwise it is
2519 -- a definite error.
2522 Set_Is_Frozen (E, False);
2525 elsif not After_Last_Declaration
2526 and then not Freezing_Library_Level_Tagged_Type
2528 Error_Msg_Node_1 := F_Type;
2530 ("type& must be fully defined before this point",
2535 -- Check suspicious parameter for C function. These tests
2536 -- apply only to exported/imported subprograms.
2538 if Warn_On_Export_Import
2539 and then Comes_From_Source (E)
2540 and then (Convention (E) = Convention_C
2542 Convention (E) = Convention_CPP)
2543 and then (Is_Imported (E) or else Is_Exported (E))
2544 and then Convention (E) /= Convention (Formal)
2545 and then not Has_Warnings_Off (E)
2546 and then not Has_Warnings_Off (F_Type)
2547 and then not Has_Warnings_Off (Formal)
2549 -- Qualify mention of formals with subprogram name
2551 Error_Msg_Qual_Level := 1;
2553 -- Check suspicious use of fat C pointer
2555 if Is_Access_Type (F_Type)
2556 and then Esize (F_Type) > Ttypes.System_Address_Size
2559 ("?type of & does not correspond to C pointer!",
2562 -- Check suspicious return of boolean
2564 elsif Root_Type (F_Type) = Standard_Boolean
2565 and then Convention (F_Type) = Convention_Ada
2566 and then not Has_Warnings_Off (F_Type)
2567 and then not Has_Size_Clause (F_Type)
2568 and then VM_Target = No_VM
2570 Error_Msg_N ("& is an 8-bit Ada Boolean?", Formal);
2572 ("\use appropriate corresponding type in C "
2573 & "(e.g. char)?", Formal);
2575 -- Check suspicious tagged type
2577 elsif (Is_Tagged_Type (F_Type)
2578 or else (Is_Access_Type (F_Type)
2581 (Designated_Type (F_Type))))
2582 and then Convention (E) = Convention_C
2585 ("?& involves a tagged type which does not "
2586 & "correspond to any C type!", Formal);
2588 -- Check wrong convention subprogram pointer
2590 elsif Ekind (F_Type) = E_Access_Subprogram_Type
2591 and then not Has_Foreign_Convention (F_Type)
2594 ("?subprogram pointer & should "
2595 & "have foreign convention!", Formal);
2596 Error_Msg_Sloc := Sloc (F_Type);
2598 ("\?add Convention pragma to declaration of &#",
2602 -- Turn off name qualification after message output
2604 Error_Msg_Qual_Level := 0;
2607 -- Check for unconstrained array in exported foreign
2610 if Has_Foreign_Convention (E)
2611 and then not Is_Imported (E)
2612 and then Is_Array_Type (F_Type)
2613 and then not Is_Constrained (F_Type)
2614 and then Warn_On_Export_Import
2616 -- Exclude VM case, since both .NET and JVM can handle
2617 -- unconstrained arrays without a problem.
2619 and then VM_Target = No_VM
2621 Error_Msg_Qual_Level := 1;
2623 -- If this is an inherited operation, place the
2624 -- warning on the derived type declaration, rather
2625 -- than on the original subprogram.
2627 if Nkind (Original_Node (Parent (E))) =
2628 N_Full_Type_Declaration
2630 Warn_Node := Parent (E);
2632 if Formal = First_Formal (E) then
2634 ("?in inherited operation&", Warn_Node, E);
2637 Warn_Node := Formal;
2641 ("?type of argument& is unconstrained array",
2644 ("?foreign caller must pass bounds explicitly",
2646 Error_Msg_Qual_Level := 0;
2649 if not From_With_Type (F_Type) then
2650 if Is_Access_Type (F_Type) then
2651 F_Type := Designated_Type (F_Type);
2654 -- If the formal is an anonymous_access_to_subprogram
2655 -- freeze the subprogram type as well, to prevent
2656 -- scope anomalies in gigi, because there is no other
2657 -- clear point at which it could be frozen.
2659 if Is_Itype (Etype (Formal))
2660 and then Ekind (F_Type) = E_Subprogram_Type
2662 Freeze_And_Append (F_Type, N, Result);
2666 Next_Formal (Formal);
2669 -- Case of function: similar checks on return type
2671 if Ekind (E) = E_Function then
2673 -- Freeze return type
2675 R_Type := Etype (E);
2677 -- AI05-0151: the return type may have been incomplete
2678 -- at the point of declaration.
2680 if Ekind (R_Type) = E_Incomplete_Type
2681 and then Present (Full_View (R_Type))
2683 R_Type := Full_View (R_Type);
2684 Set_Etype (E, R_Type);
2687 Freeze_And_Append (R_Type, N, Result);
2689 -- Check suspicious return type for C function
2691 if Warn_On_Export_Import
2692 and then (Convention (E) = Convention_C
2694 Convention (E) = Convention_CPP)
2695 and then (Is_Imported (E) or else Is_Exported (E))
2697 -- Check suspicious return of fat C pointer
2699 if Is_Access_Type (R_Type)
2700 and then Esize (R_Type) > Ttypes.System_Address_Size
2701 and then not Has_Warnings_Off (E)
2702 and then not Has_Warnings_Off (R_Type)
2705 ("?return type of& does not "
2706 & "correspond to C pointer!", E);
2708 -- Check suspicious return of boolean
2710 elsif Root_Type (R_Type) = Standard_Boolean
2711 and then Convention (R_Type) = Convention_Ada
2712 and then VM_Target = No_VM
2713 and then not Has_Warnings_Off (E)
2714 and then not Has_Warnings_Off (R_Type)
2715 and then not Has_Size_Clause (R_Type)
2718 N : constant Node_Id :=
2719 Result_Definition (Declaration_Node (E));
2722 ("return type of & is an 8-bit Ada Boolean?",
2725 ("\use appropriate corresponding type in C "
2726 & "(e.g. char)?", N, E);
2729 -- Check suspicious return tagged type
2731 elsif (Is_Tagged_Type (R_Type)
2732 or else (Is_Access_Type (R_Type)
2735 (Designated_Type (R_Type))))
2736 and then Convention (E) = Convention_C
2737 and then not Has_Warnings_Off (E)
2738 and then not Has_Warnings_Off (R_Type)
2741 ("?return type of & does not "
2742 & "correspond to C type!", E);
2744 -- Check return of wrong convention subprogram pointer
2746 elsif Ekind (R_Type) = E_Access_Subprogram_Type
2747 and then not Has_Foreign_Convention (R_Type)
2748 and then not Has_Warnings_Off (E)
2749 and then not Has_Warnings_Off (R_Type)
2752 ("?& should return a foreign "
2753 & "convention subprogram pointer", E);
2754 Error_Msg_Sloc := Sloc (R_Type);
2756 ("\?add Convention pragma to declaration of& #",
2761 -- Give warning for suspicious return of a result of an
2762 -- unconstrained array type in a foreign convention
2765 if Has_Foreign_Convention (E)
2767 -- We are looking for a return of unconstrained array
2769 and then Is_Array_Type (R_Type)
2770 and then not Is_Constrained (R_Type)
2772 -- Exclude imported routines, the warning does not
2773 -- belong on the import, but rather on the routine
2776 and then not Is_Imported (E)
2778 -- Exclude VM case, since both .NET and JVM can handle
2779 -- return of unconstrained arrays without a problem.
2781 and then VM_Target = No_VM
2783 -- Check that general warning is enabled, and that it
2784 -- is not suppressed for this particular case.
2786 and then Warn_On_Export_Import
2787 and then not Has_Warnings_Off (E)
2788 and then not Has_Warnings_Off (R_Type)
2791 ("?foreign convention function& should not " &
2792 "return unconstrained array!", E);
2798 -- Must freeze its parent first if it is a derived subprogram
2800 if Present (Alias (E)) then
2801 Freeze_And_Append (Alias (E), N, Result);
2804 -- We don't freeze internal subprograms, because we don't normally
2805 -- want addition of extra formals or mechanism setting to happen
2806 -- for those. However we do pass through predefined dispatching
2807 -- cases, since extra formals may be needed in some cases, such as
2808 -- for the stream 'Input function (build-in-place formals).
2810 if not Is_Internal (E)
2811 or else Is_Predefined_Dispatching_Operation (E)
2813 Freeze_Subprogram (E);
2816 -- Here for other than a subprogram or type
2819 -- If entity has a type, and it is not a generic unit, then
2820 -- freeze it first (RM 13.14(10)).
2822 if Present (Etype (E))
2823 and then Ekind (E) /= E_Generic_Function
2825 Freeze_And_Append (Etype (E), N, Result);
2828 -- Special processing for objects created by object declaration
2830 if Nkind (Declaration_Node (E)) = N_Object_Declaration then
2832 -- Abstract type allowed only for C++ imported variables or
2835 -- Note: we inhibit this check for objects that do not come
2836 -- from source because there is at least one case (the
2837 -- expansion of x'Class'Input where x is abstract) where we
2838 -- legitimately generate an abstract object.
2840 if Is_Abstract_Type (Etype (E))
2841 and then Comes_From_Source (Parent (E))
2842 and then not (Is_Imported (E)
2843 and then Is_CPP_Class (Etype (E)))
2845 Error_Msg_N ("type of object cannot be abstract",
2846 Object_Definition (Parent (E)));
2848 if Is_CPP_Class (Etype (E)) then
2850 ("\} may need a cpp_constructor",
2851 Object_Definition (Parent (E)), Etype (E));
2855 -- For object created by object declaration, perform required
2856 -- categorization (preelaborate and pure) checks. Defer these
2857 -- checks to freeze time since pragma Import inhibits default
2858 -- initialization and thus pragma Import affects these checks.
2860 Validate_Object_Declaration (Declaration_Node (E));
2862 -- If there is an address clause, check that it is valid
2864 Check_Address_Clause (E);
2866 -- If the object needs any kind of default initialization, an
2867 -- error must be issued if No_Default_Initialization applies.
2868 -- The check doesn't apply to imported objects, which are not
2869 -- ever default initialized, and is why the check is deferred
2870 -- until freezing, at which point we know if Import applies.
2871 -- Deferred constants are also exempted from this test because
2872 -- their completion is explicit, or through an import pragma.
2874 if Ekind (E) = E_Constant
2875 and then Present (Full_View (E))
2879 elsif Comes_From_Source (E)
2880 and then not Is_Imported (E)
2881 and then not Has_Init_Expression (Declaration_Node (E))
2883 ((Has_Non_Null_Base_Init_Proc (Etype (E))
2884 and then not No_Initialization (Declaration_Node (E))
2885 and then not Is_Value_Type (Etype (E))
2886 and then not Initialization_Suppressed (Etype (E)))
2888 (Needs_Simple_Initialization (Etype (E))
2889 and then not Is_Internal (E)))
2891 Has_Default_Initialization := True;
2893 (No_Default_Initialization, Declaration_Node (E));
2896 -- Check that a Thread_Local_Storage variable does not have
2897 -- default initialization, and any explicit initialization must
2898 -- either be the null constant or a static constant.
2900 if Has_Pragma_Thread_Local_Storage (E) then
2902 Decl : constant Node_Id := Declaration_Node (E);
2904 if Has_Default_Initialization
2906 (Has_Init_Expression (Decl)
2908 (No (Expression (Decl))
2910 (Is_Static_Expression (Expression (Decl))
2912 Nkind (Expression (Decl)) = N_Null)))
2915 ("Thread_Local_Storage variable& is "
2916 & "improperly initialized", Decl, E);
2918 ("\only allowed initialization is explicit "
2919 & "NULL or static expression", Decl, E);
2924 -- For imported objects, set Is_Public unless there is also an
2925 -- address clause, which means that there is no external symbol
2926 -- needed for the Import (Is_Public may still be set for other
2927 -- unrelated reasons). Note that we delayed this processing
2928 -- till freeze time so that we can be sure not to set the flag
2929 -- if there is an address clause. If there is such a clause,
2930 -- then the only purpose of the Import pragma is to suppress
2931 -- implicit initialization.
2934 and then No (Address_Clause (E))
2939 -- For convention C objects of an enumeration type, warn if
2940 -- the size is not integer size and no explicit size given.
2941 -- Skip warning for Boolean, and Character, assume programmer
2942 -- expects 8-bit sizes for these cases.
2944 if (Convention (E) = Convention_C
2946 Convention (E) = Convention_CPP)
2947 and then Is_Enumeration_Type (Etype (E))
2948 and then not Is_Character_Type (Etype (E))
2949 and then not Is_Boolean_Type (Etype (E))
2950 and then Esize (Etype (E)) < Standard_Integer_Size
2951 and then not Has_Size_Clause (E)
2953 Error_Msg_Uint_1 := UI_From_Int (Standard_Integer_Size);
2955 ("?convention C enumeration object has size less than ^",
2957 Error_Msg_N ("\?use explicit size clause to set size", E);
2961 -- Check that a constant which has a pragma Volatile[_Components]
2962 -- or Atomic[_Components] also has a pragma Import (RM C.6(13)).
2964 -- Note: Atomic[_Components] also sets Volatile[_Components]
2966 if Ekind (E) = E_Constant
2967 and then (Has_Volatile_Components (E) or else Is_Volatile (E))
2968 and then not Is_Imported (E)
2970 -- Make sure we actually have a pragma, and have not merely
2971 -- inherited the indication from elsewhere (e.g. an address
2972 -- clause, which is not good enough in RM terms!)
2974 if Has_Rep_Pragma (E, Name_Atomic)
2976 Has_Rep_Pragma (E, Name_Atomic_Components)
2979 ("stand alone atomic constant must be " &
2980 "imported (RM C.6(13))", E);
2982 elsif Has_Rep_Pragma (E, Name_Volatile)
2984 Has_Rep_Pragma (E, Name_Volatile_Components)
2987 ("stand alone volatile constant must be " &
2988 "imported (RM C.6(13))", E);
2992 -- Static objects require special handling
2994 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
2995 and then Is_Statically_Allocated (E)
2997 Freeze_Static_Object (E);
3000 -- Remaining step is to layout objects
3002 if Ekind (E) = E_Variable
3004 Ekind (E) = E_Constant
3006 Ekind (E) = E_Loop_Parameter
3014 -- Case of a type or subtype being frozen
3017 -- We used to check here that a full type must have preelaborable
3018 -- initialization if it completes a private type specified with
3019 -- pragma Preelaborable_Initialization, but that missed cases where
3020 -- the types occur within a generic package, since the freezing
3021 -- that occurs within a containing scope generally skips traversal
3022 -- of a generic unit's declarations (those will be frozen within
3023 -- instances). This check was moved to Analyze_Package_Specification.
3025 -- The type may be defined in a generic unit. This can occur when
3026 -- freezing a generic function that returns the type (which is
3027 -- defined in a parent unit). It is clearly meaningless to freeze
3028 -- this type. However, if it is a subtype, its size may be determi-
3029 -- nable and used in subsequent checks, so might as well try to
3032 if Present (Scope (E))
3033 and then Is_Generic_Unit (Scope (E))
3035 Check_Compile_Time_Size (E);
3039 -- Deal with special cases of freezing for subtype
3041 if E /= Base_Type (E) then
3043 -- Before we do anything else, a specialized test for the case of
3044 -- a size given for an array where the array needs to be packed,
3045 -- but was not so the size cannot be honored. This would of course
3046 -- be caught by the backend, and indeed we don't catch all cases.
3047 -- The point is that we can give a better error message in those
3048 -- cases that we do catch with the circuitry here. Also if pragma
3049 -- Implicit_Packing is set, this is where the packing occurs.
3051 -- The reason we do this so early is that the processing in the
3052 -- automatic packing case affects the layout of the base type, so
3053 -- it must be done before we freeze the base type.
3055 if Is_Array_Type (E) then
3058 Ctyp : constant Entity_Id := Component_Type (E);
3061 -- Check enabling conditions. These are straightforward
3062 -- except for the test for a limited composite type. This
3063 -- eliminates the rare case of a array of limited components
3064 -- where there are issues of whether or not we can go ahead
3065 -- and pack the array (since we can't freely pack and unpack
3066 -- arrays if they are limited).
3068 -- Note that we check the root type explicitly because the
3069 -- whole point is we are doing this test before we have had
3070 -- a chance to freeze the base type (and it is that freeze
3071 -- action that causes stuff to be inherited).
3073 if Present (Size_Clause (E))
3074 and then Known_Static_RM_Size (E)
3075 and then not Is_Packed (E)
3076 and then not Has_Pragma_Pack (E)
3077 and then Number_Dimensions (E) = 1
3078 and then not Has_Component_Size_Clause (E)
3079 and then Known_Static_RM_Size (Ctyp)
3080 and then not Is_Limited_Composite (E)
3081 and then not Is_Packed (Root_Type (E))
3082 and then not Has_Component_Size_Clause (Root_Type (E))
3083 and then not (CodePeer_Mode or Alfa_Mode)
3085 Get_Index_Bounds (First_Index (E), Lo, Hi);
3087 if Compile_Time_Known_Value (Lo)
3088 and then Compile_Time_Known_Value (Hi)
3089 and then Known_Static_RM_Size (Ctyp)
3090 and then RM_Size (Ctyp) < 64
3093 Lov : constant Uint := Expr_Value (Lo);
3094 Hiv : constant Uint := Expr_Value (Hi);
3095 Len : constant Uint := UI_Max
3098 Rsiz : constant Uint := RM_Size (Ctyp);
3099 SZ : constant Node_Id := Size_Clause (E);
3100 Btyp : constant Entity_Id := Base_Type (E);
3102 -- What we are looking for here is the situation where
3103 -- the RM_Size given would be exactly right if there
3104 -- was a pragma Pack (resulting in the component size
3105 -- being the same as the RM_Size). Furthermore, the
3106 -- component type size must be an odd size (not a
3107 -- multiple of storage unit). If the component RM size
3108 -- is an exact number of storage units that is a power
3109 -- of two, the array is not packed and has a standard
3113 if RM_Size (E) = Len * Rsiz
3114 and then Rsiz mod System_Storage_Unit /= 0
3116 -- For implicit packing mode, just set the
3117 -- component size silently.
3119 if Implicit_Packing then
3120 Set_Component_Size (Btyp, Rsiz);
3121 Set_Is_Bit_Packed_Array (Btyp);
3122 Set_Is_Packed (Btyp);
3123 Set_Has_Non_Standard_Rep (Btyp);
3125 -- Otherwise give an error message
3129 ("size given for& too small", SZ, E);
3130 Error_Msg_N -- CODEFIX
3131 ("\use explicit pragma Pack "
3132 & "or use pragma Implicit_Packing", SZ);
3135 elsif RM_Size (E) = Len * Rsiz
3136 and then Implicit_Packing
3138 (Rsiz / System_Storage_Unit = 1
3139 or else Rsiz / System_Storage_Unit = 2
3140 or else Rsiz / System_Storage_Unit = 4)
3143 -- Not a packed array, but indicate the desired
3144 -- component size, for the back-end.
3146 Set_Component_Size (Btyp, Rsiz);
3154 -- If ancestor subtype present, freeze that first. Note that this
3155 -- will also get the base type frozen. Need RM reference ???
3157 Atype := Ancestor_Subtype (E);
3159 if Present (Atype) then
3160 Freeze_And_Append (Atype, N, Result);
3162 -- No ancestor subtype present
3165 -- See if we have a nearest ancestor that has a predicate.
3166 -- That catches the case of derived type with a predicate.
3167 -- Need RM reference here ???
3169 Atype := Nearest_Ancestor (E);
3171 if Present (Atype) and then Has_Predicates (Atype) then
3172 Freeze_And_Append (Atype, N, Result);
3175 -- Freeze base type before freezing the entity (RM 13.14(15))
3177 if E /= Base_Type (E) then
3178 Freeze_And_Append (Base_Type (E), N, Result);
3182 -- For a derived type, freeze its parent type first (RM 13.14(15))
3184 elsif Is_Derived_Type (E) then
3185 Freeze_And_Append (Etype (E), N, Result);
3186 Freeze_And_Append (First_Subtype (Etype (E)), N, Result);
3189 -- For array type, freeze index types and component type first
3190 -- before freezing the array (RM 13.14(15)).
3192 if Is_Array_Type (E) then
3194 FS : constant Entity_Id := First_Subtype (E);
3195 Ctyp : constant Entity_Id := Component_Type (E);
3198 Non_Standard_Enum : Boolean := False;
3199 -- Set true if any of the index types is an enumeration type
3200 -- with a non-standard representation.
3203 Freeze_And_Append (Ctyp, N, Result);
3205 Indx := First_Index (E);
3206 while Present (Indx) loop
3207 Freeze_And_Append (Etype (Indx), N, Result);
3209 if Is_Enumeration_Type (Etype (Indx))
3210 and then Has_Non_Standard_Rep (Etype (Indx))
3212 Non_Standard_Enum := True;
3218 -- Processing that is done only for base types
3220 if Ekind (E) = E_Array_Type then
3222 -- Propagate flags for component type
3224 if Is_Controlled (Component_Type (E))
3225 or else Has_Controlled_Component (Ctyp)
3227 Set_Has_Controlled_Component (E);
3230 if Has_Unchecked_Union (Component_Type (E)) then
3231 Set_Has_Unchecked_Union (E);
3234 -- If packing was requested or if the component size was set
3235 -- explicitly, then see if bit packing is required. This
3236 -- processing is only done for base types, since all the
3237 -- representation aspects involved are type-related. This
3238 -- is not just an optimization, if we start processing the
3239 -- subtypes, they interfere with the settings on the base
3240 -- type (this is because Is_Packed has a slightly different
3241 -- meaning before and after freezing).
3248 if (Is_Packed (E) or else Has_Pragma_Pack (E))
3249 and then Known_Static_RM_Size (Ctyp)
3250 and then not Has_Component_Size_Clause (E)
3252 Csiz := UI_Max (RM_Size (Ctyp), 1);
3254 elsif Known_Component_Size (E) then
3255 Csiz := Component_Size (E);
3257 elsif not Known_Static_Esize (Ctyp) then
3261 Esiz := Esize (Ctyp);
3263 -- We can set the component size if it is less than
3264 -- 16, rounding it up to the next storage unit size.
3268 elsif Esiz <= 16 then
3274 -- Set component size up to match alignment if it
3275 -- would otherwise be less than the alignment. This
3276 -- deals with cases of types whose alignment exceeds
3277 -- their size (padded types).
3281 A : constant Uint := Alignment_In_Bits (Ctyp);
3290 -- Case of component size that may result in packing
3292 if 1 <= Csiz and then Csiz <= 64 then
3294 Ent : constant Entity_Id :=
3296 Pack_Pragma : constant Node_Id :=
3297 Get_Rep_Pragma (Ent, Name_Pack);
3298 Comp_Size_C : constant Node_Id :=
3299 Get_Attribute_Definition_Clause
3300 (Ent, Attribute_Component_Size);
3302 -- Warn if we have pack and component size so that
3303 -- the pack is ignored.
3305 -- Note: here we must check for the presence of a
3306 -- component size before checking for a Pack pragma
3307 -- to deal with the case where the array type is a
3308 -- derived type whose parent is currently private.
3310 if Present (Comp_Size_C)
3311 and then Has_Pragma_Pack (Ent)
3312 and then Warn_On_Redundant_Constructs
3314 Error_Msg_Sloc := Sloc (Comp_Size_C);
3316 ("?pragma Pack for& ignored!",
3319 ("\?explicit component size given#!",
3321 Set_Is_Packed (Base_Type (Ent), False);
3322 Set_Is_Bit_Packed_Array (Base_Type (Ent), False);
3325 -- Set component size if not already set by a
3326 -- component size clause.
3328 if not Present (Comp_Size_C) then
3329 Set_Component_Size (E, Csiz);
3332 -- Check for base type of 8, 16, 32 bits, where an
3333 -- unsigned subtype has a length one less than the
3334 -- base type (e.g. Natural subtype of Integer).
3336 -- In such cases, if a component size was not set
3337 -- explicitly, then generate a warning.
3339 if Has_Pragma_Pack (E)
3340 and then not Present (Comp_Size_C)
3342 (Csiz = 7 or else Csiz = 15 or else Csiz = 31)
3343 and then Esize (Base_Type (Ctyp)) = Csiz + 1
3345 Error_Msg_Uint_1 := Csiz;
3347 if Present (Pack_Pragma) then
3349 ("?pragma Pack causes component size "
3350 & "to be ^!", Pack_Pragma);
3352 ("\?use Component_Size to set "
3353 & "desired value!", Pack_Pragma);
3357 -- Actual packing is not needed for 8, 16, 32, 64.
3358 -- Also not needed for 24 if alignment is 1.
3364 or else (Csiz = 24 and then Alignment (Ctyp) = 1)
3366 -- Here the array was requested to be packed,
3367 -- but the packing request had no effect, so
3368 -- Is_Packed is reset.
3370 -- Note: semantically this means that we lose
3371 -- track of the fact that a derived type
3372 -- inherited a pragma Pack that was non-
3373 -- effective, but that seems fine.
3375 -- We regard a Pack pragma as a request to set
3376 -- a representation characteristic, and this
3377 -- request may be ignored.
3379 Set_Is_Packed (Base_Type (E), False);
3380 Set_Is_Bit_Packed_Array (Base_Type (E), False);
3382 if Known_Static_Esize (Component_Type (E))
3383 and then Esize (Component_Type (E)) = Csiz
3385 Set_Has_Non_Standard_Rep
3386 (Base_Type (E), False);
3389 -- In all other cases, packing is indeed needed
3392 Set_Has_Non_Standard_Rep (Base_Type (E), True);
3393 Set_Is_Bit_Packed_Array (Base_Type (E), True);
3394 Set_Is_Packed (Base_Type (E), True);
3400 -- Check for Atomic_Components or Aliased with unsuitable
3401 -- packing or explicit component size clause given.
3403 if (Has_Atomic_Components (E)
3404 or else Has_Aliased_Components (E))
3405 and then (Has_Component_Size_Clause (E)
3406 or else Is_Packed (E))
3408 Alias_Atomic_Check : declare
3410 procedure Complain_CS (T : String);
3411 -- Outputs error messages for incorrect CS clause or
3412 -- pragma Pack for aliased or atomic components (T is
3413 -- "aliased" or "atomic");
3419 procedure Complain_CS (T : String) is
3421 if Has_Component_Size_Clause (E) then
3423 Get_Attribute_Definition_Clause
3424 (FS, Attribute_Component_Size);
3426 if Known_Static_Esize (Ctyp) then
3428 ("incorrect component size for "
3429 & T & " components", Clause);
3430 Error_Msg_Uint_1 := Esize (Ctyp);
3432 ("\only allowed value is^", Clause);
3436 ("component size cannot be given for "
3437 & T & " components", Clause);
3442 ("cannot pack " & T & " components",
3443 Get_Rep_Pragma (FS, Name_Pack));
3449 -- Start of processing for Alias_Atomic_Check
3453 -- If object size of component type isn't known, we
3454 -- cannot be sure so we defer to the back end.
3456 if not Known_Static_Esize (Ctyp) then
3459 -- Case where component size has no effect. First
3460 -- check for object size of component type multiple
3461 -- of the storage unit size.
3463 elsif Esize (Ctyp) mod System_Storage_Unit = 0
3465 -- OK in both packing case and component size case
3466 -- if RM size is known and static and the same as
3470 ((Known_Static_RM_Size (Ctyp)
3471 and then Esize (Ctyp) = RM_Size (Ctyp))
3473 -- Or if we have an explicit component size
3474 -- clause and the component size and object size
3478 (Has_Component_Size_Clause (E)
3479 and then Component_Size (E) = Esize (Ctyp)))
3483 elsif Has_Aliased_Components (E)
3484 or else Is_Aliased (Ctyp)
3486 Complain_CS ("aliased");
3488 elsif Has_Atomic_Components (E)
3489 or else Is_Atomic (Ctyp)
3491 Complain_CS ("atomic");
3493 end Alias_Atomic_Check;
3496 -- Warn for case of atomic type
3498 Clause := Get_Rep_Pragma (FS, Name_Atomic);
3501 and then not Addressable (Component_Size (FS))
3504 ("non-atomic components of type& may not be "
3505 & "accessible by separate tasks?", Clause, E);
3507 if Has_Component_Size_Clause (E) then
3510 (Get_Attribute_Definition_Clause
3511 (FS, Attribute_Component_Size));
3513 ("\because of component size clause#?",
3516 elsif Has_Pragma_Pack (E) then
3518 Sloc (Get_Rep_Pragma (FS, Name_Pack));
3520 ("\because of pragma Pack#?", Clause);
3524 -- Processing that is done only for subtypes
3527 -- Acquire alignment from base type
3529 if Unknown_Alignment (E) then
3530 Set_Alignment (E, Alignment (Base_Type (E)));
3531 Adjust_Esize_Alignment (E);
3535 -- For bit-packed arrays, check the size
3537 if Is_Bit_Packed_Array (E) and then Known_RM_Size (E) then
3539 SizC : constant Node_Id := Size_Clause (E);
3542 pragma Warnings (Off, Discard);
3545 -- It is not clear if it is possible to have no size
3546 -- clause at this stage, but it is not worth worrying
3547 -- about. Post error on the entity name in the size
3548 -- clause if present, else on the type entity itself.
3550 if Present (SizC) then
3551 Check_Size (Name (SizC), E, RM_Size (E), Discard);
3553 Check_Size (E, E, RM_Size (E), Discard);
3558 -- If any of the index types was an enumeration type with a
3559 -- non-standard rep clause, then we indicate that the array
3560 -- type is always packed (even if it is not bit packed).
3562 if Non_Standard_Enum then
3563 Set_Has_Non_Standard_Rep (Base_Type (E));
3564 Set_Is_Packed (Base_Type (E));
3567 Set_Component_Alignment_If_Not_Set (E);
3569 -- If the array is packed, we must create the packed array
3570 -- type to be used to actually implement the type. This is
3571 -- only needed for real array types (not for string literal
3572 -- types, since they are present only for the front end).
3575 and then Ekind (E) /= E_String_Literal_Subtype
3577 Create_Packed_Array_Type (E);
3578 Freeze_And_Append (Packed_Array_Type (E), N, Result);
3580 -- Size information of packed array type is copied to the
3581 -- array type, since this is really the representation. But
3582 -- do not override explicit existing size values. If the
3583 -- ancestor subtype is constrained the packed_array_type
3584 -- will be inherited from it, but the size may have been
3585 -- provided already, and must not be overridden either.
3587 if not Has_Size_Clause (E)
3589 (No (Ancestor_Subtype (E))
3590 or else not Has_Size_Clause (Ancestor_Subtype (E)))
3592 Set_Esize (E, Esize (Packed_Array_Type (E)));
3593 Set_RM_Size (E, RM_Size (Packed_Array_Type (E)));
3596 if not Has_Alignment_Clause (E) then
3597 Set_Alignment (E, Alignment (Packed_Array_Type (E)));
3601 -- For non-packed arrays set the alignment of the array to the
3602 -- alignment of the component type if it is unknown. Skip this
3603 -- in atomic case (atomic arrays may need larger alignments).
3605 if not Is_Packed (E)
3606 and then Unknown_Alignment (E)
3607 and then Known_Alignment (Ctyp)
3608 and then Known_Static_Component_Size (E)
3609 and then Known_Static_Esize (Ctyp)
3610 and then Esize (Ctyp) = Component_Size (E)
3611 and then not Is_Atomic (E)
3613 Set_Alignment (E, Alignment (Component_Type (E)));
3617 -- For a class-wide type, the corresponding specific type is
3618 -- frozen as well (RM 13.14(15))
3620 elsif Is_Class_Wide_Type (E) then
3621 Freeze_And_Append (Root_Type (E), N, Result);
3623 -- If the base type of the class-wide type is still incomplete,
3624 -- the class-wide remains unfrozen as well. This is legal when
3625 -- E is the formal of a primitive operation of some other type
3626 -- which is being frozen.
3628 if not Is_Frozen (Root_Type (E)) then
3629 Set_Is_Frozen (E, False);
3633 -- If the Class_Wide_Type is an Itype (when type is the anonymous
3634 -- parent of a derived type) and it is a library-level entity,
3635 -- generate an itype reference for it. Otherwise, its first
3636 -- explicit reference may be in an inner scope, which will be
3637 -- rejected by the back-end.
3640 and then Is_Compilation_Unit (Scope (E))
3643 Ref : constant Node_Id := Make_Itype_Reference (Loc);
3647 Add_To_Result (Ref);
3651 -- The equivalent type associated with a class-wide subtype needs
3652 -- to be frozen to ensure that its layout is done.
3654 if Ekind (E) = E_Class_Wide_Subtype
3655 and then Present (Equivalent_Type (E))
3657 Freeze_And_Append (Equivalent_Type (E), N, Result);
3660 -- For a record (sub)type, freeze all the component types (RM
3661 -- 13.14(15). We test for E_Record_(sub)Type here, rather than using
3662 -- Is_Record_Type, because we don't want to attempt the freeze for
3663 -- the case of a private type with record extension (we will do that
3664 -- later when the full type is frozen).
3666 elsif Ekind (E) = E_Record_Type
3667 or else Ekind (E) = E_Record_Subtype
3669 Freeze_Record_Type (E);
3671 -- For a concurrent type, freeze corresponding record type. This
3672 -- does not correspond to any specific rule in the RM, but the
3673 -- record type is essentially part of the concurrent type.
3674 -- Freeze as well all local entities. This includes record types
3675 -- created for entry parameter blocks, and whatever local entities
3676 -- may appear in the private part.
3678 elsif Is_Concurrent_Type (E) then
3679 if Present (Corresponding_Record_Type (E)) then
3681 (Corresponding_Record_Type (E), N, Result);
3684 Comp := First_Entity (E);
3685 while Present (Comp) loop
3686 if Is_Type (Comp) then
3687 Freeze_And_Append (Comp, N, Result);
3689 elsif (Ekind (Comp)) /= E_Function then
3690 if Is_Itype (Etype (Comp))
3691 and then Underlying_Type (Scope (Etype (Comp))) = E
3693 Undelay_Type (Etype (Comp));
3696 Freeze_And_Append (Etype (Comp), N, Result);
3702 -- Private types are required to point to the same freeze node as
3703 -- their corresponding full views. The freeze node itself has to
3704 -- point to the partial view of the entity (because from the partial
3705 -- view, we can retrieve the full view, but not the reverse).
3706 -- However, in order to freeze correctly, we need to freeze the full
3707 -- view. If we are freezing at the end of a scope (or within the
3708 -- scope of the private type), the partial and full views will have
3709 -- been swapped, the full view appears first in the entity chain and
3710 -- the swapping mechanism ensures that the pointers are properly set
3713 -- If we encounter the partial view before the full view (e.g. when
3714 -- freezing from another scope), we freeze the full view, and then
3715 -- set the pointers appropriately since we cannot rely on swapping to
3716 -- fix things up (subtypes in an outer scope might not get swapped).
3718 elsif Is_Incomplete_Or_Private_Type (E)
3719 and then not Is_Generic_Type (E)
3721 -- The construction of the dispatch table associated with library
3722 -- level tagged types forces freezing of all the primitives of the
3723 -- type, which may cause premature freezing of the partial view.
3727 -- type T is tagged private;
3728 -- type DT is new T with private;
3729 -- procedure Prim (X : in out T; Y : in out DT'Class);
3731 -- type T is tagged null record;
3733 -- type DT is new T with null record;
3736 -- In this case the type will be frozen later by the usual
3737 -- mechanism: an object declaration, an instantiation, or the
3738 -- end of a declarative part.
3740 if Is_Library_Level_Tagged_Type (E)
3741 and then not Present (Full_View (E))
3743 Set_Is_Frozen (E, False);
3746 -- Case of full view present
3748 elsif Present (Full_View (E)) then
3750 -- If full view has already been frozen, then no further
3751 -- processing is required
3753 if Is_Frozen (Full_View (E)) then
3754 Set_Has_Delayed_Freeze (E, False);
3755 Set_Freeze_Node (E, Empty);
3756 Check_Debug_Info_Needed (E);
3758 -- Otherwise freeze full view and patch the pointers so that
3759 -- the freeze node will elaborate both views in the back-end.
3763 Full : constant Entity_Id := Full_View (E);
3766 if Is_Private_Type (Full)
3767 and then Present (Underlying_Full_View (Full))
3770 (Underlying_Full_View (Full), N, Result);
3773 Freeze_And_Append (Full, N, Result);
3775 if Has_Delayed_Freeze (E) then
3776 F_Node := Freeze_Node (Full);
3778 if Present (F_Node) then
3779 Set_Freeze_Node (E, F_Node);
3780 Set_Entity (F_Node, E);
3783 -- {Incomplete,Private}_Subtypes with Full_Views
3784 -- constrained by discriminants.
3786 Set_Has_Delayed_Freeze (E, False);
3787 Set_Freeze_Node (E, Empty);
3792 Check_Debug_Info_Needed (E);
3795 -- AI-117 requires that the convention of a partial view be the
3796 -- same as the convention of the full view. Note that this is a
3797 -- recognized breach of privacy, but it's essential for logical
3798 -- consistency of representation, and the lack of a rule in
3799 -- RM95 was an oversight.
3801 Set_Convention (E, Convention (Full_View (E)));
3803 Set_Size_Known_At_Compile_Time (E,
3804 Size_Known_At_Compile_Time (Full_View (E)));
3806 -- Size information is copied from the full view to the
3807 -- incomplete or private view for consistency.
3809 -- We skip this is the full view is not a type. This is very
3810 -- strange of course, and can only happen as a result of
3811 -- certain illegalities, such as a premature attempt to derive
3812 -- from an incomplete type.
3814 if Is_Type (Full_View (E)) then
3815 Set_Size_Info (E, Full_View (E));
3816 Set_RM_Size (E, RM_Size (Full_View (E)));
3821 -- Case of no full view present. If entity is derived or subtype,
3822 -- it is safe to freeze, correctness depends on the frozen status
3823 -- of parent. Otherwise it is either premature usage, or a Taft
3824 -- amendment type, so diagnosis is at the point of use and the
3825 -- type might be frozen later.
3827 elsif E /= Base_Type (E)
3828 or else Is_Derived_Type (E)
3833 Set_Is_Frozen (E, False);
3837 -- For access subprogram, freeze types of all formals, the return
3838 -- type was already frozen, since it is the Etype of the function.
3839 -- Formal types can be tagged Taft amendment types, but otherwise
3840 -- they cannot be incomplete.
3842 elsif Ekind (E) = E_Subprogram_Type then
3843 Formal := First_Formal (E);
3844 while Present (Formal) loop
3845 if Ekind (Etype (Formal)) = E_Incomplete_Type
3846 and then No (Full_View (Etype (Formal)))
3847 and then not Is_Value_Type (Etype (Formal))
3849 if Is_Tagged_Type (Etype (Formal)) then
3852 -- AI05-151: Incomplete types are allowed in access to
3853 -- subprogram specifications.
3855 elsif Ada_Version < Ada_2012 then
3857 ("invalid use of incomplete type&", E, Etype (Formal));
3861 Freeze_And_Append (Etype (Formal), N, Result);
3862 Next_Formal (Formal);
3865 Freeze_Subprogram (E);
3867 -- For access to a protected subprogram, freeze the equivalent type
3868 -- (however this is not set if we are not generating code or if this
3869 -- is an anonymous type used just for resolution).
3871 elsif Is_Access_Protected_Subprogram_Type (E) then
3872 if Present (Equivalent_Type (E)) then
3873 Freeze_And_Append (Equivalent_Type (E), N, Result);
3877 -- Generic types are never seen by the back-end, and are also not
3878 -- processed by the expander (since the expander is turned off for
3879 -- generic processing), so we never need freeze nodes for them.
3881 if Is_Generic_Type (E) then
3885 -- Some special processing for non-generic types to complete
3886 -- representation details not known till the freeze point.
3888 if Is_Fixed_Point_Type (E) then
3889 Freeze_Fixed_Point_Type (E);
3891 -- Some error checks required for ordinary fixed-point type. Defer
3892 -- these till the freeze-point since we need the small and range
3893 -- values. We only do these checks for base types
3895 if Is_Ordinary_Fixed_Point_Type (E) and then Is_Base_Type (E) then
3896 if Small_Value (E) < Ureal_2_M_80 then
3897 Error_Msg_Name_1 := Name_Small;
3899 ("`&''%` too small, minimum allowed is 2.0'*'*(-80)", E);
3901 elsif Small_Value (E) > Ureal_2_80 then
3902 Error_Msg_Name_1 := Name_Small;
3904 ("`&''%` too large, maximum allowed is 2.0'*'*80", E);
3907 if Expr_Value_R (Type_Low_Bound (E)) < Ureal_M_10_36 then
3908 Error_Msg_Name_1 := Name_First;
3910 ("`&''%` too small, minimum allowed is -10.0'*'*36", E);
3913 if Expr_Value_R (Type_High_Bound (E)) > Ureal_10_36 then
3914 Error_Msg_Name_1 := Name_Last;
3916 ("`&''%` too large, maximum allowed is 10.0'*'*36", E);
3920 elsif Is_Enumeration_Type (E) then
3921 Freeze_Enumeration_Type (E);
3923 elsif Is_Integer_Type (E) then
3924 Adjust_Esize_For_Alignment (E);
3926 if Is_Modular_Integer_Type (E)
3927 and then Warn_On_Suspicious_Modulus_Value
3929 Check_Suspicious_Modulus (E);
3932 elsif Is_Access_Type (E) then
3934 -- If a pragma Default_Storage_Pool applies, and this type has no
3935 -- Storage_Pool or Storage_Size clause (which must have occurred
3936 -- before the freezing point), then use the default. This applies
3937 -- only to base types.
3939 if Present (Default_Pool)
3940 and then Is_Base_Type (E)
3941 and then not Has_Storage_Size_Clause (E)
3942 and then No (Associated_Storage_Pool (E))
3944 -- Case of pragma Default_Storage_Pool (null)
3946 if Nkind (Default_Pool) = N_Null then
3947 Set_No_Pool_Assigned (E);
3949 -- Case of pragma Default_Storage_Pool (storage_pool_NAME)
3952 Set_Associated_Storage_Pool (E, Entity (Default_Pool));
3956 -- Check restriction for standard storage pool
3958 if No (Associated_Storage_Pool (E)) then
3959 Check_Restriction (No_Standard_Storage_Pools, E);
3962 -- Deal with error message for pure access type. This is not an
3963 -- error in Ada 2005 if there is no pool (see AI-366).
3965 if Is_Pure_Unit_Access_Type (E)
3966 and then (Ada_Version < Ada_2005
3967 or else not No_Pool_Assigned (E))
3969 Error_Msg_N ("named access type not allowed in pure unit", E);
3971 if Ada_Version >= Ada_2005 then
3973 ("\would be legal if Storage_Size of 0 given?", E);
3975 elsif No_Pool_Assigned (E) then
3977 ("\would be legal in Ada 2005?", E);
3981 ("\would be legal in Ada 2005 if "
3982 & "Storage_Size of 0 given?", E);
3987 -- Case of composite types
3989 if Is_Composite_Type (E) then
3991 -- AI-117 requires that all new primitives of a tagged type must
3992 -- inherit the convention of the full view of the type. Inherited
3993 -- and overriding operations are defined to inherit the convention
3994 -- of their parent or overridden subprogram (also specified in
3995 -- AI-117), which will have occurred earlier (in Derive_Subprogram
3996 -- and New_Overloaded_Entity). Here we set the convention of
3997 -- primitives that are still convention Ada, which will ensure
3998 -- that any new primitives inherit the type's convention. Class-
3999 -- wide types can have a foreign convention inherited from their
4000 -- specific type, but are excluded from this since they don't have
4001 -- any associated primitives.
4003 if Is_Tagged_Type (E)
4004 and then not Is_Class_Wide_Type (E)
4005 and then Convention (E) /= Convention_Ada
4008 Prim_List : constant Elist_Id := Primitive_Operations (E);
4012 Prim := First_Elmt (Prim_List);
4013 while Present (Prim) loop
4014 if Convention (Node (Prim)) = Convention_Ada then
4015 Set_Convention (Node (Prim), Convention (E));
4024 -- Now that all types from which E may depend are frozen, see if the
4025 -- size is known at compile time, if it must be unsigned, or if
4026 -- strict alignment is required
4028 Check_Compile_Time_Size (E);
4029 Check_Unsigned_Type (E);
4031 if Base_Type (E) = E then
4032 Check_Strict_Alignment (E);
4035 -- Do not allow a size clause for a type which does not have a size
4036 -- that is known at compile time
4038 if Has_Size_Clause (E)
4039 and then not Size_Known_At_Compile_Time (E)
4041 -- Suppress this message if errors posted on E, even if we are
4042 -- in all errors mode, since this is often a junk message
4044 if not Error_Posted (E) then
4046 ("size clause not allowed for variable length type",
4051 -- Now we set/verify the representation information, in particular
4052 -- the size and alignment values. This processing is not required for
4053 -- generic types, since generic types do not play any part in code
4054 -- generation, and so the size and alignment values for such types
4057 if Is_Generic_Type (E) then
4060 -- Otherwise we call the layout procedure
4066 -- If this is an access to subprogram whose designated type is itself
4067 -- a subprogram type, the return type of this anonymous subprogram
4068 -- type must be decorated as well.
4070 if Ekind (E) = E_Anonymous_Access_Subprogram_Type
4071 and then Ekind (Designated_Type (E)) = E_Subprogram_Type
4073 Layout_Type (Etype (Designated_Type (E)));
4076 -- If the type has a Defaut_Value/Default_Component_Value aspect,
4077 -- this is where we analye the expression (after the type is frozen,
4078 -- since in the case of Default_Value, we are analyzing with the
4079 -- type itself, and we treat Default_Component_Value similarly for
4080 -- the sake of uniformity.
4082 if Is_First_Subtype (E) and then Has_Default_Aspect (E) then
4090 if Is_Scalar_Type (E) then
4091 Nam := Name_Default_Value;
4094 Nam := Name_Default_Component_Value;
4095 Typ := Component_Type (E);
4098 Aspect := Get_Rep_Item_For_Entity (E, Nam);
4099 Exp := Expression (Aspect);
4100 Analyze_And_Resolve (Exp, Typ);
4102 if Etype (Exp) /= Any_Type then
4103 if not Is_Static_Expression (Exp) then
4104 Error_Msg_Name_1 := Nam;
4105 Flag_Non_Static_Expr
4106 ("aspect% requires static expression", Exp);
4112 -- End of freeze processing for type entities
4115 -- Here is where we logically freeze the current entity. If it has a
4116 -- freeze node, then this is the point at which the freeze node is
4117 -- linked into the result list.
4119 if Has_Delayed_Freeze (E) then
4121 -- If a freeze node is already allocated, use it, otherwise allocate
4122 -- a new one. The preallocation happens in the case of anonymous base
4123 -- types, where we preallocate so that we can set First_Subtype_Link.
4124 -- Note that we reset the Sloc to the current freeze location.
4126 if Present (Freeze_Node (E)) then
4127 F_Node := Freeze_Node (E);
4128 Set_Sloc (F_Node, Loc);
4131 F_Node := New_Node (N_Freeze_Entity, Loc);
4132 Set_Freeze_Node (E, F_Node);
4133 Set_Access_Types_To_Process (F_Node, No_Elist);
4134 Set_TSS_Elist (F_Node, No_Elist);
4135 Set_Actions (F_Node, No_List);
4138 Set_Entity (F_Node, E);
4139 Add_To_Result (F_Node);
4141 -- A final pass over record types with discriminants. If the type
4142 -- has an incomplete declaration, there may be constrained access
4143 -- subtypes declared elsewhere, which do not depend on the discrimi-
4144 -- nants of the type, and which are used as component types (i.e.
4145 -- the full view is a recursive type). The designated types of these
4146 -- subtypes can only be elaborated after the type itself, and they
4147 -- need an itype reference.
4149 if Ekind (E) = E_Record_Type
4150 and then Has_Discriminants (E)
4158 Comp := First_Component (E);
4159 while Present (Comp) loop
4160 Typ := Etype (Comp);
4162 if Ekind (Comp) = E_Component
4163 and then Is_Access_Type (Typ)
4164 and then Scope (Typ) /= E
4165 and then Base_Type (Designated_Type (Typ)) = E
4166 and then Is_Itype (Designated_Type (Typ))
4168 IR := Make_Itype_Reference (Sloc (Comp));
4169 Set_Itype (IR, Designated_Type (Typ));
4170 Append (IR, Result);
4173 Next_Component (Comp);
4179 -- When a type is frozen, the first subtype of the type is frozen as
4180 -- well (RM 13.14(15)). This has to be done after freezing the type,
4181 -- since obviously the first subtype depends on its own base type.
4184 Freeze_And_Append (First_Subtype (E), N, Result);
4186 -- If we just froze a tagged non-class wide record, then freeze the
4187 -- corresponding class-wide type. This must be done after the tagged
4188 -- type itself is frozen, because the class-wide type refers to the
4189 -- tagged type which generates the class.
4191 if Is_Tagged_Type (E)
4192 and then not Is_Class_Wide_Type (E)
4193 and then Present (Class_Wide_Type (E))
4195 Freeze_And_Append (Class_Wide_Type (E), N, Result);
4199 Check_Debug_Info_Needed (E);
4201 -- Special handling for subprograms
4203 if Is_Subprogram (E) then
4205 -- If subprogram has address clause then reset Is_Public flag, since
4206 -- we do not want the backend to generate external references.
4208 if Present (Address_Clause (E))
4209 and then not Is_Library_Level_Entity (E)
4211 Set_Is_Public (E, False);
4213 -- If no address clause and not intrinsic, then for imported
4214 -- subprogram in main unit, generate descriptor if we are in
4215 -- Propagate_Exceptions mode.
4217 -- This is very odd code, it makes a null result, why ???
4219 elsif Propagate_Exceptions
4220 and then Is_Imported (E)
4221 and then not Is_Intrinsic_Subprogram (E)
4222 and then Convention (E) /= Convention_Stubbed
4224 if Result = No_List then
4225 Result := Empty_List;
4233 -----------------------------
4234 -- Freeze_Enumeration_Type --
4235 -----------------------------
4237 procedure Freeze_Enumeration_Type (Typ : Entity_Id) is
4239 -- By default, if no size clause is present, an enumeration type with
4240 -- Convention C is assumed to interface to a C enum, and has integer
4241 -- size. This applies to types. For subtypes, verify that its base
4242 -- type has no size clause either.
4244 if Has_Foreign_Convention (Typ)
4245 and then not Has_Size_Clause (Typ)
4246 and then not Has_Size_Clause (Base_Type (Typ))
4247 and then Esize (Typ) < Standard_Integer_Size
4249 Init_Esize (Typ, Standard_Integer_Size);
4252 -- If the enumeration type interfaces to C, and it has a size clause
4253 -- that specifies less than int size, it warrants a warning. The
4254 -- user may intend the C type to be an enum or a char, so this is
4255 -- not by itself an error that the Ada compiler can detect, but it
4256 -- it is a worth a heads-up. For Boolean and Character types we
4257 -- assume that the programmer has the proper C type in mind.
4259 if Convention (Typ) = Convention_C
4260 and then Has_Size_Clause (Typ)
4261 and then Esize (Typ) /= Esize (Standard_Integer)
4262 and then not Is_Boolean_Type (Typ)
4263 and then not Is_Character_Type (Typ)
4266 ("C enum types have the size of a C int?", Size_Clause (Typ));
4269 Adjust_Esize_For_Alignment (Typ);
4271 end Freeze_Enumeration_Type;
4273 -----------------------
4274 -- Freeze_Expression --
4275 -----------------------
4277 procedure Freeze_Expression (N : Node_Id) is
4278 In_Spec_Exp : constant Boolean := In_Spec_Expression;
4281 Desig_Typ : Entity_Id;
4285 Freeze_Outside : Boolean := False;
4286 -- This flag is set true if the entity must be frozen outside the
4287 -- current subprogram. This happens in the case of expander generated
4288 -- subprograms (_Init_Proc, _Input, _Output, _Read, _Write) which do
4289 -- not freeze all entities like other bodies, but which nevertheless
4290 -- may reference entities that have to be frozen before the body and
4291 -- obviously cannot be frozen inside the body.
4293 function In_Exp_Body (N : Node_Id) return Boolean;
4294 -- Given an N_Handled_Sequence_Of_Statements node N, determines whether
4295 -- it is the handled statement sequence of an expander-generated
4296 -- subprogram (init proc, stream subprogram, or renaming as body).
4297 -- If so, this is not a freezing context.
4303 function In_Exp_Body (N : Node_Id) return Boolean is
4308 if Nkind (N) = N_Subprogram_Body then
4314 if Nkind (P) /= N_Subprogram_Body then
4318 Id := Defining_Unit_Name (Specification (P));
4320 if Nkind (Id) = N_Defining_Identifier
4321 and then (Is_Init_Proc (Id) or else
4322 Is_TSS (Id, TSS_Stream_Input) or else
4323 Is_TSS (Id, TSS_Stream_Output) or else
4324 Is_TSS (Id, TSS_Stream_Read) or else
4325 Is_TSS (Id, TSS_Stream_Write) or else
4326 Nkind (Original_Node (P)) =
4327 N_Subprogram_Renaming_Declaration)
4336 -- Start of processing for Freeze_Expression
4339 -- Immediate return if freezing is inhibited. This flag is set by the
4340 -- analyzer to stop freezing on generated expressions that would cause
4341 -- freezing if they were in the source program, but which are not
4342 -- supposed to freeze, since they are created.
4344 if Must_Not_Freeze (N) then
4348 -- If expression is non-static, then it does not freeze in a default
4349 -- expression, see section "Handling of Default Expressions" in the
4350 -- spec of package Sem for further details. Note that we have to
4351 -- make sure that we actually have a real expression (if we have
4352 -- a subtype indication, we can't test Is_Static_Expression!)
4355 and then Nkind (N) in N_Subexpr
4356 and then not Is_Static_Expression (N)
4361 -- Freeze type of expression if not frozen already
4365 if Nkind (N) in N_Has_Etype then
4366 if not Is_Frozen (Etype (N)) then
4369 -- Base type may be an derived numeric type that is frozen at
4370 -- the point of declaration, but first_subtype is still unfrozen.
4372 elsif not Is_Frozen (First_Subtype (Etype (N))) then
4373 Typ := First_Subtype (Etype (N));
4377 -- For entity name, freeze entity if not frozen already. A special
4378 -- exception occurs for an identifier that did not come from source.
4379 -- We don't let such identifiers freeze a non-internal entity, i.e.
4380 -- an entity that did come from source, since such an identifier was
4381 -- generated by the expander, and cannot have any semantic effect on
4382 -- the freezing semantics. For example, this stops the parameter of
4383 -- an initialization procedure from freezing the variable.
4385 if Is_Entity_Name (N)
4386 and then not Is_Frozen (Entity (N))
4387 and then (Nkind (N) /= N_Identifier
4388 or else Comes_From_Source (N)
4389 or else not Comes_From_Source (Entity (N)))
4396 -- For an allocator freeze designated type if not frozen already
4398 -- For an aggregate whose component type is an access type, freeze the
4399 -- designated type now, so that its freeze does not appear within the
4400 -- loop that might be created in the expansion of the aggregate. If the
4401 -- designated type is a private type without full view, the expression
4402 -- cannot contain an allocator, so the type is not frozen.
4404 -- For a function, we freeze the entity when the subprogram declaration
4405 -- is frozen, but a function call may appear in an initialization proc.
4406 -- before the declaration is frozen. We need to generate the extra
4407 -- formals, if any, to ensure that the expansion of the call includes
4408 -- the proper actuals. This only applies to Ada subprograms, not to
4415 Desig_Typ := Designated_Type (Etype (N));
4418 if Is_Array_Type (Etype (N))
4419 and then Is_Access_Type (Component_Type (Etype (N)))
4421 Desig_Typ := Designated_Type (Component_Type (Etype (N)));
4424 when N_Selected_Component |
4425 N_Indexed_Component |
4428 if Is_Access_Type (Etype (Prefix (N))) then
4429 Desig_Typ := Designated_Type (Etype (Prefix (N)));
4432 when N_Identifier =>
4434 and then Ekind (Nam) = E_Function
4435 and then Nkind (Parent (N)) = N_Function_Call
4436 and then Convention (Nam) = Convention_Ada
4438 Create_Extra_Formals (Nam);
4445 if Desig_Typ /= Empty
4446 and then (Is_Frozen (Desig_Typ)
4447 or else (not Is_Fully_Defined (Desig_Typ)))
4452 -- All done if nothing needs freezing
4456 and then No (Desig_Typ)
4461 -- Loop for looking at the right place to insert the freeze nodes,
4462 -- exiting from the loop when it is appropriate to insert the freeze
4463 -- node before the current node P.
4465 -- Also checks some special exceptions to the freezing rules. These
4466 -- cases result in a direct return, bypassing the freeze action.
4470 Parent_P := Parent (P);
4472 -- If we don't have a parent, then we are not in a well-formed tree.
4473 -- This is an unusual case, but there are some legitimate situations
4474 -- in which this occurs, notably when the expressions in the range of
4475 -- a type declaration are resolved. We simply ignore the freeze
4476 -- request in this case. Is this right ???
4478 if No (Parent_P) then
4482 -- See if we have got to an appropriate point in the tree
4484 case Nkind (Parent_P) is
4486 -- A special test for the exception of (RM 13.14(8)) for the case
4487 -- of per-object expressions (RM 3.8(18)) occurring in component
4488 -- definition or a discrete subtype definition. Note that we test
4489 -- for a component declaration which includes both cases we are
4490 -- interested in, and furthermore the tree does not have explicit
4491 -- nodes for either of these two constructs.
4493 when N_Component_Declaration =>
4495 -- The case we want to test for here is an identifier that is
4496 -- a per-object expression, this is either a discriminant that
4497 -- appears in a context other than the component declaration
4498 -- or it is a reference to the type of the enclosing construct.
4500 -- For either of these cases, we skip the freezing
4502 if not In_Spec_Expression
4503 and then Nkind (N) = N_Identifier
4504 and then (Present (Entity (N)))
4506 -- We recognize the discriminant case by just looking for
4507 -- a reference to a discriminant. It can only be one for
4508 -- the enclosing construct. Skip freezing in this case.
4510 if Ekind (Entity (N)) = E_Discriminant then
4513 -- For the case of a reference to the enclosing record,
4514 -- (or task or protected type), we look for a type that
4515 -- matches the current scope.
4517 elsif Entity (N) = Current_Scope then
4522 -- If we have an enumeration literal that appears as the choice in
4523 -- the aggregate of an enumeration representation clause, then
4524 -- freezing does not occur (RM 13.14(10)).
4526 when N_Enumeration_Representation_Clause =>
4528 -- The case we are looking for is an enumeration literal
4530 if (Nkind (N) = N_Identifier or Nkind (N) = N_Character_Literal)
4531 and then Is_Enumeration_Type (Etype (N))
4533 -- If enumeration literal appears directly as the choice,
4534 -- do not freeze (this is the normal non-overloaded case)
4536 if Nkind (Parent (N)) = N_Component_Association
4537 and then First (Choices (Parent (N))) = N
4541 -- If enumeration literal appears as the name of function
4542 -- which is the choice, then also do not freeze. This
4543 -- happens in the overloaded literal case, where the
4544 -- enumeration literal is temporarily changed to a function
4545 -- call for overloading analysis purposes.
4547 elsif Nkind (Parent (N)) = N_Function_Call
4549 Nkind (Parent (Parent (N))) = N_Component_Association
4551 First (Choices (Parent (Parent (N)))) = Parent (N)
4557 -- Normally if the parent is a handled sequence of statements,
4558 -- then the current node must be a statement, and that is an
4559 -- appropriate place to insert a freeze node.
4561 when N_Handled_Sequence_Of_Statements =>
4563 -- An exception occurs when the sequence of statements is for
4564 -- an expander generated body that did not do the usual freeze
4565 -- all operation. In this case we usually want to freeze
4566 -- outside this body, not inside it, and we skip past the
4567 -- subprogram body that we are inside.
4569 if In_Exp_Body (Parent_P) then
4571 -- However, we *do* want to freeze at this point if we have
4572 -- an entity to freeze, and that entity is declared *inside*
4573 -- the body of the expander generated procedure. This case
4574 -- is recognized by the scope of the type, which is either
4575 -- the spec for some enclosing body, or (in the case of
4576 -- init_procs, for which there are no separate specs) the
4580 Subp : constant Node_Id := Parent (Parent_P);
4584 if Nkind (Subp) = N_Subprogram_Body then
4585 Cspc := Corresponding_Spec (Subp);
4587 if (Present (Typ) and then Scope (Typ) = Cspc)
4589 (Present (Nam) and then Scope (Nam) = Cspc)
4594 and then Scope (Typ) = Current_Scope
4595 and then Current_Scope = Defining_Entity (Subp)
4602 -- If not that exception to the exception, then this is
4603 -- where we delay the freeze till outside the body.
4605 Parent_P := Parent (Parent_P);
4606 Freeze_Outside := True;
4608 -- Here if normal case where we are in handled statement
4609 -- sequence and want to do the insertion right there.
4615 -- If parent is a body or a spec or a block, then the current node
4616 -- is a statement or declaration and we can insert the freeze node
4619 when N_Block_Statement |
4622 N_Package_Specification |
4625 N_Task_Body => exit;
4627 -- The expander is allowed to define types in any statements list,
4628 -- so any of the following parent nodes also mark a freezing point
4629 -- if the actual node is in a list of statements or declarations.
4631 when N_Abortable_Part |
4632 N_Accept_Alternative |
4634 N_Case_Statement_Alternative |
4635 N_Compilation_Unit_Aux |
4636 N_Conditional_Entry_Call |
4637 N_Delay_Alternative |
4639 N_Entry_Call_Alternative |
4640 N_Exception_Handler |
4641 N_Extended_Return_Statement |
4645 N_Selective_Accept |
4646 N_Triggering_Alternative =>
4648 exit when Is_List_Member (P);
4650 -- Note: The N_Loop_Statement is a special case. A type that
4651 -- appears in the source can never be frozen in a loop (this
4652 -- occurs only because of a loop expanded by the expander), so we
4653 -- keep on going. Otherwise we terminate the search. Same is true
4654 -- of any entity which comes from source. (if they have predefined
4655 -- type, that type does not appear to come from source, but the
4656 -- entity should not be frozen here).
4658 when N_Loop_Statement =>
4659 exit when not Comes_From_Source (Etype (N))
4660 and then (No (Nam) or else not Comes_From_Source (Nam));
4662 -- For all other cases, keep looking at parents
4668 -- We fall through the case if we did not yet find the proper
4669 -- place in the free for inserting the freeze node, so climb!
4674 -- If the expression appears in a record or an initialization procedure,
4675 -- the freeze nodes are collected and attached to the current scope, to
4676 -- be inserted and analyzed on exit from the scope, to insure that
4677 -- generated entities appear in the correct scope. If the expression is
4678 -- a default for a discriminant specification, the scope is still void.
4679 -- The expression can also appear in the discriminant part of a private
4680 -- or concurrent type.
4682 -- If the expression appears in a constrained subcomponent of an
4683 -- enclosing record declaration, the freeze nodes must be attached to
4684 -- the outer record type so they can eventually be placed in the
4685 -- enclosing declaration list.
4687 -- The other case requiring this special handling is if we are in a
4688 -- default expression, since in that case we are about to freeze a
4689 -- static type, and the freeze scope needs to be the outer scope, not
4690 -- the scope of the subprogram with the default parameter.
4692 -- For default expressions and other spec expressions in generic units,
4693 -- the Move_Freeze_Nodes mechanism (see sem_ch12.adb) takes care of
4694 -- placing them at the proper place, after the generic unit.
4696 if (In_Spec_Exp and not Inside_A_Generic)
4697 or else Freeze_Outside
4698 or else (Is_Type (Current_Scope)
4699 and then (not Is_Concurrent_Type (Current_Scope)
4700 or else not Has_Completion (Current_Scope)))
4701 or else Ekind (Current_Scope) = E_Void
4704 N : constant Node_Id := Current_Scope;
4705 Freeze_Nodes : List_Id := No_List;
4706 Pos : Int := Scope_Stack.Last;
4709 if Present (Desig_Typ) then
4710 Freeze_And_Append (Desig_Typ, N, Freeze_Nodes);
4713 if Present (Typ) then
4714 Freeze_And_Append (Typ, N, Freeze_Nodes);
4717 if Present (Nam) then
4718 Freeze_And_Append (Nam, N, Freeze_Nodes);
4721 -- The current scope may be that of a constrained component of
4722 -- an enclosing record declaration, which is above the current
4723 -- scope in the scope stack.
4724 -- If the expression is within a top-level pragma, as for a pre-
4725 -- condition on a library-level subprogram, nothing to do.
4727 if not Is_Compilation_Unit (Current_Scope)
4728 and then Is_Record_Type (Scope (Current_Scope))
4733 if Is_Non_Empty_List (Freeze_Nodes) then
4734 if No (Scope_Stack.Table (Pos).Pending_Freeze_Actions) then
4735 Scope_Stack.Table (Pos).Pending_Freeze_Actions :=
4738 Append_List (Freeze_Nodes,
4739 Scope_Stack.Table (Pos).Pending_Freeze_Actions);
4747 -- Now we have the right place to do the freezing. First, a special
4748 -- adjustment, if we are in spec-expression analysis mode, these freeze
4749 -- actions must not be thrown away (normally all inserted actions are
4750 -- thrown away in this mode. However, the freeze actions are from static
4751 -- expressions and one of the important reasons we are doing this
4752 -- special analysis is to get these freeze actions. Therefore we turn
4753 -- off the In_Spec_Expression mode to propagate these freeze actions.
4754 -- This also means they get properly analyzed and expanded.
4756 In_Spec_Expression := False;
4758 -- Freeze the designated type of an allocator (RM 13.14(13))
4760 if Present (Desig_Typ) then
4761 Freeze_Before (P, Desig_Typ);
4764 -- Freeze type of expression (RM 13.14(10)). Note that we took care of
4765 -- the enumeration representation clause exception in the loop above.
4767 if Present (Typ) then
4768 Freeze_Before (P, Typ);
4771 -- Freeze name if one is present (RM 13.14(11))
4773 if Present (Nam) then
4774 Freeze_Before (P, Nam);
4777 -- Restore In_Spec_Expression flag
4779 In_Spec_Expression := In_Spec_Exp;
4780 end Freeze_Expression;
4782 -----------------------------
4783 -- Freeze_Fixed_Point_Type --
4784 -----------------------------
4786 -- Certain fixed-point types and subtypes, including implicit base types
4787 -- and declared first subtypes, have not yet set up a range. This is
4788 -- because the range cannot be set until the Small and Size values are
4789 -- known, and these are not known till the type is frozen.
4791 -- To signal this case, Scalar_Range contains an unanalyzed syntactic range
4792 -- whose bounds are unanalyzed real literals. This routine will recognize
4793 -- this case, and transform this range node into a properly typed range
4794 -- with properly analyzed and resolved values.
4796 procedure Freeze_Fixed_Point_Type (Typ : Entity_Id) is
4797 Rng : constant Node_Id := Scalar_Range (Typ);
4798 Lo : constant Node_Id := Low_Bound (Rng);
4799 Hi : constant Node_Id := High_Bound (Rng);
4800 Btyp : constant Entity_Id := Base_Type (Typ);
4801 Brng : constant Node_Id := Scalar_Range (Btyp);
4802 BLo : constant Node_Id := Low_Bound (Brng);
4803 BHi : constant Node_Id := High_Bound (Brng);
4804 Small : constant Ureal := Small_Value (Typ);
4811 function Fsize (Lov, Hiv : Ureal) return Nat;
4812 -- Returns size of type with given bounds. Also leaves these
4813 -- bounds set as the current bounds of the Typ.
4819 function Fsize (Lov, Hiv : Ureal) return Nat is
4821 Set_Realval (Lo, Lov);
4822 Set_Realval (Hi, Hiv);
4823 return Minimum_Size (Typ);
4826 -- Start of processing for Freeze_Fixed_Point_Type
4829 -- If Esize of a subtype has not previously been set, set it now
4831 if Unknown_Esize (Typ) then
4832 Atype := Ancestor_Subtype (Typ);
4834 if Present (Atype) then
4835 Set_Esize (Typ, Esize (Atype));
4837 Set_Esize (Typ, Esize (Base_Type (Typ)));
4841 -- Immediate return if the range is already analyzed. This means that
4842 -- the range is already set, and does not need to be computed by this
4845 if Analyzed (Rng) then
4849 -- Immediate return if either of the bounds raises Constraint_Error
4851 if Raises_Constraint_Error (Lo)
4852 or else Raises_Constraint_Error (Hi)
4857 Loval := Realval (Lo);
4858 Hival := Realval (Hi);
4860 -- Ordinary fixed-point case
4862 if Is_Ordinary_Fixed_Point_Type (Typ) then
4864 -- For the ordinary fixed-point case, we are allowed to fudge the
4865 -- end-points up or down by small. Generally we prefer to fudge up,
4866 -- i.e. widen the bounds for non-model numbers so that the end points
4867 -- are included. However there are cases in which this cannot be
4868 -- done, and indeed cases in which we may need to narrow the bounds.
4869 -- The following circuit makes the decision.
4871 -- Note: our terminology here is that Incl_EP means that the bounds
4872 -- are widened by Small if necessary to include the end points, and
4873 -- Excl_EP means that the bounds are narrowed by Small to exclude the
4874 -- end-points if this reduces the size.
4876 -- Note that in the Incl case, all we care about is including the
4877 -- end-points. In the Excl case, we want to narrow the bounds as
4878 -- much as permitted by the RM, to give the smallest possible size.
4881 Loval_Incl_EP : Ureal;
4882 Hival_Incl_EP : Ureal;
4884 Loval_Excl_EP : Ureal;
4885 Hival_Excl_EP : Ureal;
4891 First_Subt : Entity_Id;
4896 -- First step. Base types are required to be symmetrical. Right
4897 -- now, the base type range is a copy of the first subtype range.
4898 -- This will be corrected before we are done, but right away we
4899 -- need to deal with the case where both bounds are non-negative.
4900 -- In this case, we set the low bound to the negative of the high
4901 -- bound, to make sure that the size is computed to include the
4902 -- required sign. Note that we do not need to worry about the
4903 -- case of both bounds negative, because the sign will be dealt
4904 -- with anyway. Furthermore we can't just go making such a bound
4905 -- symmetrical, since in a twos-complement system, there is an
4906 -- extra negative value which could not be accommodated on the
4910 and then not UR_Is_Negative (Loval)
4911 and then Hival > Loval
4914 Set_Realval (Lo, Loval);
4917 -- Compute the fudged bounds. If the number is a model number,
4918 -- then we do nothing to include it, but we are allowed to backoff
4919 -- to the next adjacent model number when we exclude it. If it is
4920 -- not a model number then we straddle the two values with the
4921 -- model numbers on either side.
4923 Model_Num := UR_Trunc (Loval / Small) * Small;
4925 if Loval = Model_Num then
4926 Loval_Incl_EP := Model_Num;
4928 Loval_Incl_EP := Model_Num - Small;
4931 -- The low value excluding the end point is Small greater, but
4932 -- we do not do this exclusion if the low value is positive,
4933 -- since it can't help the size and could actually hurt by
4934 -- crossing the high bound.
4936 if UR_Is_Negative (Loval_Incl_EP) then
4937 Loval_Excl_EP := Loval_Incl_EP + Small;
4939 -- If the value went from negative to zero, then we have the
4940 -- case where Loval_Incl_EP is the model number just below
4941 -- zero, so we want to stick to the negative value for the
4942 -- base type to maintain the condition that the size will
4943 -- include signed values.
4946 and then UR_Is_Zero (Loval_Excl_EP)
4948 Loval_Excl_EP := Loval_Incl_EP;
4952 Loval_Excl_EP := Loval_Incl_EP;
4955 -- Similar processing for upper bound and high value
4957 Model_Num := UR_Trunc (Hival / Small) * Small;
4959 if Hival = Model_Num then
4960 Hival_Incl_EP := Model_Num;
4962 Hival_Incl_EP := Model_Num + Small;
4965 if UR_Is_Positive (Hival_Incl_EP) then
4966 Hival_Excl_EP := Hival_Incl_EP - Small;
4968 Hival_Excl_EP := Hival_Incl_EP;
4971 -- One further adjustment is needed. In the case of subtypes, we
4972 -- cannot go outside the range of the base type, or we get
4973 -- peculiarities, and the base type range is already set. This
4974 -- only applies to the Incl values, since clearly the Excl values
4975 -- are already as restricted as they are allowed to be.
4978 Loval_Incl_EP := UR_Max (Loval_Incl_EP, Realval (BLo));
4979 Hival_Incl_EP := UR_Min (Hival_Incl_EP, Realval (BHi));
4982 -- Get size including and excluding end points
4984 Size_Incl_EP := Fsize (Loval_Incl_EP, Hival_Incl_EP);
4985 Size_Excl_EP := Fsize (Loval_Excl_EP, Hival_Excl_EP);
4987 -- No need to exclude end-points if it does not reduce size
4989 if Fsize (Loval_Incl_EP, Hival_Excl_EP) = Size_Excl_EP then
4990 Loval_Excl_EP := Loval_Incl_EP;
4993 if Fsize (Loval_Excl_EP, Hival_Incl_EP) = Size_Excl_EP then
4994 Hival_Excl_EP := Hival_Incl_EP;
4997 -- Now we set the actual size to be used. We want to use the
4998 -- bounds fudged up to include the end-points but only if this
4999 -- can be done without violating a specifically given size
5000 -- size clause or causing an unacceptable increase in size.
5002 -- Case of size clause given
5004 if Has_Size_Clause (Typ) then
5006 -- Use the inclusive size only if it is consistent with
5007 -- the explicitly specified size.
5009 if Size_Incl_EP <= RM_Size (Typ) then
5010 Actual_Lo := Loval_Incl_EP;
5011 Actual_Hi := Hival_Incl_EP;
5012 Actual_Size := Size_Incl_EP;
5014 -- If the inclusive size is too large, we try excluding
5015 -- the end-points (will be caught later if does not work).
5018 Actual_Lo := Loval_Excl_EP;
5019 Actual_Hi := Hival_Excl_EP;
5020 Actual_Size := Size_Excl_EP;
5023 -- Case of size clause not given
5026 -- If we have a base type whose corresponding first subtype
5027 -- has an explicit size that is large enough to include our
5028 -- end-points, then do so. There is no point in working hard
5029 -- to get a base type whose size is smaller than the specified
5030 -- size of the first subtype.
5032 First_Subt := First_Subtype (Typ);
5034 if Has_Size_Clause (First_Subt)
5035 and then Size_Incl_EP <= Esize (First_Subt)
5037 Actual_Size := Size_Incl_EP;
5038 Actual_Lo := Loval_Incl_EP;
5039 Actual_Hi := Hival_Incl_EP;
5041 -- If excluding the end-points makes the size smaller and
5042 -- results in a size of 8,16,32,64, then we take the smaller
5043 -- size. For the 64 case, this is compulsory. For the other
5044 -- cases, it seems reasonable. We like to include end points
5045 -- if we can, but not at the expense of moving to the next
5046 -- natural boundary of size.
5048 elsif Size_Incl_EP /= Size_Excl_EP
5049 and then Addressable (Size_Excl_EP)
5051 Actual_Size := Size_Excl_EP;
5052 Actual_Lo := Loval_Excl_EP;
5053 Actual_Hi := Hival_Excl_EP;
5055 -- Otherwise we can definitely include the end points
5058 Actual_Size := Size_Incl_EP;
5059 Actual_Lo := Loval_Incl_EP;
5060 Actual_Hi := Hival_Incl_EP;
5063 -- One pathological case: normally we never fudge a low bound
5064 -- down, since it would seem to increase the size (if it has
5065 -- any effect), but for ranges containing single value, or no
5066 -- values, the high bound can be small too large. Consider:
5068 -- type t is delta 2.0**(-14)
5069 -- range 131072.0 .. 0;
5071 -- That lower bound is *just* outside the range of 32 bits, and
5072 -- does need fudging down in this case. Note that the bounds
5073 -- will always have crossed here, since the high bound will be
5074 -- fudged down if necessary, as in the case of:
5076 -- type t is delta 2.0**(-14)
5077 -- range 131072.0 .. 131072.0;
5079 -- So we detect the situation by looking for crossed bounds,
5080 -- and if the bounds are crossed, and the low bound is greater
5081 -- than zero, we will always back it off by small, since this
5082 -- is completely harmless.
5084 if Actual_Lo > Actual_Hi then
5085 if UR_Is_Positive (Actual_Lo) then
5086 Actual_Lo := Loval_Incl_EP - Small;
5087 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
5089 -- And of course, we need to do exactly the same parallel
5090 -- fudge for flat ranges in the negative region.
5092 elsif UR_Is_Negative (Actual_Hi) then
5093 Actual_Hi := Hival_Incl_EP + Small;
5094 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
5099 Set_Realval (Lo, Actual_Lo);
5100 Set_Realval (Hi, Actual_Hi);
5103 -- For the decimal case, none of this fudging is required, since there
5104 -- are no end-point problems in the decimal case (the end-points are
5105 -- always included).
5108 Actual_Size := Fsize (Loval, Hival);
5111 -- At this stage, the actual size has been calculated and the proper
5112 -- required bounds are stored in the low and high bounds.
5114 if Actual_Size > 64 then
5115 Error_Msg_Uint_1 := UI_From_Int (Actual_Size);
5117 ("size required (^) for type& too large, maximum allowed is 64",
5122 -- Check size against explicit given size
5124 if Has_Size_Clause (Typ) then
5125 if Actual_Size > RM_Size (Typ) then
5126 Error_Msg_Uint_1 := RM_Size (Typ);
5127 Error_Msg_Uint_2 := UI_From_Int (Actual_Size);
5129 ("size given (^) for type& too small, minimum allowed is ^",
5130 Size_Clause (Typ), Typ);
5133 Actual_Size := UI_To_Int (Esize (Typ));
5136 -- Increase size to next natural boundary if no size clause given
5139 if Actual_Size <= 8 then
5141 elsif Actual_Size <= 16 then
5143 elsif Actual_Size <= 32 then
5149 Init_Esize (Typ, Actual_Size);
5150 Adjust_Esize_For_Alignment (Typ);
5153 -- If we have a base type, then expand the bounds so that they extend to
5154 -- the full width of the allocated size in bits, to avoid junk range
5155 -- checks on intermediate computations.
5157 if Base_Type (Typ) = Typ then
5158 Set_Realval (Lo, -(Small * (Uint_2 ** (Actual_Size - 1))));
5159 Set_Realval (Hi, (Small * (Uint_2 ** (Actual_Size - 1) - 1)));
5162 -- Final step is to reanalyze the bounds using the proper type
5163 -- and set the Corresponding_Integer_Value fields of the literals.
5165 Set_Etype (Lo, Empty);
5166 Set_Analyzed (Lo, False);
5169 -- Resolve with universal fixed if the base type, and the base type if
5170 -- it is a subtype. Note we can't resolve the base type with itself,
5171 -- that would be a reference before definition.
5174 Resolve (Lo, Universal_Fixed);
5179 -- Set corresponding integer value for bound
5181 Set_Corresponding_Integer_Value
5182 (Lo, UR_To_Uint (Realval (Lo) / Small));
5184 -- Similar processing for high bound
5186 Set_Etype (Hi, Empty);
5187 Set_Analyzed (Hi, False);
5191 Resolve (Hi, Universal_Fixed);
5196 Set_Corresponding_Integer_Value
5197 (Hi, UR_To_Uint (Realval (Hi) / Small));
5199 -- Set type of range to correspond to bounds
5201 Set_Etype (Rng, Etype (Lo));
5203 -- Set Esize to calculated size if not set already
5205 if Unknown_Esize (Typ) then
5206 Init_Esize (Typ, Actual_Size);
5209 -- Set RM_Size if not already set. If already set, check value
5212 Minsiz : constant Uint := UI_From_Int (Minimum_Size (Typ));
5215 if RM_Size (Typ) /= Uint_0 then
5216 if RM_Size (Typ) < Minsiz then
5217 Error_Msg_Uint_1 := RM_Size (Typ);
5218 Error_Msg_Uint_2 := Minsiz;
5220 ("size given (^) for type& too small, minimum allowed is ^",
5221 Size_Clause (Typ), Typ);
5225 Set_RM_Size (Typ, Minsiz);
5228 end Freeze_Fixed_Point_Type;
5234 procedure Freeze_Itype (T : Entity_Id; N : Node_Id) is
5238 Set_Has_Delayed_Freeze (T);
5239 L := Freeze_Entity (T, N);
5241 if Is_Non_Empty_List (L) then
5242 Insert_Actions (N, L);
5246 --------------------------
5247 -- Freeze_Static_Object --
5248 --------------------------
5250 procedure Freeze_Static_Object (E : Entity_Id) is
5252 Cannot_Be_Static : exception;
5253 -- Exception raised if the type of a static object cannot be made
5254 -- static. This happens if the type depends on non-global objects.
5256 procedure Ensure_Expression_Is_SA (N : Node_Id);
5257 -- Called to ensure that an expression used as part of a type definition
5258 -- is statically allocatable, which means that the expression type is
5259 -- statically allocatable, and the expression is either static, or a
5260 -- reference to a library level constant.
5262 procedure Ensure_Type_Is_SA (Typ : Entity_Id);
5263 -- Called to mark a type as static, checking that it is possible
5264 -- to set the type as static. If it is not possible, then the
5265 -- exception Cannot_Be_Static is raised.
5267 -----------------------------
5268 -- Ensure_Expression_Is_SA --
5269 -----------------------------
5271 procedure Ensure_Expression_Is_SA (N : Node_Id) is
5275 Ensure_Type_Is_SA (Etype (N));
5277 if Is_Static_Expression (N) then
5280 elsif Nkind (N) = N_Identifier then
5284 and then Ekind (Ent) = E_Constant
5285 and then Is_Library_Level_Entity (Ent)
5291 raise Cannot_Be_Static;
5292 end Ensure_Expression_Is_SA;
5294 -----------------------
5295 -- Ensure_Type_Is_SA --
5296 -----------------------
5298 procedure Ensure_Type_Is_SA (Typ : Entity_Id) is
5303 -- If type is library level, we are all set
5305 if Is_Library_Level_Entity (Typ) then
5309 -- We are also OK if the type already marked as statically allocated,
5310 -- which means we processed it before.
5312 if Is_Statically_Allocated (Typ) then
5316 -- Mark type as statically allocated
5318 Set_Is_Statically_Allocated (Typ);
5320 -- Check that it is safe to statically allocate this type
5322 if Is_Scalar_Type (Typ) or else Is_Real_Type (Typ) then
5323 Ensure_Expression_Is_SA (Type_Low_Bound (Typ));
5324 Ensure_Expression_Is_SA (Type_High_Bound (Typ));
5326 elsif Is_Array_Type (Typ) then
5327 N := First_Index (Typ);
5328 while Present (N) loop
5329 Ensure_Type_Is_SA (Etype (N));
5333 Ensure_Type_Is_SA (Component_Type (Typ));
5335 elsif Is_Access_Type (Typ) then
5336 if Ekind (Designated_Type (Typ)) = E_Subprogram_Type then
5340 T : constant Entity_Id := Etype (Designated_Type (Typ));
5343 if T /= Standard_Void_Type then
5344 Ensure_Type_Is_SA (T);
5347 F := First_Formal (Designated_Type (Typ));
5348 while Present (F) loop
5349 Ensure_Type_Is_SA (Etype (F));
5355 Ensure_Type_Is_SA (Designated_Type (Typ));
5358 elsif Is_Record_Type (Typ) then
5359 C := First_Entity (Typ);
5360 while Present (C) loop
5361 if Ekind (C) = E_Discriminant
5362 or else Ekind (C) = E_Component
5364 Ensure_Type_Is_SA (Etype (C));
5366 elsif Is_Type (C) then
5367 Ensure_Type_Is_SA (C);
5373 elsif Ekind (Typ) = E_Subprogram_Type then
5374 Ensure_Type_Is_SA (Etype (Typ));
5376 C := First_Formal (Typ);
5377 while Present (C) loop
5378 Ensure_Type_Is_SA (Etype (C));
5383 raise Cannot_Be_Static;
5385 end Ensure_Type_Is_SA;
5387 -- Start of processing for Freeze_Static_Object
5390 Ensure_Type_Is_SA (Etype (E));
5393 when Cannot_Be_Static =>
5395 -- If the object that cannot be static is imported or exported, then
5396 -- issue an error message saying that this object cannot be imported
5397 -- or exported. If it has an address clause it is an overlay in the
5398 -- current partition and the static requirement is not relevant.
5399 -- Do not issue any error message when ignoring rep clauses.
5401 if Ignore_Rep_Clauses then
5404 elsif Is_Imported (E) then
5405 if No (Address_Clause (E)) then
5407 ("& cannot be imported (local type is not constant)", E);
5410 -- Otherwise must be exported, something is wrong if compiler
5411 -- is marking something as statically allocated which cannot be).
5413 else pragma Assert (Is_Exported (E));
5415 ("& cannot be exported (local type is not constant)", E);
5417 end Freeze_Static_Object;
5419 -----------------------
5420 -- Freeze_Subprogram --
5421 -----------------------
5423 procedure Freeze_Subprogram (E : Entity_Id) is
5428 -- Subprogram may not have an address clause unless it is imported
5430 if Present (Address_Clause (E)) then
5431 if not Is_Imported (E) then
5433 ("address clause can only be given " &
5434 "for imported subprogram",
5435 Name (Address_Clause (E)));
5439 -- Reset the Pure indication on an imported subprogram unless an
5440 -- explicit Pure_Function pragma was present. We do this because
5441 -- otherwise it is an insidious error to call a non-pure function from
5442 -- pure unit and have calls mysteriously optimized away. What happens
5443 -- here is that the Import can bypass the normal check to ensure that
5444 -- pure units call only pure subprograms.
5447 and then Is_Pure (E)
5448 and then not Has_Pragma_Pure_Function (E)
5450 Set_Is_Pure (E, False);
5453 -- For non-foreign convention subprograms, this is where we create
5454 -- the extra formals (for accessibility level and constrained bit
5455 -- information). We delay this till the freeze point precisely so
5456 -- that we know the convention!
5458 if not Has_Foreign_Convention (E) then
5459 Create_Extra_Formals (E);
5462 -- If this is convention Ada and a Valued_Procedure, that's odd
5464 if Ekind (E) = E_Procedure
5465 and then Is_Valued_Procedure (E)
5466 and then Convention (E) = Convention_Ada
5467 and then Warn_On_Export_Import
5470 ("?Valued_Procedure has no effect for convention Ada", E);
5471 Set_Is_Valued_Procedure (E, False);
5474 -- Case of foreign convention
5479 -- For foreign conventions, warn about return of an
5480 -- unconstrained array.
5482 -- Note: we *do* allow a return by descriptor for the VMS case,
5483 -- though here there is probably more to be done ???
5485 if Ekind (E) = E_Function then
5486 Retype := Underlying_Type (Etype (E));
5488 -- If no return type, probably some other error, e.g. a
5489 -- missing full declaration, so ignore.
5494 -- If the return type is generic, we have emitted a warning
5495 -- earlier on, and there is nothing else to check here. Specific
5496 -- instantiations may lead to erroneous behavior.
5498 elsif Is_Generic_Type (Etype (E)) then
5501 -- Display warning if returning unconstrained array
5503 elsif Is_Array_Type (Retype)
5504 and then not Is_Constrained (Retype)
5506 -- Exclude cases where descriptor mechanism is set, since the
5507 -- VMS descriptor mechanisms allow such unconstrained returns.
5509 and then Mechanism (E) not in Descriptor_Codes
5511 -- Check appropriate warning is enabled (should we check for
5512 -- Warnings (Off) on specific entities here, probably so???)
5514 and then Warn_On_Export_Import
5516 -- Exclude the VM case, since return of unconstrained arrays
5517 -- is properly handled in both the JVM and .NET cases.
5519 and then VM_Target = No_VM
5522 ("?foreign convention function& should not return " &
5523 "unconstrained array", E);
5528 -- If any of the formals for an exported foreign convention
5529 -- subprogram have defaults, then emit an appropriate warning since
5530 -- this is odd (default cannot be used from non-Ada code)
5532 if Is_Exported (E) then
5533 F := First_Formal (E);
5534 while Present (F) loop
5535 if Warn_On_Export_Import
5536 and then Present (Default_Value (F))
5539 ("?parameter cannot be defaulted in non-Ada call",
5548 -- For VMS, descriptor mechanisms for parameters are allowed only for
5549 -- imported/exported subprograms. Moreover, the NCA descriptor is not
5550 -- allowed for parameters of exported subprograms.
5552 if OpenVMS_On_Target then
5553 if Is_Exported (E) then
5554 F := First_Formal (E);
5555 while Present (F) loop
5556 if Mechanism (F) = By_Descriptor_NCA then
5558 ("'N'C'A' descriptor for parameter not permitted", F);
5560 ("\can only be used for imported subprogram", F);
5566 elsif not Is_Imported (E) then
5567 F := First_Formal (E);
5568 while Present (F) loop
5569 if Mechanism (F) in Descriptor_Codes then
5571 ("descriptor mechanism for parameter not permitted", F);
5573 ("\can only be used for imported/exported subprogram", F);
5581 -- Pragma Inline_Always is disallowed for dispatching subprograms
5582 -- because the address of such subprograms is saved in the dispatch
5583 -- table to support dispatching calls, and dispatching calls cannot
5584 -- be inlined. This is consistent with the restriction against using
5585 -- 'Access or 'Address on an Inline_Always subprogram.
5587 if Is_Dispatching_Operation (E)
5588 and then Has_Pragma_Inline_Always (E)
5591 ("pragma Inline_Always not allowed for dispatching subprograms", E);
5594 -- Because of the implicit representation of inherited predefined
5595 -- operators in the front-end, the overriding status of the operation
5596 -- may be affected when a full view of a type is analyzed, and this is
5597 -- not captured by the analysis of the corresponding type declaration.
5598 -- Therefore the correctness of a not-overriding indicator must be
5599 -- rechecked when the subprogram is frozen.
5601 if Nkind (E) = N_Defining_Operator_Symbol
5602 and then not Error_Posted (Parent (E))
5604 Check_Overriding_Indicator (E, Empty, Is_Primitive (E));
5606 end Freeze_Subprogram;
5608 ----------------------
5609 -- Is_Fully_Defined --
5610 ----------------------
5612 function Is_Fully_Defined (T : Entity_Id) return Boolean is
5614 if Ekind (T) = E_Class_Wide_Type then
5615 return Is_Fully_Defined (Etype (T));
5617 elsif Is_Array_Type (T) then
5618 return Is_Fully_Defined (Component_Type (T));
5620 elsif Is_Record_Type (T)
5621 and not Is_Private_Type (T)
5623 -- Verify that the record type has no components with private types
5624 -- without completion.
5630 Comp := First_Component (T);
5631 while Present (Comp) loop
5632 if not Is_Fully_Defined (Etype (Comp)) then
5636 Next_Component (Comp);
5641 -- For the designated type of an access to subprogram, all types in
5642 -- the profile must be fully defined.
5644 elsif Ekind (T) = E_Subprogram_Type then
5649 F := First_Formal (T);
5650 while Present (F) loop
5651 if not Is_Fully_Defined (Etype (F)) then
5658 return Is_Fully_Defined (Etype (T));
5662 return not Is_Private_Type (T)
5663 or else Present (Full_View (Base_Type (T)));
5665 end Is_Fully_Defined;
5667 ---------------------------------
5668 -- Process_Default_Expressions --
5669 ---------------------------------
5671 procedure Process_Default_Expressions
5673 After : in out Node_Id)
5675 Loc : constant Source_Ptr := Sloc (E);
5682 Set_Default_Expressions_Processed (E);
5684 -- A subprogram instance and its associated anonymous subprogram share
5685 -- their signature. The default expression functions are defined in the
5686 -- wrapper packages for the anonymous subprogram, and should not be
5687 -- generated again for the instance.
5689 if Is_Generic_Instance (E)
5690 and then Present (Alias (E))
5691 and then Default_Expressions_Processed (Alias (E))
5696 Formal := First_Formal (E);
5697 while Present (Formal) loop
5698 if Present (Default_Value (Formal)) then
5700 -- We work with a copy of the default expression because we
5701 -- do not want to disturb the original, since this would mess
5702 -- up the conformance checking.
5704 Dcopy := New_Copy_Tree (Default_Value (Formal));
5706 -- The analysis of the expression may generate insert actions,
5707 -- which of course must not be executed. We wrap those actions
5708 -- in a procedure that is not called, and later on eliminated.
5709 -- The following cases have no side-effects, and are analyzed
5712 if Nkind (Dcopy) = N_Identifier
5713 or else Nkind (Dcopy) = N_Expanded_Name
5714 or else Nkind (Dcopy) = N_Integer_Literal
5715 or else (Nkind (Dcopy) = N_Real_Literal
5716 and then not Vax_Float (Etype (Dcopy)))
5717 or else Nkind (Dcopy) = N_Character_Literal
5718 or else Nkind (Dcopy) = N_String_Literal
5719 or else Known_Null (Dcopy)
5720 or else (Nkind (Dcopy) = N_Attribute_Reference
5722 Attribute_Name (Dcopy) = Name_Null_Parameter)
5725 -- If there is no default function, we must still do a full
5726 -- analyze call on the default value, to ensure that all error
5727 -- checks are performed, e.g. those associated with static
5728 -- evaluation. Note: this branch will always be taken if the
5729 -- analyzer is turned off (but we still need the error checks).
5731 -- Note: the setting of parent here is to meet the requirement
5732 -- that we can only analyze the expression while attached to
5733 -- the tree. Really the requirement is that the parent chain
5734 -- be set, we don't actually need to be in the tree.
5736 Set_Parent (Dcopy, Declaration_Node (Formal));
5739 -- Default expressions are resolved with their own type if the
5740 -- context is generic, to avoid anomalies with private types.
5742 if Ekind (Scope (E)) = E_Generic_Package then
5745 Resolve (Dcopy, Etype (Formal));
5748 -- If that resolved expression will raise constraint error,
5749 -- then flag the default value as raising constraint error.
5750 -- This allows a proper error message on the calls.
5752 if Raises_Constraint_Error (Dcopy) then
5753 Set_Raises_Constraint_Error (Default_Value (Formal));
5756 -- If the default is a parameterless call, we use the name of
5757 -- the called function directly, and there is no body to build.
5759 elsif Nkind (Dcopy) = N_Function_Call
5760 and then No (Parameter_Associations (Dcopy))
5764 -- Else construct and analyze the body of a wrapper procedure
5765 -- that contains an object declaration to hold the expression.
5766 -- Given that this is done only to complete the analysis, it
5767 -- simpler to build a procedure than a function which might
5768 -- involve secondary stack expansion.
5771 Dnam := Make_Temporary (Loc, 'D');
5774 Make_Subprogram_Body (Loc,
5776 Make_Procedure_Specification (Loc,
5777 Defining_Unit_Name => Dnam),
5779 Declarations => New_List (
5780 Make_Object_Declaration (Loc,
5781 Defining_Identifier => Make_Temporary (Loc, 'T'),
5782 Object_Definition =>
5783 New_Occurrence_Of (Etype (Formal), Loc),
5784 Expression => New_Copy_Tree (Dcopy))),
5786 Handled_Statement_Sequence =>
5787 Make_Handled_Sequence_Of_Statements (Loc,
5788 Statements => Empty_List));
5790 Set_Scope (Dnam, Scope (E));
5791 Set_Assignment_OK (First (Declarations (Dbody)));
5792 Set_Is_Eliminated (Dnam);
5793 Insert_After (After, Dbody);
5799 Next_Formal (Formal);
5801 end Process_Default_Expressions;
5803 ----------------------------------------
5804 -- Set_Component_Alignment_If_Not_Set --
5805 ----------------------------------------
5807 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id) is
5809 -- Ignore if not base type, subtypes don't need anything
5811 if Typ /= Base_Type (Typ) then
5815 -- Do not override existing representation
5817 if Is_Packed (Typ) then
5820 elsif Has_Specified_Layout (Typ) then
5823 elsif Component_Alignment (Typ) /= Calign_Default then
5827 Set_Component_Alignment
5828 (Typ, Scope_Stack.Table
5829 (Scope_Stack.Last).Component_Alignment_Default);
5831 end Set_Component_Alignment_If_Not_Set;
5837 procedure Undelay_Type (T : Entity_Id) is
5839 Set_Has_Delayed_Freeze (T, False);
5840 Set_Freeze_Node (T, Empty);
5842 -- Since we don't want T to have a Freeze_Node, we don't want its
5843 -- Full_View or Corresponding_Record_Type to have one either.
5845 -- ??? Fundamentally, this whole handling is a kludge. What we really
5846 -- want is to be sure that for an Itype that's part of record R and is a
5847 -- subtype of type T, that it's frozen after the later of the freeze
5848 -- points of R and T. We have no way of doing that directly, so what we
5849 -- do is force most such Itypes to be frozen as part of freezing R via
5850 -- this procedure and only delay the ones that need to be delayed
5851 -- (mostly the designated types of access types that are defined as part
5854 if Is_Private_Type (T)
5855 and then Present (Full_View (T))
5856 and then Is_Itype (Full_View (T))
5857 and then Is_Record_Type (Scope (Full_View (T)))
5859 Undelay_Type (Full_View (T));
5862 if Is_Concurrent_Type (T)
5863 and then Present (Corresponding_Record_Type (T))
5864 and then Is_Itype (Corresponding_Record_Type (T))
5865 and then Is_Record_Type (Scope (Corresponding_Record_Type (T)))
5867 Undelay_Type (Corresponding_Record_Type (T));
5875 procedure Warn_Overlay
5880 Ent : constant Entity_Id := Entity (Nam);
5881 -- The object to which the address clause applies
5884 Old : Entity_Id := Empty;
5888 -- No warning if address clause overlay warnings are off
5890 if not Address_Clause_Overlay_Warnings then
5894 -- No warning if there is an explicit initialization
5896 Init := Original_Node (Expression (Declaration_Node (Ent)));
5898 if Present (Init) and then Comes_From_Source (Init) then
5902 -- We only give the warning for non-imported entities of a type for
5903 -- which a non-null base init proc is defined, or for objects of access
5904 -- types with implicit null initialization, or when Normalize_Scalars
5905 -- applies and the type is scalar or a string type (the latter being
5906 -- tested for because predefined String types are initialized by inline
5907 -- code rather than by an init_proc). Note that we do not give the
5908 -- warning for Initialize_Scalars, since we suppressed initialization
5909 -- in this case. Also, do not warn if Suppress_Initialization is set.
5912 and then not Is_Imported (Ent)
5913 and then not Initialization_Suppressed (Typ)
5914 and then (Has_Non_Null_Base_Init_Proc (Typ)
5915 or else Is_Access_Type (Typ)
5916 or else (Normalize_Scalars
5917 and then (Is_Scalar_Type (Typ)
5918 or else Is_String_Type (Typ))))
5920 if Nkind (Expr) = N_Attribute_Reference
5921 and then Is_Entity_Name (Prefix (Expr))
5923 Old := Entity (Prefix (Expr));
5925 elsif Is_Entity_Name (Expr)
5926 and then Ekind (Entity (Expr)) = E_Constant
5928 Decl := Declaration_Node (Entity (Expr));
5930 if Nkind (Decl) = N_Object_Declaration
5931 and then Present (Expression (Decl))
5932 and then Nkind (Expression (Decl)) = N_Attribute_Reference
5933 and then Is_Entity_Name (Prefix (Expression (Decl)))
5935 Old := Entity (Prefix (Expression (Decl)));
5937 elsif Nkind (Expr) = N_Function_Call then
5941 -- A function call (most likely to To_Address) is probably not an
5942 -- overlay, so skip warning. Ditto if the function call was inlined
5943 -- and transformed into an entity.
5945 elsif Nkind (Original_Node (Expr)) = N_Function_Call then
5949 Decl := Next (Parent (Expr));
5951 -- If a pragma Import follows, we assume that it is for the current
5952 -- target of the address clause, and skip the warning.
5955 and then Nkind (Decl) = N_Pragma
5956 and then Pragma_Name (Decl) = Name_Import
5961 if Present (Old) then
5962 Error_Msg_Node_2 := Old;
5964 ("default initialization of & may modify &?",
5968 ("default initialization of & may modify overlaid storage?",
5972 -- Add friendly warning if initialization comes from a packed array
5975 if Is_Record_Type (Typ) then
5980 Comp := First_Component (Typ);
5981 while Present (Comp) loop
5982 if Nkind (Parent (Comp)) = N_Component_Declaration
5983 and then Present (Expression (Parent (Comp)))
5986 elsif Is_Array_Type (Etype (Comp))
5987 and then Present (Packed_Array_Type (Etype (Comp)))
5990 ("\packed array component& " &
5991 "will be initialized to zero?",
5995 Next_Component (Comp);
6002 ("\use pragma Import for & to " &
6003 "suppress initialization (RM B.1(24))?",