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 Process_Default_Expressions
139 After : in out Node_Id);
140 -- This procedure is called for each subprogram to complete processing
141 -- of default expressions at the point where all types are known to be
142 -- frozen. The expressions must be analyzed in full, to make sure that
143 -- all error processing is done (they have only been pre-analyzed). If
144 -- the expression is not an entity or literal, its analysis may generate
145 -- code which must not be executed. In that case we build a function
146 -- body to hold that code. This wrapper function serves no other purpose
147 -- (it used to be called to evaluate the default, but now the default is
148 -- inlined at each point of call).
150 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id);
151 -- Typ is a record or array type that is being frozen. This routine
152 -- sets the default component alignment from the scope stack values
153 -- if the alignment is otherwise not specified.
155 procedure Check_Debug_Info_Needed (T : Entity_Id);
156 -- As each entity is frozen, this routine is called to deal with the
157 -- setting of Debug_Info_Needed for the entity. This flag is set if
158 -- the entity comes from source, or if we are in Debug_Generated_Code
159 -- mode or if the -gnatdV debug flag is set. However, it never sets
160 -- the flag if Debug_Info_Off is set. This procedure also ensures that
161 -- subsidiary entities have the flag set as required.
163 procedure Undelay_Type (T : Entity_Id);
164 -- T is a type of a component that we know to be an Itype.
165 -- We don't want this to have a Freeze_Node, so ensure it doesn't.
166 -- Do the same for any Full_View or Corresponding_Record_Type.
168 procedure Warn_Overlay
172 -- Expr is the expression for an address clause for entity Nam whose type
173 -- is Typ. If Typ has a default initialization, and there is no explicit
174 -- initialization in the source declaration, check whether the address
175 -- clause might cause overlaying of an entity, and emit a warning on the
176 -- side effect that the initialization will cause.
178 -------------------------------
179 -- Adjust_Esize_For_Alignment --
180 -------------------------------
182 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id) is
186 if Known_Esize (Typ) and then Known_Alignment (Typ) then
187 Align := Alignment_In_Bits (Typ);
189 if Align > Esize (Typ)
190 and then Align <= Standard_Long_Long_Integer_Size
192 Set_Esize (Typ, Align);
195 end Adjust_Esize_For_Alignment;
197 ------------------------------------
198 -- Build_And_Analyze_Renamed_Body --
199 ------------------------------------
201 procedure Build_And_Analyze_Renamed_Body
204 After : in out Node_Id)
206 Body_Node : constant Node_Id := Build_Renamed_Body (Decl, New_S);
208 Insert_After (After, Body_Node);
209 Mark_Rewrite_Insertion (Body_Node);
212 end Build_And_Analyze_Renamed_Body;
214 ------------------------
215 -- Build_Renamed_Body --
216 ------------------------
218 function Build_Renamed_Body
220 New_S : Entity_Id) return Node_Id
222 Loc : constant Source_Ptr := Sloc (New_S);
223 -- We use for the source location of the renamed body, the location
224 -- of the spec entity. It might seem more natural to use the location
225 -- of the renaming declaration itself, but that would be wrong, since
226 -- then the body we create would look as though it was created far
227 -- too late, and this could cause problems with elaboration order
228 -- analysis, particularly in connection with instantiations.
230 N : constant Node_Id := Unit_Declaration_Node (New_S);
231 Nam : constant Node_Id := Name (N);
233 Spec : constant Node_Id := New_Copy_Tree (Specification (Decl));
234 Actuals : List_Id := No_List;
239 O_Formal : Entity_Id;
240 Param_Spec : Node_Id;
242 Pref : Node_Id := Empty;
243 -- If the renamed entity is a primitive operation given in prefix form,
244 -- the prefix is the target object and it has to be added as the first
245 -- actual in the generated call.
248 -- Determine the entity being renamed, which is the target of the call
249 -- statement. If the name is an explicit dereference, this is a renaming
250 -- of a subprogram type rather than a subprogram. The name itself is
253 if Nkind (Nam) = N_Selected_Component then
254 Old_S := Entity (Selector_Name (Nam));
256 elsif Nkind (Nam) = N_Explicit_Dereference then
257 Old_S := Etype (Nam);
259 elsif Nkind (Nam) = N_Indexed_Component then
260 if Is_Entity_Name (Prefix (Nam)) then
261 Old_S := Entity (Prefix (Nam));
263 Old_S := Entity (Selector_Name (Prefix (Nam)));
266 elsif Nkind (Nam) = N_Character_Literal then
267 Old_S := Etype (New_S);
270 Old_S := Entity (Nam);
273 if Is_Entity_Name (Nam) then
275 -- If the renamed entity is a predefined operator, retain full name
276 -- to ensure its visibility.
278 if Ekind (Old_S) = E_Operator
279 and then Nkind (Nam) = N_Expanded_Name
281 Call_Name := New_Copy (Name (N));
283 Call_Name := New_Reference_To (Old_S, Loc);
287 if Nkind (Nam) = N_Selected_Component
288 and then Present (First_Formal (Old_S))
290 (Is_Controlling_Formal (First_Formal (Old_S))
291 or else Is_Class_Wide_Type (Etype (First_Formal (Old_S))))
294 -- Retrieve the target object, to be added as a first actual
297 Call_Name := New_Occurrence_Of (Old_S, Loc);
298 Pref := Prefix (Nam);
301 Call_Name := New_Copy (Name (N));
304 -- The original name may have been overloaded, but
305 -- is fully resolved now.
307 Set_Is_Overloaded (Call_Name, False);
310 -- For simple renamings, subsequent calls can be expanded directly as
311 -- called to the renamed entity. The body must be generated in any case
312 -- for calls they may appear elsewhere.
314 if (Ekind (Old_S) = E_Function
315 or else Ekind (Old_S) = E_Procedure)
316 and then Nkind (Decl) = N_Subprogram_Declaration
318 Set_Body_To_Inline (Decl, Old_S);
321 -- The body generated for this renaming is an internal artifact, and
322 -- does not constitute a freeze point for the called entity.
324 Set_Must_Not_Freeze (Call_Name);
326 Formal := First_Formal (Defining_Entity (Decl));
328 if Present (Pref) then
330 Pref_Type : constant Entity_Id := Etype (Pref);
331 Form_Type : constant Entity_Id := Etype (First_Formal (Old_S));
335 -- The controlling formal may be an access parameter, or the
336 -- actual may be an access value, so adjust accordingly.
338 if Is_Access_Type (Pref_Type)
339 and then not Is_Access_Type (Form_Type)
342 (Make_Explicit_Dereference (Loc, Relocate_Node (Pref)));
344 elsif Is_Access_Type (Form_Type)
345 and then not Is_Access_Type (Pref)
348 (Make_Attribute_Reference (Loc,
349 Attribute_Name => Name_Access,
350 Prefix => Relocate_Node (Pref)));
352 Actuals := New_List (Pref);
356 elsif Present (Formal) then
363 if Present (Formal) then
364 while Present (Formal) loop
365 Append (New_Reference_To (Formal, Loc), Actuals);
366 Next_Formal (Formal);
370 -- If the renamed entity is an entry, inherit its profile. For other
371 -- renamings as bodies, both profiles must be subtype conformant, so it
372 -- is not necessary to replace the profile given in the declaration.
373 -- However, default values that are aggregates are rewritten when
374 -- partially analyzed, so we recover the original aggregate to insure
375 -- that subsequent conformity checking works. Similarly, if the default
376 -- expression was constant-folded, recover the original expression.
378 Formal := First_Formal (Defining_Entity (Decl));
380 if Present (Formal) then
381 O_Formal := First_Formal (Old_S);
382 Param_Spec := First (Parameter_Specifications (Spec));
384 while Present (Formal) loop
385 if Is_Entry (Old_S) then
387 if Nkind (Parameter_Type (Param_Spec)) /=
390 Set_Etype (Formal, Etype (O_Formal));
391 Set_Entity (Parameter_Type (Param_Spec), Etype (O_Formal));
394 elsif Nkind (Default_Value (O_Formal)) = N_Aggregate
395 or else Nkind (Original_Node (Default_Value (O_Formal))) /=
396 Nkind (Default_Value (O_Formal))
398 Set_Expression (Param_Spec,
399 New_Copy_Tree (Original_Node (Default_Value (O_Formal))));
402 Next_Formal (Formal);
403 Next_Formal (O_Formal);
408 -- If the renamed entity is a function, the generated body contains a
409 -- return statement. Otherwise, build a procedure call. If the entity is
410 -- an entry, subsequent analysis of the call will transform it into the
411 -- proper entry or protected operation call. If the renamed entity is
412 -- a character literal, return it directly.
414 if Ekind (Old_S) = E_Function
415 or else Ekind (Old_S) = E_Operator
416 or else (Ekind (Old_S) = E_Subprogram_Type
417 and then Etype (Old_S) /= Standard_Void_Type)
420 Make_Simple_Return_Statement (Loc,
422 Make_Function_Call (Loc,
424 Parameter_Associations => Actuals));
426 elsif Ekind (Old_S) = E_Enumeration_Literal then
428 Make_Simple_Return_Statement (Loc,
429 Expression => New_Occurrence_Of (Old_S, Loc));
431 elsif Nkind (Nam) = N_Character_Literal then
433 Make_Simple_Return_Statement (Loc,
434 Expression => Call_Name);
438 Make_Procedure_Call_Statement (Loc,
440 Parameter_Associations => Actuals);
443 -- Create entities for subprogram body and formals
445 Set_Defining_Unit_Name (Spec,
446 Make_Defining_Identifier (Loc, Chars => Chars (New_S)));
448 Param_Spec := First (Parameter_Specifications (Spec));
450 while Present (Param_Spec) loop
451 Set_Defining_Identifier (Param_Spec,
452 Make_Defining_Identifier (Loc,
453 Chars => Chars (Defining_Identifier (Param_Spec))));
458 Make_Subprogram_Body (Loc,
459 Specification => Spec,
460 Declarations => New_List,
461 Handled_Statement_Sequence =>
462 Make_Handled_Sequence_Of_Statements (Loc,
463 Statements => New_List (Call_Node)));
465 if Nkind (Decl) /= N_Subprogram_Declaration then
467 Make_Subprogram_Declaration (Loc,
468 Specification => Specification (N)));
471 -- Link the body to the entity whose declaration it completes. If
472 -- the body is analyzed when the renamed entity is frozen, it may
473 -- be necessary to restore the proper scope (see package Exp_Ch13).
475 if Nkind (N) = N_Subprogram_Renaming_Declaration
476 and then Present (Corresponding_Spec (N))
478 Set_Corresponding_Spec (Body_Node, Corresponding_Spec (N));
480 Set_Corresponding_Spec (Body_Node, New_S);
484 end Build_Renamed_Body;
486 --------------------------
487 -- Check_Address_Clause --
488 --------------------------
490 procedure Check_Address_Clause (E : Entity_Id) is
491 Addr : constant Node_Id := Address_Clause (E);
493 Decl : constant Node_Id := Declaration_Node (E);
494 Typ : constant Entity_Id := Etype (E);
497 if Present (Addr) then
498 Expr := Expression (Addr);
500 -- If we have no initialization of any kind, then we don't need to
501 -- place any restrictions on the address clause, because the object
502 -- will be elaborated after the address clause is evaluated. This
503 -- happens if the declaration has no initial expression, or the type
504 -- has no implicit initialization, or the object is imported.
506 -- The same holds for all initialized scalar types and all access
507 -- types. Packed bit arrays of size up to 64 are represented using a
508 -- modular type with an initialization (to zero) and can be processed
509 -- like other initialized scalar types.
511 -- If the type is controlled, code to attach the object to a
512 -- finalization chain is generated at the point of declaration,
513 -- and therefore the elaboration of the object cannot be delayed:
514 -- the address expression must be a constant.
516 if (No (Expression (Decl))
517 and then not Controlled_Type (Typ)
519 (not Has_Non_Null_Base_Init_Proc (Typ)
520 or else Is_Imported (E)))
523 (Present (Expression (Decl))
524 and then Is_Scalar_Type (Typ))
530 (Is_Bit_Packed_Array (Typ)
532 Is_Modular_Integer_Type (Packed_Array_Type (Typ)))
536 -- Otherwise, we require the address clause to be constant because
537 -- the call to the initialization procedure (or the attach code) has
538 -- to happen at the point of the declaration.
541 Check_Constant_Address_Clause (Expr, E);
542 Set_Has_Delayed_Freeze (E, False);
545 if not Error_Posted (Expr)
546 and then not Controlled_Type (Typ)
548 Warn_Overlay (Expr, Typ, Name (Addr));
551 end Check_Address_Clause;
553 -----------------------------
554 -- Check_Compile_Time_Size --
555 -----------------------------
557 procedure Check_Compile_Time_Size (T : Entity_Id) is
559 procedure Set_Small_Size (T : Entity_Id; S : Uint);
560 -- Sets the compile time known size (32 bits or less) in the Esize
561 -- field, of T checking for a size clause that was given which attempts
562 -- to give a smaller size.
564 function Size_Known (T : Entity_Id) return Boolean;
565 -- Recursive function that does all the work
567 function Static_Discriminated_Components (T : Entity_Id) return Boolean;
568 -- If T is a constrained subtype, its size is not known if any of its
569 -- discriminant constraints is not static and it is not a null record.
570 -- The test is conservative and doesn't check that the components are
571 -- in fact constrained by non-static discriminant values. Could be made
578 procedure Set_Small_Size (T : Entity_Id; S : Uint) is
583 elsif Has_Size_Clause (T) then
584 if RM_Size (T) < S then
585 Error_Msg_Uint_1 := S;
587 ("size for & too small, minimum allowed is ^",
590 elsif Unknown_Esize (T) then
594 -- Set sizes if not set already
597 if Unknown_Esize (T) then
601 if Unknown_RM_Size (T) then
611 function Size_Known (T : Entity_Id) return Boolean is
619 if Size_Known_At_Compile_Time (T) then
622 -- Always True for scalar types. This is true even for generic formal
623 -- scalar types. We used to return False in the latter case, but the
624 -- size is known at compile time, even in the template, we just do
625 -- not know the exact size but that's not the point of this routine.
627 elsif Is_Scalar_Type (T)
628 or else Is_Task_Type (T)
634 elsif Is_Array_Type (T) then
636 -- String literals always have known size, and we can set it
638 if Ekind (T) = E_String_Literal_Subtype then
639 Set_Small_Size (T, Component_Size (T)
640 * String_Literal_Length (T));
643 -- Unconstrained types never have known at compile time size
645 elsif not Is_Constrained (T) then
648 -- Don't do any recursion on type with error posted, since we may
649 -- have a malformed type that leads us into a loop.
651 elsif Error_Posted (T) then
654 -- Otherwise if component size unknown, then array size unknown
656 elsif not Size_Known (Component_Type (T)) then
660 -- Check for all indexes static, and also compute possible size
661 -- (in case it is less than 32 and may be packable).
664 Esiz : Uint := Component_Size (T);
668 Index := First_Index (T);
669 while Present (Index) loop
670 if Nkind (Index) = N_Range then
671 Get_Index_Bounds (Index, Low, High);
673 elsif Error_Posted (Scalar_Range (Etype (Index))) then
677 Low := Type_Low_Bound (Etype (Index));
678 High := Type_High_Bound (Etype (Index));
681 if not Compile_Time_Known_Value (Low)
682 or else not Compile_Time_Known_Value (High)
683 or else Etype (Index) = Any_Type
688 Dim := Expr_Value (High) - Expr_Value (Low) + 1;
700 Set_Small_Size (T, Esiz);
704 -- Access types always have known at compile time sizes
706 elsif Is_Access_Type (T) then
709 -- For non-generic private types, go to underlying type if present
711 elsif Is_Private_Type (T)
712 and then not Is_Generic_Type (T)
713 and then Present (Underlying_Type (T))
715 -- Don't do any recursion on type with error posted, since we may
716 -- have a malformed type that leads us into a loop.
718 if Error_Posted (T) then
721 return Size_Known (Underlying_Type (T));
726 elsif Is_Record_Type (T) then
728 -- A class-wide type is never considered to have a known size
730 if Is_Class_Wide_Type (T) then
733 -- A subtype of a variant record must not have non-static
734 -- discriminanted components.
736 elsif T /= Base_Type (T)
737 and then not Static_Discriminated_Components (T)
741 -- Don't do any recursion on type with error posted, since we may
742 -- have a malformed type that leads us into a loop.
744 elsif Error_Posted (T) then
748 -- Now look at the components of the record
751 -- The following two variables are used to keep track of the
752 -- size of packed records if we can tell the size of the packed
753 -- record in the front end. Packed_Size_Known is True if so far
754 -- we can figure out the size. It is initialized to True for a
755 -- packed record, unless the record has discriminants. The
756 -- reason we eliminate the discriminated case is that we don't
757 -- know the way the back end lays out discriminated packed
758 -- records. If Packed_Size_Known is True, then Packed_Size is
759 -- the size in bits so far.
761 Packed_Size_Known : Boolean :=
763 and then not Has_Discriminants (T);
765 Packed_Size : Uint := Uint_0;
768 -- Test for variant part present
770 if Has_Discriminants (T)
771 and then Present (Parent (T))
772 and then Nkind (Parent (T)) = N_Full_Type_Declaration
773 and then Nkind (Type_Definition (Parent (T))) =
775 and then not Null_Present (Type_Definition (Parent (T)))
776 and then Present (Variant_Part
777 (Component_List (Type_Definition (Parent (T)))))
779 -- If variant part is present, and type is unconstrained,
780 -- then we must have defaulted discriminants, or a size
781 -- clause must be present for the type, or else the size
782 -- is definitely not known at compile time.
784 if not Is_Constrained (T)
786 No (Discriminant_Default_Value
787 (First_Discriminant (T)))
788 and then Unknown_Esize (T)
794 -- Loop through components
796 Comp := First_Component_Or_Discriminant (T);
797 while Present (Comp) loop
798 Ctyp := Etype (Comp);
800 -- We do not know the packed size if there is a component
801 -- clause present (we possibly could, but this would only
802 -- help in the case of a record with partial rep clauses.
803 -- That's because in the case of full rep clauses, the
804 -- size gets figured out anyway by a different circuit).
806 if Present (Component_Clause (Comp)) then
807 Packed_Size_Known := False;
810 -- We need to identify a component that is an array where
811 -- the index type is an enumeration type with non-standard
812 -- representation, and some bound of the type depends on a
815 -- This is because gigi computes the size by doing a
816 -- substitution of the appropriate discriminant value in
817 -- the size expression for the base type, and gigi is not
818 -- clever enough to evaluate the resulting expression (which
819 -- involves a call to rep_to_pos) at compile time.
821 -- It would be nice if gigi would either recognize that
822 -- this expression can be computed at compile time, or
823 -- alternatively figured out the size from the subtype
824 -- directly, where all the information is at hand ???
826 if Is_Array_Type (Etype (Comp))
827 and then Present (Packed_Array_Type (Etype (Comp)))
830 Ocomp : constant Entity_Id :=
831 Original_Record_Component (Comp);
832 OCtyp : constant Entity_Id := Etype (Ocomp);
838 Ind := First_Index (OCtyp);
839 while Present (Ind) loop
840 Indtyp := Etype (Ind);
842 if Is_Enumeration_Type (Indtyp)
843 and then Has_Non_Standard_Rep (Indtyp)
845 Lo := Type_Low_Bound (Indtyp);
846 Hi := Type_High_Bound (Indtyp);
848 if Is_Entity_Name (Lo)
849 and then Ekind (Entity (Lo)) = E_Discriminant
853 elsif Is_Entity_Name (Hi)
854 and then Ekind (Entity (Hi)) = E_Discriminant
865 -- Clearly size of record is not known if the size of one of
866 -- the components is not known.
868 if not Size_Known (Ctyp) then
872 -- Accumulate packed size if possible
874 if Packed_Size_Known then
876 -- We can only deal with elementary types, since for
877 -- non-elementary components, alignment enters into the
878 -- picture, and we don't know enough to handle proper
879 -- alignment in this context. Packed arrays count as
880 -- elementary if the representation is a modular type.
882 if Is_Elementary_Type (Ctyp)
883 or else (Is_Array_Type (Ctyp)
884 and then Present (Packed_Array_Type (Ctyp))
885 and then Is_Modular_Integer_Type
886 (Packed_Array_Type (Ctyp)))
888 -- If RM_Size is known and static, then we can
889 -- keep accumulating the packed size.
891 if Known_Static_RM_Size (Ctyp) then
893 -- A little glitch, to be removed sometime ???
894 -- gigi does not understand zero sizes yet.
896 if RM_Size (Ctyp) = Uint_0 then
897 Packed_Size_Known := False;
899 -- Normal case where we can keep accumulating the
900 -- packed array size.
903 Packed_Size := Packed_Size + RM_Size (Ctyp);
906 -- If we have a field whose RM_Size is not known then
907 -- we can't figure out the packed size here.
910 Packed_Size_Known := False;
913 -- If we have a non-elementary type we can't figure out
914 -- the packed array size (alignment issues).
917 Packed_Size_Known := False;
921 Next_Component_Or_Discriminant (Comp);
924 if Packed_Size_Known then
925 Set_Small_Size (T, Packed_Size);
931 -- All other cases, size not known at compile time
938 -------------------------------------
939 -- Static_Discriminated_Components --
940 -------------------------------------
942 function Static_Discriminated_Components
943 (T : Entity_Id) return Boolean
945 Constraint : Elmt_Id;
948 if Has_Discriminants (T)
949 and then Present (Discriminant_Constraint (T))
950 and then Present (First_Component (T))
952 Constraint := First_Elmt (Discriminant_Constraint (T));
953 while Present (Constraint) loop
954 if not Compile_Time_Known_Value (Node (Constraint)) then
958 Next_Elmt (Constraint);
963 end Static_Discriminated_Components;
965 -- Start of processing for Check_Compile_Time_Size
968 Set_Size_Known_At_Compile_Time (T, Size_Known (T));
969 end Check_Compile_Time_Size;
971 -----------------------------
972 -- Check_Debug_Info_Needed --
973 -----------------------------
975 procedure Check_Debug_Info_Needed (T : Entity_Id) is
977 if Debug_Info_Off (T) then
980 elsif Comes_From_Source (T)
981 or else Debug_Generated_Code
982 or else Debug_Flag_VV
983 or else Needs_Debug_Info (T)
985 Set_Debug_Info_Needed (T);
987 end Check_Debug_Info_Needed;
989 ----------------------------
990 -- Check_Strict_Alignment --
991 ----------------------------
993 procedure Check_Strict_Alignment (E : Entity_Id) is
997 if Is_Tagged_Type (E) or else Is_Concurrent_Type (E) then
998 Set_Strict_Alignment (E);
1000 elsif Is_Array_Type (E) then
1001 Set_Strict_Alignment (E, Strict_Alignment (Component_Type (E)));
1003 elsif Is_Record_Type (E) then
1004 if Is_Limited_Record (E) then
1005 Set_Strict_Alignment (E);
1009 Comp := First_Component (E);
1011 while Present (Comp) loop
1012 if not Is_Type (Comp)
1013 and then (Strict_Alignment (Etype (Comp))
1014 or else Is_Aliased (Comp))
1016 Set_Strict_Alignment (E);
1020 Next_Component (Comp);
1023 end Check_Strict_Alignment;
1025 -------------------------
1026 -- Check_Unsigned_Type --
1027 -------------------------
1029 procedure Check_Unsigned_Type (E : Entity_Id) is
1030 Ancestor : Entity_Id;
1035 if not Is_Discrete_Or_Fixed_Point_Type (E) then
1039 -- Do not attempt to analyze case where range was in error
1041 if Error_Posted (Scalar_Range (E)) then
1045 -- The situation that is non trivial is something like
1047 -- subtype x1 is integer range -10 .. +10;
1048 -- subtype x2 is x1 range 0 .. V1;
1049 -- subtype x3 is x2 range V2 .. V3;
1050 -- subtype x4 is x3 range V4 .. V5;
1052 -- where Vn are variables. Here the base type is signed, but we still
1053 -- know that x4 is unsigned because of the lower bound of x2.
1055 -- The only way to deal with this is to look up the ancestor chain
1059 if Ancestor = Any_Type or else Etype (Ancestor) = Any_Type then
1063 Lo_Bound := Type_Low_Bound (Ancestor);
1065 if Compile_Time_Known_Value (Lo_Bound) then
1067 if Expr_Rep_Value (Lo_Bound) >= 0 then
1068 Set_Is_Unsigned_Type (E, True);
1074 Ancestor := Ancestor_Subtype (Ancestor);
1076 -- If no ancestor had a static lower bound, go to base type
1078 if No (Ancestor) then
1080 -- Note: the reason we still check for a compile time known
1081 -- value for the base type is that at least in the case of
1082 -- generic formals, we can have bounds that fail this test,
1083 -- and there may be other cases in error situations.
1085 Btyp := Base_Type (E);
1087 if Btyp = Any_Type or else Etype (Btyp) = Any_Type then
1091 Lo_Bound := Type_Low_Bound (Base_Type (E));
1093 if Compile_Time_Known_Value (Lo_Bound)
1094 and then Expr_Rep_Value (Lo_Bound) >= 0
1096 Set_Is_Unsigned_Type (E, True);
1103 end Check_Unsigned_Type;
1105 -----------------------------
1106 -- Expand_Atomic_Aggregate --
1107 -----------------------------
1109 procedure Expand_Atomic_Aggregate (E : Entity_Id; Typ : Entity_Id) is
1110 Loc : constant Source_Ptr := Sloc (E);
1115 if (Nkind (Parent (E)) = N_Object_Declaration
1116 or else Nkind (Parent (E)) = N_Assignment_Statement)
1117 and then Comes_From_Source (Parent (E))
1118 and then Nkind (E) = N_Aggregate
1121 Make_Defining_Identifier (Loc,
1122 New_Internal_Name ('T'));
1125 Make_Object_Declaration (Loc,
1126 Defining_Identifier => Temp,
1127 Object_Definition => New_Occurrence_Of (Typ, Loc),
1128 Expression => Relocate_Node (E));
1129 Insert_Before (Parent (E), New_N);
1132 Set_Expression (Parent (E), New_Occurrence_Of (Temp, Loc));
1134 -- To prevent the temporary from being constant-folded (which would
1135 -- lead to the same piecemeal assignment on the original target)
1136 -- indicate to the back-end that the temporary is a variable with
1137 -- real storage. See description of this flag in Einfo, and the notes
1138 -- on N_Assignment_Statement and N_Object_Declaration in Sinfo.
1140 Set_Is_True_Constant (Temp, False);
1142 end Expand_Atomic_Aggregate;
1148 -- Note: the easy coding for this procedure would be to just build a
1149 -- single list of freeze nodes and then insert them and analyze them
1150 -- all at once. This won't work, because the analysis of earlier freeze
1151 -- nodes may recursively freeze types which would otherwise appear later
1152 -- on in the freeze list. So we must analyze and expand the freeze nodes
1153 -- as they are generated.
1155 procedure Freeze_All (From : Entity_Id; After : in out Node_Id) is
1156 Loc : constant Source_Ptr := Sloc (After);
1160 procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id);
1161 -- This is the internal recursive routine that does freezing of entities
1162 -- (but NOT the analysis of default expressions, which should not be
1163 -- recursive, we don't want to analyze those till we are sure that ALL
1164 -- the types are frozen).
1166 --------------------
1167 -- Freeze_All_Ent --
1168 --------------------
1170 procedure Freeze_All_Ent
1172 After : in out Node_Id)
1178 procedure Process_Flist;
1179 -- If freeze nodes are present, insert and analyze, and reset cursor
1180 -- for next insertion.
1186 procedure Process_Flist is
1188 if Is_Non_Empty_List (Flist) then
1189 Lastn := Next (After);
1190 Insert_List_After_And_Analyze (After, Flist);
1192 if Present (Lastn) then
1193 After := Prev (Lastn);
1195 After := Last (List_Containing (After));
1200 -- Start or processing for Freeze_All_Ent
1204 while Present (E) loop
1206 -- If the entity is an inner package which is not a package
1207 -- renaming, then its entities must be frozen at this point. Note
1208 -- that such entities do NOT get frozen at the end of the nested
1209 -- package itself (only library packages freeze).
1211 -- Same is true for task declarations, where anonymous records
1212 -- created for entry parameters must be frozen.
1214 if Ekind (E) = E_Package
1215 and then No (Renamed_Object (E))
1216 and then not Is_Child_Unit (E)
1217 and then not Is_Frozen (E)
1220 Install_Visible_Declarations (E);
1221 Install_Private_Declarations (E);
1223 Freeze_All (First_Entity (E), After);
1225 End_Package_Scope (E);
1227 elsif Ekind (E) in Task_Kind
1229 (Nkind (Parent (E)) = N_Task_Type_Declaration
1231 Nkind (Parent (E)) = N_Single_Task_Declaration)
1234 Freeze_All (First_Entity (E), After);
1237 -- For a derived tagged type, we must ensure that all the
1238 -- primitive operations of the parent have been frozen, so that
1239 -- their addresses will be in the parent's dispatch table at the
1240 -- point it is inherited.
1242 elsif Ekind (E) = E_Record_Type
1243 and then Is_Tagged_Type (E)
1244 and then Is_Tagged_Type (Etype (E))
1245 and then Is_Derived_Type (E)
1248 Prim_List : constant Elist_Id :=
1249 Primitive_Operations (Etype (E));
1255 Prim := First_Elmt (Prim_List);
1257 while Present (Prim) loop
1258 Subp := Node (Prim);
1260 if Comes_From_Source (Subp)
1261 and then not Is_Frozen (Subp)
1263 Flist := Freeze_Entity (Subp, Loc);
1272 if not Is_Frozen (E) then
1273 Flist := Freeze_Entity (E, Loc);
1277 -- If an incomplete type is still not frozen, this may be a
1278 -- premature freezing because of a body declaration that follows.
1279 -- Indicate where the freezing took place.
1281 -- If the freezing is caused by the end of the current declarative
1282 -- part, it is a Taft Amendment type, and there is no error.
1284 if not Is_Frozen (E)
1285 and then Ekind (E) = E_Incomplete_Type
1288 Bod : constant Node_Id := Next (After);
1291 if (Nkind (Bod) = N_Subprogram_Body
1292 or else Nkind (Bod) = N_Entry_Body
1293 or else Nkind (Bod) = N_Package_Body
1294 or else Nkind (Bod) = N_Protected_Body
1295 or else Nkind (Bod) = N_Task_Body
1296 or else Nkind (Bod) in N_Body_Stub)
1298 List_Containing (After) = List_Containing (Parent (E))
1300 Error_Msg_Sloc := Sloc (Next (After));
1302 ("type& is frozen# before its full declaration",
1312 -- Start of processing for Freeze_All
1315 Freeze_All_Ent (From, After);
1317 -- Now that all types are frozen, we can deal with default expressions
1318 -- that require us to build a default expression functions. This is the
1319 -- point at which such functions are constructed (after all types that
1320 -- might be used in such expressions have been frozen).
1322 -- We also add finalization chains to access types whose designated
1323 -- types are controlled. This is normally done when freezing the type,
1324 -- but this misses recursive type definitions where the later members
1325 -- of the recursion introduce controlled components.
1327 -- Loop through entities
1330 while Present (E) loop
1331 if Is_Subprogram (E) then
1333 if not Default_Expressions_Processed (E) then
1334 Process_Default_Expressions (E, After);
1337 if not Has_Completion (E) then
1338 Decl := Unit_Declaration_Node (E);
1340 if Nkind (Decl) = N_Subprogram_Renaming_Declaration then
1341 Build_And_Analyze_Renamed_Body (Decl, E, After);
1343 elsif Nkind (Decl) = N_Subprogram_Declaration
1344 and then Present (Corresponding_Body (Decl))
1346 Nkind (Unit_Declaration_Node (Corresponding_Body (Decl)))
1347 = N_Subprogram_Renaming_Declaration
1349 Build_And_Analyze_Renamed_Body
1350 (Decl, Corresponding_Body (Decl), After);
1354 elsif Ekind (E) in Task_Kind
1356 (Nkind (Parent (E)) = N_Task_Type_Declaration
1358 Nkind (Parent (E)) = N_Single_Task_Declaration)
1363 Ent := First_Entity (E);
1365 while Present (Ent) loop
1368 and then not Default_Expressions_Processed (Ent)
1370 Process_Default_Expressions (Ent, After);
1377 elsif Is_Access_Type (E)
1378 and then Comes_From_Source (E)
1379 and then Ekind (Directly_Designated_Type (E)) = E_Incomplete_Type
1380 and then Controlled_Type (Designated_Type (E))
1381 and then No (Associated_Final_Chain (E))
1383 Build_Final_List (Parent (E), E);
1390 -----------------------
1391 -- Freeze_And_Append --
1392 -----------------------
1394 procedure Freeze_And_Append
1397 Result : in out List_Id)
1399 L : constant List_Id := Freeze_Entity (Ent, Loc);
1401 if Is_Non_Empty_List (L) then
1402 if Result = No_List then
1405 Append_List (L, Result);
1408 end Freeze_And_Append;
1414 procedure Freeze_Before (N : Node_Id; T : Entity_Id) is
1415 Freeze_Nodes : constant List_Id := Freeze_Entity (T, Sloc (N));
1417 if Is_Non_Empty_List (Freeze_Nodes) then
1418 Insert_Actions (N, Freeze_Nodes);
1426 function Freeze_Entity (E : Entity_Id; Loc : Source_Ptr) return List_Id is
1427 Test_E : Entity_Id := E;
1435 procedure Check_Current_Instance (Comp_Decl : Node_Id);
1436 -- Check that an Access or Unchecked_Access attribute with a prefix
1437 -- which is the current instance type can only be applied when the type
1440 function After_Last_Declaration return Boolean;
1441 -- If Loc is a freeze_entity that appears after the last declaration
1442 -- in the scope, inhibit error messages on late completion.
1444 procedure Freeze_Record_Type (Rec : Entity_Id);
1445 -- Freeze each component, handle some representation clauses, and freeze
1446 -- primitive operations if this is a tagged type.
1448 ----------------------------
1449 -- After_Last_Declaration --
1450 ----------------------------
1452 function After_Last_Declaration return Boolean is
1453 Spec : constant Node_Id := Parent (Current_Scope);
1455 if Nkind (Spec) = N_Package_Specification then
1456 if Present (Private_Declarations (Spec)) then
1457 return Loc >= Sloc (Last (Private_Declarations (Spec)));
1458 elsif Present (Visible_Declarations (Spec)) then
1459 return Loc >= Sloc (Last (Visible_Declarations (Spec)));
1466 end After_Last_Declaration;
1468 ----------------------------
1469 -- Check_Current_Instance --
1470 ----------------------------
1472 procedure Check_Current_Instance (Comp_Decl : Node_Id) is
1474 Rec_Type : constant Entity_Id :=
1475 Scope (Defining_Identifier (Comp_Decl));
1477 Decl : constant Node_Id := Parent (Rec_Type);
1479 function Process (N : Node_Id) return Traverse_Result;
1480 -- Process routine to apply check to given node
1486 function Process (N : Node_Id) return Traverse_Result is
1489 when N_Attribute_Reference =>
1490 if (Attribute_Name (N) = Name_Access
1492 Attribute_Name (N) = Name_Unchecked_Access)
1493 and then Is_Entity_Name (Prefix (N))
1494 and then Is_Type (Entity (Prefix (N)))
1495 and then Entity (Prefix (N)) = E
1498 ("current instance must be a limited type", Prefix (N));
1504 when others => return OK;
1508 procedure Traverse is new Traverse_Proc (Process);
1510 -- Start of processing for Check_Current_Instance
1513 -- In Ada95, the (imprecise) rule is that the current instance of a
1514 -- limited type is aliased. In Ada2005, limitedness must be explicit:
1515 -- either a tagged type, or a limited record.
1517 if Is_Limited_Type (Rec_Type)
1519 (Ada_Version < Ada_05
1520 or else Is_Tagged_Type (Rec_Type))
1524 elsif Nkind (Decl) = N_Full_Type_Declaration
1525 and then Limited_Present (Type_Definition (Decl))
1530 Traverse (Comp_Decl);
1532 end Check_Current_Instance;
1534 ------------------------
1535 -- Freeze_Record_Type --
1536 ------------------------
1538 procedure Freeze_Record_Type (Rec : Entity_Id) is
1545 pragma Warnings (Off, Junk);
1547 Unplaced_Component : Boolean := False;
1548 -- Set True if we find at least one component with no component
1549 -- clause (used to warn about useless Pack pragmas).
1551 Placed_Component : Boolean := False;
1552 -- Set True if we find at least one component with a component
1553 -- clause (used to warn about useless Bit_Order pragmas).
1555 function Check_Allocator (N : Node_Id) return Node_Id;
1556 -- If N is an allocator, possibly wrapped in one or more level of
1557 -- qualified expression(s), return the inner allocator node, else
1560 procedure Check_Itype (Typ : Entity_Id);
1561 -- If the component subtype is an access to a constrained subtype of
1562 -- an already frozen type, make the subtype frozen as well. It might
1563 -- otherwise be frozen in the wrong scope, and a freeze node on
1564 -- subtype has no effect. Similarly, if the component subtype is a
1565 -- regular (not protected) access to subprogram, set the anonymous
1566 -- subprogram type to frozen as well, to prevent an out-of-scope
1567 -- freeze node at some eventual point of call. Protected operations
1568 -- are handled elsewhere.
1570 ---------------------
1571 -- Check_Allocator --
1572 ---------------------
1574 function Check_Allocator (N : Node_Id) return Node_Id is
1579 if Nkind (Inner) = N_Allocator then
1581 elsif Nkind (Inner) = N_Qualified_Expression then
1582 Inner := Expression (Inner);
1587 end Check_Allocator;
1593 procedure Check_Itype (Typ : Entity_Id) is
1594 Desig : constant Entity_Id := Designated_Type (Typ);
1597 if not Is_Frozen (Desig)
1598 and then Is_Frozen (Base_Type (Desig))
1600 Set_Is_Frozen (Desig);
1602 -- In addition, add an Itype_Reference to ensure that the
1603 -- access subtype is elaborated early enough. This cannot be
1604 -- done if the subtype may depend on discriminants.
1606 if Ekind (Comp) = E_Component
1607 and then Is_Itype (Etype (Comp))
1608 and then not Has_Discriminants (Rec)
1610 IR := Make_Itype_Reference (Sloc (Comp));
1611 Set_Itype (IR, Desig);
1614 Result := New_List (IR);
1616 Append (IR, Result);
1620 elsif Ekind (Typ) = E_Anonymous_Access_Subprogram_Type
1621 and then Convention (Desig) /= Convention_Protected
1623 Set_Is_Frozen (Desig);
1627 -- Start of processing for Freeze_Record_Type
1630 -- If this is a subtype of a controlled type, declared without a
1631 -- constraint, the _controller may not appear in the component list
1632 -- if the parent was not frozen at the point of subtype declaration.
1633 -- Inherit the _controller component now.
1635 if Rec /= Base_Type (Rec)
1636 and then Has_Controlled_Component (Rec)
1638 if Nkind (Parent (Rec)) = N_Subtype_Declaration
1639 and then Is_Entity_Name (Subtype_Indication (Parent (Rec)))
1641 Set_First_Entity (Rec, First_Entity (Base_Type (Rec)));
1643 -- If this is an internal type without a declaration, as for
1644 -- record component, the base type may not yet be frozen, and its
1645 -- controller has not been created. Add an explicit freeze node
1646 -- for the itype, so it will be frozen after the base type. This
1647 -- freeze node is used to communicate with the expander, in order
1648 -- to create the controller for the enclosing record, and it is
1649 -- deleted afterwards (see exp_ch3). It must not be created when
1650 -- expansion is off, because it might appear in the wrong context
1651 -- for the back end.
1653 elsif Is_Itype (Rec)
1654 and then Has_Delayed_Freeze (Base_Type (Rec))
1656 Nkind (Associated_Node_For_Itype (Rec)) =
1657 N_Component_Declaration
1658 and then Expander_Active
1660 Ensure_Freeze_Node (Rec);
1664 -- Freeze components and embedded subtypes
1666 Comp := First_Entity (Rec);
1668 while Present (Comp) loop
1670 -- First handle the (real) component case
1672 if Ekind (Comp) = E_Component
1673 or else Ekind (Comp) = E_Discriminant
1676 CC : constant Node_Id := Component_Clause (Comp);
1679 -- Freezing a record type freezes the type of each of its
1680 -- components. However, if the type of the component is
1681 -- part of this record, we do not want or need a separate
1682 -- Freeze_Node. Note that Is_Itype is wrong because that's
1683 -- also set in private type cases. We also can't check for
1684 -- the Scope being exactly Rec because of private types and
1685 -- record extensions.
1687 if Is_Itype (Etype (Comp))
1688 and then Is_Record_Type (Underlying_Type
1689 (Scope (Etype (Comp))))
1691 Undelay_Type (Etype (Comp));
1694 Freeze_And_Append (Etype (Comp), Loc, Result);
1696 -- Check for error of component clause given for variable
1697 -- sized type. We have to delay this test till this point,
1698 -- since the component type has to be frozen for us to know
1699 -- if it is variable length. We omit this test in a generic
1700 -- context, it will be applied at instantiation time.
1702 if Present (CC) then
1703 Placed_Component := True;
1705 if Inside_A_Generic then
1709 Size_Known_At_Compile_Time
1710 (Underlying_Type (Etype (Comp)))
1713 ("component clause not allowed for variable " &
1714 "length component", CC);
1718 Unplaced_Component := True;
1721 -- Case of component requires byte alignment
1723 if Must_Be_On_Byte_Boundary (Etype (Comp)) then
1725 -- Set the enclosing record to also require byte align
1727 Set_Must_Be_On_Byte_Boundary (Rec);
1729 -- Check for component clause that is inconsistent with
1730 -- the required byte boundary alignment.
1733 and then Normalized_First_Bit (Comp) mod
1734 System_Storage_Unit /= 0
1737 ("component & must be byte aligned",
1738 Component_Name (Component_Clause (Comp)));
1742 -- If component clause is present, then deal with the non-
1743 -- default bit order case for Ada 95 mode. The required
1744 -- processing for Ada 2005 mode is handled separately after
1745 -- processing all components.
1747 -- We only do this processing for the base type, and in
1748 -- fact that's important, since otherwise if there are
1749 -- record subtypes, we could reverse the bits once for
1750 -- each subtype, which would be incorrect.
1753 and then Reverse_Bit_Order (Rec)
1754 and then Ekind (E) = E_Record_Type
1755 and then Ada_Version <= Ada_95
1758 CFB : constant Uint := Component_Bit_Offset (Comp);
1759 CSZ : constant Uint := Esize (Comp);
1760 CLC : constant Node_Id := Component_Clause (Comp);
1761 Pos : constant Node_Id := Position (CLC);
1762 FB : constant Node_Id := First_Bit (CLC);
1764 Storage_Unit_Offset : constant Uint :=
1765 CFB / System_Storage_Unit;
1767 Start_Bit : constant Uint :=
1768 CFB mod System_Storage_Unit;
1771 -- Cases where field goes over storage unit boundary
1773 if Start_Bit + CSZ > System_Storage_Unit then
1775 -- Allow multi-byte field but generate warning
1777 if Start_Bit mod System_Storage_Unit = 0
1778 and then CSZ mod System_Storage_Unit = 0
1781 ("multi-byte field specified with non-standard"
1782 & " Bit_Order?", CLC);
1784 if Bytes_Big_Endian then
1786 ("bytes are not reversed "
1787 & "(component is big-endian)?", CLC);
1790 ("bytes are not reversed "
1791 & "(component is little-endian)?", CLC);
1794 -- Do not allow non-contiguous field
1798 ("attempt to specify non-contiguous field"
1799 & " not permitted", CLC);
1801 ("\(caused by non-standard Bit_Order "
1802 & "specified)", CLC);
1805 -- Case where field fits in one storage unit
1808 -- Give warning if suspicious component clause
1810 if Intval (FB) >= System_Storage_Unit
1811 and then Warn_On_Reverse_Bit_Order
1814 ("?Bit_Order clause does not affect " &
1815 "byte ordering", Pos);
1817 Intval (Pos) + Intval (FB) /
1818 System_Storage_Unit;
1820 ("?position normalized to ^ before bit " &
1821 "order interpreted", Pos);
1824 -- Here is where we fix up the Component_Bit_Offset
1825 -- value to account for the reverse bit order.
1826 -- Some examples of what needs to be done are:
1828 -- First_Bit .. Last_Bit Component_Bit_Offset
1831 -- 0 .. 0 7 .. 7 0 7
1832 -- 0 .. 1 6 .. 7 0 6
1833 -- 0 .. 2 5 .. 7 0 5
1834 -- 0 .. 7 0 .. 7 0 4
1836 -- 1 .. 1 6 .. 6 1 6
1837 -- 1 .. 4 3 .. 6 1 3
1838 -- 4 .. 7 0 .. 3 4 0
1840 -- The general rule is that the first bit is
1841 -- is obtained by subtracting the old ending bit
1842 -- from storage_unit - 1.
1844 Set_Component_Bit_Offset
1846 (Storage_Unit_Offset * System_Storage_Unit) +
1847 (System_Storage_Unit - 1) -
1848 (Start_Bit + CSZ - 1));
1850 Set_Normalized_First_Bit
1852 Component_Bit_Offset (Comp) mod
1853 System_Storage_Unit);
1860 -- If the component is an Itype with Delayed_Freeze and is either
1861 -- a record or array subtype and its base type has not yet been
1862 -- frozen, we must remove this from the entity list of this
1863 -- record and put it on the entity list of the scope of its base
1864 -- type. Note that we know that this is not the type of a
1865 -- component since we cleared Has_Delayed_Freeze for it in the
1866 -- previous loop. Thus this must be the Designated_Type of an
1867 -- access type, which is the type of a component.
1870 and then Is_Type (Scope (Comp))
1871 and then Is_Composite_Type (Comp)
1872 and then Base_Type (Comp) /= Comp
1873 and then Has_Delayed_Freeze (Comp)
1874 and then not Is_Frozen (Base_Type (Comp))
1877 Will_Be_Frozen : Boolean := False;
1881 -- We have a pretty bad kludge here. Suppose Rec is subtype
1882 -- being defined in a subprogram that's created as part of
1883 -- the freezing of Rec'Base. In that case, we know that
1884 -- Comp'Base must have already been frozen by the time we
1885 -- get to elaborate this because Gigi doesn't elaborate any
1886 -- bodies until it has elaborated all of the declarative
1887 -- part. But Is_Frozen will not be set at this point because
1888 -- we are processing code in lexical order.
1890 -- We detect this case by going up the Scope chain of Rec
1891 -- and seeing if we have a subprogram scope before reaching
1892 -- the top of the scope chain or that of Comp'Base. If we
1893 -- do, then mark that Comp'Base will actually be frozen. If
1894 -- so, we merely undelay it.
1897 while Present (S) loop
1898 if Is_Subprogram (S) then
1899 Will_Be_Frozen := True;
1901 elsif S = Scope (Base_Type (Comp)) then
1908 if Will_Be_Frozen then
1909 Undelay_Type (Comp);
1911 if Present (Prev) then
1912 Set_Next_Entity (Prev, Next_Entity (Comp));
1914 Set_First_Entity (Rec, Next_Entity (Comp));
1917 -- Insert in entity list of scope of base type (which
1918 -- must be an enclosing scope, because still unfrozen).
1920 Append_Entity (Comp, Scope (Base_Type (Comp)));
1924 -- If the component is an access type with an allocator as default
1925 -- value, the designated type will be frozen by the corresponding
1926 -- expression in init_proc. In order to place the freeze node for
1927 -- the designated type before that for the current record type,
1930 -- Same process if the component is an array of access types,
1931 -- initialized with an aggregate. If the designated type is
1932 -- private, it cannot contain allocators, and it is premature
1933 -- to freeze the type, so we check for this as well.
1935 elsif Is_Access_Type (Etype (Comp))
1936 and then Present (Parent (Comp))
1937 and then Present (Expression (Parent (Comp)))
1940 Alloc : constant Node_Id :=
1941 Check_Allocator (Expression (Parent (Comp)));
1944 if Present (Alloc) then
1946 -- If component is pointer to a classwide type, freeze
1947 -- the specific type in the expression being allocated.
1948 -- The expression may be a subtype indication, in which
1949 -- case freeze the subtype mark.
1951 if Is_Class_Wide_Type
1952 (Designated_Type (Etype (Comp)))
1954 if Is_Entity_Name (Expression (Alloc)) then
1956 (Entity (Expression (Alloc)), Loc, Result);
1958 Nkind (Expression (Alloc)) = N_Subtype_Indication
1961 (Entity (Subtype_Mark (Expression (Alloc))),
1965 elsif Is_Itype (Designated_Type (Etype (Comp))) then
1966 Check_Itype (Etype (Comp));
1970 (Designated_Type (Etype (Comp)), Loc, Result);
1975 elsif Is_Access_Type (Etype (Comp))
1976 and then Is_Itype (Designated_Type (Etype (Comp)))
1978 Check_Itype (Etype (Comp));
1980 elsif Is_Array_Type (Etype (Comp))
1981 and then Is_Access_Type (Component_Type (Etype (Comp)))
1982 and then Present (Parent (Comp))
1983 and then Nkind (Parent (Comp)) = N_Component_Declaration
1984 and then Present (Expression (Parent (Comp)))
1985 and then Nkind (Expression (Parent (Comp))) = N_Aggregate
1986 and then Is_Fully_Defined
1987 (Designated_Type (Component_Type (Etype (Comp))))
1991 (Component_Type (Etype (Comp))), Loc, Result);
1998 -- Deal with pragma Bit_Order
2000 if Reverse_Bit_Order (Rec) and then Base_Type (Rec) = Rec then
2001 if not Placed_Component then
2003 Get_Attribute_Definition_Clause (Rec, Attribute_Bit_Order);
2005 ("?Bit_Order specification has no effect", ADC);
2007 ("\?since no component clauses were specified", ADC);
2009 -- Here is where we do Ada 2005 processing for bit order (the Ada
2010 -- 95 case was already taken care of above).
2012 elsif Ada_Version >= Ada_05 then
2013 Adjust_Record_For_Reverse_Bit_Order (Rec);
2017 -- Set OK_To_Reorder_Components depending on debug flags
2019 if Rec = Base_Type (Rec)
2020 and then Convention (Rec) = Convention_Ada
2022 if (Has_Discriminants (Rec) and then Debug_Flag_Dot_V)
2024 (not Has_Discriminants (Rec) and then Debug_Flag_Dot_R)
2026 Set_OK_To_Reorder_Components (Rec);
2030 -- Check for useless pragma Pack when all components placed. We only
2031 -- do this check for record types, not subtypes, since a subtype may
2032 -- have all its components placed, and it still makes perfectly good
2033 -- sense to pack other subtypes or the parent type. We do not give
2034 -- this warning if Optimize_Alignment is set to Space, since the
2035 -- pragma Pack does have an effect in this case (it always resets
2036 -- the alignment to one).
2038 if Ekind (Rec) = E_Record_Type
2039 and then Is_Packed (Rec)
2040 and then not Unplaced_Component
2041 and then Optimize_Alignment /= 'S'
2043 -- Reset packed status. Probably not necessary, but we do it so
2044 -- that there is no chance of the back end doing something strange
2045 -- with this redundant indication of packing.
2047 Set_Is_Packed (Rec, False);
2049 -- Give warning if redundant constructs warnings on
2051 if Warn_On_Redundant_Constructs then
2053 ("?pragma Pack has no effect, no unplaced components",
2054 Get_Rep_Pragma (Rec, Name_Pack));
2058 -- If this is the record corresponding to a remote type, freeze the
2059 -- remote type here since that is what we are semantically freezing.
2060 -- This prevents the freeze node for that type in an inner scope.
2062 -- Also, Check for controlled components and unchecked unions.
2063 -- Finally, enforce the restriction that access attributes with a
2064 -- current instance prefix can only apply to limited types.
2066 if Ekind (Rec) = E_Record_Type then
2067 if Present (Corresponding_Remote_Type (Rec)) then
2069 (Corresponding_Remote_Type (Rec), Loc, Result);
2072 Comp := First_Component (Rec);
2073 while Present (Comp) loop
2074 if Has_Controlled_Component (Etype (Comp))
2075 or else (Chars (Comp) /= Name_uParent
2076 and then Is_Controlled (Etype (Comp)))
2077 or else (Is_Protected_Type (Etype (Comp))
2079 (Corresponding_Record_Type (Etype (Comp)))
2080 and then Has_Controlled_Component
2081 (Corresponding_Record_Type (Etype (Comp))))
2083 Set_Has_Controlled_Component (Rec);
2087 if Has_Unchecked_Union (Etype (Comp)) then
2088 Set_Has_Unchecked_Union (Rec);
2091 if Has_Per_Object_Constraint (Comp) then
2093 -- Scan component declaration for likely misuses of current
2094 -- instance, either in a constraint or a default expression.
2096 Check_Current_Instance (Parent (Comp));
2099 Next_Component (Comp);
2103 Set_Component_Alignment_If_Not_Set (Rec);
2105 -- For first subtypes, check if there are any fixed-point fields with
2106 -- component clauses, where we must check the size. This is not done
2107 -- till the freeze point, since for fixed-point types, we do not know
2108 -- the size until the type is frozen. Similar processing applies to
2109 -- bit packed arrays.
2111 if Is_First_Subtype (Rec) then
2112 Comp := First_Component (Rec);
2114 while Present (Comp) loop
2115 if Present (Component_Clause (Comp))
2116 and then (Is_Fixed_Point_Type (Etype (Comp))
2118 Is_Bit_Packed_Array (Etype (Comp)))
2121 (Component_Name (Component_Clause (Comp)),
2127 Next_Component (Comp);
2131 -- Generate warning for applying C or C++ convention to a record
2132 -- with discriminants. This is suppressed for the unchecked union
2133 -- case, since the whole point in this case is interface C. We also
2134 -- do not generate this within instantiations, since we will have
2135 -- generated a message on the template.
2137 if Has_Discriminants (E)
2138 and then not Is_Unchecked_Union (E)
2139 and then (Convention (E) = Convention_C
2141 Convention (E) = Convention_CPP)
2142 and then Comes_From_Source (E)
2143 and then not In_Instance
2144 and then not Has_Warnings_Off (E)
2145 and then not Has_Warnings_Off (Base_Type (E))
2148 Cprag : constant Node_Id := Get_Rep_Pragma (E, Name_Convention);
2152 if Present (Cprag) then
2153 A2 := Next (First (Pragma_Argument_Associations (Cprag)));
2155 if Convention (E) = Convention_C then
2157 ("?variant record has no direct equivalent in C", A2);
2160 ("?variant record has no direct equivalent in C++", A2);
2164 ("\?use of convention for type& is dubious", A2, E);
2168 end Freeze_Record_Type;
2170 -- Start of processing for Freeze_Entity
2173 -- We are going to test for various reasons why this entity need not be
2174 -- frozen here, but in the case of an Itype that's defined within a
2175 -- record, that test actually applies to the record.
2177 if Is_Itype (E) and then Is_Record_Type (Scope (E)) then
2178 Test_E := Scope (E);
2179 elsif Is_Itype (E) and then Present (Underlying_Type (Scope (E)))
2180 and then Is_Record_Type (Underlying_Type (Scope (E)))
2182 Test_E := Underlying_Type (Scope (E));
2185 -- Do not freeze if already frozen since we only need one freeze node
2187 if Is_Frozen (E) then
2190 -- It is improper to freeze an external entity within a generic because
2191 -- its freeze node will appear in a non-valid context. The entity will
2192 -- be frozen in the proper scope after the current generic is analyzed.
2194 elsif Inside_A_Generic and then External_Ref_In_Generic (Test_E) then
2197 -- Do not freeze a global entity within an inner scope created during
2198 -- expansion. A call to subprogram E within some internal procedure
2199 -- (a stream attribute for example) might require freezing E, but the
2200 -- freeze node must appear in the same declarative part as E itself.
2201 -- The two-pass elaboration mechanism in gigi guarantees that E will
2202 -- be frozen before the inner call is elaborated. We exclude constants
2203 -- from this test, because deferred constants may be frozen early, and
2204 -- must be diagnosed (e.g. in the case of a deferred constant being used
2205 -- in a default expression). If the enclosing subprogram comes from
2206 -- source, or is a generic instance, then the freeze point is the one
2207 -- mandated by the language, and we freeze the entity. A subprogram that
2208 -- is a child unit body that acts as a spec does not have a spec that
2209 -- comes from source, but can only come from source.
2211 elsif In_Open_Scopes (Scope (Test_E))
2212 and then Scope (Test_E) /= Current_Scope
2213 and then Ekind (Test_E) /= E_Constant
2216 S : Entity_Id := Current_Scope;
2219 while Present (S) loop
2220 if Is_Overloadable (S) then
2221 if Comes_From_Source (S)
2222 or else Is_Generic_Instance (S)
2223 or else Is_Child_Unit (S)
2235 -- Similarly, an inlined instance body may make reference to global
2236 -- entities, but these references cannot be the proper freezing point
2237 -- for them, and in the absence of inlining freezing will take place in
2238 -- their own scope. Normally instance bodies are analyzed after the
2239 -- enclosing compilation, and everything has been frozen at the proper
2240 -- place, but with front-end inlining an instance body is compiled
2241 -- before the end of the enclosing scope, and as a result out-of-order
2242 -- freezing must be prevented.
2244 elsif Front_End_Inlining
2245 and then In_Instance_Body
2246 and then Present (Scope (Test_E))
2249 S : Entity_Id := Scope (Test_E);
2252 while Present (S) loop
2253 if Is_Generic_Instance (S) then
2266 -- Here to freeze the entity
2271 -- Case of entity being frozen is other than a type
2273 if not Is_Type (E) then
2275 -- If entity is exported or imported and does not have an external
2276 -- name, now is the time to provide the appropriate default name.
2277 -- Skip this if the entity is stubbed, since we don't need a name
2278 -- for any stubbed routine.
2280 if (Is_Imported (E) or else Is_Exported (E))
2281 and then No (Interface_Name (E))
2282 and then Convention (E) /= Convention_Stubbed
2284 Set_Encoded_Interface_Name
2285 (E, Get_Default_External_Name (E));
2287 -- Special processing for atomic objects appearing in object decls
2290 and then Nkind (Parent (E)) = N_Object_Declaration
2291 and then Present (Expression (Parent (E)))
2294 Expr : constant Node_Id := Expression (Parent (E));
2297 -- If expression is an aggregate, assign to a temporary to
2298 -- ensure that the actual assignment is done atomically rather
2299 -- than component-wise (the assignment to the temp may be done
2300 -- component-wise, but that is harmless).
2302 if Nkind (Expr) = N_Aggregate then
2303 Expand_Atomic_Aggregate (Expr, Etype (E));
2305 -- If the expression is a reference to a record or array object
2306 -- entity, then reset Is_True_Constant to False so that the
2307 -- compiler will not optimize away the intermediate object,
2308 -- which we need in this case for the same reason (to ensure
2309 -- that the actual assignment is atomic, rather than
2312 elsif Is_Entity_Name (Expr)
2313 and then (Is_Record_Type (Etype (Expr))
2315 Is_Array_Type (Etype (Expr)))
2317 Set_Is_True_Constant (Entity (Expr), False);
2322 -- For a subprogram, freeze all parameter types and also the return
2323 -- type (RM 13.14(14)). However skip this for internal subprograms.
2324 -- This is also the point where any extra formal parameters are
2325 -- created since we now know whether the subprogram will use
2326 -- a foreign convention.
2328 if Is_Subprogram (E) then
2329 if not Is_Internal (E) then
2333 Warn_Node : Node_Id;
2336 -- Loop through formals
2338 Formal := First_Formal (E);
2339 while Present (Formal) loop
2340 F_Type := Etype (Formal);
2341 Freeze_And_Append (F_Type, Loc, Result);
2343 if Is_Private_Type (F_Type)
2344 and then Is_Private_Type (Base_Type (F_Type))
2345 and then No (Full_View (Base_Type (F_Type)))
2346 and then not Is_Generic_Type (F_Type)
2347 and then not Is_Derived_Type (F_Type)
2349 -- If the type of a formal is incomplete, subprogram
2350 -- is being frozen prematurely. Within an instance
2351 -- (but not within a wrapper package) this is an
2352 -- an artifact of our need to regard the end of an
2353 -- instantiation as a freeze point. Otherwise it is
2354 -- a definite error.
2356 -- and then not Is_Wrapper_Package (Current_Scope) ???
2359 Set_Is_Frozen (E, False);
2362 elsif not After_Last_Declaration
2363 and then not Freezing_Library_Level_Tagged_Type
2365 Error_Msg_Node_1 := F_Type;
2367 ("type& must be fully defined before this point",
2372 -- Check suspicious parameter for C function. These tests
2373 -- apply only to exported/imported subprograms.
2375 if Warn_On_Export_Import
2376 and then Comes_From_Source (E)
2377 and then (Convention (E) = Convention_C
2379 Convention (E) = Convention_CPP)
2380 and then (Is_Imported (E) or else Is_Exported (E))
2381 and then Convention (E) /= Convention (Formal)
2382 and then not Has_Warnings_Off (E)
2383 and then not Has_Warnings_Off (F_Type)
2384 and then not Has_Warnings_Off (Formal)
2386 Error_Msg_Qual_Level := 1;
2388 -- Check suspicious use of fat C pointer
2390 if Is_Access_Type (F_Type)
2391 and then Esize (F_Type) > Ttypes.System_Address_Size
2394 ("?type of & does not correspond "
2395 & "to C pointer!", Formal);
2397 -- Check suspicious return of boolean
2399 elsif Root_Type (F_Type) = Standard_Boolean
2400 and then Convention (F_Type) = Convention_Ada
2401 and then not Has_Warnings_Off (F_Type)
2402 and then not Has_Size_Clause (F_Type)
2405 ("?& is an 8-bit Ada Boolean, "
2406 & "use char in C!", Formal);
2408 -- Check suspicious tagged type
2410 elsif (Is_Tagged_Type (F_Type)
2411 or else (Is_Access_Type (F_Type)
2414 (Designated_Type (F_Type))))
2415 and then Convention (E) = Convention_C
2418 ("?& is a tagged type which does not "
2419 & "correspond to any C type!", Formal);
2421 -- Check wrong convention subprogram pointer
2423 elsif Ekind (F_Type) = E_Access_Subprogram_Type
2424 and then not Has_Foreign_Convention (F_Type)
2427 ("?subprogram pointer & should "
2428 & "have foreign convention!", Formal);
2429 Error_Msg_Sloc := Sloc (F_Type);
2431 ("\?add Convention pragma to declaration of &#",
2435 Error_Msg_Qual_Level := 0;
2438 -- Check for unconstrained array in exported foreign
2441 if Has_Foreign_Convention (E)
2442 and then not Is_Imported (E)
2443 and then Is_Array_Type (F_Type)
2444 and then not Is_Constrained (F_Type)
2445 and then Warn_On_Export_Import
2447 Error_Msg_Qual_Level := 1;
2449 -- If this is an inherited operation, place the
2450 -- warning on the derived type declaration, rather
2451 -- than on the original subprogram.
2453 if Nkind (Original_Node (Parent (E))) =
2454 N_Full_Type_Declaration
2456 Warn_Node := Parent (E);
2458 if Formal = First_Formal (E) then
2460 ("?in inherited operation&", Warn_Node, E);
2463 Warn_Node := Formal;
2467 ("?type of argument& is unconstrained array",
2470 ("?foreign caller must pass bounds explicitly",
2472 Error_Msg_Qual_Level := 0;
2475 -- Ada 2005 (AI-326): Check wrong use of tag incomplete
2476 -- types with unknown discriminants. For example:
2478 -- type T (<>) is tagged;
2479 -- procedure P (X : access T); -- ERROR
2480 -- procedure P (X : T); -- ERROR
2482 if not From_With_Type (F_Type) then
2483 if Is_Access_Type (F_Type) then
2484 F_Type := Designated_Type (F_Type);
2487 if Ekind (F_Type) = E_Incomplete_Type
2488 and then Is_Tagged_Type (F_Type)
2489 and then not Is_Class_Wide_Type (F_Type)
2490 and then No (Full_View (F_Type))
2491 and then Unknown_Discriminants_Present
2493 and then No (Stored_Constraint (F_Type))
2496 ("(Ada 2005): invalid use of unconstrained tagged"
2497 & " incomplete type", E);
2499 -- If the formal is an anonymous_access_to_subprogram
2500 -- freeze the subprogram type as well, to prevent
2501 -- scope anomalies in gigi, because there is no other
2502 -- clear point at which it could be frozen.
2504 elsif Is_Itype (Etype (Formal))
2505 and then Ekind (F_Type) = E_Subprogram_Type
2507 Freeze_And_Append (F_Type, Loc, Result);
2511 Next_Formal (Formal);
2516 if Ekind (E) = E_Function then
2518 -- Freeze return type
2520 R_Type := Etype (E);
2521 Freeze_And_Append (R_Type, Loc, Result);
2523 -- Check suspicious return type for C function
2525 if Warn_On_Export_Import
2526 and then (Convention (E) = Convention_C
2528 Convention (E) = Convention_CPP)
2529 and then (Is_Imported (E) or else Is_Exported (E))
2531 -- Check suspicious return of fat C pointer
2533 if Is_Access_Type (R_Type)
2534 and then Esize (R_Type) > Ttypes.System_Address_Size
2535 and then not Has_Warnings_Off (E)
2536 and then not Has_Warnings_Off (R_Type)
2539 ("?return type of& does not "
2540 & "correspond to C pointer!", E);
2542 -- Check suspicious return of boolean
2544 elsif Root_Type (R_Type) = Standard_Boolean
2545 and then Convention (R_Type) = Convention_Ada
2546 and then not Has_Warnings_Off (E)
2547 and then not Has_Warnings_Off (R_Type)
2548 and then not Has_Size_Clause (R_Type)
2551 ("?return type of & is an 8-bit "
2552 & "Ada Boolean, use char in C!", E);
2554 -- Check suspicious return tagged type
2556 elsif (Is_Tagged_Type (R_Type)
2557 or else (Is_Access_Type (R_Type)
2560 (Designated_Type (R_Type))))
2561 and then Convention (E) = Convention_C
2562 and then not Has_Warnings_Off (E)
2563 and then not Has_Warnings_Off (R_Type)
2566 ("?return type of & does not "
2567 & "correspond to C type!", E);
2569 -- Check return of wrong convention subprogram pointer
2571 elsif Ekind (R_Type) = E_Access_Subprogram_Type
2572 and then not Has_Foreign_Convention (R_Type)
2573 and then not Has_Warnings_Off (E)
2574 and then not Has_Warnings_Off (R_Type)
2577 ("?& should return a foreign "
2578 & "convention subprogram pointer", E);
2579 Error_Msg_Sloc := Sloc (R_Type);
2581 ("\?add Convention pragma to declaration of& #",
2586 if Is_Array_Type (Etype (E))
2587 and then not Is_Constrained (Etype (E))
2588 and then not Is_Imported (E)
2589 and then Has_Foreign_Convention (E)
2590 and then Warn_On_Export_Import
2591 and then not Has_Warnings_Off (E)
2592 and then not Has_Warnings_Off (Etype (E))
2595 ("?foreign convention function& should not " &
2596 "return unconstrained array!", E);
2598 -- Ada 2005 (AI-326): Check wrong use of tagged
2601 -- type T is tagged;
2602 -- function F (X : Boolean) return T; -- ERROR
2604 elsif Ekind (Etype (E)) = E_Incomplete_Type
2605 and then Is_Tagged_Type (Etype (E))
2606 and then No (Full_View (Etype (E)))
2607 and then not Is_Value_Type (Etype (E))
2610 ("(Ada 2005): invalid use of tagged incomplete type",
2617 -- Must freeze its parent first if it is a derived subprogram
2619 if Present (Alias (E)) then
2620 Freeze_And_Append (Alias (E), Loc, Result);
2623 -- We don't freeze internal subprograms, because we don't normally
2624 -- want addition of extra formals or mechanism setting to happen
2625 -- for those. However we do pass through predefined dispatching
2626 -- cases, since extra formals may be needed in some cases, such as
2627 -- for the stream 'Input function (build-in-place formals).
2629 if not Is_Internal (E)
2630 or else Is_Predefined_Dispatching_Operation (E)
2632 Freeze_Subprogram (E);
2635 -- Here for other than a subprogram or type
2638 -- If entity has a type, and it is not a generic unit, then
2639 -- freeze it first (RM 13.14(10)).
2641 if Present (Etype (E))
2642 and then Ekind (E) /= E_Generic_Function
2644 Freeze_And_Append (Etype (E), Loc, Result);
2647 -- Special processing for objects created by object declaration
2649 if Nkind (Declaration_Node (E)) = N_Object_Declaration then
2651 -- For object created by object declaration, perform required
2652 -- categorization (preelaborate and pure) checks. Defer these
2653 -- checks to freeze time since pragma Import inhibits default
2654 -- initialization and thus pragma Import affects these checks.
2656 Validate_Object_Declaration (Declaration_Node (E));
2658 -- If there is an address clause, check that it is valid
2660 Check_Address_Clause (E);
2662 -- If the object needs any kind of default initialization, an
2663 -- error must be issued if No_Default_Initialization applies.
2664 -- The check doesn't apply to imported objects, which are not
2665 -- ever default initialized, and is why the check is deferred
2666 -- until freezing, at which point we know if Import applies.
2667 -- Deferred constants are also exempted from this test because
2668 -- their completion is explicit, or through an import pragma.
2670 if Ekind (E) = E_Constant
2671 and then Present (Full_View (E))
2675 elsif Comes_From_Source (E)
2676 and then not Is_Imported (E)
2677 and then not Has_Init_Expression (Declaration_Node (E))
2679 ((Has_Non_Null_Base_Init_Proc (Etype (E))
2680 and then not No_Initialization (Declaration_Node (E))
2681 and then not Is_Value_Type (Etype (E))
2682 and then not Suppress_Init_Proc (Etype (E)))
2684 (Needs_Simple_Initialization (Etype (E))
2685 and then not Is_Internal (E)))
2688 (No_Default_Initialization, Declaration_Node (E));
2691 -- For imported objects, set Is_Public unless there is also an
2692 -- address clause, which means that there is no external symbol
2693 -- needed for the Import (Is_Public may still be set for other
2694 -- unrelated reasons). Note that we delayed this processing
2695 -- till freeze time so that we can be sure not to set the flag
2696 -- if there is an address clause. If there is such a clause,
2697 -- then the only purpose of the Import pragma is to suppress
2698 -- implicit initialization.
2701 and then No (Address_Clause (E))
2706 -- For convention C objects of an enumeration type, warn if
2707 -- the size is not integer size and no explicit size given.
2708 -- Skip warning for Boolean, and Character, assume programmer
2709 -- expects 8-bit sizes for these cases.
2711 if (Convention (E) = Convention_C
2713 Convention (E) = Convention_CPP)
2714 and then Is_Enumeration_Type (Etype (E))
2715 and then not Is_Character_Type (Etype (E))
2716 and then not Is_Boolean_Type (Etype (E))
2717 and then Esize (Etype (E)) < Standard_Integer_Size
2718 and then not Has_Size_Clause (E)
2720 Error_Msg_Uint_1 := UI_From_Int (Standard_Integer_Size);
2722 ("?convention C enumeration object has size less than ^",
2724 Error_Msg_N ("\?use explicit size clause to set size", E);
2728 -- Check that a constant which has a pragma Volatile[_Components]
2729 -- or Atomic[_Components] also has a pragma Import (RM C.6(13)).
2731 -- Note: Atomic[_Components] also sets Volatile[_Components]
2733 if Ekind (E) = E_Constant
2734 and then (Has_Volatile_Components (E) or else Is_Volatile (E))
2735 and then not Is_Imported (E)
2737 -- Make sure we actually have a pragma, and have not merely
2738 -- inherited the indication from elsewhere (e.g. an address
2739 -- clause, which is not good enough in RM terms!)
2741 if Has_Rep_Pragma (E, Name_Atomic)
2743 Has_Rep_Pragma (E, Name_Atomic_Components)
2746 ("stand alone atomic constant must be " &
2747 "imported (RM C.6(13))", E);
2749 elsif Has_Rep_Pragma (E, Name_Volatile)
2751 Has_Rep_Pragma (E, Name_Volatile_Components)
2754 ("stand alone volatile constant must be " &
2755 "imported (RM C.6(13))", E);
2759 -- Static objects require special handling
2761 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
2762 and then Is_Statically_Allocated (E)
2764 Freeze_Static_Object (E);
2767 -- Remaining step is to layout objects
2769 if Ekind (E) = E_Variable
2771 Ekind (E) = E_Constant
2773 Ekind (E) = E_Loop_Parameter
2781 -- Case of a type or subtype being frozen
2784 -- We used to check here that a full type must have preelaborable
2785 -- initialization if it completes a private type specified with
2786 -- pragma Preelaborable_Intialization, but that missed cases where
2787 -- the types occur within a generic package, since the freezing
2788 -- that occurs within a containing scope generally skips traversal
2789 -- of a generic unit's declarations (those will be frozen within
2790 -- instances). This check was moved to Analyze_Package_Specification.
2792 -- The type may be defined in a generic unit. This can occur when
2793 -- freezing a generic function that returns the type (which is
2794 -- defined in a parent unit). It is clearly meaningless to freeze
2795 -- this type. However, if it is a subtype, its size may be determi-
2796 -- nable and used in subsequent checks, so might as well try to
2799 if Present (Scope (E))
2800 and then Is_Generic_Unit (Scope (E))
2802 Check_Compile_Time_Size (E);
2806 -- Deal with special cases of freezing for subtype
2808 if E /= Base_Type (E) then
2810 -- Before we do anything else, a specialized test for the case of
2811 -- a size given for an array where the array needs to be packed,
2812 -- but was not so the size cannot be honored. This would of course
2813 -- be caught by the backend, and indeed we don't catch all cases.
2814 -- The point is that we can give a better error message in those
2815 -- cases that we do catch with the circuitry here. Also if pragma
2816 -- Implicit_Packing is set, this is where the packing occurs.
2818 -- The reason we do this so early is that the processing in the
2819 -- automatic packing case affects the layout of the base type, so
2820 -- it must be done before we freeze the base type.
2822 if Is_Array_Type (E) then
2825 Ctyp : constant Entity_Id := Component_Type (E);
2828 -- Check enabling conditions. These are straightforward
2829 -- except for the test for a limited composite type. This
2830 -- eliminates the rare case of a array of limited components
2831 -- where there are issues of whether or not we can go ahead
2832 -- and pack the array (since we can't freely pack and unpack
2833 -- arrays if they are limited).
2835 -- Note that we check the root type explicitly because the
2836 -- whole point is we are doing this test before we have had
2837 -- a chance to freeze the base type (and it is that freeze
2838 -- action that causes stuff to be inherited).
2840 if Present (Size_Clause (E))
2841 and then Known_Static_Esize (E)
2842 and then not Is_Packed (E)
2843 and then not Has_Pragma_Pack (E)
2844 and then Number_Dimensions (E) = 1
2845 and then not Has_Component_Size_Clause (E)
2846 and then Known_Static_Esize (Ctyp)
2847 and then not Is_Limited_Composite (E)
2848 and then not Is_Packed (Root_Type (E))
2849 and then not Has_Component_Size_Clause (Root_Type (E))
2851 Get_Index_Bounds (First_Index (E), Lo, Hi);
2853 if Compile_Time_Known_Value (Lo)
2854 and then Compile_Time_Known_Value (Hi)
2855 and then Known_Static_RM_Size (Ctyp)
2856 and then RM_Size (Ctyp) < 64
2859 Lov : constant Uint := Expr_Value (Lo);
2860 Hiv : constant Uint := Expr_Value (Hi);
2861 Len : constant Uint := UI_Max
2864 Rsiz : constant Uint := RM_Size (Ctyp);
2865 SZ : constant Node_Id := Size_Clause (E);
2866 Btyp : constant Entity_Id := Base_Type (E);
2868 -- What we are looking for here is the situation where
2869 -- the RM_Size given would be exactly right if there
2870 -- was a pragma Pack (resulting in the component size
2871 -- being the same as the RM_Size). Furthermore, the
2872 -- component type size must be an odd size (not a
2873 -- multiple of storage unit)
2876 if RM_Size (E) = Len * Rsiz
2877 and then Rsiz mod System_Storage_Unit /= 0
2879 -- For implicit packing mode, just set the
2880 -- component size silently
2882 if Implicit_Packing then
2883 Set_Component_Size (Btyp, Rsiz);
2884 Set_Is_Bit_Packed_Array (Btyp);
2885 Set_Is_Packed (Btyp);
2886 Set_Has_Non_Standard_Rep (Btyp);
2888 -- Otherwise give an error message
2892 ("size given for& too small", SZ, E);
2894 ("\use explicit pragma Pack "
2895 & "or use pragma Implicit_Packing", SZ);
2904 -- If ancestor subtype present, freeze that first. Note that this
2905 -- will also get the base type frozen.
2907 Atype := Ancestor_Subtype (E);
2909 if Present (Atype) then
2910 Freeze_And_Append (Atype, Loc, Result);
2912 -- Otherwise freeze the base type of the entity before freezing
2913 -- the entity itself (RM 13.14(15)).
2915 elsif E /= Base_Type (E) then
2916 Freeze_And_Append (Base_Type (E), Loc, Result);
2919 -- For a derived type, freeze its parent type first (RM 13.14(15))
2921 elsif Is_Derived_Type (E) then
2922 Freeze_And_Append (Etype (E), Loc, Result);
2923 Freeze_And_Append (First_Subtype (Etype (E)), Loc, Result);
2926 -- For array type, freeze index types and component type first
2927 -- before freezing the array (RM 13.14(15)).
2929 if Is_Array_Type (E) then
2931 Ctyp : constant Entity_Id := Component_Type (E);
2933 Non_Standard_Enum : Boolean := False;
2934 -- Set true if any of the index types is an enumeration type
2935 -- with a non-standard representation.
2938 Freeze_And_Append (Ctyp, Loc, Result);
2940 Indx := First_Index (E);
2941 while Present (Indx) loop
2942 Freeze_And_Append (Etype (Indx), Loc, Result);
2944 if Is_Enumeration_Type (Etype (Indx))
2945 and then Has_Non_Standard_Rep (Etype (Indx))
2947 Non_Standard_Enum := True;
2953 -- Processing that is done only for base types
2955 if Ekind (E) = E_Array_Type then
2957 -- Propagate flags for component type
2959 if Is_Controlled (Component_Type (E))
2960 or else Has_Controlled_Component (Ctyp)
2962 Set_Has_Controlled_Component (E);
2965 if Has_Unchecked_Union (Component_Type (E)) then
2966 Set_Has_Unchecked_Union (E);
2969 -- If packing was requested or if the component size was set
2970 -- explicitly, then see if bit packing is required. This
2971 -- processing is only done for base types, since all the
2972 -- representation aspects involved are type-related. This
2973 -- is not just an optimization, if we start processing the
2974 -- subtypes, they interfere with the settings on the base
2975 -- type (this is because Is_Packed has a slightly different
2976 -- meaning before and after freezing).
2983 if (Is_Packed (E) or else Has_Pragma_Pack (E))
2984 and then not Has_Atomic_Components (E)
2985 and then Known_Static_RM_Size (Ctyp)
2987 Csiz := UI_Max (RM_Size (Ctyp), 1);
2989 elsif Known_Component_Size (E) then
2990 Csiz := Component_Size (E);
2992 elsif not Known_Static_Esize (Ctyp) then
2996 Esiz := Esize (Ctyp);
2998 -- We can set the component size if it is less than
2999 -- 16, rounding it up to the next storage unit size.
3003 elsif Esiz <= 16 then
3009 -- Set component size up to match alignment if it
3010 -- would otherwise be less than the alignment. This
3011 -- deals with cases of types whose alignment exceeds
3012 -- their size (padded types).
3016 A : constant Uint := Alignment_In_Bits (Ctyp);
3025 -- Case of component size that may result in packing
3027 if 1 <= Csiz and then Csiz <= 64 then
3029 Ent : constant Entity_Id :=
3031 Pack_Pragma : constant Node_Id :=
3032 Get_Rep_Pragma (Ent, Name_Pack);
3033 Comp_Size_C : constant Node_Id :=
3034 Get_Attribute_Definition_Clause
3035 (Ent, Attribute_Component_Size);
3037 -- Warn if we have pack and component size so that
3038 -- the pack is ignored.
3040 -- Note: here we must check for the presence of a
3041 -- component size before checking for a Pack pragma
3042 -- to deal with the case where the array type is a
3043 -- derived type whose parent is currently private.
3045 if Present (Comp_Size_C)
3046 and then Has_Pragma_Pack (Ent)
3048 Error_Msg_Sloc := Sloc (Comp_Size_C);
3050 ("?pragma Pack for& ignored!",
3053 ("\?explicit component size given#!",
3057 -- Set component size if not already set by a
3058 -- component size clause.
3060 if not Present (Comp_Size_C) then
3061 Set_Component_Size (E, Csiz);
3064 -- Check for base type of 8, 16, 32 bits, where an
3065 -- unsigned subtype has a length one less than the
3066 -- base type (e.g. Natural subtype of Integer).
3068 -- In such cases, if a component size was not set
3069 -- explicitly, then generate a warning.
3071 if Has_Pragma_Pack (E)
3072 and then not Present (Comp_Size_C)
3074 (Csiz = 7 or else Csiz = 15 or else Csiz = 31)
3075 and then Esize (Base_Type (Ctyp)) = Csiz + 1
3077 Error_Msg_Uint_1 := Csiz;
3079 if Present (Pack_Pragma) then
3081 ("?pragma Pack causes component size "
3082 & "to be ^!", Pack_Pragma);
3084 ("\?use Component_Size to set "
3085 & "desired value!", Pack_Pragma);
3089 -- Actual packing is not needed for 8, 16, 32, 64.
3090 -- Also not needed for 24 if alignment is 1.
3096 or else (Csiz = 24 and then Alignment (Ctyp) = 1)
3098 -- Here the array was requested to be packed,
3099 -- but the packing request had no effect, so
3100 -- Is_Packed is reset.
3102 -- Note: semantically this means that we lose
3103 -- track of the fact that a derived type
3104 -- inherited a pragma Pack that was non-
3105 -- effective, but that seems fine.
3107 -- We regard a Pack pragma as a request to set
3108 -- a representation characteristic, and this
3109 -- request may be ignored.
3111 Set_Is_Packed (Base_Type (E), False);
3113 -- In all other cases, packing is indeed needed
3116 Set_Has_Non_Standard_Rep (Base_Type (E));
3117 Set_Is_Bit_Packed_Array (Base_Type (E));
3118 Set_Is_Packed (Base_Type (E));
3124 -- Processing that is done only for subtypes
3127 -- Acquire alignment from base type
3129 if Unknown_Alignment (E) then
3130 Set_Alignment (E, Alignment (Base_Type (E)));
3131 Adjust_Esize_Alignment (E);
3135 -- For bit-packed arrays, check the size
3137 if Is_Bit_Packed_Array (E)
3138 and then Known_RM_Size (E)
3141 SizC : constant Node_Id := Size_Clause (E);
3144 pragma Warnings (Off, Discard);
3147 -- It is not clear if it is possible to have no size
3148 -- clause at this stage, but it is not worth worrying
3149 -- about. Post error on the entity name in the size
3150 -- clause if present, else on the type entity itself.
3152 if Present (SizC) then
3153 Check_Size (Name (SizC), E, RM_Size (E), Discard);
3155 Check_Size (E, E, RM_Size (E), Discard);
3160 -- If any of the index types was an enumeration type with
3161 -- a non-standard rep clause, then we indicate that the
3162 -- array type is always packed (even if it is not bit packed).
3164 if Non_Standard_Enum then
3165 Set_Has_Non_Standard_Rep (Base_Type (E));
3166 Set_Is_Packed (Base_Type (E));
3169 Set_Component_Alignment_If_Not_Set (E);
3171 -- If the array is packed, we must create the packed array
3172 -- type to be used to actually implement the type. This is
3173 -- only needed for real array types (not for string literal
3174 -- types, since they are present only for the front end).
3177 and then Ekind (E) /= E_String_Literal_Subtype
3179 Create_Packed_Array_Type (E);
3180 Freeze_And_Append (Packed_Array_Type (E), Loc, Result);
3182 -- Size information of packed array type is copied to the
3183 -- array type, since this is really the representation. But
3184 -- do not override explicit existing size values. If the
3185 -- ancestor subtype is constrained the packed_array_type
3186 -- will be inherited from it, but the size may have been
3187 -- provided already, and must not be overridden either.
3189 if not Has_Size_Clause (E)
3191 (No (Ancestor_Subtype (E))
3192 or else not Has_Size_Clause (Ancestor_Subtype (E)))
3194 Set_Esize (E, Esize (Packed_Array_Type (E)));
3195 Set_RM_Size (E, RM_Size (Packed_Array_Type (E)));
3198 if not Has_Alignment_Clause (E) then
3199 Set_Alignment (E, Alignment (Packed_Array_Type (E)));
3203 -- For non-packed arrays set the alignment of the array to the
3204 -- alignment of the component type if it is unknown. Skip this
3205 -- in atomic case (atomic arrays may need larger alignments).
3207 if not Is_Packed (E)
3208 and then Unknown_Alignment (E)
3209 and then Known_Alignment (Ctyp)
3210 and then Known_Static_Component_Size (E)
3211 and then Known_Static_Esize (Ctyp)
3212 and then Esize (Ctyp) = Component_Size (E)
3213 and then not Is_Atomic (E)
3215 Set_Alignment (E, Alignment (Component_Type (E)));
3219 -- For a class-wide type, the corresponding specific type is
3220 -- frozen as well (RM 13.14(15))
3222 elsif Is_Class_Wide_Type (E) then
3223 Freeze_And_Append (Root_Type (E), Loc, Result);
3225 -- If the base type of the class-wide type is still incomplete,
3226 -- the class-wide remains unfrozen as well. This is legal when
3227 -- E is the formal of a primitive operation of some other type
3228 -- which is being frozen.
3230 if not Is_Frozen (Root_Type (E)) then
3231 Set_Is_Frozen (E, False);
3235 -- If the Class_Wide_Type is an Itype (when type is the anonymous
3236 -- parent of a derived type) and it is a library-level entity,
3237 -- generate an itype reference for it. Otherwise, its first
3238 -- explicit reference may be in an inner scope, which will be
3239 -- rejected by the back-end.
3242 and then Is_Compilation_Unit (Scope (E))
3245 Ref : constant Node_Id := Make_Itype_Reference (Loc);
3250 Result := New_List (Ref);
3252 Append (Ref, Result);
3257 -- The equivalent type associated with a class-wide subtype needs
3258 -- to be frozen to ensure that its layout is done. Class-wide
3259 -- subtypes are currently only frozen on targets requiring
3260 -- front-end layout (see New_Class_Wide_Subtype and
3261 -- Make_CW_Equivalent_Type in exp_util.adb).
3263 if Ekind (E) = E_Class_Wide_Subtype
3264 and then Present (Equivalent_Type (E))
3266 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3269 -- For a record (sub)type, freeze all the component types (RM
3270 -- 13.14(15). We test for E_Record_(sub)Type here, rather than using
3271 -- Is_Record_Type, because we don't want to attempt the freeze for
3272 -- the case of a private type with record extension (we will do that
3273 -- later when the full type is frozen).
3275 elsif Ekind (E) = E_Record_Type
3276 or else Ekind (E) = E_Record_Subtype
3278 Freeze_Record_Type (E);
3280 -- For a concurrent type, freeze corresponding record type. This
3281 -- does not correspond to any specific rule in the RM, but the
3282 -- record type is essentially part of the concurrent type.
3283 -- Freeze as well all local entities. This includes record types
3284 -- created for entry parameter blocks, and whatever local entities
3285 -- may appear in the private part.
3287 elsif Is_Concurrent_Type (E) then
3288 if Present (Corresponding_Record_Type (E)) then
3290 (Corresponding_Record_Type (E), Loc, Result);
3293 Comp := First_Entity (E);
3295 while Present (Comp) loop
3296 if Is_Type (Comp) then
3297 Freeze_And_Append (Comp, Loc, Result);
3299 elsif (Ekind (Comp)) /= E_Function then
3300 if Is_Itype (Etype (Comp))
3301 and then Underlying_Type (Scope (Etype (Comp))) = E
3303 Undelay_Type (Etype (Comp));
3306 Freeze_And_Append (Etype (Comp), Loc, Result);
3312 -- Private types are required to point to the same freeze node as
3313 -- their corresponding full views. The freeze node itself has to
3314 -- point to the partial view of the entity (because from the partial
3315 -- view, we can retrieve the full view, but not the reverse).
3316 -- However, in order to freeze correctly, we need to freeze the full
3317 -- view. If we are freezing at the end of a scope (or within the
3318 -- scope of the private type), the partial and full views will have
3319 -- been swapped, the full view appears first in the entity chain and
3320 -- the swapping mechanism ensures that the pointers are properly set
3323 -- If we encounter the partial view before the full view (e.g. when
3324 -- freezing from another scope), we freeze the full view, and then
3325 -- set the pointers appropriately since we cannot rely on swapping to
3326 -- fix things up (subtypes in an outer scope might not get swapped).
3328 elsif Is_Incomplete_Or_Private_Type (E)
3329 and then not Is_Generic_Type (E)
3331 -- The construction of the dispatch table associated with library
3332 -- level tagged types forces freezing of all the primitives of the
3333 -- type, which may cause premature freezing of the partial view.
3337 -- type T is tagged private;
3338 -- type DT is new T with private;
3339 -- procedure Prim (X : in out T; Y : in out DT'class);
3341 -- type T is tagged null record;
3343 -- type DT is new T with null record;
3346 -- In this case the type will be frozen later by the usual
3347 -- mechanism: an object declaration, an instantiation, or the
3348 -- end of a declarative part.
3350 if Is_Library_Level_Tagged_Type (E)
3351 and then not Present (Full_View (E))
3353 Set_Is_Frozen (E, False);
3356 -- Case of full view present
3358 elsif Present (Full_View (E)) then
3360 -- If full view has already been frozen, then no further
3361 -- processing is required
3363 if Is_Frozen (Full_View (E)) then
3365 Set_Has_Delayed_Freeze (E, False);
3366 Set_Freeze_Node (E, Empty);
3367 Check_Debug_Info_Needed (E);
3369 -- Otherwise freeze full view and patch the pointers so that
3370 -- the freeze node will elaborate both views in the back-end.
3374 Full : constant Entity_Id := Full_View (E);
3377 if Is_Private_Type (Full)
3378 and then Present (Underlying_Full_View (Full))
3381 (Underlying_Full_View (Full), Loc, Result);
3384 Freeze_And_Append (Full, Loc, Result);
3386 if Has_Delayed_Freeze (E) then
3387 F_Node := Freeze_Node (Full);
3389 if Present (F_Node) then
3390 Set_Freeze_Node (E, F_Node);
3391 Set_Entity (F_Node, E);
3394 -- {Incomplete,Private}_Subtypes with Full_Views
3395 -- constrained by discriminants.
3397 Set_Has_Delayed_Freeze (E, False);
3398 Set_Freeze_Node (E, Empty);
3403 Check_Debug_Info_Needed (E);
3406 -- AI-117 requires that the convention of a partial view be the
3407 -- same as the convention of the full view. Note that this is a
3408 -- recognized breach of privacy, but it's essential for logical
3409 -- consistency of representation, and the lack of a rule in
3410 -- RM95 was an oversight.
3412 Set_Convention (E, Convention (Full_View (E)));
3414 Set_Size_Known_At_Compile_Time (E,
3415 Size_Known_At_Compile_Time (Full_View (E)));
3417 -- Size information is copied from the full view to the
3418 -- incomplete or private view for consistency.
3420 -- We skip this is the full view is not a type. This is very
3421 -- strange of course, and can only happen as a result of
3422 -- certain illegalities, such as a premature attempt to derive
3423 -- from an incomplete type.
3425 if Is_Type (Full_View (E)) then
3426 Set_Size_Info (E, Full_View (E));
3427 Set_RM_Size (E, RM_Size (Full_View (E)));
3432 -- Case of no full view present. If entity is derived or subtype,
3433 -- it is safe to freeze, correctness depends on the frozen status
3434 -- of parent. Otherwise it is either premature usage, or a Taft
3435 -- amendment type, so diagnosis is at the point of use and the
3436 -- type might be frozen later.
3438 elsif E /= Base_Type (E)
3439 or else Is_Derived_Type (E)
3444 Set_Is_Frozen (E, False);
3448 -- For access subprogram, freeze types of all formals, the return
3449 -- type was already frozen, since it is the Etype of the function.
3451 elsif Ekind (E) = E_Subprogram_Type then
3452 Formal := First_Formal (E);
3453 while Present (Formal) loop
3454 Freeze_And_Append (Etype (Formal), Loc, Result);
3455 Next_Formal (Formal);
3458 Freeze_Subprogram (E);
3460 -- Ada 2005 (AI-326): Check wrong use of tag incomplete type
3462 -- type T is tagged;
3463 -- type Acc is access function (X : T) return T; -- ERROR
3465 if Ekind (Etype (E)) = E_Incomplete_Type
3466 and then Is_Tagged_Type (Etype (E))
3467 and then No (Full_View (Etype (E)))
3468 and then not Is_Value_Type (Etype (E))
3471 ("(Ada 2005): invalid use of tagged incomplete type", E);
3474 -- For access to a protected subprogram, freeze the equivalent type
3475 -- (however this is not set if we are not generating code or if this
3476 -- is an anonymous type used just for resolution).
3478 elsif Is_Access_Protected_Subprogram_Type (E) then
3480 -- AI-326: Check wrong use of tagged incomplete types
3482 -- type T is tagged;
3483 -- type As3D is access protected
3484 -- function (X : Float) return T; -- ERROR
3490 Etyp := Etype (Directly_Designated_Type (E));
3492 if Is_Class_Wide_Type (Etyp) then
3493 Etyp := Etype (Etyp);
3496 if Ekind (Etyp) = E_Incomplete_Type
3497 and then Is_Tagged_Type (Etyp)
3498 and then No (Full_View (Etyp))
3499 and then not Is_Value_Type (Etype (E))
3502 ("(Ada 2005): invalid use of tagged incomplete type", E);
3506 if Present (Equivalent_Type (E)) then
3507 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3511 -- Generic types are never seen by the back-end, and are also not
3512 -- processed by the expander (since the expander is turned off for
3513 -- generic processing), so we never need freeze nodes for them.
3515 if Is_Generic_Type (E) then
3519 -- Some special processing for non-generic types to complete
3520 -- representation details not known till the freeze point.
3522 if Is_Fixed_Point_Type (E) then
3523 Freeze_Fixed_Point_Type (E);
3525 -- Some error checks required for ordinary fixed-point type. Defer
3526 -- these till the freeze-point since we need the small and range
3527 -- values. We only do these checks for base types
3529 if Is_Ordinary_Fixed_Point_Type (E)
3530 and then E = Base_Type (E)
3532 if Small_Value (E) < Ureal_2_M_80 then
3533 Error_Msg_Name_1 := Name_Small;
3535 ("`&''%` too small, minimum allowed is 2.0'*'*(-80)", E);
3537 elsif Small_Value (E) > Ureal_2_80 then
3538 Error_Msg_Name_1 := Name_Small;
3540 ("`&''%` too large, maximum allowed is 2.0'*'*80", E);
3543 if Expr_Value_R (Type_Low_Bound (E)) < Ureal_M_10_36 then
3544 Error_Msg_Name_1 := Name_First;
3546 ("`&''%` too small, minimum allowed is -10.0'*'*36", E);
3549 if Expr_Value_R (Type_High_Bound (E)) > Ureal_10_36 then
3550 Error_Msg_Name_1 := Name_Last;
3552 ("`&''%` too large, maximum allowed is 10.0'*'*36", E);
3556 elsif Is_Enumeration_Type (E) then
3557 Freeze_Enumeration_Type (E);
3559 elsif Is_Integer_Type (E) then
3560 Adjust_Esize_For_Alignment (E);
3562 elsif Is_Access_Type (E) then
3564 -- Check restriction for standard storage pool
3566 if No (Associated_Storage_Pool (E)) then
3567 Check_Restriction (No_Standard_Storage_Pools, E);
3570 -- Deal with error message for pure access type. This is not an
3571 -- error in Ada 2005 if there is no pool (see AI-366).
3573 if Is_Pure_Unit_Access_Type (E)
3574 and then (Ada_Version < Ada_05
3575 or else not No_Pool_Assigned (E))
3577 Error_Msg_N ("named access type not allowed in pure unit", E);
3579 if Ada_Version >= Ada_05 then
3581 ("\would be legal if Storage_Size of 0 given?", E);
3583 elsif No_Pool_Assigned (E) then
3585 ("\would be legal in Ada 2005?", E);
3589 ("\would be legal in Ada 2005 if "
3590 & "Storage_Size of 0 given?", E);
3595 -- Case of composite types
3597 if Is_Composite_Type (E) then
3599 -- AI-117 requires that all new primitives of a tagged type must
3600 -- inherit the convention of the full view of the type. Inherited
3601 -- and overriding operations are defined to inherit the convention
3602 -- of their parent or overridden subprogram (also specified in
3603 -- AI-117), which will have occurred earlier (in Derive_Subprogram
3604 -- and New_Overloaded_Entity). Here we set the convention of
3605 -- primitives that are still convention Ada, which will ensure
3606 -- that any new primitives inherit the type's convention. Class-
3607 -- wide types can have a foreign convention inherited from their
3608 -- specific type, but are excluded from this since they don't have
3609 -- any associated primitives.
3611 if Is_Tagged_Type (E)
3612 and then not Is_Class_Wide_Type (E)
3613 and then Convention (E) /= Convention_Ada
3616 Prim_List : constant Elist_Id := Primitive_Operations (E);
3619 Prim := First_Elmt (Prim_List);
3620 while Present (Prim) loop
3621 if Convention (Node (Prim)) = Convention_Ada then
3622 Set_Convention (Node (Prim), Convention (E));
3631 -- Generate primitive operation references for a tagged type
3633 if Is_Tagged_Type (E)
3634 and then not Is_Class_Wide_Type (E)
3637 Prim_List : Elist_Id;
3645 if Ekind (E) = E_Protected_Subtype
3646 or else Ekind (E) = E_Task_Subtype
3653 -- Ada 2005 (AI-345): In case of concurrent type generate
3654 -- reference to the wrapper that allow us to dispatch calls
3655 -- through their implemented abstract interface types.
3657 -- The check for Present here is to protect against previously
3658 -- reported critical errors.
3660 if Is_Concurrent_Type (Aux_E)
3661 and then Present (Corresponding_Record_Type (Aux_E))
3663 Prim_List := Primitive_Operations
3664 (Corresponding_Record_Type (Aux_E));
3666 Prim_List := Primitive_Operations (Aux_E);
3669 -- Loop to generate references for primitive operations
3671 if Present (Prim_List) then
3672 Prim := First_Elmt (Prim_List);
3673 while Present (Prim) loop
3675 -- If the operation is derived, get the original for
3676 -- cross-reference purposes (it is the original for
3677 -- which we want the xref, and for which the comes
3678 -- from source test needs to be performed).
3681 while Present (Alias (Ent)) loop
3685 Generate_Reference (E, Ent, 'p', Set_Ref => False);
3692 -- Now that all types from which E may depend are frozen, see if the
3693 -- size is known at compile time, if it must be unsigned, or if
3694 -- strict alignment is required
3696 Check_Compile_Time_Size (E);
3697 Check_Unsigned_Type (E);
3699 if Base_Type (E) = E then
3700 Check_Strict_Alignment (E);
3703 -- Do not allow a size clause for a type which does not have a size
3704 -- that is known at compile time
3706 if Has_Size_Clause (E)
3707 and then not Size_Known_At_Compile_Time (E)
3709 -- Suppress this message if errors posted on E, even if we are
3710 -- in all errors mode, since this is often a junk message
3712 if not Error_Posted (E) then
3714 ("size clause not allowed for variable length type",
3719 -- Remaining process is to set/verify the representation information,
3720 -- in particular the size and alignment values. This processing is
3721 -- not required for generic types, since generic types do not play
3722 -- any part in code generation, and so the size and alignment values
3723 -- for such types are irrelevant.
3725 if Is_Generic_Type (E) then
3728 -- Otherwise we call the layout procedure
3734 -- End of freeze processing for type entities
3737 -- Here is where we logically freeze the current entity. If it has a
3738 -- freeze node, then this is the point at which the freeze node is
3739 -- linked into the result list.
3741 if Has_Delayed_Freeze (E) then
3743 -- If a freeze node is already allocated, use it, otherwise allocate
3744 -- a new one. The preallocation happens in the case of anonymous base
3745 -- types, where we preallocate so that we can set First_Subtype_Link.
3746 -- Note that we reset the Sloc to the current freeze location.
3748 if Present (Freeze_Node (E)) then
3749 F_Node := Freeze_Node (E);
3750 Set_Sloc (F_Node, Loc);
3753 F_Node := New_Node (N_Freeze_Entity, Loc);
3754 Set_Freeze_Node (E, F_Node);
3755 Set_Access_Types_To_Process (F_Node, No_Elist);
3756 Set_TSS_Elist (F_Node, No_Elist);
3757 Set_Actions (F_Node, No_List);
3760 Set_Entity (F_Node, E);
3762 if Result = No_List then
3763 Result := New_List (F_Node);
3765 Append (F_Node, Result);
3768 -- A final pass over record types with discriminants. If the type
3769 -- has an incomplete declaration, there may be constrained access
3770 -- subtypes declared elsewhere, which do not depend on the discrimi-
3771 -- nants of the type, and which are used as component types (i.e.
3772 -- the full view is a recursive type). The designated types of these
3773 -- subtypes can only be elaborated after the type itself, and they
3774 -- need an itype reference.
3776 if Ekind (E) = E_Record_Type
3777 and then Has_Discriminants (E)
3785 Comp := First_Component (E);
3787 while Present (Comp) loop
3788 Typ := Etype (Comp);
3790 if Ekind (Comp) = E_Component
3791 and then Is_Access_Type (Typ)
3792 and then Scope (Typ) /= E
3793 and then Base_Type (Designated_Type (Typ)) = E
3794 and then Is_Itype (Designated_Type (Typ))
3796 IR := Make_Itype_Reference (Sloc (Comp));
3797 Set_Itype (IR, Designated_Type (Typ));
3798 Append (IR, Result);
3801 Next_Component (Comp);
3807 -- When a type is frozen, the first subtype of the type is frozen as
3808 -- well (RM 13.14(15)). This has to be done after freezing the type,
3809 -- since obviously the first subtype depends on its own base type.
3812 Freeze_And_Append (First_Subtype (E), Loc, Result);
3814 -- If we just froze a tagged non-class wide record, then freeze the
3815 -- corresponding class-wide type. This must be done after the tagged
3816 -- type itself is frozen, because the class-wide type refers to the
3817 -- tagged type which generates the class.
3819 if Is_Tagged_Type (E)
3820 and then not Is_Class_Wide_Type (E)
3821 and then Present (Class_Wide_Type (E))
3823 Freeze_And_Append (Class_Wide_Type (E), Loc, Result);
3827 Check_Debug_Info_Needed (E);
3829 -- Special handling for subprograms
3831 if Is_Subprogram (E) then
3833 -- If subprogram has address clause then reset Is_Public flag, since
3834 -- we do not want the backend to generate external references.
3836 if Present (Address_Clause (E))
3837 and then not Is_Library_Level_Entity (E)
3839 Set_Is_Public (E, False);
3841 -- If no address clause and not intrinsic, then for imported
3842 -- subprogram in main unit, generate descriptor if we are in
3843 -- Propagate_Exceptions mode.
3845 elsif Propagate_Exceptions
3846 and then Is_Imported (E)
3847 and then not Is_Intrinsic_Subprogram (E)
3848 and then Convention (E) /= Convention_Stubbed
3850 if Result = No_List then
3851 Result := Empty_List;
3859 -----------------------------
3860 -- Freeze_Enumeration_Type --
3861 -----------------------------
3863 procedure Freeze_Enumeration_Type (Typ : Entity_Id) is
3865 -- By default, if no size clause is present, an enumeration type with
3866 -- Convention C is assumed to interface to a C enum, and has integer
3867 -- size. This applies to types. For subtypes, verify that its base
3868 -- type has no size clause either.
3870 if Has_Foreign_Convention (Typ)
3871 and then not Has_Size_Clause (Typ)
3872 and then not Has_Size_Clause (Base_Type (Typ))
3873 and then Esize (Typ) < Standard_Integer_Size
3875 Init_Esize (Typ, Standard_Integer_Size);
3878 -- If the enumeration type interfaces to C, and it has a size clause
3879 -- that specifies less than int size, it warrants a warning. The
3880 -- user may intend the C type to be an enum or a char, so this is
3881 -- not by itself an error that the Ada compiler can detect, but it
3882 -- it is a worth a heads-up. For Boolean and Character types we
3883 -- assume that the programmer has the proper C type in mind.
3885 if Convention (Typ) = Convention_C
3886 and then Has_Size_Clause (Typ)
3887 and then Esize (Typ) /= Esize (Standard_Integer)
3888 and then not Is_Boolean_Type (Typ)
3889 and then not Is_Character_Type (Typ)
3892 ("C enum types have the size of a C int?", Size_Clause (Typ));
3895 Adjust_Esize_For_Alignment (Typ);
3897 end Freeze_Enumeration_Type;
3899 -----------------------
3900 -- Freeze_Expression --
3901 -----------------------
3903 procedure Freeze_Expression (N : Node_Id) is
3904 In_Spec_Exp : constant Boolean := In_Spec_Expression;
3907 Desig_Typ : Entity_Id;
3911 Freeze_Outside : Boolean := False;
3912 -- This flag is set true if the entity must be frozen outside the
3913 -- current subprogram. This happens in the case of expander generated
3914 -- subprograms (_Init_Proc, _Input, _Output, _Read, _Write) which do
3915 -- not freeze all entities like other bodies, but which nevertheless
3916 -- may reference entities that have to be frozen before the body and
3917 -- obviously cannot be frozen inside the body.
3919 function In_Exp_Body (N : Node_Id) return Boolean;
3920 -- Given an N_Handled_Sequence_Of_Statements node N, determines whether
3921 -- it is the handled statement sequence of an expander-generated
3922 -- subprogram (init proc, stream subprogram, or renaming as body).
3923 -- If so, this is not a freezing context.
3929 function In_Exp_Body (N : Node_Id) return Boolean is
3934 if Nkind (N) = N_Subprogram_Body then
3940 if Nkind (P) /= N_Subprogram_Body then
3944 Id := Defining_Unit_Name (Specification (P));
3946 if Nkind (Id) = N_Defining_Identifier
3947 and then (Is_Init_Proc (Id) or else
3948 Is_TSS (Id, TSS_Stream_Input) or else
3949 Is_TSS (Id, TSS_Stream_Output) or else
3950 Is_TSS (Id, TSS_Stream_Read) or else
3951 Is_TSS (Id, TSS_Stream_Write) or else
3952 Nkind (Original_Node (P)) =
3953 N_Subprogram_Renaming_Declaration)
3962 -- Start of processing for Freeze_Expression
3965 -- Immediate return if freezing is inhibited. This flag is set by the
3966 -- analyzer to stop freezing on generated expressions that would cause
3967 -- freezing if they were in the source program, but which are not
3968 -- supposed to freeze, since they are created.
3970 if Must_Not_Freeze (N) then
3974 -- If expression is non-static, then it does not freeze in a default
3975 -- expression, see section "Handling of Default Expressions" in the
3976 -- spec of package Sem for further details. Note that we have to
3977 -- make sure that we actually have a real expression (if we have
3978 -- a subtype indication, we can't test Is_Static_Expression!)
3981 and then Nkind (N) in N_Subexpr
3982 and then not Is_Static_Expression (N)
3987 -- Freeze type of expression if not frozen already
3991 if Nkind (N) in N_Has_Etype then
3992 if not Is_Frozen (Etype (N)) then
3995 -- Base type may be an derived numeric type that is frozen at
3996 -- the point of declaration, but first_subtype is still unfrozen.
3998 elsif not Is_Frozen (First_Subtype (Etype (N))) then
3999 Typ := First_Subtype (Etype (N));
4003 -- For entity name, freeze entity if not frozen already. A special
4004 -- exception occurs for an identifier that did not come from source.
4005 -- We don't let such identifiers freeze a non-internal entity, i.e.
4006 -- an entity that did come from source, since such an identifier was
4007 -- generated by the expander, and cannot have any semantic effect on
4008 -- the freezing semantics. For example, this stops the parameter of
4009 -- an initialization procedure from freezing the variable.
4011 if Is_Entity_Name (N)
4012 and then not Is_Frozen (Entity (N))
4013 and then (Nkind (N) /= N_Identifier
4014 or else Comes_From_Source (N)
4015 or else not Comes_From_Source (Entity (N)))
4022 -- For an allocator freeze designated type if not frozen already
4024 -- For an aggregate whose component type is an access type, freeze the
4025 -- designated type now, so that its freeze does not appear within the
4026 -- loop that might be created in the expansion of the aggregate. If the
4027 -- designated type is a private type without full view, the expression
4028 -- cannot contain an allocator, so the type is not frozen.
4034 Desig_Typ := Designated_Type (Etype (N));
4037 if Is_Array_Type (Etype (N))
4038 and then Is_Access_Type (Component_Type (Etype (N)))
4040 Desig_Typ := Designated_Type (Component_Type (Etype (N)));
4043 when N_Selected_Component |
4044 N_Indexed_Component |
4047 if Is_Access_Type (Etype (Prefix (N))) then
4048 Desig_Typ := Designated_Type (Etype (Prefix (N)));
4055 if Desig_Typ /= Empty
4056 and then (Is_Frozen (Desig_Typ)
4057 or else (not Is_Fully_Defined (Desig_Typ)))
4062 -- All done if nothing needs freezing
4066 and then No (Desig_Typ)
4071 -- Loop for looking at the right place to insert the freeze nodes
4072 -- exiting from the loop when it is appropriate to insert the freeze
4073 -- node before the current node P.
4075 -- Also checks some special exceptions to the freezing rules. These
4076 -- cases result in a direct return, bypassing the freeze action.
4080 Parent_P := Parent (P);
4082 -- If we don't have a parent, then we are not in a well-formed tree.
4083 -- This is an unusual case, but there are some legitimate situations
4084 -- in which this occurs, notably when the expressions in the range of
4085 -- a type declaration are resolved. We simply ignore the freeze
4086 -- request in this case. Is this right ???
4088 if No (Parent_P) then
4092 -- See if we have got to an appropriate point in the tree
4094 case Nkind (Parent_P) is
4096 -- A special test for the exception of (RM 13.14(8)) for the case
4097 -- of per-object expressions (RM 3.8(18)) occurring in component
4098 -- definition or a discrete subtype definition. Note that we test
4099 -- for a component declaration which includes both cases we are
4100 -- interested in, and furthermore the tree does not have explicit
4101 -- nodes for either of these two constructs.
4103 when N_Component_Declaration =>
4105 -- The case we want to test for here is an identifier that is
4106 -- a per-object expression, this is either a discriminant that
4107 -- appears in a context other than the component declaration
4108 -- or it is a reference to the type of the enclosing construct.
4110 -- For either of these cases, we skip the freezing
4112 if not In_Spec_Expression
4113 and then Nkind (N) = N_Identifier
4114 and then (Present (Entity (N)))
4116 -- We recognize the discriminant case by just looking for
4117 -- a reference to a discriminant. It can only be one for
4118 -- the enclosing construct. Skip freezing in this case.
4120 if Ekind (Entity (N)) = E_Discriminant then
4123 -- For the case of a reference to the enclosing record,
4124 -- (or task or protected type), we look for a type that
4125 -- matches the current scope.
4127 elsif Entity (N) = Current_Scope then
4132 -- If we have an enumeration literal that appears as the choice in
4133 -- the aggregate of an enumeration representation clause, then
4134 -- freezing does not occur (RM 13.14(10)).
4136 when N_Enumeration_Representation_Clause =>
4138 -- The case we are looking for is an enumeration literal
4140 if (Nkind (N) = N_Identifier or Nkind (N) = N_Character_Literal)
4141 and then Is_Enumeration_Type (Etype (N))
4143 -- If enumeration literal appears directly as the choice,
4144 -- do not freeze (this is the normal non-overloaded case)
4146 if Nkind (Parent (N)) = N_Component_Association
4147 and then First (Choices (Parent (N))) = N
4151 -- If enumeration literal appears as the name of function
4152 -- which is the choice, then also do not freeze. This
4153 -- happens in the overloaded literal case, where the
4154 -- enumeration literal is temporarily changed to a function
4155 -- call for overloading analysis purposes.
4157 elsif Nkind (Parent (N)) = N_Function_Call
4159 Nkind (Parent (Parent (N))) = N_Component_Association
4161 First (Choices (Parent (Parent (N)))) = Parent (N)
4167 -- Normally if the parent is a handled sequence of statements,
4168 -- then the current node must be a statement, and that is an
4169 -- appropriate place to insert a freeze node.
4171 when N_Handled_Sequence_Of_Statements =>
4173 -- An exception occurs when the sequence of statements is for
4174 -- an expander generated body that did not do the usual freeze
4175 -- all operation. In this case we usually want to freeze
4176 -- outside this body, not inside it, and we skip past the
4177 -- subprogram body that we are inside.
4179 if In_Exp_Body (Parent_P) then
4181 -- However, we *do* want to freeze at this point if we have
4182 -- an entity to freeze, and that entity is declared *inside*
4183 -- the body of the expander generated procedure. This case
4184 -- is recognized by the scope of the type, which is either
4185 -- the spec for some enclosing body, or (in the case of
4186 -- init_procs, for which there are no separate specs) the
4190 Subp : constant Node_Id := Parent (Parent_P);
4194 if Nkind (Subp) = N_Subprogram_Body then
4195 Cspc := Corresponding_Spec (Subp);
4197 if (Present (Typ) and then Scope (Typ) = Cspc)
4199 (Present (Nam) and then Scope (Nam) = Cspc)
4204 and then Scope (Typ) = Current_Scope
4205 and then Current_Scope = Defining_Entity (Subp)
4212 -- If not that exception to the exception, then this is
4213 -- where we delay the freeze till outside the body.
4215 Parent_P := Parent (Parent_P);
4216 Freeze_Outside := True;
4218 -- Here if normal case where we are in handled statement
4219 -- sequence and want to do the insertion right there.
4225 -- If parent is a body or a spec or a block, then the current node
4226 -- is a statement or declaration and we can insert the freeze node
4229 when N_Package_Specification |
4235 N_Block_Statement => exit;
4237 -- The expander is allowed to define types in any statements list,
4238 -- so any of the following parent nodes also mark a freezing point
4239 -- if the actual node is in a list of statements or declarations.
4241 when N_Exception_Handler |
4244 N_Case_Statement_Alternative |
4245 N_Compilation_Unit_Aux |
4246 N_Selective_Accept |
4247 N_Accept_Alternative |
4248 N_Delay_Alternative |
4249 N_Conditional_Entry_Call |
4250 N_Entry_Call_Alternative |
4251 N_Triggering_Alternative |
4255 exit when Is_List_Member (P);
4257 -- Note: The N_Loop_Statement is a special case. A type that
4258 -- appears in the source can never be frozen in a loop (this
4259 -- occurs only because of a loop expanded by the expander), so we
4260 -- keep on going. Otherwise we terminate the search. Same is true
4261 -- of any entity which comes from source. (if they have predefined
4262 -- type, that type does not appear to come from source, but the
4263 -- entity should not be frozen here).
4265 when N_Loop_Statement =>
4266 exit when not Comes_From_Source (Etype (N))
4267 and then (No (Nam) or else not Comes_From_Source (Nam));
4269 -- For all other cases, keep looking at parents
4275 -- We fall through the case if we did not yet find the proper
4276 -- place in the free for inserting the freeze node, so climb!
4281 -- If the expression appears in a record or an initialization procedure,
4282 -- the freeze nodes are collected and attached to the current scope, to
4283 -- be inserted and analyzed on exit from the scope, to insure that
4284 -- generated entities appear in the correct scope. If the expression is
4285 -- a default for a discriminant specification, the scope is still void.
4286 -- The expression can also appear in the discriminant part of a private
4287 -- or concurrent type.
4289 -- If the expression appears in a constrained subcomponent of an
4290 -- enclosing record declaration, the freeze nodes must be attached to
4291 -- the outer record type so they can eventually be placed in the
4292 -- enclosing declaration list.
4294 -- The other case requiring this special handling is if we are in a
4295 -- default expression, since in that case we are about to freeze a
4296 -- static type, and the freeze scope needs to be the outer scope, not
4297 -- the scope of the subprogram with the default parameter.
4299 -- For default expressions and other spec expressions in generic units,
4300 -- the Move_Freeze_Nodes mechanism (see sem_ch12.adb) takes care of
4301 -- placing them at the proper place, after the generic unit.
4303 if (In_Spec_Exp and not Inside_A_Generic)
4304 or else Freeze_Outside
4305 or else (Is_Type (Current_Scope)
4306 and then (not Is_Concurrent_Type (Current_Scope)
4307 or else not Has_Completion (Current_Scope)))
4308 or else Ekind (Current_Scope) = E_Void
4311 Loc : constant Source_Ptr := Sloc (Current_Scope);
4312 Freeze_Nodes : List_Id := No_List;
4313 Pos : Int := Scope_Stack.Last;
4316 if Present (Desig_Typ) then
4317 Freeze_And_Append (Desig_Typ, Loc, Freeze_Nodes);
4320 if Present (Typ) then
4321 Freeze_And_Append (Typ, Loc, Freeze_Nodes);
4324 if Present (Nam) then
4325 Freeze_And_Append (Nam, Loc, Freeze_Nodes);
4328 -- The current scope may be that of a constrained component of
4329 -- an enclosing record declaration, which is above the current
4330 -- scope in the scope stack.
4332 if Is_Record_Type (Scope (Current_Scope)) then
4336 if Is_Non_Empty_List (Freeze_Nodes) then
4337 if No (Scope_Stack.Table (Pos).Pending_Freeze_Actions) then
4338 Scope_Stack.Table (Pos).Pending_Freeze_Actions :=
4341 Append_List (Freeze_Nodes, Scope_Stack.Table
4342 (Pos).Pending_Freeze_Actions);
4350 -- Now we have the right place to do the freezing. First, a special
4351 -- adjustment, if we are in spec-expression analysis mode, these freeze
4352 -- actions must not be thrown away (normally all inserted actions are
4353 -- thrown away in this mode. However, the freeze actions are from static
4354 -- expressions and one of the important reasons we are doing this
4355 -- special analysis is to get these freeze actions. Therefore we turn
4356 -- off the In_Spec_Expression mode to propagate these freeze actions.
4357 -- This also means they get properly analyzed and expanded.
4359 In_Spec_Expression := False;
4361 -- Freeze the designated type of an allocator (RM 13.14(13))
4363 if Present (Desig_Typ) then
4364 Freeze_Before (P, Desig_Typ);
4367 -- Freeze type of expression (RM 13.14(10)). Note that we took care of
4368 -- the enumeration representation clause exception in the loop above.
4370 if Present (Typ) then
4371 Freeze_Before (P, Typ);
4374 -- Freeze name if one is present (RM 13.14(11))
4376 if Present (Nam) then
4377 Freeze_Before (P, Nam);
4380 -- Restore In_Spec_Expression flag
4382 In_Spec_Expression := In_Spec_Exp;
4383 end Freeze_Expression;
4385 -----------------------------
4386 -- Freeze_Fixed_Point_Type --
4387 -----------------------------
4389 -- Certain fixed-point types and subtypes, including implicit base types
4390 -- and declared first subtypes, have not yet set up a range. This is
4391 -- because the range cannot be set until the Small and Size values are
4392 -- known, and these are not known till the type is frozen.
4394 -- To signal this case, Scalar_Range contains an unanalyzed syntactic range
4395 -- whose bounds are unanalyzed real literals. This routine will recognize
4396 -- this case, and transform this range node into a properly typed range
4397 -- with properly analyzed and resolved values.
4399 procedure Freeze_Fixed_Point_Type (Typ : Entity_Id) is
4400 Rng : constant Node_Id := Scalar_Range (Typ);
4401 Lo : constant Node_Id := Low_Bound (Rng);
4402 Hi : constant Node_Id := High_Bound (Rng);
4403 Btyp : constant Entity_Id := Base_Type (Typ);
4404 Brng : constant Node_Id := Scalar_Range (Btyp);
4405 BLo : constant Node_Id := Low_Bound (Brng);
4406 BHi : constant Node_Id := High_Bound (Brng);
4407 Small : constant Ureal := Small_Value (Typ);
4414 function Fsize (Lov, Hiv : Ureal) return Nat;
4415 -- Returns size of type with given bounds. Also leaves these
4416 -- bounds set as the current bounds of the Typ.
4422 function Fsize (Lov, Hiv : Ureal) return Nat is
4424 Set_Realval (Lo, Lov);
4425 Set_Realval (Hi, Hiv);
4426 return Minimum_Size (Typ);
4429 -- Start of processing for Freeze_Fixed_Point_Type
4432 -- If Esize of a subtype has not previously been set, set it now
4434 if Unknown_Esize (Typ) then
4435 Atype := Ancestor_Subtype (Typ);
4437 if Present (Atype) then
4438 Set_Esize (Typ, Esize (Atype));
4440 Set_Esize (Typ, Esize (Base_Type (Typ)));
4444 -- Immediate return if the range is already analyzed. This means that
4445 -- the range is already set, and does not need to be computed by this
4448 if Analyzed (Rng) then
4452 -- Immediate return if either of the bounds raises Constraint_Error
4454 if Raises_Constraint_Error (Lo)
4455 or else Raises_Constraint_Error (Hi)
4460 Loval := Realval (Lo);
4461 Hival := Realval (Hi);
4463 -- Ordinary fixed-point case
4465 if Is_Ordinary_Fixed_Point_Type (Typ) then
4467 -- For the ordinary fixed-point case, we are allowed to fudge the
4468 -- end-points up or down by small. Generally we prefer to fudge up,
4469 -- i.e. widen the bounds for non-model numbers so that the end points
4470 -- are included. However there are cases in which this cannot be
4471 -- done, and indeed cases in which we may need to narrow the bounds.
4472 -- The following circuit makes the decision.
4474 -- Note: our terminology here is that Incl_EP means that the bounds
4475 -- are widened by Small if necessary to include the end points, and
4476 -- Excl_EP means that the bounds are narrowed by Small to exclude the
4477 -- end-points if this reduces the size.
4479 -- Note that in the Incl case, all we care about is including the
4480 -- end-points. In the Excl case, we want to narrow the bounds as
4481 -- much as permitted by the RM, to give the smallest possible size.
4484 Loval_Incl_EP : Ureal;
4485 Hival_Incl_EP : Ureal;
4487 Loval_Excl_EP : Ureal;
4488 Hival_Excl_EP : Ureal;
4494 First_Subt : Entity_Id;
4499 -- First step. Base types are required to be symmetrical. Right
4500 -- now, the base type range is a copy of the first subtype range.
4501 -- This will be corrected before we are done, but right away we
4502 -- need to deal with the case where both bounds are non-negative.
4503 -- In this case, we set the low bound to the negative of the high
4504 -- bound, to make sure that the size is computed to include the
4505 -- required sign. Note that we do not need to worry about the
4506 -- case of both bounds negative, because the sign will be dealt
4507 -- with anyway. Furthermore we can't just go making such a bound
4508 -- symmetrical, since in a twos-complement system, there is an
4509 -- extra negative value which could not be accommodated on the
4513 and then not UR_Is_Negative (Loval)
4514 and then Hival > Loval
4517 Set_Realval (Lo, Loval);
4520 -- Compute the fudged bounds. If the number is a model number,
4521 -- then we do nothing to include it, but we are allowed to backoff
4522 -- to the next adjacent model number when we exclude it. If it is
4523 -- not a model number then we straddle the two values with the
4524 -- model numbers on either side.
4526 Model_Num := UR_Trunc (Loval / Small) * Small;
4528 if Loval = Model_Num then
4529 Loval_Incl_EP := Model_Num;
4531 Loval_Incl_EP := Model_Num - Small;
4534 -- The low value excluding the end point is Small greater, but
4535 -- we do not do this exclusion if the low value is positive,
4536 -- since it can't help the size and could actually hurt by
4537 -- crossing the high bound.
4539 if UR_Is_Negative (Loval_Incl_EP) then
4540 Loval_Excl_EP := Loval_Incl_EP + Small;
4542 -- If the value went from negative to zero, then we have the
4543 -- case where Loval_Incl_EP is the model number just below
4544 -- zero, so we want to stick to the negative value for the
4545 -- base type to maintain the condition that the size will
4546 -- include signed values.
4549 and then UR_Is_Zero (Loval_Excl_EP)
4551 Loval_Excl_EP := Loval_Incl_EP;
4555 Loval_Excl_EP := Loval_Incl_EP;
4558 -- Similar processing for upper bound and high value
4560 Model_Num := UR_Trunc (Hival / Small) * Small;
4562 if Hival = Model_Num then
4563 Hival_Incl_EP := Model_Num;
4565 Hival_Incl_EP := Model_Num + Small;
4568 if UR_Is_Positive (Hival_Incl_EP) then
4569 Hival_Excl_EP := Hival_Incl_EP - Small;
4571 Hival_Excl_EP := Hival_Incl_EP;
4574 -- One further adjustment is needed. In the case of subtypes, we
4575 -- cannot go outside the range of the base type, or we get
4576 -- peculiarities, and the base type range is already set. This
4577 -- only applies to the Incl values, since clearly the Excl values
4578 -- are already as restricted as they are allowed to be.
4581 Loval_Incl_EP := UR_Max (Loval_Incl_EP, Realval (BLo));
4582 Hival_Incl_EP := UR_Min (Hival_Incl_EP, Realval (BHi));
4585 -- Get size including and excluding end points
4587 Size_Incl_EP := Fsize (Loval_Incl_EP, Hival_Incl_EP);
4588 Size_Excl_EP := Fsize (Loval_Excl_EP, Hival_Excl_EP);
4590 -- No need to exclude end-points if it does not reduce size
4592 if Fsize (Loval_Incl_EP, Hival_Excl_EP) = Size_Excl_EP then
4593 Loval_Excl_EP := Loval_Incl_EP;
4596 if Fsize (Loval_Excl_EP, Hival_Incl_EP) = Size_Excl_EP then
4597 Hival_Excl_EP := Hival_Incl_EP;
4600 -- Now we set the actual size to be used. We want to use the
4601 -- bounds fudged up to include the end-points but only if this
4602 -- can be done without violating a specifically given size
4603 -- size clause or causing an unacceptable increase in size.
4605 -- Case of size clause given
4607 if Has_Size_Clause (Typ) then
4609 -- Use the inclusive size only if it is consistent with
4610 -- the explicitly specified size.
4612 if Size_Incl_EP <= RM_Size (Typ) then
4613 Actual_Lo := Loval_Incl_EP;
4614 Actual_Hi := Hival_Incl_EP;
4615 Actual_Size := Size_Incl_EP;
4617 -- If the inclusive size is too large, we try excluding
4618 -- the end-points (will be caught later if does not work).
4621 Actual_Lo := Loval_Excl_EP;
4622 Actual_Hi := Hival_Excl_EP;
4623 Actual_Size := Size_Excl_EP;
4626 -- Case of size clause not given
4629 -- If we have a base type whose corresponding first subtype
4630 -- has an explicit size that is large enough to include our
4631 -- end-points, then do so. There is no point in working hard
4632 -- to get a base type whose size is smaller than the specified
4633 -- size of the first subtype.
4635 First_Subt := First_Subtype (Typ);
4637 if Has_Size_Clause (First_Subt)
4638 and then Size_Incl_EP <= Esize (First_Subt)
4640 Actual_Size := Size_Incl_EP;
4641 Actual_Lo := Loval_Incl_EP;
4642 Actual_Hi := Hival_Incl_EP;
4644 -- If excluding the end-points makes the size smaller and
4645 -- results in a size of 8,16,32,64, then we take the smaller
4646 -- size. For the 64 case, this is compulsory. For the other
4647 -- cases, it seems reasonable. We like to include end points
4648 -- if we can, but not at the expense of moving to the next
4649 -- natural boundary of size.
4651 elsif Size_Incl_EP /= Size_Excl_EP
4653 (Size_Excl_EP = 8 or else
4654 Size_Excl_EP = 16 or else
4655 Size_Excl_EP = 32 or else
4658 Actual_Size := Size_Excl_EP;
4659 Actual_Lo := Loval_Excl_EP;
4660 Actual_Hi := Hival_Excl_EP;
4662 -- Otherwise we can definitely include the end points
4665 Actual_Size := Size_Incl_EP;
4666 Actual_Lo := Loval_Incl_EP;
4667 Actual_Hi := Hival_Incl_EP;
4670 -- One pathological case: normally we never fudge a low bound
4671 -- down, since it would seem to increase the size (if it has
4672 -- any effect), but for ranges containing single value, or no
4673 -- values, the high bound can be small too large. Consider:
4675 -- type t is delta 2.0**(-14)
4676 -- range 131072.0 .. 0;
4678 -- That lower bound is *just* outside the range of 32 bits, and
4679 -- does need fudging down in this case. Note that the bounds
4680 -- will always have crossed here, since the high bound will be
4681 -- fudged down if necessary, as in the case of:
4683 -- type t is delta 2.0**(-14)
4684 -- range 131072.0 .. 131072.0;
4686 -- So we detect the situation by looking for crossed bounds,
4687 -- and if the bounds are crossed, and the low bound is greater
4688 -- than zero, we will always back it off by small, since this
4689 -- is completely harmless.
4691 if Actual_Lo > Actual_Hi then
4692 if UR_Is_Positive (Actual_Lo) then
4693 Actual_Lo := Loval_Incl_EP - Small;
4694 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4696 -- And of course, we need to do exactly the same parallel
4697 -- fudge for flat ranges in the negative region.
4699 elsif UR_Is_Negative (Actual_Hi) then
4700 Actual_Hi := Hival_Incl_EP + Small;
4701 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4706 Set_Realval (Lo, Actual_Lo);
4707 Set_Realval (Hi, Actual_Hi);
4710 -- For the decimal case, none of this fudging is required, since there
4711 -- are no end-point problems in the decimal case (the end-points are
4712 -- always included).
4715 Actual_Size := Fsize (Loval, Hival);
4718 -- At this stage, the actual size has been calculated and the proper
4719 -- required bounds are stored in the low and high bounds.
4721 if Actual_Size > 64 then
4722 Error_Msg_Uint_1 := UI_From_Int (Actual_Size);
4724 ("size required (^) for type& too large, maximum allowed is 64",
4729 -- Check size against explicit given size
4731 if Has_Size_Clause (Typ) then
4732 if Actual_Size > RM_Size (Typ) then
4733 Error_Msg_Uint_1 := RM_Size (Typ);
4734 Error_Msg_Uint_2 := UI_From_Int (Actual_Size);
4736 ("size given (^) for type& too small, minimum allowed is ^",
4737 Size_Clause (Typ), Typ);
4740 Actual_Size := UI_To_Int (Esize (Typ));
4743 -- Increase size to next natural boundary if no size clause given
4746 if Actual_Size <= 8 then
4748 elsif Actual_Size <= 16 then
4750 elsif Actual_Size <= 32 then
4756 Init_Esize (Typ, Actual_Size);
4757 Adjust_Esize_For_Alignment (Typ);
4760 -- If we have a base type, then expand the bounds so that they extend to
4761 -- the full width of the allocated size in bits, to avoid junk range
4762 -- checks on intermediate computations.
4764 if Base_Type (Typ) = Typ then
4765 Set_Realval (Lo, -(Small * (Uint_2 ** (Actual_Size - 1))));
4766 Set_Realval (Hi, (Small * (Uint_2 ** (Actual_Size - 1) - 1)));
4769 -- Final step is to reanalyze the bounds using the proper type
4770 -- and set the Corresponding_Integer_Value fields of the literals.
4772 Set_Etype (Lo, Empty);
4773 Set_Analyzed (Lo, False);
4776 -- Resolve with universal fixed if the base type, and the base type if
4777 -- it is a subtype. Note we can't resolve the base type with itself,
4778 -- that would be a reference before definition.
4781 Resolve (Lo, Universal_Fixed);
4786 -- Set corresponding integer value for bound
4788 Set_Corresponding_Integer_Value
4789 (Lo, UR_To_Uint (Realval (Lo) / Small));
4791 -- Similar processing for high bound
4793 Set_Etype (Hi, Empty);
4794 Set_Analyzed (Hi, False);
4798 Resolve (Hi, Universal_Fixed);
4803 Set_Corresponding_Integer_Value
4804 (Hi, UR_To_Uint (Realval (Hi) / Small));
4806 -- Set type of range to correspond to bounds
4808 Set_Etype (Rng, Etype (Lo));
4810 -- Set Esize to calculated size if not set already
4812 if Unknown_Esize (Typ) then
4813 Init_Esize (Typ, Actual_Size);
4816 -- Set RM_Size if not already set. If already set, check value
4819 Minsiz : constant Uint := UI_From_Int (Minimum_Size (Typ));
4822 if RM_Size (Typ) /= Uint_0 then
4823 if RM_Size (Typ) < Minsiz then
4824 Error_Msg_Uint_1 := RM_Size (Typ);
4825 Error_Msg_Uint_2 := Minsiz;
4827 ("size given (^) for type& too small, minimum allowed is ^",
4828 Size_Clause (Typ), Typ);
4832 Set_RM_Size (Typ, Minsiz);
4835 end Freeze_Fixed_Point_Type;
4841 procedure Freeze_Itype (T : Entity_Id; N : Node_Id) is
4845 Set_Has_Delayed_Freeze (T);
4846 L := Freeze_Entity (T, Sloc (N));
4848 if Is_Non_Empty_List (L) then
4849 Insert_Actions (N, L);
4853 --------------------------
4854 -- Freeze_Static_Object --
4855 --------------------------
4857 procedure Freeze_Static_Object (E : Entity_Id) is
4859 Cannot_Be_Static : exception;
4860 -- Exception raised if the type of a static object cannot be made
4861 -- static. This happens if the type depends on non-global objects.
4863 procedure Ensure_Expression_Is_SA (N : Node_Id);
4864 -- Called to ensure that an expression used as part of a type definition
4865 -- is statically allocatable, which means that the expression type is
4866 -- statically allocatable, and the expression is either static, or a
4867 -- reference to a library level constant.
4869 procedure Ensure_Type_Is_SA (Typ : Entity_Id);
4870 -- Called to mark a type as static, checking that it is possible
4871 -- to set the type as static. If it is not possible, then the
4872 -- exception Cannot_Be_Static is raised.
4874 -----------------------------
4875 -- Ensure_Expression_Is_SA --
4876 -----------------------------
4878 procedure Ensure_Expression_Is_SA (N : Node_Id) is
4882 Ensure_Type_Is_SA (Etype (N));
4884 if Is_Static_Expression (N) then
4887 elsif Nkind (N) = N_Identifier then
4891 and then Ekind (Ent) = E_Constant
4892 and then Is_Library_Level_Entity (Ent)
4898 raise Cannot_Be_Static;
4899 end Ensure_Expression_Is_SA;
4901 -----------------------
4902 -- Ensure_Type_Is_SA --
4903 -----------------------
4905 procedure Ensure_Type_Is_SA (Typ : Entity_Id) is
4910 -- If type is library level, we are all set
4912 if Is_Library_Level_Entity (Typ) then
4916 -- We are also OK if the type already marked as statically allocated,
4917 -- which means we processed it before.
4919 if Is_Statically_Allocated (Typ) then
4923 -- Mark type as statically allocated
4925 Set_Is_Statically_Allocated (Typ);
4927 -- Check that it is safe to statically allocate this type
4929 if Is_Scalar_Type (Typ) or else Is_Real_Type (Typ) then
4930 Ensure_Expression_Is_SA (Type_Low_Bound (Typ));
4931 Ensure_Expression_Is_SA (Type_High_Bound (Typ));
4933 elsif Is_Array_Type (Typ) then
4934 N := First_Index (Typ);
4935 while Present (N) loop
4936 Ensure_Type_Is_SA (Etype (N));
4940 Ensure_Type_Is_SA (Component_Type (Typ));
4942 elsif Is_Access_Type (Typ) then
4943 if Ekind (Designated_Type (Typ)) = E_Subprogram_Type then
4947 T : constant Entity_Id := Etype (Designated_Type (Typ));
4950 if T /= Standard_Void_Type then
4951 Ensure_Type_Is_SA (T);
4954 F := First_Formal (Designated_Type (Typ));
4956 while Present (F) loop
4957 Ensure_Type_Is_SA (Etype (F));
4963 Ensure_Type_Is_SA (Designated_Type (Typ));
4966 elsif Is_Record_Type (Typ) then
4967 C := First_Entity (Typ);
4968 while Present (C) loop
4969 if Ekind (C) = E_Discriminant
4970 or else Ekind (C) = E_Component
4972 Ensure_Type_Is_SA (Etype (C));
4974 elsif Is_Type (C) then
4975 Ensure_Type_Is_SA (C);
4981 elsif Ekind (Typ) = E_Subprogram_Type then
4982 Ensure_Type_Is_SA (Etype (Typ));
4984 C := First_Formal (Typ);
4985 while Present (C) loop
4986 Ensure_Type_Is_SA (Etype (C));
4991 raise Cannot_Be_Static;
4993 end Ensure_Type_Is_SA;
4995 -- Start of processing for Freeze_Static_Object
4998 Ensure_Type_Is_SA (Etype (E));
5001 when Cannot_Be_Static =>
5003 -- If the object that cannot be static is imported or exported,
5004 -- then we give an error message saying that this object cannot
5005 -- be imported or exported.
5007 if Is_Imported (E) then
5009 ("& cannot be imported (local type is not constant)", E);
5011 -- Otherwise must be exported, something is wrong if compiler
5012 -- is marking something as statically allocated which cannot be).
5014 else pragma Assert (Is_Exported (E));
5016 ("& cannot be exported (local type is not constant)", E);
5018 end Freeze_Static_Object;
5020 -----------------------
5021 -- Freeze_Subprogram --
5022 -----------------------
5024 procedure Freeze_Subprogram (E : Entity_Id) is
5029 -- Subprogram may not have an address clause unless it is imported
5031 if Present (Address_Clause (E)) then
5032 if not Is_Imported (E) then
5034 ("address clause can only be given " &
5035 "for imported subprogram",
5036 Name (Address_Clause (E)));
5040 -- Reset the Pure indication on an imported subprogram unless an
5041 -- explicit Pure_Function pragma was present. We do this because
5042 -- otherwise it is an insidious error to call a non-pure function from
5043 -- pure unit and have calls mysteriously optimized away. What happens
5044 -- here is that the Import can bypass the normal check to ensure that
5045 -- pure units call only pure subprograms.
5048 and then Is_Pure (E)
5049 and then not Has_Pragma_Pure_Function (E)
5051 Set_Is_Pure (E, False);
5054 -- For non-foreign convention subprograms, this is where we create
5055 -- the extra formals (for accessibility level and constrained bit
5056 -- information). We delay this till the freeze point precisely so
5057 -- that we know the convention!
5059 if not Has_Foreign_Convention (E) then
5060 Create_Extra_Formals (E);
5063 -- If this is convention Ada and a Valued_Procedure, that's odd
5065 if Ekind (E) = E_Procedure
5066 and then Is_Valued_Procedure (E)
5067 and then Convention (E) = Convention_Ada
5068 and then Warn_On_Export_Import
5071 ("?Valued_Procedure has no effect for convention Ada", E);
5072 Set_Is_Valued_Procedure (E, False);
5075 -- Case of foreign convention
5080 -- For foreign conventions, warn about return of an
5081 -- unconstrained array.
5083 -- Note: we *do* allow a return by descriptor for the VMS case,
5084 -- though here there is probably more to be done ???
5086 if Ekind (E) = E_Function then
5087 Retype := Underlying_Type (Etype (E));
5089 -- If no return type, probably some other error, e.g. a
5090 -- missing full declaration, so ignore.
5095 -- If the return type is generic, we have emitted a warning
5096 -- earlier on, and there is nothing else to check here. Specific
5097 -- instantiations may lead to erroneous behavior.
5099 elsif Is_Generic_Type (Etype (E)) then
5102 elsif Is_Array_Type (Retype)
5103 and then not Is_Constrained (Retype)
5104 and then Mechanism (E) not in Descriptor_Codes
5105 and then Warn_On_Export_Import
5108 ("?foreign convention function& should not return " &
5109 "unconstrained array", E);
5114 -- If any of the formals for an exported foreign convention
5115 -- subprogram have defaults, then emit an appropriate warning since
5116 -- this is odd (default cannot be used from non-Ada code)
5118 if Is_Exported (E) then
5119 F := First_Formal (E);
5120 while Present (F) loop
5121 if Warn_On_Export_Import
5122 and then Present (Default_Value (F))
5125 ("?parameter cannot be defaulted in non-Ada call",
5134 -- For VMS, descriptor mechanisms for parameters are allowed only
5135 -- for imported/exported subprograms. Moreover, the NCA descriptor
5136 -- is not allowed for parameters of exported subprograms.
5138 if OpenVMS_On_Target then
5139 if Is_Exported (E) then
5140 F := First_Formal (E);
5141 while Present (F) loop
5142 if Mechanism (F) = By_Descriptor_NCA then
5144 ("'N'C'A' descriptor for parameter not permitted", F);
5146 ("\can only be used for imported subprogram", F);
5152 elsif not Is_Imported (E) then
5153 F := First_Formal (E);
5154 while Present (F) loop
5155 if Mechanism (F) in Descriptor_Codes then
5157 ("descriptor mechanism for parameter not permitted", F);
5159 ("\can only be used for imported/exported subprogram", F);
5167 -- Pragma Inline_Always is disallowed for dispatching subprograms
5168 -- because the address of such subprograms is saved in the dispatch
5169 -- table to support dispatching calls, and dispatching calls cannot
5170 -- be inlined. This is consistent with the restriction against using
5171 -- 'Access or 'Address on an Inline_Always subprogram.
5173 if Is_Dispatching_Operation (E)
5174 and then Has_Pragma_Inline_Always (E)
5177 ("pragma Inline_Always not allowed for dispatching subprograms", E);
5180 -- Because of the implicit representation of inherited predefined
5181 -- operators in the front-end, the overriding status of the operation
5182 -- may be affected when a full view of a type is analyzed, and this is
5183 -- not captured by the analysis of the corresponding type declaration.
5184 -- Therefore the correctness of a not-overriding indicator must be
5185 -- rechecked when the subprogram is frozen.
5187 if Nkind (E) = N_Defining_Operator_Symbol
5188 and then not Error_Posted (Parent (E))
5190 Check_Overriding_Indicator (E, Empty, Is_Primitive (E));
5192 end Freeze_Subprogram;
5194 ----------------------
5195 -- Is_Fully_Defined --
5196 ----------------------
5198 function Is_Fully_Defined (T : Entity_Id) return Boolean is
5200 if Ekind (T) = E_Class_Wide_Type then
5201 return Is_Fully_Defined (Etype (T));
5203 elsif Is_Array_Type (T) then
5204 return Is_Fully_Defined (Component_Type (T));
5206 elsif Is_Record_Type (T)
5207 and not Is_Private_Type (T)
5209 -- Verify that the record type has no components with private types
5210 -- without completion.
5216 Comp := First_Component (T);
5218 while Present (Comp) loop
5219 if not Is_Fully_Defined (Etype (Comp)) then
5223 Next_Component (Comp);
5229 return not Is_Private_Type (T)
5230 or else Present (Full_View (Base_Type (T)));
5232 end Is_Fully_Defined;
5234 ---------------------------------
5235 -- Process_Default_Expressions --
5236 ---------------------------------
5238 procedure Process_Default_Expressions
5240 After : in out Node_Id)
5242 Loc : constant Source_Ptr := Sloc (E);
5249 Set_Default_Expressions_Processed (E);
5251 -- A subprogram instance and its associated anonymous subprogram share
5252 -- their signature. The default expression functions are defined in the
5253 -- wrapper packages for the anonymous subprogram, and should not be
5254 -- generated again for the instance.
5256 if Is_Generic_Instance (E)
5257 and then Present (Alias (E))
5258 and then Default_Expressions_Processed (Alias (E))
5263 Formal := First_Formal (E);
5264 while Present (Formal) loop
5265 if Present (Default_Value (Formal)) then
5267 -- We work with a copy of the default expression because we
5268 -- do not want to disturb the original, since this would mess
5269 -- up the conformance checking.
5271 Dcopy := New_Copy_Tree (Default_Value (Formal));
5273 -- The analysis of the expression may generate insert actions,
5274 -- which of course must not be executed. We wrap those actions
5275 -- in a procedure that is not called, and later on eliminated.
5276 -- The following cases have no side-effects, and are analyzed
5279 if Nkind (Dcopy) = N_Identifier
5280 or else Nkind (Dcopy) = N_Expanded_Name
5281 or else Nkind (Dcopy) = N_Integer_Literal
5282 or else (Nkind (Dcopy) = N_Real_Literal
5283 and then not Vax_Float (Etype (Dcopy)))
5284 or else Nkind (Dcopy) = N_Character_Literal
5285 or else Nkind (Dcopy) = N_String_Literal
5286 or else Known_Null (Dcopy)
5287 or else (Nkind (Dcopy) = N_Attribute_Reference
5289 Attribute_Name (Dcopy) = Name_Null_Parameter)
5292 -- If there is no default function, we must still do a full
5293 -- analyze call on the default value, to ensure that all error
5294 -- checks are performed, e.g. those associated with static
5295 -- evaluation. Note: this branch will always be taken if the
5296 -- analyzer is turned off (but we still need the error checks).
5298 -- Note: the setting of parent here is to meet the requirement
5299 -- that we can only analyze the expression while attached to
5300 -- the tree. Really the requirement is that the parent chain
5301 -- be set, we don't actually need to be in the tree.
5303 Set_Parent (Dcopy, Declaration_Node (Formal));
5306 -- Default expressions are resolved with their own type if the
5307 -- context is generic, to avoid anomalies with private types.
5309 if Ekind (Scope (E)) = E_Generic_Package then
5312 Resolve (Dcopy, Etype (Formal));
5315 -- If that resolved expression will raise constraint error,
5316 -- then flag the default value as raising constraint error.
5317 -- This allows a proper error message on the calls.
5319 if Raises_Constraint_Error (Dcopy) then
5320 Set_Raises_Constraint_Error (Default_Value (Formal));
5323 -- If the default is a parameterless call, we use the name of
5324 -- the called function directly, and there is no body to build.
5326 elsif Nkind (Dcopy) = N_Function_Call
5327 and then No (Parameter_Associations (Dcopy))
5331 -- Else construct and analyze the body of a wrapper procedure
5332 -- that contains an object declaration to hold the expression.
5333 -- Given that this is done only to complete the analysis, it
5334 -- simpler to build a procedure than a function which might
5335 -- involve secondary stack expansion.
5339 Make_Defining_Identifier (Loc, New_Internal_Name ('D'));
5342 Make_Subprogram_Body (Loc,
5344 Make_Procedure_Specification (Loc,
5345 Defining_Unit_Name => Dnam),
5347 Declarations => New_List (
5348 Make_Object_Declaration (Loc,
5349 Defining_Identifier =>
5350 Make_Defining_Identifier (Loc,
5351 New_Internal_Name ('T')),
5352 Object_Definition =>
5353 New_Occurrence_Of (Etype (Formal), Loc),
5354 Expression => New_Copy_Tree (Dcopy))),
5356 Handled_Statement_Sequence =>
5357 Make_Handled_Sequence_Of_Statements (Loc,
5358 Statements => New_List));
5360 Set_Scope (Dnam, Scope (E));
5361 Set_Assignment_OK (First (Declarations (Dbody)));
5362 Set_Is_Eliminated (Dnam);
5363 Insert_After (After, Dbody);
5369 Next_Formal (Formal);
5371 end Process_Default_Expressions;
5373 ----------------------------------------
5374 -- Set_Component_Alignment_If_Not_Set --
5375 ----------------------------------------
5377 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id) is
5379 -- Ignore if not base type, subtypes don't need anything
5381 if Typ /= Base_Type (Typ) then
5385 -- Do not override existing representation
5387 if Is_Packed (Typ) then
5390 elsif Has_Specified_Layout (Typ) then
5393 elsif Component_Alignment (Typ) /= Calign_Default then
5397 Set_Component_Alignment
5398 (Typ, Scope_Stack.Table
5399 (Scope_Stack.Last).Component_Alignment_Default);
5401 end Set_Component_Alignment_If_Not_Set;
5407 procedure Undelay_Type (T : Entity_Id) is
5409 Set_Has_Delayed_Freeze (T, False);
5410 Set_Freeze_Node (T, Empty);
5412 -- Since we don't want T to have a Freeze_Node, we don't want its
5413 -- Full_View or Corresponding_Record_Type to have one either.
5415 -- ??? Fundamentally, this whole handling is a kludge. What we really
5416 -- want is to be sure that for an Itype that's part of record R and is a
5417 -- subtype of type T, that it's frozen after the later of the freeze
5418 -- points of R and T. We have no way of doing that directly, so what we
5419 -- do is force most such Itypes to be frozen as part of freezing R via
5420 -- this procedure and only delay the ones that need to be delayed
5421 -- (mostly the designated types of access types that are defined as part
5424 if Is_Private_Type (T)
5425 and then Present (Full_View (T))
5426 and then Is_Itype (Full_View (T))
5427 and then Is_Record_Type (Scope (Full_View (T)))
5429 Undelay_Type (Full_View (T));
5432 if Is_Concurrent_Type (T)
5433 and then Present (Corresponding_Record_Type (T))
5434 and then Is_Itype (Corresponding_Record_Type (T))
5435 and then Is_Record_Type (Scope (Corresponding_Record_Type (T)))
5437 Undelay_Type (Corresponding_Record_Type (T));
5445 procedure Warn_Overlay
5450 Ent : constant Entity_Id := Entity (Nam);
5451 -- The object to which the address clause applies
5454 Old : Entity_Id := Empty;
5458 -- No warning if address clause overlay warnings are off
5460 if not Address_Clause_Overlay_Warnings then
5464 -- No warning if there is an explicit initialization
5466 Init := Original_Node (Expression (Declaration_Node (Ent)));
5468 if Present (Init) and then Comes_From_Source (Init) then
5472 -- We only give the warning for non-imported entities of a type for
5473 -- which a non-null base init proc is defined (or for access types which
5474 -- have implicit null initialization).
5477 and then (Has_Non_Null_Base_Init_Proc (Typ)
5478 or else Is_Access_Type (Typ))
5479 and then not Is_Imported (Ent)
5481 if Nkind (Expr) = N_Attribute_Reference
5482 and then Is_Entity_Name (Prefix (Expr))
5484 Old := Entity (Prefix (Expr));
5486 elsif Is_Entity_Name (Expr)
5487 and then Ekind (Entity (Expr)) = E_Constant
5489 Decl := Declaration_Node (Entity (Expr));
5491 if Nkind (Decl) = N_Object_Declaration
5492 and then Present (Expression (Decl))
5493 and then Nkind (Expression (Decl)) = N_Attribute_Reference
5494 and then Is_Entity_Name (Prefix (Expression (Decl)))
5496 Old := Entity (Prefix (Expression (Decl)));
5498 elsif Nkind (Expr) = N_Function_Call then
5502 -- A function call (most likely to To_Address) is probably not an
5503 -- overlay, so skip warning. Ditto if the function call was inlined
5504 -- and transformed into an entity.
5506 elsif Nkind (Original_Node (Expr)) = N_Function_Call then
5510 Decl := Next (Parent (Expr));
5512 -- If a pragma Import follows, we assume that it is for the current
5513 -- target of the address clause, and skip the warning.
5516 and then Nkind (Decl) = N_Pragma
5517 and then Pragma_Name (Decl) = Name_Import
5522 if Present (Old) then
5523 Error_Msg_Node_2 := Old;
5525 ("default initialization of & may modify &?",
5529 ("default initialization of & may modify overlaid storage?",
5533 -- Add friendly warning if initialization comes from a packed array
5536 if Is_Record_Type (Typ) then
5541 Comp := First_Component (Typ);
5543 while Present (Comp) loop
5544 if Nkind (Parent (Comp)) = N_Component_Declaration
5545 and then Present (Expression (Parent (Comp)))
5548 elsif Is_Array_Type (Etype (Comp))
5549 and then Present (Packed_Array_Type (Etype (Comp)))
5552 ("\packed array component& " &
5553 "will be initialized to zero?",
5557 Next_Component (Comp);
5564 ("\use pragma Import for & to " &
5565 "suppress initialization (RM B.1(24))?",
projects / platform / upstream / gcc.git / blob