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 ajust 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 elsif Is_Scalar_Type (T)
621 or else Is_Task_Type (T)
623 return not Is_Generic_Type (T);
625 elsif Is_Array_Type (T) then
626 if Ekind (T) = E_String_Literal_Subtype then
627 Set_Small_Size (T, Component_Size (T)
628 * String_Literal_Length (T));
631 elsif not Is_Constrained (T) then
634 -- Don't do any recursion on type with error posted, since we may
635 -- have a malformed type that leads us into a loop.
637 elsif Error_Posted (T) then
640 elsif not Size_Known (Component_Type (T)) then
644 -- Check for all indexes static, and also compute possible size
645 -- (in case it is less than 32 and may be packable).
648 Esiz : Uint := Component_Size (T);
652 Index := First_Index (T);
653 while Present (Index) loop
654 if Nkind (Index) = N_Range then
655 Get_Index_Bounds (Index, Low, High);
657 elsif Error_Posted (Scalar_Range (Etype (Index))) then
661 Low := Type_Low_Bound (Etype (Index));
662 High := Type_High_Bound (Etype (Index));
665 if not Compile_Time_Known_Value (Low)
666 or else not Compile_Time_Known_Value (High)
667 or else Etype (Index) = Any_Type
672 Dim := Expr_Value (High) - Expr_Value (Low) + 1;
684 Set_Small_Size (T, Esiz);
688 elsif Is_Access_Type (T) then
691 elsif Is_Private_Type (T)
692 and then not Is_Generic_Type (T)
693 and then Present (Underlying_Type (T))
695 -- Don't do any recursion on type with error posted, since we may
696 -- have a malformed type that leads us into a loop.
698 if Error_Posted (T) then
701 return Size_Known (Underlying_Type (T));
704 elsif Is_Record_Type (T) then
706 -- A class-wide type is never considered to have a known size
708 if Is_Class_Wide_Type (T) then
711 -- A subtype of a variant record must not have non-static
712 -- discriminanted components.
714 elsif T /= Base_Type (T)
715 and then not Static_Discriminated_Components (T)
719 -- Don't do any recursion on type with error posted, since we may
720 -- have a malformed type that leads us into a loop.
722 elsif Error_Posted (T) then
726 -- Now look at the components of the record
729 -- The following two variables are used to keep track of the
730 -- size of packed records if we can tell the size of the packed
731 -- record in the front end. Packed_Size_Known is True if so far
732 -- we can figure out the size. It is initialized to True for a
733 -- packed record, unless the record has discriminants. The
734 -- reason we eliminate the discriminated case is that we don't
735 -- know the way the back end lays out discriminated packed
736 -- records. If Packed_Size_Known is True, then Packed_Size is
737 -- the size in bits so far.
739 Packed_Size_Known : Boolean :=
741 and then not Has_Discriminants (T);
743 Packed_Size : Uint := Uint_0;
746 -- Test for variant part present
748 if Has_Discriminants (T)
749 and then Present (Parent (T))
750 and then Nkind (Parent (T)) = N_Full_Type_Declaration
751 and then Nkind (Type_Definition (Parent (T))) =
753 and then not Null_Present (Type_Definition (Parent (T)))
754 and then Present (Variant_Part
755 (Component_List (Type_Definition (Parent (T)))))
757 -- If variant part is present, and type is unconstrained,
758 -- then we must have defaulted discriminants, or a size
759 -- clause must be present for the type, or else the size
760 -- is definitely not known at compile time.
762 if not Is_Constrained (T)
764 No (Discriminant_Default_Value
765 (First_Discriminant (T)))
766 and then Unknown_Esize (T)
772 -- Loop through components
774 Comp := First_Component_Or_Discriminant (T);
775 while Present (Comp) loop
776 Ctyp := Etype (Comp);
778 -- We do not know the packed size if there is a component
779 -- clause present (we possibly could, but this would only
780 -- help in the case of a record with partial rep clauses.
781 -- That's because in the case of full rep clauses, the
782 -- size gets figured out anyway by a different circuit).
784 if Present (Component_Clause (Comp)) then
785 Packed_Size_Known := False;
788 -- We need to identify a component that is an array where
789 -- the index type is an enumeration type with non-standard
790 -- representation, and some bound of the type depends on a
793 -- This is because gigi computes the size by doing a
794 -- substituation of the appropriate discriminant value in
795 -- the size expression for the base type, and gigi is not
796 -- clever enough to evaluate the resulting expression (which
797 -- involves a call to rep_to_pos) at compile time.
799 -- It would be nice if gigi would either recognize that
800 -- this expression can be computed at compile time, or
801 -- alternatively figured out the size from the subtype
802 -- directly, where all the information is at hand ???
804 if Is_Array_Type (Etype (Comp))
805 and then Present (Packed_Array_Type (Etype (Comp)))
808 Ocomp : constant Entity_Id :=
809 Original_Record_Component (Comp);
810 OCtyp : constant Entity_Id := Etype (Ocomp);
816 Ind := First_Index (OCtyp);
817 while Present (Ind) loop
818 Indtyp := Etype (Ind);
820 if Is_Enumeration_Type (Indtyp)
821 and then Has_Non_Standard_Rep (Indtyp)
823 Lo := Type_Low_Bound (Indtyp);
824 Hi := Type_High_Bound (Indtyp);
826 if Is_Entity_Name (Lo)
827 and then Ekind (Entity (Lo)) = E_Discriminant
831 elsif Is_Entity_Name (Hi)
832 and then Ekind (Entity (Hi)) = E_Discriminant
843 -- Clearly size of record is not known if the size of one of
844 -- the components is not known.
846 if not Size_Known (Ctyp) then
850 -- Accumulate packed size if possible
852 if Packed_Size_Known then
854 -- We can only deal with elementary types, since for
855 -- non-elementary components, alignment enters into the
856 -- picture, and we don't know enough to handle proper
857 -- alignment in this context. Packed arrays count as
858 -- elementary if the representation is a modular type.
860 if Is_Elementary_Type (Ctyp)
861 or else (Is_Array_Type (Ctyp)
862 and then Present (Packed_Array_Type (Ctyp))
863 and then Is_Modular_Integer_Type
864 (Packed_Array_Type (Ctyp)))
866 -- If RM_Size is known and static, then we can
867 -- keep accumulating the packed size.
869 if Known_Static_RM_Size (Ctyp) then
871 -- A little glitch, to be removed sometime ???
872 -- gigi does not understand zero sizes yet.
874 if RM_Size (Ctyp) = Uint_0 then
875 Packed_Size_Known := False;
877 -- Normal case where we can keep accumulating the
878 -- packed array size.
881 Packed_Size := Packed_Size + RM_Size (Ctyp);
884 -- If we have a field whose RM_Size is not known then
885 -- we can't figure out the packed size here.
888 Packed_Size_Known := False;
891 -- If we have a non-elementary type we can't figure out
892 -- the packed array size (alignment issues).
895 Packed_Size_Known := False;
899 Next_Component_Or_Discriminant (Comp);
902 if Packed_Size_Known then
903 Set_Small_Size (T, Packed_Size);
914 -------------------------------------
915 -- Static_Discriminated_Components --
916 -------------------------------------
918 function Static_Discriminated_Components
919 (T : Entity_Id) return Boolean
921 Constraint : Elmt_Id;
924 if Has_Discriminants (T)
925 and then Present (Discriminant_Constraint (T))
926 and then Present (First_Component (T))
928 Constraint := First_Elmt (Discriminant_Constraint (T));
929 while Present (Constraint) loop
930 if not Compile_Time_Known_Value (Node (Constraint)) then
934 Next_Elmt (Constraint);
939 end Static_Discriminated_Components;
941 -- Start of processing for Check_Compile_Time_Size
944 Set_Size_Known_At_Compile_Time (T, Size_Known (T));
945 end Check_Compile_Time_Size;
947 -----------------------------
948 -- Check_Debug_Info_Needed --
949 -----------------------------
951 procedure Check_Debug_Info_Needed (T : Entity_Id) is
953 if Debug_Info_Off (T) then
956 elsif Comes_From_Source (T)
957 or else Debug_Generated_Code
958 or else Debug_Flag_VV
959 or else Needs_Debug_Info (T)
961 Set_Debug_Info_Needed (T);
963 end Check_Debug_Info_Needed;
965 ----------------------------
966 -- Check_Strict_Alignment --
967 ----------------------------
969 procedure Check_Strict_Alignment (E : Entity_Id) is
973 if Is_Tagged_Type (E) or else Is_Concurrent_Type (E) then
974 Set_Strict_Alignment (E);
976 elsif Is_Array_Type (E) then
977 Set_Strict_Alignment (E, Strict_Alignment (Component_Type (E)));
979 elsif Is_Record_Type (E) then
980 if Is_Limited_Record (E) then
981 Set_Strict_Alignment (E);
985 Comp := First_Component (E);
987 while Present (Comp) loop
988 if not Is_Type (Comp)
989 and then (Strict_Alignment (Etype (Comp))
990 or else Is_Aliased (Comp))
992 Set_Strict_Alignment (E);
996 Next_Component (Comp);
999 end Check_Strict_Alignment;
1001 -------------------------
1002 -- Check_Unsigned_Type --
1003 -------------------------
1005 procedure Check_Unsigned_Type (E : Entity_Id) is
1006 Ancestor : Entity_Id;
1011 if not Is_Discrete_Or_Fixed_Point_Type (E) then
1015 -- Do not attempt to analyze case where range was in error
1017 if Error_Posted (Scalar_Range (E)) then
1021 -- The situation that is non trivial is something like
1023 -- subtype x1 is integer range -10 .. +10;
1024 -- subtype x2 is x1 range 0 .. V1;
1025 -- subtype x3 is x2 range V2 .. V3;
1026 -- subtype x4 is x3 range V4 .. V5;
1028 -- where Vn are variables. Here the base type is signed, but we still
1029 -- know that x4 is unsigned because of the lower bound of x2.
1031 -- The only way to deal with this is to look up the ancestor chain
1035 if Ancestor = Any_Type or else Etype (Ancestor) = Any_Type then
1039 Lo_Bound := Type_Low_Bound (Ancestor);
1041 if Compile_Time_Known_Value (Lo_Bound) then
1043 if Expr_Rep_Value (Lo_Bound) >= 0 then
1044 Set_Is_Unsigned_Type (E, True);
1050 Ancestor := Ancestor_Subtype (Ancestor);
1052 -- If no ancestor had a static lower bound, go to base type
1054 if No (Ancestor) then
1056 -- Note: the reason we still check for a compile time known
1057 -- value for the base type is that at least in the case of
1058 -- generic formals, we can have bounds that fail this test,
1059 -- and there may be other cases in error situations.
1061 Btyp := Base_Type (E);
1063 if Btyp = Any_Type or else Etype (Btyp) = Any_Type then
1067 Lo_Bound := Type_Low_Bound (Base_Type (E));
1069 if Compile_Time_Known_Value (Lo_Bound)
1070 and then Expr_Rep_Value (Lo_Bound) >= 0
1072 Set_Is_Unsigned_Type (E, True);
1079 end Check_Unsigned_Type;
1081 -----------------------------
1082 -- Expand_Atomic_Aggregate --
1083 -----------------------------
1085 procedure Expand_Atomic_Aggregate (E : Entity_Id; Typ : Entity_Id) is
1086 Loc : constant Source_Ptr := Sloc (E);
1091 if (Nkind (Parent (E)) = N_Object_Declaration
1092 or else Nkind (Parent (E)) = N_Assignment_Statement)
1093 and then Comes_From_Source (Parent (E))
1094 and then Nkind (E) = N_Aggregate
1097 Make_Defining_Identifier (Loc,
1098 New_Internal_Name ('T'));
1101 Make_Object_Declaration (Loc,
1102 Defining_Identifier => Temp,
1103 Object_definition => New_Occurrence_Of (Typ, Loc),
1104 Expression => Relocate_Node (E));
1105 Insert_Before (Parent (E), New_N);
1108 Set_Expression (Parent (E), New_Occurrence_Of (Temp, Loc));
1110 -- To prevent the temporary from being constant-folded (which would
1111 -- lead to the same piecemeal assignment on the original target)
1112 -- indicate to the back-end that the temporary is a variable with
1113 -- real storage. See description of this flag in Einfo, and the notes
1114 -- on N_Assignment_Statement and N_Object_Declaration in Sinfo.
1116 Set_Is_True_Constant (Temp, False);
1118 end Expand_Atomic_Aggregate;
1124 -- Note: the easy coding for this procedure would be to just build a
1125 -- single list of freeze nodes and then insert them and analyze them
1126 -- all at once. This won't work, because the analysis of earlier freeze
1127 -- nodes may recursively freeze types which would otherwise appear later
1128 -- on in the freeze list. So we must analyze and expand the freeze nodes
1129 -- as they are generated.
1131 procedure Freeze_All (From : Entity_Id; After : in out Node_Id) is
1132 Loc : constant Source_Ptr := Sloc (After);
1136 procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id);
1137 -- This is the internal recursive routine that does freezing of entities
1138 -- (but NOT the analysis of default expressions, which should not be
1139 -- recursive, we don't want to analyze those till we are sure that ALL
1140 -- the types are frozen).
1142 --------------------
1143 -- Freeze_All_Ent --
1144 --------------------
1146 procedure Freeze_All_Ent
1148 After : in out Node_Id)
1154 procedure Process_Flist;
1155 -- If freeze nodes are present, insert and analyze, and reset cursor
1156 -- for next insertion.
1162 procedure Process_Flist is
1164 if Is_Non_Empty_List (Flist) then
1165 Lastn := Next (After);
1166 Insert_List_After_And_Analyze (After, Flist);
1168 if Present (Lastn) then
1169 After := Prev (Lastn);
1171 After := Last (List_Containing (After));
1176 -- Start or processing for Freeze_All_Ent
1180 while Present (E) loop
1182 -- If the entity is an inner package which is not a package
1183 -- renaming, then its entities must be frozen at this point. Note
1184 -- that such entities do NOT get frozen at the end of the nested
1185 -- package itself (only library packages freeze).
1187 -- Same is true for task declarations, where anonymous records
1188 -- created for entry parameters must be frozen.
1190 if Ekind (E) = E_Package
1191 and then No (Renamed_Object (E))
1192 and then not Is_Child_Unit (E)
1193 and then not Is_Frozen (E)
1196 Install_Visible_Declarations (E);
1197 Install_Private_Declarations (E);
1199 Freeze_All (First_Entity (E), After);
1201 End_Package_Scope (E);
1203 elsif Ekind (E) in Task_Kind
1205 (Nkind (Parent (E)) = N_Task_Type_Declaration
1207 Nkind (Parent (E)) = N_Single_Task_Declaration)
1210 Freeze_All (First_Entity (E), After);
1213 -- For a derived tagged type, we must ensure that all the
1214 -- primitive operations of the parent have been frozen, so that
1215 -- their addresses will be in the parent's dispatch table at the
1216 -- point it is inherited.
1218 elsif Ekind (E) = E_Record_Type
1219 and then Is_Tagged_Type (E)
1220 and then Is_Tagged_Type (Etype (E))
1221 and then Is_Derived_Type (E)
1224 Prim_List : constant Elist_Id :=
1225 Primitive_Operations (Etype (E));
1231 Prim := First_Elmt (Prim_List);
1233 while Present (Prim) loop
1234 Subp := Node (Prim);
1236 if Comes_From_Source (Subp)
1237 and then not Is_Frozen (Subp)
1239 Flist := Freeze_Entity (Subp, Loc);
1248 if not Is_Frozen (E) then
1249 Flist := Freeze_Entity (E, Loc);
1253 -- If an incomplete type is still not frozen, this may be a
1254 -- premature freezing because of a body declaration that follows.
1255 -- Indicate where the freezing took place.
1257 -- If the freezing is caused by the end of the current declarative
1258 -- part, it is a Taft Amendment type, and there is no error.
1260 if not Is_Frozen (E)
1261 and then Ekind (E) = E_Incomplete_Type
1264 Bod : constant Node_Id := Next (After);
1267 if (Nkind (Bod) = N_Subprogram_Body
1268 or else Nkind (Bod) = N_Entry_Body
1269 or else Nkind (Bod) = N_Package_Body
1270 or else Nkind (Bod) = N_Protected_Body
1271 or else Nkind (Bod) = N_Task_Body
1272 or else Nkind (Bod) in N_Body_Stub)
1274 List_Containing (After) = List_Containing (Parent (E))
1276 Error_Msg_Sloc := Sloc (Next (After));
1278 ("type& is frozen# before its full declaration",
1288 -- Start of processing for Freeze_All
1291 Freeze_All_Ent (From, After);
1293 -- Now that all types are frozen, we can deal with default expressions
1294 -- that require us to build a default expression functions. This is the
1295 -- point at which such functions are constructed (after all types that
1296 -- might be used in such expressions have been frozen).
1298 -- We also add finalization chains to access types whose designated
1299 -- types are controlled. This is normally done when freezing the type,
1300 -- but this misses recursive type definitions where the later members
1301 -- of the recursion introduce controlled components (e.g. 5624-001).
1303 -- Loop through entities
1306 while Present (E) loop
1307 if Is_Subprogram (E) then
1309 if not Default_Expressions_Processed (E) then
1310 Process_Default_Expressions (E, After);
1313 if not Has_Completion (E) then
1314 Decl := Unit_Declaration_Node (E);
1316 if Nkind (Decl) = N_Subprogram_Renaming_Declaration then
1317 Build_And_Analyze_Renamed_Body (Decl, E, After);
1319 elsif Nkind (Decl) = N_Subprogram_Declaration
1320 and then Present (Corresponding_Body (Decl))
1322 Nkind (Unit_Declaration_Node (Corresponding_Body (Decl)))
1323 = N_Subprogram_Renaming_Declaration
1325 Build_And_Analyze_Renamed_Body
1326 (Decl, Corresponding_Body (Decl), After);
1330 elsif Ekind (E) in Task_Kind
1332 (Nkind (Parent (E)) = N_Task_Type_Declaration
1334 Nkind (Parent (E)) = N_Single_Task_Declaration)
1339 Ent := First_Entity (E);
1341 while Present (Ent) loop
1344 and then not Default_Expressions_Processed (Ent)
1346 Process_Default_Expressions (Ent, After);
1353 elsif Is_Access_Type (E)
1354 and then Comes_From_Source (E)
1355 and then Ekind (Directly_Designated_Type (E)) = E_Incomplete_Type
1356 and then Controlled_Type (Designated_Type (E))
1357 and then No (Associated_Final_Chain (E))
1359 Build_Final_List (Parent (E), E);
1366 -----------------------
1367 -- Freeze_And_Append --
1368 -----------------------
1370 procedure Freeze_And_Append
1373 Result : in out List_Id)
1375 L : constant List_Id := Freeze_Entity (Ent, Loc);
1377 if Is_Non_Empty_List (L) then
1378 if Result = No_List then
1381 Append_List (L, Result);
1384 end Freeze_And_Append;
1390 procedure Freeze_Before (N : Node_Id; T : Entity_Id) is
1391 Freeze_Nodes : constant List_Id := Freeze_Entity (T, Sloc (N));
1393 if Is_Non_Empty_List (Freeze_Nodes) then
1394 Insert_Actions (N, Freeze_Nodes);
1402 function Freeze_Entity (E : Entity_Id; Loc : Source_Ptr) return List_Id is
1403 Test_E : Entity_Id := E;
1411 procedure Check_Current_Instance (Comp_Decl : Node_Id);
1412 -- Check that an Access or Unchecked_Access attribute with a prefix
1413 -- which is the current instance type can only be applied when the type
1416 function After_Last_Declaration return Boolean;
1417 -- If Loc is a freeze_entity that appears after the last declaration
1418 -- in the scope, inhibit error messages on late completion.
1420 procedure Freeze_Record_Type (Rec : Entity_Id);
1421 -- Freeze each component, handle some representation clauses, and freeze
1422 -- primitive operations if this is a tagged type.
1424 ----------------------------
1425 -- After_Last_Declaration --
1426 ----------------------------
1428 function After_Last_Declaration return Boolean is
1429 Spec : constant Node_Id := Parent (Current_Scope);
1431 if Nkind (Spec) = N_Package_Specification then
1432 if Present (Private_Declarations (Spec)) then
1433 return Loc >= Sloc (Last (Private_Declarations (Spec)));
1434 elsif Present (Visible_Declarations (Spec)) then
1435 return Loc >= Sloc (Last (Visible_Declarations (Spec)));
1442 end After_Last_Declaration;
1444 ----------------------------
1445 -- Check_Current_Instance --
1446 ----------------------------
1448 procedure Check_Current_Instance (Comp_Decl : Node_Id) is
1450 Rec_Type : constant Entity_Id :=
1451 Scope (Defining_Identifier (Comp_Decl));
1453 Decl : constant Node_Id := Parent (Rec_Type);
1455 function Process (N : Node_Id) return Traverse_Result;
1456 -- Process routine to apply check to given node
1462 function Process (N : Node_Id) return Traverse_Result is
1465 when N_Attribute_Reference =>
1466 if (Attribute_Name (N) = Name_Access
1468 Attribute_Name (N) = Name_Unchecked_Access)
1469 and then Is_Entity_Name (Prefix (N))
1470 and then Is_Type (Entity (Prefix (N)))
1471 and then Entity (Prefix (N)) = E
1474 ("current instance must be a limited type", Prefix (N));
1480 when others => return OK;
1484 procedure Traverse is new Traverse_Proc (Process);
1486 -- Start of processing for Check_Current_Instance
1489 -- In Ada95, the (imprecise) rule is that the current instance of a
1490 -- limited type is aliased. In Ada2005, limitedness must be explicit:
1491 -- either a tagged type, or a limited record.
1493 if Is_Limited_Type (Rec_Type)
1495 (Ada_Version < Ada_05
1496 or else Is_Tagged_Type (Rec_Type))
1500 elsif Nkind (Decl) = N_Full_Type_Declaration
1501 and then Limited_Present (Type_Definition (Decl))
1506 Traverse (Comp_Decl);
1508 end Check_Current_Instance;
1510 ------------------------
1511 -- Freeze_Record_Type --
1512 ------------------------
1514 procedure Freeze_Record_Type (Rec : Entity_Id) is
1521 pragma Warnings (Off, Junk);
1523 Unplaced_Component : Boolean := False;
1524 -- Set True if we find at least one component with no component
1525 -- clause (used to warn about useless Pack pragmas).
1527 Placed_Component : Boolean := False;
1528 -- Set True if we find at least one component with a component
1529 -- clause (used to warn about useless Bit_Order pragmas).
1531 function Check_Allocator (N : Node_Id) return Node_Id;
1532 -- If N is an allocator, possibly wrapped in one or more level of
1533 -- qualified expression(s), return the inner allocator node, else
1536 procedure Check_Itype (Typ : Entity_Id);
1537 -- If the component subtype is an access to a constrained subtype of
1538 -- an already frozen type, make the subtype frozen as well. It might
1539 -- otherwise be frozen in the wrong scope, and a freeze node on
1540 -- subtype has no effect. Similarly, if the component subtype is a
1541 -- regular (not protected) access to subprogram, set the anonymous
1542 -- subprogram type to frozen as well, to prevent an out-of-scope
1543 -- freeze node at some eventual point of call. Protected operations
1544 -- are handled elsewhere.
1546 ---------------------
1547 -- Check_Allocator --
1548 ---------------------
1550 function Check_Allocator (N : Node_Id) return Node_Id is
1555 if Nkind (Inner) = N_Allocator then
1557 elsif Nkind (Inner) = N_Qualified_Expression then
1558 Inner := Expression (Inner);
1563 end Check_Allocator;
1569 procedure Check_Itype (Typ : Entity_Id) is
1570 Desig : constant Entity_Id := Designated_Type (Typ);
1573 if not Is_Frozen (Desig)
1574 and then Is_Frozen (Base_Type (Desig))
1576 Set_Is_Frozen (Desig);
1578 -- In addition, add an Itype_Reference to ensure that the
1579 -- access subtype is elaborated early enough. This cannot be
1580 -- done if the subtype may depend on discriminants.
1582 if Ekind (Comp) = E_Component
1583 and then Is_Itype (Etype (Comp))
1584 and then not Has_Discriminants (Rec)
1586 IR := Make_Itype_Reference (Sloc (Comp));
1587 Set_Itype (IR, Desig);
1590 Result := New_List (IR);
1592 Append (IR, Result);
1596 elsif Ekind (Typ) = E_Anonymous_Access_Subprogram_Type
1597 and then Convention (Desig) /= Convention_Protected
1599 Set_Is_Frozen (Desig);
1603 -- Start of processing for Freeze_Record_Type
1606 -- If this is a subtype of a controlled type, declared without a
1607 -- constraint, the _controller may not appear in the component list
1608 -- if the parent was not frozen at the point of subtype declaration.
1609 -- Inherit the _controller component now.
1611 if Rec /= Base_Type (Rec)
1612 and then Has_Controlled_Component (Rec)
1614 if Nkind (Parent (Rec)) = N_Subtype_Declaration
1615 and then Is_Entity_Name (Subtype_Indication (Parent (Rec)))
1617 Set_First_Entity (Rec, First_Entity (Base_Type (Rec)));
1619 -- If this is an internal type without a declaration, as for
1620 -- record component, the base type may not yet be frozen, and its
1621 -- controller has not been created. Add an explicit freeze node
1622 -- for the itype, so it will be frozen after the base type. This
1623 -- freeze node is used to communicate with the expander, in order
1624 -- to create the controller for the enclosing record, and it is
1625 -- deleted afterwards (see exp_ch3). It must not be created when
1626 -- expansion is off, because it might appear in the wrong context
1627 -- for the back end.
1629 elsif Is_Itype (Rec)
1630 and then Has_Delayed_Freeze (Base_Type (Rec))
1632 Nkind (Associated_Node_For_Itype (Rec)) =
1633 N_Component_Declaration
1634 and then Expander_Active
1636 Ensure_Freeze_Node (Rec);
1640 -- Freeze components and embedded subtypes
1642 Comp := First_Entity (Rec);
1644 while Present (Comp) loop
1646 -- First handle the (real) component case
1648 if Ekind (Comp) = E_Component
1649 or else Ekind (Comp) = E_Discriminant
1652 CC : constant Node_Id := Component_Clause (Comp);
1655 -- Freezing a record type freezes the type of each of its
1656 -- components. However, if the type of the component is
1657 -- part of this record, we do not want or need a separate
1658 -- Freeze_Node. Note that Is_Itype is wrong because that's
1659 -- also set in private type cases. We also can't check for
1660 -- the Scope being exactly Rec because of private types and
1661 -- record extensions.
1663 if Is_Itype (Etype (Comp))
1664 and then Is_Record_Type (Underlying_Type
1665 (Scope (Etype (Comp))))
1667 Undelay_Type (Etype (Comp));
1670 Freeze_And_Append (Etype (Comp), Loc, Result);
1672 -- Check for error of component clause given for variable
1673 -- sized type. We have to delay this test till this point,
1674 -- since the component type has to be frozen for us to know
1675 -- if it is variable length. We omit this test in a generic
1676 -- context, it will be applied at instantiation time.
1678 if Present (CC) then
1679 Placed_Component := True;
1681 if Inside_A_Generic then
1685 Size_Known_At_Compile_Time
1686 (Underlying_Type (Etype (Comp)))
1689 ("component clause not allowed for variable " &
1690 "length component", CC);
1694 Unplaced_Component := True;
1697 -- Case of component requires byte alignment
1699 if Must_Be_On_Byte_Boundary (Etype (Comp)) then
1701 -- Set the enclosing record to also require byte align
1703 Set_Must_Be_On_Byte_Boundary (Rec);
1705 -- Check for component clause that is inconsistent with
1706 -- the required byte boundary alignment.
1709 and then Normalized_First_Bit (Comp) mod
1710 System_Storage_Unit /= 0
1713 ("component & must be byte aligned",
1714 Component_Name (Component_Clause (Comp)));
1718 -- If component clause is present, then deal with the non-
1719 -- default bit order case for Ada 95 mode. The required
1720 -- processing for Ada 2005 mode is handled separately after
1721 -- processing all components.
1723 -- We only do this processing for the base type, and in
1724 -- fact that's important, since otherwise if there are
1725 -- record subtypes, we could reverse the bits once for
1726 -- each subtype, which would be incorrect.
1729 and then Reverse_Bit_Order (Rec)
1730 and then Ekind (E) = E_Record_Type
1731 and then Ada_Version <= Ada_95
1734 CFB : constant Uint := Component_Bit_Offset (Comp);
1735 CSZ : constant Uint := Esize (Comp);
1736 CLC : constant Node_Id := Component_Clause (Comp);
1737 Pos : constant Node_Id := Position (CLC);
1738 FB : constant Node_Id := First_Bit (CLC);
1740 Storage_Unit_Offset : constant Uint :=
1741 CFB / System_Storage_Unit;
1743 Start_Bit : constant Uint :=
1744 CFB mod System_Storage_Unit;
1747 -- Cases where field goes over storage unit boundary
1749 if Start_Bit + CSZ > System_Storage_Unit then
1751 -- Allow multi-byte field but generate warning
1753 if Start_Bit mod System_Storage_Unit = 0
1754 and then CSZ mod System_Storage_Unit = 0
1757 ("multi-byte field specified with non-standard"
1758 & " Bit_Order?", CLC);
1760 if Bytes_Big_Endian then
1762 ("bytes are not reversed "
1763 & "(component is big-endian)?", CLC);
1766 ("bytes are not reversed "
1767 & "(component is little-endian)?", CLC);
1770 -- Do not allow non-contiguous field
1774 ("attempt to specify non-contiguous field"
1775 & " not permitted", CLC);
1777 ("\(caused by non-standard Bit_Order "
1778 & "specified)", CLC);
1781 -- Case where field fits in one storage unit
1784 -- Give warning if suspicious component clause
1786 if Intval (FB) >= System_Storage_Unit
1787 and then Warn_On_Reverse_Bit_Order
1790 ("?Bit_Order clause does not affect " &
1791 "byte ordering", Pos);
1793 Intval (Pos) + Intval (FB) /
1794 System_Storage_Unit;
1796 ("?position normalized to ^ before bit " &
1797 "order interpreted", Pos);
1800 -- Here is where we fix up the Component_Bit_Offset
1801 -- value to account for the reverse bit order.
1802 -- Some examples of what needs to be done are:
1804 -- First_Bit .. Last_Bit Component_Bit_Offset
1807 -- 0 .. 0 7 .. 7 0 7
1808 -- 0 .. 1 6 .. 7 0 6
1809 -- 0 .. 2 5 .. 7 0 5
1810 -- 0 .. 7 0 .. 7 0 4
1812 -- 1 .. 1 6 .. 6 1 6
1813 -- 1 .. 4 3 .. 6 1 3
1814 -- 4 .. 7 0 .. 3 4 0
1816 -- The general rule is that the first bit is
1817 -- is obtained by subtracting the old ending bit
1818 -- from storage_unit - 1.
1820 Set_Component_Bit_Offset
1822 (Storage_Unit_Offset * System_Storage_Unit) +
1823 (System_Storage_Unit - 1) -
1824 (Start_Bit + CSZ - 1));
1826 Set_Normalized_First_Bit
1828 Component_Bit_Offset (Comp) mod
1829 System_Storage_Unit);
1836 -- If the component is an Itype with Delayed_Freeze and is either
1837 -- a record or array subtype and its base type has not yet been
1838 -- frozen, we must remove this from the entity list of this
1839 -- record and put it on the entity list of the scope of its base
1840 -- type. Note that we know that this is not the type of a
1841 -- component since we cleared Has_Delayed_Freeze for it in the
1842 -- previous loop. Thus this must be the Designated_Type of an
1843 -- access type, which is the type of a component.
1846 and then Is_Type (Scope (Comp))
1847 and then Is_Composite_Type (Comp)
1848 and then Base_Type (Comp) /= Comp
1849 and then Has_Delayed_Freeze (Comp)
1850 and then not Is_Frozen (Base_Type (Comp))
1853 Will_Be_Frozen : Boolean := False;
1857 -- We have a pretty bad kludge here. Suppose Rec is subtype
1858 -- being defined in a subprogram that's created as part of
1859 -- the freezing of Rec'Base. In that case, we know that
1860 -- Comp'Base must have already been frozen by the time we
1861 -- get to elaborate this because Gigi doesn't elaborate any
1862 -- bodies until it has elaborated all of the declarative
1863 -- part. But Is_Frozen will not be set at this point because
1864 -- we are processing code in lexical order.
1866 -- We detect this case by going up the Scope chain of Rec
1867 -- and seeing if we have a subprogram scope before reaching
1868 -- the top of the scope chain or that of Comp'Base. If we
1869 -- do, then mark that Comp'Base will actually be frozen. If
1870 -- so, we merely undelay it.
1873 while Present (S) loop
1874 if Is_Subprogram (S) then
1875 Will_Be_Frozen := True;
1877 elsif S = Scope (Base_Type (Comp)) then
1884 if Will_Be_Frozen then
1885 Undelay_Type (Comp);
1887 if Present (Prev) then
1888 Set_Next_Entity (Prev, Next_Entity (Comp));
1890 Set_First_Entity (Rec, Next_Entity (Comp));
1893 -- Insert in entity list of scope of base type (which
1894 -- must be an enclosing scope, because still unfrozen).
1896 Append_Entity (Comp, Scope (Base_Type (Comp)));
1900 -- If the component is an access type with an allocator as default
1901 -- value, the designated type will be frozen by the corresponding
1902 -- expression in init_proc. In order to place the freeze node for
1903 -- the designated type before that for the current record type,
1906 -- Same process if the component is an array of access types,
1907 -- initialized with an aggregate. If the designated type is
1908 -- private, it cannot contain allocators, and it is premature
1909 -- to freeze the type, so we check for this as well.
1911 elsif Is_Access_Type (Etype (Comp))
1912 and then Present (Parent (Comp))
1913 and then Present (Expression (Parent (Comp)))
1916 Alloc : constant Node_Id :=
1917 Check_Allocator (Expression (Parent (Comp)));
1920 if Present (Alloc) then
1922 -- If component is pointer to a classwide type, freeze
1923 -- the specific type in the expression being allocated.
1924 -- The expression may be a subtype indication, in which
1925 -- case freeze the subtype mark.
1927 if Is_Class_Wide_Type
1928 (Designated_Type (Etype (Comp)))
1930 if Is_Entity_Name (Expression (Alloc)) then
1932 (Entity (Expression (Alloc)), Loc, Result);
1934 Nkind (Expression (Alloc)) = N_Subtype_Indication
1937 (Entity (Subtype_Mark (Expression (Alloc))),
1941 elsif Is_Itype (Designated_Type (Etype (Comp))) then
1942 Check_Itype (Etype (Comp));
1946 (Designated_Type (Etype (Comp)), Loc, Result);
1951 elsif Is_Access_Type (Etype (Comp))
1952 and then Is_Itype (Designated_Type (Etype (Comp)))
1954 Check_Itype (Etype (Comp));
1956 elsif Is_Array_Type (Etype (Comp))
1957 and then Is_Access_Type (Component_Type (Etype (Comp)))
1958 and then Present (Parent (Comp))
1959 and then Nkind (Parent (Comp)) = N_Component_Declaration
1960 and then Present (Expression (Parent (Comp)))
1961 and then Nkind (Expression (Parent (Comp))) = N_Aggregate
1962 and then Is_Fully_Defined
1963 (Designated_Type (Component_Type (Etype (Comp))))
1967 (Component_Type (Etype (Comp))), Loc, Result);
1974 -- Deal with pragma Bit_Order
1976 if Reverse_Bit_Order (Rec) and then Base_Type (Rec) = Rec then
1977 if not Placed_Component then
1979 Get_Attribute_Definition_Clause (Rec, Attribute_Bit_Order);
1981 ("?Bit_Order specification has no effect", ADC);
1983 ("\?since no component clauses were specified", ADC);
1985 -- Here is where we do Ada 2005 processing for bit order (the Ada
1986 -- 95 case was already taken care of above).
1988 elsif Ada_Version >= Ada_05 then
1989 Adjust_Record_For_Reverse_Bit_Order (Rec);
1993 -- Set OK_To_Reorder_Components depending on debug flags
1995 if Rec = Base_Type (Rec)
1996 and then Convention (Rec) = Convention_Ada
1998 if (Has_Discriminants (Rec) and then Debug_Flag_Dot_V)
2000 (not Has_Discriminants (Rec) and then Debug_Flag_Dot_R)
2002 Set_OK_To_Reorder_Components (Rec);
2006 -- Check for useless pragma Pack when all components placed. We only
2007 -- do this check for record types, not subtypes, since a subtype may
2008 -- have all its components placed, and it still makes perfectly good
2009 -- sense to pack other subtypes or the parent type. We do not give
2010 -- this warning if Optimize_Alignment is set to Space, since the
2011 -- pragma Pack does have an effect in this case (it always resets
2012 -- the alignment to one).
2014 if Ekind (Rec) = E_Record_Type
2015 and then Is_Packed (Rec)
2016 and then not Unplaced_Component
2017 and then Optimize_Alignment /= 'S'
2019 -- Reset packed status. Probably not necessary, but we do it so
2020 -- that there is no chance of the back end doing something strange
2021 -- with this redundant indication of packing.
2023 Set_Is_Packed (Rec, False);
2025 -- Give warning if redundant constructs warnings on
2027 if Warn_On_Redundant_Constructs then
2029 ("?pragma Pack has no effect, no unplaced components",
2030 Get_Rep_Pragma (Rec, Name_Pack));
2034 -- If this is the record corresponding to a remote type, freeze the
2035 -- remote type here since that is what we are semantically freezing.
2036 -- This prevents the freeze node for that type in an inner scope.
2038 -- Also, Check for controlled components and unchecked unions.
2039 -- Finally, enforce the restriction that access attributes with a
2040 -- current instance prefix can only apply to limited types.
2042 if Ekind (Rec) = E_Record_Type then
2043 if Present (Corresponding_Remote_Type (Rec)) then
2045 (Corresponding_Remote_Type (Rec), Loc, Result);
2048 Comp := First_Component (Rec);
2049 while Present (Comp) loop
2050 if Has_Controlled_Component (Etype (Comp))
2051 or else (Chars (Comp) /= Name_uParent
2052 and then Is_Controlled (Etype (Comp)))
2053 or else (Is_Protected_Type (Etype (Comp))
2055 (Corresponding_Record_Type (Etype (Comp)))
2056 and then Has_Controlled_Component
2057 (Corresponding_Record_Type (Etype (Comp))))
2059 Set_Has_Controlled_Component (Rec);
2063 if Has_Unchecked_Union (Etype (Comp)) then
2064 Set_Has_Unchecked_Union (Rec);
2067 if Has_Per_Object_Constraint (Comp) then
2069 -- Scan component declaration for likely misuses of current
2070 -- instance, either in a constraint or a default expression.
2072 Check_Current_Instance (Parent (Comp));
2075 Next_Component (Comp);
2079 Set_Component_Alignment_If_Not_Set (Rec);
2081 -- For first subtypes, check if there are any fixed-point fields with
2082 -- component clauses, where we must check the size. This is not done
2083 -- till the freeze point, since for fixed-point types, we do not know
2084 -- the size until the type is frozen. Similar processing applies to
2085 -- bit packed arrays.
2087 if Is_First_Subtype (Rec) then
2088 Comp := First_Component (Rec);
2090 while Present (Comp) loop
2091 if Present (Component_Clause (Comp))
2092 and then (Is_Fixed_Point_Type (Etype (Comp))
2094 Is_Bit_Packed_Array (Etype (Comp)))
2097 (Component_Name (Component_Clause (Comp)),
2103 Next_Component (Comp);
2107 -- Generate warning for applying C or C++ convention to a record
2108 -- with discriminants. This is suppressed for the unchecked union
2109 -- case, since the whole point in this case is interface C. We also
2110 -- do not generate this within instantiations, since we will have
2111 -- generated a message on the template.
2113 if Has_Discriminants (E)
2114 and then not Is_Unchecked_Union (E)
2115 and then (Convention (E) = Convention_C
2117 Convention (E) = Convention_CPP)
2118 and then Comes_From_Source (E)
2119 and then not In_Instance
2120 and then not Has_Warnings_Off (E)
2121 and then not Has_Warnings_Off (Base_Type (E))
2124 Cprag : constant Node_Id := Get_Rep_Pragma (E, Name_Convention);
2128 if Present (Cprag) then
2129 A2 := Next (First (Pragma_Argument_Associations (Cprag)));
2131 if Convention (E) = Convention_C then
2133 ("?variant record has no direct equivalent in C", A2);
2136 ("?variant record has no direct equivalent in C++", A2);
2140 ("\?use of convention for type& is dubious", A2, E);
2144 end Freeze_Record_Type;
2146 -- Start of processing for Freeze_Entity
2149 -- We are going to test for various reasons why this entity need not be
2150 -- frozen here, but in the case of an Itype that's defined within a
2151 -- record, that test actually applies to the record.
2153 if Is_Itype (E) and then Is_Record_Type (Scope (E)) then
2154 Test_E := Scope (E);
2155 elsif Is_Itype (E) and then Present (Underlying_Type (Scope (E)))
2156 and then Is_Record_Type (Underlying_Type (Scope (E)))
2158 Test_E := Underlying_Type (Scope (E));
2161 -- Do not freeze if already frozen since we only need one freeze node
2163 if Is_Frozen (E) then
2166 -- It is improper to freeze an external entity within a generic because
2167 -- its freeze node will appear in a non-valid context. The entity will
2168 -- be frozen in the proper scope after the current generic is analyzed.
2170 elsif Inside_A_Generic and then External_Ref_In_Generic (Test_E) then
2173 -- Do not freeze a global entity within an inner scope created during
2174 -- expansion. A call to subprogram E within some internal procedure
2175 -- (a stream attribute for example) might require freezing E, but the
2176 -- freeze node must appear in the same declarative part as E itself.
2177 -- The two-pass elaboration mechanism in gigi guarantees that E will
2178 -- be frozen before the inner call is elaborated. We exclude constants
2179 -- from this test, because deferred constants may be frozen early, and
2180 -- must be diagnosed (e.g. in the case of a deferred constant being used
2181 -- in a default expression). If the enclosing subprogram comes from
2182 -- source, or is a generic instance, then the freeze point is the one
2183 -- mandated by the language, and we freeze the entity. A subprogram that
2184 -- is a child unit body that acts as a spec does not have a spec that
2185 -- comes from source, but can only come from source.
2187 elsif In_Open_Scopes (Scope (Test_E))
2188 and then Scope (Test_E) /= Current_Scope
2189 and then Ekind (Test_E) /= E_Constant
2192 S : Entity_Id := Current_Scope;
2195 while Present (S) loop
2196 if Is_Overloadable (S) then
2197 if Comes_From_Source (S)
2198 or else Is_Generic_Instance (S)
2199 or else Is_Child_Unit (S)
2211 -- Similarly, an inlined instance body may make reference to global
2212 -- entities, but these references cannot be the proper freezing point
2213 -- for them, and in the absence of inlining freezing will take place in
2214 -- their own scope. Normally instance bodies are analyzed after the
2215 -- enclosing compilation, and everything has been frozen at the proper
2216 -- place, but with front-end inlining an instance body is compiled
2217 -- before the end of the enclosing scope, and as a result out-of-order
2218 -- freezing must be prevented.
2220 elsif Front_End_Inlining
2221 and then In_Instance_Body
2222 and then Present (Scope (Test_E))
2225 S : Entity_Id := Scope (Test_E);
2228 while Present (S) loop
2229 if Is_Generic_Instance (S) then
2242 -- Here to freeze the entity
2247 -- Case of entity being frozen is other than a type
2249 if not Is_Type (E) then
2251 -- If entity is exported or imported and does not have an external
2252 -- name, now is the time to provide the appropriate default name.
2253 -- Skip this if the entity is stubbed, since we don't need a name
2254 -- for any stubbed routine.
2256 if (Is_Imported (E) or else Is_Exported (E))
2257 and then No (Interface_Name (E))
2258 and then Convention (E) /= Convention_Stubbed
2260 Set_Encoded_Interface_Name
2261 (E, Get_Default_External_Name (E));
2263 -- Special processing for atomic objects appearing in object decls
2266 and then Nkind (Parent (E)) = N_Object_Declaration
2267 and then Present (Expression (Parent (E)))
2270 Expr : constant Node_Id := Expression (Parent (E));
2273 -- If expression is an aggregate, assign to a temporary to
2274 -- ensure that the actual assignment is done atomically rather
2275 -- than component-wise (the assignment to the temp may be done
2276 -- component-wise, but that is harmless).
2278 if Nkind (Expr) = N_Aggregate then
2279 Expand_Atomic_Aggregate (Expr, Etype (E));
2281 -- If the expression is a reference to a record or array object
2282 -- entity, then reset Is_True_Constant to False so that the
2283 -- compiler will not optimize away the intermediate object,
2284 -- which we need in this case for the same reason (to ensure
2285 -- that the actual assignment is atomic, rather than
2288 elsif Is_Entity_Name (Expr)
2289 and then (Is_Record_Type (Etype (Expr))
2291 Is_Array_Type (Etype (Expr)))
2293 Set_Is_True_Constant (Entity (Expr), False);
2298 -- For a subprogram, freeze all parameter types and also the return
2299 -- type (RM 13.14(14)). However skip this for internal subprograms.
2300 -- This is also the point where any extra formal parameters are
2301 -- created since we now know whether the subprogram will use
2302 -- a foreign convention.
2304 if Is_Subprogram (E) then
2305 if not Is_Internal (E) then
2309 Warn_Node : Node_Id;
2312 -- Loop through formals
2314 Formal := First_Formal (E);
2315 while Present (Formal) loop
2316 F_Type := Etype (Formal);
2317 Freeze_And_Append (F_Type, Loc, Result);
2319 if Is_Private_Type (F_Type)
2320 and then Is_Private_Type (Base_Type (F_Type))
2321 and then No (Full_View (Base_Type (F_Type)))
2322 and then not Is_Generic_Type (F_Type)
2323 and then not Is_Derived_Type (F_Type)
2325 -- If the type of a formal is incomplete, subprogram
2326 -- is being frozen prematurely. Within an instance
2327 -- (but not within a wrapper package) this is an
2328 -- an artifact of our need to regard the end of an
2329 -- instantiation as a freeze point. Otherwise it is
2330 -- a definite error.
2332 -- and then not Is_Wrapper_Package (Current_Scope) ???
2335 Set_Is_Frozen (E, False);
2338 elsif not After_Last_Declaration
2339 and then not Freezing_Library_Level_Tagged_Type
2341 Error_Msg_Node_1 := F_Type;
2343 ("type& must be fully defined before this point",
2348 -- Check suspicious parameter for C function. These tests
2349 -- apply only to exported/imported subprograms.
2351 if Warn_On_Export_Import
2352 and then Comes_From_Source (E)
2353 and then (Convention (E) = Convention_C
2355 Convention (E) = Convention_CPP)
2356 and then (Is_Imported (E) or else Is_Exported (E))
2357 and then Convention (E) /= Convention (Formal)
2358 and then not Has_Warnings_Off (E)
2359 and then not Has_Warnings_Off (F_Type)
2360 and then not Has_Warnings_Off (Formal)
2362 Error_Msg_Qual_Level := 1;
2364 -- Check suspicious use of fat C pointer
2366 if Is_Access_Type (F_Type)
2367 and then Esize (F_Type) > Ttypes.System_Address_Size
2370 ("?type of & does not correspond "
2371 & "to C pointer!", Formal);
2373 -- Check suspicious return of boolean
2375 elsif Root_Type (F_Type) = Standard_Boolean
2376 and then Convention (F_Type) = Convention_Ada
2379 ("?& is an 8-bit Ada Boolean, "
2380 & "use char in C!", Formal);
2382 -- Check suspicious tagged type
2384 elsif (Is_Tagged_Type (F_Type)
2385 or else (Is_Access_Type (F_Type)
2388 (Designated_Type (F_Type))))
2389 and then Convention (E) = Convention_C
2392 ("?& is a tagged type which does not "
2393 & "correspond to any C type!", Formal);
2395 -- Check wrong convention subprogram pointer
2397 elsif Ekind (F_Type) = E_Access_Subprogram_Type
2398 and then not Has_Foreign_Convention (F_Type)
2401 ("?subprogram pointer & should "
2402 & "have foreign convention!", Formal);
2403 Error_Msg_Sloc := Sloc (F_Type);
2405 ("\?add Convention pragma to declaration of &#",
2409 Error_Msg_Qual_Level := 0;
2412 -- Check for unconstrained array in exported foreign
2415 if Has_Foreign_Convention (E)
2416 and then not Is_Imported (E)
2417 and then Is_Array_Type (F_Type)
2418 and then not Is_Constrained (F_Type)
2419 and then Warn_On_Export_Import
2421 Error_Msg_Qual_Level := 1;
2423 -- If this is an inherited operation, place the
2424 -- warning on the derived type declaration, rather
2425 -- than on the original subprogram.
2427 if Nkind (Original_Node (Parent (E))) =
2428 N_Full_Type_Declaration
2430 Warn_Node := Parent (E);
2432 if Formal = First_Formal (E) then
2434 ("?in inherited operation&", Warn_Node, E);
2437 Warn_Node := Formal;
2441 ("?type of argument& is unconstrained array",
2444 ("?foreign caller must pass bounds explicitly",
2446 Error_Msg_Qual_Level := 0;
2449 -- Ada 2005 (AI-326): Check wrong use of tag incomplete
2450 -- types with unknown discriminants. For example:
2452 -- type T (<>) is tagged;
2453 -- procedure P (X : access T); -- ERROR
2454 -- procedure P (X : T); -- ERROR
2456 if not From_With_Type (F_Type) then
2457 if Is_Access_Type (F_Type) then
2458 F_Type := Designated_Type (F_Type);
2461 if Ekind (F_Type) = E_Incomplete_Type
2462 and then Is_Tagged_Type (F_Type)
2463 and then not Is_Class_Wide_Type (F_Type)
2464 and then No (Full_View (F_Type))
2465 and then Unknown_Discriminants_Present
2467 and then No (Stored_Constraint (F_Type))
2470 ("(Ada 2005): invalid use of unconstrained tagged"
2471 & " incomplete type", E);
2473 -- If the formal is an anonymous_access_to_subprogram
2474 -- freeze the subprogram type as well, to prevent
2475 -- scope anomalies in gigi, because there is no other
2476 -- clear point at which it could be frozen.
2478 elsif Is_Itype (Etype (Formal))
2479 and then Ekind (F_Type) = E_Subprogram_Type
2481 Freeze_And_Append (F_Type, Loc, Result);
2485 Next_Formal (Formal);
2490 if Ekind (E) = E_Function then
2492 -- Freeze return type
2494 R_Type := Etype (E);
2495 Freeze_And_Append (R_Type, Loc, Result);
2497 -- Check suspicious return type for C function
2499 if Warn_On_Export_Import
2500 and then (Convention (E) = Convention_C
2502 Convention (E) = Convention_CPP)
2503 and then (Is_Imported (E) or else Is_Exported (E))
2505 -- Check suspicious return of fat C pointer
2507 if Is_Access_Type (R_Type)
2508 and then Esize (R_Type) > Ttypes.System_Address_Size
2509 and then not Has_Warnings_Off (E)
2510 and then not Has_Warnings_Off (R_Type)
2513 ("?return type of& does not "
2514 & "correspond to C pointer!", E);
2516 -- Check suspicious return of boolean
2518 elsif Root_Type (R_Type) = Standard_Boolean
2519 and then Convention (R_Type) = Convention_Ada
2520 and then not Has_Warnings_Off (E)
2521 and then not Has_Warnings_Off (R_Type)
2524 ("?return type of & is an 8-bit "
2525 & "Ada Boolean, use char in C!", E);
2527 -- Check suspicious return tagged type
2529 elsif (Is_Tagged_Type (R_Type)
2530 or else (Is_Access_Type (R_Type)
2533 (Designated_Type (R_Type))))
2534 and then Convention (E) = Convention_C
2535 and then not Has_Warnings_Off (E)
2536 and then not Has_Warnings_Off (R_Type)
2539 ("?return type of & does not "
2540 & "correspond to C type!", E);
2542 -- Check return of wrong convention subprogram pointer
2544 elsif Ekind (R_Type) = E_Access_Subprogram_Type
2545 and then not Has_Foreign_Convention (R_Type)
2546 and then not Has_Warnings_Off (E)
2547 and then not Has_Warnings_Off (R_Type)
2550 ("?& should return a foreign "
2551 & "convention subprogram pointer", E);
2552 Error_Msg_Sloc := Sloc (R_Type);
2554 ("\?add Convention pragma to declaration of& #",
2559 if Is_Array_Type (Etype (E))
2560 and then not Is_Constrained (Etype (E))
2561 and then not Is_Imported (E)
2562 and then Has_Foreign_Convention (E)
2563 and then Warn_On_Export_Import
2564 and then not Has_Warnings_Off (E)
2565 and then not Has_Warnings_Off (Etype (E))
2568 ("?foreign convention function& should not " &
2569 "return unconstrained array!", E);
2571 -- Ada 2005 (AI-326): Check wrong use of tagged
2574 -- type T is tagged;
2575 -- function F (X : Boolean) return T; -- ERROR
2577 elsif Ekind (Etype (E)) = E_Incomplete_Type
2578 and then Is_Tagged_Type (Etype (E))
2579 and then No (Full_View (Etype (E)))
2580 and then not Is_Value_Type (Etype (E))
2583 ("(Ada 2005): invalid use of tagged incomplete type",
2590 -- Must freeze its parent first if it is a derived subprogram
2592 if Present (Alias (E)) then
2593 Freeze_And_Append (Alias (E), Loc, Result);
2596 -- We don't freeze internal subprograms, because we don't normally
2597 -- want addition of extra formals or mechanism setting to happen
2598 -- for those. However we do pass through predefined dispatching
2599 -- cases, since extra formals may be needed in some cases, such as
2600 -- for the stream 'Input function (build-in-place formals).
2602 if not Is_Internal (E)
2603 or else Is_Predefined_Dispatching_Operation (E)
2605 Freeze_Subprogram (E);
2608 -- Here for other than a subprogram or type
2611 -- If entity has a type, and it is not a generic unit, then
2612 -- freeze it first (RM 13.14(10)).
2614 if Present (Etype (E))
2615 and then Ekind (E) /= E_Generic_Function
2617 Freeze_And_Append (Etype (E), Loc, Result);
2620 -- Special processing for objects created by object declaration
2622 if Nkind (Declaration_Node (E)) = N_Object_Declaration then
2624 -- For object created by object declaration, perform required
2625 -- categorization (preelaborate and pure) checks. Defer these
2626 -- checks to freeze time since pragma Import inhibits default
2627 -- initialization and thus pragma Import affects these checks.
2629 Validate_Object_Declaration (Declaration_Node (E));
2631 -- If there is an address clause, check it is valid
2633 Check_Address_Clause (E);
2635 -- For imported objects, set Is_Public unless there is also an
2636 -- address clause, which means that there is no external symbol
2637 -- needed for the Import (Is_Public may still be set for other
2638 -- unrelated reasons). Note that we delayed this processing
2639 -- till freeze time so that we can be sure not to set the flag
2640 -- if there is an address clause. If there is such a clause,
2641 -- then the only purpose of the Import pragma is to suppress
2642 -- implicit initialization.
2645 and then No (Address_Clause (E))
2650 -- For convention C objects of an enumeration type, warn if
2651 -- the size is not integer size and no explicit size given.
2652 -- Skip warning for Boolean, and Character, assume programmer
2653 -- expects 8-bit sizes for these cases.
2655 if (Convention (E) = Convention_C
2657 Convention (E) = Convention_CPP)
2658 and then Is_Enumeration_Type (Etype (E))
2659 and then not Is_Character_Type (Etype (E))
2660 and then not Is_Boolean_Type (Etype (E))
2661 and then Esize (Etype (E)) < Standard_Integer_Size
2662 and then not Has_Size_Clause (E)
2664 Error_Msg_Uint_1 := UI_From_Int (Standard_Integer_Size);
2666 ("?convention C enumeration object has size less than ^",
2668 Error_Msg_N ("\?use explicit size clause to set size", E);
2672 -- Check that a constant which has a pragma Volatile[_Components]
2673 -- or Atomic[_Components] also has a pragma Import (RM C.6(13)).
2675 -- Note: Atomic[_Components] also sets Volatile[_Components]
2677 if Ekind (E) = E_Constant
2678 and then (Has_Volatile_Components (E) or else Is_Volatile (E))
2679 and then not Is_Imported (E)
2681 -- Make sure we actually have a pragma, and have not merely
2682 -- inherited the indication from elsewhere (e.g. an address
2683 -- clause, which is not good enough in RM terms!)
2685 if Has_Rep_Pragma (E, Name_Atomic)
2687 Has_Rep_Pragma (E, Name_Atomic_Components)
2690 ("stand alone atomic constant must be " &
2691 "imported (RM C.6(13))", E);
2693 elsif Has_Rep_Pragma (E, Name_Volatile)
2695 Has_Rep_Pragma (E, Name_Volatile_Components)
2698 ("stand alone volatile constant must be " &
2699 "imported (RM C.6(13))", E);
2703 -- Static objects require special handling
2705 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
2706 and then Is_Statically_Allocated (E)
2708 Freeze_Static_Object (E);
2711 -- Remaining step is to layout objects
2713 if Ekind (E) = E_Variable
2715 Ekind (E) = E_Constant
2717 Ekind (E) = E_Loop_Parameter
2725 -- Case of a type or subtype being frozen
2728 -- We used to check here that a full type must have preelaborable
2729 -- initialization if it completes a private type specified with
2730 -- pragma Preelaborable_Intialization, but that missed cases where
2731 -- the types occur within a generic package, since the freezing
2732 -- that occurs within a containing scope generally skips traversal
2733 -- of a generic unit's declarations (those will be frozen within
2734 -- instances). This check was moved to Analyze_Package_Specification.
2736 -- The type may be defined in a generic unit. This can occur when
2737 -- freezing a generic function that returns the type (which is
2738 -- defined in a parent unit). It is clearly meaningless to freeze
2739 -- this type. However, if it is a subtype, its size may be determi-
2740 -- nable and used in subsequent checks, so might as well try to
2743 if Present (Scope (E))
2744 and then Is_Generic_Unit (Scope (E))
2746 Check_Compile_Time_Size (E);
2750 -- Deal with special cases of freezing for subtype
2752 if E /= Base_Type (E) then
2754 -- Before we do anything else, a specialized test for the case of
2755 -- a size given for an array where the array needs to be packed,
2756 -- but was not so the size cannot be honored. This would of course
2757 -- be caught by the backend, and indeed we don't catch all cases.
2758 -- The point is that we can give a better error message in those
2759 -- cases that we do catch with the circuitry here. Also if pragma
2760 -- Implicit_Packing is set, this is where the packing occurs.
2762 -- The reason we do this so early is that the processing in the
2763 -- automatic packing case affects the layout of the base type, so
2764 -- it must be done before we freeze the base type.
2766 if Is_Array_Type (E) then
2769 Ctyp : constant Entity_Id := Component_Type (E);
2772 -- Check enabling conditions. These are straightforward
2773 -- except for the test for a limited composite type. This
2774 -- eliminates the rare case of a array of limited components
2775 -- where there are issues of whether or not we can go ahead
2776 -- and pack the array (since we can't freely pack and unpack
2777 -- arrays if they are limited).
2779 -- Note that we check the root type explicitly because the
2780 -- whole point is we are doing this test before we have had
2781 -- a chance to freeze the base type (and it is that freeze
2782 -- action that causes stuff to be inherited).
2784 if Present (Size_Clause (E))
2785 and then Known_Static_Esize (E)
2786 and then not Is_Packed (E)
2787 and then not Has_Pragma_Pack (E)
2788 and then Number_Dimensions (E) = 1
2789 and then not Has_Component_Size_Clause (E)
2790 and then Known_Static_Esize (Ctyp)
2791 and then not Is_Limited_Composite (E)
2792 and then not Is_Packed (Root_Type (E))
2793 and then not Has_Component_Size_Clause (Root_Type (E))
2795 Get_Index_Bounds (First_Index (E), Lo, Hi);
2797 if Compile_Time_Known_Value (Lo)
2798 and then Compile_Time_Known_Value (Hi)
2799 and then Known_Static_RM_Size (Ctyp)
2800 and then RM_Size (Ctyp) < 64
2803 Lov : constant Uint := Expr_Value (Lo);
2804 Hiv : constant Uint := Expr_Value (Hi);
2805 Len : constant Uint := UI_Max
2808 Rsiz : constant Uint := RM_Size (Ctyp);
2809 SZ : constant Node_Id := Size_Clause (E);
2810 Btyp : constant Entity_Id := Base_Type (E);
2812 -- What we are looking for here is the situation where
2813 -- the RM_Size given would be exactly right if there
2814 -- was a pragma Pack (resulting in the component size
2815 -- being the same as the RM_Size). Furthermore, the
2816 -- component type size must be an odd size (not a
2817 -- multiple of storage unit)
2820 if RM_Size (E) = Len * Rsiz
2821 and then Rsiz mod System_Storage_Unit /= 0
2823 -- For implicit packing mode, just set the
2824 -- component size silently
2826 if Implicit_Packing then
2827 Set_Component_Size (Btyp, Rsiz);
2828 Set_Is_Bit_Packed_Array (Btyp);
2829 Set_Is_Packed (Btyp);
2830 Set_Has_Non_Standard_Rep (Btyp);
2832 -- Otherwise give an error message
2836 ("size given for& too small", SZ, E);
2838 ("\use explicit pragma Pack "
2839 & "or use pragma Implicit_Packing", SZ);
2848 -- If ancestor subtype present, freeze that first. Note that this
2849 -- will also get the base type frozen.
2851 Atype := Ancestor_Subtype (E);
2853 if Present (Atype) then
2854 Freeze_And_Append (Atype, Loc, Result);
2856 -- Otherwise freeze the base type of the entity before freezing
2857 -- the entity itself (RM 13.14(15)).
2859 elsif E /= Base_Type (E) then
2860 Freeze_And_Append (Base_Type (E), Loc, Result);
2863 -- For a derived type, freeze its parent type first (RM 13.14(15))
2865 elsif Is_Derived_Type (E) then
2866 Freeze_And_Append (Etype (E), Loc, Result);
2867 Freeze_And_Append (First_Subtype (Etype (E)), Loc, Result);
2870 -- For array type, freeze index types and component type first
2871 -- before freezing the array (RM 13.14(15)).
2873 if Is_Array_Type (E) then
2875 Ctyp : constant Entity_Id := Component_Type (E);
2877 Non_Standard_Enum : Boolean := False;
2878 -- Set true if any of the index types is an enumeration type
2879 -- with a non-standard representation.
2882 Freeze_And_Append (Ctyp, Loc, Result);
2884 Indx := First_Index (E);
2885 while Present (Indx) loop
2886 Freeze_And_Append (Etype (Indx), Loc, Result);
2888 if Is_Enumeration_Type (Etype (Indx))
2889 and then Has_Non_Standard_Rep (Etype (Indx))
2891 Non_Standard_Enum := True;
2897 -- Processing that is done only for base types
2899 if Ekind (E) = E_Array_Type then
2901 -- Propagate flags for component type
2903 if Is_Controlled (Component_Type (E))
2904 or else Has_Controlled_Component (Ctyp)
2906 Set_Has_Controlled_Component (E);
2909 if Has_Unchecked_Union (Component_Type (E)) then
2910 Set_Has_Unchecked_Union (E);
2913 -- If packing was requested or if the component size was set
2914 -- explicitly, then see if bit packing is required. This
2915 -- processing is only done for base types, since all the
2916 -- representation aspects involved are type-related. This
2917 -- is not just an optimization, if we start processing the
2918 -- subtypes, they intefere with the settings on the base
2919 -- type (this is because Is_Packed has a slightly different
2920 -- meaning before and after freezing).
2927 if (Is_Packed (E) or else Has_Pragma_Pack (E))
2928 and then not Has_Atomic_Components (E)
2929 and then Known_Static_RM_Size (Ctyp)
2931 Csiz := UI_Max (RM_Size (Ctyp), 1);
2933 elsif Known_Component_Size (E) then
2934 Csiz := Component_Size (E);
2936 elsif not Known_Static_Esize (Ctyp) then
2940 Esiz := Esize (Ctyp);
2942 -- We can set the component size if it is less than
2943 -- 16, rounding it up to the next storage unit size.
2947 elsif Esiz <= 16 then
2953 -- Set component size up to match alignment if it
2954 -- would otherwise be less than the alignment. This
2955 -- deals with cases of types whose alignment exceeds
2956 -- their size (padded types).
2960 A : constant Uint := Alignment_In_Bits (Ctyp);
2969 -- Case of component size that may result in packing
2971 if 1 <= Csiz and then Csiz <= 64 then
2973 Ent : constant Entity_Id :=
2975 Pack_Pragma : constant Node_Id :=
2976 Get_Rep_Pragma (Ent, Name_Pack);
2977 Comp_Size_C : constant Node_Id :=
2978 Get_Attribute_Definition_Clause
2979 (Ent, Attribute_Component_Size);
2981 -- Warn if we have pack and component size so that
2982 -- the pack is ignored.
2984 -- Note: here we must check for the presence of a
2985 -- component size before checking for a Pack pragma
2986 -- to deal with the case where the array type is a
2987 -- derived type whose parent is currently private.
2989 if Present (Comp_Size_C)
2990 and then Has_Pragma_Pack (Ent)
2992 Error_Msg_Sloc := Sloc (Comp_Size_C);
2994 ("?pragma Pack for& ignored!",
2997 ("\?explicit component size given#!",
3001 -- Set component size if not already set by a
3002 -- component size clause.
3004 if not Present (Comp_Size_C) then
3005 Set_Component_Size (E, Csiz);
3008 -- Check for base type of 8, 16, 32 bits, where an
3009 -- unsigned subtype has a length one less than the
3010 -- base type (e.g. Natural subtype of Integer).
3012 -- In such cases, if a component size was not set
3013 -- explicitly, then generate a warning.
3015 if Has_Pragma_Pack (E)
3016 and then not Present (Comp_Size_C)
3018 (Csiz = 7 or else Csiz = 15 or else Csiz = 31)
3019 and then Esize (Base_Type (Ctyp)) = Csiz + 1
3021 Error_Msg_Uint_1 := Csiz;
3023 if Present (Pack_Pragma) then
3025 ("?pragma Pack causes component size "
3026 & "to be ^!", Pack_Pragma);
3028 ("\?use Component_Size to set "
3029 & "desired value!", Pack_Pragma);
3033 -- Actual packing is not needed for 8, 16, 32, 64.
3034 -- Also not needed for 24 if alignment is 1.
3040 or else (Csiz = 24 and then Alignment (Ctyp) = 1)
3042 -- Here the array was requested to be packed,
3043 -- but the packing request had no effect, so
3044 -- Is_Packed is reset.
3046 -- Note: semantically this means that we lose
3047 -- track of the fact that a derived type
3048 -- inherited a pragma Pack that was non-
3049 -- effective, but that seems fine.
3051 -- We regard a Pack pragma as a request to set
3052 -- a representation characteristic, and this
3053 -- request may be ignored.
3055 Set_Is_Packed (Base_Type (E), False);
3057 -- In all other cases, packing is indeed needed
3060 Set_Has_Non_Standard_Rep (Base_Type (E));
3061 Set_Is_Bit_Packed_Array (Base_Type (E));
3062 Set_Is_Packed (Base_Type (E));
3068 -- Processing that is done only for subtypes
3071 -- Acquire alignment from base type
3073 if Unknown_Alignment (E) then
3074 Set_Alignment (E, Alignment (Base_Type (E)));
3075 Adjust_Esize_Alignment (E);
3079 -- For bit-packed arrays, check the size
3081 if Is_Bit_Packed_Array (E)
3082 and then Known_RM_Size (E)
3085 SizC : constant Node_Id := Size_Clause (E);
3088 pragma Warnings (Off, Discard);
3091 -- It is not clear if it is possible to have no size
3092 -- clause at this stage, but it is not worth worrying
3093 -- about. Post error on the entity name in the size
3094 -- clause if present, else on the type entity itself.
3096 if Present (SizC) then
3097 Check_Size (Name (SizC), E, RM_Size (E), Discard);
3099 Check_Size (E, E, RM_Size (E), Discard);
3104 -- If any of the index types was an enumeration type with
3105 -- a non-standard rep clause, then we indicate that the
3106 -- array type is always packed (even if it is not bit packed).
3108 if Non_Standard_Enum then
3109 Set_Has_Non_Standard_Rep (Base_Type (E));
3110 Set_Is_Packed (Base_Type (E));
3113 Set_Component_Alignment_If_Not_Set (E);
3115 -- If the array is packed, we must create the packed array
3116 -- type to be used to actually implement the type. This is
3117 -- only needed for real array types (not for string literal
3118 -- types, since they are present only for the front end).
3121 and then Ekind (E) /= E_String_Literal_Subtype
3123 Create_Packed_Array_Type (E);
3124 Freeze_And_Append (Packed_Array_Type (E), Loc, Result);
3126 -- Size information of packed array type is copied to the
3127 -- array type, since this is really the representation. But
3128 -- do not override explicit existing size values. If the
3129 -- ancestor subtype is constrained the packed_array_type
3130 -- will be inherited from it, but the size may have been
3131 -- provided already, and must not be overridden either.
3133 if not Has_Size_Clause (E)
3135 (No (Ancestor_Subtype (E))
3136 or else not Has_Size_Clause (Ancestor_Subtype (E)))
3138 Set_Esize (E, Esize (Packed_Array_Type (E)));
3139 Set_RM_Size (E, RM_Size (Packed_Array_Type (E)));
3142 if not Has_Alignment_Clause (E) then
3143 Set_Alignment (E, Alignment (Packed_Array_Type (E)));
3147 -- For non-packed arrays set the alignment of the array to the
3148 -- alignment of the component type if it is unknown. Skip this
3149 -- in atomic case (atomic arrays may need larger alignments).
3151 if not Is_Packed (E)
3152 and then Unknown_Alignment (E)
3153 and then Known_Alignment (Ctyp)
3154 and then Known_Static_Component_Size (E)
3155 and then Known_Static_Esize (Ctyp)
3156 and then Esize (Ctyp) = Component_Size (E)
3157 and then not Is_Atomic (E)
3159 Set_Alignment (E, Alignment (Component_Type (E)));
3163 -- For a class-wide type, the corresponding specific type is
3164 -- frozen as well (RM 13.14(15))
3166 elsif Is_Class_Wide_Type (E) then
3167 Freeze_And_Append (Root_Type (E), Loc, Result);
3169 -- If the base type of the class-wide type is still incomplete,
3170 -- the class-wide remains unfrozen as well. This is legal when
3171 -- E is the formal of a primitive operation of some other type
3172 -- which is being frozen.
3174 if not Is_Frozen (Root_Type (E)) then
3175 Set_Is_Frozen (E, False);
3179 -- If the Class_Wide_Type is an Itype (when type is the anonymous
3180 -- parent of a derived type) and it is a library-level entity,
3181 -- generate an itype reference for it. Otherwise, its first
3182 -- explicit reference may be in an inner scope, which will be
3183 -- rejected by the back-end.
3186 and then Is_Compilation_Unit (Scope (E))
3189 Ref : constant Node_Id := Make_Itype_Reference (Loc);
3194 Result := New_List (Ref);
3196 Append (Ref, Result);
3201 -- The equivalent type associated with a class-wide subtype needs
3202 -- to be frozen to ensure that its layout is done. Class-wide
3203 -- subtypes are currently only frozen on targets requiring
3204 -- front-end layout (see New_Class_Wide_Subtype and
3205 -- Make_CW_Equivalent_Type in exp_util.adb).
3207 if Ekind (E) = E_Class_Wide_Subtype
3208 and then Present (Equivalent_Type (E))
3210 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3213 -- For a record (sub)type, freeze all the component types (RM
3214 -- 13.14(15). We test for E_Record_(sub)Type here, rather than using
3215 -- Is_Record_Type, because we don't want to attempt the freeze for
3216 -- the case of a private type with record extension (we will do that
3217 -- later when the full type is frozen).
3219 elsif Ekind (E) = E_Record_Type
3220 or else Ekind (E) = E_Record_Subtype
3222 Freeze_Record_Type (E);
3224 -- For a concurrent type, freeze corresponding record type. This
3225 -- does not correpond to any specific rule in the RM, but the
3226 -- record type is essentially part of the concurrent type.
3227 -- Freeze as well all local entities. This includes record types
3228 -- created for entry parameter blocks, and whatever local entities
3229 -- may appear in the private part.
3231 elsif Is_Concurrent_Type (E) then
3232 if Present (Corresponding_Record_Type (E)) then
3234 (Corresponding_Record_Type (E), Loc, Result);
3237 Comp := First_Entity (E);
3239 while Present (Comp) loop
3240 if Is_Type (Comp) then
3241 Freeze_And_Append (Comp, Loc, Result);
3243 elsif (Ekind (Comp)) /= E_Function then
3244 if Is_Itype (Etype (Comp))
3245 and then Underlying_Type (Scope (Etype (Comp))) = E
3247 Undelay_Type (Etype (Comp));
3250 Freeze_And_Append (Etype (Comp), Loc, Result);
3256 -- Private types are required to point to the same freeze node as
3257 -- their corresponding full views. The freeze node itself has to
3258 -- point to the partial view of the entity (because from the partial
3259 -- view, we can retrieve the full view, but not the reverse).
3260 -- However, in order to freeze correctly, we need to freeze the full
3261 -- view. If we are freezing at the end of a scope (or within the
3262 -- scope of the private type), the partial and full views will have
3263 -- been swapped, the full view appears first in the entity chain and
3264 -- the swapping mechanism ensures that the pointers are properly set
3267 -- If we encounter the partial view before the full view (e.g. when
3268 -- freezing from another scope), we freeze the full view, and then
3269 -- set the pointers appropriately since we cannot rely on swapping to
3270 -- fix things up (subtypes in an outer scope might not get swapped).
3272 elsif Is_Incomplete_Or_Private_Type (E)
3273 and then not Is_Generic_Type (E)
3275 -- The construction of the dispatch table associated with library
3276 -- level tagged types forces freezing of all the primitives of the
3277 -- type, which may cause premature freezing of the partial view.
3281 -- type T is tagged private;
3282 -- type DT is new T with private;
3283 -- procedure Prim (X : in out T; Y : in out DT'class);
3285 -- type T is tagged null record;
3287 -- type DT is new T with null record;
3290 -- In this case the type will be frozen later by the usual
3291 -- mechanism: an object declaration, an instantiation, or the
3292 -- end of a declarative part.
3294 if Is_Library_Level_Tagged_Type (E)
3295 and then not Present (Full_View (E))
3297 Set_Is_Frozen (E, False);
3300 -- Case of full view present
3302 elsif Present (Full_View (E)) then
3304 -- If full view has already been frozen, then no further
3305 -- processing is required
3307 if Is_Frozen (Full_View (E)) then
3309 Set_Has_Delayed_Freeze (E, False);
3310 Set_Freeze_Node (E, Empty);
3311 Check_Debug_Info_Needed (E);
3313 -- Otherwise freeze full view and patch the pointers so that
3314 -- the freeze node will elaborate both views in the back-end.
3318 Full : constant Entity_Id := Full_View (E);
3321 if Is_Private_Type (Full)
3322 and then Present (Underlying_Full_View (Full))
3325 (Underlying_Full_View (Full), Loc, Result);
3328 Freeze_And_Append (Full, Loc, Result);
3330 if Has_Delayed_Freeze (E) then
3331 F_Node := Freeze_Node (Full);
3333 if Present (F_Node) then
3334 Set_Freeze_Node (E, F_Node);
3335 Set_Entity (F_Node, E);
3338 -- {Incomplete,Private}_Subtypes with Full_Views
3339 -- constrained by discriminants.
3341 Set_Has_Delayed_Freeze (E, False);
3342 Set_Freeze_Node (E, Empty);
3347 Check_Debug_Info_Needed (E);
3350 -- AI-117 requires that the convention of a partial view be the
3351 -- same as the convention of the full view. Note that this is a
3352 -- recognized breach of privacy, but it's essential for logical
3353 -- consistency of representation, and the lack of a rule in
3354 -- RM95 was an oversight.
3356 Set_Convention (E, Convention (Full_View (E)));
3358 Set_Size_Known_At_Compile_Time (E,
3359 Size_Known_At_Compile_Time (Full_View (E)));
3361 -- Size information is copied from the full view to the
3362 -- incomplete or private view for consistency.
3364 -- We skip this is the full view is not a type. This is very
3365 -- strange of course, and can only happen as a result of
3366 -- certain illegalities, such as a premature attempt to derive
3367 -- from an incomplete type.
3369 if Is_Type (Full_View (E)) then
3370 Set_Size_Info (E, Full_View (E));
3371 Set_RM_Size (E, RM_Size (Full_View (E)));
3376 -- Case of no full view present. If entity is derived or subtype,
3377 -- it is safe to freeze, correctness depends on the frozen status
3378 -- of parent. Otherwise it is either premature usage, or a Taft
3379 -- amendment type, so diagnosis is at the point of use and the
3380 -- type might be frozen later.
3382 elsif E /= Base_Type (E)
3383 or else Is_Derived_Type (E)
3388 Set_Is_Frozen (E, False);
3392 -- For access subprogram, freeze types of all formals, the return
3393 -- type was already frozen, since it is the Etype of the function.
3395 elsif Ekind (E) = E_Subprogram_Type then
3396 Formal := First_Formal (E);
3397 while Present (Formal) loop
3398 Freeze_And_Append (Etype (Formal), Loc, Result);
3399 Next_Formal (Formal);
3402 Freeze_Subprogram (E);
3404 -- Ada 2005 (AI-326): Check wrong use of tag incomplete type
3406 -- type T is tagged;
3407 -- type Acc is access function (X : T) return T; -- ERROR
3409 if Ekind (Etype (E)) = E_Incomplete_Type
3410 and then Is_Tagged_Type (Etype (E))
3411 and then No (Full_View (Etype (E)))
3412 and then not Is_Value_Type (Etype (E))
3415 ("(Ada 2005): invalid use of tagged incomplete type", E);
3418 -- For access to a protected subprogram, freeze the equivalent type
3419 -- (however this is not set if we are not generating code or if this
3420 -- is an anonymous type used just for resolution).
3422 elsif Is_Access_Protected_Subprogram_Type (E) then
3424 -- AI-326: Check wrong use of tagged incomplete types
3426 -- type T is tagged;
3427 -- type As3D is access protected
3428 -- function (X : Float) return T; -- ERROR
3434 Etyp := Etype (Directly_Designated_Type (E));
3436 if Is_Class_Wide_Type (Etyp) then
3437 Etyp := Etype (Etyp);
3440 if Ekind (Etyp) = E_Incomplete_Type
3441 and then Is_Tagged_Type (Etyp)
3442 and then No (Full_View (Etyp))
3443 and then not Is_Value_Type (Etype (E))
3446 ("(Ada 2005): invalid use of tagged incomplete type", E);
3450 if Present (Equivalent_Type (E)) then
3451 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3455 -- Generic types are never seen by the back-end, and are also not
3456 -- processed by the expander (since the expander is turned off for
3457 -- generic processing), so we never need freeze nodes for them.
3459 if Is_Generic_Type (E) then
3463 -- Some special processing for non-generic types to complete
3464 -- representation details not known till the freeze point.
3466 if Is_Fixed_Point_Type (E) then
3467 Freeze_Fixed_Point_Type (E);
3469 -- Some error checks required for ordinary fixed-point type. Defer
3470 -- these till the freeze-point since we need the small and range
3471 -- values. We only do these checks for base types
3473 if Is_Ordinary_Fixed_Point_Type (E)
3474 and then E = Base_Type (E)
3476 if Small_Value (E) < Ureal_2_M_80 then
3477 Error_Msg_Name_1 := Name_Small;
3479 ("`&''%` too small, minimum allowed is 2.0'*'*(-80)", E);
3481 elsif Small_Value (E) > Ureal_2_80 then
3482 Error_Msg_Name_1 := Name_Small;
3484 ("`&''%` too large, maximum allowed is 2.0'*'*80", E);
3487 if Expr_Value_R (Type_Low_Bound (E)) < Ureal_M_10_36 then
3488 Error_Msg_Name_1 := Name_First;
3490 ("`&''%` too small, minimum allowed is -10.0'*'*36", E);
3493 if Expr_Value_R (Type_High_Bound (E)) > Ureal_10_36 then
3494 Error_Msg_Name_1 := Name_Last;
3496 ("`&''%` too large, maximum allowed is 10.0'*'*36", E);
3500 elsif Is_Enumeration_Type (E) then
3501 Freeze_Enumeration_Type (E);
3503 elsif Is_Integer_Type (E) then
3504 Adjust_Esize_For_Alignment (E);
3506 elsif Is_Access_Type (E) then
3508 -- Check restriction for standard storage pool
3510 if No (Associated_Storage_Pool (E)) then
3511 Check_Restriction (No_Standard_Storage_Pools, E);
3514 -- Deal with error message for pure access type. This is not an
3515 -- error in Ada 2005 if there is no pool (see AI-366).
3517 if Is_Pure_Unit_Access_Type (E)
3518 and then (Ada_Version < Ada_05
3519 or else not No_Pool_Assigned (E))
3521 Error_Msg_N ("named access type not allowed in pure unit", E);
3525 -- Case of composite types
3527 if Is_Composite_Type (E) then
3529 -- AI-117 requires that all new primitives of a tagged type must
3530 -- inherit the convention of the full view of the type. Inherited
3531 -- and overriding operations are defined to inherit the convention
3532 -- of their parent or overridden subprogram (also specified in
3533 -- AI-117), which will have occurred earlier (in Derive_Subprogram
3534 -- and New_Overloaded_Entity). Here we set the convention of
3535 -- primitives that are still convention Ada, which will ensure
3536 -- that any new primitives inherit the type's convention. Class-
3537 -- wide types can have a foreign convention inherited from their
3538 -- specific type, but are excluded from this since they don't have
3539 -- any associated primitives.
3541 if Is_Tagged_Type (E)
3542 and then not Is_Class_Wide_Type (E)
3543 and then Convention (E) /= Convention_Ada
3546 Prim_List : constant Elist_Id := Primitive_Operations (E);
3549 Prim := First_Elmt (Prim_List);
3550 while Present (Prim) loop
3551 if Convention (Node (Prim)) = Convention_Ada then
3552 Set_Convention (Node (Prim), Convention (E));
3561 -- Generate primitive operation references for a tagged type
3563 if Is_Tagged_Type (E)
3564 and then not Is_Class_Wide_Type (E)
3567 Prim_List : Elist_Id;
3575 if Ekind (E) = E_Protected_Subtype
3576 or else Ekind (E) = E_Task_Subtype
3583 -- Ada 2005 (AI-345): In case of concurrent type generate
3584 -- reference to the wrapper that allow us to dispatch calls
3585 -- through their implemented abstract interface types.
3587 -- The check for Present here is to protect against previously
3588 -- reported critical errors.
3590 if Is_Concurrent_Type (Aux_E)
3591 and then Present (Corresponding_Record_Type (Aux_E))
3593 Prim_List := Primitive_Operations
3594 (Corresponding_Record_Type (Aux_E));
3596 Prim_List := Primitive_Operations (Aux_E);
3599 -- Loop to generate references for primitive operations
3601 if Present (Prim_List) then
3602 Prim := First_Elmt (Prim_List);
3603 while Present (Prim) loop
3605 -- If the operation is derived, get the original for
3606 -- cross-reference purposes (it is the original for
3607 -- which we want the xref, and for which the comes
3608 -- from source test needs to be performed).
3611 while Present (Alias (Ent)) loop
3615 Generate_Reference (E, Ent, 'p', Set_Ref => False);
3622 -- Now that all types from which E may depend are frozen, see if the
3623 -- size is known at compile time, if it must be unsigned, or if
3624 -- strict alignment is required
3626 Check_Compile_Time_Size (E);
3627 Check_Unsigned_Type (E);
3629 if Base_Type (E) = E then
3630 Check_Strict_Alignment (E);
3633 -- Do not allow a size clause for a type which does not have a size
3634 -- that is known at compile time
3636 if Has_Size_Clause (E)
3637 and then not Size_Known_At_Compile_Time (E)
3639 -- Supress this message if errors posted on E, even if we are
3640 -- in all errors mode, since this is often a junk message
3642 if not Error_Posted (E) then
3644 ("size clause not allowed for variable length type",
3649 -- Remaining process is to set/verify the representation information,
3650 -- in particular the size and alignment values. This processing is
3651 -- not required for generic types, since generic types do not play
3652 -- any part in code generation, and so the size and alignment values
3653 -- for such types are irrelevant.
3655 if Is_Generic_Type (E) then
3658 -- Otherwise we call the layout procedure
3664 -- End of freeze processing for type entities
3667 -- Here is where we logically freeze the current entity. If it has a
3668 -- freeze node, then this is the point at which the freeze node is
3669 -- linked into the result list.
3671 if Has_Delayed_Freeze (E) then
3673 -- If a freeze node is already allocated, use it, otherwise allocate
3674 -- a new one. The preallocation happens in the case of anonymous base
3675 -- types, where we preallocate so that we can set First_Subtype_Link.
3676 -- Note that we reset the Sloc to the current freeze location.
3678 if Present (Freeze_Node (E)) then
3679 F_Node := Freeze_Node (E);
3680 Set_Sloc (F_Node, Loc);
3683 F_Node := New_Node (N_Freeze_Entity, Loc);
3684 Set_Freeze_Node (E, F_Node);
3685 Set_Access_Types_To_Process (F_Node, No_Elist);
3686 Set_TSS_Elist (F_Node, No_Elist);
3687 Set_Actions (F_Node, No_List);
3690 Set_Entity (F_Node, E);
3692 if Result = No_List then
3693 Result := New_List (F_Node);
3695 Append (F_Node, Result);
3698 -- A final pass over record types with discriminants. If the type
3699 -- has an incomplete declaration, there may be constrained access
3700 -- subtypes declared elsewhere, which do not depend on the discrimi-
3701 -- nants of the type, and which are used as component types (i.e.
3702 -- the full view is a recursive type). The designated types of these
3703 -- subtypes can only be elaborated after the type itself, and they
3704 -- need an itype reference.
3706 if Ekind (E) = E_Record_Type
3707 and then Has_Discriminants (E)
3715 Comp := First_Component (E);
3717 while Present (Comp) loop
3718 Typ := Etype (Comp);
3720 if Ekind (Comp) = E_Component
3721 and then Is_Access_Type (Typ)
3722 and then Scope (Typ) /= E
3723 and then Base_Type (Designated_Type (Typ)) = E
3724 and then Is_Itype (Designated_Type (Typ))
3726 IR := Make_Itype_Reference (Sloc (Comp));
3727 Set_Itype (IR, Designated_Type (Typ));
3728 Append (IR, Result);
3731 Next_Component (Comp);
3737 -- When a type is frozen, the first subtype of the type is frozen as
3738 -- well (RM 13.14(15)). This has to be done after freezing the type,
3739 -- since obviously the first subtype depends on its own base type.
3742 Freeze_And_Append (First_Subtype (E), Loc, Result);
3744 -- If we just froze a tagged non-class wide record, then freeze the
3745 -- corresponding class-wide type. This must be done after the tagged
3746 -- type itself is frozen, because the class-wide type refers to the
3747 -- tagged type which generates the class.
3749 if Is_Tagged_Type (E)
3750 and then not Is_Class_Wide_Type (E)
3751 and then Present (Class_Wide_Type (E))
3753 Freeze_And_Append (Class_Wide_Type (E), Loc, Result);
3757 Check_Debug_Info_Needed (E);
3759 -- Special handling for subprograms
3761 if Is_Subprogram (E) then
3763 -- If subprogram has address clause then reset Is_Public flag, since
3764 -- we do not want the backend to generate external references.
3766 if Present (Address_Clause (E))
3767 and then not Is_Library_Level_Entity (E)
3769 Set_Is_Public (E, False);
3771 -- If no address clause and not intrinsic, then for imported
3772 -- subprogram in main unit, generate descriptor if we are in
3773 -- Propagate_Exceptions mode.
3775 elsif Propagate_Exceptions
3776 and then Is_Imported (E)
3777 and then not Is_Intrinsic_Subprogram (E)
3778 and then Convention (E) /= Convention_Stubbed
3780 if Result = No_List then
3781 Result := Empty_List;
3789 -----------------------------
3790 -- Freeze_Enumeration_Type --
3791 -----------------------------
3793 procedure Freeze_Enumeration_Type (Typ : Entity_Id) is
3795 if Has_Foreign_Convention (Typ)
3796 and then not Has_Size_Clause (Typ)
3797 and then Esize (Typ) < Standard_Integer_Size
3799 Init_Esize (Typ, Standard_Integer_Size);
3801 Adjust_Esize_For_Alignment (Typ);
3803 end Freeze_Enumeration_Type;
3805 -----------------------
3806 -- Freeze_Expression --
3807 -----------------------
3809 procedure Freeze_Expression (N : Node_Id) is
3810 In_Def_Exp : constant Boolean := In_Default_Expression;
3813 Desig_Typ : Entity_Id;
3817 Freeze_Outside : Boolean := False;
3818 -- This flag is set true if the entity must be frozen outside the
3819 -- current subprogram. This happens in the case of expander generated
3820 -- subprograms (_Init_Proc, _Input, _Output, _Read, _Write) which do
3821 -- not freeze all entities like other bodies, but which nevertheless
3822 -- may reference entities that have to be frozen before the body and
3823 -- obviously cannot be frozen inside the body.
3825 function In_Exp_Body (N : Node_Id) return Boolean;
3826 -- Given an N_Handled_Sequence_Of_Statements node N, determines whether
3827 -- it is the handled statement sequence of an expander-generated
3828 -- subprogram (init proc, stream subprogram, or renaming as body).
3829 -- If so, this is not a freezing context.
3835 function In_Exp_Body (N : Node_Id) return Boolean is
3840 if Nkind (N) = N_Subprogram_Body then
3846 if Nkind (P) /= N_Subprogram_Body then
3850 Id := Defining_Unit_Name (Specification (P));
3852 if Nkind (Id) = N_Defining_Identifier
3853 and then (Is_Init_Proc (Id) or else
3854 Is_TSS (Id, TSS_Stream_Input) or else
3855 Is_TSS (Id, TSS_Stream_Output) or else
3856 Is_TSS (Id, TSS_Stream_Read) or else
3857 Is_TSS (Id, TSS_Stream_Write) or else
3858 Nkind (Original_Node (P)) =
3859 N_Subprogram_Renaming_Declaration)
3868 -- Start of processing for Freeze_Expression
3871 -- Immediate return if freezing is inhibited. This flag is set by the
3872 -- analyzer to stop freezing on generated expressions that would cause
3873 -- freezing if they were in the source program, but which are not
3874 -- supposed to freeze, since they are created.
3876 if Must_Not_Freeze (N) then
3880 -- If expression is non-static, then it does not freeze in a default
3881 -- expression, see section "Handling of Default Expressions" in the
3882 -- spec of package Sem for further details. Note that we have to
3883 -- make sure that we actually have a real expression (if we have
3884 -- a subtype indication, we can't test Is_Static_Expression!)
3887 and then Nkind (N) in N_Subexpr
3888 and then not Is_Static_Expression (N)
3893 -- Freeze type of expression if not frozen already
3897 if Nkind (N) in N_Has_Etype then
3898 if not Is_Frozen (Etype (N)) then
3901 -- Base type may be an derived numeric type that is frozen at
3902 -- the point of declaration, but first_subtype is still unfrozen.
3904 elsif not Is_Frozen (First_Subtype (Etype (N))) then
3905 Typ := First_Subtype (Etype (N));
3909 -- For entity name, freeze entity if not frozen already. A special
3910 -- exception occurs for an identifier that did not come from source.
3911 -- We don't let such identifiers freeze a non-internal entity, i.e.
3912 -- an entity that did come from source, since such an identifier was
3913 -- generated by the expander, and cannot have any semantic effect on
3914 -- the freezing semantics. For example, this stops the parameter of
3915 -- an initialization procedure from freezing the variable.
3917 if Is_Entity_Name (N)
3918 and then not Is_Frozen (Entity (N))
3919 and then (Nkind (N) /= N_Identifier
3920 or else Comes_From_Source (N)
3921 or else not Comes_From_Source (Entity (N)))
3928 -- For an allocator freeze designated type if not frozen already
3930 -- For an aggregate whose component type is an access type, freeze the
3931 -- designated type now, so that its freeze does not appear within the
3932 -- loop that might be created in the expansion of the aggregate. If the
3933 -- designated type is a private type without full view, the expression
3934 -- cannot contain an allocator, so the type is not frozen.
3940 Desig_Typ := Designated_Type (Etype (N));
3943 if Is_Array_Type (Etype (N))
3944 and then Is_Access_Type (Component_Type (Etype (N)))
3946 Desig_Typ := Designated_Type (Component_Type (Etype (N)));
3949 when N_Selected_Component |
3950 N_Indexed_Component |
3953 if Is_Access_Type (Etype (Prefix (N))) then
3954 Desig_Typ := Designated_Type (Etype (Prefix (N)));
3961 if Desig_Typ /= Empty
3962 and then (Is_Frozen (Desig_Typ)
3963 or else (not Is_Fully_Defined (Desig_Typ)))
3968 -- All done if nothing needs freezing
3972 and then No (Desig_Typ)
3977 -- Loop for looking at the right place to insert the freeze nodes
3978 -- exiting from the loop when it is appropriate to insert the freeze
3979 -- node before the current node P.
3981 -- Also checks some special exceptions to the freezing rules. These
3982 -- cases result in a direct return, bypassing the freeze action.
3986 Parent_P := Parent (P);
3988 -- If we don't have a parent, then we are not in a well-formed tree.
3989 -- This is an unusual case, but there are some legitimate situations
3990 -- in which this occurs, notably when the expressions in the range of
3991 -- a type declaration are resolved. We simply ignore the freeze
3992 -- request in this case. Is this right ???
3994 if No (Parent_P) then
3998 -- See if we have got to an appropriate point in the tree
4000 case Nkind (Parent_P) is
4002 -- A special test for the exception of (RM 13.14(8)) for the case
4003 -- of per-object expressions (RM 3.8(18)) occurring in component
4004 -- definition or a discrete subtype definition. Note that we test
4005 -- for a component declaration which includes both cases we are
4006 -- interested in, and furthermore the tree does not have explicit
4007 -- nodes for either of these two constructs.
4009 when N_Component_Declaration =>
4011 -- The case we want to test for here is an identifier that is
4012 -- a per-object expression, this is either a discriminant that
4013 -- appears in a context other than the component declaration
4014 -- or it is a reference to the type of the enclosing construct.
4016 -- For either of these cases, we skip the freezing
4018 if not In_Default_Expression
4019 and then Nkind (N) = N_Identifier
4020 and then (Present (Entity (N)))
4022 -- We recognize the discriminant case by just looking for
4023 -- a reference to a discriminant. It can only be one for
4024 -- the enclosing construct. Skip freezing in this case.
4026 if Ekind (Entity (N)) = E_Discriminant then
4029 -- For the case of a reference to the enclosing record,
4030 -- (or task or protected type), we look for a type that
4031 -- matches the current scope.
4033 elsif Entity (N) = Current_Scope then
4038 -- If we have an enumeration literal that appears as the choice in
4039 -- the aggregate of an enumeration representation clause, then
4040 -- freezing does not occur (RM 13.14(10)).
4042 when N_Enumeration_Representation_Clause =>
4044 -- The case we are looking for is an enumeration literal
4046 if (Nkind (N) = N_Identifier or Nkind (N) = N_Character_Literal)
4047 and then Is_Enumeration_Type (Etype (N))
4049 -- If enumeration literal appears directly as the choice,
4050 -- do not freeze (this is the normal non-overloade case)
4052 if Nkind (Parent (N)) = N_Component_Association
4053 and then First (Choices (Parent (N))) = N
4057 -- If enumeration literal appears as the name of function
4058 -- which is the choice, then also do not freeze. This
4059 -- happens in the overloaded literal case, where the
4060 -- enumeration literal is temporarily changed to a function
4061 -- call for overloading analysis purposes.
4063 elsif Nkind (Parent (N)) = N_Function_Call
4065 Nkind (Parent (Parent (N))) = N_Component_Association
4067 First (Choices (Parent (Parent (N)))) = Parent (N)
4073 -- Normally if the parent is a handled sequence of statements,
4074 -- then the current node must be a statement, and that is an
4075 -- appropriate place to insert a freeze node.
4077 when N_Handled_Sequence_Of_Statements =>
4079 -- An exception occurs when the sequence of statements is for
4080 -- an expander generated body that did not do the usual freeze
4081 -- all operation. In this case we usually want to freeze
4082 -- outside this body, not inside it, and we skip past the
4083 -- subprogram body that we are inside.
4085 if In_Exp_Body (Parent_P) then
4087 -- However, we *do* want to freeze at this point if we have
4088 -- an entity to freeze, and that entity is declared *inside*
4089 -- the body of the expander generated procedure. This case
4090 -- is recognized by the scope of the type, which is either
4091 -- the spec for some enclosing body, or (in the case of
4092 -- init_procs, for which there are no separate specs) the
4096 Subp : constant Node_Id := Parent (Parent_P);
4100 if Nkind (Subp) = N_Subprogram_Body then
4101 Cspc := Corresponding_Spec (Subp);
4103 if (Present (Typ) and then Scope (Typ) = Cspc)
4105 (Present (Nam) and then Scope (Nam) = Cspc)
4110 and then Scope (Typ) = Current_Scope
4111 and then Current_Scope = Defining_Entity (Subp)
4118 -- If not that exception to the exception, then this is
4119 -- where we delay the freeze till outside the body.
4121 Parent_P := Parent (Parent_P);
4122 Freeze_Outside := True;
4124 -- Here if normal case where we are in handled statement
4125 -- sequence and want to do the insertion right there.
4131 -- If parent is a body or a spec or a block, then the current node
4132 -- is a statement or declaration and we can insert the freeze node
4135 when N_Package_Specification |
4141 N_Block_Statement => exit;
4143 -- The expander is allowed to define types in any statements list,
4144 -- so any of the following parent nodes also mark a freezing point
4145 -- if the actual node is in a list of statements or declarations.
4147 when N_Exception_Handler |
4150 N_Case_Statement_Alternative |
4151 N_Compilation_Unit_Aux |
4152 N_Selective_Accept |
4153 N_Accept_Alternative |
4154 N_Delay_Alternative |
4155 N_Conditional_Entry_Call |
4156 N_Entry_Call_Alternative |
4157 N_Triggering_Alternative |
4161 exit when Is_List_Member (P);
4163 -- Note: The N_Loop_Statement is a special case. A type that
4164 -- appears in the source can never be frozen in a loop (this
4165 -- occurs only because of a loop expanded by the expander), so we
4166 -- keep on going. Otherwise we terminate the search. Same is true
4167 -- of any entity which comes from source. (if they have predefined
4168 -- type, that type does not appear to come from source, but the
4169 -- entity should not be frozen here).
4171 when N_Loop_Statement =>
4172 exit when not Comes_From_Source (Etype (N))
4173 and then (No (Nam) or else not Comes_From_Source (Nam));
4175 -- For all other cases, keep looking at parents
4181 -- We fall through the case if we did not yet find the proper
4182 -- place in the free for inserting the freeze node, so climb!
4187 -- If the expression appears in a record or an initialization procedure,
4188 -- the freeze nodes are collected and attached to the current scope, to
4189 -- be inserted and analyzed on exit from the scope, to insure that
4190 -- generated entities appear in the correct scope. If the expression is
4191 -- a default for a discriminant specification, the scope is still void.
4192 -- The expression can also appear in the discriminant part of a private
4193 -- or concurrent type.
4195 -- If the expression appears in a constrained subcomponent of an
4196 -- enclosing record declaration, the freeze nodes must be attached to
4197 -- the outer record type so they can eventually be placed in the
4198 -- enclosing declaration list.
4200 -- The other case requiring this special handling is if we are in a
4201 -- default expression, since in that case we are about to freeze a
4202 -- static type, and the freeze scope needs to be the outer scope, not
4203 -- the scope of the subprogram with the default parameter.
4205 -- For default expressions in generic units, the Move_Freeze_Nodes
4206 -- mechanism (see sem_ch12.adb) takes care of placing them at the proper
4207 -- place, after the generic unit.
4209 if (In_Def_Exp and not Inside_A_Generic)
4210 or else Freeze_Outside
4211 or else (Is_Type (Current_Scope)
4212 and then (not Is_Concurrent_Type (Current_Scope)
4213 or else not Has_Completion (Current_Scope)))
4214 or else Ekind (Current_Scope) = E_Void
4217 Loc : constant Source_Ptr := Sloc (Current_Scope);
4218 Freeze_Nodes : List_Id := No_List;
4219 Pos : Int := Scope_Stack.Last;
4222 if Present (Desig_Typ) then
4223 Freeze_And_Append (Desig_Typ, Loc, Freeze_Nodes);
4226 if Present (Typ) then
4227 Freeze_And_Append (Typ, Loc, Freeze_Nodes);
4230 if Present (Nam) then
4231 Freeze_And_Append (Nam, Loc, Freeze_Nodes);
4234 -- The current scope may be that of a constrained component of
4235 -- an enclosing record declaration, which is above the current
4236 -- scope in the scope stack.
4238 if Is_Record_Type (Scope (Current_Scope)) then
4242 if Is_Non_Empty_List (Freeze_Nodes) then
4243 if No (Scope_Stack.Table (Pos).Pending_Freeze_Actions) then
4244 Scope_Stack.Table (Pos).Pending_Freeze_Actions :=
4247 Append_List (Freeze_Nodes, Scope_Stack.Table
4248 (Pos).Pending_Freeze_Actions);
4256 -- Now we have the right place to do the freezing. First, a special
4257 -- adjustment, if we are in default expression analysis mode, these
4258 -- freeze actions must not be thrown away (normally all inserted actions
4259 -- are thrown away in this mode. However, the freeze actions are from
4260 -- static expressions and one of the important reasons we are doing this
4261 -- special analysis is to get these freeze actions. Therefore we turn
4262 -- off the In_Default_Expression mode to propagate these freeze actions.
4263 -- This also means they get properly analyzed and expanded.
4265 In_Default_Expression := False;
4267 -- Freeze the designated type of an allocator (RM 13.14(13))
4269 if Present (Desig_Typ) then
4270 Freeze_Before (P, Desig_Typ);
4273 -- Freeze type of expression (RM 13.14(10)). Note that we took care of
4274 -- the enumeration representation clause exception in the loop above.
4276 if Present (Typ) then
4277 Freeze_Before (P, Typ);
4280 -- Freeze name if one is present (RM 13.14(11))
4282 if Present (Nam) then
4283 Freeze_Before (P, Nam);
4286 In_Default_Expression := In_Def_Exp;
4287 end Freeze_Expression;
4289 -----------------------------
4290 -- Freeze_Fixed_Point_Type --
4291 -----------------------------
4293 -- Certain fixed-point types and subtypes, including implicit base types
4294 -- and declared first subtypes, have not yet set up a range. This is
4295 -- because the range cannot be set until the Small and Size values are
4296 -- known, and these are not known till the type is frozen.
4298 -- To signal this case, Scalar_Range contains an unanalyzed syntactic range
4299 -- whose bounds are unanalyzed real literals. This routine will recognize
4300 -- this case, and transform this range node into a properly typed range
4301 -- with properly analyzed and resolved values.
4303 procedure Freeze_Fixed_Point_Type (Typ : Entity_Id) is
4304 Rng : constant Node_Id := Scalar_Range (Typ);
4305 Lo : constant Node_Id := Low_Bound (Rng);
4306 Hi : constant Node_Id := High_Bound (Rng);
4307 Btyp : constant Entity_Id := Base_Type (Typ);
4308 Brng : constant Node_Id := Scalar_Range (Btyp);
4309 BLo : constant Node_Id := Low_Bound (Brng);
4310 BHi : constant Node_Id := High_Bound (Brng);
4311 Small : constant Ureal := Small_Value (Typ);
4318 function Fsize (Lov, Hiv : Ureal) return Nat;
4319 -- Returns size of type with given bounds. Also leaves these
4320 -- bounds set as the current bounds of the Typ.
4326 function Fsize (Lov, Hiv : Ureal) return Nat is
4328 Set_Realval (Lo, Lov);
4329 Set_Realval (Hi, Hiv);
4330 return Minimum_Size (Typ);
4333 -- Start of processing for Freeze_Fixed_Point_Type
4336 -- If Esize of a subtype has not previously been set, set it now
4338 if Unknown_Esize (Typ) then
4339 Atype := Ancestor_Subtype (Typ);
4341 if Present (Atype) then
4342 Set_Esize (Typ, Esize (Atype));
4344 Set_Esize (Typ, Esize (Base_Type (Typ)));
4348 -- Immediate return if the range is already analyzed. This means that
4349 -- the range is already set, and does not need to be computed by this
4352 if Analyzed (Rng) then
4356 -- Immediate return if either of the bounds raises Constraint_Error
4358 if Raises_Constraint_Error (Lo)
4359 or else Raises_Constraint_Error (Hi)
4364 Loval := Realval (Lo);
4365 Hival := Realval (Hi);
4367 -- Ordinary fixed-point case
4369 if Is_Ordinary_Fixed_Point_Type (Typ) then
4371 -- For the ordinary fixed-point case, we are allowed to fudge the
4372 -- end-points up or down by small. Generally we prefer to fudge up,
4373 -- i.e. widen the bounds for non-model numbers so that the end points
4374 -- are included. However there are cases in which this cannot be
4375 -- done, and indeed cases in which we may need to narrow the bounds.
4376 -- The following circuit makes the decision.
4378 -- Note: our terminology here is that Incl_EP means that the bounds
4379 -- are widened by Small if necessary to include the end points, and
4380 -- Excl_EP means that the bounds are narrowed by Small to exclude the
4381 -- end-points if this reduces the size.
4383 -- Note that in the Incl case, all we care about is including the
4384 -- end-points. In the Excl case, we want to narrow the bounds as
4385 -- much as permitted by the RM, to give the smallest possible size.
4388 Loval_Incl_EP : Ureal;
4389 Hival_Incl_EP : Ureal;
4391 Loval_Excl_EP : Ureal;
4392 Hival_Excl_EP : Ureal;
4398 First_Subt : Entity_Id;
4403 -- First step. Base types are required to be symmetrical. Right
4404 -- now, the base type range is a copy of the first subtype range.
4405 -- This will be corrected before we are done, but right away we
4406 -- need to deal with the case where both bounds are non-negative.
4407 -- In this case, we set the low bound to the negative of the high
4408 -- bound, to make sure that the size is computed to include the
4409 -- required sign. Note that we do not need to worry about the
4410 -- case of both bounds negative, because the sign will be dealt
4411 -- with anyway. Furthermore we can't just go making such a bound
4412 -- symmetrical, since in a twos-complement system, there is an
4413 -- extra negative value which could not be accomodated on the
4417 and then not UR_Is_Negative (Loval)
4418 and then Hival > Loval
4421 Set_Realval (Lo, Loval);
4424 -- Compute the fudged bounds. If the number is a model number,
4425 -- then we do nothing to include it, but we are allowed to backoff
4426 -- to the next adjacent model number when we exclude it. If it is
4427 -- not a model number then we straddle the two values with the
4428 -- model numbers on either side.
4430 Model_Num := UR_Trunc (Loval / Small) * Small;
4432 if Loval = Model_Num then
4433 Loval_Incl_EP := Model_Num;
4435 Loval_Incl_EP := Model_Num - Small;
4438 -- The low value excluding the end point is Small greater, but
4439 -- we do not do this exclusion if the low value is positive,
4440 -- since it can't help the size and could actually hurt by
4441 -- crossing the high bound.
4443 if UR_Is_Negative (Loval_Incl_EP) then
4444 Loval_Excl_EP := Loval_Incl_EP + Small;
4446 -- If the value went from negative to zero, then we have the
4447 -- case where Loval_Incl_EP is the model number just below
4448 -- zero, so we want to stick to the negative value for the
4449 -- base type to maintain the condition that the size will
4450 -- include signed values.
4453 and then UR_Is_Zero (Loval_Excl_EP)
4455 Loval_Excl_EP := Loval_Incl_EP;
4459 Loval_Excl_EP := Loval_Incl_EP;
4462 -- Similar processing for upper bound and high value
4464 Model_Num := UR_Trunc (Hival / Small) * Small;
4466 if Hival = Model_Num then
4467 Hival_Incl_EP := Model_Num;
4469 Hival_Incl_EP := Model_Num + Small;
4472 if UR_Is_Positive (Hival_Incl_EP) then
4473 Hival_Excl_EP := Hival_Incl_EP - Small;
4475 Hival_Excl_EP := Hival_Incl_EP;
4478 -- One further adjustment is needed. In the case of subtypes, we
4479 -- cannot go outside the range of the base type, or we get
4480 -- peculiarities, and the base type range is already set. This
4481 -- only applies to the Incl values, since clearly the Excl values
4482 -- are already as restricted as they are allowed to be.
4485 Loval_Incl_EP := UR_Max (Loval_Incl_EP, Realval (BLo));
4486 Hival_Incl_EP := UR_Min (Hival_Incl_EP, Realval (BHi));
4489 -- Get size including and excluding end points
4491 Size_Incl_EP := Fsize (Loval_Incl_EP, Hival_Incl_EP);
4492 Size_Excl_EP := Fsize (Loval_Excl_EP, Hival_Excl_EP);
4494 -- No need to exclude end-points if it does not reduce size
4496 if Fsize (Loval_Incl_EP, Hival_Excl_EP) = Size_Excl_EP then
4497 Loval_Excl_EP := Loval_Incl_EP;
4500 if Fsize (Loval_Excl_EP, Hival_Incl_EP) = Size_Excl_EP then
4501 Hival_Excl_EP := Hival_Incl_EP;
4504 -- Now we set the actual size to be used. We want to use the
4505 -- bounds fudged up to include the end-points but only if this
4506 -- can be done without violating a specifically given size
4507 -- size clause or causing an unacceptable increase in size.
4509 -- Case of size clause given
4511 if Has_Size_Clause (Typ) then
4513 -- Use the inclusive size only if it is consistent with
4514 -- the explicitly specified size.
4516 if Size_Incl_EP <= RM_Size (Typ) then
4517 Actual_Lo := Loval_Incl_EP;
4518 Actual_Hi := Hival_Incl_EP;
4519 Actual_Size := Size_Incl_EP;
4521 -- If the inclusive size is too large, we try excluding
4522 -- the end-points (will be caught later if does not work).
4525 Actual_Lo := Loval_Excl_EP;
4526 Actual_Hi := Hival_Excl_EP;
4527 Actual_Size := Size_Excl_EP;
4530 -- Case of size clause not given
4533 -- If we have a base type whose corresponding first subtype
4534 -- has an explicit size that is large enough to include our
4535 -- end-points, then do so. There is no point in working hard
4536 -- to get a base type whose size is smaller than the specified
4537 -- size of the first subtype.
4539 First_Subt := First_Subtype (Typ);
4541 if Has_Size_Clause (First_Subt)
4542 and then Size_Incl_EP <= Esize (First_Subt)
4544 Actual_Size := Size_Incl_EP;
4545 Actual_Lo := Loval_Incl_EP;
4546 Actual_Hi := Hival_Incl_EP;
4548 -- If excluding the end-points makes the size smaller and
4549 -- results in a size of 8,16,32,64, then we take the smaller
4550 -- size. For the 64 case, this is compulsory. For the other
4551 -- cases, it seems reasonable. We like to include end points
4552 -- if we can, but not at the expense of moving to the next
4553 -- natural boundary of size.
4555 elsif Size_Incl_EP /= Size_Excl_EP
4557 (Size_Excl_EP = 8 or else
4558 Size_Excl_EP = 16 or else
4559 Size_Excl_EP = 32 or else
4562 Actual_Size := Size_Excl_EP;
4563 Actual_Lo := Loval_Excl_EP;
4564 Actual_Hi := Hival_Excl_EP;
4566 -- Otherwise we can definitely include the end points
4569 Actual_Size := Size_Incl_EP;
4570 Actual_Lo := Loval_Incl_EP;
4571 Actual_Hi := Hival_Incl_EP;
4574 -- One pathological case: normally we never fudge a low bound
4575 -- down, since it would seem to increase the size (if it has
4576 -- any effect), but for ranges containing single value, or no
4577 -- values, the high bound can be small too large. Consider:
4579 -- type t is delta 2.0**(-14)
4580 -- range 131072.0 .. 0;
4582 -- That lower bound is *just* outside the range of 32 bits, and
4583 -- does need fudging down in this case. Note that the bounds
4584 -- will always have crossed here, since the high bound will be
4585 -- fudged down if necessary, as in the case of:
4587 -- type t is delta 2.0**(-14)
4588 -- range 131072.0 .. 131072.0;
4590 -- So we detect the situation by looking for crossed bounds,
4591 -- and if the bounds are crossed, and the low bound is greater
4592 -- than zero, we will always back it off by small, since this
4593 -- is completely harmless.
4595 if Actual_Lo > Actual_Hi then
4596 if UR_Is_Positive (Actual_Lo) then
4597 Actual_Lo := Loval_Incl_EP - Small;
4598 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4600 -- And of course, we need to do exactly the same parallel
4601 -- fudge for flat ranges in the negative region.
4603 elsif UR_Is_Negative (Actual_Hi) then
4604 Actual_Hi := Hival_Incl_EP + Small;
4605 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4610 Set_Realval (Lo, Actual_Lo);
4611 Set_Realval (Hi, Actual_Hi);
4614 -- For the decimal case, none of this fudging is required, since there
4615 -- are no end-point problems in the decimal case (the end-points are
4616 -- always included).
4619 Actual_Size := Fsize (Loval, Hival);
4622 -- At this stage, the actual size has been calculated and the proper
4623 -- required bounds are stored in the low and high bounds.
4625 if Actual_Size > 64 then
4626 Error_Msg_Uint_1 := UI_From_Int (Actual_Size);
4628 ("size required (^) for type& too large, maximum allowed is 64",
4633 -- Check size against explicit given size
4635 if Has_Size_Clause (Typ) then
4636 if Actual_Size > RM_Size (Typ) then
4637 Error_Msg_Uint_1 := RM_Size (Typ);
4638 Error_Msg_Uint_2 := UI_From_Int (Actual_Size);
4640 ("size given (^) for type& too small, minimum allowed is ^",
4641 Size_Clause (Typ), Typ);
4644 Actual_Size := UI_To_Int (Esize (Typ));
4647 -- Increase size to next natural boundary if no size clause given
4650 if Actual_Size <= 8 then
4652 elsif Actual_Size <= 16 then
4654 elsif Actual_Size <= 32 then
4660 Init_Esize (Typ, Actual_Size);
4661 Adjust_Esize_For_Alignment (Typ);
4664 -- If we have a base type, then expand the bounds so that they extend to
4665 -- the full width of the allocated size in bits, to avoid junk range
4666 -- checks on intermediate computations.
4668 if Base_Type (Typ) = Typ then
4669 Set_Realval (Lo, -(Small * (Uint_2 ** (Actual_Size - 1))));
4670 Set_Realval (Hi, (Small * (Uint_2 ** (Actual_Size - 1) - 1)));
4673 -- Final step is to reanalyze the bounds using the proper type
4674 -- and set the Corresponding_Integer_Value fields of the literals.
4676 Set_Etype (Lo, Empty);
4677 Set_Analyzed (Lo, False);
4680 -- Resolve with universal fixed if the base type, and the base type if
4681 -- it is a subtype. Note we can't resolve the base type with itself,
4682 -- that would be a reference before definition.
4685 Resolve (Lo, Universal_Fixed);
4690 -- Set corresponding integer value for bound
4692 Set_Corresponding_Integer_Value
4693 (Lo, UR_To_Uint (Realval (Lo) / Small));
4695 -- Similar processing for high bound
4697 Set_Etype (Hi, Empty);
4698 Set_Analyzed (Hi, False);
4702 Resolve (Hi, Universal_Fixed);
4707 Set_Corresponding_Integer_Value
4708 (Hi, UR_To_Uint (Realval (Hi) / Small));
4710 -- Set type of range to correspond to bounds
4712 Set_Etype (Rng, Etype (Lo));
4714 -- Set Esize to calculated size if not set already
4716 if Unknown_Esize (Typ) then
4717 Init_Esize (Typ, Actual_Size);
4720 -- Set RM_Size if not already set. If already set, check value
4723 Minsiz : constant Uint := UI_From_Int (Minimum_Size (Typ));
4726 if RM_Size (Typ) /= Uint_0 then
4727 if RM_Size (Typ) < Minsiz then
4728 Error_Msg_Uint_1 := RM_Size (Typ);
4729 Error_Msg_Uint_2 := Minsiz;
4731 ("size given (^) for type& too small, minimum allowed is ^",
4732 Size_Clause (Typ), Typ);
4736 Set_RM_Size (Typ, Minsiz);
4739 end Freeze_Fixed_Point_Type;
4745 procedure Freeze_Itype (T : Entity_Id; N : Node_Id) is
4749 Set_Has_Delayed_Freeze (T);
4750 L := Freeze_Entity (T, Sloc (N));
4752 if Is_Non_Empty_List (L) then
4753 Insert_Actions (N, L);
4757 --------------------------
4758 -- Freeze_Static_Object --
4759 --------------------------
4761 procedure Freeze_Static_Object (E : Entity_Id) is
4763 Cannot_Be_Static : exception;
4764 -- Exception raised if the type of a static object cannot be made
4765 -- static. This happens if the type depends on non-global objects.
4767 procedure Ensure_Expression_Is_SA (N : Node_Id);
4768 -- Called to ensure that an expression used as part of a type definition
4769 -- is statically allocatable, which means that the expression type is
4770 -- statically allocatable, and the expression is either static, or a
4771 -- reference to a library level constant.
4773 procedure Ensure_Type_Is_SA (Typ : Entity_Id);
4774 -- Called to mark a type as static, checking that it is possible
4775 -- to set the type as static. If it is not possible, then the
4776 -- exception Cannot_Be_Static is raised.
4778 -----------------------------
4779 -- Ensure_Expression_Is_SA --
4780 -----------------------------
4782 procedure Ensure_Expression_Is_SA (N : Node_Id) is
4786 Ensure_Type_Is_SA (Etype (N));
4788 if Is_Static_Expression (N) then
4791 elsif Nkind (N) = N_Identifier then
4795 and then Ekind (Ent) = E_Constant
4796 and then Is_Library_Level_Entity (Ent)
4802 raise Cannot_Be_Static;
4803 end Ensure_Expression_Is_SA;
4805 -----------------------
4806 -- Ensure_Type_Is_SA --
4807 -----------------------
4809 procedure Ensure_Type_Is_SA (Typ : Entity_Id) is
4814 -- If type is library level, we are all set
4816 if Is_Library_Level_Entity (Typ) then
4820 -- We are also OK if the type already marked as statically allocated,
4821 -- which means we processed it before.
4823 if Is_Statically_Allocated (Typ) then
4827 -- Mark type as statically allocated
4829 Set_Is_Statically_Allocated (Typ);
4831 -- Check that it is safe to statically allocate this type
4833 if Is_Scalar_Type (Typ) or else Is_Real_Type (Typ) then
4834 Ensure_Expression_Is_SA (Type_Low_Bound (Typ));
4835 Ensure_Expression_Is_SA (Type_High_Bound (Typ));
4837 elsif Is_Array_Type (Typ) then
4838 N := First_Index (Typ);
4839 while Present (N) loop
4840 Ensure_Type_Is_SA (Etype (N));
4844 Ensure_Type_Is_SA (Component_Type (Typ));
4846 elsif Is_Access_Type (Typ) then
4847 if Ekind (Designated_Type (Typ)) = E_Subprogram_Type then
4851 T : constant Entity_Id := Etype (Designated_Type (Typ));
4854 if T /= Standard_Void_Type then
4855 Ensure_Type_Is_SA (T);
4858 F := First_Formal (Designated_Type (Typ));
4860 while Present (F) loop
4861 Ensure_Type_Is_SA (Etype (F));
4867 Ensure_Type_Is_SA (Designated_Type (Typ));
4870 elsif Is_Record_Type (Typ) then
4871 C := First_Entity (Typ);
4872 while Present (C) loop
4873 if Ekind (C) = E_Discriminant
4874 or else Ekind (C) = E_Component
4876 Ensure_Type_Is_SA (Etype (C));
4878 elsif Is_Type (C) then
4879 Ensure_Type_Is_SA (C);
4885 elsif Ekind (Typ) = E_Subprogram_Type then
4886 Ensure_Type_Is_SA (Etype (Typ));
4888 C := First_Formal (Typ);
4889 while Present (C) loop
4890 Ensure_Type_Is_SA (Etype (C));
4895 raise Cannot_Be_Static;
4897 end Ensure_Type_Is_SA;
4899 -- Start of processing for Freeze_Static_Object
4902 Ensure_Type_Is_SA (Etype (E));
4905 when Cannot_Be_Static =>
4907 -- If the object that cannot be static is imported or exported,
4908 -- then we give an error message saying that this object cannot
4909 -- be imported or exported.
4911 if Is_Imported (E) then
4913 ("& cannot be imported (local type is not constant)", E);
4915 -- Otherwise must be exported, something is wrong if compiler
4916 -- is marking something as statically allocated which cannot be).
4918 else pragma Assert (Is_Exported (E));
4920 ("& cannot be exported (local type is not constant)", E);
4922 end Freeze_Static_Object;
4924 -----------------------
4925 -- Freeze_Subprogram --
4926 -----------------------
4928 procedure Freeze_Subprogram (E : Entity_Id) is
4933 -- Subprogram may not have an address clause unless it is imported
4935 if Present (Address_Clause (E)) then
4936 if not Is_Imported (E) then
4938 ("address clause can only be given " &
4939 "for imported subprogram",
4940 Name (Address_Clause (E)));
4944 -- Reset the Pure indication on an imported subprogram unless an
4945 -- explicit Pure_Function pragma was present. We do this because
4946 -- otherwise it is an insidious error to call a non-pure function from
4947 -- pure unit and have calls mysteriously optimized away. What happens
4948 -- here is that the Import can bypass the normal check to ensure that
4949 -- pure units call only pure subprograms.
4952 and then Is_Pure (E)
4953 and then not Has_Pragma_Pure_Function (E)
4955 Set_Is_Pure (E, False);
4958 -- For non-foreign convention subprograms, this is where we create
4959 -- the extra formals (for accessibility level and constrained bit
4960 -- information). We delay this till the freeze point precisely so
4961 -- that we know the convention!
4963 if not Has_Foreign_Convention (E) then
4964 Create_Extra_Formals (E);
4967 -- If this is convention Ada and a Valued_Procedure, that's odd
4969 if Ekind (E) = E_Procedure
4970 and then Is_Valued_Procedure (E)
4971 and then Convention (E) = Convention_Ada
4972 and then Warn_On_Export_Import
4975 ("?Valued_Procedure has no effect for convention Ada", E);
4976 Set_Is_Valued_Procedure (E, False);
4979 -- Case of foreign convention
4984 -- For foreign conventions, warn about return of an
4985 -- unconstrained array.
4987 -- Note: we *do* allow a return by descriptor for the VMS case,
4988 -- though here there is probably more to be done ???
4990 if Ekind (E) = E_Function then
4991 Retype := Underlying_Type (Etype (E));
4993 -- If no return type, probably some other error, e.g. a
4994 -- missing full declaration, so ignore.
4999 -- If the return type is generic, we have emitted a warning
5000 -- earlier on, and there is nothing else to check here. Specific
5001 -- instantiations may lead to erroneous behavior.
5003 elsif Is_Generic_Type (Etype (E)) then
5006 elsif Is_Array_Type (Retype)
5007 and then not Is_Constrained (Retype)
5008 and then Mechanism (E) not in Descriptor_Codes
5009 and then Warn_On_Export_Import
5012 ("?foreign convention function& should not return " &
5013 "unconstrained array", E);
5018 -- If any of the formals for an exported foreign convention
5019 -- subprogram have defaults, then emit an appropriate warning since
5020 -- this is odd (default cannot be used from non-Ada code)
5022 if Is_Exported (E) then
5023 F := First_Formal (E);
5024 while Present (F) loop
5025 if Warn_On_Export_Import
5026 and then Present (Default_Value (F))
5029 ("?parameter cannot be defaulted in non-Ada call",
5038 -- For VMS, descriptor mechanisms for parameters are allowed only
5039 -- for imported/exported subprograms. Moreover, the NCA descriptor
5040 -- is not allowed for parameters of exported subprograms.
5042 if OpenVMS_On_Target then
5043 if Is_Exported (E) then
5044 F := First_Formal (E);
5045 while Present (F) loop
5046 if Mechanism (F) = By_Descriptor_NCA then
5048 ("'N'C'A' descriptor for parameter not permitted", F);
5050 ("\can only be used for imported subprogram", F);
5056 elsif not Is_Imported (E) then
5057 F := First_Formal (E);
5058 while Present (F) loop
5059 if Mechanism (F) in Descriptor_Codes then
5061 ("descriptor mechanism for parameter not permitted", F);
5063 ("\can only be used for imported/exported subprogram", F);
5071 -- Pragma Inline_Always is disallowed for dispatching subprograms
5072 -- because the address of such subprograms is saved in the dispatch
5073 -- table to support dispatching calls, and dispatching calls cannot
5074 -- be inlined. This is consistent with the restriction against using
5075 -- 'Access or 'Address on an Inline_Always subprogram.
5077 if Is_Dispatching_Operation (E)
5078 and then Has_Pragma_Inline_Always (E)
5081 ("pragma Inline_Always not allowed for dispatching subprograms", E);
5083 end Freeze_Subprogram;
5085 ----------------------
5086 -- Is_Fully_Defined --
5087 ----------------------
5089 function Is_Fully_Defined (T : Entity_Id) return Boolean is
5091 if Ekind (T) = E_Class_Wide_Type then
5092 return Is_Fully_Defined (Etype (T));
5094 elsif Is_Array_Type (T) then
5095 return Is_Fully_Defined (Component_Type (T));
5097 elsif Is_Record_Type (T)
5098 and not Is_Private_Type (T)
5100 -- Verify that the record type has no components with private types
5101 -- without completion.
5107 Comp := First_Component (T);
5109 while Present (Comp) loop
5110 if not Is_Fully_Defined (Etype (Comp)) then
5114 Next_Component (Comp);
5120 return not Is_Private_Type (T)
5121 or else Present (Full_View (Base_Type (T)));
5123 end Is_Fully_Defined;
5125 ---------------------------------
5126 -- Process_Default_Expressions --
5127 ---------------------------------
5129 procedure Process_Default_Expressions
5131 After : in out Node_Id)
5133 Loc : constant Source_Ptr := Sloc (E);
5140 Set_Default_Expressions_Processed (E);
5142 -- A subprogram instance and its associated anonymous subprogram share
5143 -- their signature. The default expression functions are defined in the
5144 -- wrapper packages for the anonymous subprogram, and should not be
5145 -- generated again for the instance.
5147 if Is_Generic_Instance (E)
5148 and then Present (Alias (E))
5149 and then Default_Expressions_Processed (Alias (E))
5154 Formal := First_Formal (E);
5155 while Present (Formal) loop
5156 if Present (Default_Value (Formal)) then
5158 -- We work with a copy of the default expression because we
5159 -- do not want to disturb the original, since this would mess
5160 -- up the conformance checking.
5162 Dcopy := New_Copy_Tree (Default_Value (Formal));
5164 -- The analysis of the expression may generate insert actions,
5165 -- which of course must not be executed. We wrap those actions
5166 -- in a procedure that is not called, and later on eliminated.
5167 -- The following cases have no side-effects, and are analyzed
5170 if Nkind (Dcopy) = N_Identifier
5171 or else Nkind (Dcopy) = N_Expanded_Name
5172 or else Nkind (Dcopy) = N_Integer_Literal
5173 or else (Nkind (Dcopy) = N_Real_Literal
5174 and then not Vax_Float (Etype (Dcopy)))
5175 or else Nkind (Dcopy) = N_Character_Literal
5176 or else Nkind (Dcopy) = N_String_Literal
5177 or else Known_Null (Dcopy)
5178 or else (Nkind (Dcopy) = N_Attribute_Reference
5180 Attribute_Name (Dcopy) = Name_Null_Parameter)
5183 -- If there is no default function, we must still do a full
5184 -- analyze call on the default value, to ensure that all error
5185 -- checks are performed, e.g. those associated with static
5186 -- evaluation. Note: this branch will always be taken if the
5187 -- analyzer is turned off (but we still need the error checks).
5189 -- Note: the setting of parent here is to meet the requirement
5190 -- that we can only analyze the expression while attached to
5191 -- the tree. Really the requirement is that the parent chain
5192 -- be set, we don't actually need to be in the tree.
5194 Set_Parent (Dcopy, Declaration_Node (Formal));
5197 -- Default expressions are resolved with their own type if the
5198 -- context is generic, to avoid anomalies with private types.
5200 if Ekind (Scope (E)) = E_Generic_Package then
5203 Resolve (Dcopy, Etype (Formal));
5206 -- If that resolved expression will raise constraint error,
5207 -- then flag the default value as raising constraint error.
5208 -- This allows a proper error message on the calls.
5210 if Raises_Constraint_Error (Dcopy) then
5211 Set_Raises_Constraint_Error (Default_Value (Formal));
5214 -- If the default is a parameterless call, we use the name of
5215 -- the called function directly, and there is no body to build.
5217 elsif Nkind (Dcopy) = N_Function_Call
5218 and then No (Parameter_Associations (Dcopy))
5222 -- Else construct and analyze the body of a wrapper procedure
5223 -- that contains an object declaration to hold the expression.
5224 -- Given that this is done only to complete the analysis, it
5225 -- simpler to build a procedure than a function which might
5226 -- involve secondary stack expansion.
5230 Make_Defining_Identifier (Loc, New_Internal_Name ('D'));
5233 Make_Subprogram_Body (Loc,
5235 Make_Procedure_Specification (Loc,
5236 Defining_Unit_Name => Dnam),
5238 Declarations => New_List (
5239 Make_Object_Declaration (Loc,
5240 Defining_Identifier =>
5241 Make_Defining_Identifier (Loc,
5242 New_Internal_Name ('T')),
5243 Object_Definition =>
5244 New_Occurrence_Of (Etype (Formal), Loc),
5245 Expression => New_Copy_Tree (Dcopy))),
5247 Handled_Statement_Sequence =>
5248 Make_Handled_Sequence_Of_Statements (Loc,
5249 Statements => New_List));
5251 Set_Scope (Dnam, Scope (E));
5252 Set_Assignment_OK (First (Declarations (Dbody)));
5253 Set_Is_Eliminated (Dnam);
5254 Insert_After (After, Dbody);
5260 Next_Formal (Formal);
5262 end Process_Default_Expressions;
5264 ----------------------------------------
5265 -- Set_Component_Alignment_If_Not_Set --
5266 ----------------------------------------
5268 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id) is
5270 -- Ignore if not base type, subtypes don't need anything
5272 if Typ /= Base_Type (Typ) then
5276 -- Do not override existing representation
5278 if Is_Packed (Typ) then
5281 elsif Has_Specified_Layout (Typ) then
5284 elsif Component_Alignment (Typ) /= Calign_Default then
5288 Set_Component_Alignment
5289 (Typ, Scope_Stack.Table
5290 (Scope_Stack.Last).Component_Alignment_Default);
5292 end Set_Component_Alignment_If_Not_Set;
5298 procedure Undelay_Type (T : Entity_Id) is
5300 Set_Has_Delayed_Freeze (T, False);
5301 Set_Freeze_Node (T, Empty);
5303 -- Since we don't want T to have a Freeze_Node, we don't want its
5304 -- Full_View or Corresponding_Record_Type to have one either.
5306 -- ??? Fundamentally, this whole handling is a kludge. What we really
5307 -- want is to be sure that for an Itype that's part of record R and is a
5308 -- subtype of type T, that it's frozen after the later of the freeze
5309 -- points of R and T. We have no way of doing that directly, so what we
5310 -- do is force most such Itypes to be frozen as part of freezing R via
5311 -- this procedure and only delay the ones that need to be delayed
5312 -- (mostly the designated types of access types that are defined as part
5315 if Is_Private_Type (T)
5316 and then Present (Full_View (T))
5317 and then Is_Itype (Full_View (T))
5318 and then Is_Record_Type (Scope (Full_View (T)))
5320 Undelay_Type (Full_View (T));
5323 if Is_Concurrent_Type (T)
5324 and then Present (Corresponding_Record_Type (T))
5325 and then Is_Itype (Corresponding_Record_Type (T))
5326 and then Is_Record_Type (Scope (Corresponding_Record_Type (T)))
5328 Undelay_Type (Corresponding_Record_Type (T));
5336 procedure Warn_Overlay
5341 Ent : constant Entity_Id := Entity (Nam);
5342 -- The object to which the address clause applies
5345 Old : Entity_Id := Empty;
5349 -- No warning if address clause overlay warnings are off
5351 if not Address_Clause_Overlay_Warnings then
5355 -- No warning if there is an explicit initialization
5357 Init := Original_Node (Expression (Declaration_Node (Ent)));
5359 if Present (Init) and then Comes_From_Source (Init) then
5363 -- We only give the warning for non-imported entities of a type for
5364 -- which a non-null base init proc is defined (or for access types which
5365 -- have implicit null initialization).
5368 and then (Has_Non_Null_Base_Init_Proc (Typ)
5369 or else Is_Access_Type (Typ))
5370 and then not Is_Imported (Ent)
5372 if Nkind (Expr) = N_Attribute_Reference
5373 and then Is_Entity_Name (Prefix (Expr))
5375 Old := Entity (Prefix (Expr));
5377 elsif Is_Entity_Name (Expr)
5378 and then Ekind (Entity (Expr)) = E_Constant
5380 Decl := Declaration_Node (Entity (Expr));
5382 if Nkind (Decl) = N_Object_Declaration
5383 and then Present (Expression (Decl))
5384 and then Nkind (Expression (Decl)) = N_Attribute_Reference
5385 and then Is_Entity_Name (Prefix (Expression (Decl)))
5387 Old := Entity (Prefix (Expression (Decl)));
5389 elsif Nkind (Expr) = N_Function_Call then
5393 -- A function call (most likely to To_Address) is probably not an
5394 -- overlay, so skip warning. Ditto if the function call was inlined
5395 -- and transformed into an entity.
5397 elsif Nkind (Original_Node (Expr)) = N_Function_Call then
5401 Decl := Next (Parent (Expr));
5403 -- If a pragma Import follows, we assume that it is for the current
5404 -- target of the address clause, and skip the warning.
5407 and then Nkind (Decl) = N_Pragma
5408 and then Pragma_Name (Decl) = Name_Import
5413 if Present (Old) then
5414 Error_Msg_Node_2 := Old;
5416 ("default initialization of & may modify &?",
5420 ("default initialization of & may modify overlaid storage?",
5424 -- Add friendly warning if initialization comes from a packed array
5427 if Is_Record_Type (Typ) then
5432 Comp := First_Component (Typ);
5434 while Present (Comp) loop
5435 if Nkind (Parent (Comp)) = N_Component_Declaration
5436 and then Present (Expression (Parent (Comp)))
5439 elsif Is_Array_Type (Etype (Comp))
5440 and then Present (Packed_Array_Type (Etype (Comp)))
5443 ("\packed array component& " &
5444 "will be initialized to zero?",
5448 Next_Component (Comp);
5455 ("\use pragma Import for & to " &
5456 "suppress initialization (RM B.1(24))?",
OSDN Git Service
