1 -----------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2008, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 2, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 with Atree; use Atree;
28 with Debug; use Debug;
29 with Einfo; use Einfo;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Exp_Ch7; use Exp_Ch7;
33 with Exp_Disp; use Exp_Disp;
34 with Exp_Pakd; use Exp_Pakd;
35 with Exp_Util; use Exp_Util;
36 with Exp_Tss; use Exp_Tss;
37 with Layout; use Layout;
38 with Lib.Xref; use Lib.Xref;
39 with Namet; use Namet;
40 with Nlists; use Nlists;
41 with Nmake; use Nmake;
43 with Restrict; use Restrict;
44 with Rident; use Rident;
46 with Sem_Cat; use Sem_Cat;
47 with Sem_Ch6; use Sem_Ch6;
48 with Sem_Ch7; use Sem_Ch7;
49 with Sem_Ch8; use Sem_Ch8;
50 with Sem_Ch13; use Sem_Ch13;
51 with Sem_Eval; use Sem_Eval;
52 with Sem_Mech; use Sem_Mech;
53 with Sem_Prag; use Sem_Prag;
54 with Sem_Res; use Sem_Res;
55 with Sem_Util; use Sem_Util;
56 with Sinfo; use Sinfo;
57 with Snames; use Snames;
58 with Stand; use Stand;
59 with Targparm; use Targparm;
60 with Tbuild; use Tbuild;
61 with Ttypes; use Ttypes;
62 with Uintp; use Uintp;
63 with Urealp; use Urealp;
65 package body Freeze is
67 -----------------------
68 -- Local Subprograms --
69 -----------------------
71 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id);
72 -- Typ is a type that is being frozen. If no size clause is given,
73 -- but a default Esize has been computed, then this default Esize is
74 -- adjusted up if necessary to be consistent with a given alignment,
75 -- but never to a value greater than Long_Long_Integer'Size. This
76 -- is used for all discrete types and for fixed-point types.
78 procedure Build_And_Analyze_Renamed_Body
81 After : in out Node_Id);
82 -- Build body for a renaming declaration, insert in tree and analyze
84 procedure Check_Address_Clause (E : Entity_Id);
85 -- Apply legality checks to address clauses for object declarations,
86 -- at the point the object is frozen.
88 procedure Check_Strict_Alignment (E : Entity_Id);
89 -- E is a base type. If E is tagged or has a component that is aliased
90 -- or tagged or contains something this is aliased or tagged, set
93 procedure Check_Unsigned_Type (E : Entity_Id);
94 pragma Inline (Check_Unsigned_Type);
95 -- If E is a fixed-point or discrete type, then all the necessary work
96 -- to freeze it is completed except for possible setting of the flag
97 -- Is_Unsigned_Type, which is done by this procedure. The call has no
98 -- effect if the entity E is not a discrete or fixed-point type.
100 procedure Freeze_And_Append
103 Result : in out List_Id);
104 -- Freezes Ent using Freeze_Entity, and appends the resulting list of
105 -- nodes to Result, modifying Result from No_List if necessary.
107 procedure Freeze_Enumeration_Type (Typ : Entity_Id);
108 -- Freeze enumeration type. The Esize field is set as processing
109 -- proceeds (i.e. set by default when the type is declared and then
110 -- adjusted by rep clauses. What this procedure does is to make sure
111 -- that if a foreign convention is specified, and no specific size
112 -- is given, then the size must be at least Integer'Size.
114 procedure Freeze_Static_Object (E : Entity_Id);
115 -- If an object is frozen which has Is_Statically_Allocated set, then
116 -- all referenced types must also be marked with this flag. This routine
117 -- is in charge of meeting this requirement for the object entity E.
119 procedure Freeze_Subprogram (E : Entity_Id);
120 -- Perform freezing actions for a subprogram (create extra formals,
121 -- and set proper default mechanism values). Note that this routine
122 -- is not called for internal subprograms, for which neither of these
123 -- actions is needed (or desirable, we do not want for example to have
124 -- these extra formals present in initialization procedures, where they
125 -- would serve no purpose). In this call E is either a subprogram or
126 -- a subprogram type (i.e. an access to a subprogram).
128 function Is_Fully_Defined (T : Entity_Id) return Boolean;
129 -- True if T is not private and has no private components, or has a full
130 -- view. Used to determine whether the designated type of an access type
131 -- should be frozen when the access type is frozen. This is done when an
132 -- allocator is frozen, or an expression that may involve attributes of
133 -- the designated type. Otherwise freezing the access type does not freeze
134 -- the designated type.
136 procedure Process_Default_Expressions
138 After : in out Node_Id);
139 -- This procedure is called for each subprogram to complete processing
140 -- of default expressions at the point where all types are known to be
141 -- frozen. The expressions must be analyzed in full, to make sure that
142 -- all error processing is done (they have only been pre-analyzed). If
143 -- the expression is not an entity or literal, its analysis may generate
144 -- code which must not be executed. In that case we build a function
145 -- body to hold that code. This wrapper function serves no other purpose
146 -- (it used to be called to evaluate the default, but now the default is
147 -- inlined at each point of call).
149 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id);
150 -- Typ is a record or array type that is being frozen. This routine
151 -- sets the default component alignment from the scope stack values
152 -- if the alignment is otherwise not specified.
154 procedure Check_Debug_Info_Needed (T : Entity_Id);
155 -- As each entity is frozen, this routine is called to deal with the
156 -- setting of Debug_Info_Needed for the entity. This flag is set if
157 -- the entity comes from source, or if we are in Debug_Generated_Code
158 -- mode or if the -gnatdV debug flag is set. However, it never sets
159 -- the flag if Debug_Info_Off is set. This procedure also ensures that
160 -- subsidiary entities have the flag set as required.
162 procedure Undelay_Type (T : Entity_Id);
163 -- T is a type of a component that we know to be an Itype.
164 -- We don't want this to have a Freeze_Node, so ensure it doesn't.
165 -- Do the same for any Full_View or Corresponding_Record_Type.
167 procedure Warn_Overlay
171 -- Expr is the expression for an address clause for entity Nam whose type
172 -- is Typ. If Typ has a default initialization, and there is no explicit
173 -- initialization in the source declaration, check whether the address
174 -- clause might cause overlaying of an entity, and emit a warning on the
175 -- side effect that the initialization will cause.
177 -------------------------------
178 -- Adjust_Esize_For_Alignment --
179 -------------------------------
181 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id) is
185 if Known_Esize (Typ) and then Known_Alignment (Typ) then
186 Align := Alignment_In_Bits (Typ);
188 if Align > Esize (Typ)
189 and then Align <= Standard_Long_Long_Integer_Size
191 Set_Esize (Typ, Align);
194 end Adjust_Esize_For_Alignment;
196 ------------------------------------
197 -- Build_And_Analyze_Renamed_Body --
198 ------------------------------------
200 procedure Build_And_Analyze_Renamed_Body
203 After : in out Node_Id)
205 Body_Node : constant Node_Id := Build_Renamed_Body (Decl, New_S);
207 Insert_After (After, Body_Node);
208 Mark_Rewrite_Insertion (Body_Node);
211 end Build_And_Analyze_Renamed_Body;
213 ------------------------
214 -- Build_Renamed_Body --
215 ------------------------
217 function Build_Renamed_Body
219 New_S : Entity_Id) return Node_Id
221 Loc : constant Source_Ptr := Sloc (New_S);
222 -- We use for the source location of the renamed body, the location
223 -- of the spec entity. It might seem more natural to use the location
224 -- of the renaming declaration itself, but that would be wrong, since
225 -- then the body we create would look as though it was created far
226 -- too late, and this could cause problems with elaboration order
227 -- analysis, particularly in connection with instantiations.
229 N : constant Node_Id := Unit_Declaration_Node (New_S);
230 Nam : constant Node_Id := Name (N);
232 Spec : constant Node_Id := New_Copy_Tree (Specification (Decl));
233 Actuals : List_Id := No_List;
238 O_Formal : Entity_Id;
239 Param_Spec : Node_Id;
241 Pref : Node_Id := Empty;
242 -- If the renamed entity is a primitive operation given in prefix form,
243 -- the prefix is the target object and it has to be added as the first
244 -- actual in the generated call.
247 -- Determine the entity being renamed, which is the target of the call
248 -- statement. If the name is an explicit dereference, this is a renaming
249 -- of a subprogram type rather than a subprogram. The name itself is
252 if Nkind (Nam) = N_Selected_Component then
253 Old_S := Entity (Selector_Name (Nam));
255 elsif Nkind (Nam) = N_Explicit_Dereference then
256 Old_S := Etype (Nam);
258 elsif Nkind (Nam) = N_Indexed_Component then
259 if Is_Entity_Name (Prefix (Nam)) then
260 Old_S := Entity (Prefix (Nam));
262 Old_S := Entity (Selector_Name (Prefix (Nam)));
265 elsif Nkind (Nam) = N_Character_Literal then
266 Old_S := Etype (New_S);
269 Old_S := Entity (Nam);
272 if Is_Entity_Name (Nam) then
274 -- If the renamed entity is a predefined operator, retain full name
275 -- to ensure its visibility.
277 if Ekind (Old_S) = E_Operator
278 and then Nkind (Nam) = N_Expanded_Name
280 Call_Name := New_Copy (Name (N));
282 Call_Name := New_Reference_To (Old_S, Loc);
286 if Nkind (Nam) = N_Selected_Component
287 and then Present (First_Formal (Old_S))
289 (Is_Controlling_Formal (First_Formal (Old_S))
290 or else Is_Class_Wide_Type (Etype (First_Formal (Old_S))))
293 -- Retrieve the target object, to be added as a first actual
296 Call_Name := New_Occurrence_Of (Old_S, Loc);
297 Pref := Prefix (Nam);
300 Call_Name := New_Copy (Name (N));
303 -- The original name may have been overloaded, but
304 -- is fully resolved now.
306 Set_Is_Overloaded (Call_Name, False);
309 -- For simple renamings, subsequent calls can be expanded directly as
310 -- called to the renamed entity. The body must be generated in any case
311 -- for calls they may appear elsewhere.
313 if (Ekind (Old_S) = E_Function
314 or else Ekind (Old_S) = E_Procedure)
315 and then Nkind (Decl) = N_Subprogram_Declaration
317 Set_Body_To_Inline (Decl, Old_S);
320 -- The body generated for this renaming is an internal artifact, and
321 -- does not constitute a freeze point for the called entity.
323 Set_Must_Not_Freeze (Call_Name);
325 Formal := First_Formal (Defining_Entity (Decl));
327 if Present (Pref) then
329 Pref_Type : constant Entity_Id := Etype (Pref);
330 Form_Type : constant Entity_Id := Etype (First_Formal (Old_S));
334 -- The controlling formal may be an access parameter, or the
335 -- actual may be an access value, so adjust accordingly.
337 if Is_Access_Type (Pref_Type)
338 and then not Is_Access_Type (Form_Type)
341 (Make_Explicit_Dereference (Loc, Relocate_Node (Pref)));
343 elsif Is_Access_Type (Form_Type)
344 and then not Is_Access_Type (Pref)
347 (Make_Attribute_Reference (Loc,
348 Attribute_Name => Name_Access,
349 Prefix => Relocate_Node (Pref)));
351 Actuals := New_List (Pref);
355 elsif Present (Formal) then
362 if Present (Formal) then
363 while Present (Formal) loop
364 Append (New_Reference_To (Formal, Loc), Actuals);
365 Next_Formal (Formal);
369 -- If the renamed entity is an entry, inherit its profile. For other
370 -- renamings as bodies, both profiles must be subtype conformant, so it
371 -- is not necessary to replace the profile given in the declaration.
372 -- However, default values that are aggregates are rewritten when
373 -- partially analyzed, so we recover the original aggregate to insure
374 -- that subsequent conformity checking works. Similarly, if the default
375 -- expression was constant-folded, recover the original expression.
377 Formal := First_Formal (Defining_Entity (Decl));
379 if Present (Formal) then
380 O_Formal := First_Formal (Old_S);
381 Param_Spec := First (Parameter_Specifications (Spec));
383 while Present (Formal) loop
384 if Is_Entry (Old_S) then
386 if Nkind (Parameter_Type (Param_Spec)) /=
389 Set_Etype (Formal, Etype (O_Formal));
390 Set_Entity (Parameter_Type (Param_Spec), Etype (O_Formal));
393 elsif Nkind (Default_Value (O_Formal)) = N_Aggregate
394 or else Nkind (Original_Node (Default_Value (O_Formal))) /=
395 Nkind (Default_Value (O_Formal))
397 Set_Expression (Param_Spec,
398 New_Copy_Tree (Original_Node (Default_Value (O_Formal))));
401 Next_Formal (Formal);
402 Next_Formal (O_Formal);
407 -- If the renamed entity is a function, the generated body contains a
408 -- return statement. Otherwise, build a procedure call. If the entity is
409 -- an entry, subsequent analysis of the call will transform it into the
410 -- proper entry or protected operation call. If the renamed entity is
411 -- a character literal, return it directly.
413 if Ekind (Old_S) = E_Function
414 or else Ekind (Old_S) = E_Operator
415 or else (Ekind (Old_S) = E_Subprogram_Type
416 and then Etype (Old_S) /= Standard_Void_Type)
419 Make_Simple_Return_Statement (Loc,
421 Make_Function_Call (Loc,
423 Parameter_Associations => Actuals));
425 elsif Ekind (Old_S) = E_Enumeration_Literal then
427 Make_Simple_Return_Statement (Loc,
428 Expression => New_Occurrence_Of (Old_S, Loc));
430 elsif Nkind (Nam) = N_Character_Literal then
432 Make_Simple_Return_Statement (Loc,
433 Expression => Call_Name);
437 Make_Procedure_Call_Statement (Loc,
439 Parameter_Associations => Actuals);
442 -- Create entities for subprogram body and formals
444 Set_Defining_Unit_Name (Spec,
445 Make_Defining_Identifier (Loc, Chars => Chars (New_S)));
447 Param_Spec := First (Parameter_Specifications (Spec));
449 while Present (Param_Spec) loop
450 Set_Defining_Identifier (Param_Spec,
451 Make_Defining_Identifier (Loc,
452 Chars => Chars (Defining_Identifier (Param_Spec))));
457 Make_Subprogram_Body (Loc,
458 Specification => Spec,
459 Declarations => New_List,
460 Handled_Statement_Sequence =>
461 Make_Handled_Sequence_Of_Statements (Loc,
462 Statements => New_List (Call_Node)));
464 if Nkind (Decl) /= N_Subprogram_Declaration then
466 Make_Subprogram_Declaration (Loc,
467 Specification => Specification (N)));
470 -- Link the body to the entity whose declaration it completes. If
471 -- the body is analyzed when the renamed entity is frozen, it may
472 -- be necessary to restore the proper scope (see package Exp_Ch13).
474 if Nkind (N) = N_Subprogram_Renaming_Declaration
475 and then Present (Corresponding_Spec (N))
477 Set_Corresponding_Spec (Body_Node, Corresponding_Spec (N));
479 Set_Corresponding_Spec (Body_Node, New_S);
483 end Build_Renamed_Body;
485 --------------------------
486 -- Check_Address_Clause --
487 --------------------------
489 procedure Check_Address_Clause (E : Entity_Id) is
490 Addr : constant Node_Id := Address_Clause (E);
492 Decl : constant Node_Id := Declaration_Node (E);
493 Typ : constant Entity_Id := Etype (E);
496 if Present (Addr) then
497 Expr := Expression (Addr);
499 -- If we have no initialization of any kind, then we don't need to
500 -- place any restrictions on the address clause, because the object
501 -- will be elaborated after the address clause is evaluated. This
502 -- happens if the declaration has no initial expression, or the type
503 -- has no implicit initialization, or the object is imported.
505 -- The same holds for all initialized scalar types and all access
506 -- types. Packed bit arrays of size up to 64 are represented using a
507 -- modular type with an initialization (to zero) and can be processed
508 -- like other initialized scalar types.
510 -- If the type is controlled, code to attach the object to a
511 -- finalization chain is generated at the point of declaration,
512 -- and therefore the elaboration of the object cannot be delayed:
513 -- the address expression must be a constant.
515 if (No (Expression (Decl))
516 and then not Controlled_Type (Typ)
518 (not Has_Non_Null_Base_Init_Proc (Typ)
519 or else Is_Imported (E)))
522 (Present (Expression (Decl))
523 and then Is_Scalar_Type (Typ))
529 (Is_Bit_Packed_Array (Typ)
531 Is_Modular_Integer_Type (Packed_Array_Type (Typ)))
535 -- Otherwise, we require the address clause to be constant because
536 -- the call to the initialization procedure (or the attach code) has
537 -- to happen at the point of the declaration.
540 Check_Constant_Address_Clause (Expr, E);
541 Set_Has_Delayed_Freeze (E, False);
544 if not Error_Posted (Expr)
545 and then not Controlled_Type (Typ)
547 Warn_Overlay (Expr, Typ, Name (Addr));
550 end Check_Address_Clause;
552 -----------------------------
553 -- Check_Compile_Time_Size --
554 -----------------------------
556 procedure Check_Compile_Time_Size (T : Entity_Id) is
558 procedure Set_Small_Size (T : Entity_Id; S : Uint);
559 -- Sets the compile time known size (32 bits or less) in the Esize
560 -- field, of T checking for a size clause that was given which attempts
561 -- to give a smaller size.
563 function Size_Known (T : Entity_Id) return Boolean;
564 -- Recursive function that does all the work
566 function Static_Discriminated_Components (T : Entity_Id) return Boolean;
567 -- If T is a constrained subtype, its size is not known if any of its
568 -- discriminant constraints is not static and it is not a null record.
569 -- The test is conservative and doesn't check that the components are
570 -- in fact constrained by non-static discriminant values. Could be made
577 procedure Set_Small_Size (T : Entity_Id; S : Uint) is
582 elsif Has_Size_Clause (T) then
583 if RM_Size (T) < S then
584 Error_Msg_Uint_1 := S;
586 ("size for & too small, minimum allowed is ^",
589 elsif Unknown_Esize (T) then
593 -- Set sizes if not set already
596 if Unknown_Esize (T) then
600 if Unknown_RM_Size (T) then
610 function Size_Known (T : Entity_Id) return Boolean is
618 if Size_Known_At_Compile_Time (T) then
621 -- Always True for scalar types. This is true even for generic formal
622 -- scalar types. We used to return False in the latter case, but the
623 -- size is known at compile time, even in the template, we just do
624 -- not know the exact size but that's not the point of this routine.
626 elsif Is_Scalar_Type (T)
627 or else Is_Task_Type (T)
633 elsif Is_Array_Type (T) then
635 -- String literals always have known size, and we can set it
637 if Ekind (T) = E_String_Literal_Subtype then
638 Set_Small_Size (T, Component_Size (T)
639 * String_Literal_Length (T));
642 -- Unconstrained types never have known at compile time size
644 elsif not Is_Constrained (T) then
647 -- Don't do any recursion on type with error posted, since we may
648 -- have a malformed type that leads us into a loop.
650 elsif Error_Posted (T) then
653 -- Otherwise if component size unknown, then array size unknown
655 elsif not Size_Known (Component_Type (T)) then
659 -- Check for all indexes static, and also compute possible size
660 -- (in case it is less than 32 and may be packable).
663 Esiz : Uint := Component_Size (T);
667 Index := First_Index (T);
668 while Present (Index) loop
669 if Nkind (Index) = N_Range then
670 Get_Index_Bounds (Index, Low, High);
672 elsif Error_Posted (Scalar_Range (Etype (Index))) then
676 Low := Type_Low_Bound (Etype (Index));
677 High := Type_High_Bound (Etype (Index));
680 if not Compile_Time_Known_Value (Low)
681 or else not Compile_Time_Known_Value (High)
682 or else Etype (Index) = Any_Type
687 Dim := Expr_Value (High) - Expr_Value (Low) + 1;
699 Set_Small_Size (T, Esiz);
703 -- Access types always have known at compile time sizes
705 elsif Is_Access_Type (T) then
708 -- For non-generic private types, go to underlying type if present
710 elsif Is_Private_Type (T)
711 and then not Is_Generic_Type (T)
712 and then Present (Underlying_Type (T))
714 -- Don't do any recursion on type with error posted, since we may
715 -- have a malformed type that leads us into a loop.
717 if Error_Posted (T) then
720 return Size_Known (Underlying_Type (T));
725 elsif Is_Record_Type (T) then
727 -- A class-wide type is never considered to have a known size
729 if Is_Class_Wide_Type (T) then
732 -- A subtype of a variant record must not have non-static
733 -- discriminanted components.
735 elsif T /= Base_Type (T)
736 and then not Static_Discriminated_Components (T)
740 -- Don't do any recursion on type with error posted, since we may
741 -- have a malformed type that leads us into a loop.
743 elsif Error_Posted (T) then
747 -- Now look at the components of the record
750 -- The following two variables are used to keep track of the
751 -- size of packed records if we can tell the size of the packed
752 -- record in the front end. Packed_Size_Known is True if so far
753 -- we can figure out the size. It is initialized to True for a
754 -- packed record, unless the record has discriminants. The
755 -- reason we eliminate the discriminated case is that we don't
756 -- know the way the back end lays out discriminated packed
757 -- records. If Packed_Size_Known is True, then Packed_Size is
758 -- the size in bits so far.
760 Packed_Size_Known : Boolean :=
762 and then not Has_Discriminants (T);
764 Packed_Size : Uint := Uint_0;
767 -- Test for variant part present
769 if Has_Discriminants (T)
770 and then Present (Parent (T))
771 and then Nkind (Parent (T)) = N_Full_Type_Declaration
772 and then Nkind (Type_Definition (Parent (T))) =
774 and then not Null_Present (Type_Definition (Parent (T)))
775 and then Present (Variant_Part
776 (Component_List (Type_Definition (Parent (T)))))
778 -- If variant part is present, and type is unconstrained,
779 -- then we must have defaulted discriminants, or a size
780 -- clause must be present for the type, or else the size
781 -- is definitely not known at compile time.
783 if not Is_Constrained (T)
785 No (Discriminant_Default_Value
786 (First_Discriminant (T)))
787 and then Unknown_Esize (T)
793 -- Loop through components
795 Comp := First_Component_Or_Discriminant (T);
796 while Present (Comp) loop
797 Ctyp := Etype (Comp);
799 -- We do not know the packed size if there is a component
800 -- clause present (we possibly could, but this would only
801 -- help in the case of a record with partial rep clauses.
802 -- That's because in the case of full rep clauses, the
803 -- size gets figured out anyway by a different circuit).
805 if Present (Component_Clause (Comp)) then
806 Packed_Size_Known := False;
809 -- We need to identify a component that is an array where
810 -- the index type is an enumeration type with non-standard
811 -- representation, and some bound of the type depends on a
814 -- This is because gigi computes the size by doing a
815 -- substitution of the appropriate discriminant value in
816 -- the size expression for the base type, and gigi is not
817 -- clever enough to evaluate the resulting expression (which
818 -- involves a call to rep_to_pos) at compile time.
820 -- It would be nice if gigi would either recognize that
821 -- this expression can be computed at compile time, or
822 -- alternatively figured out the size from the subtype
823 -- directly, where all the information is at hand ???
825 if Is_Array_Type (Etype (Comp))
826 and then Present (Packed_Array_Type (Etype (Comp)))
829 Ocomp : constant Entity_Id :=
830 Original_Record_Component (Comp);
831 OCtyp : constant Entity_Id := Etype (Ocomp);
837 Ind := First_Index (OCtyp);
838 while Present (Ind) loop
839 Indtyp := Etype (Ind);
841 if Is_Enumeration_Type (Indtyp)
842 and then Has_Non_Standard_Rep (Indtyp)
844 Lo := Type_Low_Bound (Indtyp);
845 Hi := Type_High_Bound (Indtyp);
847 if Is_Entity_Name (Lo)
848 and then Ekind (Entity (Lo)) = E_Discriminant
852 elsif Is_Entity_Name (Hi)
853 and then Ekind (Entity (Hi)) = E_Discriminant
864 -- Clearly size of record is not known if the size of one of
865 -- the components is not known.
867 if not Size_Known (Ctyp) then
871 -- Accumulate packed size if possible
873 if Packed_Size_Known then
875 -- We can only deal with elementary types, since for
876 -- non-elementary components, alignment enters into the
877 -- picture, and we don't know enough to handle proper
878 -- alignment in this context. Packed arrays count as
879 -- elementary if the representation is a modular type.
881 if Is_Elementary_Type (Ctyp)
882 or else (Is_Array_Type (Ctyp)
883 and then Present (Packed_Array_Type (Ctyp))
884 and then Is_Modular_Integer_Type
885 (Packed_Array_Type (Ctyp)))
887 -- If RM_Size is known and static, then we can
888 -- keep accumulating the packed size.
890 if Known_Static_RM_Size (Ctyp) then
892 -- A little glitch, to be removed sometime ???
893 -- gigi does not understand zero sizes yet.
895 if RM_Size (Ctyp) = Uint_0 then
896 Packed_Size_Known := False;
898 -- Normal case where we can keep accumulating the
899 -- packed array size.
902 Packed_Size := Packed_Size + RM_Size (Ctyp);
905 -- If we have a field whose RM_Size is not known then
906 -- we can't figure out the packed size here.
909 Packed_Size_Known := False;
912 -- If we have a non-elementary type we can't figure out
913 -- the packed array size (alignment issues).
916 Packed_Size_Known := False;
920 Next_Component_Or_Discriminant (Comp);
923 if Packed_Size_Known then
924 Set_Small_Size (T, Packed_Size);
930 -- All other cases, size not known at compile time
937 -------------------------------------
938 -- Static_Discriminated_Components --
939 -------------------------------------
941 function Static_Discriminated_Components
942 (T : Entity_Id) return Boolean
944 Constraint : Elmt_Id;
947 if Has_Discriminants (T)
948 and then Present (Discriminant_Constraint (T))
949 and then Present (First_Component (T))
951 Constraint := First_Elmt (Discriminant_Constraint (T));
952 while Present (Constraint) loop
953 if not Compile_Time_Known_Value (Node (Constraint)) then
957 Next_Elmt (Constraint);
962 end Static_Discriminated_Components;
964 -- Start of processing for Check_Compile_Time_Size
967 Set_Size_Known_At_Compile_Time (T, Size_Known (T));
968 end Check_Compile_Time_Size;
970 -----------------------------
971 -- Check_Debug_Info_Needed --
972 -----------------------------
974 procedure Check_Debug_Info_Needed (T : Entity_Id) is
976 if Debug_Info_Off (T) then
979 elsif Comes_From_Source (T)
980 or else Debug_Generated_Code
981 or else Debug_Flag_VV
982 or else Needs_Debug_Info (T)
984 Set_Debug_Info_Needed (T);
986 end Check_Debug_Info_Needed;
988 ----------------------------
989 -- Check_Strict_Alignment --
990 ----------------------------
992 procedure Check_Strict_Alignment (E : Entity_Id) is
996 if Is_Tagged_Type (E) or else Is_Concurrent_Type (E) then
997 Set_Strict_Alignment (E);
999 elsif Is_Array_Type (E) then
1000 Set_Strict_Alignment (E, Strict_Alignment (Component_Type (E)));
1002 elsif Is_Record_Type (E) then
1003 if Is_Limited_Record (E) then
1004 Set_Strict_Alignment (E);
1008 Comp := First_Component (E);
1010 while Present (Comp) loop
1011 if not Is_Type (Comp)
1012 and then (Strict_Alignment (Etype (Comp))
1013 or else Is_Aliased (Comp))
1015 Set_Strict_Alignment (E);
1019 Next_Component (Comp);
1022 end Check_Strict_Alignment;
1024 -------------------------
1025 -- Check_Unsigned_Type --
1026 -------------------------
1028 procedure Check_Unsigned_Type (E : Entity_Id) is
1029 Ancestor : Entity_Id;
1034 if not Is_Discrete_Or_Fixed_Point_Type (E) then
1038 -- Do not attempt to analyze case where range was in error
1040 if Error_Posted (Scalar_Range (E)) then
1044 -- The situation that is non trivial is something like
1046 -- subtype x1 is integer range -10 .. +10;
1047 -- subtype x2 is x1 range 0 .. V1;
1048 -- subtype x3 is x2 range V2 .. V3;
1049 -- subtype x4 is x3 range V4 .. V5;
1051 -- where Vn are variables. Here the base type is signed, but we still
1052 -- know that x4 is unsigned because of the lower bound of x2.
1054 -- The only way to deal with this is to look up the ancestor chain
1058 if Ancestor = Any_Type or else Etype (Ancestor) = Any_Type then
1062 Lo_Bound := Type_Low_Bound (Ancestor);
1064 if Compile_Time_Known_Value (Lo_Bound) then
1066 if Expr_Rep_Value (Lo_Bound) >= 0 then
1067 Set_Is_Unsigned_Type (E, True);
1073 Ancestor := Ancestor_Subtype (Ancestor);
1075 -- If no ancestor had a static lower bound, go to base type
1077 if No (Ancestor) then
1079 -- Note: the reason we still check for a compile time known
1080 -- value for the base type is that at least in the case of
1081 -- generic formals, we can have bounds that fail this test,
1082 -- and there may be other cases in error situations.
1084 Btyp := Base_Type (E);
1086 if Btyp = Any_Type or else Etype (Btyp) = Any_Type then
1090 Lo_Bound := Type_Low_Bound (Base_Type (E));
1092 if Compile_Time_Known_Value (Lo_Bound)
1093 and then Expr_Rep_Value (Lo_Bound) >= 0
1095 Set_Is_Unsigned_Type (E, True);
1102 end Check_Unsigned_Type;
1104 -----------------------------
1105 -- Expand_Atomic_Aggregate --
1106 -----------------------------
1108 procedure Expand_Atomic_Aggregate (E : Entity_Id; Typ : Entity_Id) is
1109 Loc : constant Source_Ptr := Sloc (E);
1114 if (Nkind (Parent (E)) = N_Object_Declaration
1115 or else Nkind (Parent (E)) = N_Assignment_Statement)
1116 and then Comes_From_Source (Parent (E))
1117 and then Nkind (E) = N_Aggregate
1120 Make_Defining_Identifier (Loc,
1121 New_Internal_Name ('T'));
1124 Make_Object_Declaration (Loc,
1125 Defining_Identifier => Temp,
1126 Object_Definition => New_Occurrence_Of (Typ, Loc),
1127 Expression => Relocate_Node (E));
1128 Insert_Before (Parent (E), New_N);
1131 Set_Expression (Parent (E), New_Occurrence_Of (Temp, Loc));
1133 -- To prevent the temporary from being constant-folded (which would
1134 -- lead to the same piecemeal assignment on the original target)
1135 -- indicate to the back-end that the temporary is a variable with
1136 -- real storage. See description of this flag in Einfo, and the notes
1137 -- on N_Assignment_Statement and N_Object_Declaration in Sinfo.
1139 Set_Is_True_Constant (Temp, False);
1141 end Expand_Atomic_Aggregate;
1147 -- Note: the easy coding for this procedure would be to just build a
1148 -- single list of freeze nodes and then insert them and analyze them
1149 -- all at once. This won't work, because the analysis of earlier freeze
1150 -- nodes may recursively freeze types which would otherwise appear later
1151 -- on in the freeze list. So we must analyze and expand the freeze nodes
1152 -- as they are generated.
1154 procedure Freeze_All (From : Entity_Id; After : in out Node_Id) is
1155 Loc : constant Source_Ptr := Sloc (After);
1159 procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id);
1160 -- This is the internal recursive routine that does freezing of entities
1161 -- (but NOT the analysis of default expressions, which should not be
1162 -- recursive, we don't want to analyze those till we are sure that ALL
1163 -- the types are frozen).
1165 --------------------
1166 -- Freeze_All_Ent --
1167 --------------------
1169 procedure Freeze_All_Ent
1171 After : in out Node_Id)
1177 procedure Process_Flist;
1178 -- If freeze nodes are present, insert and analyze, and reset cursor
1179 -- for next insertion.
1185 procedure Process_Flist is
1187 if Is_Non_Empty_List (Flist) then
1188 Lastn := Next (After);
1189 Insert_List_After_And_Analyze (After, Flist);
1191 if Present (Lastn) then
1192 After := Prev (Lastn);
1194 After := Last (List_Containing (After));
1199 -- Start or processing for Freeze_All_Ent
1203 while Present (E) loop
1205 -- If the entity is an inner package which is not a package
1206 -- renaming, then its entities must be frozen at this point. Note
1207 -- that such entities do NOT get frozen at the end of the nested
1208 -- package itself (only library packages freeze).
1210 -- Same is true for task declarations, where anonymous records
1211 -- created for entry parameters must be frozen.
1213 if Ekind (E) = E_Package
1214 and then No (Renamed_Object (E))
1215 and then not Is_Child_Unit (E)
1216 and then not Is_Frozen (E)
1219 Install_Visible_Declarations (E);
1220 Install_Private_Declarations (E);
1222 Freeze_All (First_Entity (E), After);
1224 End_Package_Scope (E);
1226 elsif Ekind (E) in Task_Kind
1228 (Nkind (Parent (E)) = N_Task_Type_Declaration
1230 Nkind (Parent (E)) = N_Single_Task_Declaration)
1233 Freeze_All (First_Entity (E), After);
1236 -- For a derived tagged type, we must ensure that all the
1237 -- primitive operations of the parent have been frozen, so that
1238 -- their addresses will be in the parent's dispatch table at the
1239 -- point it is inherited.
1241 elsif Ekind (E) = E_Record_Type
1242 and then Is_Tagged_Type (E)
1243 and then Is_Tagged_Type (Etype (E))
1244 and then Is_Derived_Type (E)
1247 Prim_List : constant Elist_Id :=
1248 Primitive_Operations (Etype (E));
1254 Prim := First_Elmt (Prim_List);
1256 while Present (Prim) loop
1257 Subp := Node (Prim);
1259 if Comes_From_Source (Subp)
1260 and then not Is_Frozen (Subp)
1262 Flist := Freeze_Entity (Subp, Loc);
1271 if not Is_Frozen (E) then
1272 Flist := Freeze_Entity (E, Loc);
1276 -- If an incomplete type is still not frozen, this may be a
1277 -- premature freezing because of a body declaration that follows.
1278 -- Indicate where the freezing took place.
1280 -- If the freezing is caused by the end of the current declarative
1281 -- part, it is a Taft Amendment type, and there is no error.
1283 if not Is_Frozen (E)
1284 and then Ekind (E) = E_Incomplete_Type
1287 Bod : constant Node_Id := Next (After);
1290 if (Nkind (Bod) = N_Subprogram_Body
1291 or else Nkind (Bod) = N_Entry_Body
1292 or else Nkind (Bod) = N_Package_Body
1293 or else Nkind (Bod) = N_Protected_Body
1294 or else Nkind (Bod) = N_Task_Body
1295 or else Nkind (Bod) in N_Body_Stub)
1297 List_Containing (After) = List_Containing (Parent (E))
1299 Error_Msg_Sloc := Sloc (Next (After));
1301 ("type& is frozen# before its full declaration",
1311 -- Start of processing for Freeze_All
1314 Freeze_All_Ent (From, After);
1316 -- Now that all types are frozen, we can deal with default expressions
1317 -- that require us to build a default expression functions. This is the
1318 -- point at which such functions are constructed (after all types that
1319 -- might be used in such expressions have been frozen).
1321 -- We also add finalization chains to access types whose designated
1322 -- types are controlled. This is normally done when freezing the type,
1323 -- but this misses recursive type definitions where the later members
1324 -- of the recursion introduce controlled components.
1326 -- Loop through entities
1329 while Present (E) loop
1330 if Is_Subprogram (E) then
1332 if not Default_Expressions_Processed (E) then
1333 Process_Default_Expressions (E, After);
1336 if not Has_Completion (E) then
1337 Decl := Unit_Declaration_Node (E);
1339 if Nkind (Decl) = N_Subprogram_Renaming_Declaration then
1340 Build_And_Analyze_Renamed_Body (Decl, E, After);
1342 elsif Nkind (Decl) = N_Subprogram_Declaration
1343 and then Present (Corresponding_Body (Decl))
1345 Nkind (Unit_Declaration_Node (Corresponding_Body (Decl)))
1346 = N_Subprogram_Renaming_Declaration
1348 Build_And_Analyze_Renamed_Body
1349 (Decl, Corresponding_Body (Decl), After);
1353 elsif Ekind (E) in Task_Kind
1355 (Nkind (Parent (E)) = N_Task_Type_Declaration
1357 Nkind (Parent (E)) = N_Single_Task_Declaration)
1362 Ent := First_Entity (E);
1364 while Present (Ent) loop
1367 and then not Default_Expressions_Processed (Ent)
1369 Process_Default_Expressions (Ent, After);
1376 elsif Is_Access_Type (E)
1377 and then Comes_From_Source (E)
1378 and then Ekind (Directly_Designated_Type (E)) = E_Incomplete_Type
1379 and then Controlled_Type (Designated_Type (E))
1380 and then No (Associated_Final_Chain (E))
1382 Build_Final_List (Parent (E), E);
1389 -----------------------
1390 -- Freeze_And_Append --
1391 -----------------------
1393 procedure Freeze_And_Append
1396 Result : in out List_Id)
1398 L : constant List_Id := Freeze_Entity (Ent, Loc);
1400 if Is_Non_Empty_List (L) then
1401 if Result = No_List then
1404 Append_List (L, Result);
1407 end Freeze_And_Append;
1413 procedure Freeze_Before (N : Node_Id; T : Entity_Id) is
1414 Freeze_Nodes : constant List_Id := Freeze_Entity (T, Sloc (N));
1416 if Is_Non_Empty_List (Freeze_Nodes) then
1417 Insert_Actions (N, Freeze_Nodes);
1425 function Freeze_Entity (E : Entity_Id; Loc : Source_Ptr) return List_Id is
1426 Test_E : Entity_Id := E;
1434 procedure Check_Current_Instance (Comp_Decl : Node_Id);
1435 -- Check that an Access or Unchecked_Access attribute with a prefix
1436 -- which is the current instance type can only be applied when the type
1439 function After_Last_Declaration return Boolean;
1440 -- If Loc is a freeze_entity that appears after the last declaration
1441 -- in the scope, inhibit error messages on late completion.
1443 procedure Freeze_Record_Type (Rec : Entity_Id);
1444 -- Freeze each component, handle some representation clauses, and freeze
1445 -- primitive operations if this is a tagged type.
1447 ----------------------------
1448 -- After_Last_Declaration --
1449 ----------------------------
1451 function After_Last_Declaration return Boolean is
1452 Spec : constant Node_Id := Parent (Current_Scope);
1454 if Nkind (Spec) = N_Package_Specification then
1455 if Present (Private_Declarations (Spec)) then
1456 return Loc >= Sloc (Last (Private_Declarations (Spec)));
1457 elsif Present (Visible_Declarations (Spec)) then
1458 return Loc >= Sloc (Last (Visible_Declarations (Spec)));
1465 end After_Last_Declaration;
1467 ----------------------------
1468 -- Check_Current_Instance --
1469 ----------------------------
1471 procedure Check_Current_Instance (Comp_Decl : Node_Id) is
1473 Rec_Type : constant Entity_Id :=
1474 Scope (Defining_Identifier (Comp_Decl));
1476 Decl : constant Node_Id := Parent (Rec_Type);
1478 function Process (N : Node_Id) return Traverse_Result;
1479 -- Process routine to apply check to given node
1485 function Process (N : Node_Id) return Traverse_Result is
1488 when N_Attribute_Reference =>
1489 if (Attribute_Name (N) = Name_Access
1491 Attribute_Name (N) = Name_Unchecked_Access)
1492 and then Is_Entity_Name (Prefix (N))
1493 and then Is_Type (Entity (Prefix (N)))
1494 and then Entity (Prefix (N)) = E
1497 ("current instance must be a limited type", Prefix (N));
1503 when others => return OK;
1507 procedure Traverse is new Traverse_Proc (Process);
1509 -- Start of processing for Check_Current_Instance
1512 -- In Ada95, the (imprecise) rule is that the current instance of a
1513 -- limited type is aliased. In Ada2005, limitedness must be explicit:
1514 -- either a tagged type, or a limited record.
1516 if Is_Limited_Type (Rec_Type)
1518 (Ada_Version < Ada_05
1519 or else Is_Tagged_Type (Rec_Type))
1523 elsif Nkind (Decl) = N_Full_Type_Declaration
1524 and then Limited_Present (Type_Definition (Decl))
1529 Traverse (Comp_Decl);
1531 end Check_Current_Instance;
1533 ------------------------
1534 -- Freeze_Record_Type --
1535 ------------------------
1537 procedure Freeze_Record_Type (Rec : Entity_Id) is
1544 pragma Warnings (Off, Junk);
1546 Unplaced_Component : Boolean := False;
1547 -- Set True if we find at least one component with no component
1548 -- clause (used to warn about useless Pack pragmas).
1550 Placed_Component : Boolean := False;
1551 -- Set True if we find at least one component with a component
1552 -- clause (used to warn about useless Bit_Order pragmas).
1554 function Check_Allocator (N : Node_Id) return Node_Id;
1555 -- If N is an allocator, possibly wrapped in one or more level of
1556 -- qualified expression(s), return the inner allocator node, else
1559 procedure Check_Itype (Typ : Entity_Id);
1560 -- If the component subtype is an access to a constrained subtype of
1561 -- an already frozen type, make the subtype frozen as well. It might
1562 -- otherwise be frozen in the wrong scope, and a freeze node on
1563 -- subtype has no effect. Similarly, if the component subtype is a
1564 -- regular (not protected) access to subprogram, set the anonymous
1565 -- subprogram type to frozen as well, to prevent an out-of-scope
1566 -- freeze node at some eventual point of call. Protected operations
1567 -- are handled elsewhere.
1569 ---------------------
1570 -- Check_Allocator --
1571 ---------------------
1573 function Check_Allocator (N : Node_Id) return Node_Id is
1578 if Nkind (Inner) = N_Allocator then
1580 elsif Nkind (Inner) = N_Qualified_Expression then
1581 Inner := Expression (Inner);
1586 end Check_Allocator;
1592 procedure Check_Itype (Typ : Entity_Id) is
1593 Desig : constant Entity_Id := Designated_Type (Typ);
1596 if not Is_Frozen (Desig)
1597 and then Is_Frozen (Base_Type (Desig))
1599 Set_Is_Frozen (Desig);
1601 -- In addition, add an Itype_Reference to ensure that the
1602 -- access subtype is elaborated early enough. This cannot be
1603 -- done if the subtype may depend on discriminants.
1605 if Ekind (Comp) = E_Component
1606 and then Is_Itype (Etype (Comp))
1607 and then not Has_Discriminants (Rec)
1609 IR := Make_Itype_Reference (Sloc (Comp));
1610 Set_Itype (IR, Desig);
1613 Result := New_List (IR);
1615 Append (IR, Result);
1619 elsif Ekind (Typ) = E_Anonymous_Access_Subprogram_Type
1620 and then Convention (Desig) /= Convention_Protected
1622 Set_Is_Frozen (Desig);
1626 -- Start of processing for Freeze_Record_Type
1629 -- If this is a subtype of a controlled type, declared without a
1630 -- constraint, the _controller may not appear in the component list
1631 -- if the parent was not frozen at the point of subtype declaration.
1632 -- Inherit the _controller component now.
1634 if Rec /= Base_Type (Rec)
1635 and then Has_Controlled_Component (Rec)
1637 if Nkind (Parent (Rec)) = N_Subtype_Declaration
1638 and then Is_Entity_Name (Subtype_Indication (Parent (Rec)))
1640 Set_First_Entity (Rec, First_Entity (Base_Type (Rec)));
1642 -- If this is an internal type without a declaration, as for
1643 -- record component, the base type may not yet be frozen, and its
1644 -- controller has not been created. Add an explicit freeze node
1645 -- for the itype, so it will be frozen after the base type. This
1646 -- freeze node is used to communicate with the expander, in order
1647 -- to create the controller for the enclosing record, and it is
1648 -- deleted afterwards (see exp_ch3). It must not be created when
1649 -- expansion is off, because it might appear in the wrong context
1650 -- for the back end.
1652 elsif Is_Itype (Rec)
1653 and then Has_Delayed_Freeze (Base_Type (Rec))
1655 Nkind (Associated_Node_For_Itype (Rec)) =
1656 N_Component_Declaration
1657 and then Expander_Active
1659 Ensure_Freeze_Node (Rec);
1663 -- Freeze components and embedded subtypes
1665 Comp := First_Entity (Rec);
1667 while Present (Comp) loop
1669 -- First handle the (real) component case
1671 if Ekind (Comp) = E_Component
1672 or else Ekind (Comp) = E_Discriminant
1675 CC : constant Node_Id := Component_Clause (Comp);
1678 -- Freezing a record type freezes the type of each of its
1679 -- components. However, if the type of the component is
1680 -- part of this record, we do not want or need a separate
1681 -- Freeze_Node. Note that Is_Itype is wrong because that's
1682 -- also set in private type cases. We also can't check for
1683 -- the Scope being exactly Rec because of private types and
1684 -- record extensions.
1686 if Is_Itype (Etype (Comp))
1687 and then Is_Record_Type (Underlying_Type
1688 (Scope (Etype (Comp))))
1690 Undelay_Type (Etype (Comp));
1693 Freeze_And_Append (Etype (Comp), Loc, Result);
1695 -- Check for error of component clause given for variable
1696 -- sized type. We have to delay this test till this point,
1697 -- since the component type has to be frozen for us to know
1698 -- if it is variable length. We omit this test in a generic
1699 -- context, it will be applied at instantiation time.
1701 if Present (CC) then
1702 Placed_Component := True;
1704 if Inside_A_Generic then
1708 Size_Known_At_Compile_Time
1709 (Underlying_Type (Etype (Comp)))
1712 ("component clause not allowed for variable " &
1713 "length component", CC);
1717 Unplaced_Component := True;
1720 -- Case of component requires byte alignment
1722 if Must_Be_On_Byte_Boundary (Etype (Comp)) then
1724 -- Set the enclosing record to also require byte align
1726 Set_Must_Be_On_Byte_Boundary (Rec);
1728 -- Check for component clause that is inconsistent with
1729 -- the required byte boundary alignment.
1732 and then Normalized_First_Bit (Comp) mod
1733 System_Storage_Unit /= 0
1736 ("component & must be byte aligned",
1737 Component_Name (Component_Clause (Comp)));
1741 -- If component clause is present, then deal with the non-
1742 -- default bit order case for Ada 95 mode. The required
1743 -- processing for Ada 2005 mode is handled separately after
1744 -- processing all components.
1746 -- We only do this processing for the base type, and in
1747 -- fact that's important, since otherwise if there are
1748 -- record subtypes, we could reverse the bits once for
1749 -- each subtype, which would be incorrect.
1752 and then Reverse_Bit_Order (Rec)
1753 and then Ekind (E) = E_Record_Type
1754 and then Ada_Version <= Ada_95
1757 CFB : constant Uint := Component_Bit_Offset (Comp);
1758 CSZ : constant Uint := Esize (Comp);
1759 CLC : constant Node_Id := Component_Clause (Comp);
1760 Pos : constant Node_Id := Position (CLC);
1761 FB : constant Node_Id := First_Bit (CLC);
1763 Storage_Unit_Offset : constant Uint :=
1764 CFB / System_Storage_Unit;
1766 Start_Bit : constant Uint :=
1767 CFB mod System_Storage_Unit;
1770 -- Cases where field goes over storage unit boundary
1772 if Start_Bit + CSZ > System_Storage_Unit then
1774 -- Allow multi-byte field but generate warning
1776 if Start_Bit mod System_Storage_Unit = 0
1777 and then CSZ mod System_Storage_Unit = 0
1780 ("multi-byte field specified with non-standard"
1781 & " Bit_Order?", CLC);
1783 if Bytes_Big_Endian then
1785 ("bytes are not reversed "
1786 & "(component is big-endian)?", CLC);
1789 ("bytes are not reversed "
1790 & "(component is little-endian)?", CLC);
1793 -- Do not allow non-contiguous field
1797 ("attempt to specify non-contiguous field"
1798 & " not permitted", CLC);
1800 ("\(caused by non-standard Bit_Order "
1801 & "specified)", CLC);
1804 -- Case where field fits in one storage unit
1807 -- Give warning if suspicious component clause
1809 if Intval (FB) >= System_Storage_Unit
1810 and then Warn_On_Reverse_Bit_Order
1813 ("?Bit_Order clause does not affect " &
1814 "byte ordering", Pos);
1816 Intval (Pos) + Intval (FB) /
1817 System_Storage_Unit;
1819 ("?position normalized to ^ before bit " &
1820 "order interpreted", Pos);
1823 -- Here is where we fix up the Component_Bit_Offset
1824 -- value to account for the reverse bit order.
1825 -- Some examples of what needs to be done are:
1827 -- First_Bit .. Last_Bit Component_Bit_Offset
1830 -- 0 .. 0 7 .. 7 0 7
1831 -- 0 .. 1 6 .. 7 0 6
1832 -- 0 .. 2 5 .. 7 0 5
1833 -- 0 .. 7 0 .. 7 0 4
1835 -- 1 .. 1 6 .. 6 1 6
1836 -- 1 .. 4 3 .. 6 1 3
1837 -- 4 .. 7 0 .. 3 4 0
1839 -- The general rule is that the first bit is
1840 -- is obtained by subtracting the old ending bit
1841 -- from storage_unit - 1.
1843 Set_Component_Bit_Offset
1845 (Storage_Unit_Offset * System_Storage_Unit) +
1846 (System_Storage_Unit - 1) -
1847 (Start_Bit + CSZ - 1));
1849 Set_Normalized_First_Bit
1851 Component_Bit_Offset (Comp) mod
1852 System_Storage_Unit);
1859 -- If the component is an Itype with Delayed_Freeze and is either
1860 -- a record or array subtype and its base type has not yet been
1861 -- frozen, we must remove this from the entity list of this
1862 -- record and put it on the entity list of the scope of its base
1863 -- type. Note that we know that this is not the type of a
1864 -- component since we cleared Has_Delayed_Freeze for it in the
1865 -- previous loop. Thus this must be the Designated_Type of an
1866 -- access type, which is the type of a component.
1869 and then Is_Type (Scope (Comp))
1870 and then Is_Composite_Type (Comp)
1871 and then Base_Type (Comp) /= Comp
1872 and then Has_Delayed_Freeze (Comp)
1873 and then not Is_Frozen (Base_Type (Comp))
1876 Will_Be_Frozen : Boolean := False;
1880 -- We have a pretty bad kludge here. Suppose Rec is subtype
1881 -- being defined in a subprogram that's created as part of
1882 -- the freezing of Rec'Base. In that case, we know that
1883 -- Comp'Base must have already been frozen by the time we
1884 -- get to elaborate this because Gigi doesn't elaborate any
1885 -- bodies until it has elaborated all of the declarative
1886 -- part. But Is_Frozen will not be set at this point because
1887 -- we are processing code in lexical order.
1889 -- We detect this case by going up the Scope chain of Rec
1890 -- and seeing if we have a subprogram scope before reaching
1891 -- the top of the scope chain or that of Comp'Base. If we
1892 -- do, then mark that Comp'Base will actually be frozen. If
1893 -- so, we merely undelay it.
1896 while Present (S) loop
1897 if Is_Subprogram (S) then
1898 Will_Be_Frozen := True;
1900 elsif S = Scope (Base_Type (Comp)) then
1907 if Will_Be_Frozen then
1908 Undelay_Type (Comp);
1910 if Present (Prev) then
1911 Set_Next_Entity (Prev, Next_Entity (Comp));
1913 Set_First_Entity (Rec, Next_Entity (Comp));
1916 -- Insert in entity list of scope of base type (which
1917 -- must be an enclosing scope, because still unfrozen).
1919 Append_Entity (Comp, Scope (Base_Type (Comp)));
1923 -- If the component is an access type with an allocator as default
1924 -- value, the designated type will be frozen by the corresponding
1925 -- expression in init_proc. In order to place the freeze node for
1926 -- the designated type before that for the current record type,
1929 -- Same process if the component is an array of access types,
1930 -- initialized with an aggregate. If the designated type is
1931 -- private, it cannot contain allocators, and it is premature
1932 -- to freeze the type, so we check for this as well.
1934 elsif Is_Access_Type (Etype (Comp))
1935 and then Present (Parent (Comp))
1936 and then Present (Expression (Parent (Comp)))
1939 Alloc : constant Node_Id :=
1940 Check_Allocator (Expression (Parent (Comp)));
1943 if Present (Alloc) then
1945 -- If component is pointer to a classwide type, freeze
1946 -- the specific type in the expression being allocated.
1947 -- The expression may be a subtype indication, in which
1948 -- case freeze the subtype mark.
1950 if Is_Class_Wide_Type
1951 (Designated_Type (Etype (Comp)))
1953 if Is_Entity_Name (Expression (Alloc)) then
1955 (Entity (Expression (Alloc)), Loc, Result);
1957 Nkind (Expression (Alloc)) = N_Subtype_Indication
1960 (Entity (Subtype_Mark (Expression (Alloc))),
1964 elsif Is_Itype (Designated_Type (Etype (Comp))) then
1965 Check_Itype (Etype (Comp));
1969 (Designated_Type (Etype (Comp)), Loc, Result);
1974 elsif Is_Access_Type (Etype (Comp))
1975 and then Is_Itype (Designated_Type (Etype (Comp)))
1977 Check_Itype (Etype (Comp));
1979 elsif Is_Array_Type (Etype (Comp))
1980 and then Is_Access_Type (Component_Type (Etype (Comp)))
1981 and then Present (Parent (Comp))
1982 and then Nkind (Parent (Comp)) = N_Component_Declaration
1983 and then Present (Expression (Parent (Comp)))
1984 and then Nkind (Expression (Parent (Comp))) = N_Aggregate
1985 and then Is_Fully_Defined
1986 (Designated_Type (Component_Type (Etype (Comp))))
1990 (Component_Type (Etype (Comp))), Loc, Result);
1997 -- Deal with pragma Bit_Order
1999 if Reverse_Bit_Order (Rec) and then Base_Type (Rec) = Rec then
2000 if not Placed_Component then
2002 Get_Attribute_Definition_Clause (Rec, Attribute_Bit_Order);
2004 ("?Bit_Order specification has no effect", ADC);
2006 ("\?since no component clauses were specified", ADC);
2008 -- Here is where we do Ada 2005 processing for bit order (the Ada
2009 -- 95 case was already taken care of above).
2011 elsif Ada_Version >= Ada_05 then
2012 Adjust_Record_For_Reverse_Bit_Order (Rec);
2016 -- Set OK_To_Reorder_Components depending on debug flags
2018 if Rec = Base_Type (Rec)
2019 and then Convention (Rec) = Convention_Ada
2021 if (Has_Discriminants (Rec) and then Debug_Flag_Dot_V)
2023 (not Has_Discriminants (Rec) and then Debug_Flag_Dot_R)
2025 Set_OK_To_Reorder_Components (Rec);
2029 -- Check for useless pragma Pack when all components placed. We only
2030 -- do this check for record types, not subtypes, since a subtype may
2031 -- have all its components placed, and it still makes perfectly good
2032 -- sense to pack other subtypes or the parent type. We do not give
2033 -- this warning if Optimize_Alignment is set to Space, since the
2034 -- pragma Pack does have an effect in this case (it always resets
2035 -- the alignment to one).
2037 if Ekind (Rec) = E_Record_Type
2038 and then Is_Packed (Rec)
2039 and then not Unplaced_Component
2040 and then Optimize_Alignment /= 'S'
2042 -- Reset packed status. Probably not necessary, but we do it so
2043 -- that there is no chance of the back end doing something strange
2044 -- with this redundant indication of packing.
2046 Set_Is_Packed (Rec, False);
2048 -- Give warning if redundant constructs warnings on
2050 if Warn_On_Redundant_Constructs then
2052 ("?pragma Pack has no effect, no unplaced components",
2053 Get_Rep_Pragma (Rec, Name_Pack));
2057 -- If this is the record corresponding to a remote type, freeze the
2058 -- remote type here since that is what we are semantically freezing.
2059 -- This prevents the freeze node for that type in an inner scope.
2061 -- Also, Check for controlled components and unchecked unions.
2062 -- Finally, enforce the restriction that access attributes with a
2063 -- current instance prefix can only apply to limited types.
2065 if Ekind (Rec) = E_Record_Type then
2066 if Present (Corresponding_Remote_Type (Rec)) then
2068 (Corresponding_Remote_Type (Rec), Loc, Result);
2071 Comp := First_Component (Rec);
2072 while Present (Comp) loop
2073 if Has_Controlled_Component (Etype (Comp))
2074 or else (Chars (Comp) /= Name_uParent
2075 and then Is_Controlled (Etype (Comp)))
2076 or else (Is_Protected_Type (Etype (Comp))
2078 (Corresponding_Record_Type (Etype (Comp)))
2079 and then Has_Controlled_Component
2080 (Corresponding_Record_Type (Etype (Comp))))
2082 Set_Has_Controlled_Component (Rec);
2086 if Has_Unchecked_Union (Etype (Comp)) then
2087 Set_Has_Unchecked_Union (Rec);
2090 if Has_Per_Object_Constraint (Comp) then
2092 -- Scan component declaration for likely misuses of current
2093 -- instance, either in a constraint or a default expression.
2095 Check_Current_Instance (Parent (Comp));
2098 Next_Component (Comp);
2102 Set_Component_Alignment_If_Not_Set (Rec);
2104 -- For first subtypes, check if there are any fixed-point fields with
2105 -- component clauses, where we must check the size. This is not done
2106 -- till the freeze point, since for fixed-point types, we do not know
2107 -- the size until the type is frozen. Similar processing applies to
2108 -- bit packed arrays.
2110 if Is_First_Subtype (Rec) then
2111 Comp := First_Component (Rec);
2113 while Present (Comp) loop
2114 if Present (Component_Clause (Comp))
2115 and then (Is_Fixed_Point_Type (Etype (Comp))
2117 Is_Bit_Packed_Array (Etype (Comp)))
2120 (Component_Name (Component_Clause (Comp)),
2126 Next_Component (Comp);
2130 -- Generate warning for applying C or C++ convention to a record
2131 -- with discriminants. This is suppressed for the unchecked union
2132 -- case, since the whole point in this case is interface C. We also
2133 -- do not generate this within instantiations, since we will have
2134 -- generated a message on the template.
2136 if Has_Discriminants (E)
2137 and then not Is_Unchecked_Union (E)
2138 and then (Convention (E) = Convention_C
2140 Convention (E) = Convention_CPP)
2141 and then Comes_From_Source (E)
2142 and then not In_Instance
2143 and then not Has_Warnings_Off (E)
2144 and then not Has_Warnings_Off (Base_Type (E))
2147 Cprag : constant Node_Id := Get_Rep_Pragma (E, Name_Convention);
2151 if Present (Cprag) then
2152 A2 := Next (First (Pragma_Argument_Associations (Cprag)));
2154 if Convention (E) = Convention_C then
2156 ("?variant record has no direct equivalent in C", A2);
2159 ("?variant record has no direct equivalent in C++", A2);
2163 ("\?use of convention for type& is dubious", A2, E);
2167 end Freeze_Record_Type;
2169 -- Start of processing for Freeze_Entity
2172 -- We are going to test for various reasons why this entity need not be
2173 -- frozen here, but in the case of an Itype that's defined within a
2174 -- record, that test actually applies to the record.
2176 if Is_Itype (E) and then Is_Record_Type (Scope (E)) then
2177 Test_E := Scope (E);
2178 elsif Is_Itype (E) and then Present (Underlying_Type (Scope (E)))
2179 and then Is_Record_Type (Underlying_Type (Scope (E)))
2181 Test_E := Underlying_Type (Scope (E));
2184 -- Do not freeze if already frozen since we only need one freeze node
2186 if Is_Frozen (E) then
2189 -- It is improper to freeze an external entity within a generic because
2190 -- its freeze node will appear in a non-valid context. The entity will
2191 -- be frozen in the proper scope after the current generic is analyzed.
2193 elsif Inside_A_Generic and then External_Ref_In_Generic (Test_E) then
2196 -- Do not freeze a global entity within an inner scope created during
2197 -- expansion. A call to subprogram E within some internal procedure
2198 -- (a stream attribute for example) might require freezing E, but the
2199 -- freeze node must appear in the same declarative part as E itself.
2200 -- The two-pass elaboration mechanism in gigi guarantees that E will
2201 -- be frozen before the inner call is elaborated. We exclude constants
2202 -- from this test, because deferred constants may be frozen early, and
2203 -- must be diagnosed (e.g. in the case of a deferred constant being used
2204 -- in a default expression). If the enclosing subprogram comes from
2205 -- source, or is a generic instance, then the freeze point is the one
2206 -- mandated by the language, and we freeze the entity. A subprogram that
2207 -- is a child unit body that acts as a spec does not have a spec that
2208 -- comes from source, but can only come from source.
2210 elsif In_Open_Scopes (Scope (Test_E))
2211 and then Scope (Test_E) /= Current_Scope
2212 and then Ekind (Test_E) /= E_Constant
2215 S : Entity_Id := Current_Scope;
2218 while Present (S) loop
2219 if Is_Overloadable (S) then
2220 if Comes_From_Source (S)
2221 or else Is_Generic_Instance (S)
2222 or else Is_Child_Unit (S)
2234 -- Similarly, an inlined instance body may make reference to global
2235 -- entities, but these references cannot be the proper freezing point
2236 -- for them, and in the absence of inlining freezing will take place in
2237 -- their own scope. Normally instance bodies are analyzed after the
2238 -- enclosing compilation, and everything has been frozen at the proper
2239 -- place, but with front-end inlining an instance body is compiled
2240 -- before the end of the enclosing scope, and as a result out-of-order
2241 -- freezing must be prevented.
2243 elsif Front_End_Inlining
2244 and then In_Instance_Body
2245 and then Present (Scope (Test_E))
2248 S : Entity_Id := Scope (Test_E);
2251 while Present (S) loop
2252 if Is_Generic_Instance (S) then
2265 -- Here to freeze the entity
2270 -- Case of entity being frozen is other than a type
2272 if not Is_Type (E) then
2274 -- If entity is exported or imported and does not have an external
2275 -- name, now is the time to provide the appropriate default name.
2276 -- Skip this if the entity is stubbed, since we don't need a name
2277 -- for any stubbed routine.
2279 if (Is_Imported (E) or else Is_Exported (E))
2280 and then No (Interface_Name (E))
2281 and then Convention (E) /= Convention_Stubbed
2283 Set_Encoded_Interface_Name
2284 (E, Get_Default_External_Name (E));
2286 -- Special processing for atomic objects appearing in object decls
2289 and then Nkind (Parent (E)) = N_Object_Declaration
2290 and then Present (Expression (Parent (E)))
2293 Expr : constant Node_Id := Expression (Parent (E));
2296 -- If expression is an aggregate, assign to a temporary to
2297 -- ensure that the actual assignment is done atomically rather
2298 -- than component-wise (the assignment to the temp may be done
2299 -- component-wise, but that is harmless).
2301 if Nkind (Expr) = N_Aggregate then
2302 Expand_Atomic_Aggregate (Expr, Etype (E));
2304 -- If the expression is a reference to a record or array object
2305 -- entity, then reset Is_True_Constant to False so that the
2306 -- compiler will not optimize away the intermediate object,
2307 -- which we need in this case for the same reason (to ensure
2308 -- that the actual assignment is atomic, rather than
2311 elsif Is_Entity_Name (Expr)
2312 and then (Is_Record_Type (Etype (Expr))
2314 Is_Array_Type (Etype (Expr)))
2316 Set_Is_True_Constant (Entity (Expr), False);
2321 -- For a subprogram, freeze all parameter types and also the return
2322 -- type (RM 13.14(14)). However skip this for internal subprograms.
2323 -- This is also the point where any extra formal parameters are
2324 -- created since we now know whether the subprogram will use
2325 -- a foreign convention.
2327 if Is_Subprogram (E) then
2328 if not Is_Internal (E) then
2332 Warn_Node : Node_Id;
2335 -- Loop through formals
2337 Formal := First_Formal (E);
2338 while Present (Formal) loop
2339 F_Type := Etype (Formal);
2340 Freeze_And_Append (F_Type, Loc, Result);
2342 if Is_Private_Type (F_Type)
2343 and then Is_Private_Type (Base_Type (F_Type))
2344 and then No (Full_View (Base_Type (F_Type)))
2345 and then not Is_Generic_Type (F_Type)
2346 and then not Is_Derived_Type (F_Type)
2348 -- If the type of a formal is incomplete, subprogram
2349 -- is being frozen prematurely. Within an instance
2350 -- (but not within a wrapper package) this is an
2351 -- an artifact of our need to regard the end of an
2352 -- instantiation as a freeze point. Otherwise it is
2353 -- a definite error.
2355 -- and then not Is_Wrapper_Package (Current_Scope) ???
2358 Set_Is_Frozen (E, False);
2361 elsif not After_Last_Declaration
2362 and then not Freezing_Library_Level_Tagged_Type
2364 Error_Msg_Node_1 := F_Type;
2366 ("type& must be fully defined before this point",
2371 -- Check suspicious parameter for C function. These tests
2372 -- apply only to exported/imported subprograms.
2374 if Warn_On_Export_Import
2375 and then Comes_From_Source (E)
2376 and then (Convention (E) = Convention_C
2378 Convention (E) = Convention_CPP)
2379 and then (Is_Imported (E) or else Is_Exported (E))
2380 and then Convention (E) /= Convention (Formal)
2381 and then not Has_Warnings_Off (E)
2382 and then not Has_Warnings_Off (F_Type)
2383 and then not Has_Warnings_Off (Formal)
2385 Error_Msg_Qual_Level := 1;
2387 -- Check suspicious use of fat C pointer
2389 if Is_Access_Type (F_Type)
2390 and then Esize (F_Type) > Ttypes.System_Address_Size
2393 ("?type of & does not correspond "
2394 & "to C pointer!", Formal);
2396 -- Check suspicious return of boolean
2398 elsif Root_Type (F_Type) = Standard_Boolean
2399 and then Convention (F_Type) = Convention_Ada
2402 ("?& is an 8-bit Ada Boolean, "
2403 & "use char in C!", Formal);
2405 -- Check suspicious tagged type
2407 elsif (Is_Tagged_Type (F_Type)
2408 or else (Is_Access_Type (F_Type)
2411 (Designated_Type (F_Type))))
2412 and then Convention (E) = Convention_C
2415 ("?& is a tagged type which does not "
2416 & "correspond to any C type!", Formal);
2418 -- Check wrong convention subprogram pointer
2420 elsif Ekind (F_Type) = E_Access_Subprogram_Type
2421 and then not Has_Foreign_Convention (F_Type)
2424 ("?subprogram pointer & should "
2425 & "have foreign convention!", Formal);
2426 Error_Msg_Sloc := Sloc (F_Type);
2428 ("\?add Convention pragma to declaration of &#",
2432 Error_Msg_Qual_Level := 0;
2435 -- Check for unconstrained array in exported foreign
2438 if Has_Foreign_Convention (E)
2439 and then not Is_Imported (E)
2440 and then Is_Array_Type (F_Type)
2441 and then not Is_Constrained (F_Type)
2442 and then Warn_On_Export_Import
2444 Error_Msg_Qual_Level := 1;
2446 -- If this is an inherited operation, place the
2447 -- warning on the derived type declaration, rather
2448 -- than on the original subprogram.
2450 if Nkind (Original_Node (Parent (E))) =
2451 N_Full_Type_Declaration
2453 Warn_Node := Parent (E);
2455 if Formal = First_Formal (E) then
2457 ("?in inherited operation&", Warn_Node, E);
2460 Warn_Node := Formal;
2464 ("?type of argument& is unconstrained array",
2467 ("?foreign caller must pass bounds explicitly",
2469 Error_Msg_Qual_Level := 0;
2472 -- Ada 2005 (AI-326): Check wrong use of tag incomplete
2473 -- types with unknown discriminants. For example:
2475 -- type T (<>) is tagged;
2476 -- procedure P (X : access T); -- ERROR
2477 -- procedure P (X : T); -- ERROR
2479 if not From_With_Type (F_Type) then
2480 if Is_Access_Type (F_Type) then
2481 F_Type := Designated_Type (F_Type);
2484 if Ekind (F_Type) = E_Incomplete_Type
2485 and then Is_Tagged_Type (F_Type)
2486 and then not Is_Class_Wide_Type (F_Type)
2487 and then No (Full_View (F_Type))
2488 and then Unknown_Discriminants_Present
2490 and then No (Stored_Constraint (F_Type))
2493 ("(Ada 2005): invalid use of unconstrained tagged"
2494 & " incomplete type", E);
2496 -- If the formal is an anonymous_access_to_subprogram
2497 -- freeze the subprogram type as well, to prevent
2498 -- scope anomalies in gigi, because there is no other
2499 -- clear point at which it could be frozen.
2501 elsif Is_Itype (Etype (Formal))
2502 and then Ekind (F_Type) = E_Subprogram_Type
2504 Freeze_And_Append (F_Type, Loc, Result);
2508 Next_Formal (Formal);
2513 if Ekind (E) = E_Function then
2515 -- Freeze return type
2517 R_Type := Etype (E);
2518 Freeze_And_Append (R_Type, Loc, Result);
2520 -- Check suspicious return type for C function
2522 if Warn_On_Export_Import
2523 and then (Convention (E) = Convention_C
2525 Convention (E) = Convention_CPP)
2526 and then (Is_Imported (E) or else Is_Exported (E))
2528 -- Check suspicious return of fat C pointer
2530 if Is_Access_Type (R_Type)
2531 and then Esize (R_Type) > Ttypes.System_Address_Size
2532 and then not Has_Warnings_Off (E)
2533 and then not Has_Warnings_Off (R_Type)
2536 ("?return type of& does not "
2537 & "correspond to C pointer!", E);
2539 -- Check suspicious return of boolean
2541 elsif Root_Type (R_Type) = Standard_Boolean
2542 and then Convention (R_Type) = Convention_Ada
2543 and then not Has_Warnings_Off (E)
2544 and then not Has_Warnings_Off (R_Type)
2547 ("?return type of & is an 8-bit "
2548 & "Ada Boolean, use char in C!", E);
2550 -- Check suspicious return tagged type
2552 elsif (Is_Tagged_Type (R_Type)
2553 or else (Is_Access_Type (R_Type)
2556 (Designated_Type (R_Type))))
2557 and then Convention (E) = Convention_C
2558 and then not Has_Warnings_Off (E)
2559 and then not Has_Warnings_Off (R_Type)
2562 ("?return type of & does not "
2563 & "correspond to C type!", E);
2565 -- Check return of wrong convention subprogram pointer
2567 elsif Ekind (R_Type) = E_Access_Subprogram_Type
2568 and then not Has_Foreign_Convention (R_Type)
2569 and then not Has_Warnings_Off (E)
2570 and then not Has_Warnings_Off (R_Type)
2573 ("?& should return a foreign "
2574 & "convention subprogram pointer", E);
2575 Error_Msg_Sloc := Sloc (R_Type);
2577 ("\?add Convention pragma to declaration of& #",
2582 if Is_Array_Type (Etype (E))
2583 and then not Is_Constrained (Etype (E))
2584 and then not Is_Imported (E)
2585 and then Has_Foreign_Convention (E)
2586 and then Warn_On_Export_Import
2587 and then not Has_Warnings_Off (E)
2588 and then not Has_Warnings_Off (Etype (E))
2591 ("?foreign convention function& should not " &
2592 "return unconstrained array!", E);
2594 -- Ada 2005 (AI-326): Check wrong use of tagged
2597 -- type T is tagged;
2598 -- function F (X : Boolean) return T; -- ERROR
2600 elsif Ekind (Etype (E)) = E_Incomplete_Type
2601 and then Is_Tagged_Type (Etype (E))
2602 and then No (Full_View (Etype (E)))
2603 and then not Is_Value_Type (Etype (E))
2606 ("(Ada 2005): invalid use of tagged incomplete type",
2613 -- Must freeze its parent first if it is a derived subprogram
2615 if Present (Alias (E)) then
2616 Freeze_And_Append (Alias (E), Loc, Result);
2619 -- We don't freeze internal subprograms, because we don't normally
2620 -- want addition of extra formals or mechanism setting to happen
2621 -- for those. However we do pass through predefined dispatching
2622 -- cases, since extra formals may be needed in some cases, such as
2623 -- for the stream 'Input function (build-in-place formals).
2625 if not Is_Internal (E)
2626 or else Is_Predefined_Dispatching_Operation (E)
2628 Freeze_Subprogram (E);
2631 -- Here for other than a subprogram or type
2634 -- If entity has a type, and it is not a generic unit, then
2635 -- freeze it first (RM 13.14(10)).
2637 if Present (Etype (E))
2638 and then Ekind (E) /= E_Generic_Function
2640 Freeze_And_Append (Etype (E), Loc, Result);
2643 -- Special processing for objects created by object declaration
2645 if Nkind (Declaration_Node (E)) = N_Object_Declaration then
2647 -- For object created by object declaration, perform required
2648 -- categorization (preelaborate and pure) checks. Defer these
2649 -- checks to freeze time since pragma Import inhibits default
2650 -- initialization and thus pragma Import affects these checks.
2652 Validate_Object_Declaration (Declaration_Node (E));
2654 -- If there is an address clause, check it is valid
2656 Check_Address_Clause (E);
2658 -- For imported objects, set Is_Public unless there is also an
2659 -- address clause, which means that there is no external symbol
2660 -- needed for the Import (Is_Public may still be set for other
2661 -- unrelated reasons). Note that we delayed this processing
2662 -- till freeze time so that we can be sure not to set the flag
2663 -- if there is an address clause. If there is such a clause,
2664 -- then the only purpose of the Import pragma is to suppress
2665 -- implicit initialization.
2668 and then No (Address_Clause (E))
2673 -- For convention C objects of an enumeration type, warn if
2674 -- the size is not integer size and no explicit size given.
2675 -- Skip warning for Boolean, and Character, assume programmer
2676 -- expects 8-bit sizes for these cases.
2678 if (Convention (E) = Convention_C
2680 Convention (E) = Convention_CPP)
2681 and then Is_Enumeration_Type (Etype (E))
2682 and then not Is_Character_Type (Etype (E))
2683 and then not Is_Boolean_Type (Etype (E))
2684 and then Esize (Etype (E)) < Standard_Integer_Size
2685 and then not Has_Size_Clause (E)
2687 Error_Msg_Uint_1 := UI_From_Int (Standard_Integer_Size);
2689 ("?convention C enumeration object has size less than ^",
2691 Error_Msg_N ("\?use explicit size clause to set size", E);
2695 -- Check that a constant which has a pragma Volatile[_Components]
2696 -- or Atomic[_Components] also has a pragma Import (RM C.6(13)).
2698 -- Note: Atomic[_Components] also sets Volatile[_Components]
2700 if Ekind (E) = E_Constant
2701 and then (Has_Volatile_Components (E) or else Is_Volatile (E))
2702 and then not Is_Imported (E)
2704 -- Make sure we actually have a pragma, and have not merely
2705 -- inherited the indication from elsewhere (e.g. an address
2706 -- clause, which is not good enough in RM terms!)
2708 if Has_Rep_Pragma (E, Name_Atomic)
2710 Has_Rep_Pragma (E, Name_Atomic_Components)
2713 ("stand alone atomic constant must be " &
2714 "imported (RM C.6(13))", E);
2716 elsif Has_Rep_Pragma (E, Name_Volatile)
2718 Has_Rep_Pragma (E, Name_Volatile_Components)
2721 ("stand alone volatile constant must be " &
2722 "imported (RM C.6(13))", E);
2726 -- Static objects require special handling
2728 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
2729 and then Is_Statically_Allocated (E)
2731 Freeze_Static_Object (E);
2734 -- Remaining step is to layout objects
2736 if Ekind (E) = E_Variable
2738 Ekind (E) = E_Constant
2740 Ekind (E) = E_Loop_Parameter
2748 -- Case of a type or subtype being frozen
2751 -- We used to check here that a full type must have preelaborable
2752 -- initialization if it completes a private type specified with
2753 -- pragma Preelaborable_Intialization, but that missed cases where
2754 -- the types occur within a generic package, since the freezing
2755 -- that occurs within a containing scope generally skips traversal
2756 -- of a generic unit's declarations (those will be frozen within
2757 -- instances). This check was moved to Analyze_Package_Specification.
2759 -- The type may be defined in a generic unit. This can occur when
2760 -- freezing a generic function that returns the type (which is
2761 -- defined in a parent unit). It is clearly meaningless to freeze
2762 -- this type. However, if it is a subtype, its size may be determi-
2763 -- nable and used in subsequent checks, so might as well try to
2766 if Present (Scope (E))
2767 and then Is_Generic_Unit (Scope (E))
2769 Check_Compile_Time_Size (E);
2773 -- Deal with special cases of freezing for subtype
2775 if E /= Base_Type (E) then
2777 -- Before we do anything else, a specialized test for the case of
2778 -- a size given for an array where the array needs to be packed,
2779 -- but was not so the size cannot be honored. This would of course
2780 -- be caught by the backend, and indeed we don't catch all cases.
2781 -- The point is that we can give a better error message in those
2782 -- cases that we do catch with the circuitry here. Also if pragma
2783 -- Implicit_Packing is set, this is where the packing occurs.
2785 -- The reason we do this so early is that the processing in the
2786 -- automatic packing case affects the layout of the base type, so
2787 -- it must be done before we freeze the base type.
2789 if Is_Array_Type (E) then
2792 Ctyp : constant Entity_Id := Component_Type (E);
2795 -- Check enabling conditions. These are straightforward
2796 -- except for the test for a limited composite type. This
2797 -- eliminates the rare case of a array of limited components
2798 -- where there are issues of whether or not we can go ahead
2799 -- and pack the array (since we can't freely pack and unpack
2800 -- arrays if they are limited).
2802 -- Note that we check the root type explicitly because the
2803 -- whole point is we are doing this test before we have had
2804 -- a chance to freeze the base type (and it is that freeze
2805 -- action that causes stuff to be inherited).
2807 if Present (Size_Clause (E))
2808 and then Known_Static_Esize (E)
2809 and then not Is_Packed (E)
2810 and then not Has_Pragma_Pack (E)
2811 and then Number_Dimensions (E) = 1
2812 and then not Has_Component_Size_Clause (E)
2813 and then Known_Static_Esize (Ctyp)
2814 and then not Is_Limited_Composite (E)
2815 and then not Is_Packed (Root_Type (E))
2816 and then not Has_Component_Size_Clause (Root_Type (E))
2818 Get_Index_Bounds (First_Index (E), Lo, Hi);
2820 if Compile_Time_Known_Value (Lo)
2821 and then Compile_Time_Known_Value (Hi)
2822 and then Known_Static_RM_Size (Ctyp)
2823 and then RM_Size (Ctyp) < 64
2826 Lov : constant Uint := Expr_Value (Lo);
2827 Hiv : constant Uint := Expr_Value (Hi);
2828 Len : constant Uint := UI_Max
2831 Rsiz : constant Uint := RM_Size (Ctyp);
2832 SZ : constant Node_Id := Size_Clause (E);
2833 Btyp : constant Entity_Id := Base_Type (E);
2835 -- What we are looking for here is the situation where
2836 -- the RM_Size given would be exactly right if there
2837 -- was a pragma Pack (resulting in the component size
2838 -- being the same as the RM_Size). Furthermore, the
2839 -- component type size must be an odd size (not a
2840 -- multiple of storage unit)
2843 if RM_Size (E) = Len * Rsiz
2844 and then Rsiz mod System_Storage_Unit /= 0
2846 -- For implicit packing mode, just set the
2847 -- component size silently
2849 if Implicit_Packing then
2850 Set_Component_Size (Btyp, Rsiz);
2851 Set_Is_Bit_Packed_Array (Btyp);
2852 Set_Is_Packed (Btyp);
2853 Set_Has_Non_Standard_Rep (Btyp);
2855 -- Otherwise give an error message
2859 ("size given for& too small", SZ, E);
2861 ("\use explicit pragma Pack "
2862 & "or use pragma Implicit_Packing", SZ);
2871 -- If ancestor subtype present, freeze that first. Note that this
2872 -- will also get the base type frozen.
2874 Atype := Ancestor_Subtype (E);
2876 if Present (Atype) then
2877 Freeze_And_Append (Atype, Loc, Result);
2879 -- Otherwise freeze the base type of the entity before freezing
2880 -- the entity itself (RM 13.14(15)).
2882 elsif E /= Base_Type (E) then
2883 Freeze_And_Append (Base_Type (E), Loc, Result);
2886 -- For a derived type, freeze its parent type first (RM 13.14(15))
2888 elsif Is_Derived_Type (E) then
2889 Freeze_And_Append (Etype (E), Loc, Result);
2890 Freeze_And_Append (First_Subtype (Etype (E)), Loc, Result);
2893 -- For array type, freeze index types and component type first
2894 -- before freezing the array (RM 13.14(15)).
2896 if Is_Array_Type (E) then
2898 Ctyp : constant Entity_Id := Component_Type (E);
2900 Non_Standard_Enum : Boolean := False;
2901 -- Set true if any of the index types is an enumeration type
2902 -- with a non-standard representation.
2905 Freeze_And_Append (Ctyp, Loc, Result);
2907 Indx := First_Index (E);
2908 while Present (Indx) loop
2909 Freeze_And_Append (Etype (Indx), Loc, Result);
2911 if Is_Enumeration_Type (Etype (Indx))
2912 and then Has_Non_Standard_Rep (Etype (Indx))
2914 Non_Standard_Enum := True;
2920 -- Processing that is done only for base types
2922 if Ekind (E) = E_Array_Type then
2924 -- Propagate flags for component type
2926 if Is_Controlled (Component_Type (E))
2927 or else Has_Controlled_Component (Ctyp)
2929 Set_Has_Controlled_Component (E);
2932 if Has_Unchecked_Union (Component_Type (E)) then
2933 Set_Has_Unchecked_Union (E);
2936 -- If packing was requested or if the component size was set
2937 -- explicitly, then see if bit packing is required. This
2938 -- processing is only done for base types, since all the
2939 -- representation aspects involved are type-related. This
2940 -- is not just an optimization, if we start processing the
2941 -- subtypes, they interfere with the settings on the base
2942 -- type (this is because Is_Packed has a slightly different
2943 -- meaning before and after freezing).
2950 if (Is_Packed (E) or else Has_Pragma_Pack (E))
2951 and then not Has_Atomic_Components (E)
2952 and then Known_Static_RM_Size (Ctyp)
2954 Csiz := UI_Max (RM_Size (Ctyp), 1);
2956 elsif Known_Component_Size (E) then
2957 Csiz := Component_Size (E);
2959 elsif not Known_Static_Esize (Ctyp) then
2963 Esiz := Esize (Ctyp);
2965 -- We can set the component size if it is less than
2966 -- 16, rounding it up to the next storage unit size.
2970 elsif Esiz <= 16 then
2976 -- Set component size up to match alignment if it
2977 -- would otherwise be less than the alignment. This
2978 -- deals with cases of types whose alignment exceeds
2979 -- their size (padded types).
2983 A : constant Uint := Alignment_In_Bits (Ctyp);
2992 -- Case of component size that may result in packing
2994 if 1 <= Csiz and then Csiz <= 64 then
2996 Ent : constant Entity_Id :=
2998 Pack_Pragma : constant Node_Id :=
2999 Get_Rep_Pragma (Ent, Name_Pack);
3000 Comp_Size_C : constant Node_Id :=
3001 Get_Attribute_Definition_Clause
3002 (Ent, Attribute_Component_Size);
3004 -- Warn if we have pack and component size so that
3005 -- the pack is ignored.
3007 -- Note: here we must check for the presence of a
3008 -- component size before checking for a Pack pragma
3009 -- to deal with the case where the array type is a
3010 -- derived type whose parent is currently private.
3012 if Present (Comp_Size_C)
3013 and then Has_Pragma_Pack (Ent)
3015 Error_Msg_Sloc := Sloc (Comp_Size_C);
3017 ("?pragma Pack for& ignored!",
3020 ("\?explicit component size given#!",
3024 -- Set component size if not already set by a
3025 -- component size clause.
3027 if not Present (Comp_Size_C) then
3028 Set_Component_Size (E, Csiz);
3031 -- Check for base type of 8, 16, 32 bits, where an
3032 -- unsigned subtype has a length one less than the
3033 -- base type (e.g. Natural subtype of Integer).
3035 -- In such cases, if a component size was not set
3036 -- explicitly, then generate a warning.
3038 if Has_Pragma_Pack (E)
3039 and then not Present (Comp_Size_C)
3041 (Csiz = 7 or else Csiz = 15 or else Csiz = 31)
3042 and then Esize (Base_Type (Ctyp)) = Csiz + 1
3044 Error_Msg_Uint_1 := Csiz;
3046 if Present (Pack_Pragma) then
3048 ("?pragma Pack causes component size "
3049 & "to be ^!", Pack_Pragma);
3051 ("\?use Component_Size to set "
3052 & "desired value!", Pack_Pragma);
3056 -- Actual packing is not needed for 8, 16, 32, 64.
3057 -- Also not needed for 24 if alignment is 1.
3063 or else (Csiz = 24 and then Alignment (Ctyp) = 1)
3065 -- Here the array was requested to be packed,
3066 -- but the packing request had no effect, so
3067 -- Is_Packed is reset.
3069 -- Note: semantically this means that we lose
3070 -- track of the fact that a derived type
3071 -- inherited a pragma Pack that was non-
3072 -- effective, but that seems fine.
3074 -- We regard a Pack pragma as a request to set
3075 -- a representation characteristic, and this
3076 -- request may be ignored.
3078 Set_Is_Packed (Base_Type (E), False);
3080 -- In all other cases, packing is indeed needed
3083 Set_Has_Non_Standard_Rep (Base_Type (E));
3084 Set_Is_Bit_Packed_Array (Base_Type (E));
3085 Set_Is_Packed (Base_Type (E));
3091 -- Processing that is done only for subtypes
3094 -- Acquire alignment from base type
3096 if Unknown_Alignment (E) then
3097 Set_Alignment (E, Alignment (Base_Type (E)));
3098 Adjust_Esize_Alignment (E);
3102 -- For bit-packed arrays, check the size
3104 if Is_Bit_Packed_Array (E)
3105 and then Known_RM_Size (E)
3108 SizC : constant Node_Id := Size_Clause (E);
3111 pragma Warnings (Off, Discard);
3114 -- It is not clear if it is possible to have no size
3115 -- clause at this stage, but it is not worth worrying
3116 -- about. Post error on the entity name in the size
3117 -- clause if present, else on the type entity itself.
3119 if Present (SizC) then
3120 Check_Size (Name (SizC), E, RM_Size (E), Discard);
3122 Check_Size (E, E, RM_Size (E), Discard);
3127 -- If any of the index types was an enumeration type with
3128 -- a non-standard rep clause, then we indicate that the
3129 -- array type is always packed (even if it is not bit packed).
3131 if Non_Standard_Enum then
3132 Set_Has_Non_Standard_Rep (Base_Type (E));
3133 Set_Is_Packed (Base_Type (E));
3136 Set_Component_Alignment_If_Not_Set (E);
3138 -- If the array is packed, we must create the packed array
3139 -- type to be used to actually implement the type. This is
3140 -- only needed for real array types (not for string literal
3141 -- types, since they are present only for the front end).
3144 and then Ekind (E) /= E_String_Literal_Subtype
3146 Create_Packed_Array_Type (E);
3147 Freeze_And_Append (Packed_Array_Type (E), Loc, Result);
3149 -- Size information of packed array type is copied to the
3150 -- array type, since this is really the representation. But
3151 -- do not override explicit existing size values. If the
3152 -- ancestor subtype is constrained the packed_array_type
3153 -- will be inherited from it, but the size may have been
3154 -- provided already, and must not be overridden either.
3156 if not Has_Size_Clause (E)
3158 (No (Ancestor_Subtype (E))
3159 or else not Has_Size_Clause (Ancestor_Subtype (E)))
3161 Set_Esize (E, Esize (Packed_Array_Type (E)));
3162 Set_RM_Size (E, RM_Size (Packed_Array_Type (E)));
3165 if not Has_Alignment_Clause (E) then
3166 Set_Alignment (E, Alignment (Packed_Array_Type (E)));
3170 -- For non-packed arrays set the alignment of the array to the
3171 -- alignment of the component type if it is unknown. Skip this
3172 -- in atomic case (atomic arrays may need larger alignments).
3174 if not Is_Packed (E)
3175 and then Unknown_Alignment (E)
3176 and then Known_Alignment (Ctyp)
3177 and then Known_Static_Component_Size (E)
3178 and then Known_Static_Esize (Ctyp)
3179 and then Esize (Ctyp) = Component_Size (E)
3180 and then not Is_Atomic (E)
3182 Set_Alignment (E, Alignment (Component_Type (E)));
3186 -- For a class-wide type, the corresponding specific type is
3187 -- frozen as well (RM 13.14(15))
3189 elsif Is_Class_Wide_Type (E) then
3190 Freeze_And_Append (Root_Type (E), Loc, Result);
3192 -- If the base type of the class-wide type is still incomplete,
3193 -- the class-wide remains unfrozen as well. This is legal when
3194 -- E is the formal of a primitive operation of some other type
3195 -- which is being frozen.
3197 if not Is_Frozen (Root_Type (E)) then
3198 Set_Is_Frozen (E, False);
3202 -- If the Class_Wide_Type is an Itype (when type is the anonymous
3203 -- parent of a derived type) and it is a library-level entity,
3204 -- generate an itype reference for it. Otherwise, its first
3205 -- explicit reference may be in an inner scope, which will be
3206 -- rejected by the back-end.
3209 and then Is_Compilation_Unit (Scope (E))
3212 Ref : constant Node_Id := Make_Itype_Reference (Loc);
3217 Result := New_List (Ref);
3219 Append (Ref, Result);
3224 -- The equivalent type associated with a class-wide subtype needs
3225 -- to be frozen to ensure that its layout is done. Class-wide
3226 -- subtypes are currently only frozen on targets requiring
3227 -- front-end layout (see New_Class_Wide_Subtype and
3228 -- Make_CW_Equivalent_Type in exp_util.adb).
3230 if Ekind (E) = E_Class_Wide_Subtype
3231 and then Present (Equivalent_Type (E))
3233 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3236 -- For a record (sub)type, freeze all the component types (RM
3237 -- 13.14(15). We test for E_Record_(sub)Type here, rather than using
3238 -- Is_Record_Type, because we don't want to attempt the freeze for
3239 -- the case of a private type with record extension (we will do that
3240 -- later when the full type is frozen).
3242 elsif Ekind (E) = E_Record_Type
3243 or else Ekind (E) = E_Record_Subtype
3245 Freeze_Record_Type (E);
3247 -- For a concurrent type, freeze corresponding record type. This
3248 -- does not correspond to any specific rule in the RM, but the
3249 -- record type is essentially part of the concurrent type.
3250 -- Freeze as well all local entities. This includes record types
3251 -- created for entry parameter blocks, and whatever local entities
3252 -- may appear in the private part.
3254 elsif Is_Concurrent_Type (E) then
3255 if Present (Corresponding_Record_Type (E)) then
3257 (Corresponding_Record_Type (E), Loc, Result);
3260 Comp := First_Entity (E);
3262 while Present (Comp) loop
3263 if Is_Type (Comp) then
3264 Freeze_And_Append (Comp, Loc, Result);
3266 elsif (Ekind (Comp)) /= E_Function then
3267 if Is_Itype (Etype (Comp))
3268 and then Underlying_Type (Scope (Etype (Comp))) = E
3270 Undelay_Type (Etype (Comp));
3273 Freeze_And_Append (Etype (Comp), Loc, Result);
3279 -- Private types are required to point to the same freeze node as
3280 -- their corresponding full views. The freeze node itself has to
3281 -- point to the partial view of the entity (because from the partial
3282 -- view, we can retrieve the full view, but not the reverse).
3283 -- However, in order to freeze correctly, we need to freeze the full
3284 -- view. If we are freezing at the end of a scope (or within the
3285 -- scope of the private type), the partial and full views will have
3286 -- been swapped, the full view appears first in the entity chain and
3287 -- the swapping mechanism ensures that the pointers are properly set
3290 -- If we encounter the partial view before the full view (e.g. when
3291 -- freezing from another scope), we freeze the full view, and then
3292 -- set the pointers appropriately since we cannot rely on swapping to
3293 -- fix things up (subtypes in an outer scope might not get swapped).
3295 elsif Is_Incomplete_Or_Private_Type (E)
3296 and then not Is_Generic_Type (E)
3298 -- The construction of the dispatch table associated with library
3299 -- level tagged types forces freezing of all the primitives of the
3300 -- type, which may cause premature freezing of the partial view.
3304 -- type T is tagged private;
3305 -- type DT is new T with private;
3306 -- procedure Prim (X : in out T; Y : in out DT'class);
3308 -- type T is tagged null record;
3310 -- type DT is new T with null record;
3313 -- In this case the type will be frozen later by the usual
3314 -- mechanism: an object declaration, an instantiation, or the
3315 -- end of a declarative part.
3317 if Is_Library_Level_Tagged_Type (E)
3318 and then not Present (Full_View (E))
3320 Set_Is_Frozen (E, False);
3323 -- Case of full view present
3325 elsif Present (Full_View (E)) then
3327 -- If full view has already been frozen, then no further
3328 -- processing is required
3330 if Is_Frozen (Full_View (E)) then
3332 Set_Has_Delayed_Freeze (E, False);
3333 Set_Freeze_Node (E, Empty);
3334 Check_Debug_Info_Needed (E);
3336 -- Otherwise freeze full view and patch the pointers so that
3337 -- the freeze node will elaborate both views in the back-end.
3341 Full : constant Entity_Id := Full_View (E);
3344 if Is_Private_Type (Full)
3345 and then Present (Underlying_Full_View (Full))
3348 (Underlying_Full_View (Full), Loc, Result);
3351 Freeze_And_Append (Full, Loc, Result);
3353 if Has_Delayed_Freeze (E) then
3354 F_Node := Freeze_Node (Full);
3356 if Present (F_Node) then
3357 Set_Freeze_Node (E, F_Node);
3358 Set_Entity (F_Node, E);
3361 -- {Incomplete,Private}_Subtypes with Full_Views
3362 -- constrained by discriminants.
3364 Set_Has_Delayed_Freeze (E, False);
3365 Set_Freeze_Node (E, Empty);
3370 Check_Debug_Info_Needed (E);
3373 -- AI-117 requires that the convention of a partial view be the
3374 -- same as the convention of the full view. Note that this is a
3375 -- recognized breach of privacy, but it's essential for logical
3376 -- consistency of representation, and the lack of a rule in
3377 -- RM95 was an oversight.
3379 Set_Convention (E, Convention (Full_View (E)));
3381 Set_Size_Known_At_Compile_Time (E,
3382 Size_Known_At_Compile_Time (Full_View (E)));
3384 -- Size information is copied from the full view to the
3385 -- incomplete or private view for consistency.
3387 -- We skip this is the full view is not a type. This is very
3388 -- strange of course, and can only happen as a result of
3389 -- certain illegalities, such as a premature attempt to derive
3390 -- from an incomplete type.
3392 if Is_Type (Full_View (E)) then
3393 Set_Size_Info (E, Full_View (E));
3394 Set_RM_Size (E, RM_Size (Full_View (E)));
3399 -- Case of no full view present. If entity is derived or subtype,
3400 -- it is safe to freeze, correctness depends on the frozen status
3401 -- of parent. Otherwise it is either premature usage, or a Taft
3402 -- amendment type, so diagnosis is at the point of use and the
3403 -- type might be frozen later.
3405 elsif E /= Base_Type (E)
3406 or else Is_Derived_Type (E)
3411 Set_Is_Frozen (E, False);
3415 -- For access subprogram, freeze types of all formals, the return
3416 -- type was already frozen, since it is the Etype of the function.
3418 elsif Ekind (E) = E_Subprogram_Type then
3419 Formal := First_Formal (E);
3420 while Present (Formal) loop
3421 Freeze_And_Append (Etype (Formal), Loc, Result);
3422 Next_Formal (Formal);
3425 Freeze_Subprogram (E);
3427 -- Ada 2005 (AI-326): Check wrong use of tag incomplete type
3429 -- type T is tagged;
3430 -- type Acc is access function (X : T) return T; -- ERROR
3432 if Ekind (Etype (E)) = E_Incomplete_Type
3433 and then Is_Tagged_Type (Etype (E))
3434 and then No (Full_View (Etype (E)))
3435 and then not Is_Value_Type (Etype (E))
3438 ("(Ada 2005): invalid use of tagged incomplete type", E);
3441 -- For access to a protected subprogram, freeze the equivalent type
3442 -- (however this is not set if we are not generating code or if this
3443 -- is an anonymous type used just for resolution).
3445 elsif Is_Access_Protected_Subprogram_Type (E) then
3447 -- AI-326: Check wrong use of tagged incomplete types
3449 -- type T is tagged;
3450 -- type As3D is access protected
3451 -- function (X : Float) return T; -- ERROR
3457 Etyp := Etype (Directly_Designated_Type (E));
3459 if Is_Class_Wide_Type (Etyp) then
3460 Etyp := Etype (Etyp);
3463 if Ekind (Etyp) = E_Incomplete_Type
3464 and then Is_Tagged_Type (Etyp)
3465 and then No (Full_View (Etyp))
3466 and then not Is_Value_Type (Etype (E))
3469 ("(Ada 2005): invalid use of tagged incomplete type", E);
3473 if Present (Equivalent_Type (E)) then
3474 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3478 -- Generic types are never seen by the back-end, and are also not
3479 -- processed by the expander (since the expander is turned off for
3480 -- generic processing), so we never need freeze nodes for them.
3482 if Is_Generic_Type (E) then
3486 -- Some special processing for non-generic types to complete
3487 -- representation details not known till the freeze point.
3489 if Is_Fixed_Point_Type (E) then
3490 Freeze_Fixed_Point_Type (E);
3492 -- Some error checks required for ordinary fixed-point type. Defer
3493 -- these till the freeze-point since we need the small and range
3494 -- values. We only do these checks for base types
3496 if Is_Ordinary_Fixed_Point_Type (E)
3497 and then E = Base_Type (E)
3499 if Small_Value (E) < Ureal_2_M_80 then
3500 Error_Msg_Name_1 := Name_Small;
3502 ("`&''%` too small, minimum allowed is 2.0'*'*(-80)", E);
3504 elsif Small_Value (E) > Ureal_2_80 then
3505 Error_Msg_Name_1 := Name_Small;
3507 ("`&''%` too large, maximum allowed is 2.0'*'*80", E);
3510 if Expr_Value_R (Type_Low_Bound (E)) < Ureal_M_10_36 then
3511 Error_Msg_Name_1 := Name_First;
3513 ("`&''%` too small, minimum allowed is -10.0'*'*36", E);
3516 if Expr_Value_R (Type_High_Bound (E)) > Ureal_10_36 then
3517 Error_Msg_Name_1 := Name_Last;
3519 ("`&''%` too large, maximum allowed is 10.0'*'*36", E);
3523 elsif Is_Enumeration_Type (E) then
3524 Freeze_Enumeration_Type (E);
3526 elsif Is_Integer_Type (E) then
3527 Adjust_Esize_For_Alignment (E);
3529 elsif Is_Access_Type (E) then
3531 -- Check restriction for standard storage pool
3533 if No (Associated_Storage_Pool (E)) then
3534 Check_Restriction (No_Standard_Storage_Pools, E);
3537 -- Deal with error message for pure access type. This is not an
3538 -- error in Ada 2005 if there is no pool (see AI-366).
3540 if Is_Pure_Unit_Access_Type (E)
3541 and then (Ada_Version < Ada_05
3542 or else not No_Pool_Assigned (E))
3544 Error_Msg_N ("named access type not allowed in pure unit", E);
3546 if Ada_Version >= Ada_05 then
3548 ("\would be legal if Storage_Size of 0 given?", E);
3550 elsif No_Pool_Assigned (E) then
3552 ("\would be legal in Ada 2005?", E);
3556 ("\would be legal in Ada 2005 if "
3557 & "Storage_Size of 0 given?", E);
3562 -- Case of composite types
3564 if Is_Composite_Type (E) then
3566 -- AI-117 requires that all new primitives of a tagged type must
3567 -- inherit the convention of the full view of the type. Inherited
3568 -- and overriding operations are defined to inherit the convention
3569 -- of their parent or overridden subprogram (also specified in
3570 -- AI-117), which will have occurred earlier (in Derive_Subprogram
3571 -- and New_Overloaded_Entity). Here we set the convention of
3572 -- primitives that are still convention Ada, which will ensure
3573 -- that any new primitives inherit the type's convention. Class-
3574 -- wide types can have a foreign convention inherited from their
3575 -- specific type, but are excluded from this since they don't have
3576 -- any associated primitives.
3578 if Is_Tagged_Type (E)
3579 and then not Is_Class_Wide_Type (E)
3580 and then Convention (E) /= Convention_Ada
3583 Prim_List : constant Elist_Id := Primitive_Operations (E);
3586 Prim := First_Elmt (Prim_List);
3587 while Present (Prim) loop
3588 if Convention (Node (Prim)) = Convention_Ada then
3589 Set_Convention (Node (Prim), Convention (E));
3598 -- Generate primitive operation references for a tagged type
3600 if Is_Tagged_Type (E)
3601 and then not Is_Class_Wide_Type (E)
3604 Prim_List : Elist_Id;
3612 if Ekind (E) = E_Protected_Subtype
3613 or else Ekind (E) = E_Task_Subtype
3620 -- Ada 2005 (AI-345): In case of concurrent type generate
3621 -- reference to the wrapper that allow us to dispatch calls
3622 -- through their implemented abstract interface types.
3624 -- The check for Present here is to protect against previously
3625 -- reported critical errors.
3627 if Is_Concurrent_Type (Aux_E)
3628 and then Present (Corresponding_Record_Type (Aux_E))
3630 Prim_List := Primitive_Operations
3631 (Corresponding_Record_Type (Aux_E));
3633 Prim_List := Primitive_Operations (Aux_E);
3636 -- Loop to generate references for primitive operations
3638 if Present (Prim_List) then
3639 Prim := First_Elmt (Prim_List);
3640 while Present (Prim) loop
3642 -- If the operation is derived, get the original for
3643 -- cross-reference purposes (it is the original for
3644 -- which we want the xref, and for which the comes
3645 -- from source test needs to be performed).
3648 while Present (Alias (Ent)) loop
3652 Generate_Reference (E, Ent, 'p', Set_Ref => False);
3659 -- Now that all types from which E may depend are frozen, see if the
3660 -- size is known at compile time, if it must be unsigned, or if
3661 -- strict alignment is required
3663 Check_Compile_Time_Size (E);
3664 Check_Unsigned_Type (E);
3666 if Base_Type (E) = E then
3667 Check_Strict_Alignment (E);
3670 -- Do not allow a size clause for a type which does not have a size
3671 -- that is known at compile time
3673 if Has_Size_Clause (E)
3674 and then not Size_Known_At_Compile_Time (E)
3676 -- Suppress this message if errors posted on E, even if we are
3677 -- in all errors mode, since this is often a junk message
3679 if not Error_Posted (E) then
3681 ("size clause not allowed for variable length type",
3686 -- Remaining process is to set/verify the representation information,
3687 -- in particular the size and alignment values. This processing is
3688 -- not required for generic types, since generic types do not play
3689 -- any part in code generation, and so the size and alignment values
3690 -- for such types are irrelevant.
3692 if Is_Generic_Type (E) then
3695 -- Otherwise we call the layout procedure
3701 -- End of freeze processing for type entities
3704 -- Here is where we logically freeze the current entity. If it has a
3705 -- freeze node, then this is the point at which the freeze node is
3706 -- linked into the result list.
3708 if Has_Delayed_Freeze (E) then
3710 -- If a freeze node is already allocated, use it, otherwise allocate
3711 -- a new one. The preallocation happens in the case of anonymous base
3712 -- types, where we preallocate so that we can set First_Subtype_Link.
3713 -- Note that we reset the Sloc to the current freeze location.
3715 if Present (Freeze_Node (E)) then
3716 F_Node := Freeze_Node (E);
3717 Set_Sloc (F_Node, Loc);
3720 F_Node := New_Node (N_Freeze_Entity, Loc);
3721 Set_Freeze_Node (E, F_Node);
3722 Set_Access_Types_To_Process (F_Node, No_Elist);
3723 Set_TSS_Elist (F_Node, No_Elist);
3724 Set_Actions (F_Node, No_List);
3727 Set_Entity (F_Node, E);
3729 if Result = No_List then
3730 Result := New_List (F_Node);
3732 Append (F_Node, Result);
3735 -- A final pass over record types with discriminants. If the type
3736 -- has an incomplete declaration, there may be constrained access
3737 -- subtypes declared elsewhere, which do not depend on the discrimi-
3738 -- nants of the type, and which are used as component types (i.e.
3739 -- the full view is a recursive type). The designated types of these
3740 -- subtypes can only be elaborated after the type itself, and they
3741 -- need an itype reference.
3743 if Ekind (E) = E_Record_Type
3744 and then Has_Discriminants (E)
3752 Comp := First_Component (E);
3754 while Present (Comp) loop
3755 Typ := Etype (Comp);
3757 if Ekind (Comp) = E_Component
3758 and then Is_Access_Type (Typ)
3759 and then Scope (Typ) /= E
3760 and then Base_Type (Designated_Type (Typ)) = E
3761 and then Is_Itype (Designated_Type (Typ))
3763 IR := Make_Itype_Reference (Sloc (Comp));
3764 Set_Itype (IR, Designated_Type (Typ));
3765 Append (IR, Result);
3768 Next_Component (Comp);
3774 -- When a type is frozen, the first subtype of the type is frozen as
3775 -- well (RM 13.14(15)). This has to be done after freezing the type,
3776 -- since obviously the first subtype depends on its own base type.
3779 Freeze_And_Append (First_Subtype (E), Loc, Result);
3781 -- If we just froze a tagged non-class wide record, then freeze the
3782 -- corresponding class-wide type. This must be done after the tagged
3783 -- type itself is frozen, because the class-wide type refers to the
3784 -- tagged type which generates the class.
3786 if Is_Tagged_Type (E)
3787 and then not Is_Class_Wide_Type (E)
3788 and then Present (Class_Wide_Type (E))
3790 Freeze_And_Append (Class_Wide_Type (E), Loc, Result);
3794 Check_Debug_Info_Needed (E);
3796 -- Special handling for subprograms
3798 if Is_Subprogram (E) then
3800 -- If subprogram has address clause then reset Is_Public flag, since
3801 -- we do not want the backend to generate external references.
3803 if Present (Address_Clause (E))
3804 and then not Is_Library_Level_Entity (E)
3806 Set_Is_Public (E, False);
3808 -- If no address clause and not intrinsic, then for imported
3809 -- subprogram in main unit, generate descriptor if we are in
3810 -- Propagate_Exceptions mode.
3812 elsif Propagate_Exceptions
3813 and then Is_Imported (E)
3814 and then not Is_Intrinsic_Subprogram (E)
3815 and then Convention (E) /= Convention_Stubbed
3817 if Result = No_List then
3818 Result := Empty_List;
3826 -----------------------------
3827 -- Freeze_Enumeration_Type --
3828 -----------------------------
3830 procedure Freeze_Enumeration_Type (Typ : Entity_Id) is
3832 -- By default, if no size clause is present, an enumeration type with
3833 -- Convention C is assumed to interface to a C enum, and has integer
3834 -- size. This applies to types. For subtypes, verify that its base
3835 -- type has no size clause either.
3837 if Has_Foreign_Convention (Typ)
3838 and then not Has_Size_Clause (Typ)
3839 and then not Has_Size_Clause (Base_Type (Typ))
3840 and then Esize (Typ) < Standard_Integer_Size
3842 Init_Esize (Typ, Standard_Integer_Size);
3845 -- If the enumeration type interfaces to C, and it has a size clause
3846 -- that specifies less than int size, it warrants a warning. The
3847 -- user may intend the C type to be an enum or a char, so this is
3848 -- not by itself an error that the Ada compiler can detect, but it
3849 -- it is a worth a heads-up. For Boolean and Character types we
3850 -- assume that the programmer has the proper C type in mind.
3852 if Convention (Typ) = Convention_C
3853 and then Has_Size_Clause (Typ)
3854 and then Esize (Typ) /= Esize (Standard_Integer)
3855 and then not Is_Boolean_Type (Typ)
3856 and then not Is_Character_Type (Typ)
3859 ("C enum types have the size of a C int?", Size_Clause (Typ));
3862 Adjust_Esize_For_Alignment (Typ);
3864 end Freeze_Enumeration_Type;
3866 -----------------------
3867 -- Freeze_Expression --
3868 -----------------------
3870 procedure Freeze_Expression (N : Node_Id) is
3871 In_Spec_Exp : constant Boolean := In_Spec_Expression;
3874 Desig_Typ : Entity_Id;
3878 Freeze_Outside : Boolean := False;
3879 -- This flag is set true if the entity must be frozen outside the
3880 -- current subprogram. This happens in the case of expander generated
3881 -- subprograms (_Init_Proc, _Input, _Output, _Read, _Write) which do
3882 -- not freeze all entities like other bodies, but which nevertheless
3883 -- may reference entities that have to be frozen before the body and
3884 -- obviously cannot be frozen inside the body.
3886 function In_Exp_Body (N : Node_Id) return Boolean;
3887 -- Given an N_Handled_Sequence_Of_Statements node N, determines whether
3888 -- it is the handled statement sequence of an expander-generated
3889 -- subprogram (init proc, stream subprogram, or renaming as body).
3890 -- If so, this is not a freezing context.
3896 function In_Exp_Body (N : Node_Id) return Boolean is
3901 if Nkind (N) = N_Subprogram_Body then
3907 if Nkind (P) /= N_Subprogram_Body then
3911 Id := Defining_Unit_Name (Specification (P));
3913 if Nkind (Id) = N_Defining_Identifier
3914 and then (Is_Init_Proc (Id) or else
3915 Is_TSS (Id, TSS_Stream_Input) or else
3916 Is_TSS (Id, TSS_Stream_Output) or else
3917 Is_TSS (Id, TSS_Stream_Read) or else
3918 Is_TSS (Id, TSS_Stream_Write) or else
3919 Nkind (Original_Node (P)) =
3920 N_Subprogram_Renaming_Declaration)
3929 -- Start of processing for Freeze_Expression
3932 -- Immediate return if freezing is inhibited. This flag is set by the
3933 -- analyzer to stop freezing on generated expressions that would cause
3934 -- freezing if they were in the source program, but which are not
3935 -- supposed to freeze, since they are created.
3937 if Must_Not_Freeze (N) then
3941 -- If expression is non-static, then it does not freeze in a default
3942 -- expression, see section "Handling of Default Expressions" in the
3943 -- spec of package Sem for further details. Note that we have to
3944 -- make sure that we actually have a real expression (if we have
3945 -- a subtype indication, we can't test Is_Static_Expression!)
3948 and then Nkind (N) in N_Subexpr
3949 and then not Is_Static_Expression (N)
3954 -- Freeze type of expression if not frozen already
3958 if Nkind (N) in N_Has_Etype then
3959 if not Is_Frozen (Etype (N)) then
3962 -- Base type may be an derived numeric type that is frozen at
3963 -- the point of declaration, but first_subtype is still unfrozen.
3965 elsif not Is_Frozen (First_Subtype (Etype (N))) then
3966 Typ := First_Subtype (Etype (N));
3970 -- For entity name, freeze entity if not frozen already. A special
3971 -- exception occurs for an identifier that did not come from source.
3972 -- We don't let such identifiers freeze a non-internal entity, i.e.
3973 -- an entity that did come from source, since such an identifier was
3974 -- generated by the expander, and cannot have any semantic effect on
3975 -- the freezing semantics. For example, this stops the parameter of
3976 -- an initialization procedure from freezing the variable.
3978 if Is_Entity_Name (N)
3979 and then not Is_Frozen (Entity (N))
3980 and then (Nkind (N) /= N_Identifier
3981 or else Comes_From_Source (N)
3982 or else not Comes_From_Source (Entity (N)))
3989 -- For an allocator freeze designated type if not frozen already
3991 -- For an aggregate whose component type is an access type, freeze the
3992 -- designated type now, so that its freeze does not appear within the
3993 -- loop that might be created in the expansion of the aggregate. If the
3994 -- designated type is a private type without full view, the expression
3995 -- cannot contain an allocator, so the type is not frozen.
4001 Desig_Typ := Designated_Type (Etype (N));
4004 if Is_Array_Type (Etype (N))
4005 and then Is_Access_Type (Component_Type (Etype (N)))
4007 Desig_Typ := Designated_Type (Component_Type (Etype (N)));
4010 when N_Selected_Component |
4011 N_Indexed_Component |
4014 if Is_Access_Type (Etype (Prefix (N))) then
4015 Desig_Typ := Designated_Type (Etype (Prefix (N)));
4022 if Desig_Typ /= Empty
4023 and then (Is_Frozen (Desig_Typ)
4024 or else (not Is_Fully_Defined (Desig_Typ)))
4029 -- All done if nothing needs freezing
4033 and then No (Desig_Typ)
4038 -- Loop for looking at the right place to insert the freeze nodes
4039 -- exiting from the loop when it is appropriate to insert the freeze
4040 -- node before the current node P.
4042 -- Also checks some special exceptions to the freezing rules. These
4043 -- cases result in a direct return, bypassing the freeze action.
4047 Parent_P := Parent (P);
4049 -- If we don't have a parent, then we are not in a well-formed tree.
4050 -- This is an unusual case, but there are some legitimate situations
4051 -- in which this occurs, notably when the expressions in the range of
4052 -- a type declaration are resolved. We simply ignore the freeze
4053 -- request in this case. Is this right ???
4055 if No (Parent_P) then
4059 -- See if we have got to an appropriate point in the tree
4061 case Nkind (Parent_P) is
4063 -- A special test for the exception of (RM 13.14(8)) for the case
4064 -- of per-object expressions (RM 3.8(18)) occurring in component
4065 -- definition or a discrete subtype definition. Note that we test
4066 -- for a component declaration which includes both cases we are
4067 -- interested in, and furthermore the tree does not have explicit
4068 -- nodes for either of these two constructs.
4070 when N_Component_Declaration =>
4072 -- The case we want to test for here is an identifier that is
4073 -- a per-object expression, this is either a discriminant that
4074 -- appears in a context other than the component declaration
4075 -- or it is a reference to the type of the enclosing construct.
4077 -- For either of these cases, we skip the freezing
4079 if not In_Spec_Expression
4080 and then Nkind (N) = N_Identifier
4081 and then (Present (Entity (N)))
4083 -- We recognize the discriminant case by just looking for
4084 -- a reference to a discriminant. It can only be one for
4085 -- the enclosing construct. Skip freezing in this case.
4087 if Ekind (Entity (N)) = E_Discriminant then
4090 -- For the case of a reference to the enclosing record,
4091 -- (or task or protected type), we look for a type that
4092 -- matches the current scope.
4094 elsif Entity (N) = Current_Scope then
4099 -- If we have an enumeration literal that appears as the choice in
4100 -- the aggregate of an enumeration representation clause, then
4101 -- freezing does not occur (RM 13.14(10)).
4103 when N_Enumeration_Representation_Clause =>
4105 -- The case we are looking for is an enumeration literal
4107 if (Nkind (N) = N_Identifier or Nkind (N) = N_Character_Literal)
4108 and then Is_Enumeration_Type (Etype (N))
4110 -- If enumeration literal appears directly as the choice,
4111 -- do not freeze (this is the normal non-overloaded case)
4113 if Nkind (Parent (N)) = N_Component_Association
4114 and then First (Choices (Parent (N))) = N
4118 -- If enumeration literal appears as the name of function
4119 -- which is the choice, then also do not freeze. This
4120 -- happens in the overloaded literal case, where the
4121 -- enumeration literal is temporarily changed to a function
4122 -- call for overloading analysis purposes.
4124 elsif Nkind (Parent (N)) = N_Function_Call
4126 Nkind (Parent (Parent (N))) = N_Component_Association
4128 First (Choices (Parent (Parent (N)))) = Parent (N)
4134 -- Normally if the parent is a handled sequence of statements,
4135 -- then the current node must be a statement, and that is an
4136 -- appropriate place to insert a freeze node.
4138 when N_Handled_Sequence_Of_Statements =>
4140 -- An exception occurs when the sequence of statements is for
4141 -- an expander generated body that did not do the usual freeze
4142 -- all operation. In this case we usually want to freeze
4143 -- outside this body, not inside it, and we skip past the
4144 -- subprogram body that we are inside.
4146 if In_Exp_Body (Parent_P) then
4148 -- However, we *do* want to freeze at this point if we have
4149 -- an entity to freeze, and that entity is declared *inside*
4150 -- the body of the expander generated procedure. This case
4151 -- is recognized by the scope of the type, which is either
4152 -- the spec for some enclosing body, or (in the case of
4153 -- init_procs, for which there are no separate specs) the
4157 Subp : constant Node_Id := Parent (Parent_P);
4161 if Nkind (Subp) = N_Subprogram_Body then
4162 Cspc := Corresponding_Spec (Subp);
4164 if (Present (Typ) and then Scope (Typ) = Cspc)
4166 (Present (Nam) and then Scope (Nam) = Cspc)
4171 and then Scope (Typ) = Current_Scope
4172 and then Current_Scope = Defining_Entity (Subp)
4179 -- If not that exception to the exception, then this is
4180 -- where we delay the freeze till outside the body.
4182 Parent_P := Parent (Parent_P);
4183 Freeze_Outside := True;
4185 -- Here if normal case where we are in handled statement
4186 -- sequence and want to do the insertion right there.
4192 -- If parent is a body or a spec or a block, then the current node
4193 -- is a statement or declaration and we can insert the freeze node
4196 when N_Package_Specification |
4202 N_Block_Statement => exit;
4204 -- The expander is allowed to define types in any statements list,
4205 -- so any of the following parent nodes also mark a freezing point
4206 -- if the actual node is in a list of statements or declarations.
4208 when N_Exception_Handler |
4211 N_Case_Statement_Alternative |
4212 N_Compilation_Unit_Aux |
4213 N_Selective_Accept |
4214 N_Accept_Alternative |
4215 N_Delay_Alternative |
4216 N_Conditional_Entry_Call |
4217 N_Entry_Call_Alternative |
4218 N_Triggering_Alternative |
4222 exit when Is_List_Member (P);
4224 -- Note: The N_Loop_Statement is a special case. A type that
4225 -- appears in the source can never be frozen in a loop (this
4226 -- occurs only because of a loop expanded by the expander), so we
4227 -- keep on going. Otherwise we terminate the search. Same is true
4228 -- of any entity which comes from source. (if they have predefined
4229 -- type, that type does not appear to come from source, but the
4230 -- entity should not be frozen here).
4232 when N_Loop_Statement =>
4233 exit when not Comes_From_Source (Etype (N))
4234 and then (No (Nam) or else not Comes_From_Source (Nam));
4236 -- For all other cases, keep looking at parents
4242 -- We fall through the case if we did not yet find the proper
4243 -- place in the free for inserting the freeze node, so climb!
4248 -- If the expression appears in a record or an initialization procedure,
4249 -- the freeze nodes are collected and attached to the current scope, to
4250 -- be inserted and analyzed on exit from the scope, to insure that
4251 -- generated entities appear in the correct scope. If the expression is
4252 -- a default for a discriminant specification, the scope is still void.
4253 -- The expression can also appear in the discriminant part of a private
4254 -- or concurrent type.
4256 -- If the expression appears in a constrained subcomponent of an
4257 -- enclosing record declaration, the freeze nodes must be attached to
4258 -- the outer record type so they can eventually be placed in the
4259 -- enclosing declaration list.
4261 -- The other case requiring this special handling is if we are in a
4262 -- default expression, since in that case we are about to freeze a
4263 -- static type, and the freeze scope needs to be the outer scope, not
4264 -- the scope of the subprogram with the default parameter.
4266 -- For default expressions and other spec expressions in generic units,
4267 -- the Move_Freeze_Nodes mechanism (see sem_ch12.adb) takes care of
4268 -- placing them at the proper place, after the generic unit.
4270 if (In_Spec_Exp and not Inside_A_Generic)
4271 or else Freeze_Outside
4272 or else (Is_Type (Current_Scope)
4273 and then (not Is_Concurrent_Type (Current_Scope)
4274 or else not Has_Completion (Current_Scope)))
4275 or else Ekind (Current_Scope) = E_Void
4278 Loc : constant Source_Ptr := Sloc (Current_Scope);
4279 Freeze_Nodes : List_Id := No_List;
4280 Pos : Int := Scope_Stack.Last;
4283 if Present (Desig_Typ) then
4284 Freeze_And_Append (Desig_Typ, Loc, Freeze_Nodes);
4287 if Present (Typ) then
4288 Freeze_And_Append (Typ, Loc, Freeze_Nodes);
4291 if Present (Nam) then
4292 Freeze_And_Append (Nam, Loc, Freeze_Nodes);
4295 -- The current scope may be that of a constrained component of
4296 -- an enclosing record declaration, which is above the current
4297 -- scope in the scope stack.
4299 if Is_Record_Type (Scope (Current_Scope)) then
4303 if Is_Non_Empty_List (Freeze_Nodes) then
4304 if No (Scope_Stack.Table (Pos).Pending_Freeze_Actions) then
4305 Scope_Stack.Table (Pos).Pending_Freeze_Actions :=
4308 Append_List (Freeze_Nodes, Scope_Stack.Table
4309 (Pos).Pending_Freeze_Actions);
4317 -- Now we have the right place to do the freezing. First, a special
4318 -- adjustment, if we are in spec-expression analysis mode, these freeze
4319 -- actions must not be thrown away (normally all inserted actions are
4320 -- thrown away in this mode. However, the freeze actions are from static
4321 -- expressions and one of the important reasons we are doing this
4322 -- special analysis is to get these freeze actions. Therefore we turn
4323 -- off the In_Spec_Expression mode to propagate these freeze actions.
4324 -- This also means they get properly analyzed and expanded.
4326 In_Spec_Expression := False;
4328 -- Freeze the designated type of an allocator (RM 13.14(13))
4330 if Present (Desig_Typ) then
4331 Freeze_Before (P, Desig_Typ);
4334 -- Freeze type of expression (RM 13.14(10)). Note that we took care of
4335 -- the enumeration representation clause exception in the loop above.
4337 if Present (Typ) then
4338 Freeze_Before (P, Typ);
4341 -- Freeze name if one is present (RM 13.14(11))
4343 if Present (Nam) then
4344 Freeze_Before (P, Nam);
4347 -- Restore In_Spec_Expression flag
4349 In_Spec_Expression := In_Spec_Exp;
4350 end Freeze_Expression;
4352 -----------------------------
4353 -- Freeze_Fixed_Point_Type --
4354 -----------------------------
4356 -- Certain fixed-point types and subtypes, including implicit base types
4357 -- and declared first subtypes, have not yet set up a range. This is
4358 -- because the range cannot be set until the Small and Size values are
4359 -- known, and these are not known till the type is frozen.
4361 -- To signal this case, Scalar_Range contains an unanalyzed syntactic range
4362 -- whose bounds are unanalyzed real literals. This routine will recognize
4363 -- this case, and transform this range node into a properly typed range
4364 -- with properly analyzed and resolved values.
4366 procedure Freeze_Fixed_Point_Type (Typ : Entity_Id) is
4367 Rng : constant Node_Id := Scalar_Range (Typ);
4368 Lo : constant Node_Id := Low_Bound (Rng);
4369 Hi : constant Node_Id := High_Bound (Rng);
4370 Btyp : constant Entity_Id := Base_Type (Typ);
4371 Brng : constant Node_Id := Scalar_Range (Btyp);
4372 BLo : constant Node_Id := Low_Bound (Brng);
4373 BHi : constant Node_Id := High_Bound (Brng);
4374 Small : constant Ureal := Small_Value (Typ);
4381 function Fsize (Lov, Hiv : Ureal) return Nat;
4382 -- Returns size of type with given bounds. Also leaves these
4383 -- bounds set as the current bounds of the Typ.
4389 function Fsize (Lov, Hiv : Ureal) return Nat is
4391 Set_Realval (Lo, Lov);
4392 Set_Realval (Hi, Hiv);
4393 return Minimum_Size (Typ);
4396 -- Start of processing for Freeze_Fixed_Point_Type
4399 -- If Esize of a subtype has not previously been set, set it now
4401 if Unknown_Esize (Typ) then
4402 Atype := Ancestor_Subtype (Typ);
4404 if Present (Atype) then
4405 Set_Esize (Typ, Esize (Atype));
4407 Set_Esize (Typ, Esize (Base_Type (Typ)));
4411 -- Immediate return if the range is already analyzed. This means that
4412 -- the range is already set, and does not need to be computed by this
4415 if Analyzed (Rng) then
4419 -- Immediate return if either of the bounds raises Constraint_Error
4421 if Raises_Constraint_Error (Lo)
4422 or else Raises_Constraint_Error (Hi)
4427 Loval := Realval (Lo);
4428 Hival := Realval (Hi);
4430 -- Ordinary fixed-point case
4432 if Is_Ordinary_Fixed_Point_Type (Typ) then
4434 -- For the ordinary fixed-point case, we are allowed to fudge the
4435 -- end-points up or down by small. Generally we prefer to fudge up,
4436 -- i.e. widen the bounds for non-model numbers so that the end points
4437 -- are included. However there are cases in which this cannot be
4438 -- done, and indeed cases in which we may need to narrow the bounds.
4439 -- The following circuit makes the decision.
4441 -- Note: our terminology here is that Incl_EP means that the bounds
4442 -- are widened by Small if necessary to include the end points, and
4443 -- Excl_EP means that the bounds are narrowed by Small to exclude the
4444 -- end-points if this reduces the size.
4446 -- Note that in the Incl case, all we care about is including the
4447 -- end-points. In the Excl case, we want to narrow the bounds as
4448 -- much as permitted by the RM, to give the smallest possible size.
4451 Loval_Incl_EP : Ureal;
4452 Hival_Incl_EP : Ureal;
4454 Loval_Excl_EP : Ureal;
4455 Hival_Excl_EP : Ureal;
4461 First_Subt : Entity_Id;
4466 -- First step. Base types are required to be symmetrical. Right
4467 -- now, the base type range is a copy of the first subtype range.
4468 -- This will be corrected before we are done, but right away we
4469 -- need to deal with the case where both bounds are non-negative.
4470 -- In this case, we set the low bound to the negative of the high
4471 -- bound, to make sure that the size is computed to include the
4472 -- required sign. Note that we do not need to worry about the
4473 -- case of both bounds negative, because the sign will be dealt
4474 -- with anyway. Furthermore we can't just go making such a bound
4475 -- symmetrical, since in a twos-complement system, there is an
4476 -- extra negative value which could not be accommodated on the
4480 and then not UR_Is_Negative (Loval)
4481 and then Hival > Loval
4484 Set_Realval (Lo, Loval);
4487 -- Compute the fudged bounds. If the number is a model number,
4488 -- then we do nothing to include it, but we are allowed to backoff
4489 -- to the next adjacent model number when we exclude it. If it is
4490 -- not a model number then we straddle the two values with the
4491 -- model numbers on either side.
4493 Model_Num := UR_Trunc (Loval / Small) * Small;
4495 if Loval = Model_Num then
4496 Loval_Incl_EP := Model_Num;
4498 Loval_Incl_EP := Model_Num - Small;
4501 -- The low value excluding the end point is Small greater, but
4502 -- we do not do this exclusion if the low value is positive,
4503 -- since it can't help the size and could actually hurt by
4504 -- crossing the high bound.
4506 if UR_Is_Negative (Loval_Incl_EP) then
4507 Loval_Excl_EP := Loval_Incl_EP + Small;
4509 -- If the value went from negative to zero, then we have the
4510 -- case where Loval_Incl_EP is the model number just below
4511 -- zero, so we want to stick to the negative value for the
4512 -- base type to maintain the condition that the size will
4513 -- include signed values.
4516 and then UR_Is_Zero (Loval_Excl_EP)
4518 Loval_Excl_EP := Loval_Incl_EP;
4522 Loval_Excl_EP := Loval_Incl_EP;
4525 -- Similar processing for upper bound and high value
4527 Model_Num := UR_Trunc (Hival / Small) * Small;
4529 if Hival = Model_Num then
4530 Hival_Incl_EP := Model_Num;
4532 Hival_Incl_EP := Model_Num + Small;
4535 if UR_Is_Positive (Hival_Incl_EP) then
4536 Hival_Excl_EP := Hival_Incl_EP - Small;
4538 Hival_Excl_EP := Hival_Incl_EP;
4541 -- One further adjustment is needed. In the case of subtypes, we
4542 -- cannot go outside the range of the base type, or we get
4543 -- peculiarities, and the base type range is already set. This
4544 -- only applies to the Incl values, since clearly the Excl values
4545 -- are already as restricted as they are allowed to be.
4548 Loval_Incl_EP := UR_Max (Loval_Incl_EP, Realval (BLo));
4549 Hival_Incl_EP := UR_Min (Hival_Incl_EP, Realval (BHi));
4552 -- Get size including and excluding end points
4554 Size_Incl_EP := Fsize (Loval_Incl_EP, Hival_Incl_EP);
4555 Size_Excl_EP := Fsize (Loval_Excl_EP, Hival_Excl_EP);
4557 -- No need to exclude end-points if it does not reduce size
4559 if Fsize (Loval_Incl_EP, Hival_Excl_EP) = Size_Excl_EP then
4560 Loval_Excl_EP := Loval_Incl_EP;
4563 if Fsize (Loval_Excl_EP, Hival_Incl_EP) = Size_Excl_EP then
4564 Hival_Excl_EP := Hival_Incl_EP;
4567 -- Now we set the actual size to be used. We want to use the
4568 -- bounds fudged up to include the end-points but only if this
4569 -- can be done without violating a specifically given size
4570 -- size clause or causing an unacceptable increase in size.
4572 -- Case of size clause given
4574 if Has_Size_Clause (Typ) then
4576 -- Use the inclusive size only if it is consistent with
4577 -- the explicitly specified size.
4579 if Size_Incl_EP <= RM_Size (Typ) then
4580 Actual_Lo := Loval_Incl_EP;
4581 Actual_Hi := Hival_Incl_EP;
4582 Actual_Size := Size_Incl_EP;
4584 -- If the inclusive size is too large, we try excluding
4585 -- the end-points (will be caught later if does not work).
4588 Actual_Lo := Loval_Excl_EP;
4589 Actual_Hi := Hival_Excl_EP;
4590 Actual_Size := Size_Excl_EP;
4593 -- Case of size clause not given
4596 -- If we have a base type whose corresponding first subtype
4597 -- has an explicit size that is large enough to include our
4598 -- end-points, then do so. There is no point in working hard
4599 -- to get a base type whose size is smaller than the specified
4600 -- size of the first subtype.
4602 First_Subt := First_Subtype (Typ);
4604 if Has_Size_Clause (First_Subt)
4605 and then Size_Incl_EP <= Esize (First_Subt)
4607 Actual_Size := Size_Incl_EP;
4608 Actual_Lo := Loval_Incl_EP;
4609 Actual_Hi := Hival_Incl_EP;
4611 -- If excluding the end-points makes the size smaller and
4612 -- results in a size of 8,16,32,64, then we take the smaller
4613 -- size. For the 64 case, this is compulsory. For the other
4614 -- cases, it seems reasonable. We like to include end points
4615 -- if we can, but not at the expense of moving to the next
4616 -- natural boundary of size.
4618 elsif Size_Incl_EP /= Size_Excl_EP
4620 (Size_Excl_EP = 8 or else
4621 Size_Excl_EP = 16 or else
4622 Size_Excl_EP = 32 or else
4625 Actual_Size := Size_Excl_EP;
4626 Actual_Lo := Loval_Excl_EP;
4627 Actual_Hi := Hival_Excl_EP;
4629 -- Otherwise we can definitely include the end points
4632 Actual_Size := Size_Incl_EP;
4633 Actual_Lo := Loval_Incl_EP;
4634 Actual_Hi := Hival_Incl_EP;
4637 -- One pathological case: normally we never fudge a low bound
4638 -- down, since it would seem to increase the size (if it has
4639 -- any effect), but for ranges containing single value, or no
4640 -- values, the high bound can be small too large. Consider:
4642 -- type t is delta 2.0**(-14)
4643 -- range 131072.0 .. 0;
4645 -- That lower bound is *just* outside the range of 32 bits, and
4646 -- does need fudging down in this case. Note that the bounds
4647 -- will always have crossed here, since the high bound will be
4648 -- fudged down if necessary, as in the case of:
4650 -- type t is delta 2.0**(-14)
4651 -- range 131072.0 .. 131072.0;
4653 -- So we detect the situation by looking for crossed bounds,
4654 -- and if the bounds are crossed, and the low bound is greater
4655 -- than zero, we will always back it off by small, since this
4656 -- is completely harmless.
4658 if Actual_Lo > Actual_Hi then
4659 if UR_Is_Positive (Actual_Lo) then
4660 Actual_Lo := Loval_Incl_EP - Small;
4661 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4663 -- And of course, we need to do exactly the same parallel
4664 -- fudge for flat ranges in the negative region.
4666 elsif UR_Is_Negative (Actual_Hi) then
4667 Actual_Hi := Hival_Incl_EP + Small;
4668 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4673 Set_Realval (Lo, Actual_Lo);
4674 Set_Realval (Hi, Actual_Hi);
4677 -- For the decimal case, none of this fudging is required, since there
4678 -- are no end-point problems in the decimal case (the end-points are
4679 -- always included).
4682 Actual_Size := Fsize (Loval, Hival);
4685 -- At this stage, the actual size has been calculated and the proper
4686 -- required bounds are stored in the low and high bounds.
4688 if Actual_Size > 64 then
4689 Error_Msg_Uint_1 := UI_From_Int (Actual_Size);
4691 ("size required (^) for type& too large, maximum allowed is 64",
4696 -- Check size against explicit given size
4698 if Has_Size_Clause (Typ) then
4699 if Actual_Size > RM_Size (Typ) then
4700 Error_Msg_Uint_1 := RM_Size (Typ);
4701 Error_Msg_Uint_2 := UI_From_Int (Actual_Size);
4703 ("size given (^) for type& too small, minimum allowed is ^",
4704 Size_Clause (Typ), Typ);
4707 Actual_Size := UI_To_Int (Esize (Typ));
4710 -- Increase size to next natural boundary if no size clause given
4713 if Actual_Size <= 8 then
4715 elsif Actual_Size <= 16 then
4717 elsif Actual_Size <= 32 then
4723 Init_Esize (Typ, Actual_Size);
4724 Adjust_Esize_For_Alignment (Typ);
4727 -- If we have a base type, then expand the bounds so that they extend to
4728 -- the full width of the allocated size in bits, to avoid junk range
4729 -- checks on intermediate computations.
4731 if Base_Type (Typ) = Typ then
4732 Set_Realval (Lo, -(Small * (Uint_2 ** (Actual_Size - 1))));
4733 Set_Realval (Hi, (Small * (Uint_2 ** (Actual_Size - 1) - 1)));
4736 -- Final step is to reanalyze the bounds using the proper type
4737 -- and set the Corresponding_Integer_Value fields of the literals.
4739 Set_Etype (Lo, Empty);
4740 Set_Analyzed (Lo, False);
4743 -- Resolve with universal fixed if the base type, and the base type if
4744 -- it is a subtype. Note we can't resolve the base type with itself,
4745 -- that would be a reference before definition.
4748 Resolve (Lo, Universal_Fixed);
4753 -- Set corresponding integer value for bound
4755 Set_Corresponding_Integer_Value
4756 (Lo, UR_To_Uint (Realval (Lo) / Small));
4758 -- Similar processing for high bound
4760 Set_Etype (Hi, Empty);
4761 Set_Analyzed (Hi, False);
4765 Resolve (Hi, Universal_Fixed);
4770 Set_Corresponding_Integer_Value
4771 (Hi, UR_To_Uint (Realval (Hi) / Small));
4773 -- Set type of range to correspond to bounds
4775 Set_Etype (Rng, Etype (Lo));
4777 -- Set Esize to calculated size if not set already
4779 if Unknown_Esize (Typ) then
4780 Init_Esize (Typ, Actual_Size);
4783 -- Set RM_Size if not already set. If already set, check value
4786 Minsiz : constant Uint := UI_From_Int (Minimum_Size (Typ));
4789 if RM_Size (Typ) /= Uint_0 then
4790 if RM_Size (Typ) < Minsiz then
4791 Error_Msg_Uint_1 := RM_Size (Typ);
4792 Error_Msg_Uint_2 := Minsiz;
4794 ("size given (^) for type& too small, minimum allowed is ^",
4795 Size_Clause (Typ), Typ);
4799 Set_RM_Size (Typ, Minsiz);
4802 end Freeze_Fixed_Point_Type;
4808 procedure Freeze_Itype (T : Entity_Id; N : Node_Id) is
4812 Set_Has_Delayed_Freeze (T);
4813 L := Freeze_Entity (T, Sloc (N));
4815 if Is_Non_Empty_List (L) then
4816 Insert_Actions (N, L);
4820 --------------------------
4821 -- Freeze_Static_Object --
4822 --------------------------
4824 procedure Freeze_Static_Object (E : Entity_Id) is
4826 Cannot_Be_Static : exception;
4827 -- Exception raised if the type of a static object cannot be made
4828 -- static. This happens if the type depends on non-global objects.
4830 procedure Ensure_Expression_Is_SA (N : Node_Id);
4831 -- Called to ensure that an expression used as part of a type definition
4832 -- is statically allocatable, which means that the expression type is
4833 -- statically allocatable, and the expression is either static, or a
4834 -- reference to a library level constant.
4836 procedure Ensure_Type_Is_SA (Typ : Entity_Id);
4837 -- Called to mark a type as static, checking that it is possible
4838 -- to set the type as static. If it is not possible, then the
4839 -- exception Cannot_Be_Static is raised.
4841 -----------------------------
4842 -- Ensure_Expression_Is_SA --
4843 -----------------------------
4845 procedure Ensure_Expression_Is_SA (N : Node_Id) is
4849 Ensure_Type_Is_SA (Etype (N));
4851 if Is_Static_Expression (N) then
4854 elsif Nkind (N) = N_Identifier then
4858 and then Ekind (Ent) = E_Constant
4859 and then Is_Library_Level_Entity (Ent)
4865 raise Cannot_Be_Static;
4866 end Ensure_Expression_Is_SA;
4868 -----------------------
4869 -- Ensure_Type_Is_SA --
4870 -----------------------
4872 procedure Ensure_Type_Is_SA (Typ : Entity_Id) is
4877 -- If type is library level, we are all set
4879 if Is_Library_Level_Entity (Typ) then
4883 -- We are also OK if the type already marked as statically allocated,
4884 -- which means we processed it before.
4886 if Is_Statically_Allocated (Typ) then
4890 -- Mark type as statically allocated
4892 Set_Is_Statically_Allocated (Typ);
4894 -- Check that it is safe to statically allocate this type
4896 if Is_Scalar_Type (Typ) or else Is_Real_Type (Typ) then
4897 Ensure_Expression_Is_SA (Type_Low_Bound (Typ));
4898 Ensure_Expression_Is_SA (Type_High_Bound (Typ));
4900 elsif Is_Array_Type (Typ) then
4901 N := First_Index (Typ);
4902 while Present (N) loop
4903 Ensure_Type_Is_SA (Etype (N));
4907 Ensure_Type_Is_SA (Component_Type (Typ));
4909 elsif Is_Access_Type (Typ) then
4910 if Ekind (Designated_Type (Typ)) = E_Subprogram_Type then
4914 T : constant Entity_Id := Etype (Designated_Type (Typ));
4917 if T /= Standard_Void_Type then
4918 Ensure_Type_Is_SA (T);
4921 F := First_Formal (Designated_Type (Typ));
4923 while Present (F) loop
4924 Ensure_Type_Is_SA (Etype (F));
4930 Ensure_Type_Is_SA (Designated_Type (Typ));
4933 elsif Is_Record_Type (Typ) then
4934 C := First_Entity (Typ);
4935 while Present (C) loop
4936 if Ekind (C) = E_Discriminant
4937 or else Ekind (C) = E_Component
4939 Ensure_Type_Is_SA (Etype (C));
4941 elsif Is_Type (C) then
4942 Ensure_Type_Is_SA (C);
4948 elsif Ekind (Typ) = E_Subprogram_Type then
4949 Ensure_Type_Is_SA (Etype (Typ));
4951 C := First_Formal (Typ);
4952 while Present (C) loop
4953 Ensure_Type_Is_SA (Etype (C));
4958 raise Cannot_Be_Static;
4960 end Ensure_Type_Is_SA;
4962 -- Start of processing for Freeze_Static_Object
4965 Ensure_Type_Is_SA (Etype (E));
4968 when Cannot_Be_Static =>
4970 -- If the object that cannot be static is imported or exported,
4971 -- then we give an error message saying that this object cannot
4972 -- be imported or exported.
4974 if Is_Imported (E) then
4976 ("& cannot be imported (local type is not constant)", E);
4978 -- Otherwise must be exported, something is wrong if compiler
4979 -- is marking something as statically allocated which cannot be).
4981 else pragma Assert (Is_Exported (E));
4983 ("& cannot be exported (local type is not constant)", E);
4985 end Freeze_Static_Object;
4987 -----------------------
4988 -- Freeze_Subprogram --
4989 -----------------------
4991 procedure Freeze_Subprogram (E : Entity_Id) is
4996 -- Subprogram may not have an address clause unless it is imported
4998 if Present (Address_Clause (E)) then
4999 if not Is_Imported (E) then
5001 ("address clause can only be given " &
5002 "for imported subprogram",
5003 Name (Address_Clause (E)));
5007 -- Reset the Pure indication on an imported subprogram unless an
5008 -- explicit Pure_Function pragma was present. We do this because
5009 -- otherwise it is an insidious error to call a non-pure function from
5010 -- pure unit and have calls mysteriously optimized away. What happens
5011 -- here is that the Import can bypass the normal check to ensure that
5012 -- pure units call only pure subprograms.
5015 and then Is_Pure (E)
5016 and then not Has_Pragma_Pure_Function (E)
5018 Set_Is_Pure (E, False);
5021 -- For non-foreign convention subprograms, this is where we create
5022 -- the extra formals (for accessibility level and constrained bit
5023 -- information). We delay this till the freeze point precisely so
5024 -- that we know the convention!
5026 if not Has_Foreign_Convention (E) then
5027 Create_Extra_Formals (E);
5030 -- If this is convention Ada and a Valued_Procedure, that's odd
5032 if Ekind (E) = E_Procedure
5033 and then Is_Valued_Procedure (E)
5034 and then Convention (E) = Convention_Ada
5035 and then Warn_On_Export_Import
5038 ("?Valued_Procedure has no effect for convention Ada", E);
5039 Set_Is_Valued_Procedure (E, False);
5042 -- Case of foreign convention
5047 -- For foreign conventions, warn about return of an
5048 -- unconstrained array.
5050 -- Note: we *do* allow a return by descriptor for the VMS case,
5051 -- though here there is probably more to be done ???
5053 if Ekind (E) = E_Function then
5054 Retype := Underlying_Type (Etype (E));
5056 -- If no return type, probably some other error, e.g. a
5057 -- missing full declaration, so ignore.
5062 -- If the return type is generic, we have emitted a warning
5063 -- earlier on, and there is nothing else to check here. Specific
5064 -- instantiations may lead to erroneous behavior.
5066 elsif Is_Generic_Type (Etype (E)) then
5069 elsif Is_Array_Type (Retype)
5070 and then not Is_Constrained (Retype)
5071 and then Mechanism (E) not in Descriptor_Codes
5072 and then Warn_On_Export_Import
5075 ("?foreign convention function& should not return " &
5076 "unconstrained array", E);
5081 -- If any of the formals for an exported foreign convention
5082 -- subprogram have defaults, then emit an appropriate warning since
5083 -- this is odd (default cannot be used from non-Ada code)
5085 if Is_Exported (E) then
5086 F := First_Formal (E);
5087 while Present (F) loop
5088 if Warn_On_Export_Import
5089 and then Present (Default_Value (F))
5092 ("?parameter cannot be defaulted in non-Ada call",
5101 -- For VMS, descriptor mechanisms for parameters are allowed only
5102 -- for imported/exported subprograms. Moreover, the NCA descriptor
5103 -- is not allowed for parameters of exported subprograms.
5105 if OpenVMS_On_Target then
5106 if Is_Exported (E) then
5107 F := First_Formal (E);
5108 while Present (F) loop
5109 if Mechanism (F) = By_Descriptor_NCA then
5111 ("'N'C'A' descriptor for parameter not permitted", F);
5113 ("\can only be used for imported subprogram", F);
5119 elsif not Is_Imported (E) then
5120 F := First_Formal (E);
5121 while Present (F) loop
5122 if Mechanism (F) in Descriptor_Codes then
5124 ("descriptor mechanism for parameter not permitted", F);
5126 ("\can only be used for imported/exported subprogram", F);
5134 -- Pragma Inline_Always is disallowed for dispatching subprograms
5135 -- because the address of such subprograms is saved in the dispatch
5136 -- table to support dispatching calls, and dispatching calls cannot
5137 -- be inlined. This is consistent with the restriction against using
5138 -- 'Access or 'Address on an Inline_Always subprogram.
5140 if Is_Dispatching_Operation (E)
5141 and then Has_Pragma_Inline_Always (E)
5144 ("pragma Inline_Always not allowed for dispatching subprograms", E);
5147 -- Because of the implicit representation of inherited predefined
5148 -- operators in the front-end, the overriding status of the operation
5149 -- may be affected when a full view of a type is analyzed, and this is
5150 -- not captured by the analysis of the corresponding type declaration.
5151 -- Therefore the correctness of a not-overriding indicator must be
5152 -- rechecked when the subprogram is frozen.
5154 if Nkind (E) = N_Defining_Operator_Symbol
5155 and then not Error_Posted (Parent (E))
5157 Check_Overriding_Indicator (E, Empty, Is_Primitive (E));
5159 end Freeze_Subprogram;
5161 ----------------------
5162 -- Is_Fully_Defined --
5163 ----------------------
5165 function Is_Fully_Defined (T : Entity_Id) return Boolean is
5167 if Ekind (T) = E_Class_Wide_Type then
5168 return Is_Fully_Defined (Etype (T));
5170 elsif Is_Array_Type (T) then
5171 return Is_Fully_Defined (Component_Type (T));
5173 elsif Is_Record_Type (T)
5174 and not Is_Private_Type (T)
5176 -- Verify that the record type has no components with private types
5177 -- without completion.
5183 Comp := First_Component (T);
5185 while Present (Comp) loop
5186 if not Is_Fully_Defined (Etype (Comp)) then
5190 Next_Component (Comp);
5196 return not Is_Private_Type (T)
5197 or else Present (Full_View (Base_Type (T)));
5199 end Is_Fully_Defined;
5201 ---------------------------------
5202 -- Process_Default_Expressions --
5203 ---------------------------------
5205 procedure Process_Default_Expressions
5207 After : in out Node_Id)
5209 Loc : constant Source_Ptr := Sloc (E);
5216 Set_Default_Expressions_Processed (E);
5218 -- A subprogram instance and its associated anonymous subprogram share
5219 -- their signature. The default expression functions are defined in the
5220 -- wrapper packages for the anonymous subprogram, and should not be
5221 -- generated again for the instance.
5223 if Is_Generic_Instance (E)
5224 and then Present (Alias (E))
5225 and then Default_Expressions_Processed (Alias (E))
5230 Formal := First_Formal (E);
5231 while Present (Formal) loop
5232 if Present (Default_Value (Formal)) then
5234 -- We work with a copy of the default expression because we
5235 -- do not want to disturb the original, since this would mess
5236 -- up the conformance checking.
5238 Dcopy := New_Copy_Tree (Default_Value (Formal));
5240 -- The analysis of the expression may generate insert actions,
5241 -- which of course must not be executed. We wrap those actions
5242 -- in a procedure that is not called, and later on eliminated.
5243 -- The following cases have no side-effects, and are analyzed
5246 if Nkind (Dcopy) = N_Identifier
5247 or else Nkind (Dcopy) = N_Expanded_Name
5248 or else Nkind (Dcopy) = N_Integer_Literal
5249 or else (Nkind (Dcopy) = N_Real_Literal
5250 and then not Vax_Float (Etype (Dcopy)))
5251 or else Nkind (Dcopy) = N_Character_Literal
5252 or else Nkind (Dcopy) = N_String_Literal
5253 or else Known_Null (Dcopy)
5254 or else (Nkind (Dcopy) = N_Attribute_Reference
5256 Attribute_Name (Dcopy) = Name_Null_Parameter)
5259 -- If there is no default function, we must still do a full
5260 -- analyze call on the default value, to ensure that all error
5261 -- checks are performed, e.g. those associated with static
5262 -- evaluation. Note: this branch will always be taken if the
5263 -- analyzer is turned off (but we still need the error checks).
5265 -- Note: the setting of parent here is to meet the requirement
5266 -- that we can only analyze the expression while attached to
5267 -- the tree. Really the requirement is that the parent chain
5268 -- be set, we don't actually need to be in the tree.
5270 Set_Parent (Dcopy, Declaration_Node (Formal));
5273 -- Default expressions are resolved with their own type if the
5274 -- context is generic, to avoid anomalies with private types.
5276 if Ekind (Scope (E)) = E_Generic_Package then
5279 Resolve (Dcopy, Etype (Formal));
5282 -- If that resolved expression will raise constraint error,
5283 -- then flag the default value as raising constraint error.
5284 -- This allows a proper error message on the calls.
5286 if Raises_Constraint_Error (Dcopy) then
5287 Set_Raises_Constraint_Error (Default_Value (Formal));
5290 -- If the default is a parameterless call, we use the name of
5291 -- the called function directly, and there is no body to build.
5293 elsif Nkind (Dcopy) = N_Function_Call
5294 and then No (Parameter_Associations (Dcopy))
5298 -- Else construct and analyze the body of a wrapper procedure
5299 -- that contains an object declaration to hold the expression.
5300 -- Given that this is done only to complete the analysis, it
5301 -- simpler to build a procedure than a function which might
5302 -- involve secondary stack expansion.
5306 Make_Defining_Identifier (Loc, New_Internal_Name ('D'));
5309 Make_Subprogram_Body (Loc,
5311 Make_Procedure_Specification (Loc,
5312 Defining_Unit_Name => Dnam),
5314 Declarations => New_List (
5315 Make_Object_Declaration (Loc,
5316 Defining_Identifier =>
5317 Make_Defining_Identifier (Loc,
5318 New_Internal_Name ('T')),
5319 Object_Definition =>
5320 New_Occurrence_Of (Etype (Formal), Loc),
5321 Expression => New_Copy_Tree (Dcopy))),
5323 Handled_Statement_Sequence =>
5324 Make_Handled_Sequence_Of_Statements (Loc,
5325 Statements => New_List));
5327 Set_Scope (Dnam, Scope (E));
5328 Set_Assignment_OK (First (Declarations (Dbody)));
5329 Set_Is_Eliminated (Dnam);
5330 Insert_After (After, Dbody);
5336 Next_Formal (Formal);
5338 end Process_Default_Expressions;
5340 ----------------------------------------
5341 -- Set_Component_Alignment_If_Not_Set --
5342 ----------------------------------------
5344 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id) is
5346 -- Ignore if not base type, subtypes don't need anything
5348 if Typ /= Base_Type (Typ) then
5352 -- Do not override existing representation
5354 if Is_Packed (Typ) then
5357 elsif Has_Specified_Layout (Typ) then
5360 elsif Component_Alignment (Typ) /= Calign_Default then
5364 Set_Component_Alignment
5365 (Typ, Scope_Stack.Table
5366 (Scope_Stack.Last).Component_Alignment_Default);
5368 end Set_Component_Alignment_If_Not_Set;
5374 procedure Undelay_Type (T : Entity_Id) is
5376 Set_Has_Delayed_Freeze (T, False);
5377 Set_Freeze_Node (T, Empty);
5379 -- Since we don't want T to have a Freeze_Node, we don't want its
5380 -- Full_View or Corresponding_Record_Type to have one either.
5382 -- ??? Fundamentally, this whole handling is a kludge. What we really
5383 -- want is to be sure that for an Itype that's part of record R and is a
5384 -- subtype of type T, that it's frozen after the later of the freeze
5385 -- points of R and T. We have no way of doing that directly, so what we
5386 -- do is force most such Itypes to be frozen as part of freezing R via
5387 -- this procedure and only delay the ones that need to be delayed
5388 -- (mostly the designated types of access types that are defined as part
5391 if Is_Private_Type (T)
5392 and then Present (Full_View (T))
5393 and then Is_Itype (Full_View (T))
5394 and then Is_Record_Type (Scope (Full_View (T)))
5396 Undelay_Type (Full_View (T));
5399 if Is_Concurrent_Type (T)
5400 and then Present (Corresponding_Record_Type (T))
5401 and then Is_Itype (Corresponding_Record_Type (T))
5402 and then Is_Record_Type (Scope (Corresponding_Record_Type (T)))
5404 Undelay_Type (Corresponding_Record_Type (T));
5412 procedure Warn_Overlay
5417 Ent : constant Entity_Id := Entity (Nam);
5418 -- The object to which the address clause applies
5421 Old : Entity_Id := Empty;
5425 -- No warning if address clause overlay warnings are off
5427 if not Address_Clause_Overlay_Warnings then
5431 -- No warning if there is an explicit initialization
5433 Init := Original_Node (Expression (Declaration_Node (Ent)));
5435 if Present (Init) and then Comes_From_Source (Init) then
5439 -- We only give the warning for non-imported entities of a type for
5440 -- which a non-null base init proc is defined (or for access types which
5441 -- have implicit null initialization).
5444 and then (Has_Non_Null_Base_Init_Proc (Typ)
5445 or else Is_Access_Type (Typ))
5446 and then not Is_Imported (Ent)
5448 if Nkind (Expr) = N_Attribute_Reference
5449 and then Is_Entity_Name (Prefix (Expr))
5451 Old := Entity (Prefix (Expr));
5453 elsif Is_Entity_Name (Expr)
5454 and then Ekind (Entity (Expr)) = E_Constant
5456 Decl := Declaration_Node (Entity (Expr));
5458 if Nkind (Decl) = N_Object_Declaration
5459 and then Present (Expression (Decl))
5460 and then Nkind (Expression (Decl)) = N_Attribute_Reference
5461 and then Is_Entity_Name (Prefix (Expression (Decl)))
5463 Old := Entity (Prefix (Expression (Decl)));
5465 elsif Nkind (Expr) = N_Function_Call then
5469 -- A function call (most likely to To_Address) is probably not an
5470 -- overlay, so skip warning. Ditto if the function call was inlined
5471 -- and transformed into an entity.
5473 elsif Nkind (Original_Node (Expr)) = N_Function_Call then
5477 Decl := Next (Parent (Expr));
5479 -- If a pragma Import follows, we assume that it is for the current
5480 -- target of the address clause, and skip the warning.
5483 and then Nkind (Decl) = N_Pragma
5484 and then Pragma_Name (Decl) = Name_Import
5489 if Present (Old) then
5490 Error_Msg_Node_2 := Old;
5492 ("default initialization of & may modify &?",
5496 ("default initialization of & may modify overlaid storage?",
5500 -- Add friendly warning if initialization comes from a packed array
5503 if Is_Record_Type (Typ) then
5508 Comp := First_Component (Typ);
5510 while Present (Comp) loop
5511 if Nkind (Parent (Comp)) = N_Component_Declaration
5512 and then Present (Expression (Parent (Comp)))
5515 elsif Is_Array_Type (Etype (Comp))
5516 and then Present (Packed_Array_Type (Etype (Comp)))
5519 ("\packed array component& " &
5520 "will be initialized to zero?",
5524 Next_Component (Comp);
5531 ("\use pragma Import for & to " &
5532 "suppress initialization (RM B.1(24))?",
OSDN Git Service
