1 -----------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2008, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 2, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 with Atree; use Atree;
28 with Debug; use Debug;
29 with Einfo; use Einfo;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Exp_Ch7; use Exp_Ch7;
33 with Exp_Pakd; use Exp_Pakd;
34 with Exp_Util; use Exp_Util;
35 with Exp_Tss; use Exp_Tss;
36 with Layout; use Layout;
37 with Lib.Xref; use Lib.Xref;
38 with Namet; use Namet;
39 with Nlists; use Nlists;
40 with Nmake; use Nmake;
42 with Restrict; use Restrict;
43 with Rident; use Rident;
45 with Sem_Cat; use Sem_Cat;
46 with Sem_Ch6; use Sem_Ch6;
47 with Sem_Ch7; use Sem_Ch7;
48 with Sem_Ch8; use Sem_Ch8;
49 with Sem_Ch13; use Sem_Ch13;
50 with Sem_Eval; use Sem_Eval;
51 with Sem_Mech; use Sem_Mech;
52 with Sem_Prag; use Sem_Prag;
53 with Sem_Res; use Sem_Res;
54 with Sem_Util; use Sem_Util;
55 with Sinfo; use Sinfo;
56 with Snames; use Snames;
57 with Stand; use Stand;
58 with Targparm; use Targparm;
59 with Tbuild; use Tbuild;
60 with Ttypes; use Ttypes;
61 with Uintp; use Uintp;
62 with Urealp; use Urealp;
64 package body Freeze is
66 -----------------------
67 -- Local Subprograms --
68 -----------------------
70 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id);
71 -- Typ is a type that is being frozen. If no size clause is given,
72 -- but a default Esize has been computed, then this default Esize is
73 -- adjusted up if necessary to be consistent with a given alignment,
74 -- but never to a value greater than Long_Long_Integer'Size. This
75 -- is used for all discrete types and for fixed-point types.
77 procedure Build_And_Analyze_Renamed_Body
80 After : in out Node_Id);
81 -- Build body for a renaming declaration, insert in tree and analyze
83 procedure Check_Address_Clause (E : Entity_Id);
84 -- Apply legality checks to address clauses for object declarations,
85 -- at the point the object is frozen.
87 procedure Check_Strict_Alignment (E : Entity_Id);
88 -- E is a base type. If E is tagged or has a component that is aliased
89 -- or tagged or contains something this is aliased or tagged, set
92 procedure Check_Unsigned_Type (E : Entity_Id);
93 pragma Inline (Check_Unsigned_Type);
94 -- If E is a fixed-point or discrete type, then all the necessary work
95 -- to freeze it is completed except for possible setting of the flag
96 -- Is_Unsigned_Type, which is done by this procedure. The call has no
97 -- effect if the entity E is not a discrete or fixed-point type.
99 procedure Freeze_And_Append
102 Result : in out List_Id);
103 -- Freezes Ent using Freeze_Entity, and appends the resulting list of
104 -- nodes to Result, modifying Result from No_List if necessary.
106 procedure Freeze_Enumeration_Type (Typ : Entity_Id);
107 -- Freeze enumeration type. The Esize field is set as processing
108 -- proceeds (i.e. set by default when the type is declared and then
109 -- adjusted by rep clauses. What this procedure does is to make sure
110 -- that if a foreign convention is specified, and no specific size
111 -- is given, then the size must be at least Integer'Size.
113 procedure Freeze_Static_Object (E : Entity_Id);
114 -- If an object is frozen which has Is_Statically_Allocated set, then
115 -- all referenced types must also be marked with this flag. This routine
116 -- is in charge of meeting this requirement for the object entity E.
118 procedure Freeze_Subprogram (E : Entity_Id);
119 -- Perform freezing actions for a subprogram (create extra formals,
120 -- and set proper default mechanism values). Note that this routine
121 -- is not called for internal subprograms, for which neither of these
122 -- actions is needed (or desirable, we do not want for example to have
123 -- these extra formals present in initialization procedures, where they
124 -- would serve no purpose). In this call E is either a subprogram or
125 -- a subprogram type (i.e. an access to a subprogram).
127 function Is_Fully_Defined (T : Entity_Id) return Boolean;
128 -- True if T is not private and has no private components, or has a full
129 -- view. Used to determine whether the designated type of an access type
130 -- should be frozen when the access type is frozen. This is done when an
131 -- allocator is frozen, or an expression that may involve attributes of
132 -- the designated type. Otherwise freezing the access type does not freeze
133 -- the designated type.
135 procedure Process_Default_Expressions
137 After : in out Node_Id);
138 -- This procedure is called for each subprogram to complete processing
139 -- of default expressions at the point where all types are known to be
140 -- frozen. The expressions must be analyzed in full, to make sure that
141 -- all error processing is done (they have only been pre-analyzed). If
142 -- the expression is not an entity or literal, its analysis may generate
143 -- code which must not be executed. In that case we build a function
144 -- body to hold that code. This wrapper function serves no other purpose
145 -- (it used to be called to evaluate the default, but now the default is
146 -- inlined at each point of call).
148 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id);
149 -- Typ is a record or array type that is being frozen. This routine
150 -- sets the default component alignment from the scope stack values
151 -- if the alignment is otherwise not specified.
153 procedure Check_Debug_Info_Needed (T : Entity_Id);
154 -- As each entity is frozen, this routine is called to deal with the
155 -- setting of Debug_Info_Needed for the entity. This flag is set if
156 -- the entity comes from source, or if we are in Debug_Generated_Code
157 -- mode or if the -gnatdV debug flag is set. However, it never sets
158 -- the flag if Debug_Info_Off is set. This procedure also ensures that
159 -- subsidiary entities have the flag set as required.
161 procedure Undelay_Type (T : Entity_Id);
162 -- T is a type of a component that we know to be an Itype.
163 -- We don't want this to have a Freeze_Node, so ensure it doesn't.
164 -- Do the same for any Full_View or Corresponding_Record_Type.
166 procedure Warn_Overlay
170 -- Expr is the expression for an address clause for entity Nam whose type
171 -- is Typ. If Typ has a default initialization, and there is no explicit
172 -- initialization in the source declaration, check whether the address
173 -- clause might cause overlaying of an entity, and emit a warning on the
174 -- side effect that the initialization will cause.
176 -------------------------------
177 -- Adjust_Esize_For_Alignment --
178 -------------------------------
180 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id) is
184 if Known_Esize (Typ) and then Known_Alignment (Typ) then
185 Align := Alignment_In_Bits (Typ);
187 if Align > Esize (Typ)
188 and then Align <= Standard_Long_Long_Integer_Size
190 Set_Esize (Typ, Align);
193 end Adjust_Esize_For_Alignment;
195 ------------------------------------
196 -- Build_And_Analyze_Renamed_Body --
197 ------------------------------------
199 procedure Build_And_Analyze_Renamed_Body
202 After : in out Node_Id)
204 Body_Node : constant Node_Id := Build_Renamed_Body (Decl, New_S);
206 Insert_After (After, Body_Node);
207 Mark_Rewrite_Insertion (Body_Node);
210 end Build_And_Analyze_Renamed_Body;
212 ------------------------
213 -- Build_Renamed_Body --
214 ------------------------
216 function Build_Renamed_Body
218 New_S : Entity_Id) return Node_Id
220 Loc : constant Source_Ptr := Sloc (New_S);
221 -- We use for the source location of the renamed body, the location
222 -- of the spec entity. It might seem more natural to use the location
223 -- of the renaming declaration itself, but that would be wrong, since
224 -- then the body we create would look as though it was created far
225 -- too late, and this could cause problems with elaboration order
226 -- analysis, particularly in connection with instantiations.
228 N : constant Node_Id := Unit_Declaration_Node (New_S);
229 Nam : constant Node_Id := Name (N);
231 Spec : constant Node_Id := New_Copy_Tree (Specification (Decl));
232 Actuals : List_Id := No_List;
237 O_Formal : Entity_Id;
238 Param_Spec : Node_Id;
240 Pref : Node_Id := Empty;
241 -- If the renamed entity is a primitive operation given in prefix form,
242 -- the prefix is the target object and it has to be added as the first
243 -- actual in the generated call.
246 -- Determine the entity being renamed, which is the target of the call
247 -- statement. If the name is an explicit dereference, this is a renaming
248 -- of a subprogram type rather than a subprogram. The name itself is
251 if Nkind (Nam) = N_Selected_Component then
252 Old_S := Entity (Selector_Name (Nam));
254 elsif Nkind (Nam) = N_Explicit_Dereference then
255 Old_S := Etype (Nam);
257 elsif Nkind (Nam) = N_Indexed_Component then
258 if Is_Entity_Name (Prefix (Nam)) then
259 Old_S := Entity (Prefix (Nam));
261 Old_S := Entity (Selector_Name (Prefix (Nam)));
264 elsif Nkind (Nam) = N_Character_Literal then
265 Old_S := Etype (New_S);
268 Old_S := Entity (Nam);
271 if Is_Entity_Name (Nam) then
273 -- If the renamed entity is a predefined operator, retain full name
274 -- to ensure its visibility.
276 if Ekind (Old_S) = E_Operator
277 and then Nkind (Nam) = N_Expanded_Name
279 Call_Name := New_Copy (Name (N));
281 Call_Name := New_Reference_To (Old_S, Loc);
285 if Nkind (Nam) = N_Selected_Component
286 and then Present (First_Formal (Old_S))
288 (Is_Controlling_Formal (First_Formal (Old_S))
289 or else Is_Class_Wide_Type (Etype (First_Formal (Old_S))))
292 -- Retrieve the target object, to be added as a first actual
295 Call_Name := New_Occurrence_Of (Old_S, Loc);
296 Pref := Prefix (Nam);
299 Call_Name := New_Copy (Name (N));
302 -- The original name may have been overloaded, but
303 -- is fully resolved now.
305 Set_Is_Overloaded (Call_Name, False);
308 -- For simple renamings, subsequent calls can be expanded directly as
309 -- called to the renamed entity. The body must be generated in any case
310 -- for calls they may appear elsewhere.
312 if (Ekind (Old_S) = E_Function
313 or else Ekind (Old_S) = E_Procedure)
314 and then Nkind (Decl) = N_Subprogram_Declaration
316 Set_Body_To_Inline (Decl, Old_S);
319 -- The body generated for this renaming is an internal artifact, and
320 -- does not constitute a freeze point for the called entity.
322 Set_Must_Not_Freeze (Call_Name);
324 Formal := First_Formal (Defining_Entity (Decl));
326 if Present (Pref) then
328 Pref_Type : constant Entity_Id := Etype (Pref);
329 Form_Type : constant Entity_Id := Etype (First_Formal (Old_S));
333 -- The controlling formal may be an access parameter, or the
334 -- actual may be an access value, so adjust accordingly.
336 if Is_Access_Type (Pref_Type)
337 and then not Is_Access_Type (Form_Type)
340 (Make_Explicit_Dereference (Loc, Relocate_Node (Pref)));
342 elsif Is_Access_Type (Form_Type)
343 and then not Is_Access_Type (Pref)
346 (Make_Attribute_Reference (Loc,
347 Attribute_Name => Name_Access,
348 Prefix => Relocate_Node (Pref)));
350 Actuals := New_List (Pref);
354 elsif Present (Formal) then
361 if Present (Formal) then
362 while Present (Formal) loop
363 Append (New_Reference_To (Formal, Loc), Actuals);
364 Next_Formal (Formal);
368 -- If the renamed entity is an entry, inherit its profile. For other
369 -- renamings as bodies, both profiles must be subtype conformant, so it
370 -- is not necessary to replace the profile given in the declaration.
371 -- However, default values that are aggregates are rewritten when
372 -- partially analyzed, so we recover the original aggregate to insure
373 -- that subsequent conformity checking works. Similarly, if the default
374 -- expression was constant-folded, recover the original expression.
376 Formal := First_Formal (Defining_Entity (Decl));
378 if Present (Formal) then
379 O_Formal := First_Formal (Old_S);
380 Param_Spec := First (Parameter_Specifications (Spec));
382 while Present (Formal) loop
383 if Is_Entry (Old_S) then
385 if Nkind (Parameter_Type (Param_Spec)) /=
388 Set_Etype (Formal, Etype (O_Formal));
389 Set_Entity (Parameter_Type (Param_Spec), Etype (O_Formal));
392 elsif Nkind (Default_Value (O_Formal)) = N_Aggregate
393 or else Nkind (Original_Node (Default_Value (O_Formal))) /=
394 Nkind (Default_Value (O_Formal))
396 Set_Expression (Param_Spec,
397 New_Copy_Tree (Original_Node (Default_Value (O_Formal))));
400 Next_Formal (Formal);
401 Next_Formal (O_Formal);
406 -- If the renamed entity is a function, the generated body contains a
407 -- return statement. Otherwise, build a procedure call. If the entity is
408 -- an entry, subsequent analysis of the call will transform it into the
409 -- proper entry or protected operation call. If the renamed entity is
410 -- a character literal, return it directly.
412 if Ekind (Old_S) = E_Function
413 or else Ekind (Old_S) = E_Operator
414 or else (Ekind (Old_S) = E_Subprogram_Type
415 and then Etype (Old_S) /= Standard_Void_Type)
418 Make_Simple_Return_Statement (Loc,
420 Make_Function_Call (Loc,
422 Parameter_Associations => Actuals));
424 elsif Ekind (Old_S) = E_Enumeration_Literal then
426 Make_Simple_Return_Statement (Loc,
427 Expression => New_Occurrence_Of (Old_S, Loc));
429 elsif Nkind (Nam) = N_Character_Literal then
431 Make_Simple_Return_Statement (Loc,
432 Expression => Call_Name);
436 Make_Procedure_Call_Statement (Loc,
438 Parameter_Associations => Actuals);
441 -- Create entities for subprogram body and formals
443 Set_Defining_Unit_Name (Spec,
444 Make_Defining_Identifier (Loc, Chars => Chars (New_S)));
446 Param_Spec := First (Parameter_Specifications (Spec));
448 while Present (Param_Spec) loop
449 Set_Defining_Identifier (Param_Spec,
450 Make_Defining_Identifier (Loc,
451 Chars => Chars (Defining_Identifier (Param_Spec))));
456 Make_Subprogram_Body (Loc,
457 Specification => Spec,
458 Declarations => New_List,
459 Handled_Statement_Sequence =>
460 Make_Handled_Sequence_Of_Statements (Loc,
461 Statements => New_List (Call_Node)));
463 if Nkind (Decl) /= N_Subprogram_Declaration then
465 Make_Subprogram_Declaration (Loc,
466 Specification => Specification (N)));
469 -- Link the body to the entity whose declaration it completes. If
470 -- the body is analyzed when the renamed entity is frozen, it may
471 -- be necessary to restore the proper scope (see package Exp_Ch13).
473 if Nkind (N) = N_Subprogram_Renaming_Declaration
474 and then Present (Corresponding_Spec (N))
476 Set_Corresponding_Spec (Body_Node, Corresponding_Spec (N));
478 Set_Corresponding_Spec (Body_Node, New_S);
482 end Build_Renamed_Body;
484 --------------------------
485 -- Check_Address_Clause --
486 --------------------------
488 procedure Check_Address_Clause (E : Entity_Id) is
489 Addr : constant Node_Id := Address_Clause (E);
491 Decl : constant Node_Id := Declaration_Node (E);
492 Typ : constant Entity_Id := Etype (E);
495 if Present (Addr) then
496 Expr := Expression (Addr);
498 -- If we have no initialization of any kind, then we don't need to
499 -- place any restrictions on the address clause, because the object
500 -- will be elaborated after the address clause is evaluated. This
501 -- happens if the declaration has no initial expression, or the type
502 -- has no implicit initialization, or the object is imported.
504 -- The same holds for all initialized scalar types and all access
505 -- types. Packed bit arrays of size up to 64 are represented using a
506 -- modular type with an initialization (to zero) and can be processed
507 -- like other initialized scalar types.
509 -- If the type is controlled, code to attach the object to a
510 -- finalization chain is generated at the point of declaration,
511 -- and therefore the elaboration of the object cannot be delayed:
512 -- the address expression must be a constant.
514 if (No (Expression (Decl))
515 and then not Controlled_Type (Typ)
517 (not Has_Non_Null_Base_Init_Proc (Typ)
518 or else Is_Imported (E)))
521 (Present (Expression (Decl))
522 and then Is_Scalar_Type (Typ))
528 (Is_Bit_Packed_Array (Typ)
530 Is_Modular_Integer_Type (Packed_Array_Type (Typ)))
534 -- Otherwise, we require the address clause to be constant because
535 -- the call to the initialization procedure (or the attach code) has
536 -- to happen at the point of the declaration.
539 Check_Constant_Address_Clause (Expr, E);
540 Set_Has_Delayed_Freeze (E, False);
543 if not Error_Posted (Expr)
544 and then not Controlled_Type (Typ)
546 Warn_Overlay (Expr, Typ, Name (Addr));
549 end Check_Address_Clause;
551 -----------------------------
552 -- Check_Compile_Time_Size --
553 -----------------------------
555 procedure Check_Compile_Time_Size (T : Entity_Id) is
557 procedure Set_Small_Size (T : Entity_Id; S : Uint);
558 -- Sets the compile time known size (32 bits or less) in the Esize
559 -- field, of T checking for a size clause that was given which attempts
560 -- to give a smaller size.
562 function Size_Known (T : Entity_Id) return Boolean;
563 -- Recursive function that does all the work
565 function Static_Discriminated_Components (T : Entity_Id) return Boolean;
566 -- If T is a constrained subtype, its size is not known if any of its
567 -- discriminant constraints is not static and it is not a null record.
568 -- The test is conservative and doesn't check that the components are
569 -- in fact constrained by non-static discriminant values. Could be made
576 procedure Set_Small_Size (T : Entity_Id; S : Uint) is
581 elsif Has_Size_Clause (T) then
582 if RM_Size (T) < S then
583 Error_Msg_Uint_1 := S;
585 ("size for & too small, minimum allowed is ^",
588 elsif Unknown_Esize (T) then
592 -- Set sizes if not set already
595 if Unknown_Esize (T) then
599 if Unknown_RM_Size (T) then
609 function Size_Known (T : Entity_Id) return Boolean is
617 if Size_Known_At_Compile_Time (T) then
620 -- Always True for scalar types. This is true even for generic formal
621 -- scalar types. We used to return False in the latter case, but the
622 -- size is known at compile time, even in the template, we just do
623 -- not know the exact size but that's not the point of this routine.
625 elsif Is_Scalar_Type (T)
626 or else Is_Task_Type (T)
632 elsif Is_Array_Type (T) then
634 -- String literals always have known size, and we can set it
636 if Ekind (T) = E_String_Literal_Subtype then
637 Set_Small_Size (T, Component_Size (T)
638 * String_Literal_Length (T));
641 -- Unconstrained types never have known at compile time size
643 elsif not Is_Constrained (T) then
646 -- Don't do any recursion on type with error posted, since we may
647 -- have a malformed type that leads us into a loop.
649 elsif Error_Posted (T) then
652 -- Otherwise if component size unknown, then array size unknown
654 elsif not Size_Known (Component_Type (T)) then
658 -- Check for all indexes static, and also compute possible size
659 -- (in case it is less than 32 and may be packable).
662 Esiz : Uint := Component_Size (T);
666 Index := First_Index (T);
667 while Present (Index) loop
668 if Nkind (Index) = N_Range then
669 Get_Index_Bounds (Index, Low, High);
671 elsif Error_Posted (Scalar_Range (Etype (Index))) then
675 Low := Type_Low_Bound (Etype (Index));
676 High := Type_High_Bound (Etype (Index));
679 if not Compile_Time_Known_Value (Low)
680 or else not Compile_Time_Known_Value (High)
681 or else Etype (Index) = Any_Type
686 Dim := Expr_Value (High) - Expr_Value (Low) + 1;
698 Set_Small_Size (T, Esiz);
702 -- Access types always have known at compile time sizes
704 elsif Is_Access_Type (T) then
707 -- For non-generic private types, go to underlying type if present
709 elsif Is_Private_Type (T)
710 and then not Is_Generic_Type (T)
711 and then Present (Underlying_Type (T))
713 -- Don't do any recursion on type with error posted, since we may
714 -- have a malformed type that leads us into a loop.
716 if Error_Posted (T) then
719 return Size_Known (Underlying_Type (T));
724 elsif Is_Record_Type (T) then
726 -- A class-wide type is never considered to have a known size
728 if Is_Class_Wide_Type (T) then
731 -- A subtype of a variant record must not have non-static
732 -- discriminanted components.
734 elsif T /= Base_Type (T)
735 and then not Static_Discriminated_Components (T)
739 -- Don't do any recursion on type with error posted, since we may
740 -- have a malformed type that leads us into a loop.
742 elsif Error_Posted (T) then
746 -- Now look at the components of the record
749 -- The following two variables are used to keep track of the
750 -- size of packed records if we can tell the size of the packed
751 -- record in the front end. Packed_Size_Known is True if so far
752 -- we can figure out the size. It is initialized to True for a
753 -- packed record, unless the record has discriminants. The
754 -- reason we eliminate the discriminated case is that we don't
755 -- know the way the back end lays out discriminated packed
756 -- records. If Packed_Size_Known is True, then Packed_Size is
757 -- the size in bits so far.
759 Packed_Size_Known : Boolean :=
761 and then not Has_Discriminants (T);
763 Packed_Size : Uint := Uint_0;
766 -- Test for variant part present
768 if Has_Discriminants (T)
769 and then Present (Parent (T))
770 and then Nkind (Parent (T)) = N_Full_Type_Declaration
771 and then Nkind (Type_Definition (Parent (T))) =
773 and then not Null_Present (Type_Definition (Parent (T)))
774 and then Present (Variant_Part
775 (Component_List (Type_Definition (Parent (T)))))
777 -- If variant part is present, and type is unconstrained,
778 -- then we must have defaulted discriminants, or a size
779 -- clause must be present for the type, or else the size
780 -- is definitely not known at compile time.
782 if not Is_Constrained (T)
784 No (Discriminant_Default_Value
785 (First_Discriminant (T)))
786 and then Unknown_Esize (T)
792 -- Loop through components
794 Comp := First_Component_Or_Discriminant (T);
795 while Present (Comp) loop
796 Ctyp := Etype (Comp);
798 -- We do not know the packed size if there is a component
799 -- clause present (we possibly could, but this would only
800 -- help in the case of a record with partial rep clauses.
801 -- That's because in the case of full rep clauses, the
802 -- size gets figured out anyway by a different circuit).
804 if Present (Component_Clause (Comp)) then
805 Packed_Size_Known := False;
808 -- We need to identify a component that is an array where
809 -- the index type is an enumeration type with non-standard
810 -- representation, and some bound of the type depends on a
813 -- This is because gigi computes the size by doing a
814 -- substitution of the appropriate discriminant value in
815 -- the size expression for the base type, and gigi is not
816 -- clever enough to evaluate the resulting expression (which
817 -- involves a call to rep_to_pos) at compile time.
819 -- It would be nice if gigi would either recognize that
820 -- this expression can be computed at compile time, or
821 -- alternatively figured out the size from the subtype
822 -- directly, where all the information is at hand ???
824 if Is_Array_Type (Etype (Comp))
825 and then Present (Packed_Array_Type (Etype (Comp)))
828 Ocomp : constant Entity_Id :=
829 Original_Record_Component (Comp);
830 OCtyp : constant Entity_Id := Etype (Ocomp);
836 Ind := First_Index (OCtyp);
837 while Present (Ind) loop
838 Indtyp := Etype (Ind);
840 if Is_Enumeration_Type (Indtyp)
841 and then Has_Non_Standard_Rep (Indtyp)
843 Lo := Type_Low_Bound (Indtyp);
844 Hi := Type_High_Bound (Indtyp);
846 if Is_Entity_Name (Lo)
847 and then Ekind (Entity (Lo)) = E_Discriminant
851 elsif Is_Entity_Name (Hi)
852 and then Ekind (Entity (Hi)) = E_Discriminant
863 -- Clearly size of record is not known if the size of one of
864 -- the components is not known.
866 if not Size_Known (Ctyp) then
870 -- Accumulate packed size if possible
872 if Packed_Size_Known then
874 -- We can only deal with elementary types, since for
875 -- non-elementary components, alignment enters into the
876 -- picture, and we don't know enough to handle proper
877 -- alignment in this context. Packed arrays count as
878 -- elementary if the representation is a modular type.
880 if Is_Elementary_Type (Ctyp)
881 or else (Is_Array_Type (Ctyp)
882 and then Present (Packed_Array_Type (Ctyp))
883 and then Is_Modular_Integer_Type
884 (Packed_Array_Type (Ctyp)))
886 -- If RM_Size is known and static, then we can
887 -- keep accumulating the packed size.
889 if Known_Static_RM_Size (Ctyp) then
891 -- A little glitch, to be removed sometime ???
892 -- gigi does not understand zero sizes yet.
894 if RM_Size (Ctyp) = Uint_0 then
895 Packed_Size_Known := False;
897 -- Normal case where we can keep accumulating the
898 -- packed array size.
901 Packed_Size := Packed_Size + RM_Size (Ctyp);
904 -- If we have a field whose RM_Size is not known then
905 -- we can't figure out the packed size here.
908 Packed_Size_Known := False;
911 -- If we have a non-elementary type we can't figure out
912 -- the packed array size (alignment issues).
915 Packed_Size_Known := False;
919 Next_Component_Or_Discriminant (Comp);
922 if Packed_Size_Known then
923 Set_Small_Size (T, Packed_Size);
929 -- All other cases, size not known at compile time
936 -------------------------------------
937 -- Static_Discriminated_Components --
938 -------------------------------------
940 function Static_Discriminated_Components
941 (T : Entity_Id) return Boolean
943 Constraint : Elmt_Id;
946 if Has_Discriminants (T)
947 and then Present (Discriminant_Constraint (T))
948 and then Present (First_Component (T))
950 Constraint := First_Elmt (Discriminant_Constraint (T));
951 while Present (Constraint) loop
952 if not Compile_Time_Known_Value (Node (Constraint)) then
956 Next_Elmt (Constraint);
961 end Static_Discriminated_Components;
963 -- Start of processing for Check_Compile_Time_Size
966 Set_Size_Known_At_Compile_Time (T, Size_Known (T));
967 end Check_Compile_Time_Size;
969 -----------------------------
970 -- Check_Debug_Info_Needed --
971 -----------------------------
973 procedure Check_Debug_Info_Needed (T : Entity_Id) is
975 if Debug_Info_Off (T) then
978 elsif Comes_From_Source (T)
979 or else Debug_Generated_Code
980 or else Debug_Flag_VV
981 or else Needs_Debug_Info (T)
983 Set_Debug_Info_Needed (T);
985 end Check_Debug_Info_Needed;
987 ----------------------------
988 -- Check_Strict_Alignment --
989 ----------------------------
991 procedure Check_Strict_Alignment (E : Entity_Id) is
995 if Is_Tagged_Type (E) or else Is_Concurrent_Type (E) then
996 Set_Strict_Alignment (E);
998 elsif Is_Array_Type (E) then
999 Set_Strict_Alignment (E, Strict_Alignment (Component_Type (E)));
1001 elsif Is_Record_Type (E) then
1002 if Is_Limited_Record (E) then
1003 Set_Strict_Alignment (E);
1007 Comp := First_Component (E);
1009 while Present (Comp) loop
1010 if not Is_Type (Comp)
1011 and then (Strict_Alignment (Etype (Comp))
1012 or else Is_Aliased (Comp))
1014 Set_Strict_Alignment (E);
1018 Next_Component (Comp);
1021 end Check_Strict_Alignment;
1023 -------------------------
1024 -- Check_Unsigned_Type --
1025 -------------------------
1027 procedure Check_Unsigned_Type (E : Entity_Id) is
1028 Ancestor : Entity_Id;
1033 if not Is_Discrete_Or_Fixed_Point_Type (E) then
1037 -- Do not attempt to analyze case where range was in error
1039 if Error_Posted (Scalar_Range (E)) then
1043 -- The situation that is non trivial is something like
1045 -- subtype x1 is integer range -10 .. +10;
1046 -- subtype x2 is x1 range 0 .. V1;
1047 -- subtype x3 is x2 range V2 .. V3;
1048 -- subtype x4 is x3 range V4 .. V5;
1050 -- where Vn are variables. Here the base type is signed, but we still
1051 -- know that x4 is unsigned because of the lower bound of x2.
1053 -- The only way to deal with this is to look up the ancestor chain
1057 if Ancestor = Any_Type or else Etype (Ancestor) = Any_Type then
1061 Lo_Bound := Type_Low_Bound (Ancestor);
1063 if Compile_Time_Known_Value (Lo_Bound) then
1065 if Expr_Rep_Value (Lo_Bound) >= 0 then
1066 Set_Is_Unsigned_Type (E, True);
1072 Ancestor := Ancestor_Subtype (Ancestor);
1074 -- If no ancestor had a static lower bound, go to base type
1076 if No (Ancestor) then
1078 -- Note: the reason we still check for a compile time known
1079 -- value for the base type is that at least in the case of
1080 -- generic formals, we can have bounds that fail this test,
1081 -- and there may be other cases in error situations.
1083 Btyp := Base_Type (E);
1085 if Btyp = Any_Type or else Etype (Btyp) = Any_Type then
1089 Lo_Bound := Type_Low_Bound (Base_Type (E));
1091 if Compile_Time_Known_Value (Lo_Bound)
1092 and then Expr_Rep_Value (Lo_Bound) >= 0
1094 Set_Is_Unsigned_Type (E, True);
1101 end Check_Unsigned_Type;
1103 -----------------------------
1104 -- Expand_Atomic_Aggregate --
1105 -----------------------------
1107 procedure Expand_Atomic_Aggregate (E : Entity_Id; Typ : Entity_Id) is
1108 Loc : constant Source_Ptr := Sloc (E);
1113 if (Nkind (Parent (E)) = N_Object_Declaration
1114 or else Nkind (Parent (E)) = N_Assignment_Statement)
1115 and then Comes_From_Source (Parent (E))
1116 and then Nkind (E) = N_Aggregate
1119 Make_Defining_Identifier (Loc,
1120 New_Internal_Name ('T'));
1123 Make_Object_Declaration (Loc,
1124 Defining_Identifier => Temp,
1125 Object_Definition => New_Occurrence_Of (Typ, Loc),
1126 Expression => Relocate_Node (E));
1127 Insert_Before (Parent (E), New_N);
1130 Set_Expression (Parent (E), New_Occurrence_Of (Temp, Loc));
1132 -- To prevent the temporary from being constant-folded (which would
1133 -- lead to the same piecemeal assignment on the original target)
1134 -- indicate to the back-end that the temporary is a variable with
1135 -- real storage. See description of this flag in Einfo, and the notes
1136 -- on N_Assignment_Statement and N_Object_Declaration in Sinfo.
1138 Set_Is_True_Constant (Temp, False);
1140 end Expand_Atomic_Aggregate;
1146 -- Note: the easy coding for this procedure would be to just build a
1147 -- single list of freeze nodes and then insert them and analyze them
1148 -- all at once. This won't work, because the analysis of earlier freeze
1149 -- nodes may recursively freeze types which would otherwise appear later
1150 -- on in the freeze list. So we must analyze and expand the freeze nodes
1151 -- as they are generated.
1153 procedure Freeze_All (From : Entity_Id; After : in out Node_Id) is
1154 Loc : constant Source_Ptr := Sloc (After);
1158 procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id);
1159 -- This is the internal recursive routine that does freezing of entities
1160 -- (but NOT the analysis of default expressions, which should not be
1161 -- recursive, we don't want to analyze those till we are sure that ALL
1162 -- the types are frozen).
1164 --------------------
1165 -- Freeze_All_Ent --
1166 --------------------
1168 procedure Freeze_All_Ent
1170 After : in out Node_Id)
1176 procedure Process_Flist;
1177 -- If freeze nodes are present, insert and analyze, and reset cursor
1178 -- for next insertion.
1184 procedure Process_Flist is
1186 if Is_Non_Empty_List (Flist) then
1187 Lastn := Next (After);
1188 Insert_List_After_And_Analyze (After, Flist);
1190 if Present (Lastn) then
1191 After := Prev (Lastn);
1193 After := Last (List_Containing (After));
1198 -- Start or processing for Freeze_All_Ent
1202 while Present (E) loop
1204 -- If the entity is an inner package which is not a package
1205 -- renaming, then its entities must be frozen at this point. Note
1206 -- that such entities do NOT get frozen at the end of the nested
1207 -- package itself (only library packages freeze).
1209 -- Same is true for task declarations, where anonymous records
1210 -- created for entry parameters must be frozen.
1212 if Ekind (E) = E_Package
1213 and then No (Renamed_Object (E))
1214 and then not Is_Child_Unit (E)
1215 and then not Is_Frozen (E)
1218 Install_Visible_Declarations (E);
1219 Install_Private_Declarations (E);
1221 Freeze_All (First_Entity (E), After);
1223 End_Package_Scope (E);
1225 elsif Ekind (E) in Task_Kind
1227 (Nkind (Parent (E)) = N_Task_Type_Declaration
1229 Nkind (Parent (E)) = N_Single_Task_Declaration)
1232 Freeze_All (First_Entity (E), After);
1235 -- For a derived tagged type, we must ensure that all the
1236 -- primitive operations of the parent have been frozen, so that
1237 -- their addresses will be in the parent's dispatch table at the
1238 -- point it is inherited.
1240 elsif Ekind (E) = E_Record_Type
1241 and then Is_Tagged_Type (E)
1242 and then Is_Tagged_Type (Etype (E))
1243 and then Is_Derived_Type (E)
1246 Prim_List : constant Elist_Id :=
1247 Primitive_Operations (Etype (E));
1253 Prim := First_Elmt (Prim_List);
1255 while Present (Prim) loop
1256 Subp := Node (Prim);
1258 if Comes_From_Source (Subp)
1259 and then not Is_Frozen (Subp)
1261 Flist := Freeze_Entity (Subp, Loc);
1270 if not Is_Frozen (E) then
1271 Flist := Freeze_Entity (E, Loc);
1275 -- If an incomplete type is still not frozen, this may be a
1276 -- premature freezing because of a body declaration that follows.
1277 -- Indicate where the freezing took place.
1279 -- If the freezing is caused by the end of the current declarative
1280 -- part, it is a Taft Amendment type, and there is no error.
1282 if not Is_Frozen (E)
1283 and then Ekind (E) = E_Incomplete_Type
1286 Bod : constant Node_Id := Next (After);
1289 if (Nkind (Bod) = N_Subprogram_Body
1290 or else Nkind (Bod) = N_Entry_Body
1291 or else Nkind (Bod) = N_Package_Body
1292 or else Nkind (Bod) = N_Protected_Body
1293 or else Nkind (Bod) = N_Task_Body
1294 or else Nkind (Bod) in N_Body_Stub)
1296 List_Containing (After) = List_Containing (Parent (E))
1298 Error_Msg_Sloc := Sloc (Next (After));
1300 ("type& is frozen# before its full declaration",
1310 -- Start of processing for Freeze_All
1313 Freeze_All_Ent (From, After);
1315 -- Now that all types are frozen, we can deal with default expressions
1316 -- that require us to build a default expression functions. This is the
1317 -- point at which such functions are constructed (after all types that
1318 -- might be used in such expressions have been frozen).
1320 -- We also add finalization chains to access types whose designated
1321 -- types are controlled. This is normally done when freezing the type,
1322 -- but this misses recursive type definitions where the later members
1323 -- of the recursion introduce controlled components.
1325 -- Loop through entities
1328 while Present (E) loop
1329 if Is_Subprogram (E) then
1331 if not Default_Expressions_Processed (E) then
1332 Process_Default_Expressions (E, After);
1335 if not Has_Completion (E) then
1336 Decl := Unit_Declaration_Node (E);
1338 if Nkind (Decl) = N_Subprogram_Renaming_Declaration then
1339 Build_And_Analyze_Renamed_Body (Decl, E, After);
1341 elsif Nkind (Decl) = N_Subprogram_Declaration
1342 and then Present (Corresponding_Body (Decl))
1344 Nkind (Unit_Declaration_Node (Corresponding_Body (Decl)))
1345 = N_Subprogram_Renaming_Declaration
1347 Build_And_Analyze_Renamed_Body
1348 (Decl, Corresponding_Body (Decl), After);
1352 elsif Ekind (E) in Task_Kind
1354 (Nkind (Parent (E)) = N_Task_Type_Declaration
1356 Nkind (Parent (E)) = N_Single_Task_Declaration)
1361 Ent := First_Entity (E);
1363 while Present (Ent) loop
1366 and then not Default_Expressions_Processed (Ent)
1368 Process_Default_Expressions (Ent, After);
1375 elsif Is_Access_Type (E)
1376 and then Comes_From_Source (E)
1377 and then Ekind (Directly_Designated_Type (E)) = E_Incomplete_Type
1378 and then Controlled_Type (Designated_Type (E))
1379 and then No (Associated_Final_Chain (E))
1381 Build_Final_List (Parent (E), E);
1388 -----------------------
1389 -- Freeze_And_Append --
1390 -----------------------
1392 procedure Freeze_And_Append
1395 Result : in out List_Id)
1397 L : constant List_Id := Freeze_Entity (Ent, Loc);
1399 if Is_Non_Empty_List (L) then
1400 if Result = No_List then
1403 Append_List (L, Result);
1406 end Freeze_And_Append;
1412 procedure Freeze_Before (N : Node_Id; T : Entity_Id) is
1413 Freeze_Nodes : constant List_Id := Freeze_Entity (T, Sloc (N));
1415 if Is_Non_Empty_List (Freeze_Nodes) then
1416 Insert_Actions (N, Freeze_Nodes);
1424 function Freeze_Entity (E : Entity_Id; Loc : Source_Ptr) return List_Id is
1425 Test_E : Entity_Id := E;
1433 procedure Check_Current_Instance (Comp_Decl : Node_Id);
1434 -- Check that an Access or Unchecked_Access attribute with a prefix
1435 -- which is the current instance type can only be applied when the type
1438 function After_Last_Declaration return Boolean;
1439 -- If Loc is a freeze_entity that appears after the last declaration
1440 -- in the scope, inhibit error messages on late completion.
1442 procedure Freeze_Record_Type (Rec : Entity_Id);
1443 -- Freeze each component, handle some representation clauses, and freeze
1444 -- primitive operations if this is a tagged type.
1446 ----------------------------
1447 -- After_Last_Declaration --
1448 ----------------------------
1450 function After_Last_Declaration return Boolean is
1451 Spec : constant Node_Id := Parent (Current_Scope);
1453 if Nkind (Spec) = N_Package_Specification then
1454 if Present (Private_Declarations (Spec)) then
1455 return Loc >= Sloc (Last (Private_Declarations (Spec)));
1456 elsif Present (Visible_Declarations (Spec)) then
1457 return Loc >= Sloc (Last (Visible_Declarations (Spec)));
1464 end After_Last_Declaration;
1466 ----------------------------
1467 -- Check_Current_Instance --
1468 ----------------------------
1470 procedure Check_Current_Instance (Comp_Decl : Node_Id) is
1472 Rec_Type : constant Entity_Id :=
1473 Scope (Defining_Identifier (Comp_Decl));
1475 Decl : constant Node_Id := Parent (Rec_Type);
1477 function Process (N : Node_Id) return Traverse_Result;
1478 -- Process routine to apply check to given node
1484 function Process (N : Node_Id) return Traverse_Result is
1487 when N_Attribute_Reference =>
1488 if (Attribute_Name (N) = Name_Access
1490 Attribute_Name (N) = Name_Unchecked_Access)
1491 and then Is_Entity_Name (Prefix (N))
1492 and then Is_Type (Entity (Prefix (N)))
1493 and then Entity (Prefix (N)) = E
1496 ("current instance must be a limited type", Prefix (N));
1502 when others => return OK;
1506 procedure Traverse is new Traverse_Proc (Process);
1508 -- Start of processing for Check_Current_Instance
1511 -- In Ada95, the (imprecise) rule is that the current instance of a
1512 -- limited type is aliased. In Ada2005, limitedness must be explicit:
1513 -- either a tagged type, or a limited record.
1515 if Is_Limited_Type (Rec_Type)
1517 (Ada_Version < Ada_05
1518 or else Is_Tagged_Type (Rec_Type))
1522 elsif Nkind (Decl) = N_Full_Type_Declaration
1523 and then Limited_Present (Type_Definition (Decl))
1528 Traverse (Comp_Decl);
1530 end Check_Current_Instance;
1532 ------------------------
1533 -- Freeze_Record_Type --
1534 ------------------------
1536 procedure Freeze_Record_Type (Rec : Entity_Id) is
1543 pragma Warnings (Off, Junk);
1545 Unplaced_Component : Boolean := False;
1546 -- Set True if we find at least one component with no component
1547 -- clause (used to warn about useless Pack pragmas).
1549 Placed_Component : Boolean := False;
1550 -- Set True if we find at least one component with a component
1551 -- clause (used to warn about useless Bit_Order pragmas).
1553 function Check_Allocator (N : Node_Id) return Node_Id;
1554 -- If N is an allocator, possibly wrapped in one or more level of
1555 -- qualified expression(s), return the inner allocator node, else
1558 procedure Check_Itype (Typ : Entity_Id);
1559 -- If the component subtype is an access to a constrained subtype of
1560 -- an already frozen type, make the subtype frozen as well. It might
1561 -- otherwise be frozen in the wrong scope, and a freeze node on
1562 -- subtype has no effect. Similarly, if the component subtype is a
1563 -- regular (not protected) access to subprogram, set the anonymous
1564 -- subprogram type to frozen as well, to prevent an out-of-scope
1565 -- freeze node at some eventual point of call. Protected operations
1566 -- are handled elsewhere.
1568 ---------------------
1569 -- Check_Allocator --
1570 ---------------------
1572 function Check_Allocator (N : Node_Id) return Node_Id is
1577 if Nkind (Inner) = N_Allocator then
1579 elsif Nkind (Inner) = N_Qualified_Expression then
1580 Inner := Expression (Inner);
1585 end Check_Allocator;
1591 procedure Check_Itype (Typ : Entity_Id) is
1592 Desig : constant Entity_Id := Designated_Type (Typ);
1595 if not Is_Frozen (Desig)
1596 and then Is_Frozen (Base_Type (Desig))
1598 Set_Is_Frozen (Desig);
1600 -- In addition, add an Itype_Reference to ensure that the
1601 -- access subtype is elaborated early enough. This cannot be
1602 -- done if the subtype may depend on discriminants.
1604 if Ekind (Comp) = E_Component
1605 and then Is_Itype (Etype (Comp))
1606 and then not Has_Discriminants (Rec)
1608 IR := Make_Itype_Reference (Sloc (Comp));
1609 Set_Itype (IR, Desig);
1612 Result := New_List (IR);
1614 Append (IR, Result);
1618 elsif Ekind (Typ) = E_Anonymous_Access_Subprogram_Type
1619 and then Convention (Desig) /= Convention_Protected
1621 Set_Is_Frozen (Desig);
1625 -- Start of processing for Freeze_Record_Type
1628 -- If this is a subtype of a controlled type, declared without a
1629 -- constraint, the _controller may not appear in the component list
1630 -- if the parent was not frozen at the point of subtype declaration.
1631 -- Inherit the _controller component now.
1633 if Rec /= Base_Type (Rec)
1634 and then Has_Controlled_Component (Rec)
1636 if Nkind (Parent (Rec)) = N_Subtype_Declaration
1637 and then Is_Entity_Name (Subtype_Indication (Parent (Rec)))
1639 Set_First_Entity (Rec, First_Entity (Base_Type (Rec)));
1641 -- If this is an internal type without a declaration, as for
1642 -- record component, the base type may not yet be frozen, and its
1643 -- controller has not been created. Add an explicit freeze node
1644 -- for the itype, so it will be frozen after the base type. This
1645 -- freeze node is used to communicate with the expander, in order
1646 -- to create the controller for the enclosing record, and it is
1647 -- deleted afterwards (see exp_ch3). It must not be created when
1648 -- expansion is off, because it might appear in the wrong context
1649 -- for the back end.
1651 elsif Is_Itype (Rec)
1652 and then Has_Delayed_Freeze (Base_Type (Rec))
1654 Nkind (Associated_Node_For_Itype (Rec)) =
1655 N_Component_Declaration
1656 and then Expander_Active
1658 Ensure_Freeze_Node (Rec);
1662 -- Freeze components and embedded subtypes
1664 Comp := First_Entity (Rec);
1666 while Present (Comp) loop
1668 -- First handle the (real) component case
1670 if Ekind (Comp) = E_Component
1671 or else Ekind (Comp) = E_Discriminant
1674 CC : constant Node_Id := Component_Clause (Comp);
1677 -- Freezing a record type freezes the type of each of its
1678 -- components. However, if the type of the component is
1679 -- part of this record, we do not want or need a separate
1680 -- Freeze_Node. Note that Is_Itype is wrong because that's
1681 -- also set in private type cases. We also can't check for
1682 -- the Scope being exactly Rec because of private types and
1683 -- record extensions.
1685 if Is_Itype (Etype (Comp))
1686 and then Is_Record_Type (Underlying_Type
1687 (Scope (Etype (Comp))))
1689 Undelay_Type (Etype (Comp));
1692 Freeze_And_Append (Etype (Comp), Loc, Result);
1694 -- Check for error of component clause given for variable
1695 -- sized type. We have to delay this test till this point,
1696 -- since the component type has to be frozen for us to know
1697 -- if it is variable length. We omit this test in a generic
1698 -- context, it will be applied at instantiation time.
1700 if Present (CC) then
1701 Placed_Component := True;
1703 if Inside_A_Generic then
1707 Size_Known_At_Compile_Time
1708 (Underlying_Type (Etype (Comp)))
1711 ("component clause not allowed for variable " &
1712 "length component", CC);
1716 Unplaced_Component := True;
1719 -- Case of component requires byte alignment
1721 if Must_Be_On_Byte_Boundary (Etype (Comp)) then
1723 -- Set the enclosing record to also require byte align
1725 Set_Must_Be_On_Byte_Boundary (Rec);
1727 -- Check for component clause that is inconsistent with
1728 -- the required byte boundary alignment.
1731 and then Normalized_First_Bit (Comp) mod
1732 System_Storage_Unit /= 0
1735 ("component & must be byte aligned",
1736 Component_Name (Component_Clause (Comp)));
1740 -- If component clause is present, then deal with the non-
1741 -- default bit order case for Ada 95 mode. The required
1742 -- processing for Ada 2005 mode is handled separately after
1743 -- processing all components.
1745 -- We only do this processing for the base type, and in
1746 -- fact that's important, since otherwise if there are
1747 -- record subtypes, we could reverse the bits once for
1748 -- each subtype, which would be incorrect.
1751 and then Reverse_Bit_Order (Rec)
1752 and then Ekind (E) = E_Record_Type
1753 and then Ada_Version <= Ada_95
1756 CFB : constant Uint := Component_Bit_Offset (Comp);
1757 CSZ : constant Uint := Esize (Comp);
1758 CLC : constant Node_Id := Component_Clause (Comp);
1759 Pos : constant Node_Id := Position (CLC);
1760 FB : constant Node_Id := First_Bit (CLC);
1762 Storage_Unit_Offset : constant Uint :=
1763 CFB / System_Storage_Unit;
1765 Start_Bit : constant Uint :=
1766 CFB mod System_Storage_Unit;
1769 -- Cases where field goes over storage unit boundary
1771 if Start_Bit + CSZ > System_Storage_Unit then
1773 -- Allow multi-byte field but generate warning
1775 if Start_Bit mod System_Storage_Unit = 0
1776 and then CSZ mod System_Storage_Unit = 0
1779 ("multi-byte field specified with non-standard"
1780 & " Bit_Order?", CLC);
1782 if Bytes_Big_Endian then
1784 ("bytes are not reversed "
1785 & "(component is big-endian)?", CLC);
1788 ("bytes are not reversed "
1789 & "(component is little-endian)?", CLC);
1792 -- Do not allow non-contiguous field
1796 ("attempt to specify non-contiguous field"
1797 & " not permitted", CLC);
1799 ("\(caused by non-standard Bit_Order "
1800 & "specified)", CLC);
1803 -- Case where field fits in one storage unit
1806 -- Give warning if suspicious component clause
1808 if Intval (FB) >= System_Storage_Unit
1809 and then Warn_On_Reverse_Bit_Order
1812 ("?Bit_Order clause does not affect " &
1813 "byte ordering", Pos);
1815 Intval (Pos) + Intval (FB) /
1816 System_Storage_Unit;
1818 ("?position normalized to ^ before bit " &
1819 "order interpreted", Pos);
1822 -- Here is where we fix up the Component_Bit_Offset
1823 -- value to account for the reverse bit order.
1824 -- Some examples of what needs to be done are:
1826 -- First_Bit .. Last_Bit Component_Bit_Offset
1829 -- 0 .. 0 7 .. 7 0 7
1830 -- 0 .. 1 6 .. 7 0 6
1831 -- 0 .. 2 5 .. 7 0 5
1832 -- 0 .. 7 0 .. 7 0 4
1834 -- 1 .. 1 6 .. 6 1 6
1835 -- 1 .. 4 3 .. 6 1 3
1836 -- 4 .. 7 0 .. 3 4 0
1838 -- The general rule is that the first bit is
1839 -- is obtained by subtracting the old ending bit
1840 -- from storage_unit - 1.
1842 Set_Component_Bit_Offset
1844 (Storage_Unit_Offset * System_Storage_Unit) +
1845 (System_Storage_Unit - 1) -
1846 (Start_Bit + CSZ - 1));
1848 Set_Normalized_First_Bit
1850 Component_Bit_Offset (Comp) mod
1851 System_Storage_Unit);
1858 -- If the component is an Itype with Delayed_Freeze and is either
1859 -- a record or array subtype and its base type has not yet been
1860 -- frozen, we must remove this from the entity list of this
1861 -- record and put it on the entity list of the scope of its base
1862 -- type. Note that we know that this is not the type of a
1863 -- component since we cleared Has_Delayed_Freeze for it in the
1864 -- previous loop. Thus this must be the Designated_Type of an
1865 -- access type, which is the type of a component.
1868 and then Is_Type (Scope (Comp))
1869 and then Is_Composite_Type (Comp)
1870 and then Base_Type (Comp) /= Comp
1871 and then Has_Delayed_Freeze (Comp)
1872 and then not Is_Frozen (Base_Type (Comp))
1875 Will_Be_Frozen : Boolean := False;
1879 -- We have a pretty bad kludge here. Suppose Rec is subtype
1880 -- being defined in a subprogram that's created as part of
1881 -- the freezing of Rec'Base. In that case, we know that
1882 -- Comp'Base must have already been frozen by the time we
1883 -- get to elaborate this because Gigi doesn't elaborate any
1884 -- bodies until it has elaborated all of the declarative
1885 -- part. But Is_Frozen will not be set at this point because
1886 -- we are processing code in lexical order.
1888 -- We detect this case by going up the Scope chain of Rec
1889 -- and seeing if we have a subprogram scope before reaching
1890 -- the top of the scope chain or that of Comp'Base. If we
1891 -- do, then mark that Comp'Base will actually be frozen. If
1892 -- so, we merely undelay it.
1895 while Present (S) loop
1896 if Is_Subprogram (S) then
1897 Will_Be_Frozen := True;
1899 elsif S = Scope (Base_Type (Comp)) then
1906 if Will_Be_Frozen then
1907 Undelay_Type (Comp);
1909 if Present (Prev) then
1910 Set_Next_Entity (Prev, Next_Entity (Comp));
1912 Set_First_Entity (Rec, Next_Entity (Comp));
1915 -- Insert in entity list of scope of base type (which
1916 -- must be an enclosing scope, because still unfrozen).
1918 Append_Entity (Comp, Scope (Base_Type (Comp)));
1922 -- If the component is an access type with an allocator as default
1923 -- value, the designated type will be frozen by the corresponding
1924 -- expression in init_proc. In order to place the freeze node for
1925 -- the designated type before that for the current record type,
1928 -- Same process if the component is an array of access types,
1929 -- initialized with an aggregate. If the designated type is
1930 -- private, it cannot contain allocators, and it is premature
1931 -- to freeze the type, so we check for this as well.
1933 elsif Is_Access_Type (Etype (Comp))
1934 and then Present (Parent (Comp))
1935 and then Present (Expression (Parent (Comp)))
1938 Alloc : constant Node_Id :=
1939 Check_Allocator (Expression (Parent (Comp)));
1942 if Present (Alloc) then
1944 -- If component is pointer to a classwide type, freeze
1945 -- the specific type in the expression being allocated.
1946 -- The expression may be a subtype indication, in which
1947 -- case freeze the subtype mark.
1949 if Is_Class_Wide_Type
1950 (Designated_Type (Etype (Comp)))
1952 if Is_Entity_Name (Expression (Alloc)) then
1954 (Entity (Expression (Alloc)), Loc, Result);
1956 Nkind (Expression (Alloc)) = N_Subtype_Indication
1959 (Entity (Subtype_Mark (Expression (Alloc))),
1963 elsif Is_Itype (Designated_Type (Etype (Comp))) then
1964 Check_Itype (Etype (Comp));
1968 (Designated_Type (Etype (Comp)), Loc, Result);
1973 elsif Is_Access_Type (Etype (Comp))
1974 and then Is_Itype (Designated_Type (Etype (Comp)))
1976 Check_Itype (Etype (Comp));
1978 elsif Is_Array_Type (Etype (Comp))
1979 and then Is_Access_Type (Component_Type (Etype (Comp)))
1980 and then Present (Parent (Comp))
1981 and then Nkind (Parent (Comp)) = N_Component_Declaration
1982 and then Present (Expression (Parent (Comp)))
1983 and then Nkind (Expression (Parent (Comp))) = N_Aggregate
1984 and then Is_Fully_Defined
1985 (Designated_Type (Component_Type (Etype (Comp))))
1989 (Component_Type (Etype (Comp))), Loc, Result);
1996 -- Deal with pragma Bit_Order
1998 if Reverse_Bit_Order (Rec) and then Base_Type (Rec) = Rec then
1999 if not Placed_Component then
2001 Get_Attribute_Definition_Clause (Rec, Attribute_Bit_Order);
2003 ("?Bit_Order specification has no effect", ADC);
2005 ("\?since no component clauses were specified", ADC);
2007 -- Here is where we do Ada 2005 processing for bit order (the Ada
2008 -- 95 case was already taken care of above).
2010 elsif Ada_Version >= Ada_05 then
2011 Adjust_Record_For_Reverse_Bit_Order (Rec);
2015 -- Set OK_To_Reorder_Components depending on debug flags
2017 if Rec = Base_Type (Rec)
2018 and then Convention (Rec) = Convention_Ada
2020 if (Has_Discriminants (Rec) and then Debug_Flag_Dot_V)
2022 (not Has_Discriminants (Rec) and then Debug_Flag_Dot_R)
2024 Set_OK_To_Reorder_Components (Rec);
2028 -- Check for useless pragma Pack when all components placed. We only
2029 -- do this check for record types, not subtypes, since a subtype may
2030 -- have all its components placed, and it still makes perfectly good
2031 -- sense to pack other subtypes or the parent type. We do not give
2032 -- this warning if Optimize_Alignment is set to Space, since the
2033 -- pragma Pack does have an effect in this case (it always resets
2034 -- the alignment to one).
2036 if Ekind (Rec) = E_Record_Type
2037 and then Is_Packed (Rec)
2038 and then not Unplaced_Component
2039 and then Optimize_Alignment /= 'S'
2041 -- Reset packed status. Probably not necessary, but we do it so
2042 -- that there is no chance of the back end doing something strange
2043 -- with this redundant indication of packing.
2045 Set_Is_Packed (Rec, False);
2047 -- Give warning if redundant constructs warnings on
2049 if Warn_On_Redundant_Constructs then
2051 ("?pragma Pack has no effect, no unplaced components",
2052 Get_Rep_Pragma (Rec, Name_Pack));
2056 -- If this is the record corresponding to a remote type, freeze the
2057 -- remote type here since that is what we are semantically freezing.
2058 -- This prevents the freeze node for that type in an inner scope.
2060 -- Also, Check for controlled components and unchecked unions.
2061 -- Finally, enforce the restriction that access attributes with a
2062 -- current instance prefix can only apply to limited types.
2064 if Ekind (Rec) = E_Record_Type then
2065 if Present (Corresponding_Remote_Type (Rec)) then
2067 (Corresponding_Remote_Type (Rec), Loc, Result);
2070 Comp := First_Component (Rec);
2071 while Present (Comp) loop
2072 if Has_Controlled_Component (Etype (Comp))
2073 or else (Chars (Comp) /= Name_uParent
2074 and then Is_Controlled (Etype (Comp)))
2075 or else (Is_Protected_Type (Etype (Comp))
2077 (Corresponding_Record_Type (Etype (Comp)))
2078 and then Has_Controlled_Component
2079 (Corresponding_Record_Type (Etype (Comp))))
2081 Set_Has_Controlled_Component (Rec);
2085 if Has_Unchecked_Union (Etype (Comp)) then
2086 Set_Has_Unchecked_Union (Rec);
2089 if Has_Per_Object_Constraint (Comp) then
2091 -- Scan component declaration for likely misuses of current
2092 -- instance, either in a constraint or a default expression.
2094 Check_Current_Instance (Parent (Comp));
2097 Next_Component (Comp);
2101 Set_Component_Alignment_If_Not_Set (Rec);
2103 -- For first subtypes, check if there are any fixed-point fields with
2104 -- component clauses, where we must check the size. This is not done
2105 -- till the freeze point, since for fixed-point types, we do not know
2106 -- the size until the type is frozen. Similar processing applies to
2107 -- bit packed arrays.
2109 if Is_First_Subtype (Rec) then
2110 Comp := First_Component (Rec);
2112 while Present (Comp) loop
2113 if Present (Component_Clause (Comp))
2114 and then (Is_Fixed_Point_Type (Etype (Comp))
2116 Is_Bit_Packed_Array (Etype (Comp)))
2119 (Component_Name (Component_Clause (Comp)),
2125 Next_Component (Comp);
2129 -- Generate warning for applying C or C++ convention to a record
2130 -- with discriminants. This is suppressed for the unchecked union
2131 -- case, since the whole point in this case is interface C. We also
2132 -- do not generate this within instantiations, since we will have
2133 -- generated a message on the template.
2135 if Has_Discriminants (E)
2136 and then not Is_Unchecked_Union (E)
2137 and then (Convention (E) = Convention_C
2139 Convention (E) = Convention_CPP)
2140 and then Comes_From_Source (E)
2141 and then not In_Instance
2142 and then not Has_Warnings_Off (E)
2143 and then not Has_Warnings_Off (Base_Type (E))
2146 Cprag : constant Node_Id := Get_Rep_Pragma (E, Name_Convention);
2150 if Present (Cprag) then
2151 A2 := Next (First (Pragma_Argument_Associations (Cprag)));
2153 if Convention (E) = Convention_C then
2155 ("?variant record has no direct equivalent in C", A2);
2158 ("?variant record has no direct equivalent in C++", A2);
2162 ("\?use of convention for type& is dubious", A2, E);
2166 end Freeze_Record_Type;
2168 -- Start of processing for Freeze_Entity
2171 -- We are going to test for various reasons why this entity need not be
2172 -- frozen here, but in the case of an Itype that's defined within a
2173 -- record, that test actually applies to the record.
2175 if Is_Itype (E) and then Is_Record_Type (Scope (E)) then
2176 Test_E := Scope (E);
2177 elsif Is_Itype (E) and then Present (Underlying_Type (Scope (E)))
2178 and then Is_Record_Type (Underlying_Type (Scope (E)))
2180 Test_E := Underlying_Type (Scope (E));
2183 -- Do not freeze if already frozen since we only need one freeze node
2185 if Is_Frozen (E) then
2188 -- It is improper to freeze an external entity within a generic because
2189 -- its freeze node will appear in a non-valid context. The entity will
2190 -- be frozen in the proper scope after the current generic is analyzed.
2192 elsif Inside_A_Generic and then External_Ref_In_Generic (Test_E) then
2195 -- Do not freeze a global entity within an inner scope created during
2196 -- expansion. A call to subprogram E within some internal procedure
2197 -- (a stream attribute for example) might require freezing E, but the
2198 -- freeze node must appear in the same declarative part as E itself.
2199 -- The two-pass elaboration mechanism in gigi guarantees that E will
2200 -- be frozen before the inner call is elaborated. We exclude constants
2201 -- from this test, because deferred constants may be frozen early, and
2202 -- must be diagnosed (e.g. in the case of a deferred constant being used
2203 -- in a default expression). If the enclosing subprogram comes from
2204 -- source, or is a generic instance, then the freeze point is the one
2205 -- mandated by the language, and we freeze the entity. A subprogram that
2206 -- is a child unit body that acts as a spec does not have a spec that
2207 -- comes from source, but can only come from source.
2209 elsif In_Open_Scopes (Scope (Test_E))
2210 and then Scope (Test_E) /= Current_Scope
2211 and then Ekind (Test_E) /= E_Constant
2214 S : Entity_Id := Current_Scope;
2217 while Present (S) loop
2218 if Is_Overloadable (S) then
2219 if Comes_From_Source (S)
2220 or else Is_Generic_Instance (S)
2221 or else Is_Child_Unit (S)
2233 -- Similarly, an inlined instance body may make reference to global
2234 -- entities, but these references cannot be the proper freezing point
2235 -- for them, and in the absence of inlining freezing will take place in
2236 -- their own scope. Normally instance bodies are analyzed after the
2237 -- enclosing compilation, and everything has been frozen at the proper
2238 -- place, but with front-end inlining an instance body is compiled
2239 -- before the end of the enclosing scope, and as a result out-of-order
2240 -- freezing must be prevented.
2242 elsif Front_End_Inlining
2243 and then In_Instance_Body
2244 and then Present (Scope (Test_E))
2247 S : Entity_Id := Scope (Test_E);
2250 while Present (S) loop
2251 if Is_Generic_Instance (S) then
2264 -- Here to freeze the entity
2269 -- Case of entity being frozen is other than a type
2271 if not Is_Type (E) then
2273 -- If entity is exported or imported and does not have an external
2274 -- name, now is the time to provide the appropriate default name.
2275 -- Skip this if the entity is stubbed, since we don't need a name
2276 -- for any stubbed routine.
2278 if (Is_Imported (E) or else Is_Exported (E))
2279 and then No (Interface_Name (E))
2280 and then Convention (E) /= Convention_Stubbed
2282 Set_Encoded_Interface_Name
2283 (E, Get_Default_External_Name (E));
2285 -- Special processing for atomic objects appearing in object decls
2288 and then Nkind (Parent (E)) = N_Object_Declaration
2289 and then Present (Expression (Parent (E)))
2292 Expr : constant Node_Id := Expression (Parent (E));
2295 -- If expression is an aggregate, assign to a temporary to
2296 -- ensure that the actual assignment is done atomically rather
2297 -- than component-wise (the assignment to the temp may be done
2298 -- component-wise, but that is harmless).
2300 if Nkind (Expr) = N_Aggregate then
2301 Expand_Atomic_Aggregate (Expr, Etype (E));
2303 -- If the expression is a reference to a record or array object
2304 -- entity, then reset Is_True_Constant to False so that the
2305 -- compiler will not optimize away the intermediate object,
2306 -- which we need in this case for the same reason (to ensure
2307 -- that the actual assignment is atomic, rather than
2310 elsif Is_Entity_Name (Expr)
2311 and then (Is_Record_Type (Etype (Expr))
2313 Is_Array_Type (Etype (Expr)))
2315 Set_Is_True_Constant (Entity (Expr), False);
2320 -- For a subprogram, freeze all parameter types and also the return
2321 -- type (RM 13.14(14)). However skip this for internal subprograms.
2322 -- This is also the point where any extra formal parameters are
2323 -- created since we now know whether the subprogram will use
2324 -- a foreign convention.
2326 if Is_Subprogram (E) then
2327 if not Is_Internal (E) then
2331 Warn_Node : Node_Id;
2334 -- Loop through formals
2336 Formal := First_Formal (E);
2337 while Present (Formal) loop
2338 F_Type := Etype (Formal);
2339 Freeze_And_Append (F_Type, Loc, Result);
2341 if Is_Private_Type (F_Type)
2342 and then Is_Private_Type (Base_Type (F_Type))
2343 and then No (Full_View (Base_Type (F_Type)))
2344 and then not Is_Generic_Type (F_Type)
2345 and then not Is_Derived_Type (F_Type)
2347 -- If the type of a formal is incomplete, subprogram
2348 -- is being frozen prematurely. Within an instance
2349 -- (but not within a wrapper package) this is an
2350 -- an artifact of our need to regard the end of an
2351 -- instantiation as a freeze point. Otherwise it is
2352 -- a definite error.
2354 -- and then not Is_Wrapper_Package (Current_Scope) ???
2357 Set_Is_Frozen (E, False);
2360 elsif not After_Last_Declaration
2361 and then not Freezing_Library_Level_Tagged_Type
2363 Error_Msg_Node_1 := F_Type;
2365 ("type& must be fully defined before this point",
2370 -- Check suspicious parameter for C function. These tests
2371 -- apply only to exported/imported subprograms.
2373 if Warn_On_Export_Import
2374 and then Comes_From_Source (E)
2375 and then (Convention (E) = Convention_C
2377 Convention (E) = Convention_CPP)
2378 and then (Is_Imported (E) or else Is_Exported (E))
2379 and then Convention (E) /= Convention (Formal)
2380 and then not Has_Warnings_Off (E)
2381 and then not Has_Warnings_Off (F_Type)
2382 and then not Has_Warnings_Off (Formal)
2384 Error_Msg_Qual_Level := 1;
2386 -- Check suspicious use of fat C pointer
2388 if Is_Access_Type (F_Type)
2389 and then Esize (F_Type) > Ttypes.System_Address_Size
2392 ("?type of & does not correspond "
2393 & "to C pointer!", Formal);
2395 -- Check suspicious return of boolean
2397 elsif Root_Type (F_Type) = Standard_Boolean
2398 and then Convention (F_Type) = Convention_Ada
2401 ("?& is an 8-bit Ada Boolean, "
2402 & "use char in C!", Formal);
2404 -- Check suspicious tagged type
2406 elsif (Is_Tagged_Type (F_Type)
2407 or else (Is_Access_Type (F_Type)
2410 (Designated_Type (F_Type))))
2411 and then Convention (E) = Convention_C
2414 ("?& is a tagged type which does not "
2415 & "correspond to any C type!", Formal);
2417 -- Check wrong convention subprogram pointer
2419 elsif Ekind (F_Type) = E_Access_Subprogram_Type
2420 and then not Has_Foreign_Convention (F_Type)
2423 ("?subprogram pointer & should "
2424 & "have foreign convention!", Formal);
2425 Error_Msg_Sloc := Sloc (F_Type);
2427 ("\?add Convention pragma to declaration of &#",
2431 Error_Msg_Qual_Level := 0;
2434 -- Check for unconstrained array in exported foreign
2437 if Has_Foreign_Convention (E)
2438 and then not Is_Imported (E)
2439 and then Is_Array_Type (F_Type)
2440 and then not Is_Constrained (F_Type)
2441 and then Warn_On_Export_Import
2443 Error_Msg_Qual_Level := 1;
2445 -- If this is an inherited operation, place the
2446 -- warning on the derived type declaration, rather
2447 -- than on the original subprogram.
2449 if Nkind (Original_Node (Parent (E))) =
2450 N_Full_Type_Declaration
2452 Warn_Node := Parent (E);
2454 if Formal = First_Formal (E) then
2456 ("?in inherited operation&", Warn_Node, E);
2459 Warn_Node := Formal;
2463 ("?type of argument& is unconstrained array",
2466 ("?foreign caller must pass bounds explicitly",
2468 Error_Msg_Qual_Level := 0;
2471 -- Ada 2005 (AI-326): Check wrong use of tag incomplete
2472 -- types with unknown discriminants. For example:
2474 -- type T (<>) is tagged;
2475 -- procedure P (X : access T); -- ERROR
2476 -- procedure P (X : T); -- ERROR
2478 if not From_With_Type (F_Type) then
2479 if Is_Access_Type (F_Type) then
2480 F_Type := Designated_Type (F_Type);
2483 if Ekind (F_Type) = E_Incomplete_Type
2484 and then Is_Tagged_Type (F_Type)
2485 and then not Is_Class_Wide_Type (F_Type)
2486 and then No (Full_View (F_Type))
2487 and then Unknown_Discriminants_Present
2489 and then No (Stored_Constraint (F_Type))
2492 ("(Ada 2005): invalid use of unconstrained tagged"
2493 & " incomplete type", E);
2495 -- If the formal is an anonymous_access_to_subprogram
2496 -- freeze the subprogram type as well, to prevent
2497 -- scope anomalies in gigi, because there is no other
2498 -- clear point at which it could be frozen.
2500 elsif Is_Itype (Etype (Formal))
2501 and then Ekind (F_Type) = E_Subprogram_Type
2503 Freeze_And_Append (F_Type, Loc, Result);
2507 Next_Formal (Formal);
2512 if Ekind (E) = E_Function then
2514 -- Freeze return type
2516 R_Type := Etype (E);
2517 Freeze_And_Append (R_Type, Loc, Result);
2519 -- Check suspicious return type for C function
2521 if Warn_On_Export_Import
2522 and then (Convention (E) = Convention_C
2524 Convention (E) = Convention_CPP)
2525 and then (Is_Imported (E) or else Is_Exported (E))
2527 -- Check suspicious return of fat C pointer
2529 if Is_Access_Type (R_Type)
2530 and then Esize (R_Type) > Ttypes.System_Address_Size
2531 and then not Has_Warnings_Off (E)
2532 and then not Has_Warnings_Off (R_Type)
2535 ("?return type of& does not "
2536 & "correspond to C pointer!", E);
2538 -- Check suspicious return of boolean
2540 elsif Root_Type (R_Type) = Standard_Boolean
2541 and then Convention (R_Type) = Convention_Ada
2542 and then not Has_Warnings_Off (E)
2543 and then not Has_Warnings_Off (R_Type)
2546 ("?return type of & is an 8-bit "
2547 & "Ada Boolean, use char in C!", E);
2549 -- Check suspicious return tagged type
2551 elsif (Is_Tagged_Type (R_Type)
2552 or else (Is_Access_Type (R_Type)
2555 (Designated_Type (R_Type))))
2556 and then Convention (E) = Convention_C
2557 and then not Has_Warnings_Off (E)
2558 and then not Has_Warnings_Off (R_Type)
2561 ("?return type of & does not "
2562 & "correspond to C type!", E);
2564 -- Check return of wrong convention subprogram pointer
2566 elsif Ekind (R_Type) = E_Access_Subprogram_Type
2567 and then not Has_Foreign_Convention (R_Type)
2568 and then not Has_Warnings_Off (E)
2569 and then not Has_Warnings_Off (R_Type)
2572 ("?& should return a foreign "
2573 & "convention subprogram pointer", E);
2574 Error_Msg_Sloc := Sloc (R_Type);
2576 ("\?add Convention pragma to declaration of& #",
2581 if Is_Array_Type (Etype (E))
2582 and then not Is_Constrained (Etype (E))
2583 and then not Is_Imported (E)
2584 and then Has_Foreign_Convention (E)
2585 and then Warn_On_Export_Import
2586 and then not Has_Warnings_Off (E)
2587 and then not Has_Warnings_Off (Etype (E))
2590 ("?foreign convention function& should not " &
2591 "return unconstrained array!", E);
2593 -- Ada 2005 (AI-326): Check wrong use of tagged
2596 -- type T is tagged;
2597 -- function F (X : Boolean) return T; -- ERROR
2599 elsif Ekind (Etype (E)) = E_Incomplete_Type
2600 and then Is_Tagged_Type (Etype (E))
2601 and then No (Full_View (Etype (E)))
2602 and then not Is_Value_Type (Etype (E))
2605 ("(Ada 2005): invalid use of tagged incomplete type",
2612 -- Must freeze its parent first if it is a derived subprogram
2614 if Present (Alias (E)) then
2615 Freeze_And_Append (Alias (E), Loc, Result);
2618 -- We don't freeze internal subprograms, because we don't normally
2619 -- want addition of extra formals or mechanism setting to happen
2620 -- for those. However we do pass through predefined dispatching
2621 -- cases, since extra formals may be needed in some cases, such as
2622 -- for the stream 'Input function (build-in-place formals).
2624 if not Is_Internal (E)
2625 or else Is_Predefined_Dispatching_Operation (E)
2627 Freeze_Subprogram (E);
2630 -- Here for other than a subprogram or type
2633 -- If entity has a type, and it is not a generic unit, then
2634 -- freeze it first (RM 13.14(10)).
2636 if Present (Etype (E))
2637 and then Ekind (E) /= E_Generic_Function
2639 Freeze_And_Append (Etype (E), Loc, Result);
2642 -- Special processing for objects created by object declaration
2644 if Nkind (Declaration_Node (E)) = N_Object_Declaration then
2646 -- For object created by object declaration, perform required
2647 -- categorization (preelaborate and pure) checks. Defer these
2648 -- checks to freeze time since pragma Import inhibits default
2649 -- initialization and thus pragma Import affects these checks.
2651 Validate_Object_Declaration (Declaration_Node (E));
2653 -- If there is an address clause, check it is valid
2655 Check_Address_Clause (E);
2657 -- For imported objects, set Is_Public unless there is also an
2658 -- address clause, which means that there is no external symbol
2659 -- needed for the Import (Is_Public may still be set for other
2660 -- unrelated reasons). Note that we delayed this processing
2661 -- till freeze time so that we can be sure not to set the flag
2662 -- if there is an address clause. If there is such a clause,
2663 -- then the only purpose of the Import pragma is to suppress
2664 -- implicit initialization.
2667 and then No (Address_Clause (E))
2672 -- For convention C objects of an enumeration type, warn if
2673 -- the size is not integer size and no explicit size given.
2674 -- Skip warning for Boolean, and Character, assume programmer
2675 -- expects 8-bit sizes for these cases.
2677 if (Convention (E) = Convention_C
2679 Convention (E) = Convention_CPP)
2680 and then Is_Enumeration_Type (Etype (E))
2681 and then not Is_Character_Type (Etype (E))
2682 and then not Is_Boolean_Type (Etype (E))
2683 and then Esize (Etype (E)) < Standard_Integer_Size
2684 and then not Has_Size_Clause (E)
2686 Error_Msg_Uint_1 := UI_From_Int (Standard_Integer_Size);
2688 ("?convention C enumeration object has size less than ^",
2690 Error_Msg_N ("\?use explicit size clause to set size", E);
2694 -- Check that a constant which has a pragma Volatile[_Components]
2695 -- or Atomic[_Components] also has a pragma Import (RM C.6(13)).
2697 -- Note: Atomic[_Components] also sets Volatile[_Components]
2699 if Ekind (E) = E_Constant
2700 and then (Has_Volatile_Components (E) or else Is_Volatile (E))
2701 and then not Is_Imported (E)
2703 -- Make sure we actually have a pragma, and have not merely
2704 -- inherited the indication from elsewhere (e.g. an address
2705 -- clause, which is not good enough in RM terms!)
2707 if Has_Rep_Pragma (E, Name_Atomic)
2709 Has_Rep_Pragma (E, Name_Atomic_Components)
2712 ("stand alone atomic constant must be " &
2713 "imported (RM C.6(13))", E);
2715 elsif Has_Rep_Pragma (E, Name_Volatile)
2717 Has_Rep_Pragma (E, Name_Volatile_Components)
2720 ("stand alone volatile constant must be " &
2721 "imported (RM C.6(13))", E);
2725 -- Static objects require special handling
2727 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
2728 and then Is_Statically_Allocated (E)
2730 Freeze_Static_Object (E);
2733 -- Remaining step is to layout objects
2735 if Ekind (E) = E_Variable
2737 Ekind (E) = E_Constant
2739 Ekind (E) = E_Loop_Parameter
2747 -- Case of a type or subtype being frozen
2750 -- We used to check here that a full type must have preelaborable
2751 -- initialization if it completes a private type specified with
2752 -- pragma Preelaborable_Intialization, but that missed cases where
2753 -- the types occur within a generic package, since the freezing
2754 -- that occurs within a containing scope generally skips traversal
2755 -- of a generic unit's declarations (those will be frozen within
2756 -- instances). This check was moved to Analyze_Package_Specification.
2758 -- The type may be defined in a generic unit. This can occur when
2759 -- freezing a generic function that returns the type (which is
2760 -- defined in a parent unit). It is clearly meaningless to freeze
2761 -- this type. However, if it is a subtype, its size may be determi-
2762 -- nable and used in subsequent checks, so might as well try to
2765 if Present (Scope (E))
2766 and then Is_Generic_Unit (Scope (E))
2768 Check_Compile_Time_Size (E);
2772 -- Deal with special cases of freezing for subtype
2774 if E /= Base_Type (E) then
2776 -- Before we do anything else, a specialized test for the case of
2777 -- a size given for an array where the array needs to be packed,
2778 -- but was not so the size cannot be honored. This would of course
2779 -- be caught by the backend, and indeed we don't catch all cases.
2780 -- The point is that we can give a better error message in those
2781 -- cases that we do catch with the circuitry here. Also if pragma
2782 -- Implicit_Packing is set, this is where the packing occurs.
2784 -- The reason we do this so early is that the processing in the
2785 -- automatic packing case affects the layout of the base type, so
2786 -- it must be done before we freeze the base type.
2788 if Is_Array_Type (E) then
2791 Ctyp : constant Entity_Id := Component_Type (E);
2794 -- Check enabling conditions. These are straightforward
2795 -- except for the test for a limited composite type. This
2796 -- eliminates the rare case of a array of limited components
2797 -- where there are issues of whether or not we can go ahead
2798 -- and pack the array (since we can't freely pack and unpack
2799 -- arrays if they are limited).
2801 -- Note that we check the root type explicitly because the
2802 -- whole point is we are doing this test before we have had
2803 -- a chance to freeze the base type (and it is that freeze
2804 -- action that causes stuff to be inherited).
2806 if Present (Size_Clause (E))
2807 and then Known_Static_Esize (E)
2808 and then not Is_Packed (E)
2809 and then not Has_Pragma_Pack (E)
2810 and then Number_Dimensions (E) = 1
2811 and then not Has_Component_Size_Clause (E)
2812 and then Known_Static_Esize (Ctyp)
2813 and then not Is_Limited_Composite (E)
2814 and then not Is_Packed (Root_Type (E))
2815 and then not Has_Component_Size_Clause (Root_Type (E))
2817 Get_Index_Bounds (First_Index (E), Lo, Hi);
2819 if Compile_Time_Known_Value (Lo)
2820 and then Compile_Time_Known_Value (Hi)
2821 and then Known_Static_RM_Size (Ctyp)
2822 and then RM_Size (Ctyp) < 64
2825 Lov : constant Uint := Expr_Value (Lo);
2826 Hiv : constant Uint := Expr_Value (Hi);
2827 Len : constant Uint := UI_Max
2830 Rsiz : constant Uint := RM_Size (Ctyp);
2831 SZ : constant Node_Id := Size_Clause (E);
2832 Btyp : constant Entity_Id := Base_Type (E);
2834 -- What we are looking for here is the situation where
2835 -- the RM_Size given would be exactly right if there
2836 -- was a pragma Pack (resulting in the component size
2837 -- being the same as the RM_Size). Furthermore, the
2838 -- component type size must be an odd size (not a
2839 -- multiple of storage unit)
2842 if RM_Size (E) = Len * Rsiz
2843 and then Rsiz mod System_Storage_Unit /= 0
2845 -- For implicit packing mode, just set the
2846 -- component size silently
2848 if Implicit_Packing then
2849 Set_Component_Size (Btyp, Rsiz);
2850 Set_Is_Bit_Packed_Array (Btyp);
2851 Set_Is_Packed (Btyp);
2852 Set_Has_Non_Standard_Rep (Btyp);
2854 -- Otherwise give an error message
2858 ("size given for& too small", SZ, E);
2860 ("\use explicit pragma Pack "
2861 & "or use pragma Implicit_Packing", SZ);
2870 -- If ancestor subtype present, freeze that first. Note that this
2871 -- will also get the base type frozen.
2873 Atype := Ancestor_Subtype (E);
2875 if Present (Atype) then
2876 Freeze_And_Append (Atype, Loc, Result);
2878 -- Otherwise freeze the base type of the entity before freezing
2879 -- the entity itself (RM 13.14(15)).
2881 elsif E /= Base_Type (E) then
2882 Freeze_And_Append (Base_Type (E), Loc, Result);
2885 -- For a derived type, freeze its parent type first (RM 13.14(15))
2887 elsif Is_Derived_Type (E) then
2888 Freeze_And_Append (Etype (E), Loc, Result);
2889 Freeze_And_Append (First_Subtype (Etype (E)), Loc, Result);
2892 -- For array type, freeze index types and component type first
2893 -- before freezing the array (RM 13.14(15)).
2895 if Is_Array_Type (E) then
2897 Ctyp : constant Entity_Id := Component_Type (E);
2899 Non_Standard_Enum : Boolean := False;
2900 -- Set true if any of the index types is an enumeration type
2901 -- with a non-standard representation.
2904 Freeze_And_Append (Ctyp, Loc, Result);
2906 Indx := First_Index (E);
2907 while Present (Indx) loop
2908 Freeze_And_Append (Etype (Indx), Loc, Result);
2910 if Is_Enumeration_Type (Etype (Indx))
2911 and then Has_Non_Standard_Rep (Etype (Indx))
2913 Non_Standard_Enum := True;
2919 -- Processing that is done only for base types
2921 if Ekind (E) = E_Array_Type then
2923 -- Propagate flags for component type
2925 if Is_Controlled (Component_Type (E))
2926 or else Has_Controlled_Component (Ctyp)
2928 Set_Has_Controlled_Component (E);
2931 if Has_Unchecked_Union (Component_Type (E)) then
2932 Set_Has_Unchecked_Union (E);
2935 -- If packing was requested or if the component size was set
2936 -- explicitly, then see if bit packing is required. This
2937 -- processing is only done for base types, since all the
2938 -- representation aspects involved are type-related. This
2939 -- is not just an optimization, if we start processing the
2940 -- subtypes, they interfere with the settings on the base
2941 -- type (this is because Is_Packed has a slightly different
2942 -- meaning before and after freezing).
2949 if (Is_Packed (E) or else Has_Pragma_Pack (E))
2950 and then not Has_Atomic_Components (E)
2951 and then Known_Static_RM_Size (Ctyp)
2953 Csiz := UI_Max (RM_Size (Ctyp), 1);
2955 elsif Known_Component_Size (E) then
2956 Csiz := Component_Size (E);
2958 elsif not Known_Static_Esize (Ctyp) then
2962 Esiz := Esize (Ctyp);
2964 -- We can set the component size if it is less than
2965 -- 16, rounding it up to the next storage unit size.
2969 elsif Esiz <= 16 then
2975 -- Set component size up to match alignment if it
2976 -- would otherwise be less than the alignment. This
2977 -- deals with cases of types whose alignment exceeds
2978 -- their size (padded types).
2982 A : constant Uint := Alignment_In_Bits (Ctyp);
2991 -- Case of component size that may result in packing
2993 if 1 <= Csiz and then Csiz <= 64 then
2995 Ent : constant Entity_Id :=
2997 Pack_Pragma : constant Node_Id :=
2998 Get_Rep_Pragma (Ent, Name_Pack);
2999 Comp_Size_C : constant Node_Id :=
3000 Get_Attribute_Definition_Clause
3001 (Ent, Attribute_Component_Size);
3003 -- Warn if we have pack and component size so that
3004 -- the pack is ignored.
3006 -- Note: here we must check for the presence of a
3007 -- component size before checking for a Pack pragma
3008 -- to deal with the case where the array type is a
3009 -- derived type whose parent is currently private.
3011 if Present (Comp_Size_C)
3012 and then Has_Pragma_Pack (Ent)
3014 Error_Msg_Sloc := Sloc (Comp_Size_C);
3016 ("?pragma Pack for& ignored!",
3019 ("\?explicit component size given#!",
3023 -- Set component size if not already set by a
3024 -- component size clause.
3026 if not Present (Comp_Size_C) then
3027 Set_Component_Size (E, Csiz);
3030 -- Check for base type of 8, 16, 32 bits, where an
3031 -- unsigned subtype has a length one less than the
3032 -- base type (e.g. Natural subtype of Integer).
3034 -- In such cases, if a component size was not set
3035 -- explicitly, then generate a warning.
3037 if Has_Pragma_Pack (E)
3038 and then not Present (Comp_Size_C)
3040 (Csiz = 7 or else Csiz = 15 or else Csiz = 31)
3041 and then Esize (Base_Type (Ctyp)) = Csiz + 1
3043 Error_Msg_Uint_1 := Csiz;
3045 if Present (Pack_Pragma) then
3047 ("?pragma Pack causes component size "
3048 & "to be ^!", Pack_Pragma);
3050 ("\?use Component_Size to set "
3051 & "desired value!", Pack_Pragma);
3055 -- Actual packing is not needed for 8, 16, 32, 64.
3056 -- Also not needed for 24 if alignment is 1.
3062 or else (Csiz = 24 and then Alignment (Ctyp) = 1)
3064 -- Here the array was requested to be packed,
3065 -- but the packing request had no effect, so
3066 -- Is_Packed is reset.
3068 -- Note: semantically this means that we lose
3069 -- track of the fact that a derived type
3070 -- inherited a pragma Pack that was non-
3071 -- effective, but that seems fine.
3073 -- We regard a Pack pragma as a request to set
3074 -- a representation characteristic, and this
3075 -- request may be ignored.
3077 Set_Is_Packed (Base_Type (E), False);
3079 -- In all other cases, packing is indeed needed
3082 Set_Has_Non_Standard_Rep (Base_Type (E));
3083 Set_Is_Bit_Packed_Array (Base_Type (E));
3084 Set_Is_Packed (Base_Type (E));
3090 -- Processing that is done only for subtypes
3093 -- Acquire alignment from base type
3095 if Unknown_Alignment (E) then
3096 Set_Alignment (E, Alignment (Base_Type (E)));
3097 Adjust_Esize_Alignment (E);
3101 -- For bit-packed arrays, check the size
3103 if Is_Bit_Packed_Array (E)
3104 and then Known_RM_Size (E)
3107 SizC : constant Node_Id := Size_Clause (E);
3110 pragma Warnings (Off, Discard);
3113 -- It is not clear if it is possible to have no size
3114 -- clause at this stage, but it is not worth worrying
3115 -- about. Post error on the entity name in the size
3116 -- clause if present, else on the type entity itself.
3118 if Present (SizC) then
3119 Check_Size (Name (SizC), E, RM_Size (E), Discard);
3121 Check_Size (E, E, RM_Size (E), Discard);
3126 -- If any of the index types was an enumeration type with
3127 -- a non-standard rep clause, then we indicate that the
3128 -- array type is always packed (even if it is not bit packed).
3130 if Non_Standard_Enum then
3131 Set_Has_Non_Standard_Rep (Base_Type (E));
3132 Set_Is_Packed (Base_Type (E));
3135 Set_Component_Alignment_If_Not_Set (E);
3137 -- If the array is packed, we must create the packed array
3138 -- type to be used to actually implement the type. This is
3139 -- only needed for real array types (not for string literal
3140 -- types, since they are present only for the front end).
3143 and then Ekind (E) /= E_String_Literal_Subtype
3145 Create_Packed_Array_Type (E);
3146 Freeze_And_Append (Packed_Array_Type (E), Loc, Result);
3148 -- Size information of packed array type is copied to the
3149 -- array type, since this is really the representation. But
3150 -- do not override explicit existing size values. If the
3151 -- ancestor subtype is constrained the packed_array_type
3152 -- will be inherited from it, but the size may have been
3153 -- provided already, and must not be overridden either.
3155 if not Has_Size_Clause (E)
3157 (No (Ancestor_Subtype (E))
3158 or else not Has_Size_Clause (Ancestor_Subtype (E)))
3160 Set_Esize (E, Esize (Packed_Array_Type (E)));
3161 Set_RM_Size (E, RM_Size (Packed_Array_Type (E)));
3164 if not Has_Alignment_Clause (E) then
3165 Set_Alignment (E, Alignment (Packed_Array_Type (E)));
3169 -- For non-packed arrays set the alignment of the array to the
3170 -- alignment of the component type if it is unknown. Skip this
3171 -- in atomic case (atomic arrays may need larger alignments).
3173 if not Is_Packed (E)
3174 and then Unknown_Alignment (E)
3175 and then Known_Alignment (Ctyp)
3176 and then Known_Static_Component_Size (E)
3177 and then Known_Static_Esize (Ctyp)
3178 and then Esize (Ctyp) = Component_Size (E)
3179 and then not Is_Atomic (E)
3181 Set_Alignment (E, Alignment (Component_Type (E)));
3185 -- For a class-wide type, the corresponding specific type is
3186 -- frozen as well (RM 13.14(15))
3188 elsif Is_Class_Wide_Type (E) then
3189 Freeze_And_Append (Root_Type (E), Loc, Result);
3191 -- If the base type of the class-wide type is still incomplete,
3192 -- the class-wide remains unfrozen as well. This is legal when
3193 -- E is the formal of a primitive operation of some other type
3194 -- which is being frozen.
3196 if not Is_Frozen (Root_Type (E)) then
3197 Set_Is_Frozen (E, False);
3201 -- If the Class_Wide_Type is an Itype (when type is the anonymous
3202 -- parent of a derived type) and it is a library-level entity,
3203 -- generate an itype reference for it. Otherwise, its first
3204 -- explicit reference may be in an inner scope, which will be
3205 -- rejected by the back-end.
3208 and then Is_Compilation_Unit (Scope (E))
3211 Ref : constant Node_Id := Make_Itype_Reference (Loc);
3216 Result := New_List (Ref);
3218 Append (Ref, Result);
3223 -- The equivalent type associated with a class-wide subtype needs
3224 -- to be frozen to ensure that its layout is done. Class-wide
3225 -- subtypes are currently only frozen on targets requiring
3226 -- front-end layout (see New_Class_Wide_Subtype and
3227 -- Make_CW_Equivalent_Type in exp_util.adb).
3229 if Ekind (E) = E_Class_Wide_Subtype
3230 and then Present (Equivalent_Type (E))
3232 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3235 -- For a record (sub)type, freeze all the component types (RM
3236 -- 13.14(15). We test for E_Record_(sub)Type here, rather than using
3237 -- Is_Record_Type, because we don't want to attempt the freeze for
3238 -- the case of a private type with record extension (we will do that
3239 -- later when the full type is frozen).
3241 elsif Ekind (E) = E_Record_Type
3242 or else Ekind (E) = E_Record_Subtype
3244 Freeze_Record_Type (E);
3246 -- For a concurrent type, freeze corresponding record type. This
3247 -- does not correspond to any specific rule in the RM, but the
3248 -- record type is essentially part of the concurrent type.
3249 -- Freeze as well all local entities. This includes record types
3250 -- created for entry parameter blocks, and whatever local entities
3251 -- may appear in the private part.
3253 elsif Is_Concurrent_Type (E) then
3254 if Present (Corresponding_Record_Type (E)) then
3256 (Corresponding_Record_Type (E), Loc, Result);
3259 Comp := First_Entity (E);
3261 while Present (Comp) loop
3262 if Is_Type (Comp) then
3263 Freeze_And_Append (Comp, Loc, Result);
3265 elsif (Ekind (Comp)) /= E_Function then
3266 if Is_Itype (Etype (Comp))
3267 and then Underlying_Type (Scope (Etype (Comp))) = E
3269 Undelay_Type (Etype (Comp));
3272 Freeze_And_Append (Etype (Comp), Loc, Result);
3278 -- Private types are required to point to the same freeze node as
3279 -- their corresponding full views. The freeze node itself has to
3280 -- point to the partial view of the entity (because from the partial
3281 -- view, we can retrieve the full view, but not the reverse).
3282 -- However, in order to freeze correctly, we need to freeze the full
3283 -- view. If we are freezing at the end of a scope (or within the
3284 -- scope of the private type), the partial and full views will have
3285 -- been swapped, the full view appears first in the entity chain and
3286 -- the swapping mechanism ensures that the pointers are properly set
3289 -- If we encounter the partial view before the full view (e.g. when
3290 -- freezing from another scope), we freeze the full view, and then
3291 -- set the pointers appropriately since we cannot rely on swapping to
3292 -- fix things up (subtypes in an outer scope might not get swapped).
3294 elsif Is_Incomplete_Or_Private_Type (E)
3295 and then not Is_Generic_Type (E)
3297 -- The construction of the dispatch table associated with library
3298 -- level tagged types forces freezing of all the primitives of the
3299 -- type, which may cause premature freezing of the partial view.
3303 -- type T is tagged private;
3304 -- type DT is new T with private;
3305 -- procedure Prim (X : in out T; Y : in out DT'class);
3307 -- type T is tagged null record;
3309 -- type DT is new T with null record;
3312 -- In this case the type will be frozen later by the usual
3313 -- mechanism: an object declaration, an instantiation, or the
3314 -- end of a declarative part.
3316 if Is_Library_Level_Tagged_Type (E)
3317 and then not Present (Full_View (E))
3319 Set_Is_Frozen (E, False);
3322 -- Case of full view present
3324 elsif Present (Full_View (E)) then
3326 -- If full view has already been frozen, then no further
3327 -- processing is required
3329 if Is_Frozen (Full_View (E)) then
3331 Set_Has_Delayed_Freeze (E, False);
3332 Set_Freeze_Node (E, Empty);
3333 Check_Debug_Info_Needed (E);
3335 -- Otherwise freeze full view and patch the pointers so that
3336 -- the freeze node will elaborate both views in the back-end.
3340 Full : constant Entity_Id := Full_View (E);
3343 if Is_Private_Type (Full)
3344 and then Present (Underlying_Full_View (Full))
3347 (Underlying_Full_View (Full), Loc, Result);
3350 Freeze_And_Append (Full, Loc, Result);
3352 if Has_Delayed_Freeze (E) then
3353 F_Node := Freeze_Node (Full);
3355 if Present (F_Node) then
3356 Set_Freeze_Node (E, F_Node);
3357 Set_Entity (F_Node, E);
3360 -- {Incomplete,Private}_Subtypes with Full_Views
3361 -- constrained by discriminants.
3363 Set_Has_Delayed_Freeze (E, False);
3364 Set_Freeze_Node (E, Empty);
3369 Check_Debug_Info_Needed (E);
3372 -- AI-117 requires that the convention of a partial view be the
3373 -- same as the convention of the full view. Note that this is a
3374 -- recognized breach of privacy, but it's essential for logical
3375 -- consistency of representation, and the lack of a rule in
3376 -- RM95 was an oversight.
3378 Set_Convention (E, Convention (Full_View (E)));
3380 Set_Size_Known_At_Compile_Time (E,
3381 Size_Known_At_Compile_Time (Full_View (E)));
3383 -- Size information is copied from the full view to the
3384 -- incomplete or private view for consistency.
3386 -- We skip this is the full view is not a type. This is very
3387 -- strange of course, and can only happen as a result of
3388 -- certain illegalities, such as a premature attempt to derive
3389 -- from an incomplete type.
3391 if Is_Type (Full_View (E)) then
3392 Set_Size_Info (E, Full_View (E));
3393 Set_RM_Size (E, RM_Size (Full_View (E)));
3398 -- Case of no full view present. If entity is derived or subtype,
3399 -- it is safe to freeze, correctness depends on the frozen status
3400 -- of parent. Otherwise it is either premature usage, or a Taft
3401 -- amendment type, so diagnosis is at the point of use and the
3402 -- type might be frozen later.
3404 elsif E /= Base_Type (E)
3405 or else Is_Derived_Type (E)
3410 Set_Is_Frozen (E, False);
3414 -- For access subprogram, freeze types of all formals, the return
3415 -- type was already frozen, since it is the Etype of the function.
3417 elsif Ekind (E) = E_Subprogram_Type then
3418 Formal := First_Formal (E);
3419 while Present (Formal) loop
3420 Freeze_And_Append (Etype (Formal), Loc, Result);
3421 Next_Formal (Formal);
3424 Freeze_Subprogram (E);
3426 -- Ada 2005 (AI-326): Check wrong use of tag incomplete type
3428 -- type T is tagged;
3429 -- type Acc is access function (X : T) return T; -- ERROR
3431 if Ekind (Etype (E)) = E_Incomplete_Type
3432 and then Is_Tagged_Type (Etype (E))
3433 and then No (Full_View (Etype (E)))
3434 and then not Is_Value_Type (Etype (E))
3437 ("(Ada 2005): invalid use of tagged incomplete type", E);
3440 -- For access to a protected subprogram, freeze the equivalent type
3441 -- (however this is not set if we are not generating code or if this
3442 -- is an anonymous type used just for resolution).
3444 elsif Is_Access_Protected_Subprogram_Type (E) then
3446 -- AI-326: Check wrong use of tagged incomplete types
3448 -- type T is tagged;
3449 -- type As3D is access protected
3450 -- function (X : Float) return T; -- ERROR
3456 Etyp := Etype (Directly_Designated_Type (E));
3458 if Is_Class_Wide_Type (Etyp) then
3459 Etyp := Etype (Etyp);
3462 if Ekind (Etyp) = E_Incomplete_Type
3463 and then Is_Tagged_Type (Etyp)
3464 and then No (Full_View (Etyp))
3465 and then not Is_Value_Type (Etype (E))
3468 ("(Ada 2005): invalid use of tagged incomplete type", E);
3472 if Present (Equivalent_Type (E)) then
3473 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3477 -- Generic types are never seen by the back-end, and are also not
3478 -- processed by the expander (since the expander is turned off for
3479 -- generic processing), so we never need freeze nodes for them.
3481 if Is_Generic_Type (E) then
3485 -- Some special processing for non-generic types to complete
3486 -- representation details not known till the freeze point.
3488 if Is_Fixed_Point_Type (E) then
3489 Freeze_Fixed_Point_Type (E);
3491 -- Some error checks required for ordinary fixed-point type. Defer
3492 -- these till the freeze-point since we need the small and range
3493 -- values. We only do these checks for base types
3495 if Is_Ordinary_Fixed_Point_Type (E)
3496 and then E = Base_Type (E)
3498 if Small_Value (E) < Ureal_2_M_80 then
3499 Error_Msg_Name_1 := Name_Small;
3501 ("`&''%` too small, minimum allowed is 2.0'*'*(-80)", E);
3503 elsif Small_Value (E) > Ureal_2_80 then
3504 Error_Msg_Name_1 := Name_Small;
3506 ("`&''%` too large, maximum allowed is 2.0'*'*80", E);
3509 if Expr_Value_R (Type_Low_Bound (E)) < Ureal_M_10_36 then
3510 Error_Msg_Name_1 := Name_First;
3512 ("`&''%` too small, minimum allowed is -10.0'*'*36", E);
3515 if Expr_Value_R (Type_High_Bound (E)) > Ureal_10_36 then
3516 Error_Msg_Name_1 := Name_Last;
3518 ("`&''%` too large, maximum allowed is 10.0'*'*36", E);
3522 elsif Is_Enumeration_Type (E) then
3523 Freeze_Enumeration_Type (E);
3525 elsif Is_Integer_Type (E) then
3526 Adjust_Esize_For_Alignment (E);
3528 elsif Is_Access_Type (E) then
3530 -- Check restriction for standard storage pool
3532 if No (Associated_Storage_Pool (E)) then
3533 Check_Restriction (No_Standard_Storage_Pools, E);
3536 -- Deal with error message for pure access type. This is not an
3537 -- error in Ada 2005 if there is no pool (see AI-366).
3539 if Is_Pure_Unit_Access_Type (E)
3540 and then (Ada_Version < Ada_05
3541 or else not No_Pool_Assigned (E))
3543 Error_Msg_N ("named access type not allowed in pure unit", E);
3545 if Ada_Version >= Ada_05 then
3547 ("\would be legal if Storage_Size of 0 given?", E);
3549 elsif No_Pool_Assigned (E) then
3551 ("\would be legal in Ada 2005?", E);
3555 ("\would be legal in Ada 2005 if "
3556 & "Storage_Size of 0 given?", E);
3561 -- Case of composite types
3563 if Is_Composite_Type (E) then
3565 -- AI-117 requires that all new primitives of a tagged type must
3566 -- inherit the convention of the full view of the type. Inherited
3567 -- and overriding operations are defined to inherit the convention
3568 -- of their parent or overridden subprogram (also specified in
3569 -- AI-117), which will have occurred earlier (in Derive_Subprogram
3570 -- and New_Overloaded_Entity). Here we set the convention of
3571 -- primitives that are still convention Ada, which will ensure
3572 -- that any new primitives inherit the type's convention. Class-
3573 -- wide types can have a foreign convention inherited from their
3574 -- specific type, but are excluded from this since they don't have
3575 -- any associated primitives.
3577 if Is_Tagged_Type (E)
3578 and then not Is_Class_Wide_Type (E)
3579 and then Convention (E) /= Convention_Ada
3582 Prim_List : constant Elist_Id := Primitive_Operations (E);
3585 Prim := First_Elmt (Prim_List);
3586 while Present (Prim) loop
3587 if Convention (Node (Prim)) = Convention_Ada then
3588 Set_Convention (Node (Prim), Convention (E));
3597 -- Generate primitive operation references for a tagged type
3599 if Is_Tagged_Type (E)
3600 and then not Is_Class_Wide_Type (E)
3603 Prim_List : Elist_Id;
3611 if Ekind (E) = E_Protected_Subtype
3612 or else Ekind (E) = E_Task_Subtype
3619 -- Ada 2005 (AI-345): In case of concurrent type generate
3620 -- reference to the wrapper that allow us to dispatch calls
3621 -- through their implemented abstract interface types.
3623 -- The check for Present here is to protect against previously
3624 -- reported critical errors.
3626 if Is_Concurrent_Type (Aux_E)
3627 and then Present (Corresponding_Record_Type (Aux_E))
3629 Prim_List := Primitive_Operations
3630 (Corresponding_Record_Type (Aux_E));
3632 Prim_List := Primitive_Operations (Aux_E);
3635 -- Loop to generate references for primitive operations
3637 if Present (Prim_List) then
3638 Prim := First_Elmt (Prim_List);
3639 while Present (Prim) loop
3641 -- If the operation is derived, get the original for
3642 -- cross-reference purposes (it is the original for
3643 -- which we want the xref, and for which the comes
3644 -- from source test needs to be performed).
3647 while Present (Alias (Ent)) loop
3651 Generate_Reference (E, Ent, 'p', Set_Ref => False);
3658 -- Now that all types from which E may depend are frozen, see if the
3659 -- size is known at compile time, if it must be unsigned, or if
3660 -- strict alignment is required
3662 Check_Compile_Time_Size (E);
3663 Check_Unsigned_Type (E);
3665 if Base_Type (E) = E then
3666 Check_Strict_Alignment (E);
3669 -- Do not allow a size clause for a type which does not have a size
3670 -- that is known at compile time
3672 if Has_Size_Clause (E)
3673 and then not Size_Known_At_Compile_Time (E)
3675 -- Suppress this message if errors posted on E, even if we are
3676 -- in all errors mode, since this is often a junk message
3678 if not Error_Posted (E) then
3680 ("size clause not allowed for variable length type",
3685 -- Remaining process is to set/verify the representation information,
3686 -- in particular the size and alignment values. This processing is
3687 -- not required for generic types, since generic types do not play
3688 -- any part in code generation, and so the size and alignment values
3689 -- for such types are irrelevant.
3691 if Is_Generic_Type (E) then
3694 -- Otherwise we call the layout procedure
3700 -- End of freeze processing for type entities
3703 -- Here is where we logically freeze the current entity. If it has a
3704 -- freeze node, then this is the point at which the freeze node is
3705 -- linked into the result list.
3707 if Has_Delayed_Freeze (E) then
3709 -- If a freeze node is already allocated, use it, otherwise allocate
3710 -- a new one. The preallocation happens in the case of anonymous base
3711 -- types, where we preallocate so that we can set First_Subtype_Link.
3712 -- Note that we reset the Sloc to the current freeze location.
3714 if Present (Freeze_Node (E)) then
3715 F_Node := Freeze_Node (E);
3716 Set_Sloc (F_Node, Loc);
3719 F_Node := New_Node (N_Freeze_Entity, Loc);
3720 Set_Freeze_Node (E, F_Node);
3721 Set_Access_Types_To_Process (F_Node, No_Elist);
3722 Set_TSS_Elist (F_Node, No_Elist);
3723 Set_Actions (F_Node, No_List);
3726 Set_Entity (F_Node, E);
3728 if Result = No_List then
3729 Result := New_List (F_Node);
3731 Append (F_Node, Result);
3734 -- A final pass over record types with discriminants. If the type
3735 -- has an incomplete declaration, there may be constrained access
3736 -- subtypes declared elsewhere, which do not depend on the discrimi-
3737 -- nants of the type, and which are used as component types (i.e.
3738 -- the full view is a recursive type). The designated types of these
3739 -- subtypes can only be elaborated after the type itself, and they
3740 -- need an itype reference.
3742 if Ekind (E) = E_Record_Type
3743 and then Has_Discriminants (E)
3751 Comp := First_Component (E);
3753 while Present (Comp) loop
3754 Typ := Etype (Comp);
3756 if Ekind (Comp) = E_Component
3757 and then Is_Access_Type (Typ)
3758 and then Scope (Typ) /= E
3759 and then Base_Type (Designated_Type (Typ)) = E
3760 and then Is_Itype (Designated_Type (Typ))
3762 IR := Make_Itype_Reference (Sloc (Comp));
3763 Set_Itype (IR, Designated_Type (Typ));
3764 Append (IR, Result);
3767 Next_Component (Comp);
3773 -- When a type is frozen, the first subtype of the type is frozen as
3774 -- well (RM 13.14(15)). This has to be done after freezing the type,
3775 -- since obviously the first subtype depends on its own base type.
3778 Freeze_And_Append (First_Subtype (E), Loc, Result);
3780 -- If we just froze a tagged non-class wide record, then freeze the
3781 -- corresponding class-wide type. This must be done after the tagged
3782 -- type itself is frozen, because the class-wide type refers to the
3783 -- tagged type which generates the class.
3785 if Is_Tagged_Type (E)
3786 and then not Is_Class_Wide_Type (E)
3787 and then Present (Class_Wide_Type (E))
3789 Freeze_And_Append (Class_Wide_Type (E), Loc, Result);
3793 Check_Debug_Info_Needed (E);
3795 -- Special handling for subprograms
3797 if Is_Subprogram (E) then
3799 -- If subprogram has address clause then reset Is_Public flag, since
3800 -- we do not want the backend to generate external references.
3802 if Present (Address_Clause (E))
3803 and then not Is_Library_Level_Entity (E)
3805 Set_Is_Public (E, False);
3807 -- If no address clause and not intrinsic, then for imported
3808 -- subprogram in main unit, generate descriptor if we are in
3809 -- Propagate_Exceptions mode.
3811 elsif Propagate_Exceptions
3812 and then Is_Imported (E)
3813 and then not Is_Intrinsic_Subprogram (E)
3814 and then Convention (E) /= Convention_Stubbed
3816 if Result = No_List then
3817 Result := Empty_List;
3825 -----------------------------
3826 -- Freeze_Enumeration_Type --
3827 -----------------------------
3829 procedure Freeze_Enumeration_Type (Typ : Entity_Id) is
3831 -- By default, if no size clause is present, an enumeration type with
3832 -- Convention C is assumed to interface to a C enum, and has integer
3833 -- size. This applies to types. For subtypes, verify that its base
3834 -- type has no size clause either.
3836 if Has_Foreign_Convention (Typ)
3837 and then not Has_Size_Clause (Typ)
3838 and then not Has_Size_Clause (Base_Type (Typ))
3839 and then Esize (Typ) < Standard_Integer_Size
3841 Init_Esize (Typ, Standard_Integer_Size);
3844 -- If the enumeration type interfaces to C, and it has a size clause
3845 -- that specifies less than int size, it warrants a warning. The
3846 -- user may intend the C type to be an enum or a char, so this is
3847 -- not by itself an error that the Ada compiler can detect, but it
3848 -- it is a worth a heads-up. For Boolean and Character types we
3849 -- assume that the programmer has the proper C type in mind.
3851 if Convention (Typ) = Convention_C
3852 and then Has_Size_Clause (Typ)
3853 and then Esize (Typ) /= Esize (Standard_Integer)
3854 and then not Is_Boolean_Type (Typ)
3855 and then not Is_Character_Type (Typ)
3858 ("C enum types have the size of a C int?", Size_Clause (Typ));
3861 Adjust_Esize_For_Alignment (Typ);
3863 end Freeze_Enumeration_Type;
3865 -----------------------
3866 -- Freeze_Expression --
3867 -----------------------
3869 procedure Freeze_Expression (N : Node_Id) is
3870 In_Spec_Exp : constant Boolean := In_Spec_Expression;
3873 Desig_Typ : Entity_Id;
3877 Freeze_Outside : Boolean := False;
3878 -- This flag is set true if the entity must be frozen outside the
3879 -- current subprogram. This happens in the case of expander generated
3880 -- subprograms (_Init_Proc, _Input, _Output, _Read, _Write) which do
3881 -- not freeze all entities like other bodies, but which nevertheless
3882 -- may reference entities that have to be frozen before the body and
3883 -- obviously cannot be frozen inside the body.
3885 function In_Exp_Body (N : Node_Id) return Boolean;
3886 -- Given an N_Handled_Sequence_Of_Statements node N, determines whether
3887 -- it is the handled statement sequence of an expander-generated
3888 -- subprogram (init proc, stream subprogram, or renaming as body).
3889 -- If so, this is not a freezing context.
3895 function In_Exp_Body (N : Node_Id) return Boolean is
3900 if Nkind (N) = N_Subprogram_Body then
3906 if Nkind (P) /= N_Subprogram_Body then
3910 Id := Defining_Unit_Name (Specification (P));
3912 if Nkind (Id) = N_Defining_Identifier
3913 and then (Is_Init_Proc (Id) or else
3914 Is_TSS (Id, TSS_Stream_Input) or else
3915 Is_TSS (Id, TSS_Stream_Output) or else
3916 Is_TSS (Id, TSS_Stream_Read) or else
3917 Is_TSS (Id, TSS_Stream_Write) or else
3918 Nkind (Original_Node (P)) =
3919 N_Subprogram_Renaming_Declaration)
3928 -- Start of processing for Freeze_Expression
3931 -- Immediate return if freezing is inhibited. This flag is set by the
3932 -- analyzer to stop freezing on generated expressions that would cause
3933 -- freezing if they were in the source program, but which are not
3934 -- supposed to freeze, since they are created.
3936 if Must_Not_Freeze (N) then
3940 -- If expression is non-static, then it does not freeze in a default
3941 -- expression, see section "Handling of Default Expressions" in the
3942 -- spec of package Sem for further details. Note that we have to
3943 -- make sure that we actually have a real expression (if we have
3944 -- a subtype indication, we can't test Is_Static_Expression!)
3947 and then Nkind (N) in N_Subexpr
3948 and then not Is_Static_Expression (N)
3953 -- Freeze type of expression if not frozen already
3957 if Nkind (N) in N_Has_Etype then
3958 if not Is_Frozen (Etype (N)) then
3961 -- Base type may be an derived numeric type that is frozen at
3962 -- the point of declaration, but first_subtype is still unfrozen.
3964 elsif not Is_Frozen (First_Subtype (Etype (N))) then
3965 Typ := First_Subtype (Etype (N));
3969 -- For entity name, freeze entity if not frozen already. A special
3970 -- exception occurs for an identifier that did not come from source.
3971 -- We don't let such identifiers freeze a non-internal entity, i.e.
3972 -- an entity that did come from source, since such an identifier was
3973 -- generated by the expander, and cannot have any semantic effect on
3974 -- the freezing semantics. For example, this stops the parameter of
3975 -- an initialization procedure from freezing the variable.
3977 if Is_Entity_Name (N)
3978 and then not Is_Frozen (Entity (N))
3979 and then (Nkind (N) /= N_Identifier
3980 or else Comes_From_Source (N)
3981 or else not Comes_From_Source (Entity (N)))
3988 -- For an allocator freeze designated type if not frozen already
3990 -- For an aggregate whose component type is an access type, freeze the
3991 -- designated type now, so that its freeze does not appear within the
3992 -- loop that might be created in the expansion of the aggregate. If the
3993 -- designated type is a private type without full view, the expression
3994 -- cannot contain an allocator, so the type is not frozen.
4000 Desig_Typ := Designated_Type (Etype (N));
4003 if Is_Array_Type (Etype (N))
4004 and then Is_Access_Type (Component_Type (Etype (N)))
4006 Desig_Typ := Designated_Type (Component_Type (Etype (N)));
4009 when N_Selected_Component |
4010 N_Indexed_Component |
4013 if Is_Access_Type (Etype (Prefix (N))) then
4014 Desig_Typ := Designated_Type (Etype (Prefix (N)));
4021 if Desig_Typ /= Empty
4022 and then (Is_Frozen (Desig_Typ)
4023 or else (not Is_Fully_Defined (Desig_Typ)))
4028 -- All done if nothing needs freezing
4032 and then No (Desig_Typ)
4037 -- Loop for looking at the right place to insert the freeze nodes
4038 -- exiting from the loop when it is appropriate to insert the freeze
4039 -- node before the current node P.
4041 -- Also checks some special exceptions to the freezing rules. These
4042 -- cases result in a direct return, bypassing the freeze action.
4046 Parent_P := Parent (P);
4048 -- If we don't have a parent, then we are not in a well-formed tree.
4049 -- This is an unusual case, but there are some legitimate situations
4050 -- in which this occurs, notably when the expressions in the range of
4051 -- a type declaration are resolved. We simply ignore the freeze
4052 -- request in this case. Is this right ???
4054 if No (Parent_P) then
4058 -- See if we have got to an appropriate point in the tree
4060 case Nkind (Parent_P) is
4062 -- A special test for the exception of (RM 13.14(8)) for the case
4063 -- of per-object expressions (RM 3.8(18)) occurring in component
4064 -- definition or a discrete subtype definition. Note that we test
4065 -- for a component declaration which includes both cases we are
4066 -- interested in, and furthermore the tree does not have explicit
4067 -- nodes for either of these two constructs.
4069 when N_Component_Declaration =>
4071 -- The case we want to test for here is an identifier that is
4072 -- a per-object expression, this is either a discriminant that
4073 -- appears in a context other than the component declaration
4074 -- or it is a reference to the type of the enclosing construct.
4076 -- For either of these cases, we skip the freezing
4078 if not In_Spec_Expression
4079 and then Nkind (N) = N_Identifier
4080 and then (Present (Entity (N)))
4082 -- We recognize the discriminant case by just looking for
4083 -- a reference to a discriminant. It can only be one for
4084 -- the enclosing construct. Skip freezing in this case.
4086 if Ekind (Entity (N)) = E_Discriminant then
4089 -- For the case of a reference to the enclosing record,
4090 -- (or task or protected type), we look for a type that
4091 -- matches the current scope.
4093 elsif Entity (N) = Current_Scope then
4098 -- If we have an enumeration literal that appears as the choice in
4099 -- the aggregate of an enumeration representation clause, then
4100 -- freezing does not occur (RM 13.14(10)).
4102 when N_Enumeration_Representation_Clause =>
4104 -- The case we are looking for is an enumeration literal
4106 if (Nkind (N) = N_Identifier or Nkind (N) = N_Character_Literal)
4107 and then Is_Enumeration_Type (Etype (N))
4109 -- If enumeration literal appears directly as the choice,
4110 -- do not freeze (this is the normal non-overloaded case)
4112 if Nkind (Parent (N)) = N_Component_Association
4113 and then First (Choices (Parent (N))) = N
4117 -- If enumeration literal appears as the name of function
4118 -- which is the choice, then also do not freeze. This
4119 -- happens in the overloaded literal case, where the
4120 -- enumeration literal is temporarily changed to a function
4121 -- call for overloading analysis purposes.
4123 elsif Nkind (Parent (N)) = N_Function_Call
4125 Nkind (Parent (Parent (N))) = N_Component_Association
4127 First (Choices (Parent (Parent (N)))) = Parent (N)
4133 -- Normally if the parent is a handled sequence of statements,
4134 -- then the current node must be a statement, and that is an
4135 -- appropriate place to insert a freeze node.
4137 when N_Handled_Sequence_Of_Statements =>
4139 -- An exception occurs when the sequence of statements is for
4140 -- an expander generated body that did not do the usual freeze
4141 -- all operation. In this case we usually want to freeze
4142 -- outside this body, not inside it, and we skip past the
4143 -- subprogram body that we are inside.
4145 if In_Exp_Body (Parent_P) then
4147 -- However, we *do* want to freeze at this point if we have
4148 -- an entity to freeze, and that entity is declared *inside*
4149 -- the body of the expander generated procedure. This case
4150 -- is recognized by the scope of the type, which is either
4151 -- the spec for some enclosing body, or (in the case of
4152 -- init_procs, for which there are no separate specs) the
4156 Subp : constant Node_Id := Parent (Parent_P);
4160 if Nkind (Subp) = N_Subprogram_Body then
4161 Cspc := Corresponding_Spec (Subp);
4163 if (Present (Typ) and then Scope (Typ) = Cspc)
4165 (Present (Nam) and then Scope (Nam) = Cspc)
4170 and then Scope (Typ) = Current_Scope
4171 and then Current_Scope = Defining_Entity (Subp)
4178 -- If not that exception to the exception, then this is
4179 -- where we delay the freeze till outside the body.
4181 Parent_P := Parent (Parent_P);
4182 Freeze_Outside := True;
4184 -- Here if normal case where we are in handled statement
4185 -- sequence and want to do the insertion right there.
4191 -- If parent is a body or a spec or a block, then the current node
4192 -- is a statement or declaration and we can insert the freeze node
4195 when N_Package_Specification |
4201 N_Block_Statement => exit;
4203 -- The expander is allowed to define types in any statements list,
4204 -- so any of the following parent nodes also mark a freezing point
4205 -- if the actual node is in a list of statements or declarations.
4207 when N_Exception_Handler |
4210 N_Case_Statement_Alternative |
4211 N_Compilation_Unit_Aux |
4212 N_Selective_Accept |
4213 N_Accept_Alternative |
4214 N_Delay_Alternative |
4215 N_Conditional_Entry_Call |
4216 N_Entry_Call_Alternative |
4217 N_Triggering_Alternative |
4221 exit when Is_List_Member (P);
4223 -- Note: The N_Loop_Statement is a special case. A type that
4224 -- appears in the source can never be frozen in a loop (this
4225 -- occurs only because of a loop expanded by the expander), so we
4226 -- keep on going. Otherwise we terminate the search. Same is true
4227 -- of any entity which comes from source. (if they have predefined
4228 -- type, that type does not appear to come from source, but the
4229 -- entity should not be frozen here).
4231 when N_Loop_Statement =>
4232 exit when not Comes_From_Source (Etype (N))
4233 and then (No (Nam) or else not Comes_From_Source (Nam));
4235 -- For all other cases, keep looking at parents
4241 -- We fall through the case if we did not yet find the proper
4242 -- place in the free for inserting the freeze node, so climb!
4247 -- If the expression appears in a record or an initialization procedure,
4248 -- the freeze nodes are collected and attached to the current scope, to
4249 -- be inserted and analyzed on exit from the scope, to insure that
4250 -- generated entities appear in the correct scope. If the expression is
4251 -- a default for a discriminant specification, the scope is still void.
4252 -- The expression can also appear in the discriminant part of a private
4253 -- or concurrent type.
4255 -- If the expression appears in a constrained subcomponent of an
4256 -- enclosing record declaration, the freeze nodes must be attached to
4257 -- the outer record type so they can eventually be placed in the
4258 -- enclosing declaration list.
4260 -- The other case requiring this special handling is if we are in a
4261 -- default expression, since in that case we are about to freeze a
4262 -- static type, and the freeze scope needs to be the outer scope, not
4263 -- the scope of the subprogram with the default parameter.
4265 -- For default expressions and other spec expressions in generic units,
4266 -- the Move_Freeze_Nodes mechanism (see sem_ch12.adb) takes care of
4267 -- placing them at the proper place, after the generic unit.
4269 if (In_Spec_Exp and not Inside_A_Generic)
4270 or else Freeze_Outside
4271 or else (Is_Type (Current_Scope)
4272 and then (not Is_Concurrent_Type (Current_Scope)
4273 or else not Has_Completion (Current_Scope)))
4274 or else Ekind (Current_Scope) = E_Void
4277 Loc : constant Source_Ptr := Sloc (Current_Scope);
4278 Freeze_Nodes : List_Id := No_List;
4279 Pos : Int := Scope_Stack.Last;
4282 if Present (Desig_Typ) then
4283 Freeze_And_Append (Desig_Typ, Loc, Freeze_Nodes);
4286 if Present (Typ) then
4287 Freeze_And_Append (Typ, Loc, Freeze_Nodes);
4290 if Present (Nam) then
4291 Freeze_And_Append (Nam, Loc, Freeze_Nodes);
4294 -- The current scope may be that of a constrained component of
4295 -- an enclosing record declaration, which is above the current
4296 -- scope in the scope stack.
4298 if Is_Record_Type (Scope (Current_Scope)) then
4302 if Is_Non_Empty_List (Freeze_Nodes) then
4303 if No (Scope_Stack.Table (Pos).Pending_Freeze_Actions) then
4304 Scope_Stack.Table (Pos).Pending_Freeze_Actions :=
4307 Append_List (Freeze_Nodes, Scope_Stack.Table
4308 (Pos).Pending_Freeze_Actions);
4316 -- Now we have the right place to do the freezing. First, a special
4317 -- adjustment, if we are in spec-expression analysis mode, these freeze
4318 -- actions must not be thrown away (normally all inserted actions are
4319 -- thrown away in this mode. However, the freeze actions are from static
4320 -- expressions and one of the important reasons we are doing this
4321 -- special analysis is to get these freeze actions. Therefore we turn
4322 -- off the In_Spec_Expression mode to propagate these freeze actions.
4323 -- This also means they get properly analyzed and expanded.
4325 In_Spec_Expression := False;
4327 -- Freeze the designated type of an allocator (RM 13.14(13))
4329 if Present (Desig_Typ) then
4330 Freeze_Before (P, Desig_Typ);
4333 -- Freeze type of expression (RM 13.14(10)). Note that we took care of
4334 -- the enumeration representation clause exception in the loop above.
4336 if Present (Typ) then
4337 Freeze_Before (P, Typ);
4340 -- Freeze name if one is present (RM 13.14(11))
4342 if Present (Nam) then
4343 Freeze_Before (P, Nam);
4346 -- Restore In_Spec_Expression flag
4348 In_Spec_Expression := In_Spec_Exp;
4349 end Freeze_Expression;
4351 -----------------------------
4352 -- Freeze_Fixed_Point_Type --
4353 -----------------------------
4355 -- Certain fixed-point types and subtypes, including implicit base types
4356 -- and declared first subtypes, have not yet set up a range. This is
4357 -- because the range cannot be set until the Small and Size values are
4358 -- known, and these are not known till the type is frozen.
4360 -- To signal this case, Scalar_Range contains an unanalyzed syntactic range
4361 -- whose bounds are unanalyzed real literals. This routine will recognize
4362 -- this case, and transform this range node into a properly typed range
4363 -- with properly analyzed and resolved values.
4365 procedure Freeze_Fixed_Point_Type (Typ : Entity_Id) is
4366 Rng : constant Node_Id := Scalar_Range (Typ);
4367 Lo : constant Node_Id := Low_Bound (Rng);
4368 Hi : constant Node_Id := High_Bound (Rng);
4369 Btyp : constant Entity_Id := Base_Type (Typ);
4370 Brng : constant Node_Id := Scalar_Range (Btyp);
4371 BLo : constant Node_Id := Low_Bound (Brng);
4372 BHi : constant Node_Id := High_Bound (Brng);
4373 Small : constant Ureal := Small_Value (Typ);
4380 function Fsize (Lov, Hiv : Ureal) return Nat;
4381 -- Returns size of type with given bounds. Also leaves these
4382 -- bounds set as the current bounds of the Typ.
4388 function Fsize (Lov, Hiv : Ureal) return Nat is
4390 Set_Realval (Lo, Lov);
4391 Set_Realval (Hi, Hiv);
4392 return Minimum_Size (Typ);
4395 -- Start of processing for Freeze_Fixed_Point_Type
4398 -- If Esize of a subtype has not previously been set, set it now
4400 if Unknown_Esize (Typ) then
4401 Atype := Ancestor_Subtype (Typ);
4403 if Present (Atype) then
4404 Set_Esize (Typ, Esize (Atype));
4406 Set_Esize (Typ, Esize (Base_Type (Typ)));
4410 -- Immediate return if the range is already analyzed. This means that
4411 -- the range is already set, and does not need to be computed by this
4414 if Analyzed (Rng) then
4418 -- Immediate return if either of the bounds raises Constraint_Error
4420 if Raises_Constraint_Error (Lo)
4421 or else Raises_Constraint_Error (Hi)
4426 Loval := Realval (Lo);
4427 Hival := Realval (Hi);
4429 -- Ordinary fixed-point case
4431 if Is_Ordinary_Fixed_Point_Type (Typ) then
4433 -- For the ordinary fixed-point case, we are allowed to fudge the
4434 -- end-points up or down by small. Generally we prefer to fudge up,
4435 -- i.e. widen the bounds for non-model numbers so that the end points
4436 -- are included. However there are cases in which this cannot be
4437 -- done, and indeed cases in which we may need to narrow the bounds.
4438 -- The following circuit makes the decision.
4440 -- Note: our terminology here is that Incl_EP means that the bounds
4441 -- are widened by Small if necessary to include the end points, and
4442 -- Excl_EP means that the bounds are narrowed by Small to exclude the
4443 -- end-points if this reduces the size.
4445 -- Note that in the Incl case, all we care about is including the
4446 -- end-points. In the Excl case, we want to narrow the bounds as
4447 -- much as permitted by the RM, to give the smallest possible size.
4450 Loval_Incl_EP : Ureal;
4451 Hival_Incl_EP : Ureal;
4453 Loval_Excl_EP : Ureal;
4454 Hival_Excl_EP : Ureal;
4460 First_Subt : Entity_Id;
4465 -- First step. Base types are required to be symmetrical. Right
4466 -- now, the base type range is a copy of the first subtype range.
4467 -- This will be corrected before we are done, but right away we
4468 -- need to deal with the case where both bounds are non-negative.
4469 -- In this case, we set the low bound to the negative of the high
4470 -- bound, to make sure that the size is computed to include the
4471 -- required sign. Note that we do not need to worry about the
4472 -- case of both bounds negative, because the sign will be dealt
4473 -- with anyway. Furthermore we can't just go making such a bound
4474 -- symmetrical, since in a twos-complement system, there is an
4475 -- extra negative value which could not be accommodated on the
4479 and then not UR_Is_Negative (Loval)
4480 and then Hival > Loval
4483 Set_Realval (Lo, Loval);
4486 -- Compute the fudged bounds. If the number is a model number,
4487 -- then we do nothing to include it, but we are allowed to backoff
4488 -- to the next adjacent model number when we exclude it. If it is
4489 -- not a model number then we straddle the two values with the
4490 -- model numbers on either side.
4492 Model_Num := UR_Trunc (Loval / Small) * Small;
4494 if Loval = Model_Num then
4495 Loval_Incl_EP := Model_Num;
4497 Loval_Incl_EP := Model_Num - Small;
4500 -- The low value excluding the end point is Small greater, but
4501 -- we do not do this exclusion if the low value is positive,
4502 -- since it can't help the size and could actually hurt by
4503 -- crossing the high bound.
4505 if UR_Is_Negative (Loval_Incl_EP) then
4506 Loval_Excl_EP := Loval_Incl_EP + Small;
4508 -- If the value went from negative to zero, then we have the
4509 -- case where Loval_Incl_EP is the model number just below
4510 -- zero, so we want to stick to the negative value for the
4511 -- base type to maintain the condition that the size will
4512 -- include signed values.
4515 and then UR_Is_Zero (Loval_Excl_EP)
4517 Loval_Excl_EP := Loval_Incl_EP;
4521 Loval_Excl_EP := Loval_Incl_EP;
4524 -- Similar processing for upper bound and high value
4526 Model_Num := UR_Trunc (Hival / Small) * Small;
4528 if Hival = Model_Num then
4529 Hival_Incl_EP := Model_Num;
4531 Hival_Incl_EP := Model_Num + Small;
4534 if UR_Is_Positive (Hival_Incl_EP) then
4535 Hival_Excl_EP := Hival_Incl_EP - Small;
4537 Hival_Excl_EP := Hival_Incl_EP;
4540 -- One further adjustment is needed. In the case of subtypes, we
4541 -- cannot go outside the range of the base type, or we get
4542 -- peculiarities, and the base type range is already set. This
4543 -- only applies to the Incl values, since clearly the Excl values
4544 -- are already as restricted as they are allowed to be.
4547 Loval_Incl_EP := UR_Max (Loval_Incl_EP, Realval (BLo));
4548 Hival_Incl_EP := UR_Min (Hival_Incl_EP, Realval (BHi));
4551 -- Get size including and excluding end points
4553 Size_Incl_EP := Fsize (Loval_Incl_EP, Hival_Incl_EP);
4554 Size_Excl_EP := Fsize (Loval_Excl_EP, Hival_Excl_EP);
4556 -- No need to exclude end-points if it does not reduce size
4558 if Fsize (Loval_Incl_EP, Hival_Excl_EP) = Size_Excl_EP then
4559 Loval_Excl_EP := Loval_Incl_EP;
4562 if Fsize (Loval_Excl_EP, Hival_Incl_EP) = Size_Excl_EP then
4563 Hival_Excl_EP := Hival_Incl_EP;
4566 -- Now we set the actual size to be used. We want to use the
4567 -- bounds fudged up to include the end-points but only if this
4568 -- can be done without violating a specifically given size
4569 -- size clause or causing an unacceptable increase in size.
4571 -- Case of size clause given
4573 if Has_Size_Clause (Typ) then
4575 -- Use the inclusive size only if it is consistent with
4576 -- the explicitly specified size.
4578 if Size_Incl_EP <= RM_Size (Typ) then
4579 Actual_Lo := Loval_Incl_EP;
4580 Actual_Hi := Hival_Incl_EP;
4581 Actual_Size := Size_Incl_EP;
4583 -- If the inclusive size is too large, we try excluding
4584 -- the end-points (will be caught later if does not work).
4587 Actual_Lo := Loval_Excl_EP;
4588 Actual_Hi := Hival_Excl_EP;
4589 Actual_Size := Size_Excl_EP;
4592 -- Case of size clause not given
4595 -- If we have a base type whose corresponding first subtype
4596 -- has an explicit size that is large enough to include our
4597 -- end-points, then do so. There is no point in working hard
4598 -- to get a base type whose size is smaller than the specified
4599 -- size of the first subtype.
4601 First_Subt := First_Subtype (Typ);
4603 if Has_Size_Clause (First_Subt)
4604 and then Size_Incl_EP <= Esize (First_Subt)
4606 Actual_Size := Size_Incl_EP;
4607 Actual_Lo := Loval_Incl_EP;
4608 Actual_Hi := Hival_Incl_EP;
4610 -- If excluding the end-points makes the size smaller and
4611 -- results in a size of 8,16,32,64, then we take the smaller
4612 -- size. For the 64 case, this is compulsory. For the other
4613 -- cases, it seems reasonable. We like to include end points
4614 -- if we can, but not at the expense of moving to the next
4615 -- natural boundary of size.
4617 elsif Size_Incl_EP /= Size_Excl_EP
4619 (Size_Excl_EP = 8 or else
4620 Size_Excl_EP = 16 or else
4621 Size_Excl_EP = 32 or else
4624 Actual_Size := Size_Excl_EP;
4625 Actual_Lo := Loval_Excl_EP;
4626 Actual_Hi := Hival_Excl_EP;
4628 -- Otherwise we can definitely include the end points
4631 Actual_Size := Size_Incl_EP;
4632 Actual_Lo := Loval_Incl_EP;
4633 Actual_Hi := Hival_Incl_EP;
4636 -- One pathological case: normally we never fudge a low bound
4637 -- down, since it would seem to increase the size (if it has
4638 -- any effect), but for ranges containing single value, or no
4639 -- values, the high bound can be small too large. Consider:
4641 -- type t is delta 2.0**(-14)
4642 -- range 131072.0 .. 0;
4644 -- That lower bound is *just* outside the range of 32 bits, and
4645 -- does need fudging down in this case. Note that the bounds
4646 -- will always have crossed here, since the high bound will be
4647 -- fudged down if necessary, as in the case of:
4649 -- type t is delta 2.0**(-14)
4650 -- range 131072.0 .. 131072.0;
4652 -- So we detect the situation by looking for crossed bounds,
4653 -- and if the bounds are crossed, and the low bound is greater
4654 -- than zero, we will always back it off by small, since this
4655 -- is completely harmless.
4657 if Actual_Lo > Actual_Hi then
4658 if UR_Is_Positive (Actual_Lo) then
4659 Actual_Lo := Loval_Incl_EP - Small;
4660 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4662 -- And of course, we need to do exactly the same parallel
4663 -- fudge for flat ranges in the negative region.
4665 elsif UR_Is_Negative (Actual_Hi) then
4666 Actual_Hi := Hival_Incl_EP + Small;
4667 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4672 Set_Realval (Lo, Actual_Lo);
4673 Set_Realval (Hi, Actual_Hi);
4676 -- For the decimal case, none of this fudging is required, since there
4677 -- are no end-point problems in the decimal case (the end-points are
4678 -- always included).
4681 Actual_Size := Fsize (Loval, Hival);
4684 -- At this stage, the actual size has been calculated and the proper
4685 -- required bounds are stored in the low and high bounds.
4687 if Actual_Size > 64 then
4688 Error_Msg_Uint_1 := UI_From_Int (Actual_Size);
4690 ("size required (^) for type& too large, maximum allowed is 64",
4695 -- Check size against explicit given size
4697 if Has_Size_Clause (Typ) then
4698 if Actual_Size > RM_Size (Typ) then
4699 Error_Msg_Uint_1 := RM_Size (Typ);
4700 Error_Msg_Uint_2 := UI_From_Int (Actual_Size);
4702 ("size given (^) for type& too small, minimum allowed is ^",
4703 Size_Clause (Typ), Typ);
4706 Actual_Size := UI_To_Int (Esize (Typ));
4709 -- Increase size to next natural boundary if no size clause given
4712 if Actual_Size <= 8 then
4714 elsif Actual_Size <= 16 then
4716 elsif Actual_Size <= 32 then
4722 Init_Esize (Typ, Actual_Size);
4723 Adjust_Esize_For_Alignment (Typ);
4726 -- If we have a base type, then expand the bounds so that they extend to
4727 -- the full width of the allocated size in bits, to avoid junk range
4728 -- checks on intermediate computations.
4730 if Base_Type (Typ) = Typ then
4731 Set_Realval (Lo, -(Small * (Uint_2 ** (Actual_Size - 1))));
4732 Set_Realval (Hi, (Small * (Uint_2 ** (Actual_Size - 1) - 1)));
4735 -- Final step is to reanalyze the bounds using the proper type
4736 -- and set the Corresponding_Integer_Value fields of the literals.
4738 Set_Etype (Lo, Empty);
4739 Set_Analyzed (Lo, False);
4742 -- Resolve with universal fixed if the base type, and the base type if
4743 -- it is a subtype. Note we can't resolve the base type with itself,
4744 -- that would be a reference before definition.
4747 Resolve (Lo, Universal_Fixed);
4752 -- Set corresponding integer value for bound
4754 Set_Corresponding_Integer_Value
4755 (Lo, UR_To_Uint (Realval (Lo) / Small));
4757 -- Similar processing for high bound
4759 Set_Etype (Hi, Empty);
4760 Set_Analyzed (Hi, False);
4764 Resolve (Hi, Universal_Fixed);
4769 Set_Corresponding_Integer_Value
4770 (Hi, UR_To_Uint (Realval (Hi) / Small));
4772 -- Set type of range to correspond to bounds
4774 Set_Etype (Rng, Etype (Lo));
4776 -- Set Esize to calculated size if not set already
4778 if Unknown_Esize (Typ) then
4779 Init_Esize (Typ, Actual_Size);
4782 -- Set RM_Size if not already set. If already set, check value
4785 Minsiz : constant Uint := UI_From_Int (Minimum_Size (Typ));
4788 if RM_Size (Typ) /= Uint_0 then
4789 if RM_Size (Typ) < Minsiz then
4790 Error_Msg_Uint_1 := RM_Size (Typ);
4791 Error_Msg_Uint_2 := Minsiz;
4793 ("size given (^) for type& too small, minimum allowed is ^",
4794 Size_Clause (Typ), Typ);
4798 Set_RM_Size (Typ, Minsiz);
4801 end Freeze_Fixed_Point_Type;
4807 procedure Freeze_Itype (T : Entity_Id; N : Node_Id) is
4811 Set_Has_Delayed_Freeze (T);
4812 L := Freeze_Entity (T, Sloc (N));
4814 if Is_Non_Empty_List (L) then
4815 Insert_Actions (N, L);
4819 --------------------------
4820 -- Freeze_Static_Object --
4821 --------------------------
4823 procedure Freeze_Static_Object (E : Entity_Id) is
4825 Cannot_Be_Static : exception;
4826 -- Exception raised if the type of a static object cannot be made
4827 -- static. This happens if the type depends on non-global objects.
4829 procedure Ensure_Expression_Is_SA (N : Node_Id);
4830 -- Called to ensure that an expression used as part of a type definition
4831 -- is statically allocatable, which means that the expression type is
4832 -- statically allocatable, and the expression is either static, or a
4833 -- reference to a library level constant.
4835 procedure Ensure_Type_Is_SA (Typ : Entity_Id);
4836 -- Called to mark a type as static, checking that it is possible
4837 -- to set the type as static. If it is not possible, then the
4838 -- exception Cannot_Be_Static is raised.
4840 -----------------------------
4841 -- Ensure_Expression_Is_SA --
4842 -----------------------------
4844 procedure Ensure_Expression_Is_SA (N : Node_Id) is
4848 Ensure_Type_Is_SA (Etype (N));
4850 if Is_Static_Expression (N) then
4853 elsif Nkind (N) = N_Identifier then
4857 and then Ekind (Ent) = E_Constant
4858 and then Is_Library_Level_Entity (Ent)
4864 raise Cannot_Be_Static;
4865 end Ensure_Expression_Is_SA;
4867 -----------------------
4868 -- Ensure_Type_Is_SA --
4869 -----------------------
4871 procedure Ensure_Type_Is_SA (Typ : Entity_Id) is
4876 -- If type is library level, we are all set
4878 if Is_Library_Level_Entity (Typ) then
4882 -- We are also OK if the type already marked as statically allocated,
4883 -- which means we processed it before.
4885 if Is_Statically_Allocated (Typ) then
4889 -- Mark type as statically allocated
4891 Set_Is_Statically_Allocated (Typ);
4893 -- Check that it is safe to statically allocate this type
4895 if Is_Scalar_Type (Typ) or else Is_Real_Type (Typ) then
4896 Ensure_Expression_Is_SA (Type_Low_Bound (Typ));
4897 Ensure_Expression_Is_SA (Type_High_Bound (Typ));
4899 elsif Is_Array_Type (Typ) then
4900 N := First_Index (Typ);
4901 while Present (N) loop
4902 Ensure_Type_Is_SA (Etype (N));
4906 Ensure_Type_Is_SA (Component_Type (Typ));
4908 elsif Is_Access_Type (Typ) then
4909 if Ekind (Designated_Type (Typ)) = E_Subprogram_Type then
4913 T : constant Entity_Id := Etype (Designated_Type (Typ));
4916 if T /= Standard_Void_Type then
4917 Ensure_Type_Is_SA (T);
4920 F := First_Formal (Designated_Type (Typ));
4922 while Present (F) loop
4923 Ensure_Type_Is_SA (Etype (F));
4929 Ensure_Type_Is_SA (Designated_Type (Typ));
4932 elsif Is_Record_Type (Typ) then
4933 C := First_Entity (Typ);
4934 while Present (C) loop
4935 if Ekind (C) = E_Discriminant
4936 or else Ekind (C) = E_Component
4938 Ensure_Type_Is_SA (Etype (C));
4940 elsif Is_Type (C) then
4941 Ensure_Type_Is_SA (C);
4947 elsif Ekind (Typ) = E_Subprogram_Type then
4948 Ensure_Type_Is_SA (Etype (Typ));
4950 C := First_Formal (Typ);
4951 while Present (C) loop
4952 Ensure_Type_Is_SA (Etype (C));
4957 raise Cannot_Be_Static;
4959 end Ensure_Type_Is_SA;
4961 -- Start of processing for Freeze_Static_Object
4964 Ensure_Type_Is_SA (Etype (E));
4967 when Cannot_Be_Static =>
4969 -- If the object that cannot be static is imported or exported,
4970 -- then we give an error message saying that this object cannot
4971 -- be imported or exported.
4973 if Is_Imported (E) then
4975 ("& cannot be imported (local type is not constant)", E);
4977 -- Otherwise must be exported, something is wrong if compiler
4978 -- is marking something as statically allocated which cannot be).
4980 else pragma Assert (Is_Exported (E));
4982 ("& cannot be exported (local type is not constant)", E);
4984 end Freeze_Static_Object;
4986 -----------------------
4987 -- Freeze_Subprogram --
4988 -----------------------
4990 procedure Freeze_Subprogram (E : Entity_Id) is
4995 -- Subprogram may not have an address clause unless it is imported
4997 if Present (Address_Clause (E)) then
4998 if not Is_Imported (E) then
5000 ("address clause can only be given " &
5001 "for imported subprogram",
5002 Name (Address_Clause (E)));
5006 -- Reset the Pure indication on an imported subprogram unless an
5007 -- explicit Pure_Function pragma was present. We do this because
5008 -- otherwise it is an insidious error to call a non-pure function from
5009 -- pure unit and have calls mysteriously optimized away. What happens
5010 -- here is that the Import can bypass the normal check to ensure that
5011 -- pure units call only pure subprograms.
5014 and then Is_Pure (E)
5015 and then not Has_Pragma_Pure_Function (E)
5017 Set_Is_Pure (E, False);
5020 -- For non-foreign convention subprograms, this is where we create
5021 -- the extra formals (for accessibility level and constrained bit
5022 -- information). We delay this till the freeze point precisely so
5023 -- that we know the convention!
5025 if not Has_Foreign_Convention (E) then
5026 Create_Extra_Formals (E);
5029 -- If this is convention Ada and a Valued_Procedure, that's odd
5031 if Ekind (E) = E_Procedure
5032 and then Is_Valued_Procedure (E)
5033 and then Convention (E) = Convention_Ada
5034 and then Warn_On_Export_Import
5037 ("?Valued_Procedure has no effect for convention Ada", E);
5038 Set_Is_Valued_Procedure (E, False);
5041 -- Case of foreign convention
5046 -- For foreign conventions, warn about return of an
5047 -- unconstrained array.
5049 -- Note: we *do* allow a return by descriptor for the VMS case,
5050 -- though here there is probably more to be done ???
5052 if Ekind (E) = E_Function then
5053 Retype := Underlying_Type (Etype (E));
5055 -- If no return type, probably some other error, e.g. a
5056 -- missing full declaration, so ignore.
5061 -- If the return type is generic, we have emitted a warning
5062 -- earlier on, and there is nothing else to check here. Specific
5063 -- instantiations may lead to erroneous behavior.
5065 elsif Is_Generic_Type (Etype (E)) then
5068 elsif Is_Array_Type (Retype)
5069 and then not Is_Constrained (Retype)
5070 and then Mechanism (E) not in Descriptor_Codes
5071 and then Warn_On_Export_Import
5074 ("?foreign convention function& should not return " &
5075 "unconstrained array", E);
5080 -- If any of the formals for an exported foreign convention
5081 -- subprogram have defaults, then emit an appropriate warning since
5082 -- this is odd (default cannot be used from non-Ada code)
5084 if Is_Exported (E) then
5085 F := First_Formal (E);
5086 while Present (F) loop
5087 if Warn_On_Export_Import
5088 and then Present (Default_Value (F))
5091 ("?parameter cannot be defaulted in non-Ada call",
5100 -- For VMS, descriptor mechanisms for parameters are allowed only
5101 -- for imported/exported subprograms. Moreover, the NCA descriptor
5102 -- is not allowed for parameters of exported subprograms.
5104 if OpenVMS_On_Target then
5105 if Is_Exported (E) then
5106 F := First_Formal (E);
5107 while Present (F) loop
5108 if Mechanism (F) = By_Descriptor_NCA then
5110 ("'N'C'A' descriptor for parameter not permitted", F);
5112 ("\can only be used for imported subprogram", F);
5118 elsif not Is_Imported (E) then
5119 F := First_Formal (E);
5120 while Present (F) loop
5121 if Mechanism (F) in Descriptor_Codes then
5123 ("descriptor mechanism for parameter not permitted", F);
5125 ("\can only be used for imported/exported subprogram", F);
5133 -- Pragma Inline_Always is disallowed for dispatching subprograms
5134 -- because the address of such subprograms is saved in the dispatch
5135 -- table to support dispatching calls, and dispatching calls cannot
5136 -- be inlined. This is consistent with the restriction against using
5137 -- 'Access or 'Address on an Inline_Always subprogram.
5139 if Is_Dispatching_Operation (E)
5140 and then Has_Pragma_Inline_Always (E)
5143 ("pragma Inline_Always not allowed for dispatching subprograms", E);
5146 -- Because of the implicit representation of inherited predefined
5147 -- operators in the front-end, the overriding status of the operation
5148 -- may be affected when a full view of a type is analyzed, and this is
5149 -- not captured by the analysis of the corresponding type declaration.
5150 -- Therefore the correctness of a not-overriding indicator must be
5151 -- rechecked when the subprogram is frozen.
5153 if Nkind (E) = N_Defining_Operator_Symbol
5154 and then not Error_Posted (Parent (E))
5156 Check_Overriding_Indicator (E, Empty, Is_Primitive (E));
5158 end Freeze_Subprogram;
5160 ----------------------
5161 -- Is_Fully_Defined --
5162 ----------------------
5164 function Is_Fully_Defined (T : Entity_Id) return Boolean is
5166 if Ekind (T) = E_Class_Wide_Type then
5167 return Is_Fully_Defined (Etype (T));
5169 elsif Is_Array_Type (T) then
5170 return Is_Fully_Defined (Component_Type (T));
5172 elsif Is_Record_Type (T)
5173 and not Is_Private_Type (T)
5175 -- Verify that the record type has no components with private types
5176 -- without completion.
5182 Comp := First_Component (T);
5184 while Present (Comp) loop
5185 if not Is_Fully_Defined (Etype (Comp)) then
5189 Next_Component (Comp);
5195 return not Is_Private_Type (T)
5196 or else Present (Full_View (Base_Type (T)));
5198 end Is_Fully_Defined;
5200 ---------------------------------
5201 -- Process_Default_Expressions --
5202 ---------------------------------
5204 procedure Process_Default_Expressions
5206 After : in out Node_Id)
5208 Loc : constant Source_Ptr := Sloc (E);
5215 Set_Default_Expressions_Processed (E);
5217 -- A subprogram instance and its associated anonymous subprogram share
5218 -- their signature. The default expression functions are defined in the
5219 -- wrapper packages for the anonymous subprogram, and should not be
5220 -- generated again for the instance.
5222 if Is_Generic_Instance (E)
5223 and then Present (Alias (E))
5224 and then Default_Expressions_Processed (Alias (E))
5229 Formal := First_Formal (E);
5230 while Present (Formal) loop
5231 if Present (Default_Value (Formal)) then
5233 -- We work with a copy of the default expression because we
5234 -- do not want to disturb the original, since this would mess
5235 -- up the conformance checking.
5237 Dcopy := New_Copy_Tree (Default_Value (Formal));
5239 -- The analysis of the expression may generate insert actions,
5240 -- which of course must not be executed. We wrap those actions
5241 -- in a procedure that is not called, and later on eliminated.
5242 -- The following cases have no side-effects, and are analyzed
5245 if Nkind (Dcopy) = N_Identifier
5246 or else Nkind (Dcopy) = N_Expanded_Name
5247 or else Nkind (Dcopy) = N_Integer_Literal
5248 or else (Nkind (Dcopy) = N_Real_Literal
5249 and then not Vax_Float (Etype (Dcopy)))
5250 or else Nkind (Dcopy) = N_Character_Literal
5251 or else Nkind (Dcopy) = N_String_Literal
5252 or else Known_Null (Dcopy)
5253 or else (Nkind (Dcopy) = N_Attribute_Reference
5255 Attribute_Name (Dcopy) = Name_Null_Parameter)
5258 -- If there is no default function, we must still do a full
5259 -- analyze call on the default value, to ensure that all error
5260 -- checks are performed, e.g. those associated with static
5261 -- evaluation. Note: this branch will always be taken if the
5262 -- analyzer is turned off (but we still need the error checks).
5264 -- Note: the setting of parent here is to meet the requirement
5265 -- that we can only analyze the expression while attached to
5266 -- the tree. Really the requirement is that the parent chain
5267 -- be set, we don't actually need to be in the tree.
5269 Set_Parent (Dcopy, Declaration_Node (Formal));
5272 -- Default expressions are resolved with their own type if the
5273 -- context is generic, to avoid anomalies with private types.
5275 if Ekind (Scope (E)) = E_Generic_Package then
5278 Resolve (Dcopy, Etype (Formal));
5281 -- If that resolved expression will raise constraint error,
5282 -- then flag the default value as raising constraint error.
5283 -- This allows a proper error message on the calls.
5285 if Raises_Constraint_Error (Dcopy) then
5286 Set_Raises_Constraint_Error (Default_Value (Formal));
5289 -- If the default is a parameterless call, we use the name of
5290 -- the called function directly, and there is no body to build.
5292 elsif Nkind (Dcopy) = N_Function_Call
5293 and then No (Parameter_Associations (Dcopy))
5297 -- Else construct and analyze the body of a wrapper procedure
5298 -- that contains an object declaration to hold the expression.
5299 -- Given that this is done only to complete the analysis, it
5300 -- simpler to build a procedure than a function which might
5301 -- involve secondary stack expansion.
5305 Make_Defining_Identifier (Loc, New_Internal_Name ('D'));
5308 Make_Subprogram_Body (Loc,
5310 Make_Procedure_Specification (Loc,
5311 Defining_Unit_Name => Dnam),
5313 Declarations => New_List (
5314 Make_Object_Declaration (Loc,
5315 Defining_Identifier =>
5316 Make_Defining_Identifier (Loc,
5317 New_Internal_Name ('T')),
5318 Object_Definition =>
5319 New_Occurrence_Of (Etype (Formal), Loc),
5320 Expression => New_Copy_Tree (Dcopy))),
5322 Handled_Statement_Sequence =>
5323 Make_Handled_Sequence_Of_Statements (Loc,
5324 Statements => New_List));
5326 Set_Scope (Dnam, Scope (E));
5327 Set_Assignment_OK (First (Declarations (Dbody)));
5328 Set_Is_Eliminated (Dnam);
5329 Insert_After (After, Dbody);
5335 Next_Formal (Formal);
5337 end Process_Default_Expressions;
5339 ----------------------------------------
5340 -- Set_Component_Alignment_If_Not_Set --
5341 ----------------------------------------
5343 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id) is
5345 -- Ignore if not base type, subtypes don't need anything
5347 if Typ /= Base_Type (Typ) then
5351 -- Do not override existing representation
5353 if Is_Packed (Typ) then
5356 elsif Has_Specified_Layout (Typ) then
5359 elsif Component_Alignment (Typ) /= Calign_Default then
5363 Set_Component_Alignment
5364 (Typ, Scope_Stack.Table
5365 (Scope_Stack.Last).Component_Alignment_Default);
5367 end Set_Component_Alignment_If_Not_Set;
5373 procedure Undelay_Type (T : Entity_Id) is
5375 Set_Has_Delayed_Freeze (T, False);
5376 Set_Freeze_Node (T, Empty);
5378 -- Since we don't want T to have a Freeze_Node, we don't want its
5379 -- Full_View or Corresponding_Record_Type to have one either.
5381 -- ??? Fundamentally, this whole handling is a kludge. What we really
5382 -- want is to be sure that for an Itype that's part of record R and is a
5383 -- subtype of type T, that it's frozen after the later of the freeze
5384 -- points of R and T. We have no way of doing that directly, so what we
5385 -- do is force most such Itypes to be frozen as part of freezing R via
5386 -- this procedure and only delay the ones that need to be delayed
5387 -- (mostly the designated types of access types that are defined as part
5390 if Is_Private_Type (T)
5391 and then Present (Full_View (T))
5392 and then Is_Itype (Full_View (T))
5393 and then Is_Record_Type (Scope (Full_View (T)))
5395 Undelay_Type (Full_View (T));
5398 if Is_Concurrent_Type (T)
5399 and then Present (Corresponding_Record_Type (T))
5400 and then Is_Itype (Corresponding_Record_Type (T))
5401 and then Is_Record_Type (Scope (Corresponding_Record_Type (T)))
5403 Undelay_Type (Corresponding_Record_Type (T));
5411 procedure Warn_Overlay
5416 Ent : constant Entity_Id := Entity (Nam);
5417 -- The object to which the address clause applies
5420 Old : Entity_Id := Empty;
5424 -- No warning if address clause overlay warnings are off
5426 if not Address_Clause_Overlay_Warnings then
5430 -- No warning if there is an explicit initialization
5432 Init := Original_Node (Expression (Declaration_Node (Ent)));
5434 if Present (Init) and then Comes_From_Source (Init) then
5438 -- We only give the warning for non-imported entities of a type for
5439 -- which a non-null base init proc is defined (or for access types which
5440 -- have implicit null initialization).
5443 and then (Has_Non_Null_Base_Init_Proc (Typ)
5444 or else Is_Access_Type (Typ))
5445 and then not Is_Imported (Ent)
5447 if Nkind (Expr) = N_Attribute_Reference
5448 and then Is_Entity_Name (Prefix (Expr))
5450 Old := Entity (Prefix (Expr));
5452 elsif Is_Entity_Name (Expr)
5453 and then Ekind (Entity (Expr)) = E_Constant
5455 Decl := Declaration_Node (Entity (Expr));
5457 if Nkind (Decl) = N_Object_Declaration
5458 and then Present (Expression (Decl))
5459 and then Nkind (Expression (Decl)) = N_Attribute_Reference
5460 and then Is_Entity_Name (Prefix (Expression (Decl)))
5462 Old := Entity (Prefix (Expression (Decl)));
5464 elsif Nkind (Expr) = N_Function_Call then
5468 -- A function call (most likely to To_Address) is probably not an
5469 -- overlay, so skip warning. Ditto if the function call was inlined
5470 -- and transformed into an entity.
5472 elsif Nkind (Original_Node (Expr)) = N_Function_Call then
5476 Decl := Next (Parent (Expr));
5478 -- If a pragma Import follows, we assume that it is for the current
5479 -- target of the address clause, and skip the warning.
5482 and then Nkind (Decl) = N_Pragma
5483 and then Pragma_Name (Decl) = Name_Import
5488 if Present (Old) then
5489 Error_Msg_Node_2 := Old;
5491 ("default initialization of & may modify &?",
5495 ("default initialization of & may modify overlaid storage?",
5499 -- Add friendly warning if initialization comes from a packed array
5502 if Is_Record_Type (Typ) then
5507 Comp := First_Component (Typ);
5509 while Present (Comp) loop
5510 if Nkind (Parent (Comp)) = N_Component_Declaration
5511 and then Present (Expression (Parent (Comp)))
5514 elsif Is_Array_Type (Etype (Comp))
5515 and then Present (Packed_Array_Type (Etype (Comp)))
5518 ("\packed array component& " &
5519 "will be initialized to zero?",
5523 Next_Component (Comp);
5530 ("\use pragma Import for & to " &
5531 "suppress initialization (RM B.1(24))?",
OSDN Git Service
