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_Ch3; use Exp_Ch3;
33 with Exp_Ch7; use Exp_Ch7;
34 with Exp_Disp; use Exp_Disp;
35 with Exp_Pakd; use Exp_Pakd;
36 with Exp_Util; use Exp_Util;
37 with Exp_Tss; use Exp_Tss;
38 with Layout; use Layout;
39 with Lib.Xref; use Lib.Xref;
40 with Namet; use Namet;
41 with Nlists; use Nlists;
42 with Nmake; use Nmake;
44 with Restrict; use Restrict;
45 with Rident; use Rident;
47 with Sem_Cat; use Sem_Cat;
48 with Sem_Ch6; use Sem_Ch6;
49 with Sem_Ch7; use Sem_Ch7;
50 with Sem_Ch8; use Sem_Ch8;
51 with Sem_Ch13; use Sem_Ch13;
52 with Sem_Eval; use Sem_Eval;
53 with Sem_Mech; use Sem_Mech;
54 with Sem_Prag; use Sem_Prag;
55 with Sem_Res; use Sem_Res;
56 with Sem_Util; use Sem_Util;
57 with Sinfo; use Sinfo;
58 with Snames; use Snames;
59 with Stand; use Stand;
60 with Targparm; use Targparm;
61 with Tbuild; use Tbuild;
62 with Ttypes; use Ttypes;
63 with Uintp; use Uintp;
64 with Urealp; use Urealp;
66 package body Freeze is
68 -----------------------
69 -- Local Subprograms --
70 -----------------------
72 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id);
73 -- Typ is a type that is being frozen. If no size clause is given,
74 -- but a default Esize has been computed, then this default Esize is
75 -- adjusted up if necessary to be consistent with a given alignment,
76 -- but never to a value greater than Long_Long_Integer'Size. This
77 -- is used for all discrete types and for fixed-point types.
79 procedure Build_And_Analyze_Renamed_Body
82 After : in out Node_Id);
83 -- Build body for a renaming declaration, insert in tree and analyze
85 procedure Check_Address_Clause (E : Entity_Id);
86 -- Apply legality checks to address clauses for object declarations,
87 -- at the point the object is frozen.
89 procedure Check_Strict_Alignment (E : Entity_Id);
90 -- E is a base type. If E is tagged or has a component that is aliased
91 -- or tagged or contains something this is aliased or tagged, set
94 procedure Check_Unsigned_Type (E : Entity_Id);
95 pragma Inline (Check_Unsigned_Type);
96 -- If E is a fixed-point or discrete type, then all the necessary work
97 -- to freeze it is completed except for possible setting of the flag
98 -- Is_Unsigned_Type, which is done by this procedure. The call has no
99 -- effect if the entity E is not a discrete or fixed-point type.
101 procedure Freeze_And_Append
104 Result : in out List_Id);
105 -- Freezes Ent using Freeze_Entity, and appends the resulting list of
106 -- nodes to Result, modifying Result from No_List if necessary.
108 procedure Freeze_Enumeration_Type (Typ : Entity_Id);
109 -- Freeze enumeration type. The Esize field is set as processing
110 -- proceeds (i.e. set by default when the type is declared and then
111 -- adjusted by rep clauses. What this procedure does is to make sure
112 -- that if a foreign convention is specified, and no specific size
113 -- is given, then the size must be at least Integer'Size.
115 procedure Freeze_Static_Object (E : Entity_Id);
116 -- If an object is frozen which has Is_Statically_Allocated set, then
117 -- all referenced types must also be marked with this flag. This routine
118 -- is in charge of meeting this requirement for the object entity E.
120 procedure Freeze_Subprogram (E : Entity_Id);
121 -- Perform freezing actions for a subprogram (create extra formals,
122 -- and set proper default mechanism values). Note that this routine
123 -- is not called for internal subprograms, for which neither of these
124 -- actions is needed (or desirable, we do not want for example to have
125 -- these extra formals present in initialization procedures, where they
126 -- would serve no purpose). In this call E is either a subprogram or
127 -- a subprogram type (i.e. an access to a subprogram).
129 function Is_Fully_Defined (T : Entity_Id) return Boolean;
130 -- True if T is not private and has no private components, or has a full
131 -- view. Used to determine whether the designated type of an access type
132 -- should be frozen when the access type is frozen. This is done when an
133 -- allocator is frozen, or an expression that may involve attributes of
134 -- the designated type. Otherwise freezing the access type does not freeze
135 -- the designated type.
137 procedure Generate_Prim_Op_References (Typ : Entity_Id);
138 -- For a tagged type, generate implicit references to its primitive
139 -- operations, for source navigation.
141 procedure Process_Default_Expressions
143 After : in out Node_Id);
144 -- This procedure is called for each subprogram to complete processing
145 -- of default expressions at the point where all types are known to be
146 -- frozen. The expressions must be analyzed in full, to make sure that
147 -- all error processing is done (they have only been pre-analyzed). If
148 -- the expression is not an entity or literal, its analysis may generate
149 -- code which must not be executed. In that case we build a function
150 -- body to hold that code. This wrapper function serves no other purpose
151 -- (it used to be called to evaluate the default, but now the default is
152 -- inlined at each point of call).
154 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id);
155 -- Typ is a record or array type that is being frozen. This routine
156 -- sets the default component alignment from the scope stack values
157 -- if the alignment is otherwise not specified.
159 procedure Check_Debug_Info_Needed (T : Entity_Id);
160 -- As each entity is frozen, this routine is called to deal with the
161 -- setting of Debug_Info_Needed for the entity. This flag is set if
162 -- the entity comes from source, or if we are in Debug_Generated_Code
163 -- mode or if the -gnatdV debug flag is set. However, it never sets
164 -- the flag if Debug_Info_Off is set. This procedure also ensures that
165 -- subsidiary entities have the flag set as required.
167 procedure Undelay_Type (T : Entity_Id);
168 -- T is a type of a component that we know to be an Itype.
169 -- We don't want this to have a Freeze_Node, so ensure it doesn't.
170 -- Do the same for any Full_View or Corresponding_Record_Type.
172 procedure Warn_Overlay
176 -- Expr is the expression for an address clause for entity Nam whose type
177 -- is Typ. If Typ has a default initialization, and there is no explicit
178 -- initialization in the source declaration, check whether the address
179 -- clause might cause overlaying of an entity, and emit a warning on the
180 -- side effect that the initialization will cause.
182 -------------------------------
183 -- Adjust_Esize_For_Alignment --
184 -------------------------------
186 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id) is
190 if Known_Esize (Typ) and then Known_Alignment (Typ) then
191 Align := Alignment_In_Bits (Typ);
193 if Align > Esize (Typ)
194 and then Align <= Standard_Long_Long_Integer_Size
196 Set_Esize (Typ, Align);
199 end Adjust_Esize_For_Alignment;
201 ------------------------------------
202 -- Build_And_Analyze_Renamed_Body --
203 ------------------------------------
205 procedure Build_And_Analyze_Renamed_Body
208 After : in out Node_Id)
210 Body_Node : constant Node_Id := Build_Renamed_Body (Decl, New_S);
212 Insert_After (After, Body_Node);
213 Mark_Rewrite_Insertion (Body_Node);
216 end Build_And_Analyze_Renamed_Body;
218 ------------------------
219 -- Build_Renamed_Body --
220 ------------------------
222 function Build_Renamed_Body
224 New_S : Entity_Id) return Node_Id
226 Loc : constant Source_Ptr := Sloc (New_S);
227 -- We use for the source location of the renamed body, the location
228 -- of the spec entity. It might seem more natural to use the location
229 -- of the renaming declaration itself, but that would be wrong, since
230 -- then the body we create would look as though it was created far
231 -- too late, and this could cause problems with elaboration order
232 -- analysis, particularly in connection with instantiations.
234 N : constant Node_Id := Unit_Declaration_Node (New_S);
235 Nam : constant Node_Id := Name (N);
237 Spec : constant Node_Id := New_Copy_Tree (Specification (Decl));
238 Actuals : List_Id := No_List;
243 O_Formal : Entity_Id;
244 Param_Spec : Node_Id;
246 Pref : Node_Id := Empty;
247 -- If the renamed entity is a primitive operation given in prefix form,
248 -- the prefix is the target object and it has to be added as the first
249 -- actual in the generated call.
252 -- Determine the entity being renamed, which is the target of the call
253 -- statement. If the name is an explicit dereference, this is a renaming
254 -- of a subprogram type rather than a subprogram. The name itself is
257 if Nkind (Nam) = N_Selected_Component then
258 Old_S := Entity (Selector_Name (Nam));
260 elsif Nkind (Nam) = N_Explicit_Dereference then
261 Old_S := Etype (Nam);
263 elsif Nkind (Nam) = N_Indexed_Component then
264 if Is_Entity_Name (Prefix (Nam)) then
265 Old_S := Entity (Prefix (Nam));
267 Old_S := Entity (Selector_Name (Prefix (Nam)));
270 elsif Nkind (Nam) = N_Character_Literal then
271 Old_S := Etype (New_S);
274 Old_S := Entity (Nam);
277 if Is_Entity_Name (Nam) then
279 -- If the renamed entity is a predefined operator, retain full name
280 -- to ensure its visibility.
282 if Ekind (Old_S) = E_Operator
283 and then Nkind (Nam) = N_Expanded_Name
285 Call_Name := New_Copy (Name (N));
287 Call_Name := New_Reference_To (Old_S, Loc);
291 if Nkind (Nam) = N_Selected_Component
292 and then Present (First_Formal (Old_S))
294 (Is_Controlling_Formal (First_Formal (Old_S))
295 or else Is_Class_Wide_Type (Etype (First_Formal (Old_S))))
298 -- Retrieve the target object, to be added as a first actual
301 Call_Name := New_Occurrence_Of (Old_S, Loc);
302 Pref := Prefix (Nam);
305 Call_Name := New_Copy (Name (N));
308 -- The original name may have been overloaded, but
309 -- is fully resolved now.
311 Set_Is_Overloaded (Call_Name, False);
314 -- For simple renamings, subsequent calls can be expanded directly as
315 -- called to the renamed entity. The body must be generated in any case
316 -- for calls they may appear elsewhere.
318 if (Ekind (Old_S) = E_Function
319 or else Ekind (Old_S) = E_Procedure)
320 and then Nkind (Decl) = N_Subprogram_Declaration
322 Set_Body_To_Inline (Decl, Old_S);
325 -- The body generated for this renaming is an internal artifact, and
326 -- does not constitute a freeze point for the called entity.
328 Set_Must_Not_Freeze (Call_Name);
330 Formal := First_Formal (Defining_Entity (Decl));
332 if Present (Pref) then
334 Pref_Type : constant Entity_Id := Etype (Pref);
335 Form_Type : constant Entity_Id := Etype (First_Formal (Old_S));
339 -- The controlling formal may be an access parameter, or the
340 -- actual may be an access value, so adjust accordingly.
342 if Is_Access_Type (Pref_Type)
343 and then not Is_Access_Type (Form_Type)
346 (Make_Explicit_Dereference (Loc, Relocate_Node (Pref)));
348 elsif Is_Access_Type (Form_Type)
349 and then not Is_Access_Type (Pref)
352 (Make_Attribute_Reference (Loc,
353 Attribute_Name => Name_Access,
354 Prefix => Relocate_Node (Pref)));
356 Actuals := New_List (Pref);
360 elsif Present (Formal) then
367 if Present (Formal) then
368 while Present (Formal) loop
369 Append (New_Reference_To (Formal, Loc), Actuals);
370 Next_Formal (Formal);
374 -- If the renamed entity is an entry, inherit its profile. For other
375 -- renamings as bodies, both profiles must be subtype conformant, so it
376 -- is not necessary to replace the profile given in the declaration.
377 -- However, default values that are aggregates are rewritten when
378 -- partially analyzed, so we recover the original aggregate to insure
379 -- that subsequent conformity checking works. Similarly, if the default
380 -- expression was constant-folded, recover the original expression.
382 Formal := First_Formal (Defining_Entity (Decl));
384 if Present (Formal) then
385 O_Formal := First_Formal (Old_S);
386 Param_Spec := First (Parameter_Specifications (Spec));
388 while Present (Formal) loop
389 if Is_Entry (Old_S) then
391 if Nkind (Parameter_Type (Param_Spec)) /=
394 Set_Etype (Formal, Etype (O_Formal));
395 Set_Entity (Parameter_Type (Param_Spec), Etype (O_Formal));
398 elsif Nkind (Default_Value (O_Formal)) = N_Aggregate
399 or else Nkind (Original_Node (Default_Value (O_Formal))) /=
400 Nkind (Default_Value (O_Formal))
402 Set_Expression (Param_Spec,
403 New_Copy_Tree (Original_Node (Default_Value (O_Formal))));
406 Next_Formal (Formal);
407 Next_Formal (O_Formal);
412 -- If the renamed entity is a function, the generated body contains a
413 -- return statement. Otherwise, build a procedure call. If the entity is
414 -- an entry, subsequent analysis of the call will transform it into the
415 -- proper entry or protected operation call. If the renamed entity is
416 -- a character literal, return it directly.
418 if Ekind (Old_S) = E_Function
419 or else Ekind (Old_S) = E_Operator
420 or else (Ekind (Old_S) = E_Subprogram_Type
421 and then Etype (Old_S) /= Standard_Void_Type)
424 Make_Simple_Return_Statement (Loc,
426 Make_Function_Call (Loc,
428 Parameter_Associations => Actuals));
430 elsif Ekind (Old_S) = E_Enumeration_Literal then
432 Make_Simple_Return_Statement (Loc,
433 Expression => New_Occurrence_Of (Old_S, Loc));
435 elsif Nkind (Nam) = N_Character_Literal then
437 Make_Simple_Return_Statement (Loc,
438 Expression => Call_Name);
442 Make_Procedure_Call_Statement (Loc,
444 Parameter_Associations => Actuals);
447 -- Create entities for subprogram body and formals
449 Set_Defining_Unit_Name (Spec,
450 Make_Defining_Identifier (Loc, Chars => Chars (New_S)));
452 Param_Spec := First (Parameter_Specifications (Spec));
454 while Present (Param_Spec) loop
455 Set_Defining_Identifier (Param_Spec,
456 Make_Defining_Identifier (Loc,
457 Chars => Chars (Defining_Identifier (Param_Spec))));
462 Make_Subprogram_Body (Loc,
463 Specification => Spec,
464 Declarations => New_List,
465 Handled_Statement_Sequence =>
466 Make_Handled_Sequence_Of_Statements (Loc,
467 Statements => New_List (Call_Node)));
469 if Nkind (Decl) /= N_Subprogram_Declaration then
471 Make_Subprogram_Declaration (Loc,
472 Specification => Specification (N)));
475 -- Link the body to the entity whose declaration it completes. If
476 -- the body is analyzed when the renamed entity is frozen, it may
477 -- be necessary to restore the proper scope (see package Exp_Ch13).
479 if Nkind (N) = N_Subprogram_Renaming_Declaration
480 and then Present (Corresponding_Spec (N))
482 Set_Corresponding_Spec (Body_Node, Corresponding_Spec (N));
484 Set_Corresponding_Spec (Body_Node, New_S);
488 end Build_Renamed_Body;
490 --------------------------
491 -- Check_Address_Clause --
492 --------------------------
494 procedure Check_Address_Clause (E : Entity_Id) is
495 Addr : constant Node_Id := Address_Clause (E);
497 Decl : constant Node_Id := Declaration_Node (E);
498 Typ : constant Entity_Id := Etype (E);
501 if Present (Addr) then
502 Expr := Expression (Addr);
504 -- If we have no initialization of any kind, then we don't need to
505 -- place any restrictions on the address clause, because the object
506 -- will be elaborated after the address clause is evaluated. This
507 -- happens if the declaration has no initial expression, or the type
508 -- has no implicit initialization, or the object is imported.
510 -- The same holds for all initialized scalar types and all access
511 -- types. Packed bit arrays of size up to 64 are represented using a
512 -- modular type with an initialization (to zero) and can be processed
513 -- like other initialized scalar types.
515 -- If the type is controlled, code to attach the object to a
516 -- finalization chain is generated at the point of declaration,
517 -- and therefore the elaboration of the object cannot be delayed:
518 -- the address expression must be a constant.
520 if (No (Expression (Decl))
521 and then not Needs_Finalization (Typ)
523 (not Has_Non_Null_Base_Init_Proc (Typ)
524 or else Is_Imported (E)))
527 (Present (Expression (Decl))
528 and then Is_Scalar_Type (Typ))
534 (Is_Bit_Packed_Array (Typ)
536 Is_Modular_Integer_Type (Packed_Array_Type (Typ)))
540 -- Otherwise, we require the address clause to be constant because
541 -- the call to the initialization procedure (or the attach code) has
542 -- to happen at the point of the declaration.
545 Check_Constant_Address_Clause (Expr, E);
546 Set_Has_Delayed_Freeze (E, False);
549 if not Error_Posted (Expr)
550 and then not Needs_Finalization (Typ)
552 Warn_Overlay (Expr, Typ, Name (Addr));
555 end Check_Address_Clause;
557 -----------------------------
558 -- Check_Compile_Time_Size --
559 -----------------------------
561 procedure Check_Compile_Time_Size (T : Entity_Id) is
563 procedure Set_Small_Size (T : Entity_Id; S : Uint);
564 -- Sets the compile time known size (32 bits or less) in the Esize
565 -- field, of T checking for a size clause that was given which attempts
566 -- to give a smaller size.
568 function Size_Known (T : Entity_Id) return Boolean;
569 -- Recursive function that does all the work
571 function Static_Discriminated_Components (T : Entity_Id) return Boolean;
572 -- If T is a constrained subtype, its size is not known if any of its
573 -- discriminant constraints is not static and it is not a null record.
574 -- The test is conservative and doesn't check that the components are
575 -- in fact constrained by non-static discriminant values. Could be made
582 procedure Set_Small_Size (T : Entity_Id; S : Uint) is
587 elsif Has_Size_Clause (T) then
588 if RM_Size (T) < S then
589 Error_Msg_Uint_1 := S;
591 ("size for & too small, minimum allowed is ^",
594 elsif Unknown_Esize (T) then
598 -- Set sizes if not set already
601 if Unknown_Esize (T) then
605 if Unknown_RM_Size (T) then
615 function Size_Known (T : Entity_Id) return Boolean is
623 if Size_Known_At_Compile_Time (T) then
626 -- Always True for scalar types. This is true even for generic formal
627 -- scalar types. We used to return False in the latter case, but the
628 -- size is known at compile time, even in the template, we just do
629 -- not know the exact size but that's not the point of this routine.
631 elsif Is_Scalar_Type (T)
632 or else Is_Task_Type (T)
638 elsif Is_Array_Type (T) then
640 -- String literals always have known size, and we can set it
642 if Ekind (T) = E_String_Literal_Subtype then
643 Set_Small_Size (T, Component_Size (T)
644 * String_Literal_Length (T));
647 -- Unconstrained types never have known at compile time size
649 elsif not Is_Constrained (T) then
652 -- Don't do any recursion on type with error posted, since we may
653 -- have a malformed type that leads us into a loop.
655 elsif Error_Posted (T) then
658 -- Otherwise if component size unknown, then array size unknown
660 elsif not Size_Known (Component_Type (T)) then
664 -- Check for all indexes static, and also compute possible size
665 -- (in case it is less than 32 and may be packable).
668 Esiz : Uint := Component_Size (T);
672 Index := First_Index (T);
673 while Present (Index) loop
674 if Nkind (Index) = N_Range then
675 Get_Index_Bounds (Index, Low, High);
677 elsif Error_Posted (Scalar_Range (Etype (Index))) then
681 Low := Type_Low_Bound (Etype (Index));
682 High := Type_High_Bound (Etype (Index));
685 if not Compile_Time_Known_Value (Low)
686 or else not Compile_Time_Known_Value (High)
687 or else Etype (Index) = Any_Type
692 Dim := Expr_Value (High) - Expr_Value (Low) + 1;
704 Set_Small_Size (T, Esiz);
708 -- Access types always have known at compile time sizes
710 elsif Is_Access_Type (T) then
713 -- For non-generic private types, go to underlying type if present
715 elsif Is_Private_Type (T)
716 and then not Is_Generic_Type (T)
717 and then Present (Underlying_Type (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 if Error_Posted (T) then
725 return Size_Known (Underlying_Type (T));
730 elsif Is_Record_Type (T) then
732 -- A class-wide type is never considered to have a known size
734 if Is_Class_Wide_Type (T) then
737 -- A subtype of a variant record must not have non-static
738 -- discriminanted components.
740 elsif T /= Base_Type (T)
741 and then not Static_Discriminated_Components (T)
745 -- Don't do any recursion on type with error posted, since we may
746 -- have a malformed type that leads us into a loop.
748 elsif Error_Posted (T) then
752 -- Now look at the components of the record
755 -- The following two variables are used to keep track of the
756 -- size of packed records if we can tell the size of the packed
757 -- record in the front end. Packed_Size_Known is True if so far
758 -- we can figure out the size. It is initialized to True for a
759 -- packed record, unless the record has discriminants. The
760 -- reason we eliminate the discriminated case is that we don't
761 -- know the way the back end lays out discriminated packed
762 -- records. If Packed_Size_Known is True, then Packed_Size is
763 -- the size in bits so far.
765 Packed_Size_Known : Boolean :=
767 and then not Has_Discriminants (T);
769 Packed_Size : Uint := Uint_0;
772 -- Test for variant part present
774 if Has_Discriminants (T)
775 and then Present (Parent (T))
776 and then Nkind (Parent (T)) = N_Full_Type_Declaration
777 and then Nkind (Type_Definition (Parent (T))) =
779 and then not Null_Present (Type_Definition (Parent (T)))
780 and then Present (Variant_Part
781 (Component_List (Type_Definition (Parent (T)))))
783 -- If variant part is present, and type is unconstrained,
784 -- then we must have defaulted discriminants, or a size
785 -- clause must be present for the type, or else the size
786 -- is definitely not known at compile time.
788 if not Is_Constrained (T)
790 No (Discriminant_Default_Value
791 (First_Discriminant (T)))
792 and then Unknown_Esize (T)
798 -- Loop through components
800 Comp := First_Component_Or_Discriminant (T);
801 while Present (Comp) loop
802 Ctyp := Etype (Comp);
804 -- We do not know the packed size if there is a component
805 -- clause present (we possibly could, but this would only
806 -- help in the case of a record with partial rep clauses.
807 -- That's because in the case of full rep clauses, the
808 -- size gets figured out anyway by a different circuit).
810 if Present (Component_Clause (Comp)) then
811 Packed_Size_Known := False;
814 -- We need to identify a component that is an array where
815 -- the index type is an enumeration type with non-standard
816 -- representation, and some bound of the type depends on a
819 -- This is because gigi computes the size by doing a
820 -- substitution of the appropriate discriminant value in
821 -- the size expression for the base type, and gigi is not
822 -- clever enough to evaluate the resulting expression (which
823 -- involves a call to rep_to_pos) at compile time.
825 -- It would be nice if gigi would either recognize that
826 -- this expression can be computed at compile time, or
827 -- alternatively figured out the size from the subtype
828 -- directly, where all the information is at hand ???
830 if Is_Array_Type (Etype (Comp))
831 and then Present (Packed_Array_Type (Etype (Comp)))
834 Ocomp : constant Entity_Id :=
835 Original_Record_Component (Comp);
836 OCtyp : constant Entity_Id := Etype (Ocomp);
842 Ind := First_Index (OCtyp);
843 while Present (Ind) loop
844 Indtyp := Etype (Ind);
846 if Is_Enumeration_Type (Indtyp)
847 and then Has_Non_Standard_Rep (Indtyp)
849 Lo := Type_Low_Bound (Indtyp);
850 Hi := Type_High_Bound (Indtyp);
852 if Is_Entity_Name (Lo)
853 and then Ekind (Entity (Lo)) = E_Discriminant
857 elsif Is_Entity_Name (Hi)
858 and then Ekind (Entity (Hi)) = E_Discriminant
869 -- Clearly size of record is not known if the size of one of
870 -- the components is not known.
872 if not Size_Known (Ctyp) then
876 -- Accumulate packed size if possible
878 if Packed_Size_Known then
880 -- We can only deal with elementary types, since for
881 -- non-elementary components, alignment enters into the
882 -- picture, and we don't know enough to handle proper
883 -- alignment in this context. Packed arrays count as
884 -- elementary if the representation is a modular type.
886 if Is_Elementary_Type (Ctyp)
887 or else (Is_Array_Type (Ctyp)
888 and then Present (Packed_Array_Type (Ctyp))
889 and then Is_Modular_Integer_Type
890 (Packed_Array_Type (Ctyp)))
892 -- If RM_Size is known and static, then we can
893 -- keep accumulating the packed size.
895 if Known_Static_RM_Size (Ctyp) then
897 -- A little glitch, to be removed sometime ???
898 -- gigi does not understand zero sizes yet.
900 if RM_Size (Ctyp) = Uint_0 then
901 Packed_Size_Known := False;
903 -- Normal case where we can keep accumulating the
904 -- packed array size.
907 Packed_Size := Packed_Size + RM_Size (Ctyp);
910 -- If we have a field whose RM_Size is not known then
911 -- we can't figure out the packed size here.
914 Packed_Size_Known := False;
917 -- If we have a non-elementary type we can't figure out
918 -- the packed array size (alignment issues).
921 Packed_Size_Known := False;
925 Next_Component_Or_Discriminant (Comp);
928 if Packed_Size_Known then
929 Set_Small_Size (T, Packed_Size);
935 -- All other cases, size not known at compile time
942 -------------------------------------
943 -- Static_Discriminated_Components --
944 -------------------------------------
946 function Static_Discriminated_Components
947 (T : Entity_Id) return Boolean
949 Constraint : Elmt_Id;
952 if Has_Discriminants (T)
953 and then Present (Discriminant_Constraint (T))
954 and then Present (First_Component (T))
956 Constraint := First_Elmt (Discriminant_Constraint (T));
957 while Present (Constraint) loop
958 if not Compile_Time_Known_Value (Node (Constraint)) then
962 Next_Elmt (Constraint);
967 end Static_Discriminated_Components;
969 -- Start of processing for Check_Compile_Time_Size
972 Set_Size_Known_At_Compile_Time (T, Size_Known (T));
973 end Check_Compile_Time_Size;
975 -----------------------------
976 -- Check_Debug_Info_Needed --
977 -----------------------------
979 procedure Check_Debug_Info_Needed (T : Entity_Id) is
981 if Debug_Info_Off (T) then
984 elsif Comes_From_Source (T)
985 or else Debug_Generated_Code
986 or else Debug_Flag_VV
987 or else Needs_Debug_Info (T)
989 Set_Debug_Info_Needed (T);
991 end Check_Debug_Info_Needed;
993 ----------------------------
994 -- Check_Strict_Alignment --
995 ----------------------------
997 procedure Check_Strict_Alignment (E : Entity_Id) is
1001 if Is_Tagged_Type (E) or else Is_Concurrent_Type (E) then
1002 Set_Strict_Alignment (E);
1004 elsif Is_Array_Type (E) then
1005 Set_Strict_Alignment (E, Strict_Alignment (Component_Type (E)));
1007 elsif Is_Record_Type (E) then
1008 if Is_Limited_Record (E) then
1009 Set_Strict_Alignment (E);
1013 Comp := First_Component (E);
1015 while Present (Comp) loop
1016 if not Is_Type (Comp)
1017 and then (Strict_Alignment (Etype (Comp))
1018 or else Is_Aliased (Comp))
1020 Set_Strict_Alignment (E);
1024 Next_Component (Comp);
1027 end Check_Strict_Alignment;
1029 -------------------------
1030 -- Check_Unsigned_Type --
1031 -------------------------
1033 procedure Check_Unsigned_Type (E : Entity_Id) is
1034 Ancestor : Entity_Id;
1039 if not Is_Discrete_Or_Fixed_Point_Type (E) then
1043 -- Do not attempt to analyze case where range was in error
1045 if Error_Posted (Scalar_Range (E)) then
1049 -- The situation that is non trivial is something like
1051 -- subtype x1 is integer range -10 .. +10;
1052 -- subtype x2 is x1 range 0 .. V1;
1053 -- subtype x3 is x2 range V2 .. V3;
1054 -- subtype x4 is x3 range V4 .. V5;
1056 -- where Vn are variables. Here the base type is signed, but we still
1057 -- know that x4 is unsigned because of the lower bound of x2.
1059 -- The only way to deal with this is to look up the ancestor chain
1063 if Ancestor = Any_Type or else Etype (Ancestor) = Any_Type then
1067 Lo_Bound := Type_Low_Bound (Ancestor);
1069 if Compile_Time_Known_Value (Lo_Bound) then
1071 if Expr_Rep_Value (Lo_Bound) >= 0 then
1072 Set_Is_Unsigned_Type (E, True);
1078 Ancestor := Ancestor_Subtype (Ancestor);
1080 -- If no ancestor had a static lower bound, go to base type
1082 if No (Ancestor) then
1084 -- Note: the reason we still check for a compile time known
1085 -- value for the base type is that at least in the case of
1086 -- generic formals, we can have bounds that fail this test,
1087 -- and there may be other cases in error situations.
1089 Btyp := Base_Type (E);
1091 if Btyp = Any_Type or else Etype (Btyp) = Any_Type then
1095 Lo_Bound := Type_Low_Bound (Base_Type (E));
1097 if Compile_Time_Known_Value (Lo_Bound)
1098 and then Expr_Rep_Value (Lo_Bound) >= 0
1100 Set_Is_Unsigned_Type (E, True);
1107 end Check_Unsigned_Type;
1109 -----------------------------
1110 -- Expand_Atomic_Aggregate --
1111 -----------------------------
1113 procedure Expand_Atomic_Aggregate (E : Entity_Id; Typ : Entity_Id) is
1114 Loc : constant Source_Ptr := Sloc (E);
1119 if (Nkind (Parent (E)) = N_Object_Declaration
1120 or else Nkind (Parent (E)) = N_Assignment_Statement)
1121 and then Comes_From_Source (Parent (E))
1122 and then Nkind (E) = N_Aggregate
1125 Make_Defining_Identifier (Loc,
1126 New_Internal_Name ('T'));
1129 Make_Object_Declaration (Loc,
1130 Defining_Identifier => Temp,
1131 Object_Definition => New_Occurrence_Of (Typ, Loc),
1132 Expression => Relocate_Node (E));
1133 Insert_Before (Parent (E), New_N);
1136 Set_Expression (Parent (E), New_Occurrence_Of (Temp, Loc));
1138 -- To prevent the temporary from being constant-folded (which would
1139 -- lead to the same piecemeal assignment on the original target)
1140 -- indicate to the back-end that the temporary is a variable with
1141 -- real storage. See description of this flag in Einfo, and the notes
1142 -- on N_Assignment_Statement and N_Object_Declaration in Sinfo.
1144 Set_Is_True_Constant (Temp, False);
1146 end Expand_Atomic_Aggregate;
1152 -- Note: the easy coding for this procedure would be to just build a
1153 -- single list of freeze nodes and then insert them and analyze them
1154 -- all at once. This won't work, because the analysis of earlier freeze
1155 -- nodes may recursively freeze types which would otherwise appear later
1156 -- on in the freeze list. So we must analyze and expand the freeze nodes
1157 -- as they are generated.
1159 procedure Freeze_All (From : Entity_Id; After : in out Node_Id) is
1160 Loc : constant Source_Ptr := Sloc (After);
1164 procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id);
1165 -- This is the internal recursive routine that does freezing of entities
1166 -- (but NOT the analysis of default expressions, which should not be
1167 -- recursive, we don't want to analyze those till we are sure that ALL
1168 -- the types are frozen).
1170 --------------------
1171 -- Freeze_All_Ent --
1172 --------------------
1174 procedure Freeze_All_Ent
1176 After : in out Node_Id)
1182 procedure Process_Flist;
1183 -- If freeze nodes are present, insert and analyze, and reset cursor
1184 -- for next insertion.
1190 procedure Process_Flist is
1192 if Is_Non_Empty_List (Flist) then
1193 Lastn := Next (After);
1194 Insert_List_After_And_Analyze (After, Flist);
1196 if Present (Lastn) then
1197 After := Prev (Lastn);
1199 After := Last (List_Containing (After));
1204 -- Start or processing for Freeze_All_Ent
1208 while Present (E) loop
1210 -- If the entity is an inner package which is not a package
1211 -- renaming, then its entities must be frozen at this point. Note
1212 -- that such entities do NOT get frozen at the end of the nested
1213 -- package itself (only library packages freeze).
1215 -- Same is true for task declarations, where anonymous records
1216 -- created for entry parameters must be frozen.
1218 if Ekind (E) = E_Package
1219 and then No (Renamed_Object (E))
1220 and then not Is_Child_Unit (E)
1221 and then not Is_Frozen (E)
1224 Install_Visible_Declarations (E);
1225 Install_Private_Declarations (E);
1227 Freeze_All (First_Entity (E), After);
1229 End_Package_Scope (E);
1231 elsif Ekind (E) in Task_Kind
1233 (Nkind (Parent (E)) = N_Task_Type_Declaration
1235 Nkind (Parent (E)) = N_Single_Task_Declaration)
1238 Freeze_All (First_Entity (E), After);
1241 -- For a derived tagged type, we must ensure that all the
1242 -- primitive operations of the parent have been frozen, so that
1243 -- their addresses will be in the parent's dispatch table at the
1244 -- point it is inherited.
1246 elsif Ekind (E) = E_Record_Type
1247 and then Is_Tagged_Type (E)
1248 and then Is_Tagged_Type (Etype (E))
1249 and then Is_Derived_Type (E)
1252 Prim_List : constant Elist_Id :=
1253 Primitive_Operations (Etype (E));
1259 Prim := First_Elmt (Prim_List);
1261 while Present (Prim) loop
1262 Subp := Node (Prim);
1264 if Comes_From_Source (Subp)
1265 and then not Is_Frozen (Subp)
1267 Flist := Freeze_Entity (Subp, Loc);
1276 if not Is_Frozen (E) then
1277 Flist := Freeze_Entity (E, Loc);
1281 -- If an incomplete type is still not frozen, this may be a
1282 -- premature freezing because of a body declaration that follows.
1283 -- Indicate where the freezing took place.
1285 -- If the freezing is caused by the end of the current declarative
1286 -- part, it is a Taft Amendment type, and there is no error.
1288 if not Is_Frozen (E)
1289 and then Ekind (E) = E_Incomplete_Type
1292 Bod : constant Node_Id := Next (After);
1295 if (Nkind (Bod) = N_Subprogram_Body
1296 or else Nkind (Bod) = N_Entry_Body
1297 or else Nkind (Bod) = N_Package_Body
1298 or else Nkind (Bod) = N_Protected_Body
1299 or else Nkind (Bod) = N_Task_Body
1300 or else Nkind (Bod) in N_Body_Stub)
1302 List_Containing (After) = List_Containing (Parent (E))
1304 Error_Msg_Sloc := Sloc (Next (After));
1306 ("type& is frozen# before its full declaration",
1316 -- Start of processing for Freeze_All
1319 Freeze_All_Ent (From, After);
1321 -- Now that all types are frozen, we can deal with default expressions
1322 -- that require us to build a default expression functions. This is the
1323 -- point at which such functions are constructed (after all types that
1324 -- might be used in such expressions have been frozen).
1326 -- We also add finalization chains to access types whose designated
1327 -- types are controlled. This is normally done when freezing the type,
1328 -- but this misses recursive type definitions where the later members
1329 -- of the recursion introduce controlled components.
1331 -- Loop through entities
1334 while Present (E) loop
1335 if Is_Subprogram (E) then
1337 if not Default_Expressions_Processed (E) then
1338 Process_Default_Expressions (E, After);
1341 if not Has_Completion (E) then
1342 Decl := Unit_Declaration_Node (E);
1344 if Nkind (Decl) = N_Subprogram_Renaming_Declaration then
1345 Build_And_Analyze_Renamed_Body (Decl, E, After);
1347 elsif Nkind (Decl) = N_Subprogram_Declaration
1348 and then Present (Corresponding_Body (Decl))
1350 Nkind (Unit_Declaration_Node (Corresponding_Body (Decl)))
1351 = N_Subprogram_Renaming_Declaration
1353 Build_And_Analyze_Renamed_Body
1354 (Decl, Corresponding_Body (Decl), After);
1358 elsif Ekind (E) in Task_Kind
1360 (Nkind (Parent (E)) = N_Task_Type_Declaration
1362 Nkind (Parent (E)) = N_Single_Task_Declaration)
1367 Ent := First_Entity (E);
1369 while Present (Ent) loop
1372 and then not Default_Expressions_Processed (Ent)
1374 Process_Default_Expressions (Ent, After);
1381 elsif Is_Access_Type (E)
1382 and then Comes_From_Source (E)
1383 and then Ekind (Directly_Designated_Type (E)) = E_Incomplete_Type
1384 and then Needs_Finalization (Designated_Type (E))
1385 and then No (Associated_Final_Chain (E))
1387 Build_Final_List (Parent (E), E);
1394 -----------------------
1395 -- Freeze_And_Append --
1396 -----------------------
1398 procedure Freeze_And_Append
1401 Result : in out List_Id)
1403 L : constant List_Id := Freeze_Entity (Ent, Loc);
1405 if Is_Non_Empty_List (L) then
1406 if Result = No_List then
1409 Append_List (L, Result);
1412 end Freeze_And_Append;
1418 procedure Freeze_Before (N : Node_Id; T : Entity_Id) is
1419 Freeze_Nodes : constant List_Id := Freeze_Entity (T, Sloc (N));
1421 if Is_Non_Empty_List (Freeze_Nodes) then
1422 Insert_Actions (N, Freeze_Nodes);
1430 function Freeze_Entity (E : Entity_Id; Loc : Source_Ptr) return List_Id is
1431 Test_E : Entity_Id := E;
1439 Has_Default_Initialization : Boolean := False;
1440 -- This flag gets set to true for a variable with default initialization
1442 procedure Check_Current_Instance (Comp_Decl : Node_Id);
1443 -- Check that an Access or Unchecked_Access attribute with a prefix
1444 -- which is the current instance type can only be applied when the type
1447 function After_Last_Declaration return Boolean;
1448 -- If Loc is a freeze_entity that appears after the last declaration
1449 -- in the scope, inhibit error messages on late completion.
1451 procedure Freeze_Record_Type (Rec : Entity_Id);
1452 -- Freeze each component, handle some representation clauses, and freeze
1453 -- primitive operations if this is a tagged type.
1455 ----------------------------
1456 -- After_Last_Declaration --
1457 ----------------------------
1459 function After_Last_Declaration return Boolean is
1460 Spec : constant Node_Id := Parent (Current_Scope);
1462 if Nkind (Spec) = N_Package_Specification then
1463 if Present (Private_Declarations (Spec)) then
1464 return Loc >= Sloc (Last (Private_Declarations (Spec)));
1465 elsif Present (Visible_Declarations (Spec)) then
1466 return Loc >= Sloc (Last (Visible_Declarations (Spec)));
1473 end After_Last_Declaration;
1475 ----------------------------
1476 -- Check_Current_Instance --
1477 ----------------------------
1479 procedure Check_Current_Instance (Comp_Decl : Node_Id) is
1481 Rec_Type : constant Entity_Id :=
1482 Scope (Defining_Identifier (Comp_Decl));
1484 Decl : constant Node_Id := Parent (Rec_Type);
1486 function Process (N : Node_Id) return Traverse_Result;
1487 -- Process routine to apply check to given node
1493 function Process (N : Node_Id) return Traverse_Result is
1496 when N_Attribute_Reference =>
1497 if (Attribute_Name (N) = Name_Access
1499 Attribute_Name (N) = Name_Unchecked_Access)
1500 and then Is_Entity_Name (Prefix (N))
1501 and then Is_Type (Entity (Prefix (N)))
1502 and then Entity (Prefix (N)) = E
1505 ("current instance must be a limited type", Prefix (N));
1511 when others => return OK;
1515 procedure Traverse is new Traverse_Proc (Process);
1517 -- Start of processing for Check_Current_Instance
1520 -- In Ada95, the (imprecise) rule is that the current instance of a
1521 -- limited type is aliased. In Ada2005, limitedness must be explicit:
1522 -- either a tagged type, or a limited record.
1524 if Is_Limited_Type (Rec_Type)
1526 (Ada_Version < Ada_05
1527 or else Is_Tagged_Type (Rec_Type))
1531 elsif Nkind (Decl) = N_Full_Type_Declaration
1532 and then Limited_Present (Type_Definition (Decl))
1537 Traverse (Comp_Decl);
1539 end Check_Current_Instance;
1541 ------------------------
1542 -- Freeze_Record_Type --
1543 ------------------------
1545 procedure Freeze_Record_Type (Rec : Entity_Id) is
1552 pragma Warnings (Off, Junk);
1554 Unplaced_Component : Boolean := False;
1555 -- Set True if we find at least one component with no component
1556 -- clause (used to warn about useless Pack pragmas).
1558 Placed_Component : Boolean := False;
1559 -- Set True if we find at least one component with a component
1560 -- clause (used to warn about useless Bit_Order pragmas).
1562 function Check_Allocator (N : Node_Id) return Node_Id;
1563 -- If N is an allocator, possibly wrapped in one or more level of
1564 -- qualified expression(s), return the inner allocator node, else
1567 procedure Check_Itype (Typ : Entity_Id);
1568 -- If the component subtype is an access to a constrained subtype of
1569 -- an already frozen type, make the subtype frozen as well. It might
1570 -- otherwise be frozen in the wrong scope, and a freeze node on
1571 -- subtype has no effect. Similarly, if the component subtype is a
1572 -- regular (not protected) access to subprogram, set the anonymous
1573 -- subprogram type to frozen as well, to prevent an out-of-scope
1574 -- freeze node at some eventual point of call. Protected operations
1575 -- are handled elsewhere.
1577 ---------------------
1578 -- Check_Allocator --
1579 ---------------------
1581 function Check_Allocator (N : Node_Id) return Node_Id is
1586 if Nkind (Inner) = N_Allocator then
1588 elsif Nkind (Inner) = N_Qualified_Expression then
1589 Inner := Expression (Inner);
1594 end Check_Allocator;
1600 procedure Check_Itype (Typ : Entity_Id) is
1601 Desig : constant Entity_Id := Designated_Type (Typ);
1604 if not Is_Frozen (Desig)
1605 and then Is_Frozen (Base_Type (Desig))
1607 Set_Is_Frozen (Desig);
1609 -- In addition, add an Itype_Reference to ensure that the
1610 -- access subtype is elaborated early enough. This cannot be
1611 -- done if the subtype may depend on discriminants.
1613 if Ekind (Comp) = E_Component
1614 and then Is_Itype (Etype (Comp))
1615 and then not Has_Discriminants (Rec)
1617 IR := Make_Itype_Reference (Sloc (Comp));
1618 Set_Itype (IR, Desig);
1621 Result := New_List (IR);
1623 Append (IR, Result);
1627 elsif Ekind (Typ) = E_Anonymous_Access_Subprogram_Type
1628 and then Convention (Desig) /= Convention_Protected
1630 Set_Is_Frozen (Desig);
1634 -- Start of processing for Freeze_Record_Type
1637 -- If this is a subtype of a controlled type, declared without a
1638 -- constraint, the _controller may not appear in the component list
1639 -- if the parent was not frozen at the point of subtype declaration.
1640 -- Inherit the _controller component now.
1642 if Rec /= Base_Type (Rec)
1643 and then Has_Controlled_Component (Rec)
1645 if Nkind (Parent (Rec)) = N_Subtype_Declaration
1646 and then Is_Entity_Name (Subtype_Indication (Parent (Rec)))
1648 Set_First_Entity (Rec, First_Entity (Base_Type (Rec)));
1650 -- If this is an internal type without a declaration, as for
1651 -- record component, the base type may not yet be frozen, and its
1652 -- controller has not been created. Add an explicit freeze node
1653 -- for the itype, so it will be frozen after the base type. This
1654 -- freeze node is used to communicate with the expander, in order
1655 -- to create the controller for the enclosing record, and it is
1656 -- deleted afterwards (see exp_ch3). It must not be created when
1657 -- expansion is off, because it might appear in the wrong context
1658 -- for the back end.
1660 elsif Is_Itype (Rec)
1661 and then Has_Delayed_Freeze (Base_Type (Rec))
1663 Nkind (Associated_Node_For_Itype (Rec)) =
1664 N_Component_Declaration
1665 and then Expander_Active
1667 Ensure_Freeze_Node (Rec);
1671 -- Freeze components and embedded subtypes
1673 Comp := First_Entity (Rec);
1675 while Present (Comp) loop
1677 -- First handle the (real) component case
1679 if Ekind (Comp) = E_Component
1680 or else Ekind (Comp) = E_Discriminant
1683 CC : constant Node_Id := Component_Clause (Comp);
1686 -- Freezing a record type freezes the type of each of its
1687 -- components. However, if the type of the component is
1688 -- part of this record, we do not want or need a separate
1689 -- Freeze_Node. Note that Is_Itype is wrong because that's
1690 -- also set in private type cases. We also can't check for
1691 -- the Scope being exactly Rec because of private types and
1692 -- record extensions.
1694 if Is_Itype (Etype (Comp))
1695 and then Is_Record_Type (Underlying_Type
1696 (Scope (Etype (Comp))))
1698 Undelay_Type (Etype (Comp));
1701 Freeze_And_Append (Etype (Comp), Loc, Result);
1703 -- Check for error of component clause given for variable
1704 -- sized type. We have to delay this test till this point,
1705 -- since the component type has to be frozen for us to know
1706 -- if it is variable length. We omit this test in a generic
1707 -- context, it will be applied at instantiation time.
1709 if Present (CC) then
1710 Placed_Component := True;
1712 if Inside_A_Generic then
1716 Size_Known_At_Compile_Time
1717 (Underlying_Type (Etype (Comp)))
1720 ("component clause not allowed for variable " &
1721 "length component", CC);
1725 Unplaced_Component := True;
1728 -- Case of component requires byte alignment
1730 if Must_Be_On_Byte_Boundary (Etype (Comp)) then
1732 -- Set the enclosing record to also require byte align
1734 Set_Must_Be_On_Byte_Boundary (Rec);
1736 -- Check for component clause that is inconsistent with
1737 -- the required byte boundary alignment.
1740 and then Normalized_First_Bit (Comp) mod
1741 System_Storage_Unit /= 0
1744 ("component & must be byte aligned",
1745 Component_Name (Component_Clause (Comp)));
1749 -- If component clause is present, then deal with the non-
1750 -- default bit order case for Ada 95 mode. The required
1751 -- processing for Ada 2005 mode is handled separately after
1752 -- processing all components.
1754 -- We only do this processing for the base type, and in
1755 -- fact that's important, since otherwise if there are
1756 -- record subtypes, we could reverse the bits once for
1757 -- each subtype, which would be incorrect.
1760 and then Reverse_Bit_Order (Rec)
1761 and then Ekind (E) = E_Record_Type
1762 and then Ada_Version <= Ada_95
1765 CFB : constant Uint := Component_Bit_Offset (Comp);
1766 CSZ : constant Uint := Esize (Comp);
1767 CLC : constant Node_Id := Component_Clause (Comp);
1768 Pos : constant Node_Id := Position (CLC);
1769 FB : constant Node_Id := First_Bit (CLC);
1771 Storage_Unit_Offset : constant Uint :=
1772 CFB / System_Storage_Unit;
1774 Start_Bit : constant Uint :=
1775 CFB mod System_Storage_Unit;
1778 -- Cases where field goes over storage unit boundary
1780 if Start_Bit + CSZ > System_Storage_Unit then
1782 -- Allow multi-byte field but generate warning
1784 if Start_Bit mod System_Storage_Unit = 0
1785 and then CSZ mod System_Storage_Unit = 0
1788 ("multi-byte field specified with non-standard"
1789 & " Bit_Order?", CLC);
1791 if Bytes_Big_Endian then
1793 ("bytes are not reversed "
1794 & "(component is big-endian)?", CLC);
1797 ("bytes are not reversed "
1798 & "(component is little-endian)?", CLC);
1801 -- Do not allow non-contiguous field
1805 ("attempt to specify non-contiguous field "
1806 & "not permitted", CLC);
1808 ("\caused by non-standard Bit_Order "
1809 & "specified", CLC);
1811 ("\consider possibility of using "
1812 & "Ada 2005 mode here", CLC);
1815 -- Case where field fits in one storage unit
1818 -- Give warning if suspicious component clause
1820 if Intval (FB) >= System_Storage_Unit
1821 and then Warn_On_Reverse_Bit_Order
1824 ("?Bit_Order clause does not affect " &
1825 "byte ordering", Pos);
1827 Intval (Pos) + Intval (FB) /
1828 System_Storage_Unit;
1830 ("?position normalized to ^ before bit " &
1831 "order interpreted", Pos);
1834 -- Here is where we fix up the Component_Bit_Offset
1835 -- value to account for the reverse bit order.
1836 -- Some examples of what needs to be done are:
1838 -- First_Bit .. Last_Bit Component_Bit_Offset
1841 -- 0 .. 0 7 .. 7 0 7
1842 -- 0 .. 1 6 .. 7 0 6
1843 -- 0 .. 2 5 .. 7 0 5
1844 -- 0 .. 7 0 .. 7 0 4
1846 -- 1 .. 1 6 .. 6 1 6
1847 -- 1 .. 4 3 .. 6 1 3
1848 -- 4 .. 7 0 .. 3 4 0
1850 -- The general rule is that the first bit is
1851 -- is obtained by subtracting the old ending bit
1852 -- from storage_unit - 1.
1854 Set_Component_Bit_Offset
1856 (Storage_Unit_Offset * System_Storage_Unit) +
1857 (System_Storage_Unit - 1) -
1858 (Start_Bit + CSZ - 1));
1860 Set_Normalized_First_Bit
1862 Component_Bit_Offset (Comp) mod
1863 System_Storage_Unit);
1870 -- If the component is an Itype with Delayed_Freeze and is either
1871 -- a record or array subtype and its base type has not yet been
1872 -- frozen, we must remove this from the entity list of this
1873 -- record and put it on the entity list of the scope of its base
1874 -- type. Note that we know that this is not the type of a
1875 -- component since we cleared Has_Delayed_Freeze for it in the
1876 -- previous loop. Thus this must be the Designated_Type of an
1877 -- access type, which is the type of a component.
1880 and then Is_Type (Scope (Comp))
1881 and then Is_Composite_Type (Comp)
1882 and then Base_Type (Comp) /= Comp
1883 and then Has_Delayed_Freeze (Comp)
1884 and then not Is_Frozen (Base_Type (Comp))
1887 Will_Be_Frozen : Boolean := False;
1891 -- We have a pretty bad kludge here. Suppose Rec is subtype
1892 -- being defined in a subprogram that's created as part of
1893 -- the freezing of Rec'Base. In that case, we know that
1894 -- Comp'Base must have already been frozen by the time we
1895 -- get to elaborate this because Gigi doesn't elaborate any
1896 -- bodies until it has elaborated all of the declarative
1897 -- part. But Is_Frozen will not be set at this point because
1898 -- we are processing code in lexical order.
1900 -- We detect this case by going up the Scope chain of Rec
1901 -- and seeing if we have a subprogram scope before reaching
1902 -- the top of the scope chain or that of Comp'Base. If we
1903 -- do, then mark that Comp'Base will actually be frozen. If
1904 -- so, we merely undelay it.
1907 while Present (S) loop
1908 if Is_Subprogram (S) then
1909 Will_Be_Frozen := True;
1911 elsif S = Scope (Base_Type (Comp)) then
1918 if Will_Be_Frozen then
1919 Undelay_Type (Comp);
1921 if Present (Prev) then
1922 Set_Next_Entity (Prev, Next_Entity (Comp));
1924 Set_First_Entity (Rec, Next_Entity (Comp));
1927 -- Insert in entity list of scope of base type (which
1928 -- must be an enclosing scope, because still unfrozen).
1930 Append_Entity (Comp, Scope (Base_Type (Comp)));
1934 -- If the component is an access type with an allocator as default
1935 -- value, the designated type will be frozen by the corresponding
1936 -- expression in init_proc. In order to place the freeze node for
1937 -- the designated type before that for the current record type,
1940 -- Same process if the component is an array of access types,
1941 -- initialized with an aggregate. If the designated type is
1942 -- private, it cannot contain allocators, and it is premature
1943 -- to freeze the type, so we check for this as well.
1945 elsif Is_Access_Type (Etype (Comp))
1946 and then Present (Parent (Comp))
1947 and then Present (Expression (Parent (Comp)))
1950 Alloc : constant Node_Id :=
1951 Check_Allocator (Expression (Parent (Comp)));
1954 if Present (Alloc) then
1956 -- If component is pointer to a classwide type, freeze
1957 -- the specific type in the expression being allocated.
1958 -- The expression may be a subtype indication, in which
1959 -- case freeze the subtype mark.
1961 if Is_Class_Wide_Type
1962 (Designated_Type (Etype (Comp)))
1964 if Is_Entity_Name (Expression (Alloc)) then
1966 (Entity (Expression (Alloc)), Loc, Result);
1968 Nkind (Expression (Alloc)) = N_Subtype_Indication
1971 (Entity (Subtype_Mark (Expression (Alloc))),
1975 elsif Is_Itype (Designated_Type (Etype (Comp))) then
1976 Check_Itype (Etype (Comp));
1980 (Designated_Type (Etype (Comp)), Loc, Result);
1985 elsif Is_Access_Type (Etype (Comp))
1986 and then Is_Itype (Designated_Type (Etype (Comp)))
1988 Check_Itype (Etype (Comp));
1990 elsif Is_Array_Type (Etype (Comp))
1991 and then Is_Access_Type (Component_Type (Etype (Comp)))
1992 and then Present (Parent (Comp))
1993 and then Nkind (Parent (Comp)) = N_Component_Declaration
1994 and then Present (Expression (Parent (Comp)))
1995 and then Nkind (Expression (Parent (Comp))) = N_Aggregate
1996 and then Is_Fully_Defined
1997 (Designated_Type (Component_Type (Etype (Comp))))
2001 (Component_Type (Etype (Comp))), Loc, Result);
2008 -- Deal with pragma Bit_Order
2010 if Reverse_Bit_Order (Rec) and then Base_Type (Rec) = Rec then
2011 if not Placed_Component then
2013 Get_Attribute_Definition_Clause (Rec, Attribute_Bit_Order);
2015 ("?Bit_Order specification has no effect", ADC);
2017 ("\?since no component clauses were specified", ADC);
2019 -- Here is where we do Ada 2005 processing for bit order (the Ada
2020 -- 95 case was already taken care of above).
2022 elsif Ada_Version >= Ada_05 then
2023 Adjust_Record_For_Reverse_Bit_Order (Rec);
2027 -- Set OK_To_Reorder_Components depending on debug flags
2029 if Rec = Base_Type (Rec)
2030 and then Convention (Rec) = Convention_Ada
2032 if (Has_Discriminants (Rec) and then Debug_Flag_Dot_V)
2034 (not Has_Discriminants (Rec) and then Debug_Flag_Dot_R)
2036 Set_OK_To_Reorder_Components (Rec);
2040 -- Check for useless pragma Pack when all components placed. We only
2041 -- do this check for record types, not subtypes, since a subtype may
2042 -- have all its components placed, and it still makes perfectly good
2043 -- sense to pack other subtypes or the parent type. We do not give
2044 -- this warning if Optimize_Alignment is set to Space, since the
2045 -- pragma Pack does have an effect in this case (it always resets
2046 -- the alignment to one).
2048 if Ekind (Rec) = E_Record_Type
2049 and then Is_Packed (Rec)
2050 and then not Unplaced_Component
2051 and then Optimize_Alignment /= 'S'
2053 -- Reset packed status. Probably not necessary, but we do it so
2054 -- that there is no chance of the back end doing something strange
2055 -- with this redundant indication of packing.
2057 Set_Is_Packed (Rec, False);
2059 -- Give warning if redundant constructs warnings on
2061 if Warn_On_Redundant_Constructs then
2063 ("?pragma Pack has no effect, no unplaced components",
2064 Get_Rep_Pragma (Rec, Name_Pack));
2068 -- If this is the record corresponding to a remote type, freeze the
2069 -- remote type here since that is what we are semantically freezing.
2070 -- This prevents the freeze node for that type in an inner scope.
2072 -- Also, Check for controlled components and unchecked unions.
2073 -- Finally, enforce the restriction that access attributes with a
2074 -- current instance prefix can only apply to limited types.
2076 if Ekind (Rec) = E_Record_Type then
2077 if Present (Corresponding_Remote_Type (Rec)) then
2079 (Corresponding_Remote_Type (Rec), Loc, Result);
2082 Comp := First_Component (Rec);
2083 while Present (Comp) loop
2084 if Has_Controlled_Component (Etype (Comp))
2085 or else (Chars (Comp) /= Name_uParent
2086 and then Is_Controlled (Etype (Comp)))
2087 or else (Is_Protected_Type (Etype (Comp))
2089 (Corresponding_Record_Type (Etype (Comp)))
2090 and then Has_Controlled_Component
2091 (Corresponding_Record_Type (Etype (Comp))))
2093 Set_Has_Controlled_Component (Rec);
2097 if Has_Unchecked_Union (Etype (Comp)) then
2098 Set_Has_Unchecked_Union (Rec);
2101 if Has_Per_Object_Constraint (Comp) then
2103 -- Scan component declaration for likely misuses of current
2104 -- instance, either in a constraint or a default expression.
2106 Check_Current_Instance (Parent (Comp));
2109 Next_Component (Comp);
2113 Set_Component_Alignment_If_Not_Set (Rec);
2115 -- For first subtypes, check if there are any fixed-point fields with
2116 -- component clauses, where we must check the size. This is not done
2117 -- till the freeze point, since for fixed-point types, we do not know
2118 -- the size until the type is frozen. Similar processing applies to
2119 -- bit packed arrays.
2121 if Is_First_Subtype (Rec) then
2122 Comp := First_Component (Rec);
2124 while Present (Comp) loop
2125 if Present (Component_Clause (Comp))
2126 and then (Is_Fixed_Point_Type (Etype (Comp))
2128 Is_Bit_Packed_Array (Etype (Comp)))
2131 (Component_Name (Component_Clause (Comp)),
2137 Next_Component (Comp);
2141 -- Generate warning for applying C or C++ convention to a record
2142 -- with discriminants. This is suppressed for the unchecked union
2143 -- case, since the whole point in this case is interface C. We also
2144 -- do not generate this within instantiations, since we will have
2145 -- generated a message on the template.
2147 if Has_Discriminants (E)
2148 and then not Is_Unchecked_Union (E)
2149 and then (Convention (E) = Convention_C
2151 Convention (E) = Convention_CPP)
2152 and then Comes_From_Source (E)
2153 and then not In_Instance
2154 and then not Has_Warnings_Off (E)
2155 and then not Has_Warnings_Off (Base_Type (E))
2158 Cprag : constant Node_Id := Get_Rep_Pragma (E, Name_Convention);
2162 if Present (Cprag) then
2163 A2 := Next (First (Pragma_Argument_Associations (Cprag)));
2165 if Convention (E) = Convention_C then
2167 ("?variant record has no direct equivalent in C", A2);
2170 ("?variant record has no direct equivalent in C++", A2);
2174 ("\?use of convention for type& is dubious", A2, E);
2178 end Freeze_Record_Type;
2180 -- Start of processing for Freeze_Entity
2183 -- We are going to test for various reasons why this entity need not be
2184 -- frozen here, but in the case of an Itype that's defined within a
2185 -- record, that test actually applies to the record.
2187 if Is_Itype (E) and then Is_Record_Type (Scope (E)) then
2188 Test_E := Scope (E);
2189 elsif Is_Itype (E) and then Present (Underlying_Type (Scope (E)))
2190 and then Is_Record_Type (Underlying_Type (Scope (E)))
2192 Test_E := Underlying_Type (Scope (E));
2195 -- Do not freeze if already frozen since we only need one freeze node
2197 if Is_Frozen (E) then
2200 -- It is improper to freeze an external entity within a generic because
2201 -- its freeze node will appear in a non-valid context. The entity will
2202 -- be frozen in the proper scope after the current generic is analyzed.
2204 elsif Inside_A_Generic and then External_Ref_In_Generic (Test_E) then
2207 -- Do not freeze a global entity within an inner scope created during
2208 -- expansion. A call to subprogram E within some internal procedure
2209 -- (a stream attribute for example) might require freezing E, but the
2210 -- freeze node must appear in the same declarative part as E itself.
2211 -- The two-pass elaboration mechanism in gigi guarantees that E will
2212 -- be frozen before the inner call is elaborated. We exclude constants
2213 -- from this test, because deferred constants may be frozen early, and
2214 -- must be diagnosed (e.g. in the case of a deferred constant being used
2215 -- in a default expression). If the enclosing subprogram comes from
2216 -- source, or is a generic instance, then the freeze point is the one
2217 -- mandated by the language, and we freeze the entity. A subprogram that
2218 -- is a child unit body that acts as a spec does not have a spec that
2219 -- comes from source, but can only come from source.
2221 elsif In_Open_Scopes (Scope (Test_E))
2222 and then Scope (Test_E) /= Current_Scope
2223 and then Ekind (Test_E) /= E_Constant
2226 S : Entity_Id := Current_Scope;
2229 while Present (S) loop
2230 if Is_Overloadable (S) then
2231 if Comes_From_Source (S)
2232 or else Is_Generic_Instance (S)
2233 or else Is_Child_Unit (S)
2245 -- Similarly, an inlined instance body may make reference to global
2246 -- entities, but these references cannot be the proper freezing point
2247 -- for them, and in the absence of inlining freezing will take place in
2248 -- their own scope. Normally instance bodies are analyzed after the
2249 -- enclosing compilation, and everything has been frozen at the proper
2250 -- place, but with front-end inlining an instance body is compiled
2251 -- before the end of the enclosing scope, and as a result out-of-order
2252 -- freezing must be prevented.
2254 elsif Front_End_Inlining
2255 and then In_Instance_Body
2256 and then Present (Scope (Test_E))
2259 S : Entity_Id := Scope (Test_E);
2262 while Present (S) loop
2263 if Is_Generic_Instance (S) then
2276 -- Here to freeze the entity
2281 -- Case of entity being frozen is other than a type
2283 if not Is_Type (E) then
2285 -- If entity is exported or imported and does not have an external
2286 -- name, now is the time to provide the appropriate default name.
2287 -- Skip this if the entity is stubbed, since we don't need a name
2288 -- for any stubbed routine.
2290 if (Is_Imported (E) or else Is_Exported (E))
2291 and then No (Interface_Name (E))
2292 and then Convention (E) /= Convention_Stubbed
2294 Set_Encoded_Interface_Name
2295 (E, Get_Default_External_Name (E));
2297 -- Special processing for atomic objects appearing in object decls
2300 and then Nkind (Parent (E)) = N_Object_Declaration
2301 and then Present (Expression (Parent (E)))
2304 Expr : constant Node_Id := Expression (Parent (E));
2307 -- If expression is an aggregate, assign to a temporary to
2308 -- ensure that the actual assignment is done atomically rather
2309 -- than component-wise (the assignment to the temp may be done
2310 -- component-wise, but that is harmless).
2312 if Nkind (Expr) = N_Aggregate then
2313 Expand_Atomic_Aggregate (Expr, Etype (E));
2315 -- If the expression is a reference to a record or array object
2316 -- entity, then reset Is_True_Constant to False so that the
2317 -- compiler will not optimize away the intermediate object,
2318 -- which we need in this case for the same reason (to ensure
2319 -- that the actual assignment is atomic, rather than
2322 elsif Is_Entity_Name (Expr)
2323 and then (Is_Record_Type (Etype (Expr))
2325 Is_Array_Type (Etype (Expr)))
2327 Set_Is_True_Constant (Entity (Expr), False);
2332 -- For a subprogram, freeze all parameter types and also the return
2333 -- type (RM 13.14(14)). However skip this for internal subprograms.
2334 -- This is also the point where any extra formal parameters are
2335 -- created since we now know whether the subprogram will use
2336 -- a foreign convention.
2338 if Is_Subprogram (E) then
2339 if not Is_Internal (E) then
2343 Warn_Node : Node_Id;
2346 -- Loop through formals
2348 Formal := First_Formal (E);
2349 while Present (Formal) loop
2350 F_Type := Etype (Formal);
2351 Freeze_And_Append (F_Type, Loc, Result);
2353 if Is_Private_Type (F_Type)
2354 and then Is_Private_Type (Base_Type (F_Type))
2355 and then No (Full_View (Base_Type (F_Type)))
2356 and then not Is_Generic_Type (F_Type)
2357 and then not Is_Derived_Type (F_Type)
2359 -- If the type of a formal is incomplete, subprogram
2360 -- is being frozen prematurely. Within an instance
2361 -- (but not within a wrapper package) this is an
2362 -- an artifact of our need to regard the end of an
2363 -- instantiation as a freeze point. Otherwise it is
2364 -- a definite error.
2366 -- and then not Is_Wrapper_Package (Current_Scope) ???
2369 Set_Is_Frozen (E, False);
2372 elsif not After_Last_Declaration
2373 and then not Freezing_Library_Level_Tagged_Type
2375 Error_Msg_Node_1 := F_Type;
2377 ("type& must be fully defined before this point",
2382 -- Check suspicious parameter for C function. These tests
2383 -- apply only to exported/imported subprograms.
2385 if Warn_On_Export_Import
2386 and then Comes_From_Source (E)
2387 and then (Convention (E) = Convention_C
2389 Convention (E) = Convention_CPP)
2390 and then (Is_Imported (E) or else Is_Exported (E))
2391 and then Convention (E) /= Convention (Formal)
2392 and then not Has_Warnings_Off (E)
2393 and then not Has_Warnings_Off (F_Type)
2394 and then not Has_Warnings_Off (Formal)
2396 Error_Msg_Qual_Level := 1;
2398 -- Check suspicious use of fat C pointer
2400 if Is_Access_Type (F_Type)
2401 and then Esize (F_Type) > Ttypes.System_Address_Size
2404 ("?type of & does not correspond "
2405 & "to C pointer!", Formal);
2407 -- Check suspicious return of boolean
2409 elsif Root_Type (F_Type) = Standard_Boolean
2410 and then Convention (F_Type) = Convention_Ada
2411 and then not Has_Warnings_Off (F_Type)
2412 and then not Has_Size_Clause (F_Type)
2415 ("?& is an 8-bit Ada Boolean, "
2416 & "use char in C!", Formal);
2418 -- Check suspicious tagged type
2420 elsif (Is_Tagged_Type (F_Type)
2421 or else (Is_Access_Type (F_Type)
2424 (Designated_Type (F_Type))))
2425 and then Convention (E) = Convention_C
2428 ("?& is a tagged type which does not "
2429 & "correspond to any C type!", Formal);
2431 -- Check wrong convention subprogram pointer
2433 elsif Ekind (F_Type) = E_Access_Subprogram_Type
2434 and then not Has_Foreign_Convention (F_Type)
2437 ("?subprogram pointer & should "
2438 & "have foreign convention!", Formal);
2439 Error_Msg_Sloc := Sloc (F_Type);
2441 ("\?add Convention pragma to declaration of &#",
2445 Error_Msg_Qual_Level := 0;
2448 -- Check for unconstrained array in exported foreign
2451 if Has_Foreign_Convention (E)
2452 and then not Is_Imported (E)
2453 and then Is_Array_Type (F_Type)
2454 and then not Is_Constrained (F_Type)
2455 and then Warn_On_Export_Import
2457 Error_Msg_Qual_Level := 1;
2459 -- If this is an inherited operation, place the
2460 -- warning on the derived type declaration, rather
2461 -- than on the original subprogram.
2463 if Nkind (Original_Node (Parent (E))) =
2464 N_Full_Type_Declaration
2466 Warn_Node := Parent (E);
2468 if Formal = First_Formal (E) then
2470 ("?in inherited operation&", Warn_Node, E);
2473 Warn_Node := Formal;
2477 ("?type of argument& is unconstrained array",
2480 ("?foreign caller must pass bounds explicitly",
2482 Error_Msg_Qual_Level := 0;
2485 -- Ada 2005 (AI-326): Check wrong use of tag incomplete
2486 -- types with unknown discriminants. For example:
2488 -- type T (<>) is tagged;
2489 -- procedure P (X : access T); -- ERROR
2490 -- procedure P (X : T); -- ERROR
2492 if not From_With_Type (F_Type) then
2493 if Is_Access_Type (F_Type) then
2494 F_Type := Designated_Type (F_Type);
2497 if Ekind (F_Type) = E_Incomplete_Type
2498 and then Is_Tagged_Type (F_Type)
2499 and then not Is_Class_Wide_Type (F_Type)
2500 and then No (Full_View (F_Type))
2501 and then Unknown_Discriminants_Present
2503 and then No (Stored_Constraint (F_Type))
2506 ("(Ada 2005): invalid use of unconstrained tagged"
2507 & " incomplete type", E);
2509 -- If the formal is an anonymous_access_to_subprogram
2510 -- freeze the subprogram type as well, to prevent
2511 -- scope anomalies in gigi, because there is no other
2512 -- clear point at which it could be frozen.
2514 elsif Is_Itype (Etype (Formal))
2515 and then Ekind (F_Type) = E_Subprogram_Type
2517 Freeze_And_Append (F_Type, Loc, Result);
2521 Next_Formal (Formal);
2526 if Ekind (E) = E_Function then
2528 -- Freeze return type
2530 R_Type := Etype (E);
2531 Freeze_And_Append (R_Type, Loc, Result);
2533 -- Check suspicious return type for C function
2535 if Warn_On_Export_Import
2536 and then (Convention (E) = Convention_C
2538 Convention (E) = Convention_CPP)
2539 and then (Is_Imported (E) or else Is_Exported (E))
2541 -- Check suspicious return of fat C pointer
2543 if Is_Access_Type (R_Type)
2544 and then Esize (R_Type) > Ttypes.System_Address_Size
2545 and then not Has_Warnings_Off (E)
2546 and then not Has_Warnings_Off (R_Type)
2549 ("?return type of& does not "
2550 & "correspond to C pointer!", E);
2552 -- Check suspicious return of boolean
2554 elsif Root_Type (R_Type) = Standard_Boolean
2555 and then Convention (R_Type) = Convention_Ada
2556 and then not Has_Warnings_Off (E)
2557 and then not Has_Warnings_Off (R_Type)
2558 and then not Has_Size_Clause (R_Type)
2561 ("?return type of & is an 8-bit "
2562 & "Ada Boolean, use char in C!", E);
2564 -- Check suspicious return tagged type
2566 elsif (Is_Tagged_Type (R_Type)
2567 or else (Is_Access_Type (R_Type)
2570 (Designated_Type (R_Type))))
2571 and then Convention (E) = Convention_C
2572 and then not Has_Warnings_Off (E)
2573 and then not Has_Warnings_Off (R_Type)
2576 ("?return type of & does not "
2577 & "correspond to C type!", E);
2579 -- Check return of wrong convention subprogram pointer
2581 elsif Ekind (R_Type) = E_Access_Subprogram_Type
2582 and then not Has_Foreign_Convention (R_Type)
2583 and then not Has_Warnings_Off (E)
2584 and then not Has_Warnings_Off (R_Type)
2587 ("?& should return a foreign "
2588 & "convention subprogram pointer", E);
2589 Error_Msg_Sloc := Sloc (R_Type);
2591 ("\?add Convention pragma to declaration of& #",
2596 if Is_Array_Type (Etype (E))
2597 and then not Is_Constrained (Etype (E))
2598 and then not Is_Imported (E)
2599 and then Has_Foreign_Convention (E)
2600 and then Warn_On_Export_Import
2601 and then not Has_Warnings_Off (E)
2602 and then not Has_Warnings_Off (Etype (E))
2605 ("?foreign convention function& should not " &
2606 "return unconstrained array!", E);
2608 -- Ada 2005 (AI-326): Check wrong use of tagged
2611 -- type T is tagged;
2612 -- function F (X : Boolean) return T; -- ERROR
2614 -- The type must be declared in the current scope for the
2615 -- use to be legal, and the full view must be available
2616 -- when the construct that mentions it is frozen.
2618 elsif Ekind (Etype (E)) = E_Incomplete_Type
2619 and then Is_Tagged_Type (Etype (E))
2620 and then No (Full_View (Etype (E)))
2621 and then not Is_Value_Type (Etype (E))
2624 ("(Ada 2005): invalid use of tagged incomplete type",
2631 -- Must freeze its parent first if it is a derived subprogram
2633 if Present (Alias (E)) then
2634 Freeze_And_Append (Alias (E), Loc, Result);
2637 -- We don't freeze internal subprograms, because we don't normally
2638 -- want addition of extra formals or mechanism setting to happen
2639 -- for those. However we do pass through predefined dispatching
2640 -- cases, since extra formals may be needed in some cases, such as
2641 -- for the stream 'Input function (build-in-place formals).
2643 if not Is_Internal (E)
2644 or else Is_Predefined_Dispatching_Operation (E)
2646 Freeze_Subprogram (E);
2649 -- Here for other than a subprogram or type
2652 -- For a generic package, freeze types within, so that proper
2653 -- cross-reference information is generated for tagged types.
2654 -- This is the only freeze processing needed for generic packages.
2656 if Ekind (E) = E_Generic_Package then
2661 T := First_Entity (E);
2662 while Present (T) loop
2664 Generate_Prim_Op_References (T);
2671 -- If entity has a type, and it is not a generic unit, then
2672 -- freeze it first (RM 13.14(10)).
2674 elsif Present (Etype (E))
2675 and then Ekind (E) /= E_Generic_Function
2677 Freeze_And_Append (Etype (E), Loc, Result);
2680 -- Special processing for objects created by object declaration
2682 if Nkind (Declaration_Node (E)) = N_Object_Declaration then
2684 -- For object created by object declaration, perform required
2685 -- categorization (preelaborate and pure) checks. Defer these
2686 -- checks to freeze time since pragma Import inhibits default
2687 -- initialization and thus pragma Import affects these checks.
2689 Validate_Object_Declaration (Declaration_Node (E));
2691 -- If there is an address clause, check that it is valid
2693 Check_Address_Clause (E);
2695 -- If the object needs any kind of default initialization, an
2696 -- error must be issued if No_Default_Initialization applies.
2697 -- The check doesn't apply to imported objects, which are not
2698 -- ever default initialized, and is why the check is deferred
2699 -- until freezing, at which point we know if Import applies.
2700 -- Deferred constants are also exempted from this test because
2701 -- their completion is explicit, or through an import pragma.
2703 if Ekind (E) = E_Constant
2704 and then Present (Full_View (E))
2708 elsif Comes_From_Source (E)
2709 and then not Is_Imported (E)
2710 and then not Has_Init_Expression (Declaration_Node (E))
2712 ((Has_Non_Null_Base_Init_Proc (Etype (E))
2713 and then not No_Initialization (Declaration_Node (E))
2714 and then not Is_Value_Type (Etype (E))
2715 and then not Suppress_Init_Proc (Etype (E)))
2717 (Needs_Simple_Initialization (Etype (E))
2718 and then not Is_Internal (E)))
2720 Has_Default_Initialization := True;
2722 (No_Default_Initialization, Declaration_Node (E));
2725 -- Check that a Thread_Local_Storage variable does not have
2726 -- default initialization, and any explicit initialization must
2727 -- either be the null constant or a static constant.
2729 if Has_Pragma_Thread_Local_Storage (E) then
2731 Decl : constant Node_Id := Declaration_Node (E);
2733 if Has_Default_Initialization
2735 (Has_Init_Expression (Decl)
2737 (No (Expression (Decl))
2739 (Is_Static_Expression (Expression (Decl))
2741 Nkind (Expression (Decl)) = N_Null)))
2744 ("Thread_Local_Storage variable& is "
2745 & "improperly initialized", Decl, E);
2747 ("\only allowed initialization is explicit "
2748 & "NULL or static expression", Decl, E);
2753 -- For imported objects, set Is_Public unless there is also an
2754 -- address clause, which means that there is no external symbol
2755 -- needed for the Import (Is_Public may still be set for other
2756 -- unrelated reasons). Note that we delayed this processing
2757 -- till freeze time so that we can be sure not to set the flag
2758 -- if there is an address clause. If there is such a clause,
2759 -- then the only purpose of the Import pragma is to suppress
2760 -- implicit initialization.
2763 and then No (Address_Clause (E))
2768 -- For convention C objects of an enumeration type, warn if
2769 -- the size is not integer size and no explicit size given.
2770 -- Skip warning for Boolean, and Character, assume programmer
2771 -- expects 8-bit sizes for these cases.
2773 if (Convention (E) = Convention_C
2775 Convention (E) = Convention_CPP)
2776 and then Is_Enumeration_Type (Etype (E))
2777 and then not Is_Character_Type (Etype (E))
2778 and then not Is_Boolean_Type (Etype (E))
2779 and then Esize (Etype (E)) < Standard_Integer_Size
2780 and then not Has_Size_Clause (E)
2782 Error_Msg_Uint_1 := UI_From_Int (Standard_Integer_Size);
2784 ("?convention C enumeration object has size less than ^",
2786 Error_Msg_N ("\?use explicit size clause to set size", E);
2790 -- Check that a constant which has a pragma Volatile[_Components]
2791 -- or Atomic[_Components] also has a pragma Import (RM C.6(13)).
2793 -- Note: Atomic[_Components] also sets Volatile[_Components]
2795 if Ekind (E) = E_Constant
2796 and then (Has_Volatile_Components (E) or else Is_Volatile (E))
2797 and then not Is_Imported (E)
2799 -- Make sure we actually have a pragma, and have not merely
2800 -- inherited the indication from elsewhere (e.g. an address
2801 -- clause, which is not good enough in RM terms!)
2803 if Has_Rep_Pragma (E, Name_Atomic)
2805 Has_Rep_Pragma (E, Name_Atomic_Components)
2808 ("stand alone atomic constant must be " &
2809 "imported (RM C.6(13))", E);
2811 elsif Has_Rep_Pragma (E, Name_Volatile)
2813 Has_Rep_Pragma (E, Name_Volatile_Components)
2816 ("stand alone volatile constant must be " &
2817 "imported (RM C.6(13))", E);
2821 -- Static objects require special handling
2823 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
2824 and then Is_Statically_Allocated (E)
2826 Freeze_Static_Object (E);
2829 -- Remaining step is to layout objects
2831 if Ekind (E) = E_Variable
2833 Ekind (E) = E_Constant
2835 Ekind (E) = E_Loop_Parameter
2843 -- Case of a type or subtype being frozen
2846 -- We used to check here that a full type must have preelaborable
2847 -- initialization if it completes a private type specified with
2848 -- pragma Preelaborable_Intialization, but that missed cases where
2849 -- the types occur within a generic package, since the freezing
2850 -- that occurs within a containing scope generally skips traversal
2851 -- of a generic unit's declarations (those will be frozen within
2852 -- instances). This check was moved to Analyze_Package_Specification.
2854 -- The type may be defined in a generic unit. This can occur when
2855 -- freezing a generic function that returns the type (which is
2856 -- defined in a parent unit). It is clearly meaningless to freeze
2857 -- this type. However, if it is a subtype, its size may be determi-
2858 -- nable and used in subsequent checks, so might as well try to
2861 if Present (Scope (E))
2862 and then Is_Generic_Unit (Scope (E))
2864 Check_Compile_Time_Size (E);
2868 -- Deal with special cases of freezing for subtype
2870 if E /= Base_Type (E) then
2872 -- Before we do anything else, a specialized test for the case of
2873 -- a size given for an array where the array needs to be packed,
2874 -- but was not so the size cannot be honored. This would of course
2875 -- be caught by the backend, and indeed we don't catch all cases.
2876 -- The point is that we can give a better error message in those
2877 -- cases that we do catch with the circuitry here. Also if pragma
2878 -- Implicit_Packing is set, this is where the packing occurs.
2880 -- The reason we do this so early is that the processing in the
2881 -- automatic packing case affects the layout of the base type, so
2882 -- it must be done before we freeze the base type.
2884 if Is_Array_Type (E) then
2887 Ctyp : constant Entity_Id := Component_Type (E);
2890 -- Check enabling conditions. These are straightforward
2891 -- except for the test for a limited composite type. This
2892 -- eliminates the rare case of a array of limited components
2893 -- where there are issues of whether or not we can go ahead
2894 -- and pack the array (since we can't freely pack and unpack
2895 -- arrays if they are limited).
2897 -- Note that we check the root type explicitly because the
2898 -- whole point is we are doing this test before we have had
2899 -- a chance to freeze the base type (and it is that freeze
2900 -- action that causes stuff to be inherited).
2902 if Present (Size_Clause (E))
2903 and then Known_Static_Esize (E)
2904 and then not Is_Packed (E)
2905 and then not Has_Pragma_Pack (E)
2906 and then Number_Dimensions (E) = 1
2907 and then not Has_Component_Size_Clause (E)
2908 and then Known_Static_Esize (Ctyp)
2909 and then not Is_Limited_Composite (E)
2910 and then not Is_Packed (Root_Type (E))
2911 and then not Has_Component_Size_Clause (Root_Type (E))
2913 Get_Index_Bounds (First_Index (E), Lo, Hi);
2915 if Compile_Time_Known_Value (Lo)
2916 and then Compile_Time_Known_Value (Hi)
2917 and then Known_Static_RM_Size (Ctyp)
2918 and then RM_Size (Ctyp) < 64
2921 Lov : constant Uint := Expr_Value (Lo);
2922 Hiv : constant Uint := Expr_Value (Hi);
2923 Len : constant Uint := UI_Max
2926 Rsiz : constant Uint := RM_Size (Ctyp);
2927 SZ : constant Node_Id := Size_Clause (E);
2928 Btyp : constant Entity_Id := Base_Type (E);
2930 -- What we are looking for here is the situation where
2931 -- the RM_Size given would be exactly right if there
2932 -- was a pragma Pack (resulting in the component size
2933 -- being the same as the RM_Size). Furthermore, the
2934 -- component type size must be an odd size (not a
2935 -- multiple of storage unit)
2938 if RM_Size (E) = Len * Rsiz
2939 and then Rsiz mod System_Storage_Unit /= 0
2941 -- For implicit packing mode, just set the
2942 -- component size silently
2944 if Implicit_Packing then
2945 Set_Component_Size (Btyp, Rsiz);
2946 Set_Is_Bit_Packed_Array (Btyp);
2947 Set_Is_Packed (Btyp);
2948 Set_Has_Non_Standard_Rep (Btyp);
2950 -- Otherwise give an error message
2954 ("size given for& too small", SZ, E);
2956 ("\use explicit pragma Pack "
2957 & "or use pragma Implicit_Packing", SZ);
2966 -- If ancestor subtype present, freeze that first. Note that this
2967 -- will also get the base type frozen.
2969 Atype := Ancestor_Subtype (E);
2971 if Present (Atype) then
2972 Freeze_And_Append (Atype, Loc, Result);
2974 -- Otherwise freeze the base type of the entity before freezing
2975 -- the entity itself (RM 13.14(15)).
2977 elsif E /= Base_Type (E) then
2978 Freeze_And_Append (Base_Type (E), Loc, Result);
2981 -- For a derived type, freeze its parent type first (RM 13.14(15))
2983 elsif Is_Derived_Type (E) then
2984 Freeze_And_Append (Etype (E), Loc, Result);
2985 Freeze_And_Append (First_Subtype (Etype (E)), Loc, Result);
2988 -- For array type, freeze index types and component type first
2989 -- before freezing the array (RM 13.14(15)).
2991 if Is_Array_Type (E) then
2993 Ctyp : constant Entity_Id := Component_Type (E);
2995 Non_Standard_Enum : Boolean := False;
2996 -- Set true if any of the index types is an enumeration type
2997 -- with a non-standard representation.
3000 Freeze_And_Append (Ctyp, Loc, Result);
3002 Indx := First_Index (E);
3003 while Present (Indx) loop
3004 Freeze_And_Append (Etype (Indx), Loc, Result);
3006 if Is_Enumeration_Type (Etype (Indx))
3007 and then Has_Non_Standard_Rep (Etype (Indx))
3009 Non_Standard_Enum := True;
3015 -- Processing that is done only for base types
3017 if Ekind (E) = E_Array_Type then
3019 -- Propagate flags for component type
3021 if Is_Controlled (Component_Type (E))
3022 or else Has_Controlled_Component (Ctyp)
3024 Set_Has_Controlled_Component (E);
3027 if Has_Unchecked_Union (Component_Type (E)) then
3028 Set_Has_Unchecked_Union (E);
3031 -- If packing was requested or if the component size was set
3032 -- explicitly, then see if bit packing is required. This
3033 -- processing is only done for base types, since all the
3034 -- representation aspects involved are type-related. This
3035 -- is not just an optimization, if we start processing the
3036 -- subtypes, they interfere with the settings on the base
3037 -- type (this is because Is_Packed has a slightly different
3038 -- meaning before and after freezing).
3045 if (Is_Packed (E) or else Has_Pragma_Pack (E))
3046 and then not Has_Atomic_Components (E)
3047 and then Known_Static_RM_Size (Ctyp)
3049 Csiz := UI_Max (RM_Size (Ctyp), 1);
3051 elsif Known_Component_Size (E) then
3052 Csiz := Component_Size (E);
3054 elsif not Known_Static_Esize (Ctyp) then
3058 Esiz := Esize (Ctyp);
3060 -- We can set the component size if it is less than
3061 -- 16, rounding it up to the next storage unit size.
3065 elsif Esiz <= 16 then
3071 -- Set component size up to match alignment if it
3072 -- would otherwise be less than the alignment. This
3073 -- deals with cases of types whose alignment exceeds
3074 -- their size (padded types).
3078 A : constant Uint := Alignment_In_Bits (Ctyp);
3087 -- Case of component size that may result in packing
3089 if 1 <= Csiz and then Csiz <= 64 then
3091 Ent : constant Entity_Id :=
3093 Pack_Pragma : constant Node_Id :=
3094 Get_Rep_Pragma (Ent, Name_Pack);
3095 Comp_Size_C : constant Node_Id :=
3096 Get_Attribute_Definition_Clause
3097 (Ent, Attribute_Component_Size);
3099 -- Warn if we have pack and component size so that
3100 -- the pack is ignored.
3102 -- Note: here we must check for the presence of a
3103 -- component size before checking for a Pack pragma
3104 -- to deal with the case where the array type is a
3105 -- derived type whose parent is currently private.
3107 if Present (Comp_Size_C)
3108 and then Has_Pragma_Pack (Ent)
3110 Error_Msg_Sloc := Sloc (Comp_Size_C);
3112 ("?pragma Pack for& ignored!",
3115 ("\?explicit component size given#!",
3119 -- Set component size if not already set by a
3120 -- component size clause.
3122 if not Present (Comp_Size_C) then
3123 Set_Component_Size (E, Csiz);
3126 -- Check for base type of 8, 16, 32 bits, where an
3127 -- unsigned subtype has a length one less than the
3128 -- base type (e.g. Natural subtype of Integer).
3130 -- In such cases, if a component size was not set
3131 -- explicitly, then generate a warning.
3133 if Has_Pragma_Pack (E)
3134 and then not Present (Comp_Size_C)
3136 (Csiz = 7 or else Csiz = 15 or else Csiz = 31)
3137 and then Esize (Base_Type (Ctyp)) = Csiz + 1
3139 Error_Msg_Uint_1 := Csiz;
3141 if Present (Pack_Pragma) then
3143 ("?pragma Pack causes component size "
3144 & "to be ^!", Pack_Pragma);
3146 ("\?use Component_Size to set "
3147 & "desired value!", Pack_Pragma);
3151 -- Actual packing is not needed for 8, 16, 32, 64.
3152 -- Also not needed for 24 if alignment is 1.
3158 or else (Csiz = 24 and then Alignment (Ctyp) = 1)
3160 -- Here the array was requested to be packed,
3161 -- but the packing request had no effect, so
3162 -- Is_Packed is reset.
3164 -- Note: semantically this means that we lose
3165 -- track of the fact that a derived type
3166 -- inherited a pragma Pack that was non-
3167 -- effective, but that seems fine.
3169 -- We regard a Pack pragma as a request to set
3170 -- a representation characteristic, and this
3171 -- request may be ignored.
3173 Set_Is_Packed (Base_Type (E), False);
3175 -- In all other cases, packing is indeed needed
3178 Set_Has_Non_Standard_Rep (Base_Type (E));
3179 Set_Is_Bit_Packed_Array (Base_Type (E));
3180 Set_Is_Packed (Base_Type (E));
3186 -- Processing that is done only for subtypes
3189 -- Acquire alignment from base type
3191 if Unknown_Alignment (E) then
3192 Set_Alignment (E, Alignment (Base_Type (E)));
3193 Adjust_Esize_Alignment (E);
3197 -- For bit-packed arrays, check the size
3199 if Is_Bit_Packed_Array (E)
3200 and then Known_RM_Size (E)
3203 SizC : constant Node_Id := Size_Clause (E);
3206 pragma Warnings (Off, Discard);
3209 -- It is not clear if it is possible to have no size
3210 -- clause at this stage, but it is not worth worrying
3211 -- about. Post error on the entity name in the size
3212 -- clause if present, else on the type entity itself.
3214 if Present (SizC) then
3215 Check_Size (Name (SizC), E, RM_Size (E), Discard);
3217 Check_Size (E, E, RM_Size (E), Discard);
3222 -- If any of the index types was an enumeration type with
3223 -- a non-standard rep clause, then we indicate that the
3224 -- array type is always packed (even if it is not bit packed).
3226 if Non_Standard_Enum then
3227 Set_Has_Non_Standard_Rep (Base_Type (E));
3228 Set_Is_Packed (Base_Type (E));
3231 Set_Component_Alignment_If_Not_Set (E);
3233 -- If the array is packed, we must create the packed array
3234 -- type to be used to actually implement the type. This is
3235 -- only needed for real array types (not for string literal
3236 -- types, since they are present only for the front end).
3239 and then Ekind (E) /= E_String_Literal_Subtype
3241 Create_Packed_Array_Type (E);
3242 Freeze_And_Append (Packed_Array_Type (E), Loc, Result);
3244 -- Size information of packed array type is copied to the
3245 -- array type, since this is really the representation. But
3246 -- do not override explicit existing size values. If the
3247 -- ancestor subtype is constrained the packed_array_type
3248 -- will be inherited from it, but the size may have been
3249 -- provided already, and must not be overridden either.
3251 if not Has_Size_Clause (E)
3253 (No (Ancestor_Subtype (E))
3254 or else not Has_Size_Clause (Ancestor_Subtype (E)))
3256 Set_Esize (E, Esize (Packed_Array_Type (E)));
3257 Set_RM_Size (E, RM_Size (Packed_Array_Type (E)));
3260 if not Has_Alignment_Clause (E) then
3261 Set_Alignment (E, Alignment (Packed_Array_Type (E)));
3265 -- For non-packed arrays set the alignment of the array to the
3266 -- alignment of the component type if it is unknown. Skip this
3267 -- in atomic case (atomic arrays may need larger alignments).
3269 if not Is_Packed (E)
3270 and then Unknown_Alignment (E)
3271 and then Known_Alignment (Ctyp)
3272 and then Known_Static_Component_Size (E)
3273 and then Known_Static_Esize (Ctyp)
3274 and then Esize (Ctyp) = Component_Size (E)
3275 and then not Is_Atomic (E)
3277 Set_Alignment (E, Alignment (Component_Type (E)));
3281 -- For a class-wide type, the corresponding specific type is
3282 -- frozen as well (RM 13.14(15))
3284 elsif Is_Class_Wide_Type (E) then
3285 Freeze_And_Append (Root_Type (E), Loc, Result);
3287 -- If the base type of the class-wide type is still incomplete,
3288 -- the class-wide remains unfrozen as well. This is legal when
3289 -- E is the formal of a primitive operation of some other type
3290 -- which is being frozen.
3292 if not Is_Frozen (Root_Type (E)) then
3293 Set_Is_Frozen (E, False);
3297 -- If the Class_Wide_Type is an Itype (when type is the anonymous
3298 -- parent of a derived type) and it is a library-level entity,
3299 -- generate an itype reference for it. Otherwise, its first
3300 -- explicit reference may be in an inner scope, which will be
3301 -- rejected by the back-end.
3304 and then Is_Compilation_Unit (Scope (E))
3307 Ref : constant Node_Id := Make_Itype_Reference (Loc);
3312 Result := New_List (Ref);
3314 Append (Ref, Result);
3319 -- The equivalent type associated with a class-wide subtype needs
3320 -- to be frozen to ensure that its layout is done. Class-wide
3321 -- subtypes are currently only frozen on targets requiring
3322 -- front-end layout (see New_Class_Wide_Subtype and
3323 -- Make_CW_Equivalent_Type in exp_util.adb).
3325 if Ekind (E) = E_Class_Wide_Subtype
3326 and then Present (Equivalent_Type (E))
3328 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3331 -- For a record (sub)type, freeze all the component types (RM
3332 -- 13.14(15). We test for E_Record_(sub)Type here, rather than using
3333 -- Is_Record_Type, because we don't want to attempt the freeze for
3334 -- the case of a private type with record extension (we will do that
3335 -- later when the full type is frozen).
3337 elsif Ekind (E) = E_Record_Type
3338 or else Ekind (E) = E_Record_Subtype
3340 Freeze_Record_Type (E);
3342 -- For a concurrent type, freeze corresponding record type. This
3343 -- does not correspond to any specific rule in the RM, but the
3344 -- record type is essentially part of the concurrent type.
3345 -- Freeze as well all local entities. This includes record types
3346 -- created for entry parameter blocks, and whatever local entities
3347 -- may appear in the private part.
3349 elsif Is_Concurrent_Type (E) then
3350 if Present (Corresponding_Record_Type (E)) then
3352 (Corresponding_Record_Type (E), Loc, Result);
3355 Comp := First_Entity (E);
3357 while Present (Comp) loop
3358 if Is_Type (Comp) then
3359 Freeze_And_Append (Comp, Loc, Result);
3361 elsif (Ekind (Comp)) /= E_Function then
3362 if Is_Itype (Etype (Comp))
3363 and then Underlying_Type (Scope (Etype (Comp))) = E
3365 Undelay_Type (Etype (Comp));
3368 Freeze_And_Append (Etype (Comp), Loc, Result);
3374 -- Private types are required to point to the same freeze node as
3375 -- their corresponding full views. The freeze node itself has to
3376 -- point to the partial view of the entity (because from the partial
3377 -- view, we can retrieve the full view, but not the reverse).
3378 -- However, in order to freeze correctly, we need to freeze the full
3379 -- view. If we are freezing at the end of a scope (or within the
3380 -- scope of the private type), the partial and full views will have
3381 -- been swapped, the full view appears first in the entity chain and
3382 -- the swapping mechanism ensures that the pointers are properly set
3385 -- If we encounter the partial view before the full view (e.g. when
3386 -- freezing from another scope), we freeze the full view, and then
3387 -- set the pointers appropriately since we cannot rely on swapping to
3388 -- fix things up (subtypes in an outer scope might not get swapped).
3390 elsif Is_Incomplete_Or_Private_Type (E)
3391 and then not Is_Generic_Type (E)
3393 -- The construction of the dispatch table associated with library
3394 -- level tagged types forces freezing of all the primitives of the
3395 -- type, which may cause premature freezing of the partial view.
3399 -- type T is tagged private;
3400 -- type DT is new T with private;
3401 -- procedure Prim (X : in out T; Y : in out DT'class);
3403 -- type T is tagged null record;
3405 -- type DT is new T with null record;
3408 -- In this case the type will be frozen later by the usual
3409 -- mechanism: an object declaration, an instantiation, or the
3410 -- end of a declarative part.
3412 if Is_Library_Level_Tagged_Type (E)
3413 and then not Present (Full_View (E))
3415 Set_Is_Frozen (E, False);
3418 -- Case of full view present
3420 elsif Present (Full_View (E)) then
3422 -- If full view has already been frozen, then no further
3423 -- processing is required
3425 if Is_Frozen (Full_View (E)) then
3427 Set_Has_Delayed_Freeze (E, False);
3428 Set_Freeze_Node (E, Empty);
3429 Check_Debug_Info_Needed (E);
3431 -- Otherwise freeze full view and patch the pointers so that
3432 -- the freeze node will elaborate both views in the back-end.
3436 Full : constant Entity_Id := Full_View (E);
3439 if Is_Private_Type (Full)
3440 and then Present (Underlying_Full_View (Full))
3443 (Underlying_Full_View (Full), Loc, Result);
3446 Freeze_And_Append (Full, Loc, Result);
3448 if Has_Delayed_Freeze (E) then
3449 F_Node := Freeze_Node (Full);
3451 if Present (F_Node) then
3452 Set_Freeze_Node (E, F_Node);
3453 Set_Entity (F_Node, E);
3456 -- {Incomplete,Private}_Subtypes with Full_Views
3457 -- constrained by discriminants.
3459 Set_Has_Delayed_Freeze (E, False);
3460 Set_Freeze_Node (E, Empty);
3465 Check_Debug_Info_Needed (E);
3468 -- AI-117 requires that the convention of a partial view be the
3469 -- same as the convention of the full view. Note that this is a
3470 -- recognized breach of privacy, but it's essential for logical
3471 -- consistency of representation, and the lack of a rule in
3472 -- RM95 was an oversight.
3474 Set_Convention (E, Convention (Full_View (E)));
3476 Set_Size_Known_At_Compile_Time (E,
3477 Size_Known_At_Compile_Time (Full_View (E)));
3479 -- Size information is copied from the full view to the
3480 -- incomplete or private view for consistency.
3482 -- We skip this is the full view is not a type. This is very
3483 -- strange of course, and can only happen as a result of
3484 -- certain illegalities, such as a premature attempt to derive
3485 -- from an incomplete type.
3487 if Is_Type (Full_View (E)) then
3488 Set_Size_Info (E, Full_View (E));
3489 Set_RM_Size (E, RM_Size (Full_View (E)));
3494 -- Case of no full view present. If entity is derived or subtype,
3495 -- it is safe to freeze, correctness depends on the frozen status
3496 -- of parent. Otherwise it is either premature usage, or a Taft
3497 -- amendment type, so diagnosis is at the point of use and the
3498 -- type might be frozen later.
3500 elsif E /= Base_Type (E)
3501 or else Is_Derived_Type (E)
3506 Set_Is_Frozen (E, False);
3510 -- For access subprogram, freeze types of all formals, the return
3511 -- type was already frozen, since it is the Etype of the function.
3513 elsif Ekind (E) = E_Subprogram_Type then
3514 Formal := First_Formal (E);
3515 while Present (Formal) loop
3516 Freeze_And_Append (Etype (Formal), Loc, Result);
3517 Next_Formal (Formal);
3520 Freeze_Subprogram (E);
3522 -- Ada 2005 (AI-326): Check wrong use of tag incomplete type
3524 -- type T is tagged;
3525 -- type Acc is access function (X : T) return T; -- ERROR
3527 if Ekind (Etype (E)) = E_Incomplete_Type
3528 and then Is_Tagged_Type (Etype (E))
3529 and then No (Full_View (Etype (E)))
3530 and then not Is_Value_Type (Etype (E))
3533 ("(Ada 2005): invalid use of tagged incomplete type", E);
3536 -- For access to a protected subprogram, freeze the equivalent type
3537 -- (however this is not set if we are not generating code or if this
3538 -- is an anonymous type used just for resolution).
3540 elsif Is_Access_Protected_Subprogram_Type (E) then
3542 -- AI-326: Check wrong use of tagged incomplete types
3544 -- type T is tagged;
3545 -- type As3D is access protected
3546 -- function (X : Float) return T; -- ERROR
3552 Etyp := Etype (Directly_Designated_Type (E));
3554 if Is_Class_Wide_Type (Etyp) then
3555 Etyp := Etype (Etyp);
3558 if Ekind (Etyp) = E_Incomplete_Type
3559 and then Is_Tagged_Type (Etyp)
3560 and then No (Full_View (Etyp))
3561 and then not Is_Value_Type (Etype (E))
3564 ("(Ada 2005): invalid use of tagged incomplete type", E);
3568 if Present (Equivalent_Type (E)) then
3569 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3573 -- Generic types are never seen by the back-end, and are also not
3574 -- processed by the expander (since the expander is turned off for
3575 -- generic processing), so we never need freeze nodes for them.
3577 if Is_Generic_Type (E) then
3581 -- Some special processing for non-generic types to complete
3582 -- representation details not known till the freeze point.
3584 if Is_Fixed_Point_Type (E) then
3585 Freeze_Fixed_Point_Type (E);
3587 -- Some error checks required for ordinary fixed-point type. Defer
3588 -- these till the freeze-point since we need the small and range
3589 -- values. We only do these checks for base types
3591 if Is_Ordinary_Fixed_Point_Type (E)
3592 and then E = Base_Type (E)
3594 if Small_Value (E) < Ureal_2_M_80 then
3595 Error_Msg_Name_1 := Name_Small;
3597 ("`&''%` too small, minimum allowed is 2.0'*'*(-80)", E);
3599 elsif Small_Value (E) > Ureal_2_80 then
3600 Error_Msg_Name_1 := Name_Small;
3602 ("`&''%` too large, maximum allowed is 2.0'*'*80", E);
3605 if Expr_Value_R (Type_Low_Bound (E)) < Ureal_M_10_36 then
3606 Error_Msg_Name_1 := Name_First;
3608 ("`&''%` too small, minimum allowed is -10.0'*'*36", E);
3611 if Expr_Value_R (Type_High_Bound (E)) > Ureal_10_36 then
3612 Error_Msg_Name_1 := Name_Last;
3614 ("`&''%` too large, maximum allowed is 10.0'*'*36", E);
3618 elsif Is_Enumeration_Type (E) then
3619 Freeze_Enumeration_Type (E);
3621 elsif Is_Integer_Type (E) then
3622 Adjust_Esize_For_Alignment (E);
3624 elsif Is_Access_Type (E) then
3626 -- Check restriction for standard storage pool
3628 if No (Associated_Storage_Pool (E)) then
3629 Check_Restriction (No_Standard_Storage_Pools, E);
3632 -- Deal with error message for pure access type. This is not an
3633 -- error in Ada 2005 if there is no pool (see AI-366).
3635 if Is_Pure_Unit_Access_Type (E)
3636 and then (Ada_Version < Ada_05
3637 or else not No_Pool_Assigned (E))
3639 Error_Msg_N ("named access type not allowed in pure unit", E);
3641 if Ada_Version >= Ada_05 then
3643 ("\would be legal if Storage_Size of 0 given?", E);
3645 elsif No_Pool_Assigned (E) then
3647 ("\would be legal in Ada 2005?", E);
3651 ("\would be legal in Ada 2005 if "
3652 & "Storage_Size of 0 given?", E);
3657 -- Case of composite types
3659 if Is_Composite_Type (E) then
3661 -- AI-117 requires that all new primitives of a tagged type must
3662 -- inherit the convention of the full view of the type. Inherited
3663 -- and overriding operations are defined to inherit the convention
3664 -- of their parent or overridden subprogram (also specified in
3665 -- AI-117), which will have occurred earlier (in Derive_Subprogram
3666 -- and New_Overloaded_Entity). Here we set the convention of
3667 -- primitives that are still convention Ada, which will ensure
3668 -- that any new primitives inherit the type's convention. Class-
3669 -- wide types can have a foreign convention inherited from their
3670 -- specific type, but are excluded from this since they don't have
3671 -- any associated primitives.
3673 if Is_Tagged_Type (E)
3674 and then not Is_Class_Wide_Type (E)
3675 and then Convention (E) /= Convention_Ada
3678 Prim_List : constant Elist_Id := Primitive_Operations (E);
3681 Prim := First_Elmt (Prim_List);
3682 while Present (Prim) loop
3683 if Convention (Node (Prim)) = Convention_Ada then
3684 Set_Convention (Node (Prim), Convention (E));
3693 -- Generate references to primitive operations for a tagged type
3695 Generate_Prim_Op_References (E);
3697 -- Now that all types from which E may depend are frozen, see if the
3698 -- size is known at compile time, if it must be unsigned, or if
3699 -- strict alignment is required
3701 Check_Compile_Time_Size (E);
3702 Check_Unsigned_Type (E);
3704 if Base_Type (E) = E then
3705 Check_Strict_Alignment (E);
3708 -- Do not allow a size clause for a type which does not have a size
3709 -- that is known at compile time
3711 if Has_Size_Clause (E)
3712 and then not Size_Known_At_Compile_Time (E)
3714 -- Suppress this message if errors posted on E, even if we are
3715 -- in all errors mode, since this is often a junk message
3717 if not Error_Posted (E) then
3719 ("size clause not allowed for variable length type",
3724 -- Remaining process is to set/verify the representation information,
3725 -- in particular the size and alignment values. This processing is
3726 -- not required for generic types, since generic types do not play
3727 -- any part in code generation, and so the size and alignment values
3728 -- for such types are irrelevant.
3730 if Is_Generic_Type (E) then
3733 -- Otherwise we call the layout procedure
3739 -- End of freeze processing for type entities
3742 -- Here is where we logically freeze the current entity. If it has a
3743 -- freeze node, then this is the point at which the freeze node is
3744 -- linked into the result list.
3746 if Has_Delayed_Freeze (E) then
3748 -- If a freeze node is already allocated, use it, otherwise allocate
3749 -- a new one. The preallocation happens in the case of anonymous base
3750 -- types, where we preallocate so that we can set First_Subtype_Link.
3751 -- Note that we reset the Sloc to the current freeze location.
3753 if Present (Freeze_Node (E)) then
3754 F_Node := Freeze_Node (E);
3755 Set_Sloc (F_Node, Loc);
3758 F_Node := New_Node (N_Freeze_Entity, Loc);
3759 Set_Freeze_Node (E, F_Node);
3760 Set_Access_Types_To_Process (F_Node, No_Elist);
3761 Set_TSS_Elist (F_Node, No_Elist);
3762 Set_Actions (F_Node, No_List);
3765 Set_Entity (F_Node, E);
3767 if Result = No_List then
3768 Result := New_List (F_Node);
3770 Append (F_Node, Result);
3773 -- A final pass over record types with discriminants. If the type
3774 -- has an incomplete declaration, there may be constrained access
3775 -- subtypes declared elsewhere, which do not depend on the discrimi-
3776 -- nants of the type, and which are used as component types (i.e.
3777 -- the full view is a recursive type). The designated types of these
3778 -- subtypes can only be elaborated after the type itself, and they
3779 -- need an itype reference.
3781 if Ekind (E) = E_Record_Type
3782 and then Has_Discriminants (E)
3790 Comp := First_Component (E);
3792 while Present (Comp) loop
3793 Typ := Etype (Comp);
3795 if Ekind (Comp) = E_Component
3796 and then Is_Access_Type (Typ)
3797 and then Scope (Typ) /= E
3798 and then Base_Type (Designated_Type (Typ)) = E
3799 and then Is_Itype (Designated_Type (Typ))
3801 IR := Make_Itype_Reference (Sloc (Comp));
3802 Set_Itype (IR, Designated_Type (Typ));
3803 Append (IR, Result);
3806 Next_Component (Comp);
3812 -- When a type is frozen, the first subtype of the type is frozen as
3813 -- well (RM 13.14(15)). This has to be done after freezing the type,
3814 -- since obviously the first subtype depends on its own base type.
3817 Freeze_And_Append (First_Subtype (E), Loc, Result);
3819 -- If we just froze a tagged non-class wide record, then freeze the
3820 -- corresponding class-wide type. This must be done after the tagged
3821 -- type itself is frozen, because the class-wide type refers to the
3822 -- tagged type which generates the class.
3824 if Is_Tagged_Type (E)
3825 and then not Is_Class_Wide_Type (E)
3826 and then Present (Class_Wide_Type (E))
3828 Freeze_And_Append (Class_Wide_Type (E), Loc, Result);
3832 Check_Debug_Info_Needed (E);
3834 -- Special handling for subprograms
3836 if Is_Subprogram (E) then
3838 -- If subprogram has address clause then reset Is_Public flag, since
3839 -- we do not want the backend to generate external references.
3841 if Present (Address_Clause (E))
3842 and then not Is_Library_Level_Entity (E)
3844 Set_Is_Public (E, False);
3846 -- If no address clause and not intrinsic, then for imported
3847 -- subprogram in main unit, generate descriptor if we are in
3848 -- Propagate_Exceptions mode.
3850 elsif Propagate_Exceptions
3851 and then Is_Imported (E)
3852 and then not Is_Intrinsic_Subprogram (E)
3853 and then Convention (E) /= Convention_Stubbed
3855 if Result = No_List then
3856 Result := Empty_List;
3864 -----------------------------
3865 -- Freeze_Enumeration_Type --
3866 -----------------------------
3868 procedure Freeze_Enumeration_Type (Typ : Entity_Id) is
3870 -- By default, if no size clause is present, an enumeration type with
3871 -- Convention C is assumed to interface to a C enum, and has integer
3872 -- size. This applies to types. For subtypes, verify that its base
3873 -- type has no size clause either.
3875 if Has_Foreign_Convention (Typ)
3876 and then not Has_Size_Clause (Typ)
3877 and then not Has_Size_Clause (Base_Type (Typ))
3878 and then Esize (Typ) < Standard_Integer_Size
3880 Init_Esize (Typ, Standard_Integer_Size);
3883 -- If the enumeration type interfaces to C, and it has a size clause
3884 -- that specifies less than int size, it warrants a warning. The
3885 -- user may intend the C type to be an enum or a char, so this is
3886 -- not by itself an error that the Ada compiler can detect, but it
3887 -- it is a worth a heads-up. For Boolean and Character types we
3888 -- assume that the programmer has the proper C type in mind.
3890 if Convention (Typ) = Convention_C
3891 and then Has_Size_Clause (Typ)
3892 and then Esize (Typ) /= Esize (Standard_Integer)
3893 and then not Is_Boolean_Type (Typ)
3894 and then not Is_Character_Type (Typ)
3897 ("C enum types have the size of a C int?", Size_Clause (Typ));
3900 Adjust_Esize_For_Alignment (Typ);
3902 end Freeze_Enumeration_Type;
3904 -----------------------
3905 -- Freeze_Expression --
3906 -----------------------
3908 procedure Freeze_Expression (N : Node_Id) is
3909 In_Spec_Exp : constant Boolean := In_Spec_Expression;
3912 Desig_Typ : Entity_Id;
3916 Freeze_Outside : Boolean := False;
3917 -- This flag is set true if the entity must be frozen outside the
3918 -- current subprogram. This happens in the case of expander generated
3919 -- subprograms (_Init_Proc, _Input, _Output, _Read, _Write) which do
3920 -- not freeze all entities like other bodies, but which nevertheless
3921 -- may reference entities that have to be frozen before the body and
3922 -- obviously cannot be frozen inside the body.
3924 function In_Exp_Body (N : Node_Id) return Boolean;
3925 -- Given an N_Handled_Sequence_Of_Statements node N, determines whether
3926 -- it is the handled statement sequence of an expander-generated
3927 -- subprogram (init proc, stream subprogram, or renaming as body).
3928 -- If so, this is not a freezing context.
3934 function In_Exp_Body (N : Node_Id) return Boolean is
3939 if Nkind (N) = N_Subprogram_Body then
3945 if Nkind (P) /= N_Subprogram_Body then
3949 Id := Defining_Unit_Name (Specification (P));
3951 if Nkind (Id) = N_Defining_Identifier
3952 and then (Is_Init_Proc (Id) or else
3953 Is_TSS (Id, TSS_Stream_Input) or else
3954 Is_TSS (Id, TSS_Stream_Output) or else
3955 Is_TSS (Id, TSS_Stream_Read) or else
3956 Is_TSS (Id, TSS_Stream_Write) or else
3957 Nkind (Original_Node (P)) =
3958 N_Subprogram_Renaming_Declaration)
3967 -- Start of processing for Freeze_Expression
3970 -- Immediate return if freezing is inhibited. This flag is set by the
3971 -- analyzer to stop freezing on generated expressions that would cause
3972 -- freezing if they were in the source program, but which are not
3973 -- supposed to freeze, since they are created.
3975 if Must_Not_Freeze (N) then
3979 -- If expression is non-static, then it does not freeze in a default
3980 -- expression, see section "Handling of Default Expressions" in the
3981 -- spec of package Sem for further details. Note that we have to
3982 -- make sure that we actually have a real expression (if we have
3983 -- a subtype indication, we can't test Is_Static_Expression!)
3986 and then Nkind (N) in N_Subexpr
3987 and then not Is_Static_Expression (N)
3992 -- Freeze type of expression if not frozen already
3996 if Nkind (N) in N_Has_Etype then
3997 if not Is_Frozen (Etype (N)) then
4000 -- Base type may be an derived numeric type that is frozen at
4001 -- the point of declaration, but first_subtype is still unfrozen.
4003 elsif not Is_Frozen (First_Subtype (Etype (N))) then
4004 Typ := First_Subtype (Etype (N));
4008 -- For entity name, freeze entity if not frozen already. A special
4009 -- exception occurs for an identifier that did not come from source.
4010 -- We don't let such identifiers freeze a non-internal entity, i.e.
4011 -- an entity that did come from source, since such an identifier was
4012 -- generated by the expander, and cannot have any semantic effect on
4013 -- the freezing semantics. For example, this stops the parameter of
4014 -- an initialization procedure from freezing the variable.
4016 if Is_Entity_Name (N)
4017 and then not Is_Frozen (Entity (N))
4018 and then (Nkind (N) /= N_Identifier
4019 or else Comes_From_Source (N)
4020 or else not Comes_From_Source (Entity (N)))
4027 -- For an allocator freeze designated type if not frozen already
4029 -- For an aggregate whose component type is an access type, freeze the
4030 -- designated type now, so that its freeze does not appear within the
4031 -- loop that might be created in the expansion of the aggregate. If the
4032 -- designated type is a private type without full view, the expression
4033 -- cannot contain an allocator, so the type is not frozen.
4039 Desig_Typ := Designated_Type (Etype (N));
4042 if Is_Array_Type (Etype (N))
4043 and then Is_Access_Type (Component_Type (Etype (N)))
4045 Desig_Typ := Designated_Type (Component_Type (Etype (N)));
4048 when N_Selected_Component |
4049 N_Indexed_Component |
4052 if Is_Access_Type (Etype (Prefix (N))) then
4053 Desig_Typ := Designated_Type (Etype (Prefix (N)));
4060 if Desig_Typ /= Empty
4061 and then (Is_Frozen (Desig_Typ)
4062 or else (not Is_Fully_Defined (Desig_Typ)))
4067 -- All done if nothing needs freezing
4071 and then No (Desig_Typ)
4076 -- Loop for looking at the right place to insert the freeze nodes
4077 -- exiting from the loop when it is appropriate to insert the freeze
4078 -- node before the current node P.
4080 -- Also checks some special exceptions to the freezing rules. These
4081 -- cases result in a direct return, bypassing the freeze action.
4085 Parent_P := Parent (P);
4087 -- If we don't have a parent, then we are not in a well-formed tree.
4088 -- This is an unusual case, but there are some legitimate situations
4089 -- in which this occurs, notably when the expressions in the range of
4090 -- a type declaration are resolved. We simply ignore the freeze
4091 -- request in this case. Is this right ???
4093 if No (Parent_P) then
4097 -- See if we have got to an appropriate point in the tree
4099 case Nkind (Parent_P) is
4101 -- A special test for the exception of (RM 13.14(8)) for the case
4102 -- of per-object expressions (RM 3.8(18)) occurring in component
4103 -- definition or a discrete subtype definition. Note that we test
4104 -- for a component declaration which includes both cases we are
4105 -- interested in, and furthermore the tree does not have explicit
4106 -- nodes for either of these two constructs.
4108 when N_Component_Declaration =>
4110 -- The case we want to test for here is an identifier that is
4111 -- a per-object expression, this is either a discriminant that
4112 -- appears in a context other than the component declaration
4113 -- or it is a reference to the type of the enclosing construct.
4115 -- For either of these cases, we skip the freezing
4117 if not In_Spec_Expression
4118 and then Nkind (N) = N_Identifier
4119 and then (Present (Entity (N)))
4121 -- We recognize the discriminant case by just looking for
4122 -- a reference to a discriminant. It can only be one for
4123 -- the enclosing construct. Skip freezing in this case.
4125 if Ekind (Entity (N)) = E_Discriminant then
4128 -- For the case of a reference to the enclosing record,
4129 -- (or task or protected type), we look for a type that
4130 -- matches the current scope.
4132 elsif Entity (N) = Current_Scope then
4137 -- If we have an enumeration literal that appears as the choice in
4138 -- the aggregate of an enumeration representation clause, then
4139 -- freezing does not occur (RM 13.14(10)).
4141 when N_Enumeration_Representation_Clause =>
4143 -- The case we are looking for is an enumeration literal
4145 if (Nkind (N) = N_Identifier or Nkind (N) = N_Character_Literal)
4146 and then Is_Enumeration_Type (Etype (N))
4148 -- If enumeration literal appears directly as the choice,
4149 -- do not freeze (this is the normal non-overloaded case)
4151 if Nkind (Parent (N)) = N_Component_Association
4152 and then First (Choices (Parent (N))) = N
4156 -- If enumeration literal appears as the name of function
4157 -- which is the choice, then also do not freeze. This
4158 -- happens in the overloaded literal case, where the
4159 -- enumeration literal is temporarily changed to a function
4160 -- call for overloading analysis purposes.
4162 elsif Nkind (Parent (N)) = N_Function_Call
4164 Nkind (Parent (Parent (N))) = N_Component_Association
4166 First (Choices (Parent (Parent (N)))) = Parent (N)
4172 -- Normally if the parent is a handled sequence of statements,
4173 -- then the current node must be a statement, and that is an
4174 -- appropriate place to insert a freeze node.
4176 when N_Handled_Sequence_Of_Statements =>
4178 -- An exception occurs when the sequence of statements is for
4179 -- an expander generated body that did not do the usual freeze
4180 -- all operation. In this case we usually want to freeze
4181 -- outside this body, not inside it, and we skip past the
4182 -- subprogram body that we are inside.
4184 if In_Exp_Body (Parent_P) then
4186 -- However, we *do* want to freeze at this point if we have
4187 -- an entity to freeze, and that entity is declared *inside*
4188 -- the body of the expander generated procedure. This case
4189 -- is recognized by the scope of the type, which is either
4190 -- the spec for some enclosing body, or (in the case of
4191 -- init_procs, for which there are no separate specs) the
4195 Subp : constant Node_Id := Parent (Parent_P);
4199 if Nkind (Subp) = N_Subprogram_Body then
4200 Cspc := Corresponding_Spec (Subp);
4202 if (Present (Typ) and then Scope (Typ) = Cspc)
4204 (Present (Nam) and then Scope (Nam) = Cspc)
4209 and then Scope (Typ) = Current_Scope
4210 and then Current_Scope = Defining_Entity (Subp)
4217 -- If not that exception to the exception, then this is
4218 -- where we delay the freeze till outside the body.
4220 Parent_P := Parent (Parent_P);
4221 Freeze_Outside := True;
4223 -- Here if normal case where we are in handled statement
4224 -- sequence and want to do the insertion right there.
4230 -- If parent is a body or a spec or a block, then the current node
4231 -- is a statement or declaration and we can insert the freeze node
4234 when N_Package_Specification |
4240 N_Block_Statement => exit;
4242 -- The expander is allowed to define types in any statements list,
4243 -- so any of the following parent nodes also mark a freezing point
4244 -- if the actual node is in a list of statements or declarations.
4246 when N_Exception_Handler |
4249 N_Case_Statement_Alternative |
4250 N_Compilation_Unit_Aux |
4251 N_Selective_Accept |
4252 N_Accept_Alternative |
4253 N_Delay_Alternative |
4254 N_Conditional_Entry_Call |
4255 N_Entry_Call_Alternative |
4256 N_Triggering_Alternative |
4260 exit when Is_List_Member (P);
4262 -- Note: The N_Loop_Statement is a special case. A type that
4263 -- appears in the source can never be frozen in a loop (this
4264 -- occurs only because of a loop expanded by the expander), so we
4265 -- keep on going. Otherwise we terminate the search. Same is true
4266 -- of any entity which comes from source. (if they have predefined
4267 -- type, that type does not appear to come from source, but the
4268 -- entity should not be frozen here).
4270 when N_Loop_Statement =>
4271 exit when not Comes_From_Source (Etype (N))
4272 and then (No (Nam) or else not Comes_From_Source (Nam));
4274 -- For all other cases, keep looking at parents
4280 -- We fall through the case if we did not yet find the proper
4281 -- place in the free for inserting the freeze node, so climb!
4286 -- If the expression appears in a record or an initialization procedure,
4287 -- the freeze nodes are collected and attached to the current scope, to
4288 -- be inserted and analyzed on exit from the scope, to insure that
4289 -- generated entities appear in the correct scope. If the expression is
4290 -- a default for a discriminant specification, the scope is still void.
4291 -- The expression can also appear in the discriminant part of a private
4292 -- or concurrent type.
4294 -- If the expression appears in a constrained subcomponent of an
4295 -- enclosing record declaration, the freeze nodes must be attached to
4296 -- the outer record type so they can eventually be placed in the
4297 -- enclosing declaration list.
4299 -- The other case requiring this special handling is if we are in a
4300 -- default expression, since in that case we are about to freeze a
4301 -- static type, and the freeze scope needs to be the outer scope, not
4302 -- the scope of the subprogram with the default parameter.
4304 -- For default expressions and other spec expressions in generic units,
4305 -- the Move_Freeze_Nodes mechanism (see sem_ch12.adb) takes care of
4306 -- placing them at the proper place, after the generic unit.
4308 if (In_Spec_Exp and not Inside_A_Generic)
4309 or else Freeze_Outside
4310 or else (Is_Type (Current_Scope)
4311 and then (not Is_Concurrent_Type (Current_Scope)
4312 or else not Has_Completion (Current_Scope)))
4313 or else Ekind (Current_Scope) = E_Void
4316 Loc : constant Source_Ptr := Sloc (Current_Scope);
4317 Freeze_Nodes : List_Id := No_List;
4318 Pos : Int := Scope_Stack.Last;
4321 if Present (Desig_Typ) then
4322 Freeze_And_Append (Desig_Typ, Loc, Freeze_Nodes);
4325 if Present (Typ) then
4326 Freeze_And_Append (Typ, Loc, Freeze_Nodes);
4329 if Present (Nam) then
4330 Freeze_And_Append (Nam, Loc, Freeze_Nodes);
4333 -- The current scope may be that of a constrained component of
4334 -- an enclosing record declaration, which is above the current
4335 -- scope in the scope stack.
4337 if Is_Record_Type (Scope (Current_Scope)) then
4341 if Is_Non_Empty_List (Freeze_Nodes) then
4342 if No (Scope_Stack.Table (Pos).Pending_Freeze_Actions) then
4343 Scope_Stack.Table (Pos).Pending_Freeze_Actions :=
4346 Append_List (Freeze_Nodes, Scope_Stack.Table
4347 (Pos).Pending_Freeze_Actions);
4355 -- Now we have the right place to do the freezing. First, a special
4356 -- adjustment, if we are in spec-expression analysis mode, these freeze
4357 -- actions must not be thrown away (normally all inserted actions are
4358 -- thrown away in this mode. However, the freeze actions are from static
4359 -- expressions and one of the important reasons we are doing this
4360 -- special analysis is to get these freeze actions. Therefore we turn
4361 -- off the In_Spec_Expression mode to propagate these freeze actions.
4362 -- This also means they get properly analyzed and expanded.
4364 In_Spec_Expression := False;
4366 -- Freeze the designated type of an allocator (RM 13.14(13))
4368 if Present (Desig_Typ) then
4369 Freeze_Before (P, Desig_Typ);
4372 -- Freeze type of expression (RM 13.14(10)). Note that we took care of
4373 -- the enumeration representation clause exception in the loop above.
4375 if Present (Typ) then
4376 Freeze_Before (P, Typ);
4379 -- Freeze name if one is present (RM 13.14(11))
4381 if Present (Nam) then
4382 Freeze_Before (P, Nam);
4385 -- Restore In_Spec_Expression flag
4387 In_Spec_Expression := In_Spec_Exp;
4388 end Freeze_Expression;
4390 -----------------------------
4391 -- Freeze_Fixed_Point_Type --
4392 -----------------------------
4394 -- Certain fixed-point types and subtypes, including implicit base types
4395 -- and declared first subtypes, have not yet set up a range. This is
4396 -- because the range cannot be set until the Small and Size values are
4397 -- known, and these are not known till the type is frozen.
4399 -- To signal this case, Scalar_Range contains an unanalyzed syntactic range
4400 -- whose bounds are unanalyzed real literals. This routine will recognize
4401 -- this case, and transform this range node into a properly typed range
4402 -- with properly analyzed and resolved values.
4404 procedure Freeze_Fixed_Point_Type (Typ : Entity_Id) is
4405 Rng : constant Node_Id := Scalar_Range (Typ);
4406 Lo : constant Node_Id := Low_Bound (Rng);
4407 Hi : constant Node_Id := High_Bound (Rng);
4408 Btyp : constant Entity_Id := Base_Type (Typ);
4409 Brng : constant Node_Id := Scalar_Range (Btyp);
4410 BLo : constant Node_Id := Low_Bound (Brng);
4411 BHi : constant Node_Id := High_Bound (Brng);
4412 Small : constant Ureal := Small_Value (Typ);
4419 function Fsize (Lov, Hiv : Ureal) return Nat;
4420 -- Returns size of type with given bounds. Also leaves these
4421 -- bounds set as the current bounds of the Typ.
4427 function Fsize (Lov, Hiv : Ureal) return Nat is
4429 Set_Realval (Lo, Lov);
4430 Set_Realval (Hi, Hiv);
4431 return Minimum_Size (Typ);
4434 -- Start of processing for Freeze_Fixed_Point_Type
4437 -- If Esize of a subtype has not previously been set, set it now
4439 if Unknown_Esize (Typ) then
4440 Atype := Ancestor_Subtype (Typ);
4442 if Present (Atype) then
4443 Set_Esize (Typ, Esize (Atype));
4445 Set_Esize (Typ, Esize (Base_Type (Typ)));
4449 -- Immediate return if the range is already analyzed. This means that
4450 -- the range is already set, and does not need to be computed by this
4453 if Analyzed (Rng) then
4457 -- Immediate return if either of the bounds raises Constraint_Error
4459 if Raises_Constraint_Error (Lo)
4460 or else Raises_Constraint_Error (Hi)
4465 Loval := Realval (Lo);
4466 Hival := Realval (Hi);
4468 -- Ordinary fixed-point case
4470 if Is_Ordinary_Fixed_Point_Type (Typ) then
4472 -- For the ordinary fixed-point case, we are allowed to fudge the
4473 -- end-points up or down by small. Generally we prefer to fudge up,
4474 -- i.e. widen the bounds for non-model numbers so that the end points
4475 -- are included. However there are cases in which this cannot be
4476 -- done, and indeed cases in which we may need to narrow the bounds.
4477 -- The following circuit makes the decision.
4479 -- Note: our terminology here is that Incl_EP means that the bounds
4480 -- are widened by Small if necessary to include the end points, and
4481 -- Excl_EP means that the bounds are narrowed by Small to exclude the
4482 -- end-points if this reduces the size.
4484 -- Note that in the Incl case, all we care about is including the
4485 -- end-points. In the Excl case, we want to narrow the bounds as
4486 -- much as permitted by the RM, to give the smallest possible size.
4489 Loval_Incl_EP : Ureal;
4490 Hival_Incl_EP : Ureal;
4492 Loval_Excl_EP : Ureal;
4493 Hival_Excl_EP : Ureal;
4499 First_Subt : Entity_Id;
4504 -- First step. Base types are required to be symmetrical. Right
4505 -- now, the base type range is a copy of the first subtype range.
4506 -- This will be corrected before we are done, but right away we
4507 -- need to deal with the case where both bounds are non-negative.
4508 -- In this case, we set the low bound to the negative of the high
4509 -- bound, to make sure that the size is computed to include the
4510 -- required sign. Note that we do not need to worry about the
4511 -- case of both bounds negative, because the sign will be dealt
4512 -- with anyway. Furthermore we can't just go making such a bound
4513 -- symmetrical, since in a twos-complement system, there is an
4514 -- extra negative value which could not be accommodated on the
4518 and then not UR_Is_Negative (Loval)
4519 and then Hival > Loval
4522 Set_Realval (Lo, Loval);
4525 -- Compute the fudged bounds. If the number is a model number,
4526 -- then we do nothing to include it, but we are allowed to backoff
4527 -- to the next adjacent model number when we exclude it. If it is
4528 -- not a model number then we straddle the two values with the
4529 -- model numbers on either side.
4531 Model_Num := UR_Trunc (Loval / Small) * Small;
4533 if Loval = Model_Num then
4534 Loval_Incl_EP := Model_Num;
4536 Loval_Incl_EP := Model_Num - Small;
4539 -- The low value excluding the end point is Small greater, but
4540 -- we do not do this exclusion if the low value is positive,
4541 -- since it can't help the size and could actually hurt by
4542 -- crossing the high bound.
4544 if UR_Is_Negative (Loval_Incl_EP) then
4545 Loval_Excl_EP := Loval_Incl_EP + Small;
4547 -- If the value went from negative to zero, then we have the
4548 -- case where Loval_Incl_EP is the model number just below
4549 -- zero, so we want to stick to the negative value for the
4550 -- base type to maintain the condition that the size will
4551 -- include signed values.
4554 and then UR_Is_Zero (Loval_Excl_EP)
4556 Loval_Excl_EP := Loval_Incl_EP;
4560 Loval_Excl_EP := Loval_Incl_EP;
4563 -- Similar processing for upper bound and high value
4565 Model_Num := UR_Trunc (Hival / Small) * Small;
4567 if Hival = Model_Num then
4568 Hival_Incl_EP := Model_Num;
4570 Hival_Incl_EP := Model_Num + Small;
4573 if UR_Is_Positive (Hival_Incl_EP) then
4574 Hival_Excl_EP := Hival_Incl_EP - Small;
4576 Hival_Excl_EP := Hival_Incl_EP;
4579 -- One further adjustment is needed. In the case of subtypes, we
4580 -- cannot go outside the range of the base type, or we get
4581 -- peculiarities, and the base type range is already set. This
4582 -- only applies to the Incl values, since clearly the Excl values
4583 -- are already as restricted as they are allowed to be.
4586 Loval_Incl_EP := UR_Max (Loval_Incl_EP, Realval (BLo));
4587 Hival_Incl_EP := UR_Min (Hival_Incl_EP, Realval (BHi));
4590 -- Get size including and excluding end points
4592 Size_Incl_EP := Fsize (Loval_Incl_EP, Hival_Incl_EP);
4593 Size_Excl_EP := Fsize (Loval_Excl_EP, Hival_Excl_EP);
4595 -- No need to exclude end-points if it does not reduce size
4597 if Fsize (Loval_Incl_EP, Hival_Excl_EP) = Size_Excl_EP then
4598 Loval_Excl_EP := Loval_Incl_EP;
4601 if Fsize (Loval_Excl_EP, Hival_Incl_EP) = Size_Excl_EP then
4602 Hival_Excl_EP := Hival_Incl_EP;
4605 -- Now we set the actual size to be used. We want to use the
4606 -- bounds fudged up to include the end-points but only if this
4607 -- can be done without violating a specifically given size
4608 -- size clause or causing an unacceptable increase in size.
4610 -- Case of size clause given
4612 if Has_Size_Clause (Typ) then
4614 -- Use the inclusive size only if it is consistent with
4615 -- the explicitly specified size.
4617 if Size_Incl_EP <= RM_Size (Typ) then
4618 Actual_Lo := Loval_Incl_EP;
4619 Actual_Hi := Hival_Incl_EP;
4620 Actual_Size := Size_Incl_EP;
4622 -- If the inclusive size is too large, we try excluding
4623 -- the end-points (will be caught later if does not work).
4626 Actual_Lo := Loval_Excl_EP;
4627 Actual_Hi := Hival_Excl_EP;
4628 Actual_Size := Size_Excl_EP;
4631 -- Case of size clause not given
4634 -- If we have a base type whose corresponding first subtype
4635 -- has an explicit size that is large enough to include our
4636 -- end-points, then do so. There is no point in working hard
4637 -- to get a base type whose size is smaller than the specified
4638 -- size of the first subtype.
4640 First_Subt := First_Subtype (Typ);
4642 if Has_Size_Clause (First_Subt)
4643 and then Size_Incl_EP <= Esize (First_Subt)
4645 Actual_Size := Size_Incl_EP;
4646 Actual_Lo := Loval_Incl_EP;
4647 Actual_Hi := Hival_Incl_EP;
4649 -- If excluding the end-points makes the size smaller and
4650 -- results in a size of 8,16,32,64, then we take the smaller
4651 -- size. For the 64 case, this is compulsory. For the other
4652 -- cases, it seems reasonable. We like to include end points
4653 -- if we can, but not at the expense of moving to the next
4654 -- natural boundary of size.
4656 elsif Size_Incl_EP /= Size_Excl_EP
4658 (Size_Excl_EP = 8 or else
4659 Size_Excl_EP = 16 or else
4660 Size_Excl_EP = 32 or else
4663 Actual_Size := Size_Excl_EP;
4664 Actual_Lo := Loval_Excl_EP;
4665 Actual_Hi := Hival_Excl_EP;
4667 -- Otherwise we can definitely include the end points
4670 Actual_Size := Size_Incl_EP;
4671 Actual_Lo := Loval_Incl_EP;
4672 Actual_Hi := Hival_Incl_EP;
4675 -- One pathological case: normally we never fudge a low bound
4676 -- down, since it would seem to increase the size (if it has
4677 -- any effect), but for ranges containing single value, or no
4678 -- values, the high bound can be small too large. Consider:
4680 -- type t is delta 2.0**(-14)
4681 -- range 131072.0 .. 0;
4683 -- That lower bound is *just* outside the range of 32 bits, and
4684 -- does need fudging down in this case. Note that the bounds
4685 -- will always have crossed here, since the high bound will be
4686 -- fudged down if necessary, as in the case of:
4688 -- type t is delta 2.0**(-14)
4689 -- range 131072.0 .. 131072.0;
4691 -- So we detect the situation by looking for crossed bounds,
4692 -- and if the bounds are crossed, and the low bound is greater
4693 -- than zero, we will always back it off by small, since this
4694 -- is completely harmless.
4696 if Actual_Lo > Actual_Hi then
4697 if UR_Is_Positive (Actual_Lo) then
4698 Actual_Lo := Loval_Incl_EP - Small;
4699 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4701 -- And of course, we need to do exactly the same parallel
4702 -- fudge for flat ranges in the negative region.
4704 elsif UR_Is_Negative (Actual_Hi) then
4705 Actual_Hi := Hival_Incl_EP + Small;
4706 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4711 Set_Realval (Lo, Actual_Lo);
4712 Set_Realval (Hi, Actual_Hi);
4715 -- For the decimal case, none of this fudging is required, since there
4716 -- are no end-point problems in the decimal case (the end-points are
4717 -- always included).
4720 Actual_Size := Fsize (Loval, Hival);
4723 -- At this stage, the actual size has been calculated and the proper
4724 -- required bounds are stored in the low and high bounds.
4726 if Actual_Size > 64 then
4727 Error_Msg_Uint_1 := UI_From_Int (Actual_Size);
4729 ("size required (^) for type& too large, maximum allowed is 64",
4734 -- Check size against explicit given size
4736 if Has_Size_Clause (Typ) then
4737 if Actual_Size > RM_Size (Typ) then
4738 Error_Msg_Uint_1 := RM_Size (Typ);
4739 Error_Msg_Uint_2 := UI_From_Int (Actual_Size);
4741 ("size given (^) for type& too small, minimum allowed is ^",
4742 Size_Clause (Typ), Typ);
4745 Actual_Size := UI_To_Int (Esize (Typ));
4748 -- Increase size to next natural boundary if no size clause given
4751 if Actual_Size <= 8 then
4753 elsif Actual_Size <= 16 then
4755 elsif Actual_Size <= 32 then
4761 Init_Esize (Typ, Actual_Size);
4762 Adjust_Esize_For_Alignment (Typ);
4765 -- If we have a base type, then expand the bounds so that they extend to
4766 -- the full width of the allocated size in bits, to avoid junk range
4767 -- checks on intermediate computations.
4769 if Base_Type (Typ) = Typ then
4770 Set_Realval (Lo, -(Small * (Uint_2 ** (Actual_Size - 1))));
4771 Set_Realval (Hi, (Small * (Uint_2 ** (Actual_Size - 1) - 1)));
4774 -- Final step is to reanalyze the bounds using the proper type
4775 -- and set the Corresponding_Integer_Value fields of the literals.
4777 Set_Etype (Lo, Empty);
4778 Set_Analyzed (Lo, False);
4781 -- Resolve with universal fixed if the base type, and the base type if
4782 -- it is a subtype. Note we can't resolve the base type with itself,
4783 -- that would be a reference before definition.
4786 Resolve (Lo, Universal_Fixed);
4791 -- Set corresponding integer value for bound
4793 Set_Corresponding_Integer_Value
4794 (Lo, UR_To_Uint (Realval (Lo) / Small));
4796 -- Similar processing for high bound
4798 Set_Etype (Hi, Empty);
4799 Set_Analyzed (Hi, False);
4803 Resolve (Hi, Universal_Fixed);
4808 Set_Corresponding_Integer_Value
4809 (Hi, UR_To_Uint (Realval (Hi) / Small));
4811 -- Set type of range to correspond to bounds
4813 Set_Etype (Rng, Etype (Lo));
4815 -- Set Esize to calculated size if not set already
4817 if Unknown_Esize (Typ) then
4818 Init_Esize (Typ, Actual_Size);
4821 -- Set RM_Size if not already set. If already set, check value
4824 Minsiz : constant Uint := UI_From_Int (Minimum_Size (Typ));
4827 if RM_Size (Typ) /= Uint_0 then
4828 if RM_Size (Typ) < Minsiz then
4829 Error_Msg_Uint_1 := RM_Size (Typ);
4830 Error_Msg_Uint_2 := Minsiz;
4832 ("size given (^) for type& too small, minimum allowed is ^",
4833 Size_Clause (Typ), Typ);
4837 Set_RM_Size (Typ, Minsiz);
4840 end Freeze_Fixed_Point_Type;
4846 procedure Freeze_Itype (T : Entity_Id; N : Node_Id) is
4850 Set_Has_Delayed_Freeze (T);
4851 L := Freeze_Entity (T, Sloc (N));
4853 if Is_Non_Empty_List (L) then
4854 Insert_Actions (N, L);
4858 --------------------------
4859 -- Freeze_Static_Object --
4860 --------------------------
4862 procedure Freeze_Static_Object (E : Entity_Id) is
4864 Cannot_Be_Static : exception;
4865 -- Exception raised if the type of a static object cannot be made
4866 -- static. This happens if the type depends on non-global objects.
4868 procedure Ensure_Expression_Is_SA (N : Node_Id);
4869 -- Called to ensure that an expression used as part of a type definition
4870 -- is statically allocatable, which means that the expression type is
4871 -- statically allocatable, and the expression is either static, or a
4872 -- reference to a library level constant.
4874 procedure Ensure_Type_Is_SA (Typ : Entity_Id);
4875 -- Called to mark a type as static, checking that it is possible
4876 -- to set the type as static. If it is not possible, then the
4877 -- exception Cannot_Be_Static is raised.
4879 -----------------------------
4880 -- Ensure_Expression_Is_SA --
4881 -----------------------------
4883 procedure Ensure_Expression_Is_SA (N : Node_Id) is
4887 Ensure_Type_Is_SA (Etype (N));
4889 if Is_Static_Expression (N) then
4892 elsif Nkind (N) = N_Identifier then
4896 and then Ekind (Ent) = E_Constant
4897 and then Is_Library_Level_Entity (Ent)
4903 raise Cannot_Be_Static;
4904 end Ensure_Expression_Is_SA;
4906 -----------------------
4907 -- Ensure_Type_Is_SA --
4908 -----------------------
4910 procedure Ensure_Type_Is_SA (Typ : Entity_Id) is
4915 -- If type is library level, we are all set
4917 if Is_Library_Level_Entity (Typ) then
4921 -- We are also OK if the type already marked as statically allocated,
4922 -- which means we processed it before.
4924 if Is_Statically_Allocated (Typ) then
4928 -- Mark type as statically allocated
4930 Set_Is_Statically_Allocated (Typ);
4932 -- Check that it is safe to statically allocate this type
4934 if Is_Scalar_Type (Typ) or else Is_Real_Type (Typ) then
4935 Ensure_Expression_Is_SA (Type_Low_Bound (Typ));
4936 Ensure_Expression_Is_SA (Type_High_Bound (Typ));
4938 elsif Is_Array_Type (Typ) then
4939 N := First_Index (Typ);
4940 while Present (N) loop
4941 Ensure_Type_Is_SA (Etype (N));
4945 Ensure_Type_Is_SA (Component_Type (Typ));
4947 elsif Is_Access_Type (Typ) then
4948 if Ekind (Designated_Type (Typ)) = E_Subprogram_Type then
4952 T : constant Entity_Id := Etype (Designated_Type (Typ));
4955 if T /= Standard_Void_Type then
4956 Ensure_Type_Is_SA (T);
4959 F := First_Formal (Designated_Type (Typ));
4961 while Present (F) loop
4962 Ensure_Type_Is_SA (Etype (F));
4968 Ensure_Type_Is_SA (Designated_Type (Typ));
4971 elsif Is_Record_Type (Typ) then
4972 C := First_Entity (Typ);
4973 while Present (C) loop
4974 if Ekind (C) = E_Discriminant
4975 or else Ekind (C) = E_Component
4977 Ensure_Type_Is_SA (Etype (C));
4979 elsif Is_Type (C) then
4980 Ensure_Type_Is_SA (C);
4986 elsif Ekind (Typ) = E_Subprogram_Type then
4987 Ensure_Type_Is_SA (Etype (Typ));
4989 C := First_Formal (Typ);
4990 while Present (C) loop
4991 Ensure_Type_Is_SA (Etype (C));
4996 raise Cannot_Be_Static;
4998 end Ensure_Type_Is_SA;
5000 -- Start of processing for Freeze_Static_Object
5003 Ensure_Type_Is_SA (Etype (E));
5006 when Cannot_Be_Static =>
5008 -- If the object that cannot be static is imported or exported,
5009 -- then we give an error message saying that this object cannot
5010 -- be imported or exported.
5012 if Is_Imported (E) then
5014 ("& cannot be imported (local type is not constant)", E);
5016 -- Otherwise must be exported, something is wrong if compiler
5017 -- is marking something as statically allocated which cannot be).
5019 else pragma Assert (Is_Exported (E));
5021 ("& cannot be exported (local type is not constant)", E);
5023 end Freeze_Static_Object;
5025 -----------------------
5026 -- Freeze_Subprogram --
5027 -----------------------
5029 procedure Freeze_Subprogram (E : Entity_Id) is
5034 -- Subprogram may not have an address clause unless it is imported
5036 if Present (Address_Clause (E)) then
5037 if not Is_Imported (E) then
5039 ("address clause can only be given " &
5040 "for imported subprogram",
5041 Name (Address_Clause (E)));
5045 -- Reset the Pure indication on an imported subprogram unless an
5046 -- explicit Pure_Function pragma was present. We do this because
5047 -- otherwise it is an insidious error to call a non-pure function from
5048 -- pure unit and have calls mysteriously optimized away. What happens
5049 -- here is that the Import can bypass the normal check to ensure that
5050 -- pure units call only pure subprograms.
5053 and then Is_Pure (E)
5054 and then not Has_Pragma_Pure_Function (E)
5056 Set_Is_Pure (E, False);
5059 -- For non-foreign convention subprograms, this is where we create
5060 -- the extra formals (for accessibility level and constrained bit
5061 -- information). We delay this till the freeze point precisely so
5062 -- that we know the convention!
5064 if not Has_Foreign_Convention (E) then
5065 Create_Extra_Formals (E);
5068 -- If this is convention Ada and a Valued_Procedure, that's odd
5070 if Ekind (E) = E_Procedure
5071 and then Is_Valued_Procedure (E)
5072 and then Convention (E) = Convention_Ada
5073 and then Warn_On_Export_Import
5076 ("?Valued_Procedure has no effect for convention Ada", E);
5077 Set_Is_Valued_Procedure (E, False);
5080 -- Case of foreign convention
5085 -- For foreign conventions, warn about return of an
5086 -- unconstrained array.
5088 -- Note: we *do* allow a return by descriptor for the VMS case,
5089 -- though here there is probably more to be done ???
5091 if Ekind (E) = E_Function then
5092 Retype := Underlying_Type (Etype (E));
5094 -- If no return type, probably some other error, e.g. a
5095 -- missing full declaration, so ignore.
5100 -- If the return type is generic, we have emitted a warning
5101 -- earlier on, and there is nothing else to check here. Specific
5102 -- instantiations may lead to erroneous behavior.
5104 elsif Is_Generic_Type (Etype (E)) then
5107 elsif Is_Array_Type (Retype)
5108 and then not Is_Constrained (Retype)
5109 and then Mechanism (E) not in Descriptor_Codes
5110 and then Warn_On_Export_Import
5113 ("?foreign convention function& should not return " &
5114 "unconstrained array", E);
5119 -- If any of the formals for an exported foreign convention
5120 -- subprogram have defaults, then emit an appropriate warning since
5121 -- this is odd (default cannot be used from non-Ada code)
5123 if Is_Exported (E) then
5124 F := First_Formal (E);
5125 while Present (F) loop
5126 if Warn_On_Export_Import
5127 and then Present (Default_Value (F))
5130 ("?parameter cannot be defaulted in non-Ada call",
5139 -- For VMS, descriptor mechanisms for parameters are allowed only
5140 -- for imported/exported subprograms. Moreover, the NCA descriptor
5141 -- is not allowed for parameters of exported subprograms.
5143 if OpenVMS_On_Target then
5144 if Is_Exported (E) then
5145 F := First_Formal (E);
5146 while Present (F) loop
5147 if Mechanism (F) = By_Descriptor_NCA then
5149 ("'N'C'A' descriptor for parameter not permitted", F);
5151 ("\can only be used for imported subprogram", F);
5157 elsif not Is_Imported (E) then
5158 F := First_Formal (E);
5159 while Present (F) loop
5160 if Mechanism (F) in Descriptor_Codes then
5162 ("descriptor mechanism for parameter not permitted", F);
5164 ("\can only be used for imported/exported subprogram", F);
5172 -- Pragma Inline_Always is disallowed for dispatching subprograms
5173 -- because the address of such subprograms is saved in the dispatch
5174 -- table to support dispatching calls, and dispatching calls cannot
5175 -- be inlined. This is consistent with the restriction against using
5176 -- 'Access or 'Address on an Inline_Always subprogram.
5178 if Is_Dispatching_Operation (E)
5179 and then Has_Pragma_Inline_Always (E)
5182 ("pragma Inline_Always not allowed for dispatching subprograms", E);
5185 -- Because of the implicit representation of inherited predefined
5186 -- operators in the front-end, the overriding status of the operation
5187 -- may be affected when a full view of a type is analyzed, and this is
5188 -- not captured by the analysis of the corresponding type declaration.
5189 -- Therefore the correctness of a not-overriding indicator must be
5190 -- rechecked when the subprogram is frozen.
5192 if Nkind (E) = N_Defining_Operator_Symbol
5193 and then not Error_Posted (Parent (E))
5195 Check_Overriding_Indicator (E, Empty, Is_Primitive (E));
5197 end Freeze_Subprogram;
5199 ----------------------
5200 -- Is_Fully_Defined --
5201 ----------------------
5203 function Is_Fully_Defined (T : Entity_Id) return Boolean is
5205 if Ekind (T) = E_Class_Wide_Type then
5206 return Is_Fully_Defined (Etype (T));
5208 elsif Is_Array_Type (T) then
5209 return Is_Fully_Defined (Component_Type (T));
5211 elsif Is_Record_Type (T)
5212 and not Is_Private_Type (T)
5214 -- Verify that the record type has no components with private types
5215 -- without completion.
5221 Comp := First_Component (T);
5223 while Present (Comp) loop
5224 if not Is_Fully_Defined (Etype (Comp)) then
5228 Next_Component (Comp);
5234 return not Is_Private_Type (T)
5235 or else Present (Full_View (Base_Type (T)));
5237 end Is_Fully_Defined;
5239 ---------------------------------
5240 -- Generate_Prim_Op_References --
5241 ---------------------------------
5243 procedure Generate_Prim_Op_References (Typ : Entity_Id) is
5246 Prim_List : Elist_Id;
5250 -- Handle subtypes of synchronized types
5252 if Ekind (Typ) = E_Protected_Subtype
5253 or else Ekind (Typ) = E_Task_Subtype
5255 Base_T := Etype (Typ);
5260 -- References to primitive operations are only relevant for tagged types
5262 if not Is_Tagged_Type (Base_T)
5263 or else Is_Class_Wide_Type (Base_T)
5268 -- Ada 2005 (AI-345): For synchronized types generate reference
5269 -- to the wrapper that allow us to dispatch calls through their
5270 -- implemented abstract interface types.
5272 -- The check for Present here is to protect against previously
5273 -- reported critical errors.
5275 if Is_Concurrent_Type (Base_T)
5276 and then Present (Corresponding_Record_Type (Base_T))
5278 Prim_List := Primitive_Operations
5279 (Corresponding_Record_Type (Base_T));
5281 Prim_List := Primitive_Operations (Base_T);
5284 if No (Prim_List) then
5288 Prim := First_Elmt (Prim_List);
5289 while Present (Prim) loop
5291 -- If the operation is derived, get the original for cross-reference
5292 -- reference purposes (it is the original for which we want the xref
5293 -- and for which the comes_from_source test must be performed).
5296 while Present (Alias (Ent)) loop
5300 Generate_Reference (Typ, Ent, 'p', Set_Ref => False);
5303 end Generate_Prim_Op_References;
5305 ---------------------------------
5306 -- Process_Default_Expressions --
5307 ---------------------------------
5309 procedure Process_Default_Expressions
5311 After : in out Node_Id)
5313 Loc : constant Source_Ptr := Sloc (E);
5320 Set_Default_Expressions_Processed (E);
5322 -- A subprogram instance and its associated anonymous subprogram share
5323 -- their signature. The default expression functions are defined in the
5324 -- wrapper packages for the anonymous subprogram, and should not be
5325 -- generated again for the instance.
5327 if Is_Generic_Instance (E)
5328 and then Present (Alias (E))
5329 and then Default_Expressions_Processed (Alias (E))
5334 Formal := First_Formal (E);
5335 while Present (Formal) loop
5336 if Present (Default_Value (Formal)) then
5338 -- We work with a copy of the default expression because we
5339 -- do not want to disturb the original, since this would mess
5340 -- up the conformance checking.
5342 Dcopy := New_Copy_Tree (Default_Value (Formal));
5344 -- The analysis of the expression may generate insert actions,
5345 -- which of course must not be executed. We wrap those actions
5346 -- in a procedure that is not called, and later on eliminated.
5347 -- The following cases have no side-effects, and are analyzed
5350 if Nkind (Dcopy) = N_Identifier
5351 or else Nkind (Dcopy) = N_Expanded_Name
5352 or else Nkind (Dcopy) = N_Integer_Literal
5353 or else (Nkind (Dcopy) = N_Real_Literal
5354 and then not Vax_Float (Etype (Dcopy)))
5355 or else Nkind (Dcopy) = N_Character_Literal
5356 or else Nkind (Dcopy) = N_String_Literal
5357 or else Known_Null (Dcopy)
5358 or else (Nkind (Dcopy) = N_Attribute_Reference
5360 Attribute_Name (Dcopy) = Name_Null_Parameter)
5363 -- If there is no default function, we must still do a full
5364 -- analyze call on the default value, to ensure that all error
5365 -- checks are performed, e.g. those associated with static
5366 -- evaluation. Note: this branch will always be taken if the
5367 -- analyzer is turned off (but we still need the error checks).
5369 -- Note: the setting of parent here is to meet the requirement
5370 -- that we can only analyze the expression while attached to
5371 -- the tree. Really the requirement is that the parent chain
5372 -- be set, we don't actually need to be in the tree.
5374 Set_Parent (Dcopy, Declaration_Node (Formal));
5377 -- Default expressions are resolved with their own type if the
5378 -- context is generic, to avoid anomalies with private types.
5380 if Ekind (Scope (E)) = E_Generic_Package then
5383 Resolve (Dcopy, Etype (Formal));
5386 -- If that resolved expression will raise constraint error,
5387 -- then flag the default value as raising constraint error.
5388 -- This allows a proper error message on the calls.
5390 if Raises_Constraint_Error (Dcopy) then
5391 Set_Raises_Constraint_Error (Default_Value (Formal));
5394 -- If the default is a parameterless call, we use the name of
5395 -- the called function directly, and there is no body to build.
5397 elsif Nkind (Dcopy) = N_Function_Call
5398 and then No (Parameter_Associations (Dcopy))
5402 -- Else construct and analyze the body of a wrapper procedure
5403 -- that contains an object declaration to hold the expression.
5404 -- Given that this is done only to complete the analysis, it
5405 -- simpler to build a procedure than a function which might
5406 -- involve secondary stack expansion.
5410 Make_Defining_Identifier (Loc, New_Internal_Name ('D'));
5413 Make_Subprogram_Body (Loc,
5415 Make_Procedure_Specification (Loc,
5416 Defining_Unit_Name => Dnam),
5418 Declarations => New_List (
5419 Make_Object_Declaration (Loc,
5420 Defining_Identifier =>
5421 Make_Defining_Identifier (Loc,
5422 New_Internal_Name ('T')),
5423 Object_Definition =>
5424 New_Occurrence_Of (Etype (Formal), Loc),
5425 Expression => New_Copy_Tree (Dcopy))),
5427 Handled_Statement_Sequence =>
5428 Make_Handled_Sequence_Of_Statements (Loc,
5429 Statements => New_List));
5431 Set_Scope (Dnam, Scope (E));
5432 Set_Assignment_OK (First (Declarations (Dbody)));
5433 Set_Is_Eliminated (Dnam);
5434 Insert_After (After, Dbody);
5440 Next_Formal (Formal);
5442 end Process_Default_Expressions;
5444 ----------------------------------------
5445 -- Set_Component_Alignment_If_Not_Set --
5446 ----------------------------------------
5448 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id) is
5450 -- Ignore if not base type, subtypes don't need anything
5452 if Typ /= Base_Type (Typ) then
5456 -- Do not override existing representation
5458 if Is_Packed (Typ) then
5461 elsif Has_Specified_Layout (Typ) then
5464 elsif Component_Alignment (Typ) /= Calign_Default then
5468 Set_Component_Alignment
5469 (Typ, Scope_Stack.Table
5470 (Scope_Stack.Last).Component_Alignment_Default);
5472 end Set_Component_Alignment_If_Not_Set;
5478 procedure Undelay_Type (T : Entity_Id) is
5480 Set_Has_Delayed_Freeze (T, False);
5481 Set_Freeze_Node (T, Empty);
5483 -- Since we don't want T to have a Freeze_Node, we don't want its
5484 -- Full_View or Corresponding_Record_Type to have one either.
5486 -- ??? Fundamentally, this whole handling is a kludge. What we really
5487 -- want is to be sure that for an Itype that's part of record R and is a
5488 -- subtype of type T, that it's frozen after the later of the freeze
5489 -- points of R and T. We have no way of doing that directly, so what we
5490 -- do is force most such Itypes to be frozen as part of freezing R via
5491 -- this procedure and only delay the ones that need to be delayed
5492 -- (mostly the designated types of access types that are defined as part
5495 if Is_Private_Type (T)
5496 and then Present (Full_View (T))
5497 and then Is_Itype (Full_View (T))
5498 and then Is_Record_Type (Scope (Full_View (T)))
5500 Undelay_Type (Full_View (T));
5503 if Is_Concurrent_Type (T)
5504 and then Present (Corresponding_Record_Type (T))
5505 and then Is_Itype (Corresponding_Record_Type (T))
5506 and then Is_Record_Type (Scope (Corresponding_Record_Type (T)))
5508 Undelay_Type (Corresponding_Record_Type (T));
5516 procedure Warn_Overlay
5521 Ent : constant Entity_Id := Entity (Nam);
5522 -- The object to which the address clause applies
5525 Old : Entity_Id := Empty;
5529 -- No warning if address clause overlay warnings are off
5531 if not Address_Clause_Overlay_Warnings then
5535 -- No warning if there is an explicit initialization
5537 Init := Original_Node (Expression (Declaration_Node (Ent)));
5539 if Present (Init) and then Comes_From_Source (Init) then
5543 -- We only give the warning for non-imported entities of a type for
5544 -- which a non-null base init proc is defined, or for objects of access
5545 -- types with implicit null initialization, or when Initialize_Scalars
5546 -- applies and the type is scalar or a string type (the latter being
5547 -- tested for because predefined String types are initialized by inline
5548 -- code rather than by an init_proc).
5551 and then not Is_Imported (Ent)
5552 and then (Has_Non_Null_Base_Init_Proc (Typ)
5553 or else Is_Access_Type (Typ)
5554 or else (Init_Or_Norm_Scalars
5555 and then (Is_Scalar_Type (Typ)
5556 or else Is_String_Type (Typ))))
5558 if Nkind (Expr) = N_Attribute_Reference
5559 and then Is_Entity_Name (Prefix (Expr))
5561 Old := Entity (Prefix (Expr));
5563 elsif Is_Entity_Name (Expr)
5564 and then Ekind (Entity (Expr)) = E_Constant
5566 Decl := Declaration_Node (Entity (Expr));
5568 if Nkind (Decl) = N_Object_Declaration
5569 and then Present (Expression (Decl))
5570 and then Nkind (Expression (Decl)) = N_Attribute_Reference
5571 and then Is_Entity_Name (Prefix (Expression (Decl)))
5573 Old := Entity (Prefix (Expression (Decl)));
5575 elsif Nkind (Expr) = N_Function_Call then
5579 -- A function call (most likely to To_Address) is probably not an
5580 -- overlay, so skip warning. Ditto if the function call was inlined
5581 -- and transformed into an entity.
5583 elsif Nkind (Original_Node (Expr)) = N_Function_Call then
5587 Decl := Next (Parent (Expr));
5589 -- If a pragma Import follows, we assume that it is for the current
5590 -- target of the address clause, and skip the warning.
5593 and then Nkind (Decl) = N_Pragma
5594 and then Pragma_Name (Decl) = Name_Import
5599 if Present (Old) then
5600 Error_Msg_Node_2 := Old;
5602 ("default initialization of & may modify &?",
5606 ("default initialization of & may modify overlaid storage?",
5610 -- Add friendly warning if initialization comes from a packed array
5613 if Is_Record_Type (Typ) then
5618 Comp := First_Component (Typ);
5620 while Present (Comp) loop
5621 if Nkind (Parent (Comp)) = N_Component_Declaration
5622 and then Present (Expression (Parent (Comp)))
5625 elsif Is_Array_Type (Etype (Comp))
5626 and then Present (Packed_Array_Type (Etype (Comp)))
5629 ("\packed array component& " &
5630 "will be initialized to zero?",
5634 Next_Component (Comp);
5641 ("\use pragma Import for & to " &
5642 "suppress initialization (RM B.1(24))?",
projects / platform / upstream / gcc.git / blob