1 -----------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2008, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 2, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 with Atree; use Atree;
28 with Debug; use Debug;
29 with Einfo; use Einfo;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Exp_Ch3; use Exp_Ch3;
33 with Exp_Ch7; use Exp_Ch7;
34 with Exp_Disp; use Exp_Disp;
35 with Exp_Pakd; use Exp_Pakd;
36 with Exp_Util; use Exp_Util;
37 with Exp_Tss; use Exp_Tss;
38 with Layout; use Layout;
39 with Lib.Xref; use Lib.Xref;
40 with Namet; use Namet;
41 with Nlists; use Nlists;
42 with Nmake; use Nmake;
44 with Restrict; use Restrict;
45 with Rident; use Rident;
47 with Sem_Cat; use Sem_Cat;
48 with Sem_Ch6; use Sem_Ch6;
49 with Sem_Ch7; use Sem_Ch7;
50 with Sem_Ch8; use Sem_Ch8;
51 with Sem_Ch13; use Sem_Ch13;
52 with Sem_Eval; use Sem_Eval;
53 with Sem_Mech; use Sem_Mech;
54 with Sem_Prag; use Sem_Prag;
55 with Sem_Res; use Sem_Res;
56 with Sem_Util; use Sem_Util;
57 with Sinfo; use Sinfo;
58 with Snames; use Snames;
59 with Stand; use Stand;
60 with Targparm; use Targparm;
61 with Tbuild; use Tbuild;
62 with Ttypes; use Ttypes;
63 with Uintp; use Uintp;
64 with Urealp; use Urealp;
66 package body Freeze is
68 -----------------------
69 -- Local Subprograms --
70 -----------------------
72 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id);
73 -- Typ is a type that is being frozen. If no size clause is given,
74 -- but a default Esize has been computed, then this default Esize is
75 -- adjusted up if necessary to be consistent with a given alignment,
76 -- but never to a value greater than Long_Long_Integer'Size. This
77 -- is used for all discrete types and for fixed-point types.
79 procedure Build_And_Analyze_Renamed_Body
82 After : in out Node_Id);
83 -- Build body for a renaming declaration, insert in tree and analyze
85 procedure Check_Address_Clause (E : Entity_Id);
86 -- Apply legality checks to address clauses for object declarations,
87 -- at the point the object is frozen.
89 procedure Check_Strict_Alignment (E : Entity_Id);
90 -- E is a base type. If E is tagged or has a component that is aliased
91 -- or tagged or contains something this is aliased or tagged, set
94 procedure Check_Unsigned_Type (E : Entity_Id);
95 pragma Inline (Check_Unsigned_Type);
96 -- If E is a fixed-point or discrete type, then all the necessary work
97 -- to freeze it is completed except for possible setting of the flag
98 -- Is_Unsigned_Type, which is done by this procedure. The call has no
99 -- effect if the entity E is not a discrete or fixed-point type.
101 procedure Freeze_And_Append
104 Result : in out List_Id);
105 -- Freezes Ent using Freeze_Entity, and appends the resulting list of
106 -- nodes to Result, modifying Result from No_List if necessary.
108 procedure Freeze_Enumeration_Type (Typ : Entity_Id);
109 -- Freeze enumeration type. The Esize field is set as processing
110 -- proceeds (i.e. set by default when the type is declared and then
111 -- adjusted by rep clauses. What this procedure does is to make sure
112 -- that if a foreign convention is specified, and no specific size
113 -- is given, then the size must be at least Integer'Size.
115 procedure Freeze_Static_Object (E : Entity_Id);
116 -- If an object is frozen which has Is_Statically_Allocated set, then
117 -- all referenced types must also be marked with this flag. This routine
118 -- is in charge of meeting this requirement for the object entity E.
120 procedure Freeze_Subprogram (E : Entity_Id);
121 -- Perform freezing actions for a subprogram (create extra formals,
122 -- and set proper default mechanism values). Note that this routine
123 -- is not called for internal subprograms, for which neither of these
124 -- actions is needed (or desirable, we do not want for example to have
125 -- these extra formals present in initialization procedures, where they
126 -- would serve no purpose). In this call E is either a subprogram or
127 -- a subprogram type (i.e. an access to a subprogram).
129 function Is_Fully_Defined (T : Entity_Id) return Boolean;
130 -- True if T is not private and has no private components, or has a full
131 -- view. Used to determine whether the designated type of an access type
132 -- should be frozen when the access type is frozen. This is done when an
133 -- allocator is frozen, or an expression that may involve attributes of
134 -- the designated type. Otherwise freezing the access type does not freeze
135 -- the designated type.
137 procedure Generate_Prim_Op_References
139 -- For a tagged type, generate implicit references to its primitive
140 -- operations, for source navigation.
142 procedure Process_Default_Expressions
144 After : in out Node_Id);
145 -- This procedure is called for each subprogram to complete processing
146 -- of default expressions at the point where all types are known to be
147 -- frozen. The expressions must be analyzed in full, to make sure that
148 -- all error processing is done (they have only been pre-analyzed). If
149 -- the expression is not an entity or literal, its analysis may generate
150 -- code which must not be executed. In that case we build a function
151 -- body to hold that code. This wrapper function serves no other purpose
152 -- (it used to be called to evaluate the default, but now the default is
153 -- inlined at each point of call).
155 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id);
156 -- Typ is a record or array type that is being frozen. This routine
157 -- sets the default component alignment from the scope stack values
158 -- if the alignment is otherwise not specified.
160 procedure Check_Debug_Info_Needed (T : Entity_Id);
161 -- As each entity is frozen, this routine is called to deal with the
162 -- setting of Debug_Info_Needed for the entity. This flag is set if
163 -- the entity comes from source, or if we are in Debug_Generated_Code
164 -- mode or if the -gnatdV debug flag is set. However, it never sets
165 -- the flag if Debug_Info_Off is set. This procedure also ensures that
166 -- subsidiary entities have the flag set as required.
168 procedure Undelay_Type (T : Entity_Id);
169 -- T is a type of a component that we know to be an Itype.
170 -- We don't want this to have a Freeze_Node, so ensure it doesn't.
171 -- Do the same for any Full_View or Corresponding_Record_Type.
173 procedure Warn_Overlay
177 -- Expr is the expression for an address clause for entity Nam whose type
178 -- is Typ. If Typ has a default initialization, and there is no explicit
179 -- initialization in the source declaration, check whether the address
180 -- clause might cause overlaying of an entity, and emit a warning on the
181 -- side effect that the initialization will cause.
183 -------------------------------
184 -- Adjust_Esize_For_Alignment --
185 -------------------------------
187 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id) is
191 if Known_Esize (Typ) and then Known_Alignment (Typ) then
192 Align := Alignment_In_Bits (Typ);
194 if Align > Esize (Typ)
195 and then Align <= Standard_Long_Long_Integer_Size
197 Set_Esize (Typ, Align);
200 end Adjust_Esize_For_Alignment;
202 ------------------------------------
203 -- Build_And_Analyze_Renamed_Body --
204 ------------------------------------
206 procedure Build_And_Analyze_Renamed_Body
209 After : in out Node_Id)
211 Body_Node : constant Node_Id := Build_Renamed_Body (Decl, New_S);
213 Insert_After (After, Body_Node);
214 Mark_Rewrite_Insertion (Body_Node);
217 end Build_And_Analyze_Renamed_Body;
219 ------------------------
220 -- Build_Renamed_Body --
221 ------------------------
223 function Build_Renamed_Body
225 New_S : Entity_Id) return Node_Id
227 Loc : constant Source_Ptr := Sloc (New_S);
228 -- We use for the source location of the renamed body, the location
229 -- of the spec entity. It might seem more natural to use the location
230 -- of the renaming declaration itself, but that would be wrong, since
231 -- then the body we create would look as though it was created far
232 -- too late, and this could cause problems with elaboration order
233 -- analysis, particularly in connection with instantiations.
235 N : constant Node_Id := Unit_Declaration_Node (New_S);
236 Nam : constant Node_Id := Name (N);
238 Spec : constant Node_Id := New_Copy_Tree (Specification (Decl));
239 Actuals : List_Id := No_List;
244 O_Formal : Entity_Id;
245 Param_Spec : Node_Id;
247 Pref : Node_Id := Empty;
248 -- If the renamed entity is a primitive operation given in prefix form,
249 -- the prefix is the target object and it has to be added as the first
250 -- actual in the generated call.
253 -- Determine the entity being renamed, which is the target of the call
254 -- statement. If the name is an explicit dereference, this is a renaming
255 -- of a subprogram type rather than a subprogram. The name itself is
258 if Nkind (Nam) = N_Selected_Component then
259 Old_S := Entity (Selector_Name (Nam));
261 elsif Nkind (Nam) = N_Explicit_Dereference then
262 Old_S := Etype (Nam);
264 elsif Nkind (Nam) = N_Indexed_Component then
265 if Is_Entity_Name (Prefix (Nam)) then
266 Old_S := Entity (Prefix (Nam));
268 Old_S := Entity (Selector_Name (Prefix (Nam)));
271 elsif Nkind (Nam) = N_Character_Literal then
272 Old_S := Etype (New_S);
275 Old_S := Entity (Nam);
278 if Is_Entity_Name (Nam) then
280 -- If the renamed entity is a predefined operator, retain full name
281 -- to ensure its visibility.
283 if Ekind (Old_S) = E_Operator
284 and then Nkind (Nam) = N_Expanded_Name
286 Call_Name := New_Copy (Name (N));
288 Call_Name := New_Reference_To (Old_S, Loc);
292 if Nkind (Nam) = N_Selected_Component
293 and then Present (First_Formal (Old_S))
295 (Is_Controlling_Formal (First_Formal (Old_S))
296 or else Is_Class_Wide_Type (Etype (First_Formal (Old_S))))
299 -- Retrieve the target object, to be added as a first actual
302 Call_Name := New_Occurrence_Of (Old_S, Loc);
303 Pref := Prefix (Nam);
306 Call_Name := New_Copy (Name (N));
309 -- The original name may have been overloaded, but
310 -- is fully resolved now.
312 Set_Is_Overloaded (Call_Name, False);
315 -- For simple renamings, subsequent calls can be expanded directly as
316 -- called to the renamed entity. The body must be generated in any case
317 -- for calls they may appear elsewhere.
319 if (Ekind (Old_S) = E_Function
320 or else Ekind (Old_S) = E_Procedure)
321 and then Nkind (Decl) = N_Subprogram_Declaration
323 Set_Body_To_Inline (Decl, Old_S);
326 -- The body generated for this renaming is an internal artifact, and
327 -- does not constitute a freeze point for the called entity.
329 Set_Must_Not_Freeze (Call_Name);
331 Formal := First_Formal (Defining_Entity (Decl));
333 if Present (Pref) then
335 Pref_Type : constant Entity_Id := Etype (Pref);
336 Form_Type : constant Entity_Id := Etype (First_Formal (Old_S));
340 -- The controlling formal may be an access parameter, or the
341 -- actual may be an access value, so adjust accordingly.
343 if Is_Access_Type (Pref_Type)
344 and then not Is_Access_Type (Form_Type)
347 (Make_Explicit_Dereference (Loc, Relocate_Node (Pref)));
349 elsif Is_Access_Type (Form_Type)
350 and then not Is_Access_Type (Pref)
353 (Make_Attribute_Reference (Loc,
354 Attribute_Name => Name_Access,
355 Prefix => Relocate_Node (Pref)));
357 Actuals := New_List (Pref);
361 elsif Present (Formal) then
368 if Present (Formal) then
369 while Present (Formal) loop
370 Append (New_Reference_To (Formal, Loc), Actuals);
371 Next_Formal (Formal);
375 -- If the renamed entity is an entry, inherit its profile. For other
376 -- renamings as bodies, both profiles must be subtype conformant, so it
377 -- is not necessary to replace the profile given in the declaration.
378 -- However, default values that are aggregates are rewritten when
379 -- partially analyzed, so we recover the original aggregate to insure
380 -- that subsequent conformity checking works. Similarly, if the default
381 -- expression was constant-folded, recover the original expression.
383 Formal := First_Formal (Defining_Entity (Decl));
385 if Present (Formal) then
386 O_Formal := First_Formal (Old_S);
387 Param_Spec := First (Parameter_Specifications (Spec));
389 while Present (Formal) loop
390 if Is_Entry (Old_S) then
392 if Nkind (Parameter_Type (Param_Spec)) /=
395 Set_Etype (Formal, Etype (O_Formal));
396 Set_Entity (Parameter_Type (Param_Spec), Etype (O_Formal));
399 elsif Nkind (Default_Value (O_Formal)) = N_Aggregate
400 or else Nkind (Original_Node (Default_Value (O_Formal))) /=
401 Nkind (Default_Value (O_Formal))
403 Set_Expression (Param_Spec,
404 New_Copy_Tree (Original_Node (Default_Value (O_Formal))));
407 Next_Formal (Formal);
408 Next_Formal (O_Formal);
413 -- If the renamed entity is a function, the generated body contains a
414 -- return statement. Otherwise, build a procedure call. If the entity is
415 -- an entry, subsequent analysis of the call will transform it into the
416 -- proper entry or protected operation call. If the renamed entity is
417 -- a character literal, return it directly.
419 if Ekind (Old_S) = E_Function
420 or else Ekind (Old_S) = E_Operator
421 or else (Ekind (Old_S) = E_Subprogram_Type
422 and then Etype (Old_S) /= Standard_Void_Type)
425 Make_Simple_Return_Statement (Loc,
427 Make_Function_Call (Loc,
429 Parameter_Associations => Actuals));
431 elsif Ekind (Old_S) = E_Enumeration_Literal then
433 Make_Simple_Return_Statement (Loc,
434 Expression => New_Occurrence_Of (Old_S, Loc));
436 elsif Nkind (Nam) = N_Character_Literal then
438 Make_Simple_Return_Statement (Loc,
439 Expression => Call_Name);
443 Make_Procedure_Call_Statement (Loc,
445 Parameter_Associations => Actuals);
448 -- Create entities for subprogram body and formals
450 Set_Defining_Unit_Name (Spec,
451 Make_Defining_Identifier (Loc, Chars => Chars (New_S)));
453 Param_Spec := First (Parameter_Specifications (Spec));
455 while Present (Param_Spec) loop
456 Set_Defining_Identifier (Param_Spec,
457 Make_Defining_Identifier (Loc,
458 Chars => Chars (Defining_Identifier (Param_Spec))));
463 Make_Subprogram_Body (Loc,
464 Specification => Spec,
465 Declarations => New_List,
466 Handled_Statement_Sequence =>
467 Make_Handled_Sequence_Of_Statements (Loc,
468 Statements => New_List (Call_Node)));
470 if Nkind (Decl) /= N_Subprogram_Declaration then
472 Make_Subprogram_Declaration (Loc,
473 Specification => Specification (N)));
476 -- Link the body to the entity whose declaration it completes. If
477 -- the body is analyzed when the renamed entity is frozen, it may
478 -- be necessary to restore the proper scope (see package Exp_Ch13).
480 if Nkind (N) = N_Subprogram_Renaming_Declaration
481 and then Present (Corresponding_Spec (N))
483 Set_Corresponding_Spec (Body_Node, Corresponding_Spec (N));
485 Set_Corresponding_Spec (Body_Node, New_S);
489 end Build_Renamed_Body;
491 --------------------------
492 -- Check_Address_Clause --
493 --------------------------
495 procedure Check_Address_Clause (E : Entity_Id) is
496 Addr : constant Node_Id := Address_Clause (E);
498 Decl : constant Node_Id := Declaration_Node (E);
499 Typ : constant Entity_Id := Etype (E);
502 if Present (Addr) then
503 Expr := Expression (Addr);
505 -- If we have no initialization of any kind, then we don't need to
506 -- place any restrictions on the address clause, because the object
507 -- will be elaborated after the address clause is evaluated. This
508 -- happens if the declaration has no initial expression, or the type
509 -- has no implicit initialization, or the object is imported.
511 -- The same holds for all initialized scalar types and all access
512 -- types. Packed bit arrays of size up to 64 are represented using a
513 -- modular type with an initialization (to zero) and can be processed
514 -- like other initialized scalar types.
516 -- If the type is controlled, code to attach the object to a
517 -- finalization chain is generated at the point of declaration,
518 -- and therefore the elaboration of the object cannot be delayed:
519 -- the address expression must be a constant.
521 if (No (Expression (Decl))
522 and then not Controlled_Type (Typ)
524 (not Has_Non_Null_Base_Init_Proc (Typ)
525 or else Is_Imported (E)))
528 (Present (Expression (Decl))
529 and then Is_Scalar_Type (Typ))
535 (Is_Bit_Packed_Array (Typ)
537 Is_Modular_Integer_Type (Packed_Array_Type (Typ)))
541 -- Otherwise, we require the address clause to be constant because
542 -- the call to the initialization procedure (or the attach code) has
543 -- to happen at the point of the declaration.
546 Check_Constant_Address_Clause (Expr, E);
547 Set_Has_Delayed_Freeze (E, False);
550 if not Error_Posted (Expr)
551 and then not Controlled_Type (Typ)
553 Warn_Overlay (Expr, Typ, Name (Addr));
556 end Check_Address_Clause;
558 -----------------------------
559 -- Check_Compile_Time_Size --
560 -----------------------------
562 procedure Check_Compile_Time_Size (T : Entity_Id) is
564 procedure Set_Small_Size (T : Entity_Id; S : Uint);
565 -- Sets the compile time known size (32 bits or less) in the Esize
566 -- field, of T checking for a size clause that was given which attempts
567 -- to give a smaller size.
569 function Size_Known (T : Entity_Id) return Boolean;
570 -- Recursive function that does all the work
572 function Static_Discriminated_Components (T : Entity_Id) return Boolean;
573 -- If T is a constrained subtype, its size is not known if any of its
574 -- discriminant constraints is not static and it is not a null record.
575 -- The test is conservative and doesn't check that the components are
576 -- in fact constrained by non-static discriminant values. Could be made
583 procedure Set_Small_Size (T : Entity_Id; S : Uint) is
588 elsif Has_Size_Clause (T) then
589 if RM_Size (T) < S then
590 Error_Msg_Uint_1 := S;
592 ("size for & too small, minimum allowed is ^",
595 elsif Unknown_Esize (T) then
599 -- Set sizes if not set already
602 if Unknown_Esize (T) then
606 if Unknown_RM_Size (T) then
616 function Size_Known (T : Entity_Id) return Boolean is
624 if Size_Known_At_Compile_Time (T) then
627 -- Always True for scalar types. This is true even for generic formal
628 -- scalar types. We used to return False in the latter case, but the
629 -- size is known at compile time, even in the template, we just do
630 -- not know the exact size but that's not the point of this routine.
632 elsif Is_Scalar_Type (T)
633 or else Is_Task_Type (T)
639 elsif Is_Array_Type (T) then
641 -- String literals always have known size, and we can set it
643 if Ekind (T) = E_String_Literal_Subtype then
644 Set_Small_Size (T, Component_Size (T)
645 * String_Literal_Length (T));
648 -- Unconstrained types never have known at compile time size
650 elsif not Is_Constrained (T) then
653 -- Don't do any recursion on type with error posted, since we may
654 -- have a malformed type that leads us into a loop.
656 elsif Error_Posted (T) then
659 -- Otherwise if component size unknown, then array size unknown
661 elsif not Size_Known (Component_Type (T)) then
665 -- Check for all indexes static, and also compute possible size
666 -- (in case it is less than 32 and may be packable).
669 Esiz : Uint := Component_Size (T);
673 Index := First_Index (T);
674 while Present (Index) loop
675 if Nkind (Index) = N_Range then
676 Get_Index_Bounds (Index, Low, High);
678 elsif Error_Posted (Scalar_Range (Etype (Index))) then
682 Low := Type_Low_Bound (Etype (Index));
683 High := Type_High_Bound (Etype (Index));
686 if not Compile_Time_Known_Value (Low)
687 or else not Compile_Time_Known_Value (High)
688 or else Etype (Index) = Any_Type
693 Dim := Expr_Value (High) - Expr_Value (Low) + 1;
705 Set_Small_Size (T, Esiz);
709 -- Access types always have known at compile time sizes
711 elsif Is_Access_Type (T) then
714 -- For non-generic private types, go to underlying type if present
716 elsif Is_Private_Type (T)
717 and then not Is_Generic_Type (T)
718 and then Present (Underlying_Type (T))
720 -- Don't do any recursion on type with error posted, since we may
721 -- have a malformed type that leads us into a loop.
723 if Error_Posted (T) then
726 return Size_Known (Underlying_Type (T));
731 elsif Is_Record_Type (T) then
733 -- A class-wide type is never considered to have a known size
735 if Is_Class_Wide_Type (T) then
738 -- A subtype of a variant record must not have non-static
739 -- discriminanted components.
741 elsif T /= Base_Type (T)
742 and then not Static_Discriminated_Components (T)
746 -- Don't do any recursion on type with error posted, since we may
747 -- have a malformed type that leads us into a loop.
749 elsif Error_Posted (T) then
753 -- Now look at the components of the record
756 -- The following two variables are used to keep track of the
757 -- size of packed records if we can tell the size of the packed
758 -- record in the front end. Packed_Size_Known is True if so far
759 -- we can figure out the size. It is initialized to True for a
760 -- packed record, unless the record has discriminants. The
761 -- reason we eliminate the discriminated case is that we don't
762 -- know the way the back end lays out discriminated packed
763 -- records. If Packed_Size_Known is True, then Packed_Size is
764 -- the size in bits so far.
766 Packed_Size_Known : Boolean :=
768 and then not Has_Discriminants (T);
770 Packed_Size : Uint := Uint_0;
773 -- Test for variant part present
775 if Has_Discriminants (T)
776 and then Present (Parent (T))
777 and then Nkind (Parent (T)) = N_Full_Type_Declaration
778 and then Nkind (Type_Definition (Parent (T))) =
780 and then not Null_Present (Type_Definition (Parent (T)))
781 and then Present (Variant_Part
782 (Component_List (Type_Definition (Parent (T)))))
784 -- If variant part is present, and type is unconstrained,
785 -- then we must have defaulted discriminants, or a size
786 -- clause must be present for the type, or else the size
787 -- is definitely not known at compile time.
789 if not Is_Constrained (T)
791 No (Discriminant_Default_Value
792 (First_Discriminant (T)))
793 and then Unknown_Esize (T)
799 -- Loop through components
801 Comp := First_Component_Or_Discriminant (T);
802 while Present (Comp) loop
803 Ctyp := Etype (Comp);
805 -- We do not know the packed size if there is a component
806 -- clause present (we possibly could, but this would only
807 -- help in the case of a record with partial rep clauses.
808 -- That's because in the case of full rep clauses, the
809 -- size gets figured out anyway by a different circuit).
811 if Present (Component_Clause (Comp)) then
812 Packed_Size_Known := False;
815 -- We need to identify a component that is an array where
816 -- the index type is an enumeration type with non-standard
817 -- representation, and some bound of the type depends on a
820 -- This is because gigi computes the size by doing a
821 -- substitution of the appropriate discriminant value in
822 -- the size expression for the base type, and gigi is not
823 -- clever enough to evaluate the resulting expression (which
824 -- involves a call to rep_to_pos) at compile time.
826 -- It would be nice if gigi would either recognize that
827 -- this expression can be computed at compile time, or
828 -- alternatively figured out the size from the subtype
829 -- directly, where all the information is at hand ???
831 if Is_Array_Type (Etype (Comp))
832 and then Present (Packed_Array_Type (Etype (Comp)))
835 Ocomp : constant Entity_Id :=
836 Original_Record_Component (Comp);
837 OCtyp : constant Entity_Id := Etype (Ocomp);
843 Ind := First_Index (OCtyp);
844 while Present (Ind) loop
845 Indtyp := Etype (Ind);
847 if Is_Enumeration_Type (Indtyp)
848 and then Has_Non_Standard_Rep (Indtyp)
850 Lo := Type_Low_Bound (Indtyp);
851 Hi := Type_High_Bound (Indtyp);
853 if Is_Entity_Name (Lo)
854 and then Ekind (Entity (Lo)) = E_Discriminant
858 elsif Is_Entity_Name (Hi)
859 and then Ekind (Entity (Hi)) = E_Discriminant
870 -- Clearly size of record is not known if the size of one of
871 -- the components is not known.
873 if not Size_Known (Ctyp) then
877 -- Accumulate packed size if possible
879 if Packed_Size_Known then
881 -- We can only deal with elementary types, since for
882 -- non-elementary components, alignment enters into the
883 -- picture, and we don't know enough to handle proper
884 -- alignment in this context. Packed arrays count as
885 -- elementary if the representation is a modular type.
887 if Is_Elementary_Type (Ctyp)
888 or else (Is_Array_Type (Ctyp)
889 and then Present (Packed_Array_Type (Ctyp))
890 and then Is_Modular_Integer_Type
891 (Packed_Array_Type (Ctyp)))
893 -- If RM_Size is known and static, then we can
894 -- keep accumulating the packed size.
896 if Known_Static_RM_Size (Ctyp) then
898 -- A little glitch, to be removed sometime ???
899 -- gigi does not understand zero sizes yet.
901 if RM_Size (Ctyp) = Uint_0 then
902 Packed_Size_Known := False;
904 -- Normal case where we can keep accumulating the
905 -- packed array size.
908 Packed_Size := Packed_Size + RM_Size (Ctyp);
911 -- If we have a field whose RM_Size is not known then
912 -- we can't figure out the packed size here.
915 Packed_Size_Known := False;
918 -- If we have a non-elementary type we can't figure out
919 -- the packed array size (alignment issues).
922 Packed_Size_Known := False;
926 Next_Component_Or_Discriminant (Comp);
929 if Packed_Size_Known then
930 Set_Small_Size (T, Packed_Size);
936 -- All other cases, size not known at compile time
943 -------------------------------------
944 -- Static_Discriminated_Components --
945 -------------------------------------
947 function Static_Discriminated_Components
948 (T : Entity_Id) return Boolean
950 Constraint : Elmt_Id;
953 if Has_Discriminants (T)
954 and then Present (Discriminant_Constraint (T))
955 and then Present (First_Component (T))
957 Constraint := First_Elmt (Discriminant_Constraint (T));
958 while Present (Constraint) loop
959 if not Compile_Time_Known_Value (Node (Constraint)) then
963 Next_Elmt (Constraint);
968 end Static_Discriminated_Components;
970 -- Start of processing for Check_Compile_Time_Size
973 Set_Size_Known_At_Compile_Time (T, Size_Known (T));
974 end Check_Compile_Time_Size;
976 -----------------------------
977 -- Check_Debug_Info_Needed --
978 -----------------------------
980 procedure Check_Debug_Info_Needed (T : Entity_Id) is
982 if Debug_Info_Off (T) then
985 elsif Comes_From_Source (T)
986 or else Debug_Generated_Code
987 or else Debug_Flag_VV
988 or else Needs_Debug_Info (T)
990 Set_Debug_Info_Needed (T);
992 end Check_Debug_Info_Needed;
994 ----------------------------
995 -- Check_Strict_Alignment --
996 ----------------------------
998 procedure Check_Strict_Alignment (E : Entity_Id) is
1002 if Is_Tagged_Type (E) or else Is_Concurrent_Type (E) then
1003 Set_Strict_Alignment (E);
1005 elsif Is_Array_Type (E) then
1006 Set_Strict_Alignment (E, Strict_Alignment (Component_Type (E)));
1008 elsif Is_Record_Type (E) then
1009 if Is_Limited_Record (E) then
1010 Set_Strict_Alignment (E);
1014 Comp := First_Component (E);
1016 while Present (Comp) loop
1017 if not Is_Type (Comp)
1018 and then (Strict_Alignment (Etype (Comp))
1019 or else Is_Aliased (Comp))
1021 Set_Strict_Alignment (E);
1025 Next_Component (Comp);
1028 end Check_Strict_Alignment;
1030 -------------------------
1031 -- Check_Unsigned_Type --
1032 -------------------------
1034 procedure Check_Unsigned_Type (E : Entity_Id) is
1035 Ancestor : Entity_Id;
1040 if not Is_Discrete_Or_Fixed_Point_Type (E) then
1044 -- Do not attempt to analyze case where range was in error
1046 if Error_Posted (Scalar_Range (E)) then
1050 -- The situation that is non trivial is something like
1052 -- subtype x1 is integer range -10 .. +10;
1053 -- subtype x2 is x1 range 0 .. V1;
1054 -- subtype x3 is x2 range V2 .. V3;
1055 -- subtype x4 is x3 range V4 .. V5;
1057 -- where Vn are variables. Here the base type is signed, but we still
1058 -- know that x4 is unsigned because of the lower bound of x2.
1060 -- The only way to deal with this is to look up the ancestor chain
1064 if Ancestor = Any_Type or else Etype (Ancestor) = Any_Type then
1068 Lo_Bound := Type_Low_Bound (Ancestor);
1070 if Compile_Time_Known_Value (Lo_Bound) then
1072 if Expr_Rep_Value (Lo_Bound) >= 0 then
1073 Set_Is_Unsigned_Type (E, True);
1079 Ancestor := Ancestor_Subtype (Ancestor);
1081 -- If no ancestor had a static lower bound, go to base type
1083 if No (Ancestor) then
1085 -- Note: the reason we still check for a compile time known
1086 -- value for the base type is that at least in the case of
1087 -- generic formals, we can have bounds that fail this test,
1088 -- and there may be other cases in error situations.
1090 Btyp := Base_Type (E);
1092 if Btyp = Any_Type or else Etype (Btyp) = Any_Type then
1096 Lo_Bound := Type_Low_Bound (Base_Type (E));
1098 if Compile_Time_Known_Value (Lo_Bound)
1099 and then Expr_Rep_Value (Lo_Bound) >= 0
1101 Set_Is_Unsigned_Type (E, True);
1108 end Check_Unsigned_Type;
1110 -----------------------------
1111 -- Expand_Atomic_Aggregate --
1112 -----------------------------
1114 procedure Expand_Atomic_Aggregate (E : Entity_Id; Typ : Entity_Id) is
1115 Loc : constant Source_Ptr := Sloc (E);
1120 if (Nkind (Parent (E)) = N_Object_Declaration
1121 or else Nkind (Parent (E)) = N_Assignment_Statement)
1122 and then Comes_From_Source (Parent (E))
1123 and then Nkind (E) = N_Aggregate
1126 Make_Defining_Identifier (Loc,
1127 New_Internal_Name ('T'));
1130 Make_Object_Declaration (Loc,
1131 Defining_Identifier => Temp,
1132 Object_Definition => New_Occurrence_Of (Typ, Loc),
1133 Expression => Relocate_Node (E));
1134 Insert_Before (Parent (E), New_N);
1137 Set_Expression (Parent (E), New_Occurrence_Of (Temp, Loc));
1139 -- To prevent the temporary from being constant-folded (which would
1140 -- lead to the same piecemeal assignment on the original target)
1141 -- indicate to the back-end that the temporary is a variable with
1142 -- real storage. See description of this flag in Einfo, and the notes
1143 -- on N_Assignment_Statement and N_Object_Declaration in Sinfo.
1145 Set_Is_True_Constant (Temp, False);
1147 end Expand_Atomic_Aggregate;
1153 -- Note: the easy coding for this procedure would be to just build a
1154 -- single list of freeze nodes and then insert them and analyze them
1155 -- all at once. This won't work, because the analysis of earlier freeze
1156 -- nodes may recursively freeze types which would otherwise appear later
1157 -- on in the freeze list. So we must analyze and expand the freeze nodes
1158 -- as they are generated.
1160 procedure Freeze_All (From : Entity_Id; After : in out Node_Id) is
1161 Loc : constant Source_Ptr := Sloc (After);
1165 procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id);
1166 -- This is the internal recursive routine that does freezing of entities
1167 -- (but NOT the analysis of default expressions, which should not be
1168 -- recursive, we don't want to analyze those till we are sure that ALL
1169 -- the types are frozen).
1171 --------------------
1172 -- Freeze_All_Ent --
1173 --------------------
1175 procedure Freeze_All_Ent
1177 After : in out Node_Id)
1183 procedure Process_Flist;
1184 -- If freeze nodes are present, insert and analyze, and reset cursor
1185 -- for next insertion.
1191 procedure Process_Flist is
1193 if Is_Non_Empty_List (Flist) then
1194 Lastn := Next (After);
1195 Insert_List_After_And_Analyze (After, Flist);
1197 if Present (Lastn) then
1198 After := Prev (Lastn);
1200 After := Last (List_Containing (After));
1205 -- Start or processing for Freeze_All_Ent
1209 while Present (E) loop
1211 -- If the entity is an inner package which is not a package
1212 -- renaming, then its entities must be frozen at this point. Note
1213 -- that such entities do NOT get frozen at the end of the nested
1214 -- package itself (only library packages freeze).
1216 -- Same is true for task declarations, where anonymous records
1217 -- created for entry parameters must be frozen.
1219 if Ekind (E) = E_Package
1220 and then No (Renamed_Object (E))
1221 and then not Is_Child_Unit (E)
1222 and then not Is_Frozen (E)
1225 Install_Visible_Declarations (E);
1226 Install_Private_Declarations (E);
1228 Freeze_All (First_Entity (E), After);
1230 End_Package_Scope (E);
1232 elsif Ekind (E) in Task_Kind
1234 (Nkind (Parent (E)) = N_Task_Type_Declaration
1236 Nkind (Parent (E)) = N_Single_Task_Declaration)
1239 Freeze_All (First_Entity (E), After);
1242 -- For a derived tagged type, we must ensure that all the
1243 -- primitive operations of the parent have been frozen, so that
1244 -- their addresses will be in the parent's dispatch table at the
1245 -- point it is inherited.
1247 elsif Ekind (E) = E_Record_Type
1248 and then Is_Tagged_Type (E)
1249 and then Is_Tagged_Type (Etype (E))
1250 and then Is_Derived_Type (E)
1253 Prim_List : constant Elist_Id :=
1254 Primitive_Operations (Etype (E));
1260 Prim := First_Elmt (Prim_List);
1262 while Present (Prim) loop
1263 Subp := Node (Prim);
1265 if Comes_From_Source (Subp)
1266 and then not Is_Frozen (Subp)
1268 Flist := Freeze_Entity (Subp, Loc);
1277 if not Is_Frozen (E) then
1278 Flist := Freeze_Entity (E, Loc);
1282 -- If an incomplete type is still not frozen, this may be a
1283 -- premature freezing because of a body declaration that follows.
1284 -- Indicate where the freezing took place.
1286 -- If the freezing is caused by the end of the current declarative
1287 -- part, it is a Taft Amendment type, and there is no error.
1289 if not Is_Frozen (E)
1290 and then Ekind (E) = E_Incomplete_Type
1293 Bod : constant Node_Id := Next (After);
1296 if (Nkind (Bod) = N_Subprogram_Body
1297 or else Nkind (Bod) = N_Entry_Body
1298 or else Nkind (Bod) = N_Package_Body
1299 or else Nkind (Bod) = N_Protected_Body
1300 or else Nkind (Bod) = N_Task_Body
1301 or else Nkind (Bod) in N_Body_Stub)
1303 List_Containing (After) = List_Containing (Parent (E))
1305 Error_Msg_Sloc := Sloc (Next (After));
1307 ("type& is frozen# before its full declaration",
1317 -- Start of processing for Freeze_All
1320 Freeze_All_Ent (From, After);
1322 -- Now that all types are frozen, we can deal with default expressions
1323 -- that require us to build a default expression functions. This is the
1324 -- point at which such functions are constructed (after all types that
1325 -- might be used in such expressions have been frozen).
1327 -- We also add finalization chains to access types whose designated
1328 -- types are controlled. This is normally done when freezing the type,
1329 -- but this misses recursive type definitions where the later members
1330 -- of the recursion introduce controlled components.
1332 -- Loop through entities
1335 while Present (E) loop
1336 if Is_Subprogram (E) then
1338 if not Default_Expressions_Processed (E) then
1339 Process_Default_Expressions (E, After);
1342 if not Has_Completion (E) then
1343 Decl := Unit_Declaration_Node (E);
1345 if Nkind (Decl) = N_Subprogram_Renaming_Declaration then
1346 Build_And_Analyze_Renamed_Body (Decl, E, After);
1348 elsif Nkind (Decl) = N_Subprogram_Declaration
1349 and then Present (Corresponding_Body (Decl))
1351 Nkind (Unit_Declaration_Node (Corresponding_Body (Decl)))
1352 = N_Subprogram_Renaming_Declaration
1354 Build_And_Analyze_Renamed_Body
1355 (Decl, Corresponding_Body (Decl), After);
1359 elsif Ekind (E) in Task_Kind
1361 (Nkind (Parent (E)) = N_Task_Type_Declaration
1363 Nkind (Parent (E)) = N_Single_Task_Declaration)
1368 Ent := First_Entity (E);
1370 while Present (Ent) loop
1373 and then not Default_Expressions_Processed (Ent)
1375 Process_Default_Expressions (Ent, After);
1382 elsif Is_Access_Type (E)
1383 and then Comes_From_Source (E)
1384 and then Ekind (Directly_Designated_Type (E)) = E_Incomplete_Type
1385 and then Controlled_Type (Designated_Type (E))
1386 and then No (Associated_Final_Chain (E))
1388 Build_Final_List (Parent (E), E);
1395 -----------------------
1396 -- Freeze_And_Append --
1397 -----------------------
1399 procedure Freeze_And_Append
1402 Result : in out List_Id)
1404 L : constant List_Id := Freeze_Entity (Ent, Loc);
1406 if Is_Non_Empty_List (L) then
1407 if Result = No_List then
1410 Append_List (L, Result);
1413 end Freeze_And_Append;
1419 procedure Freeze_Before (N : Node_Id; T : Entity_Id) is
1420 Freeze_Nodes : constant List_Id := Freeze_Entity (T, Sloc (N));
1422 if Is_Non_Empty_List (Freeze_Nodes) then
1423 Insert_Actions (N, Freeze_Nodes);
1431 function Freeze_Entity (E : Entity_Id; Loc : Source_Ptr) return List_Id is
1432 Test_E : Entity_Id := E;
1440 procedure Check_Current_Instance (Comp_Decl : Node_Id);
1441 -- Check that an Access or Unchecked_Access attribute with a prefix
1442 -- which is the current instance type can only be applied when the type
1445 function After_Last_Declaration return Boolean;
1446 -- If Loc is a freeze_entity that appears after the last declaration
1447 -- in the scope, inhibit error messages on late completion.
1449 procedure Freeze_Record_Type (Rec : Entity_Id);
1450 -- Freeze each component, handle some representation clauses, and freeze
1451 -- primitive operations if this is a tagged type.
1453 ----------------------------
1454 -- After_Last_Declaration --
1455 ----------------------------
1457 function After_Last_Declaration return Boolean is
1458 Spec : constant Node_Id := Parent (Current_Scope);
1460 if Nkind (Spec) = N_Package_Specification then
1461 if Present (Private_Declarations (Spec)) then
1462 return Loc >= Sloc (Last (Private_Declarations (Spec)));
1463 elsif Present (Visible_Declarations (Spec)) then
1464 return Loc >= Sloc (Last (Visible_Declarations (Spec)));
1471 end After_Last_Declaration;
1473 ----------------------------
1474 -- Check_Current_Instance --
1475 ----------------------------
1477 procedure Check_Current_Instance (Comp_Decl : Node_Id) is
1479 Rec_Type : constant Entity_Id :=
1480 Scope (Defining_Identifier (Comp_Decl));
1482 Decl : constant Node_Id := Parent (Rec_Type);
1484 function Process (N : Node_Id) return Traverse_Result;
1485 -- Process routine to apply check to given node
1491 function Process (N : Node_Id) return Traverse_Result is
1494 when N_Attribute_Reference =>
1495 if (Attribute_Name (N) = Name_Access
1497 Attribute_Name (N) = Name_Unchecked_Access)
1498 and then Is_Entity_Name (Prefix (N))
1499 and then Is_Type (Entity (Prefix (N)))
1500 and then Entity (Prefix (N)) = E
1503 ("current instance must be a limited type", Prefix (N));
1509 when others => return OK;
1513 procedure Traverse is new Traverse_Proc (Process);
1515 -- Start of processing for Check_Current_Instance
1518 -- In Ada95, the (imprecise) rule is that the current instance of a
1519 -- limited type is aliased. In Ada2005, limitedness must be explicit:
1520 -- either a tagged type, or a limited record.
1522 if Is_Limited_Type (Rec_Type)
1524 (Ada_Version < Ada_05
1525 or else Is_Tagged_Type (Rec_Type))
1529 elsif Nkind (Decl) = N_Full_Type_Declaration
1530 and then Limited_Present (Type_Definition (Decl))
1535 Traverse (Comp_Decl);
1537 end Check_Current_Instance;
1539 ------------------------
1540 -- Freeze_Record_Type --
1541 ------------------------
1543 procedure Freeze_Record_Type (Rec : Entity_Id) is
1550 pragma Warnings (Off, Junk);
1552 Unplaced_Component : Boolean := False;
1553 -- Set True if we find at least one component with no component
1554 -- clause (used to warn about useless Pack pragmas).
1556 Placed_Component : Boolean := False;
1557 -- Set True if we find at least one component with a component
1558 -- clause (used to warn about useless Bit_Order pragmas).
1560 function Check_Allocator (N : Node_Id) return Node_Id;
1561 -- If N is an allocator, possibly wrapped in one or more level of
1562 -- qualified expression(s), return the inner allocator node, else
1565 procedure Check_Itype (Typ : Entity_Id);
1566 -- If the component subtype is an access to a constrained subtype of
1567 -- an already frozen type, make the subtype frozen as well. It might
1568 -- otherwise be frozen in the wrong scope, and a freeze node on
1569 -- subtype has no effect. Similarly, if the component subtype is a
1570 -- regular (not protected) access to subprogram, set the anonymous
1571 -- subprogram type to frozen as well, to prevent an out-of-scope
1572 -- freeze node at some eventual point of call. Protected operations
1573 -- are handled elsewhere.
1575 ---------------------
1576 -- Check_Allocator --
1577 ---------------------
1579 function Check_Allocator (N : Node_Id) return Node_Id is
1584 if Nkind (Inner) = N_Allocator then
1586 elsif Nkind (Inner) = N_Qualified_Expression then
1587 Inner := Expression (Inner);
1592 end Check_Allocator;
1598 procedure Check_Itype (Typ : Entity_Id) is
1599 Desig : constant Entity_Id := Designated_Type (Typ);
1602 if not Is_Frozen (Desig)
1603 and then Is_Frozen (Base_Type (Desig))
1605 Set_Is_Frozen (Desig);
1607 -- In addition, add an Itype_Reference to ensure that the
1608 -- access subtype is elaborated early enough. This cannot be
1609 -- done if the subtype may depend on discriminants.
1611 if Ekind (Comp) = E_Component
1612 and then Is_Itype (Etype (Comp))
1613 and then not Has_Discriminants (Rec)
1615 IR := Make_Itype_Reference (Sloc (Comp));
1616 Set_Itype (IR, Desig);
1619 Result := New_List (IR);
1621 Append (IR, Result);
1625 elsif Ekind (Typ) = E_Anonymous_Access_Subprogram_Type
1626 and then Convention (Desig) /= Convention_Protected
1628 Set_Is_Frozen (Desig);
1632 -- Start of processing for Freeze_Record_Type
1635 -- If this is a subtype of a controlled type, declared without a
1636 -- constraint, the _controller may not appear in the component list
1637 -- if the parent was not frozen at the point of subtype declaration.
1638 -- Inherit the _controller component now.
1640 if Rec /= Base_Type (Rec)
1641 and then Has_Controlled_Component (Rec)
1643 if Nkind (Parent (Rec)) = N_Subtype_Declaration
1644 and then Is_Entity_Name (Subtype_Indication (Parent (Rec)))
1646 Set_First_Entity (Rec, First_Entity (Base_Type (Rec)));
1648 -- If this is an internal type without a declaration, as for
1649 -- record component, the base type may not yet be frozen, and its
1650 -- controller has not been created. Add an explicit freeze node
1651 -- for the itype, so it will be frozen after the base type. This
1652 -- freeze node is used to communicate with the expander, in order
1653 -- to create the controller for the enclosing record, and it is
1654 -- deleted afterwards (see exp_ch3). It must not be created when
1655 -- expansion is off, because it might appear in the wrong context
1656 -- for the back end.
1658 elsif Is_Itype (Rec)
1659 and then Has_Delayed_Freeze (Base_Type (Rec))
1661 Nkind (Associated_Node_For_Itype (Rec)) =
1662 N_Component_Declaration
1663 and then Expander_Active
1665 Ensure_Freeze_Node (Rec);
1669 -- Freeze components and embedded subtypes
1671 Comp := First_Entity (Rec);
1673 while Present (Comp) loop
1675 -- First handle the (real) component case
1677 if Ekind (Comp) = E_Component
1678 or else Ekind (Comp) = E_Discriminant
1681 CC : constant Node_Id := Component_Clause (Comp);
1684 -- Freezing a record type freezes the type of each of its
1685 -- components. However, if the type of the component is
1686 -- part of this record, we do not want or need a separate
1687 -- Freeze_Node. Note that Is_Itype is wrong because that's
1688 -- also set in private type cases. We also can't check for
1689 -- the Scope being exactly Rec because of private types and
1690 -- record extensions.
1692 if Is_Itype (Etype (Comp))
1693 and then Is_Record_Type (Underlying_Type
1694 (Scope (Etype (Comp))))
1696 Undelay_Type (Etype (Comp));
1699 Freeze_And_Append (Etype (Comp), Loc, Result);
1701 -- Check for error of component clause given for variable
1702 -- sized type. We have to delay this test till this point,
1703 -- since the component type has to be frozen for us to know
1704 -- if it is variable length. We omit this test in a generic
1705 -- context, it will be applied at instantiation time.
1707 if Present (CC) then
1708 Placed_Component := True;
1710 if Inside_A_Generic then
1714 Size_Known_At_Compile_Time
1715 (Underlying_Type (Etype (Comp)))
1718 ("component clause not allowed for variable " &
1719 "length component", CC);
1723 Unplaced_Component := True;
1726 -- Case of component requires byte alignment
1728 if Must_Be_On_Byte_Boundary (Etype (Comp)) then
1730 -- Set the enclosing record to also require byte align
1732 Set_Must_Be_On_Byte_Boundary (Rec);
1734 -- Check for component clause that is inconsistent with
1735 -- the required byte boundary alignment.
1738 and then Normalized_First_Bit (Comp) mod
1739 System_Storage_Unit /= 0
1742 ("component & must be byte aligned",
1743 Component_Name (Component_Clause (Comp)));
1747 -- If component clause is present, then deal with the non-
1748 -- default bit order case for Ada 95 mode. The required
1749 -- processing for Ada 2005 mode is handled separately after
1750 -- processing all components.
1752 -- We only do this processing for the base type, and in
1753 -- fact that's important, since otherwise if there are
1754 -- record subtypes, we could reverse the bits once for
1755 -- each subtype, which would be incorrect.
1758 and then Reverse_Bit_Order (Rec)
1759 and then Ekind (E) = E_Record_Type
1760 and then Ada_Version <= Ada_95
1763 CFB : constant Uint := Component_Bit_Offset (Comp);
1764 CSZ : constant Uint := Esize (Comp);
1765 CLC : constant Node_Id := Component_Clause (Comp);
1766 Pos : constant Node_Id := Position (CLC);
1767 FB : constant Node_Id := First_Bit (CLC);
1769 Storage_Unit_Offset : constant Uint :=
1770 CFB / System_Storage_Unit;
1772 Start_Bit : constant Uint :=
1773 CFB mod System_Storage_Unit;
1776 -- Cases where field goes over storage unit boundary
1778 if Start_Bit + CSZ > System_Storage_Unit then
1780 -- Allow multi-byte field but generate warning
1782 if Start_Bit mod System_Storage_Unit = 0
1783 and then CSZ mod System_Storage_Unit = 0
1786 ("multi-byte field specified with non-standard"
1787 & " Bit_Order?", CLC);
1789 if Bytes_Big_Endian then
1791 ("bytes are not reversed "
1792 & "(component is big-endian)?", CLC);
1795 ("bytes are not reversed "
1796 & "(component is little-endian)?", CLC);
1799 -- Do not allow non-contiguous field
1803 ("attempt to specify non-contiguous field"
1804 & " not permitted", CLC);
1806 ("\(caused by non-standard Bit_Order "
1807 & "specified)", CLC);
1810 -- Case where field fits in one storage unit
1813 -- Give warning if suspicious component clause
1815 if Intval (FB) >= System_Storage_Unit
1816 and then Warn_On_Reverse_Bit_Order
1819 ("?Bit_Order clause does not affect " &
1820 "byte ordering", Pos);
1822 Intval (Pos) + Intval (FB) /
1823 System_Storage_Unit;
1825 ("?position normalized to ^ before bit " &
1826 "order interpreted", Pos);
1829 -- Here is where we fix up the Component_Bit_Offset
1830 -- value to account for the reverse bit order.
1831 -- Some examples of what needs to be done are:
1833 -- First_Bit .. Last_Bit Component_Bit_Offset
1836 -- 0 .. 0 7 .. 7 0 7
1837 -- 0 .. 1 6 .. 7 0 6
1838 -- 0 .. 2 5 .. 7 0 5
1839 -- 0 .. 7 0 .. 7 0 4
1841 -- 1 .. 1 6 .. 6 1 6
1842 -- 1 .. 4 3 .. 6 1 3
1843 -- 4 .. 7 0 .. 3 4 0
1845 -- The general rule is that the first bit is
1846 -- is obtained by subtracting the old ending bit
1847 -- from storage_unit - 1.
1849 Set_Component_Bit_Offset
1851 (Storage_Unit_Offset * System_Storage_Unit) +
1852 (System_Storage_Unit - 1) -
1853 (Start_Bit + CSZ - 1));
1855 Set_Normalized_First_Bit
1857 Component_Bit_Offset (Comp) mod
1858 System_Storage_Unit);
1865 -- If the component is an Itype with Delayed_Freeze and is either
1866 -- a record or array subtype and its base type has not yet been
1867 -- frozen, we must remove this from the entity list of this
1868 -- record and put it on the entity list of the scope of its base
1869 -- type. Note that we know that this is not the type of a
1870 -- component since we cleared Has_Delayed_Freeze for it in the
1871 -- previous loop. Thus this must be the Designated_Type of an
1872 -- access type, which is the type of a component.
1875 and then Is_Type (Scope (Comp))
1876 and then Is_Composite_Type (Comp)
1877 and then Base_Type (Comp) /= Comp
1878 and then Has_Delayed_Freeze (Comp)
1879 and then not Is_Frozen (Base_Type (Comp))
1882 Will_Be_Frozen : Boolean := False;
1886 -- We have a pretty bad kludge here. Suppose Rec is subtype
1887 -- being defined in a subprogram that's created as part of
1888 -- the freezing of Rec'Base. In that case, we know that
1889 -- Comp'Base must have already been frozen by the time we
1890 -- get to elaborate this because Gigi doesn't elaborate any
1891 -- bodies until it has elaborated all of the declarative
1892 -- part. But Is_Frozen will not be set at this point because
1893 -- we are processing code in lexical order.
1895 -- We detect this case by going up the Scope chain of Rec
1896 -- and seeing if we have a subprogram scope before reaching
1897 -- the top of the scope chain or that of Comp'Base. If we
1898 -- do, then mark that Comp'Base will actually be frozen. If
1899 -- so, we merely undelay it.
1902 while Present (S) loop
1903 if Is_Subprogram (S) then
1904 Will_Be_Frozen := True;
1906 elsif S = Scope (Base_Type (Comp)) then
1913 if Will_Be_Frozen then
1914 Undelay_Type (Comp);
1916 if Present (Prev) then
1917 Set_Next_Entity (Prev, Next_Entity (Comp));
1919 Set_First_Entity (Rec, Next_Entity (Comp));
1922 -- Insert in entity list of scope of base type (which
1923 -- must be an enclosing scope, because still unfrozen).
1925 Append_Entity (Comp, Scope (Base_Type (Comp)));
1929 -- If the component is an access type with an allocator as default
1930 -- value, the designated type will be frozen by the corresponding
1931 -- expression in init_proc. In order to place the freeze node for
1932 -- the designated type before that for the current record type,
1935 -- Same process if the component is an array of access types,
1936 -- initialized with an aggregate. If the designated type is
1937 -- private, it cannot contain allocators, and it is premature
1938 -- to freeze the type, so we check for this as well.
1940 elsif Is_Access_Type (Etype (Comp))
1941 and then Present (Parent (Comp))
1942 and then Present (Expression (Parent (Comp)))
1945 Alloc : constant Node_Id :=
1946 Check_Allocator (Expression (Parent (Comp)));
1949 if Present (Alloc) then
1951 -- If component is pointer to a classwide type, freeze
1952 -- the specific type in the expression being allocated.
1953 -- The expression may be a subtype indication, in which
1954 -- case freeze the subtype mark.
1956 if Is_Class_Wide_Type
1957 (Designated_Type (Etype (Comp)))
1959 if Is_Entity_Name (Expression (Alloc)) then
1961 (Entity (Expression (Alloc)), Loc, Result);
1963 Nkind (Expression (Alloc)) = N_Subtype_Indication
1966 (Entity (Subtype_Mark (Expression (Alloc))),
1970 elsif Is_Itype (Designated_Type (Etype (Comp))) then
1971 Check_Itype (Etype (Comp));
1975 (Designated_Type (Etype (Comp)), Loc, Result);
1980 elsif Is_Access_Type (Etype (Comp))
1981 and then Is_Itype (Designated_Type (Etype (Comp)))
1983 Check_Itype (Etype (Comp));
1985 elsif Is_Array_Type (Etype (Comp))
1986 and then Is_Access_Type (Component_Type (Etype (Comp)))
1987 and then Present (Parent (Comp))
1988 and then Nkind (Parent (Comp)) = N_Component_Declaration
1989 and then Present (Expression (Parent (Comp)))
1990 and then Nkind (Expression (Parent (Comp))) = N_Aggregate
1991 and then Is_Fully_Defined
1992 (Designated_Type (Component_Type (Etype (Comp))))
1996 (Component_Type (Etype (Comp))), Loc, Result);
2003 -- Deal with pragma Bit_Order
2005 if Reverse_Bit_Order (Rec) and then Base_Type (Rec) = Rec then
2006 if not Placed_Component then
2008 Get_Attribute_Definition_Clause (Rec, Attribute_Bit_Order);
2010 ("?Bit_Order specification has no effect", ADC);
2012 ("\?since no component clauses were specified", ADC);
2014 -- Here is where we do Ada 2005 processing for bit order (the Ada
2015 -- 95 case was already taken care of above).
2017 elsif Ada_Version >= Ada_05 then
2018 Adjust_Record_For_Reverse_Bit_Order (Rec);
2022 -- Set OK_To_Reorder_Components depending on debug flags
2024 if Rec = Base_Type (Rec)
2025 and then Convention (Rec) = Convention_Ada
2027 if (Has_Discriminants (Rec) and then Debug_Flag_Dot_V)
2029 (not Has_Discriminants (Rec) and then Debug_Flag_Dot_R)
2031 Set_OK_To_Reorder_Components (Rec);
2035 -- Check for useless pragma Pack when all components placed. We only
2036 -- do this check for record types, not subtypes, since a subtype may
2037 -- have all its components placed, and it still makes perfectly good
2038 -- sense to pack other subtypes or the parent type. We do not give
2039 -- this warning if Optimize_Alignment is set to Space, since the
2040 -- pragma Pack does have an effect in this case (it always resets
2041 -- the alignment to one).
2043 if Ekind (Rec) = E_Record_Type
2044 and then Is_Packed (Rec)
2045 and then not Unplaced_Component
2046 and then Optimize_Alignment /= 'S'
2048 -- Reset packed status. Probably not necessary, but we do it so
2049 -- that there is no chance of the back end doing something strange
2050 -- with this redundant indication of packing.
2052 Set_Is_Packed (Rec, False);
2054 -- Give warning if redundant constructs warnings on
2056 if Warn_On_Redundant_Constructs then
2058 ("?pragma Pack has no effect, no unplaced components",
2059 Get_Rep_Pragma (Rec, Name_Pack));
2063 -- If this is the record corresponding to a remote type, freeze the
2064 -- remote type here since that is what we are semantically freezing.
2065 -- This prevents the freeze node for that type in an inner scope.
2067 -- Also, Check for controlled components and unchecked unions.
2068 -- Finally, enforce the restriction that access attributes with a
2069 -- current instance prefix can only apply to limited types.
2071 if Ekind (Rec) = E_Record_Type then
2072 if Present (Corresponding_Remote_Type (Rec)) then
2074 (Corresponding_Remote_Type (Rec), Loc, Result);
2077 Comp := First_Component (Rec);
2078 while Present (Comp) loop
2079 if Has_Controlled_Component (Etype (Comp))
2080 or else (Chars (Comp) /= Name_uParent
2081 and then Is_Controlled (Etype (Comp)))
2082 or else (Is_Protected_Type (Etype (Comp))
2084 (Corresponding_Record_Type (Etype (Comp)))
2085 and then Has_Controlled_Component
2086 (Corresponding_Record_Type (Etype (Comp))))
2088 Set_Has_Controlled_Component (Rec);
2092 if Has_Unchecked_Union (Etype (Comp)) then
2093 Set_Has_Unchecked_Union (Rec);
2096 if Has_Per_Object_Constraint (Comp) then
2098 -- Scan component declaration for likely misuses of current
2099 -- instance, either in a constraint or a default expression.
2101 Check_Current_Instance (Parent (Comp));
2104 Next_Component (Comp);
2108 Set_Component_Alignment_If_Not_Set (Rec);
2110 -- For first subtypes, check if there are any fixed-point fields with
2111 -- component clauses, where we must check the size. This is not done
2112 -- till the freeze point, since for fixed-point types, we do not know
2113 -- the size until the type is frozen. Similar processing applies to
2114 -- bit packed arrays.
2116 if Is_First_Subtype (Rec) then
2117 Comp := First_Component (Rec);
2119 while Present (Comp) loop
2120 if Present (Component_Clause (Comp))
2121 and then (Is_Fixed_Point_Type (Etype (Comp))
2123 Is_Bit_Packed_Array (Etype (Comp)))
2126 (Component_Name (Component_Clause (Comp)),
2132 Next_Component (Comp);
2136 -- Generate warning for applying C or C++ convention to a record
2137 -- with discriminants. This is suppressed for the unchecked union
2138 -- case, since the whole point in this case is interface C. We also
2139 -- do not generate this within instantiations, since we will have
2140 -- generated a message on the template.
2142 if Has_Discriminants (E)
2143 and then not Is_Unchecked_Union (E)
2144 and then (Convention (E) = Convention_C
2146 Convention (E) = Convention_CPP)
2147 and then Comes_From_Source (E)
2148 and then not In_Instance
2149 and then not Has_Warnings_Off (E)
2150 and then not Has_Warnings_Off (Base_Type (E))
2153 Cprag : constant Node_Id := Get_Rep_Pragma (E, Name_Convention);
2157 if Present (Cprag) then
2158 A2 := Next (First (Pragma_Argument_Associations (Cprag)));
2160 if Convention (E) = Convention_C then
2162 ("?variant record has no direct equivalent in C", A2);
2165 ("?variant record has no direct equivalent in C++", A2);
2169 ("\?use of convention for type& is dubious", A2, E);
2173 end Freeze_Record_Type;
2175 -- Start of processing for Freeze_Entity
2178 -- We are going to test for various reasons why this entity need not be
2179 -- frozen here, but in the case of an Itype that's defined within a
2180 -- record, that test actually applies to the record.
2182 if Is_Itype (E) and then Is_Record_Type (Scope (E)) then
2183 Test_E := Scope (E);
2184 elsif Is_Itype (E) and then Present (Underlying_Type (Scope (E)))
2185 and then Is_Record_Type (Underlying_Type (Scope (E)))
2187 Test_E := Underlying_Type (Scope (E));
2190 -- Do not freeze if already frozen since we only need one freeze node
2192 if Is_Frozen (E) then
2195 -- It is improper to freeze an external entity within a generic because
2196 -- its freeze node will appear in a non-valid context. The entity will
2197 -- be frozen in the proper scope after the current generic is analyzed.
2199 elsif Inside_A_Generic and then External_Ref_In_Generic (Test_E) then
2202 -- Do not freeze a global entity within an inner scope created during
2203 -- expansion. A call to subprogram E within some internal procedure
2204 -- (a stream attribute for example) might require freezing E, but the
2205 -- freeze node must appear in the same declarative part as E itself.
2206 -- The two-pass elaboration mechanism in gigi guarantees that E will
2207 -- be frozen before the inner call is elaborated. We exclude constants
2208 -- from this test, because deferred constants may be frozen early, and
2209 -- must be diagnosed (e.g. in the case of a deferred constant being used
2210 -- in a default expression). If the enclosing subprogram comes from
2211 -- source, or is a generic instance, then the freeze point is the one
2212 -- mandated by the language, and we freeze the entity. A subprogram that
2213 -- is a child unit body that acts as a spec does not have a spec that
2214 -- comes from source, but can only come from source.
2216 elsif In_Open_Scopes (Scope (Test_E))
2217 and then Scope (Test_E) /= Current_Scope
2218 and then Ekind (Test_E) /= E_Constant
2221 S : Entity_Id := Current_Scope;
2224 while Present (S) loop
2225 if Is_Overloadable (S) then
2226 if Comes_From_Source (S)
2227 or else Is_Generic_Instance (S)
2228 or else Is_Child_Unit (S)
2240 -- Similarly, an inlined instance body may make reference to global
2241 -- entities, but these references cannot be the proper freezing point
2242 -- for them, and in the absence of inlining freezing will take place in
2243 -- their own scope. Normally instance bodies are analyzed after the
2244 -- enclosing compilation, and everything has been frozen at the proper
2245 -- place, but with front-end inlining an instance body is compiled
2246 -- before the end of the enclosing scope, and as a result out-of-order
2247 -- freezing must be prevented.
2249 elsif Front_End_Inlining
2250 and then In_Instance_Body
2251 and then Present (Scope (Test_E))
2254 S : Entity_Id := Scope (Test_E);
2257 while Present (S) loop
2258 if Is_Generic_Instance (S) then
2271 -- Here to freeze the entity
2276 -- Case of entity being frozen is other than a type
2278 if not Is_Type (E) then
2280 -- If entity is exported or imported and does not have an external
2281 -- name, now is the time to provide the appropriate default name.
2282 -- Skip this if the entity is stubbed, since we don't need a name
2283 -- for any stubbed routine.
2285 if (Is_Imported (E) or else Is_Exported (E))
2286 and then No (Interface_Name (E))
2287 and then Convention (E) /= Convention_Stubbed
2289 Set_Encoded_Interface_Name
2290 (E, Get_Default_External_Name (E));
2292 -- Special processing for atomic objects appearing in object decls
2295 and then Nkind (Parent (E)) = N_Object_Declaration
2296 and then Present (Expression (Parent (E)))
2299 Expr : constant Node_Id := Expression (Parent (E));
2302 -- If expression is an aggregate, assign to a temporary to
2303 -- ensure that the actual assignment is done atomically rather
2304 -- than component-wise (the assignment to the temp may be done
2305 -- component-wise, but that is harmless).
2307 if Nkind (Expr) = N_Aggregate then
2308 Expand_Atomic_Aggregate (Expr, Etype (E));
2310 -- If the expression is a reference to a record or array object
2311 -- entity, then reset Is_True_Constant to False so that the
2312 -- compiler will not optimize away the intermediate object,
2313 -- which we need in this case for the same reason (to ensure
2314 -- that the actual assignment is atomic, rather than
2317 elsif Is_Entity_Name (Expr)
2318 and then (Is_Record_Type (Etype (Expr))
2320 Is_Array_Type (Etype (Expr)))
2322 Set_Is_True_Constant (Entity (Expr), False);
2327 -- For a subprogram, freeze all parameter types and also the return
2328 -- type (RM 13.14(14)). However skip this for internal subprograms.
2329 -- This is also the point where any extra formal parameters are
2330 -- created since we now know whether the subprogram will use
2331 -- a foreign convention.
2333 if Is_Subprogram (E) then
2334 if not Is_Internal (E) then
2338 Warn_Node : Node_Id;
2341 -- Loop through formals
2343 Formal := First_Formal (E);
2344 while Present (Formal) loop
2345 F_Type := Etype (Formal);
2346 Freeze_And_Append (F_Type, Loc, Result);
2348 if Is_Private_Type (F_Type)
2349 and then Is_Private_Type (Base_Type (F_Type))
2350 and then No (Full_View (Base_Type (F_Type)))
2351 and then not Is_Generic_Type (F_Type)
2352 and then not Is_Derived_Type (F_Type)
2354 -- If the type of a formal is incomplete, subprogram
2355 -- is being frozen prematurely. Within an instance
2356 -- (but not within a wrapper package) this is an
2357 -- an artifact of our need to regard the end of an
2358 -- instantiation as a freeze point. Otherwise it is
2359 -- a definite error.
2361 -- and then not Is_Wrapper_Package (Current_Scope) ???
2364 Set_Is_Frozen (E, False);
2367 elsif not After_Last_Declaration
2368 and then not Freezing_Library_Level_Tagged_Type
2370 Error_Msg_Node_1 := F_Type;
2372 ("type& must be fully defined before this point",
2377 -- Check suspicious parameter for C function. These tests
2378 -- apply only to exported/imported subprograms.
2380 if Warn_On_Export_Import
2381 and then Comes_From_Source (E)
2382 and then (Convention (E) = Convention_C
2384 Convention (E) = Convention_CPP)
2385 and then (Is_Imported (E) or else Is_Exported (E))
2386 and then Convention (E) /= Convention (Formal)
2387 and then not Has_Warnings_Off (E)
2388 and then not Has_Warnings_Off (F_Type)
2389 and then not Has_Warnings_Off (Formal)
2391 Error_Msg_Qual_Level := 1;
2393 -- Check suspicious use of fat C pointer
2395 if Is_Access_Type (F_Type)
2396 and then Esize (F_Type) > Ttypes.System_Address_Size
2399 ("?type of & does not correspond "
2400 & "to C pointer!", Formal);
2402 -- Check suspicious return of boolean
2404 elsif Root_Type (F_Type) = Standard_Boolean
2405 and then Convention (F_Type) = Convention_Ada
2406 and then not Has_Warnings_Off (F_Type)
2407 and then not Has_Size_Clause (F_Type)
2410 ("?& is an 8-bit Ada Boolean, "
2411 & "use char in C!", Formal);
2413 -- Check suspicious tagged type
2415 elsif (Is_Tagged_Type (F_Type)
2416 or else (Is_Access_Type (F_Type)
2419 (Designated_Type (F_Type))))
2420 and then Convention (E) = Convention_C
2423 ("?& is a tagged type which does not "
2424 & "correspond to any C type!", Formal);
2426 -- Check wrong convention subprogram pointer
2428 elsif Ekind (F_Type) = E_Access_Subprogram_Type
2429 and then not Has_Foreign_Convention (F_Type)
2432 ("?subprogram pointer & should "
2433 & "have foreign convention!", Formal);
2434 Error_Msg_Sloc := Sloc (F_Type);
2436 ("\?add Convention pragma to declaration of &#",
2440 Error_Msg_Qual_Level := 0;
2443 -- Check for unconstrained array in exported foreign
2446 if Has_Foreign_Convention (E)
2447 and then not Is_Imported (E)
2448 and then Is_Array_Type (F_Type)
2449 and then not Is_Constrained (F_Type)
2450 and then Warn_On_Export_Import
2452 Error_Msg_Qual_Level := 1;
2454 -- If this is an inherited operation, place the
2455 -- warning on the derived type declaration, rather
2456 -- than on the original subprogram.
2458 if Nkind (Original_Node (Parent (E))) =
2459 N_Full_Type_Declaration
2461 Warn_Node := Parent (E);
2463 if Formal = First_Formal (E) then
2465 ("?in inherited operation&", Warn_Node, E);
2468 Warn_Node := Formal;
2472 ("?type of argument& is unconstrained array",
2475 ("?foreign caller must pass bounds explicitly",
2477 Error_Msg_Qual_Level := 0;
2480 -- Ada 2005 (AI-326): Check wrong use of tag incomplete
2481 -- types with unknown discriminants. For example:
2483 -- type T (<>) is tagged;
2484 -- procedure P (X : access T); -- ERROR
2485 -- procedure P (X : T); -- ERROR
2487 if not From_With_Type (F_Type) then
2488 if Is_Access_Type (F_Type) then
2489 F_Type := Designated_Type (F_Type);
2492 if Ekind (F_Type) = E_Incomplete_Type
2493 and then Is_Tagged_Type (F_Type)
2494 and then not Is_Class_Wide_Type (F_Type)
2495 and then No (Full_View (F_Type))
2496 and then Unknown_Discriminants_Present
2498 and then No (Stored_Constraint (F_Type))
2501 ("(Ada 2005): invalid use of unconstrained tagged"
2502 & " incomplete type", E);
2504 -- If the formal is an anonymous_access_to_subprogram
2505 -- freeze the subprogram type as well, to prevent
2506 -- scope anomalies in gigi, because there is no other
2507 -- clear point at which it could be frozen.
2509 elsif Is_Itype (Etype (Formal))
2510 and then Ekind (F_Type) = E_Subprogram_Type
2512 Freeze_And_Append (F_Type, Loc, Result);
2516 Next_Formal (Formal);
2521 if Ekind (E) = E_Function then
2523 -- Freeze return type
2525 R_Type := Etype (E);
2526 Freeze_And_Append (R_Type, Loc, Result);
2528 -- Check suspicious return type for C function
2530 if Warn_On_Export_Import
2531 and then (Convention (E) = Convention_C
2533 Convention (E) = Convention_CPP)
2534 and then (Is_Imported (E) or else Is_Exported (E))
2536 -- Check suspicious return of fat C pointer
2538 if Is_Access_Type (R_Type)
2539 and then Esize (R_Type) > Ttypes.System_Address_Size
2540 and then not Has_Warnings_Off (E)
2541 and then not Has_Warnings_Off (R_Type)
2544 ("?return type of& does not "
2545 & "correspond to C pointer!", E);
2547 -- Check suspicious return of boolean
2549 elsif Root_Type (R_Type) = Standard_Boolean
2550 and then Convention (R_Type) = Convention_Ada
2551 and then not Has_Warnings_Off (E)
2552 and then not Has_Warnings_Off (R_Type)
2553 and then not Has_Size_Clause (R_Type)
2556 ("?return type of & is an 8-bit "
2557 & "Ada Boolean, use char in C!", E);
2559 -- Check suspicious return tagged type
2561 elsif (Is_Tagged_Type (R_Type)
2562 or else (Is_Access_Type (R_Type)
2565 (Designated_Type (R_Type))))
2566 and then Convention (E) = Convention_C
2567 and then not Has_Warnings_Off (E)
2568 and then not Has_Warnings_Off (R_Type)
2571 ("?return type of & does not "
2572 & "correspond to C type!", E);
2574 -- Check return of wrong convention subprogram pointer
2576 elsif Ekind (R_Type) = E_Access_Subprogram_Type
2577 and then not Has_Foreign_Convention (R_Type)
2578 and then not Has_Warnings_Off (E)
2579 and then not Has_Warnings_Off (R_Type)
2582 ("?& should return a foreign "
2583 & "convention subprogram pointer", E);
2584 Error_Msg_Sloc := Sloc (R_Type);
2586 ("\?add Convention pragma to declaration of& #",
2591 if Is_Array_Type (Etype (E))
2592 and then not Is_Constrained (Etype (E))
2593 and then not Is_Imported (E)
2594 and then Has_Foreign_Convention (E)
2595 and then Warn_On_Export_Import
2596 and then not Has_Warnings_Off (E)
2597 and then not Has_Warnings_Off (Etype (E))
2600 ("?foreign convention function& should not " &
2601 "return unconstrained array!", E);
2603 -- Ada 2005 (AI-326): Check wrong use of tagged
2606 -- type T is tagged;
2607 -- function F (X : Boolean) return T; -- ERROR
2608 -- The type must be declared in the current scope
2609 -- for the use to be legal, and the full view
2610 -- must be available when the construct that mentions
2613 elsif Ekind (Etype (E)) = E_Incomplete_Type
2614 and then Is_Tagged_Type (Etype (E))
2615 and then No (Full_View (Etype (E)))
2616 and then not Is_Value_Type (Etype (E))
2619 ("(Ada 2005): invalid use of tagged incomplete type",
2626 -- Must freeze its parent first if it is a derived subprogram
2628 if Present (Alias (E)) then
2629 Freeze_And_Append (Alias (E), Loc, Result);
2632 -- We don't freeze internal subprograms, because we don't normally
2633 -- want addition of extra formals or mechanism setting to happen
2634 -- for those. However we do pass through predefined dispatching
2635 -- cases, since extra formals may be needed in some cases, such as
2636 -- for the stream 'Input function (build-in-place formals).
2638 if not Is_Internal (E)
2639 or else Is_Predefined_Dispatching_Operation (E)
2641 Freeze_Subprogram (E);
2644 -- Here for other than a subprogram or type
2647 -- For a generic package, freeze types within, so that proper
2648 -- cross-reference information is generated for tagged types.
2649 -- This is the only freeze processing needed for generic packages.
2651 if Ekind (E) = E_Generic_Package then
2656 T := First_Entity (E);
2658 while Present (T) loop
2660 Generate_Prim_Op_References (T);
2667 -- If entity has a type, and it is not a generic unit, then
2668 -- freeze it first (RM 13.14(10)).
2670 elsif Present (Etype (E))
2671 and then Ekind (E) /= E_Generic_Function
2673 Freeze_And_Append (Etype (E), Loc, Result);
2676 -- Special processing for objects created by object declaration
2678 if Nkind (Declaration_Node (E)) = N_Object_Declaration then
2680 -- For object created by object declaration, perform required
2681 -- categorization (preelaborate and pure) checks. Defer these
2682 -- checks to freeze time since pragma Import inhibits default
2683 -- initialization and thus pragma Import affects these checks.
2685 Validate_Object_Declaration (Declaration_Node (E));
2687 -- If there is an address clause, check that it is valid
2689 Check_Address_Clause (E);
2691 -- If the object needs any kind of default initialization, an
2692 -- error must be issued if No_Default_Initialization applies.
2693 -- The check doesn't apply to imported objects, which are not
2694 -- ever default initialized, and is why the check is deferred
2695 -- until freezing, at which point we know if Import applies.
2696 -- Deferred constants are also exempted from this test because
2697 -- their completion is explicit, or through an import pragma.
2699 if Ekind (E) = E_Constant
2700 and then Present (Full_View (E))
2704 elsif Comes_From_Source (E)
2705 and then not Is_Imported (E)
2706 and then not Has_Init_Expression (Declaration_Node (E))
2708 ((Has_Non_Null_Base_Init_Proc (Etype (E))
2709 and then not No_Initialization (Declaration_Node (E))
2710 and then not Is_Value_Type (Etype (E))
2711 and then not Suppress_Init_Proc (Etype (E)))
2713 (Needs_Simple_Initialization (Etype (E))
2714 and then not Is_Internal (E)))
2717 (No_Default_Initialization, Declaration_Node (E));
2720 -- For imported objects, set Is_Public unless there is also an
2721 -- address clause, which means that there is no external symbol
2722 -- needed for the Import (Is_Public may still be set for other
2723 -- unrelated reasons). Note that we delayed this processing
2724 -- till freeze time so that we can be sure not to set the flag
2725 -- if there is an address clause. If there is such a clause,
2726 -- then the only purpose of the Import pragma is to suppress
2727 -- implicit initialization.
2730 and then No (Address_Clause (E))
2735 -- For convention C objects of an enumeration type, warn if
2736 -- the size is not integer size and no explicit size given.
2737 -- Skip warning for Boolean, and Character, assume programmer
2738 -- expects 8-bit sizes for these cases.
2740 if (Convention (E) = Convention_C
2742 Convention (E) = Convention_CPP)
2743 and then Is_Enumeration_Type (Etype (E))
2744 and then not Is_Character_Type (Etype (E))
2745 and then not Is_Boolean_Type (Etype (E))
2746 and then Esize (Etype (E)) < Standard_Integer_Size
2747 and then not Has_Size_Clause (E)
2749 Error_Msg_Uint_1 := UI_From_Int (Standard_Integer_Size);
2751 ("?convention C enumeration object has size less than ^",
2753 Error_Msg_N ("\?use explicit size clause to set size", E);
2757 -- Check that a constant which has a pragma Volatile[_Components]
2758 -- or Atomic[_Components] also has a pragma Import (RM C.6(13)).
2760 -- Note: Atomic[_Components] also sets Volatile[_Components]
2762 if Ekind (E) = E_Constant
2763 and then (Has_Volatile_Components (E) or else Is_Volatile (E))
2764 and then not Is_Imported (E)
2766 -- Make sure we actually have a pragma, and have not merely
2767 -- inherited the indication from elsewhere (e.g. an address
2768 -- clause, which is not good enough in RM terms!)
2770 if Has_Rep_Pragma (E, Name_Atomic)
2772 Has_Rep_Pragma (E, Name_Atomic_Components)
2775 ("stand alone atomic constant must be " &
2776 "imported (RM C.6(13))", E);
2778 elsif Has_Rep_Pragma (E, Name_Volatile)
2780 Has_Rep_Pragma (E, Name_Volatile_Components)
2783 ("stand alone volatile constant must be " &
2784 "imported (RM C.6(13))", E);
2788 -- Static objects require special handling
2790 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
2791 and then Is_Statically_Allocated (E)
2793 Freeze_Static_Object (E);
2796 -- Remaining step is to layout objects
2798 if Ekind (E) = E_Variable
2800 Ekind (E) = E_Constant
2802 Ekind (E) = E_Loop_Parameter
2810 -- Case of a type or subtype being frozen
2813 -- We used to check here that a full type must have preelaborable
2814 -- initialization if it completes a private type specified with
2815 -- pragma Preelaborable_Intialization, but that missed cases where
2816 -- the types occur within a generic package, since the freezing
2817 -- that occurs within a containing scope generally skips traversal
2818 -- of a generic unit's declarations (those will be frozen within
2819 -- instances). This check was moved to Analyze_Package_Specification.
2821 -- The type may be defined in a generic unit. This can occur when
2822 -- freezing a generic function that returns the type (which is
2823 -- defined in a parent unit). It is clearly meaningless to freeze
2824 -- this type. However, if it is a subtype, its size may be determi-
2825 -- nable and used in subsequent checks, so might as well try to
2828 if Present (Scope (E))
2829 and then Is_Generic_Unit (Scope (E))
2831 Check_Compile_Time_Size (E);
2835 -- Deal with special cases of freezing for subtype
2837 if E /= Base_Type (E) then
2839 -- Before we do anything else, a specialized test for the case of
2840 -- a size given for an array where the array needs to be packed,
2841 -- but was not so the size cannot be honored. This would of course
2842 -- be caught by the backend, and indeed we don't catch all cases.
2843 -- The point is that we can give a better error message in those
2844 -- cases that we do catch with the circuitry here. Also if pragma
2845 -- Implicit_Packing is set, this is where the packing occurs.
2847 -- The reason we do this so early is that the processing in the
2848 -- automatic packing case affects the layout of the base type, so
2849 -- it must be done before we freeze the base type.
2851 if Is_Array_Type (E) then
2854 Ctyp : constant Entity_Id := Component_Type (E);
2857 -- Check enabling conditions. These are straightforward
2858 -- except for the test for a limited composite type. This
2859 -- eliminates the rare case of a array of limited components
2860 -- where there are issues of whether or not we can go ahead
2861 -- and pack the array (since we can't freely pack and unpack
2862 -- arrays if they are limited).
2864 -- Note that we check the root type explicitly because the
2865 -- whole point is we are doing this test before we have had
2866 -- a chance to freeze the base type (and it is that freeze
2867 -- action that causes stuff to be inherited).
2869 if Present (Size_Clause (E))
2870 and then Known_Static_Esize (E)
2871 and then not Is_Packed (E)
2872 and then not Has_Pragma_Pack (E)
2873 and then Number_Dimensions (E) = 1
2874 and then not Has_Component_Size_Clause (E)
2875 and then Known_Static_Esize (Ctyp)
2876 and then not Is_Limited_Composite (E)
2877 and then not Is_Packed (Root_Type (E))
2878 and then not Has_Component_Size_Clause (Root_Type (E))
2880 Get_Index_Bounds (First_Index (E), Lo, Hi);
2882 if Compile_Time_Known_Value (Lo)
2883 and then Compile_Time_Known_Value (Hi)
2884 and then Known_Static_RM_Size (Ctyp)
2885 and then RM_Size (Ctyp) < 64
2888 Lov : constant Uint := Expr_Value (Lo);
2889 Hiv : constant Uint := Expr_Value (Hi);
2890 Len : constant Uint := UI_Max
2893 Rsiz : constant Uint := RM_Size (Ctyp);
2894 SZ : constant Node_Id := Size_Clause (E);
2895 Btyp : constant Entity_Id := Base_Type (E);
2897 -- What we are looking for here is the situation where
2898 -- the RM_Size given would be exactly right if there
2899 -- was a pragma Pack (resulting in the component size
2900 -- being the same as the RM_Size). Furthermore, the
2901 -- component type size must be an odd size (not a
2902 -- multiple of storage unit)
2905 if RM_Size (E) = Len * Rsiz
2906 and then Rsiz mod System_Storage_Unit /= 0
2908 -- For implicit packing mode, just set the
2909 -- component size silently
2911 if Implicit_Packing then
2912 Set_Component_Size (Btyp, Rsiz);
2913 Set_Is_Bit_Packed_Array (Btyp);
2914 Set_Is_Packed (Btyp);
2915 Set_Has_Non_Standard_Rep (Btyp);
2917 -- Otherwise give an error message
2921 ("size given for& too small", SZ, E);
2923 ("\use explicit pragma Pack "
2924 & "or use pragma Implicit_Packing", SZ);
2933 -- If ancestor subtype present, freeze that first. Note that this
2934 -- will also get the base type frozen.
2936 Atype := Ancestor_Subtype (E);
2938 if Present (Atype) then
2939 Freeze_And_Append (Atype, Loc, Result);
2941 -- Otherwise freeze the base type of the entity before freezing
2942 -- the entity itself (RM 13.14(15)).
2944 elsif E /= Base_Type (E) then
2945 Freeze_And_Append (Base_Type (E), Loc, Result);
2948 -- For a derived type, freeze its parent type first (RM 13.14(15))
2950 elsif Is_Derived_Type (E) then
2951 Freeze_And_Append (Etype (E), Loc, Result);
2952 Freeze_And_Append (First_Subtype (Etype (E)), Loc, Result);
2955 -- For array type, freeze index types and component type first
2956 -- before freezing the array (RM 13.14(15)).
2958 if Is_Array_Type (E) then
2960 Ctyp : constant Entity_Id := Component_Type (E);
2962 Non_Standard_Enum : Boolean := False;
2963 -- Set true if any of the index types is an enumeration type
2964 -- with a non-standard representation.
2967 Freeze_And_Append (Ctyp, Loc, Result);
2969 Indx := First_Index (E);
2970 while Present (Indx) loop
2971 Freeze_And_Append (Etype (Indx), Loc, Result);
2973 if Is_Enumeration_Type (Etype (Indx))
2974 and then Has_Non_Standard_Rep (Etype (Indx))
2976 Non_Standard_Enum := True;
2982 -- Processing that is done only for base types
2984 if Ekind (E) = E_Array_Type then
2986 -- Propagate flags for component type
2988 if Is_Controlled (Component_Type (E))
2989 or else Has_Controlled_Component (Ctyp)
2991 Set_Has_Controlled_Component (E);
2994 if Has_Unchecked_Union (Component_Type (E)) then
2995 Set_Has_Unchecked_Union (E);
2998 -- If packing was requested or if the component size was set
2999 -- explicitly, then see if bit packing is required. This
3000 -- processing is only done for base types, since all the
3001 -- representation aspects involved are type-related. This
3002 -- is not just an optimization, if we start processing the
3003 -- subtypes, they interfere with the settings on the base
3004 -- type (this is because Is_Packed has a slightly different
3005 -- meaning before and after freezing).
3012 if (Is_Packed (E) or else Has_Pragma_Pack (E))
3013 and then not Has_Atomic_Components (E)
3014 and then Known_Static_RM_Size (Ctyp)
3016 Csiz := UI_Max (RM_Size (Ctyp), 1);
3018 elsif Known_Component_Size (E) then
3019 Csiz := Component_Size (E);
3021 elsif not Known_Static_Esize (Ctyp) then
3025 Esiz := Esize (Ctyp);
3027 -- We can set the component size if it is less than
3028 -- 16, rounding it up to the next storage unit size.
3032 elsif Esiz <= 16 then
3038 -- Set component size up to match alignment if it
3039 -- would otherwise be less than the alignment. This
3040 -- deals with cases of types whose alignment exceeds
3041 -- their size (padded types).
3045 A : constant Uint := Alignment_In_Bits (Ctyp);
3054 -- Case of component size that may result in packing
3056 if 1 <= Csiz and then Csiz <= 64 then
3058 Ent : constant Entity_Id :=
3060 Pack_Pragma : constant Node_Id :=
3061 Get_Rep_Pragma (Ent, Name_Pack);
3062 Comp_Size_C : constant Node_Id :=
3063 Get_Attribute_Definition_Clause
3064 (Ent, Attribute_Component_Size);
3066 -- Warn if we have pack and component size so that
3067 -- the pack is ignored.
3069 -- Note: here we must check for the presence of a
3070 -- component size before checking for a Pack pragma
3071 -- to deal with the case where the array type is a
3072 -- derived type whose parent is currently private.
3074 if Present (Comp_Size_C)
3075 and then Has_Pragma_Pack (Ent)
3077 Error_Msg_Sloc := Sloc (Comp_Size_C);
3079 ("?pragma Pack for& ignored!",
3082 ("\?explicit component size given#!",
3086 -- Set component size if not already set by a
3087 -- component size clause.
3089 if not Present (Comp_Size_C) then
3090 Set_Component_Size (E, Csiz);
3093 -- Check for base type of 8, 16, 32 bits, where an
3094 -- unsigned subtype has a length one less than the
3095 -- base type (e.g. Natural subtype of Integer).
3097 -- In such cases, if a component size was not set
3098 -- explicitly, then generate a warning.
3100 if Has_Pragma_Pack (E)
3101 and then not Present (Comp_Size_C)
3103 (Csiz = 7 or else Csiz = 15 or else Csiz = 31)
3104 and then Esize (Base_Type (Ctyp)) = Csiz + 1
3106 Error_Msg_Uint_1 := Csiz;
3108 if Present (Pack_Pragma) then
3110 ("?pragma Pack causes component size "
3111 & "to be ^!", Pack_Pragma);
3113 ("\?use Component_Size to set "
3114 & "desired value!", Pack_Pragma);
3118 -- Actual packing is not needed for 8, 16, 32, 64.
3119 -- Also not needed for 24 if alignment is 1.
3125 or else (Csiz = 24 and then Alignment (Ctyp) = 1)
3127 -- Here the array was requested to be packed,
3128 -- but the packing request had no effect, so
3129 -- Is_Packed is reset.
3131 -- Note: semantically this means that we lose
3132 -- track of the fact that a derived type
3133 -- inherited a pragma Pack that was non-
3134 -- effective, but that seems fine.
3136 -- We regard a Pack pragma as a request to set
3137 -- a representation characteristic, and this
3138 -- request may be ignored.
3140 Set_Is_Packed (Base_Type (E), False);
3142 -- In all other cases, packing is indeed needed
3145 Set_Has_Non_Standard_Rep (Base_Type (E));
3146 Set_Is_Bit_Packed_Array (Base_Type (E));
3147 Set_Is_Packed (Base_Type (E));
3153 -- Processing that is done only for subtypes
3156 -- Acquire alignment from base type
3158 if Unknown_Alignment (E) then
3159 Set_Alignment (E, Alignment (Base_Type (E)));
3160 Adjust_Esize_Alignment (E);
3164 -- For bit-packed arrays, check the size
3166 if Is_Bit_Packed_Array (E)
3167 and then Known_RM_Size (E)
3170 SizC : constant Node_Id := Size_Clause (E);
3173 pragma Warnings (Off, Discard);
3176 -- It is not clear if it is possible to have no size
3177 -- clause at this stage, but it is not worth worrying
3178 -- about. Post error on the entity name in the size
3179 -- clause if present, else on the type entity itself.
3181 if Present (SizC) then
3182 Check_Size (Name (SizC), E, RM_Size (E), Discard);
3184 Check_Size (E, E, RM_Size (E), Discard);
3189 -- If any of the index types was an enumeration type with
3190 -- a non-standard rep clause, then we indicate that the
3191 -- array type is always packed (even if it is not bit packed).
3193 if Non_Standard_Enum then
3194 Set_Has_Non_Standard_Rep (Base_Type (E));
3195 Set_Is_Packed (Base_Type (E));
3198 Set_Component_Alignment_If_Not_Set (E);
3200 -- If the array is packed, we must create the packed array
3201 -- type to be used to actually implement the type. This is
3202 -- only needed for real array types (not for string literal
3203 -- types, since they are present only for the front end).
3206 and then Ekind (E) /= E_String_Literal_Subtype
3208 Create_Packed_Array_Type (E);
3209 Freeze_And_Append (Packed_Array_Type (E), Loc, Result);
3211 -- Size information of packed array type is copied to the
3212 -- array type, since this is really the representation. But
3213 -- do not override explicit existing size values. If the
3214 -- ancestor subtype is constrained the packed_array_type
3215 -- will be inherited from it, but the size may have been
3216 -- provided already, and must not be overridden either.
3218 if not Has_Size_Clause (E)
3220 (No (Ancestor_Subtype (E))
3221 or else not Has_Size_Clause (Ancestor_Subtype (E)))
3223 Set_Esize (E, Esize (Packed_Array_Type (E)));
3224 Set_RM_Size (E, RM_Size (Packed_Array_Type (E)));
3227 if not Has_Alignment_Clause (E) then
3228 Set_Alignment (E, Alignment (Packed_Array_Type (E)));
3232 -- For non-packed arrays set the alignment of the array to the
3233 -- alignment of the component type if it is unknown. Skip this
3234 -- in atomic case (atomic arrays may need larger alignments).
3236 if not Is_Packed (E)
3237 and then Unknown_Alignment (E)
3238 and then Known_Alignment (Ctyp)
3239 and then Known_Static_Component_Size (E)
3240 and then Known_Static_Esize (Ctyp)
3241 and then Esize (Ctyp) = Component_Size (E)
3242 and then not Is_Atomic (E)
3244 Set_Alignment (E, Alignment (Component_Type (E)));
3248 -- For a class-wide type, the corresponding specific type is
3249 -- frozen as well (RM 13.14(15))
3251 elsif Is_Class_Wide_Type (E) then
3252 Freeze_And_Append (Root_Type (E), Loc, Result);
3254 -- If the base type of the class-wide type is still incomplete,
3255 -- the class-wide remains unfrozen as well. This is legal when
3256 -- E is the formal of a primitive operation of some other type
3257 -- which is being frozen.
3259 if not Is_Frozen (Root_Type (E)) then
3260 Set_Is_Frozen (E, False);
3264 -- If the Class_Wide_Type is an Itype (when type is the anonymous
3265 -- parent of a derived type) and it is a library-level entity,
3266 -- generate an itype reference for it. Otherwise, its first
3267 -- explicit reference may be in an inner scope, which will be
3268 -- rejected by the back-end.
3271 and then Is_Compilation_Unit (Scope (E))
3274 Ref : constant Node_Id := Make_Itype_Reference (Loc);
3279 Result := New_List (Ref);
3281 Append (Ref, Result);
3286 -- The equivalent type associated with a class-wide subtype needs
3287 -- to be frozen to ensure that its layout is done. Class-wide
3288 -- subtypes are currently only frozen on targets requiring
3289 -- front-end layout (see New_Class_Wide_Subtype and
3290 -- Make_CW_Equivalent_Type in exp_util.adb).
3292 if Ekind (E) = E_Class_Wide_Subtype
3293 and then Present (Equivalent_Type (E))
3295 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3298 -- For a record (sub)type, freeze all the component types (RM
3299 -- 13.14(15). We test for E_Record_(sub)Type here, rather than using
3300 -- Is_Record_Type, because we don't want to attempt the freeze for
3301 -- the case of a private type with record extension (we will do that
3302 -- later when the full type is frozen).
3304 elsif Ekind (E) = E_Record_Type
3305 or else Ekind (E) = E_Record_Subtype
3307 Freeze_Record_Type (E);
3309 -- For a concurrent type, freeze corresponding record type. This
3310 -- does not correspond to any specific rule in the RM, but the
3311 -- record type is essentially part of the concurrent type.
3312 -- Freeze as well all local entities. This includes record types
3313 -- created for entry parameter blocks, and whatever local entities
3314 -- may appear in the private part.
3316 elsif Is_Concurrent_Type (E) then
3317 if Present (Corresponding_Record_Type (E)) then
3319 (Corresponding_Record_Type (E), Loc, Result);
3322 Comp := First_Entity (E);
3324 while Present (Comp) loop
3325 if Is_Type (Comp) then
3326 Freeze_And_Append (Comp, Loc, Result);
3328 elsif (Ekind (Comp)) /= E_Function then
3329 if Is_Itype (Etype (Comp))
3330 and then Underlying_Type (Scope (Etype (Comp))) = E
3332 Undelay_Type (Etype (Comp));
3335 Freeze_And_Append (Etype (Comp), Loc, Result);
3341 -- Private types are required to point to the same freeze node as
3342 -- their corresponding full views. The freeze node itself has to
3343 -- point to the partial view of the entity (because from the partial
3344 -- view, we can retrieve the full view, but not the reverse).
3345 -- However, in order to freeze correctly, we need to freeze the full
3346 -- view. If we are freezing at the end of a scope (or within the
3347 -- scope of the private type), the partial and full views will have
3348 -- been swapped, the full view appears first in the entity chain and
3349 -- the swapping mechanism ensures that the pointers are properly set
3352 -- If we encounter the partial view before the full view (e.g. when
3353 -- freezing from another scope), we freeze the full view, and then
3354 -- set the pointers appropriately since we cannot rely on swapping to
3355 -- fix things up (subtypes in an outer scope might not get swapped).
3357 elsif Is_Incomplete_Or_Private_Type (E)
3358 and then not Is_Generic_Type (E)
3360 -- The construction of the dispatch table associated with library
3361 -- level tagged types forces freezing of all the primitives of the
3362 -- type, which may cause premature freezing of the partial view.
3366 -- type T is tagged private;
3367 -- type DT is new T with private;
3368 -- procedure Prim (X : in out T; Y : in out DT'class);
3370 -- type T is tagged null record;
3372 -- type DT is new T with null record;
3375 -- In this case the type will be frozen later by the usual
3376 -- mechanism: an object declaration, an instantiation, or the
3377 -- end of a declarative part.
3379 if Is_Library_Level_Tagged_Type (E)
3380 and then not Present (Full_View (E))
3382 Set_Is_Frozen (E, False);
3385 -- Case of full view present
3387 elsif Present (Full_View (E)) then
3389 -- If full view has already been frozen, then no further
3390 -- processing is required
3392 if Is_Frozen (Full_View (E)) then
3394 Set_Has_Delayed_Freeze (E, False);
3395 Set_Freeze_Node (E, Empty);
3396 Check_Debug_Info_Needed (E);
3398 -- Otherwise freeze full view and patch the pointers so that
3399 -- the freeze node will elaborate both views in the back-end.
3403 Full : constant Entity_Id := Full_View (E);
3406 if Is_Private_Type (Full)
3407 and then Present (Underlying_Full_View (Full))
3410 (Underlying_Full_View (Full), Loc, Result);
3413 Freeze_And_Append (Full, Loc, Result);
3415 if Has_Delayed_Freeze (E) then
3416 F_Node := Freeze_Node (Full);
3418 if Present (F_Node) then
3419 Set_Freeze_Node (E, F_Node);
3420 Set_Entity (F_Node, E);
3423 -- {Incomplete,Private}_Subtypes with Full_Views
3424 -- constrained by discriminants.
3426 Set_Has_Delayed_Freeze (E, False);
3427 Set_Freeze_Node (E, Empty);
3432 Check_Debug_Info_Needed (E);
3435 -- AI-117 requires that the convention of a partial view be the
3436 -- same as the convention of the full view. Note that this is a
3437 -- recognized breach of privacy, but it's essential for logical
3438 -- consistency of representation, and the lack of a rule in
3439 -- RM95 was an oversight.
3441 Set_Convention (E, Convention (Full_View (E)));
3443 Set_Size_Known_At_Compile_Time (E,
3444 Size_Known_At_Compile_Time (Full_View (E)));
3446 -- Size information is copied from the full view to the
3447 -- incomplete or private view for consistency.
3449 -- We skip this is the full view is not a type. This is very
3450 -- strange of course, and can only happen as a result of
3451 -- certain illegalities, such as a premature attempt to derive
3452 -- from an incomplete type.
3454 if Is_Type (Full_View (E)) then
3455 Set_Size_Info (E, Full_View (E));
3456 Set_RM_Size (E, RM_Size (Full_View (E)));
3461 -- Case of no full view present. If entity is derived or subtype,
3462 -- it is safe to freeze, correctness depends on the frozen status
3463 -- of parent. Otherwise it is either premature usage, or a Taft
3464 -- amendment type, so diagnosis is at the point of use and the
3465 -- type might be frozen later.
3467 elsif E /= Base_Type (E)
3468 or else Is_Derived_Type (E)
3473 Set_Is_Frozen (E, False);
3477 -- For access subprogram, freeze types of all formals, the return
3478 -- type was already frozen, since it is the Etype of the function.
3480 elsif Ekind (E) = E_Subprogram_Type then
3481 Formal := First_Formal (E);
3482 while Present (Formal) loop
3483 Freeze_And_Append (Etype (Formal), Loc, Result);
3484 Next_Formal (Formal);
3487 Freeze_Subprogram (E);
3489 -- Ada 2005 (AI-326): Check wrong use of tag incomplete type
3491 -- type T is tagged;
3492 -- type Acc is access function (X : T) return T; -- ERROR
3494 if Ekind (Etype (E)) = E_Incomplete_Type
3495 and then Is_Tagged_Type (Etype (E))
3496 and then No (Full_View (Etype (E)))
3497 and then not Is_Value_Type (Etype (E))
3500 ("(Ada 2005): invalid use of tagged incomplete type", E);
3503 -- For access to a protected subprogram, freeze the equivalent type
3504 -- (however this is not set if we are not generating code or if this
3505 -- is an anonymous type used just for resolution).
3507 elsif Is_Access_Protected_Subprogram_Type (E) then
3509 -- AI-326: Check wrong use of tagged incomplete types
3511 -- type T is tagged;
3512 -- type As3D is access protected
3513 -- function (X : Float) return T; -- ERROR
3519 Etyp := Etype (Directly_Designated_Type (E));
3521 if Is_Class_Wide_Type (Etyp) then
3522 Etyp := Etype (Etyp);
3525 if Ekind (Etyp) = E_Incomplete_Type
3526 and then Is_Tagged_Type (Etyp)
3527 and then No (Full_View (Etyp))
3528 and then not Is_Value_Type (Etype (E))
3531 ("(Ada 2005): invalid use of tagged incomplete type", E);
3535 if Present (Equivalent_Type (E)) then
3536 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3540 -- Generic types are never seen by the back-end, and are also not
3541 -- processed by the expander (since the expander is turned off for
3542 -- generic processing), so we never need freeze nodes for them.
3544 if Is_Generic_Type (E) then
3548 -- Some special processing for non-generic types to complete
3549 -- representation details not known till the freeze point.
3551 if Is_Fixed_Point_Type (E) then
3552 Freeze_Fixed_Point_Type (E);
3554 -- Some error checks required for ordinary fixed-point type. Defer
3555 -- these till the freeze-point since we need the small and range
3556 -- values. We only do these checks for base types
3558 if Is_Ordinary_Fixed_Point_Type (E)
3559 and then E = Base_Type (E)
3561 if Small_Value (E) < Ureal_2_M_80 then
3562 Error_Msg_Name_1 := Name_Small;
3564 ("`&''%` too small, minimum allowed is 2.0'*'*(-80)", E);
3566 elsif Small_Value (E) > Ureal_2_80 then
3567 Error_Msg_Name_1 := Name_Small;
3569 ("`&''%` too large, maximum allowed is 2.0'*'*80", E);
3572 if Expr_Value_R (Type_Low_Bound (E)) < Ureal_M_10_36 then
3573 Error_Msg_Name_1 := Name_First;
3575 ("`&''%` too small, minimum allowed is -10.0'*'*36", E);
3578 if Expr_Value_R (Type_High_Bound (E)) > Ureal_10_36 then
3579 Error_Msg_Name_1 := Name_Last;
3581 ("`&''%` too large, maximum allowed is 10.0'*'*36", E);
3585 elsif Is_Enumeration_Type (E) then
3586 Freeze_Enumeration_Type (E);
3588 elsif Is_Integer_Type (E) then
3589 Adjust_Esize_For_Alignment (E);
3591 elsif Is_Access_Type (E) then
3593 -- Check restriction for standard storage pool
3595 if No (Associated_Storage_Pool (E)) then
3596 Check_Restriction (No_Standard_Storage_Pools, E);
3599 -- Deal with error message for pure access type. This is not an
3600 -- error in Ada 2005 if there is no pool (see AI-366).
3602 if Is_Pure_Unit_Access_Type (E)
3603 and then (Ada_Version < Ada_05
3604 or else not No_Pool_Assigned (E))
3606 Error_Msg_N ("named access type not allowed in pure unit", E);
3608 if Ada_Version >= Ada_05 then
3610 ("\would be legal if Storage_Size of 0 given?", E);
3612 elsif No_Pool_Assigned (E) then
3614 ("\would be legal in Ada 2005?", E);
3618 ("\would be legal in Ada 2005 if "
3619 & "Storage_Size of 0 given?", E);
3624 -- Case of composite types
3626 if Is_Composite_Type (E) then
3628 -- AI-117 requires that all new primitives of a tagged type must
3629 -- inherit the convention of the full view of the type. Inherited
3630 -- and overriding operations are defined to inherit the convention
3631 -- of their parent or overridden subprogram (also specified in
3632 -- AI-117), which will have occurred earlier (in Derive_Subprogram
3633 -- and New_Overloaded_Entity). Here we set the convention of
3634 -- primitives that are still convention Ada, which will ensure
3635 -- that any new primitives inherit the type's convention. Class-
3636 -- wide types can have a foreign convention inherited from their
3637 -- specific type, but are excluded from this since they don't have
3638 -- any associated primitives.
3640 if Is_Tagged_Type (E)
3641 and then not Is_Class_Wide_Type (E)
3642 and then Convention (E) /= Convention_Ada
3645 Prim_List : constant Elist_Id := Primitive_Operations (E);
3648 Prim := First_Elmt (Prim_List);
3649 while Present (Prim) loop
3650 if Convention (Node (Prim)) = Convention_Ada then
3651 Set_Convention (Node (Prim), Convention (E));
3660 -- Generate references to primitive operations for a tagged type
3662 Generate_Prim_Op_References (E);
3664 -- Now that all types from which E may depend are frozen, see if the
3665 -- size is known at compile time, if it must be unsigned, or if
3666 -- strict alignment is required
3668 Check_Compile_Time_Size (E);
3669 Check_Unsigned_Type (E);
3671 if Base_Type (E) = E then
3672 Check_Strict_Alignment (E);
3675 -- Do not allow a size clause for a type which does not have a size
3676 -- that is known at compile time
3678 if Has_Size_Clause (E)
3679 and then not Size_Known_At_Compile_Time (E)
3681 -- Suppress this message if errors posted on E, even if we are
3682 -- in all errors mode, since this is often a junk message
3684 if not Error_Posted (E) then
3686 ("size clause not allowed for variable length type",
3691 -- Remaining process is to set/verify the representation information,
3692 -- in particular the size and alignment values. This processing is
3693 -- not required for generic types, since generic types do not play
3694 -- any part in code generation, and so the size and alignment values
3695 -- for such types are irrelevant.
3697 if Is_Generic_Type (E) then
3700 -- Otherwise we call the layout procedure
3706 -- End of freeze processing for type entities
3709 -- Here is where we logically freeze the current entity. If it has a
3710 -- freeze node, then this is the point at which the freeze node is
3711 -- linked into the result list.
3713 if Has_Delayed_Freeze (E) then
3715 -- If a freeze node is already allocated, use it, otherwise allocate
3716 -- a new one. The preallocation happens in the case of anonymous base
3717 -- types, where we preallocate so that we can set First_Subtype_Link.
3718 -- Note that we reset the Sloc to the current freeze location.
3720 if Present (Freeze_Node (E)) then
3721 F_Node := Freeze_Node (E);
3722 Set_Sloc (F_Node, Loc);
3725 F_Node := New_Node (N_Freeze_Entity, Loc);
3726 Set_Freeze_Node (E, F_Node);
3727 Set_Access_Types_To_Process (F_Node, No_Elist);
3728 Set_TSS_Elist (F_Node, No_Elist);
3729 Set_Actions (F_Node, No_List);
3732 Set_Entity (F_Node, E);
3734 if Result = No_List then
3735 Result := New_List (F_Node);
3737 Append (F_Node, Result);
3740 -- A final pass over record types with discriminants. If the type
3741 -- has an incomplete declaration, there may be constrained access
3742 -- subtypes declared elsewhere, which do not depend on the discrimi-
3743 -- nants of the type, and which are used as component types (i.e.
3744 -- the full view is a recursive type). The designated types of these
3745 -- subtypes can only be elaborated after the type itself, and they
3746 -- need an itype reference.
3748 if Ekind (E) = E_Record_Type
3749 and then Has_Discriminants (E)
3757 Comp := First_Component (E);
3759 while Present (Comp) loop
3760 Typ := Etype (Comp);
3762 if Ekind (Comp) = E_Component
3763 and then Is_Access_Type (Typ)
3764 and then Scope (Typ) /= E
3765 and then Base_Type (Designated_Type (Typ)) = E
3766 and then Is_Itype (Designated_Type (Typ))
3768 IR := Make_Itype_Reference (Sloc (Comp));
3769 Set_Itype (IR, Designated_Type (Typ));
3770 Append (IR, Result);
3773 Next_Component (Comp);
3779 -- When a type is frozen, the first subtype of the type is frozen as
3780 -- well (RM 13.14(15)). This has to be done after freezing the type,
3781 -- since obviously the first subtype depends on its own base type.
3784 Freeze_And_Append (First_Subtype (E), Loc, Result);
3786 -- If we just froze a tagged non-class wide record, then freeze the
3787 -- corresponding class-wide type. This must be done after the tagged
3788 -- type itself is frozen, because the class-wide type refers to the
3789 -- tagged type which generates the class.
3791 if Is_Tagged_Type (E)
3792 and then not Is_Class_Wide_Type (E)
3793 and then Present (Class_Wide_Type (E))
3795 Freeze_And_Append (Class_Wide_Type (E), Loc, Result);
3799 Check_Debug_Info_Needed (E);
3801 -- Special handling for subprograms
3803 if Is_Subprogram (E) then
3805 -- If subprogram has address clause then reset Is_Public flag, since
3806 -- we do not want the backend to generate external references.
3808 if Present (Address_Clause (E))
3809 and then not Is_Library_Level_Entity (E)
3811 Set_Is_Public (E, False);
3813 -- If no address clause and not intrinsic, then for imported
3814 -- subprogram in main unit, generate descriptor if we are in
3815 -- Propagate_Exceptions mode.
3817 elsif Propagate_Exceptions
3818 and then Is_Imported (E)
3819 and then not Is_Intrinsic_Subprogram (E)
3820 and then Convention (E) /= Convention_Stubbed
3822 if Result = No_List then
3823 Result := Empty_List;
3831 -----------------------------
3832 -- Freeze_Enumeration_Type --
3833 -----------------------------
3835 procedure Freeze_Enumeration_Type (Typ : Entity_Id) is
3837 -- By default, if no size clause is present, an enumeration type with
3838 -- Convention C is assumed to interface to a C enum, and has integer
3839 -- size. This applies to types. For subtypes, verify that its base
3840 -- type has no size clause either.
3842 if Has_Foreign_Convention (Typ)
3843 and then not Has_Size_Clause (Typ)
3844 and then not Has_Size_Clause (Base_Type (Typ))
3845 and then Esize (Typ) < Standard_Integer_Size
3847 Init_Esize (Typ, Standard_Integer_Size);
3850 -- If the enumeration type interfaces to C, and it has a size clause
3851 -- that specifies less than int size, it warrants a warning. The
3852 -- user may intend the C type to be an enum or a char, so this is
3853 -- not by itself an error that the Ada compiler can detect, but it
3854 -- it is a worth a heads-up. For Boolean and Character types we
3855 -- assume that the programmer has the proper C type in mind.
3857 if Convention (Typ) = Convention_C
3858 and then Has_Size_Clause (Typ)
3859 and then Esize (Typ) /= Esize (Standard_Integer)
3860 and then not Is_Boolean_Type (Typ)
3861 and then not Is_Character_Type (Typ)
3864 ("C enum types have the size of a C int?", Size_Clause (Typ));
3867 Adjust_Esize_For_Alignment (Typ);
3869 end Freeze_Enumeration_Type;
3871 -----------------------
3872 -- Freeze_Expression --
3873 -----------------------
3875 procedure Freeze_Expression (N : Node_Id) is
3876 In_Spec_Exp : constant Boolean := In_Spec_Expression;
3879 Desig_Typ : Entity_Id;
3883 Freeze_Outside : Boolean := False;
3884 -- This flag is set true if the entity must be frozen outside the
3885 -- current subprogram. This happens in the case of expander generated
3886 -- subprograms (_Init_Proc, _Input, _Output, _Read, _Write) which do
3887 -- not freeze all entities like other bodies, but which nevertheless
3888 -- may reference entities that have to be frozen before the body and
3889 -- obviously cannot be frozen inside the body.
3891 function In_Exp_Body (N : Node_Id) return Boolean;
3892 -- Given an N_Handled_Sequence_Of_Statements node N, determines whether
3893 -- it is the handled statement sequence of an expander-generated
3894 -- subprogram (init proc, stream subprogram, or renaming as body).
3895 -- If so, this is not a freezing context.
3901 function In_Exp_Body (N : Node_Id) return Boolean is
3906 if Nkind (N) = N_Subprogram_Body then
3912 if Nkind (P) /= N_Subprogram_Body then
3916 Id := Defining_Unit_Name (Specification (P));
3918 if Nkind (Id) = N_Defining_Identifier
3919 and then (Is_Init_Proc (Id) or else
3920 Is_TSS (Id, TSS_Stream_Input) or else
3921 Is_TSS (Id, TSS_Stream_Output) or else
3922 Is_TSS (Id, TSS_Stream_Read) or else
3923 Is_TSS (Id, TSS_Stream_Write) or else
3924 Nkind (Original_Node (P)) =
3925 N_Subprogram_Renaming_Declaration)
3934 -- Start of processing for Freeze_Expression
3937 -- Immediate return if freezing is inhibited. This flag is set by the
3938 -- analyzer to stop freezing on generated expressions that would cause
3939 -- freezing if they were in the source program, but which are not
3940 -- supposed to freeze, since they are created.
3942 if Must_Not_Freeze (N) then
3946 -- If expression is non-static, then it does not freeze in a default
3947 -- expression, see section "Handling of Default Expressions" in the
3948 -- spec of package Sem for further details. Note that we have to
3949 -- make sure that we actually have a real expression (if we have
3950 -- a subtype indication, we can't test Is_Static_Expression!)
3953 and then Nkind (N) in N_Subexpr
3954 and then not Is_Static_Expression (N)
3959 -- Freeze type of expression if not frozen already
3963 if Nkind (N) in N_Has_Etype then
3964 if not Is_Frozen (Etype (N)) then
3967 -- Base type may be an derived numeric type that is frozen at
3968 -- the point of declaration, but first_subtype is still unfrozen.
3970 elsif not Is_Frozen (First_Subtype (Etype (N))) then
3971 Typ := First_Subtype (Etype (N));
3975 -- For entity name, freeze entity if not frozen already. A special
3976 -- exception occurs for an identifier that did not come from source.
3977 -- We don't let such identifiers freeze a non-internal entity, i.e.
3978 -- an entity that did come from source, since such an identifier was
3979 -- generated by the expander, and cannot have any semantic effect on
3980 -- the freezing semantics. For example, this stops the parameter of
3981 -- an initialization procedure from freezing the variable.
3983 if Is_Entity_Name (N)
3984 and then not Is_Frozen (Entity (N))
3985 and then (Nkind (N) /= N_Identifier
3986 or else Comes_From_Source (N)
3987 or else not Comes_From_Source (Entity (N)))
3994 -- For an allocator freeze designated type if not frozen already
3996 -- For an aggregate whose component type is an access type, freeze the
3997 -- designated type now, so that its freeze does not appear within the
3998 -- loop that might be created in the expansion of the aggregate. If the
3999 -- designated type is a private type without full view, the expression
4000 -- cannot contain an allocator, so the type is not frozen.
4006 Desig_Typ := Designated_Type (Etype (N));
4009 if Is_Array_Type (Etype (N))
4010 and then Is_Access_Type (Component_Type (Etype (N)))
4012 Desig_Typ := Designated_Type (Component_Type (Etype (N)));
4015 when N_Selected_Component |
4016 N_Indexed_Component |
4019 if Is_Access_Type (Etype (Prefix (N))) then
4020 Desig_Typ := Designated_Type (Etype (Prefix (N)));
4027 if Desig_Typ /= Empty
4028 and then (Is_Frozen (Desig_Typ)
4029 or else (not Is_Fully_Defined (Desig_Typ)))
4034 -- All done if nothing needs freezing
4038 and then No (Desig_Typ)
4043 -- Loop for looking at the right place to insert the freeze nodes
4044 -- exiting from the loop when it is appropriate to insert the freeze
4045 -- node before the current node P.
4047 -- Also checks some special exceptions to the freezing rules. These
4048 -- cases result in a direct return, bypassing the freeze action.
4052 Parent_P := Parent (P);
4054 -- If we don't have a parent, then we are not in a well-formed tree.
4055 -- This is an unusual case, but there are some legitimate situations
4056 -- in which this occurs, notably when the expressions in the range of
4057 -- a type declaration are resolved. We simply ignore the freeze
4058 -- request in this case. Is this right ???
4060 if No (Parent_P) then
4064 -- See if we have got to an appropriate point in the tree
4066 case Nkind (Parent_P) is
4068 -- A special test for the exception of (RM 13.14(8)) for the case
4069 -- of per-object expressions (RM 3.8(18)) occurring in component
4070 -- definition or a discrete subtype definition. Note that we test
4071 -- for a component declaration which includes both cases we are
4072 -- interested in, and furthermore the tree does not have explicit
4073 -- nodes for either of these two constructs.
4075 when N_Component_Declaration =>
4077 -- The case we want to test for here is an identifier that is
4078 -- a per-object expression, this is either a discriminant that
4079 -- appears in a context other than the component declaration
4080 -- or it is a reference to the type of the enclosing construct.
4082 -- For either of these cases, we skip the freezing
4084 if not In_Spec_Expression
4085 and then Nkind (N) = N_Identifier
4086 and then (Present (Entity (N)))
4088 -- We recognize the discriminant case by just looking for
4089 -- a reference to a discriminant. It can only be one for
4090 -- the enclosing construct. Skip freezing in this case.
4092 if Ekind (Entity (N)) = E_Discriminant then
4095 -- For the case of a reference to the enclosing record,
4096 -- (or task or protected type), we look for a type that
4097 -- matches the current scope.
4099 elsif Entity (N) = Current_Scope then
4104 -- If we have an enumeration literal that appears as the choice in
4105 -- the aggregate of an enumeration representation clause, then
4106 -- freezing does not occur (RM 13.14(10)).
4108 when N_Enumeration_Representation_Clause =>
4110 -- The case we are looking for is an enumeration literal
4112 if (Nkind (N) = N_Identifier or Nkind (N) = N_Character_Literal)
4113 and then Is_Enumeration_Type (Etype (N))
4115 -- If enumeration literal appears directly as the choice,
4116 -- do not freeze (this is the normal non-overloaded case)
4118 if Nkind (Parent (N)) = N_Component_Association
4119 and then First (Choices (Parent (N))) = N
4123 -- If enumeration literal appears as the name of function
4124 -- which is the choice, then also do not freeze. This
4125 -- happens in the overloaded literal case, where the
4126 -- enumeration literal is temporarily changed to a function
4127 -- call for overloading analysis purposes.
4129 elsif Nkind (Parent (N)) = N_Function_Call
4131 Nkind (Parent (Parent (N))) = N_Component_Association
4133 First (Choices (Parent (Parent (N)))) = Parent (N)
4139 -- Normally if the parent is a handled sequence of statements,
4140 -- then the current node must be a statement, and that is an
4141 -- appropriate place to insert a freeze node.
4143 when N_Handled_Sequence_Of_Statements =>
4145 -- An exception occurs when the sequence of statements is for
4146 -- an expander generated body that did not do the usual freeze
4147 -- all operation. In this case we usually want to freeze
4148 -- outside this body, not inside it, and we skip past the
4149 -- subprogram body that we are inside.
4151 if In_Exp_Body (Parent_P) then
4153 -- However, we *do* want to freeze at this point if we have
4154 -- an entity to freeze, and that entity is declared *inside*
4155 -- the body of the expander generated procedure. This case
4156 -- is recognized by the scope of the type, which is either
4157 -- the spec for some enclosing body, or (in the case of
4158 -- init_procs, for which there are no separate specs) the
4162 Subp : constant Node_Id := Parent (Parent_P);
4166 if Nkind (Subp) = N_Subprogram_Body then
4167 Cspc := Corresponding_Spec (Subp);
4169 if (Present (Typ) and then Scope (Typ) = Cspc)
4171 (Present (Nam) and then Scope (Nam) = Cspc)
4176 and then Scope (Typ) = Current_Scope
4177 and then Current_Scope = Defining_Entity (Subp)
4184 -- If not that exception to the exception, then this is
4185 -- where we delay the freeze till outside the body.
4187 Parent_P := Parent (Parent_P);
4188 Freeze_Outside := True;
4190 -- Here if normal case where we are in handled statement
4191 -- sequence and want to do the insertion right there.
4197 -- If parent is a body or a spec or a block, then the current node
4198 -- is a statement or declaration and we can insert the freeze node
4201 when N_Package_Specification |
4207 N_Block_Statement => exit;
4209 -- The expander is allowed to define types in any statements list,
4210 -- so any of the following parent nodes also mark a freezing point
4211 -- if the actual node is in a list of statements or declarations.
4213 when N_Exception_Handler |
4216 N_Case_Statement_Alternative |
4217 N_Compilation_Unit_Aux |
4218 N_Selective_Accept |
4219 N_Accept_Alternative |
4220 N_Delay_Alternative |
4221 N_Conditional_Entry_Call |
4222 N_Entry_Call_Alternative |
4223 N_Triggering_Alternative |
4227 exit when Is_List_Member (P);
4229 -- Note: The N_Loop_Statement is a special case. A type that
4230 -- appears in the source can never be frozen in a loop (this
4231 -- occurs only because of a loop expanded by the expander), so we
4232 -- keep on going. Otherwise we terminate the search. Same is true
4233 -- of any entity which comes from source. (if they have predefined
4234 -- type, that type does not appear to come from source, but the
4235 -- entity should not be frozen here).
4237 when N_Loop_Statement =>
4238 exit when not Comes_From_Source (Etype (N))
4239 and then (No (Nam) or else not Comes_From_Source (Nam));
4241 -- For all other cases, keep looking at parents
4247 -- We fall through the case if we did not yet find the proper
4248 -- place in the free for inserting the freeze node, so climb!
4253 -- If the expression appears in a record or an initialization procedure,
4254 -- the freeze nodes are collected and attached to the current scope, to
4255 -- be inserted and analyzed on exit from the scope, to insure that
4256 -- generated entities appear in the correct scope. If the expression is
4257 -- a default for a discriminant specification, the scope is still void.
4258 -- The expression can also appear in the discriminant part of a private
4259 -- or concurrent type.
4261 -- If the expression appears in a constrained subcomponent of an
4262 -- enclosing record declaration, the freeze nodes must be attached to
4263 -- the outer record type so they can eventually be placed in the
4264 -- enclosing declaration list.
4266 -- The other case requiring this special handling is if we are in a
4267 -- default expression, since in that case we are about to freeze a
4268 -- static type, and the freeze scope needs to be the outer scope, not
4269 -- the scope of the subprogram with the default parameter.
4271 -- For default expressions and other spec expressions in generic units,
4272 -- the Move_Freeze_Nodes mechanism (see sem_ch12.adb) takes care of
4273 -- placing them at the proper place, after the generic unit.
4275 if (In_Spec_Exp and not Inside_A_Generic)
4276 or else Freeze_Outside
4277 or else (Is_Type (Current_Scope)
4278 and then (not Is_Concurrent_Type (Current_Scope)
4279 or else not Has_Completion (Current_Scope)))
4280 or else Ekind (Current_Scope) = E_Void
4283 Loc : constant Source_Ptr := Sloc (Current_Scope);
4284 Freeze_Nodes : List_Id := No_List;
4285 Pos : Int := Scope_Stack.Last;
4288 if Present (Desig_Typ) then
4289 Freeze_And_Append (Desig_Typ, Loc, Freeze_Nodes);
4292 if Present (Typ) then
4293 Freeze_And_Append (Typ, Loc, Freeze_Nodes);
4296 if Present (Nam) then
4297 Freeze_And_Append (Nam, Loc, Freeze_Nodes);
4300 -- The current scope may be that of a constrained component of
4301 -- an enclosing record declaration, which is above the current
4302 -- scope in the scope stack.
4304 if Is_Record_Type (Scope (Current_Scope)) then
4308 if Is_Non_Empty_List (Freeze_Nodes) then
4309 if No (Scope_Stack.Table (Pos).Pending_Freeze_Actions) then
4310 Scope_Stack.Table (Pos).Pending_Freeze_Actions :=
4313 Append_List (Freeze_Nodes, Scope_Stack.Table
4314 (Pos).Pending_Freeze_Actions);
4322 -- Now we have the right place to do the freezing. First, a special
4323 -- adjustment, if we are in spec-expression analysis mode, these freeze
4324 -- actions must not be thrown away (normally all inserted actions are
4325 -- thrown away in this mode. However, the freeze actions are from static
4326 -- expressions and one of the important reasons we are doing this
4327 -- special analysis is to get these freeze actions. Therefore we turn
4328 -- off the In_Spec_Expression mode to propagate these freeze actions.
4329 -- This also means they get properly analyzed and expanded.
4331 In_Spec_Expression := False;
4333 -- Freeze the designated type of an allocator (RM 13.14(13))
4335 if Present (Desig_Typ) then
4336 Freeze_Before (P, Desig_Typ);
4339 -- Freeze type of expression (RM 13.14(10)). Note that we took care of
4340 -- the enumeration representation clause exception in the loop above.
4342 if Present (Typ) then
4343 Freeze_Before (P, Typ);
4346 -- Freeze name if one is present (RM 13.14(11))
4348 if Present (Nam) then
4349 Freeze_Before (P, Nam);
4352 -- Restore In_Spec_Expression flag
4354 In_Spec_Expression := In_Spec_Exp;
4355 end Freeze_Expression;
4357 -----------------------------
4358 -- Freeze_Fixed_Point_Type --
4359 -----------------------------
4361 -- Certain fixed-point types and subtypes, including implicit base types
4362 -- and declared first subtypes, have not yet set up a range. This is
4363 -- because the range cannot be set until the Small and Size values are
4364 -- known, and these are not known till the type is frozen.
4366 -- To signal this case, Scalar_Range contains an unanalyzed syntactic range
4367 -- whose bounds are unanalyzed real literals. This routine will recognize
4368 -- this case, and transform this range node into a properly typed range
4369 -- with properly analyzed and resolved values.
4371 procedure Freeze_Fixed_Point_Type (Typ : Entity_Id) is
4372 Rng : constant Node_Id := Scalar_Range (Typ);
4373 Lo : constant Node_Id := Low_Bound (Rng);
4374 Hi : constant Node_Id := High_Bound (Rng);
4375 Btyp : constant Entity_Id := Base_Type (Typ);
4376 Brng : constant Node_Id := Scalar_Range (Btyp);
4377 BLo : constant Node_Id := Low_Bound (Brng);
4378 BHi : constant Node_Id := High_Bound (Brng);
4379 Small : constant Ureal := Small_Value (Typ);
4386 function Fsize (Lov, Hiv : Ureal) return Nat;
4387 -- Returns size of type with given bounds. Also leaves these
4388 -- bounds set as the current bounds of the Typ.
4394 function Fsize (Lov, Hiv : Ureal) return Nat is
4396 Set_Realval (Lo, Lov);
4397 Set_Realval (Hi, Hiv);
4398 return Minimum_Size (Typ);
4401 -- Start of processing for Freeze_Fixed_Point_Type
4404 -- If Esize of a subtype has not previously been set, set it now
4406 if Unknown_Esize (Typ) then
4407 Atype := Ancestor_Subtype (Typ);
4409 if Present (Atype) then
4410 Set_Esize (Typ, Esize (Atype));
4412 Set_Esize (Typ, Esize (Base_Type (Typ)));
4416 -- Immediate return if the range is already analyzed. This means that
4417 -- the range is already set, and does not need to be computed by this
4420 if Analyzed (Rng) then
4424 -- Immediate return if either of the bounds raises Constraint_Error
4426 if Raises_Constraint_Error (Lo)
4427 or else Raises_Constraint_Error (Hi)
4432 Loval := Realval (Lo);
4433 Hival := Realval (Hi);
4435 -- Ordinary fixed-point case
4437 if Is_Ordinary_Fixed_Point_Type (Typ) then
4439 -- For the ordinary fixed-point case, we are allowed to fudge the
4440 -- end-points up or down by small. Generally we prefer to fudge up,
4441 -- i.e. widen the bounds for non-model numbers so that the end points
4442 -- are included. However there are cases in which this cannot be
4443 -- done, and indeed cases in which we may need to narrow the bounds.
4444 -- The following circuit makes the decision.
4446 -- Note: our terminology here is that Incl_EP means that the bounds
4447 -- are widened by Small if necessary to include the end points, and
4448 -- Excl_EP means that the bounds are narrowed by Small to exclude the
4449 -- end-points if this reduces the size.
4451 -- Note that in the Incl case, all we care about is including the
4452 -- end-points. In the Excl case, we want to narrow the bounds as
4453 -- much as permitted by the RM, to give the smallest possible size.
4456 Loval_Incl_EP : Ureal;
4457 Hival_Incl_EP : Ureal;
4459 Loval_Excl_EP : Ureal;
4460 Hival_Excl_EP : Ureal;
4466 First_Subt : Entity_Id;
4471 -- First step. Base types are required to be symmetrical. Right
4472 -- now, the base type range is a copy of the first subtype range.
4473 -- This will be corrected before we are done, but right away we
4474 -- need to deal with the case where both bounds are non-negative.
4475 -- In this case, we set the low bound to the negative of the high
4476 -- bound, to make sure that the size is computed to include the
4477 -- required sign. Note that we do not need to worry about the
4478 -- case of both bounds negative, because the sign will be dealt
4479 -- with anyway. Furthermore we can't just go making such a bound
4480 -- symmetrical, since in a twos-complement system, there is an
4481 -- extra negative value which could not be accommodated on the
4485 and then not UR_Is_Negative (Loval)
4486 and then Hival > Loval
4489 Set_Realval (Lo, Loval);
4492 -- Compute the fudged bounds. If the number is a model number,
4493 -- then we do nothing to include it, but we are allowed to backoff
4494 -- to the next adjacent model number when we exclude it. If it is
4495 -- not a model number then we straddle the two values with the
4496 -- model numbers on either side.
4498 Model_Num := UR_Trunc (Loval / Small) * Small;
4500 if Loval = Model_Num then
4501 Loval_Incl_EP := Model_Num;
4503 Loval_Incl_EP := Model_Num - Small;
4506 -- The low value excluding the end point is Small greater, but
4507 -- we do not do this exclusion if the low value is positive,
4508 -- since it can't help the size and could actually hurt by
4509 -- crossing the high bound.
4511 if UR_Is_Negative (Loval_Incl_EP) then
4512 Loval_Excl_EP := Loval_Incl_EP + Small;
4514 -- If the value went from negative to zero, then we have the
4515 -- case where Loval_Incl_EP is the model number just below
4516 -- zero, so we want to stick to the negative value for the
4517 -- base type to maintain the condition that the size will
4518 -- include signed values.
4521 and then UR_Is_Zero (Loval_Excl_EP)
4523 Loval_Excl_EP := Loval_Incl_EP;
4527 Loval_Excl_EP := Loval_Incl_EP;
4530 -- Similar processing for upper bound and high value
4532 Model_Num := UR_Trunc (Hival / Small) * Small;
4534 if Hival = Model_Num then
4535 Hival_Incl_EP := Model_Num;
4537 Hival_Incl_EP := Model_Num + Small;
4540 if UR_Is_Positive (Hival_Incl_EP) then
4541 Hival_Excl_EP := Hival_Incl_EP - Small;
4543 Hival_Excl_EP := Hival_Incl_EP;
4546 -- One further adjustment is needed. In the case of subtypes, we
4547 -- cannot go outside the range of the base type, or we get
4548 -- peculiarities, and the base type range is already set. This
4549 -- only applies to the Incl values, since clearly the Excl values
4550 -- are already as restricted as they are allowed to be.
4553 Loval_Incl_EP := UR_Max (Loval_Incl_EP, Realval (BLo));
4554 Hival_Incl_EP := UR_Min (Hival_Incl_EP, Realval (BHi));
4557 -- Get size including and excluding end points
4559 Size_Incl_EP := Fsize (Loval_Incl_EP, Hival_Incl_EP);
4560 Size_Excl_EP := Fsize (Loval_Excl_EP, Hival_Excl_EP);
4562 -- No need to exclude end-points if it does not reduce size
4564 if Fsize (Loval_Incl_EP, Hival_Excl_EP) = Size_Excl_EP then
4565 Loval_Excl_EP := Loval_Incl_EP;
4568 if Fsize (Loval_Excl_EP, Hival_Incl_EP) = Size_Excl_EP then
4569 Hival_Excl_EP := Hival_Incl_EP;
4572 -- Now we set the actual size to be used. We want to use the
4573 -- bounds fudged up to include the end-points but only if this
4574 -- can be done without violating a specifically given size
4575 -- size clause or causing an unacceptable increase in size.
4577 -- Case of size clause given
4579 if Has_Size_Clause (Typ) then
4581 -- Use the inclusive size only if it is consistent with
4582 -- the explicitly specified size.
4584 if Size_Incl_EP <= RM_Size (Typ) then
4585 Actual_Lo := Loval_Incl_EP;
4586 Actual_Hi := Hival_Incl_EP;
4587 Actual_Size := Size_Incl_EP;
4589 -- If the inclusive size is too large, we try excluding
4590 -- the end-points (will be caught later if does not work).
4593 Actual_Lo := Loval_Excl_EP;
4594 Actual_Hi := Hival_Excl_EP;
4595 Actual_Size := Size_Excl_EP;
4598 -- Case of size clause not given
4601 -- If we have a base type whose corresponding first subtype
4602 -- has an explicit size that is large enough to include our
4603 -- end-points, then do so. There is no point in working hard
4604 -- to get a base type whose size is smaller than the specified
4605 -- size of the first subtype.
4607 First_Subt := First_Subtype (Typ);
4609 if Has_Size_Clause (First_Subt)
4610 and then Size_Incl_EP <= Esize (First_Subt)
4612 Actual_Size := Size_Incl_EP;
4613 Actual_Lo := Loval_Incl_EP;
4614 Actual_Hi := Hival_Incl_EP;
4616 -- If excluding the end-points makes the size smaller and
4617 -- results in a size of 8,16,32,64, then we take the smaller
4618 -- size. For the 64 case, this is compulsory. For the other
4619 -- cases, it seems reasonable. We like to include end points
4620 -- if we can, but not at the expense of moving to the next
4621 -- natural boundary of size.
4623 elsif Size_Incl_EP /= Size_Excl_EP
4625 (Size_Excl_EP = 8 or else
4626 Size_Excl_EP = 16 or else
4627 Size_Excl_EP = 32 or else
4630 Actual_Size := Size_Excl_EP;
4631 Actual_Lo := Loval_Excl_EP;
4632 Actual_Hi := Hival_Excl_EP;
4634 -- Otherwise we can definitely include the end points
4637 Actual_Size := Size_Incl_EP;
4638 Actual_Lo := Loval_Incl_EP;
4639 Actual_Hi := Hival_Incl_EP;
4642 -- One pathological case: normally we never fudge a low bound
4643 -- down, since it would seem to increase the size (if it has
4644 -- any effect), but for ranges containing single value, or no
4645 -- values, the high bound can be small too large. Consider:
4647 -- type t is delta 2.0**(-14)
4648 -- range 131072.0 .. 0;
4650 -- That lower bound is *just* outside the range of 32 bits, and
4651 -- does need fudging down in this case. Note that the bounds
4652 -- will always have crossed here, since the high bound will be
4653 -- fudged down if necessary, as in the case of:
4655 -- type t is delta 2.0**(-14)
4656 -- range 131072.0 .. 131072.0;
4658 -- So we detect the situation by looking for crossed bounds,
4659 -- and if the bounds are crossed, and the low bound is greater
4660 -- than zero, we will always back it off by small, since this
4661 -- is completely harmless.
4663 if Actual_Lo > Actual_Hi then
4664 if UR_Is_Positive (Actual_Lo) then
4665 Actual_Lo := Loval_Incl_EP - Small;
4666 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4668 -- And of course, we need to do exactly the same parallel
4669 -- fudge for flat ranges in the negative region.
4671 elsif UR_Is_Negative (Actual_Hi) then
4672 Actual_Hi := Hival_Incl_EP + Small;
4673 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4678 Set_Realval (Lo, Actual_Lo);
4679 Set_Realval (Hi, Actual_Hi);
4682 -- For the decimal case, none of this fudging is required, since there
4683 -- are no end-point problems in the decimal case (the end-points are
4684 -- always included).
4687 Actual_Size := Fsize (Loval, Hival);
4690 -- At this stage, the actual size has been calculated and the proper
4691 -- required bounds are stored in the low and high bounds.
4693 if Actual_Size > 64 then
4694 Error_Msg_Uint_1 := UI_From_Int (Actual_Size);
4696 ("size required (^) for type& too large, maximum allowed is 64",
4701 -- Check size against explicit given size
4703 if Has_Size_Clause (Typ) then
4704 if Actual_Size > RM_Size (Typ) then
4705 Error_Msg_Uint_1 := RM_Size (Typ);
4706 Error_Msg_Uint_2 := UI_From_Int (Actual_Size);
4708 ("size given (^) for type& too small, minimum allowed is ^",
4709 Size_Clause (Typ), Typ);
4712 Actual_Size := UI_To_Int (Esize (Typ));
4715 -- Increase size to next natural boundary if no size clause given
4718 if Actual_Size <= 8 then
4720 elsif Actual_Size <= 16 then
4722 elsif Actual_Size <= 32 then
4728 Init_Esize (Typ, Actual_Size);
4729 Adjust_Esize_For_Alignment (Typ);
4732 -- If we have a base type, then expand the bounds so that they extend to
4733 -- the full width of the allocated size in bits, to avoid junk range
4734 -- checks on intermediate computations.
4736 if Base_Type (Typ) = Typ then
4737 Set_Realval (Lo, -(Small * (Uint_2 ** (Actual_Size - 1))));
4738 Set_Realval (Hi, (Small * (Uint_2 ** (Actual_Size - 1) - 1)));
4741 -- Final step is to reanalyze the bounds using the proper type
4742 -- and set the Corresponding_Integer_Value fields of the literals.
4744 Set_Etype (Lo, Empty);
4745 Set_Analyzed (Lo, False);
4748 -- Resolve with universal fixed if the base type, and the base type if
4749 -- it is a subtype. Note we can't resolve the base type with itself,
4750 -- that would be a reference before definition.
4753 Resolve (Lo, Universal_Fixed);
4758 -- Set corresponding integer value for bound
4760 Set_Corresponding_Integer_Value
4761 (Lo, UR_To_Uint (Realval (Lo) / Small));
4763 -- Similar processing for high bound
4765 Set_Etype (Hi, Empty);
4766 Set_Analyzed (Hi, False);
4770 Resolve (Hi, Universal_Fixed);
4775 Set_Corresponding_Integer_Value
4776 (Hi, UR_To_Uint (Realval (Hi) / Small));
4778 -- Set type of range to correspond to bounds
4780 Set_Etype (Rng, Etype (Lo));
4782 -- Set Esize to calculated size if not set already
4784 if Unknown_Esize (Typ) then
4785 Init_Esize (Typ, Actual_Size);
4788 -- Set RM_Size if not already set. If already set, check value
4791 Minsiz : constant Uint := UI_From_Int (Minimum_Size (Typ));
4794 if RM_Size (Typ) /= Uint_0 then
4795 if RM_Size (Typ) < Minsiz then
4796 Error_Msg_Uint_1 := RM_Size (Typ);
4797 Error_Msg_Uint_2 := Minsiz;
4799 ("size given (^) for type& too small, minimum allowed is ^",
4800 Size_Clause (Typ), Typ);
4804 Set_RM_Size (Typ, Minsiz);
4807 end Freeze_Fixed_Point_Type;
4813 procedure Freeze_Itype (T : Entity_Id; N : Node_Id) is
4817 Set_Has_Delayed_Freeze (T);
4818 L := Freeze_Entity (T, Sloc (N));
4820 if Is_Non_Empty_List (L) then
4821 Insert_Actions (N, L);
4825 --------------------------
4826 -- Freeze_Static_Object --
4827 --------------------------
4829 procedure Freeze_Static_Object (E : Entity_Id) is
4831 Cannot_Be_Static : exception;
4832 -- Exception raised if the type of a static object cannot be made
4833 -- static. This happens if the type depends on non-global objects.
4835 procedure Ensure_Expression_Is_SA (N : Node_Id);
4836 -- Called to ensure that an expression used as part of a type definition
4837 -- is statically allocatable, which means that the expression type is
4838 -- statically allocatable, and the expression is either static, or a
4839 -- reference to a library level constant.
4841 procedure Ensure_Type_Is_SA (Typ : Entity_Id);
4842 -- Called to mark a type as static, checking that it is possible
4843 -- to set the type as static. If it is not possible, then the
4844 -- exception Cannot_Be_Static is raised.
4846 -----------------------------
4847 -- Ensure_Expression_Is_SA --
4848 -----------------------------
4850 procedure Ensure_Expression_Is_SA (N : Node_Id) is
4854 Ensure_Type_Is_SA (Etype (N));
4856 if Is_Static_Expression (N) then
4859 elsif Nkind (N) = N_Identifier then
4863 and then Ekind (Ent) = E_Constant
4864 and then Is_Library_Level_Entity (Ent)
4870 raise Cannot_Be_Static;
4871 end Ensure_Expression_Is_SA;
4873 -----------------------
4874 -- Ensure_Type_Is_SA --
4875 -----------------------
4877 procedure Ensure_Type_Is_SA (Typ : Entity_Id) is
4882 -- If type is library level, we are all set
4884 if Is_Library_Level_Entity (Typ) then
4888 -- We are also OK if the type already marked as statically allocated,
4889 -- which means we processed it before.
4891 if Is_Statically_Allocated (Typ) then
4895 -- Mark type as statically allocated
4897 Set_Is_Statically_Allocated (Typ);
4899 -- Check that it is safe to statically allocate this type
4901 if Is_Scalar_Type (Typ) or else Is_Real_Type (Typ) then
4902 Ensure_Expression_Is_SA (Type_Low_Bound (Typ));
4903 Ensure_Expression_Is_SA (Type_High_Bound (Typ));
4905 elsif Is_Array_Type (Typ) then
4906 N := First_Index (Typ);
4907 while Present (N) loop
4908 Ensure_Type_Is_SA (Etype (N));
4912 Ensure_Type_Is_SA (Component_Type (Typ));
4914 elsif Is_Access_Type (Typ) then
4915 if Ekind (Designated_Type (Typ)) = E_Subprogram_Type then
4919 T : constant Entity_Id := Etype (Designated_Type (Typ));
4922 if T /= Standard_Void_Type then
4923 Ensure_Type_Is_SA (T);
4926 F := First_Formal (Designated_Type (Typ));
4928 while Present (F) loop
4929 Ensure_Type_Is_SA (Etype (F));
4935 Ensure_Type_Is_SA (Designated_Type (Typ));
4938 elsif Is_Record_Type (Typ) then
4939 C := First_Entity (Typ);
4940 while Present (C) loop
4941 if Ekind (C) = E_Discriminant
4942 or else Ekind (C) = E_Component
4944 Ensure_Type_Is_SA (Etype (C));
4946 elsif Is_Type (C) then
4947 Ensure_Type_Is_SA (C);
4953 elsif Ekind (Typ) = E_Subprogram_Type then
4954 Ensure_Type_Is_SA (Etype (Typ));
4956 C := First_Formal (Typ);
4957 while Present (C) loop
4958 Ensure_Type_Is_SA (Etype (C));
4963 raise Cannot_Be_Static;
4965 end Ensure_Type_Is_SA;
4967 -- Start of processing for Freeze_Static_Object
4970 Ensure_Type_Is_SA (Etype (E));
4973 when Cannot_Be_Static =>
4975 -- If the object that cannot be static is imported or exported,
4976 -- then we give an error message saying that this object cannot
4977 -- be imported or exported.
4979 if Is_Imported (E) then
4981 ("& cannot be imported (local type is not constant)", E);
4983 -- Otherwise must be exported, something is wrong if compiler
4984 -- is marking something as statically allocated which cannot be).
4986 else pragma Assert (Is_Exported (E));
4988 ("& cannot be exported (local type is not constant)", E);
4990 end Freeze_Static_Object;
4992 -----------------------
4993 -- Freeze_Subprogram --
4994 -----------------------
4996 procedure Freeze_Subprogram (E : Entity_Id) is
5001 -- Subprogram may not have an address clause unless it is imported
5003 if Present (Address_Clause (E)) then
5004 if not Is_Imported (E) then
5006 ("address clause can only be given " &
5007 "for imported subprogram",
5008 Name (Address_Clause (E)));
5012 -- Reset the Pure indication on an imported subprogram unless an
5013 -- explicit Pure_Function pragma was present. We do this because
5014 -- otherwise it is an insidious error to call a non-pure function from
5015 -- pure unit and have calls mysteriously optimized away. What happens
5016 -- here is that the Import can bypass the normal check to ensure that
5017 -- pure units call only pure subprograms.
5020 and then Is_Pure (E)
5021 and then not Has_Pragma_Pure_Function (E)
5023 Set_Is_Pure (E, False);
5026 -- For non-foreign convention subprograms, this is where we create
5027 -- the extra formals (for accessibility level and constrained bit
5028 -- information). We delay this till the freeze point precisely so
5029 -- that we know the convention!
5031 if not Has_Foreign_Convention (E) then
5032 Create_Extra_Formals (E);
5035 -- If this is convention Ada and a Valued_Procedure, that's odd
5037 if Ekind (E) = E_Procedure
5038 and then Is_Valued_Procedure (E)
5039 and then Convention (E) = Convention_Ada
5040 and then Warn_On_Export_Import
5043 ("?Valued_Procedure has no effect for convention Ada", E);
5044 Set_Is_Valued_Procedure (E, False);
5047 -- Case of foreign convention
5052 -- For foreign conventions, warn about return of an
5053 -- unconstrained array.
5055 -- Note: we *do* allow a return by descriptor for the VMS case,
5056 -- though here there is probably more to be done ???
5058 if Ekind (E) = E_Function then
5059 Retype := Underlying_Type (Etype (E));
5061 -- If no return type, probably some other error, e.g. a
5062 -- missing full declaration, so ignore.
5067 -- If the return type is generic, we have emitted a warning
5068 -- earlier on, and there is nothing else to check here. Specific
5069 -- instantiations may lead to erroneous behavior.
5071 elsif Is_Generic_Type (Etype (E)) then
5074 elsif Is_Array_Type (Retype)
5075 and then not Is_Constrained (Retype)
5076 and then Mechanism (E) not in Descriptor_Codes
5077 and then Warn_On_Export_Import
5080 ("?foreign convention function& should not return " &
5081 "unconstrained array", E);
5086 -- If any of the formals for an exported foreign convention
5087 -- subprogram have defaults, then emit an appropriate warning since
5088 -- this is odd (default cannot be used from non-Ada code)
5090 if Is_Exported (E) then
5091 F := First_Formal (E);
5092 while Present (F) loop
5093 if Warn_On_Export_Import
5094 and then Present (Default_Value (F))
5097 ("?parameter cannot be defaulted in non-Ada call",
5106 -- For VMS, descriptor mechanisms for parameters are allowed only
5107 -- for imported/exported subprograms. Moreover, the NCA descriptor
5108 -- is not allowed for parameters of exported subprograms.
5110 if OpenVMS_On_Target then
5111 if Is_Exported (E) then
5112 F := First_Formal (E);
5113 while Present (F) loop
5114 if Mechanism (F) = By_Descriptor_NCA then
5116 ("'N'C'A' descriptor for parameter not permitted", F);
5118 ("\can only be used for imported subprogram", F);
5124 elsif not Is_Imported (E) then
5125 F := First_Formal (E);
5126 while Present (F) loop
5127 if Mechanism (F) in Descriptor_Codes then
5129 ("descriptor mechanism for parameter not permitted", F);
5131 ("\can only be used for imported/exported subprogram", F);
5139 -- Pragma Inline_Always is disallowed for dispatching subprograms
5140 -- because the address of such subprograms is saved in the dispatch
5141 -- table to support dispatching calls, and dispatching calls cannot
5142 -- be inlined. This is consistent with the restriction against using
5143 -- 'Access or 'Address on an Inline_Always subprogram.
5145 if Is_Dispatching_Operation (E)
5146 and then Has_Pragma_Inline_Always (E)
5149 ("pragma Inline_Always not allowed for dispatching subprograms", E);
5152 -- Because of the implicit representation of inherited predefined
5153 -- operators in the front-end, the overriding status of the operation
5154 -- may be affected when a full view of a type is analyzed, and this is
5155 -- not captured by the analysis of the corresponding type declaration.
5156 -- Therefore the correctness of a not-overriding indicator must be
5157 -- rechecked when the subprogram is frozen.
5159 if Nkind (E) = N_Defining_Operator_Symbol
5160 and then not Error_Posted (Parent (E))
5162 Check_Overriding_Indicator (E, Empty, Is_Primitive (E));
5164 end Freeze_Subprogram;
5166 ----------------------
5167 -- Is_Fully_Defined --
5168 ----------------------
5170 function Is_Fully_Defined (T : Entity_Id) return Boolean is
5172 if Ekind (T) = E_Class_Wide_Type then
5173 return Is_Fully_Defined (Etype (T));
5175 elsif Is_Array_Type (T) then
5176 return Is_Fully_Defined (Component_Type (T));
5178 elsif Is_Record_Type (T)
5179 and not Is_Private_Type (T)
5181 -- Verify that the record type has no components with private types
5182 -- without completion.
5188 Comp := First_Component (T);
5190 while Present (Comp) loop
5191 if not Is_Fully_Defined (Etype (Comp)) then
5195 Next_Component (Comp);
5201 return not Is_Private_Type (T)
5202 or else Present (Full_View (Base_Type (T)));
5204 end Is_Fully_Defined;
5206 ---------------------------------
5207 -- Generate_Prim_Op_References --
5208 ---------------------------------
5210 procedure Generate_Prim_Op_References
5215 Prim_List : Elist_Id;
5219 -- Handle subtypes of synchronized types.
5221 if Ekind (Typ) = E_Protected_Subtype
5222 or else Ekind (Typ) = E_Task_Subtype
5224 Base_T := Etype (Typ);
5229 -- References to primitive operations are only relevant for tagged types
5231 if not Is_Tagged_Type (Base_T)
5232 or else Is_Class_Wide_Type (Base_T)
5237 -- Ada 2005 (AI-345): For synchronized types generate reference
5238 -- to the wrapper that allow us to dispatch calls through their
5239 -- implemented abstract interface types.
5241 -- The check for Present here is to protect against previously
5242 -- reported critical errors.
5244 if Is_Concurrent_Type (Base_T)
5245 and then Present (Corresponding_Record_Type (Base_T))
5247 Prim_List := Primitive_Operations
5248 (Corresponding_Record_Type (Base_T));
5250 Prim_List := Primitive_Operations (Base_T);
5253 if No (Prim_List) then
5257 Prim := First_Elmt (Prim_List);
5258 while Present (Prim) loop
5260 -- If the operation is derived, get the original for cross-reference
5261 -- reference purposes (it is the original for which we want the xref
5262 -- and for which the comes_from_source test must be performed).
5265 while Present (Alias (Ent)) loop
5269 Generate_Reference (Typ, Ent, 'p', Set_Ref => False);
5272 end Generate_Prim_Op_References;
5274 ---------------------------------
5275 -- Process_Default_Expressions --
5276 ---------------------------------
5278 procedure Process_Default_Expressions
5280 After : in out Node_Id)
5282 Loc : constant Source_Ptr := Sloc (E);
5289 Set_Default_Expressions_Processed (E);
5291 -- A subprogram instance and its associated anonymous subprogram share
5292 -- their signature. The default expression functions are defined in the
5293 -- wrapper packages for the anonymous subprogram, and should not be
5294 -- generated again for the instance.
5296 if Is_Generic_Instance (E)
5297 and then Present (Alias (E))
5298 and then Default_Expressions_Processed (Alias (E))
5303 Formal := First_Formal (E);
5304 while Present (Formal) loop
5305 if Present (Default_Value (Formal)) then
5307 -- We work with a copy of the default expression because we
5308 -- do not want to disturb the original, since this would mess
5309 -- up the conformance checking.
5311 Dcopy := New_Copy_Tree (Default_Value (Formal));
5313 -- The analysis of the expression may generate insert actions,
5314 -- which of course must not be executed. We wrap those actions
5315 -- in a procedure that is not called, and later on eliminated.
5316 -- The following cases have no side-effects, and are analyzed
5319 if Nkind (Dcopy) = N_Identifier
5320 or else Nkind (Dcopy) = N_Expanded_Name
5321 or else Nkind (Dcopy) = N_Integer_Literal
5322 or else (Nkind (Dcopy) = N_Real_Literal
5323 and then not Vax_Float (Etype (Dcopy)))
5324 or else Nkind (Dcopy) = N_Character_Literal
5325 or else Nkind (Dcopy) = N_String_Literal
5326 or else Known_Null (Dcopy)
5327 or else (Nkind (Dcopy) = N_Attribute_Reference
5329 Attribute_Name (Dcopy) = Name_Null_Parameter)
5332 -- If there is no default function, we must still do a full
5333 -- analyze call on the default value, to ensure that all error
5334 -- checks are performed, e.g. those associated with static
5335 -- evaluation. Note: this branch will always be taken if the
5336 -- analyzer is turned off (but we still need the error checks).
5338 -- Note: the setting of parent here is to meet the requirement
5339 -- that we can only analyze the expression while attached to
5340 -- the tree. Really the requirement is that the parent chain
5341 -- be set, we don't actually need to be in the tree.
5343 Set_Parent (Dcopy, Declaration_Node (Formal));
5346 -- Default expressions are resolved with their own type if the
5347 -- context is generic, to avoid anomalies with private types.
5349 if Ekind (Scope (E)) = E_Generic_Package then
5352 Resolve (Dcopy, Etype (Formal));
5355 -- If that resolved expression will raise constraint error,
5356 -- then flag the default value as raising constraint error.
5357 -- This allows a proper error message on the calls.
5359 if Raises_Constraint_Error (Dcopy) then
5360 Set_Raises_Constraint_Error (Default_Value (Formal));
5363 -- If the default is a parameterless call, we use the name of
5364 -- the called function directly, and there is no body to build.
5366 elsif Nkind (Dcopy) = N_Function_Call
5367 and then No (Parameter_Associations (Dcopy))
5371 -- Else construct and analyze the body of a wrapper procedure
5372 -- that contains an object declaration to hold the expression.
5373 -- Given that this is done only to complete the analysis, it
5374 -- simpler to build a procedure than a function which might
5375 -- involve secondary stack expansion.
5379 Make_Defining_Identifier (Loc, New_Internal_Name ('D'));
5382 Make_Subprogram_Body (Loc,
5384 Make_Procedure_Specification (Loc,
5385 Defining_Unit_Name => Dnam),
5387 Declarations => New_List (
5388 Make_Object_Declaration (Loc,
5389 Defining_Identifier =>
5390 Make_Defining_Identifier (Loc,
5391 New_Internal_Name ('T')),
5392 Object_Definition =>
5393 New_Occurrence_Of (Etype (Formal), Loc),
5394 Expression => New_Copy_Tree (Dcopy))),
5396 Handled_Statement_Sequence =>
5397 Make_Handled_Sequence_Of_Statements (Loc,
5398 Statements => New_List));
5400 Set_Scope (Dnam, Scope (E));
5401 Set_Assignment_OK (First (Declarations (Dbody)));
5402 Set_Is_Eliminated (Dnam);
5403 Insert_After (After, Dbody);
5409 Next_Formal (Formal);
5411 end Process_Default_Expressions;
5413 ----------------------------------------
5414 -- Set_Component_Alignment_If_Not_Set --
5415 ----------------------------------------
5417 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id) is
5419 -- Ignore if not base type, subtypes don't need anything
5421 if Typ /= Base_Type (Typ) then
5425 -- Do not override existing representation
5427 if Is_Packed (Typ) then
5430 elsif Has_Specified_Layout (Typ) then
5433 elsif Component_Alignment (Typ) /= Calign_Default then
5437 Set_Component_Alignment
5438 (Typ, Scope_Stack.Table
5439 (Scope_Stack.Last).Component_Alignment_Default);
5441 end Set_Component_Alignment_If_Not_Set;
5447 procedure Undelay_Type (T : Entity_Id) is
5449 Set_Has_Delayed_Freeze (T, False);
5450 Set_Freeze_Node (T, Empty);
5452 -- Since we don't want T to have a Freeze_Node, we don't want its
5453 -- Full_View or Corresponding_Record_Type to have one either.
5455 -- ??? Fundamentally, this whole handling is a kludge. What we really
5456 -- want is to be sure that for an Itype that's part of record R and is a
5457 -- subtype of type T, that it's frozen after the later of the freeze
5458 -- points of R and T. We have no way of doing that directly, so what we
5459 -- do is force most such Itypes to be frozen as part of freezing R via
5460 -- this procedure and only delay the ones that need to be delayed
5461 -- (mostly the designated types of access types that are defined as part
5464 if Is_Private_Type (T)
5465 and then Present (Full_View (T))
5466 and then Is_Itype (Full_View (T))
5467 and then Is_Record_Type (Scope (Full_View (T)))
5469 Undelay_Type (Full_View (T));
5472 if Is_Concurrent_Type (T)
5473 and then Present (Corresponding_Record_Type (T))
5474 and then Is_Itype (Corresponding_Record_Type (T))
5475 and then Is_Record_Type (Scope (Corresponding_Record_Type (T)))
5477 Undelay_Type (Corresponding_Record_Type (T));
5485 procedure Warn_Overlay
5490 Ent : constant Entity_Id := Entity (Nam);
5491 -- The object to which the address clause applies
5494 Old : Entity_Id := Empty;
5498 -- No warning if address clause overlay warnings are off
5500 if not Address_Clause_Overlay_Warnings then
5504 -- No warning if there is an explicit initialization
5506 Init := Original_Node (Expression (Declaration_Node (Ent)));
5508 if Present (Init) and then Comes_From_Source (Init) then
5512 -- We only give the warning for non-imported entities of a type for
5513 -- which a non-null base init proc is defined (or for access types which
5514 -- have implicit null initialization).
5517 and then (Has_Non_Null_Base_Init_Proc (Typ)
5518 or else Is_Access_Type (Typ))
5519 and then not Is_Imported (Ent)
5521 if Nkind (Expr) = N_Attribute_Reference
5522 and then Is_Entity_Name (Prefix (Expr))
5524 Old := Entity (Prefix (Expr));
5526 elsif Is_Entity_Name (Expr)
5527 and then Ekind (Entity (Expr)) = E_Constant
5529 Decl := Declaration_Node (Entity (Expr));
5531 if Nkind (Decl) = N_Object_Declaration
5532 and then Present (Expression (Decl))
5533 and then Nkind (Expression (Decl)) = N_Attribute_Reference
5534 and then Is_Entity_Name (Prefix (Expression (Decl)))
5536 Old := Entity (Prefix (Expression (Decl)));
5538 elsif Nkind (Expr) = N_Function_Call then
5542 -- A function call (most likely to To_Address) is probably not an
5543 -- overlay, so skip warning. Ditto if the function call was inlined
5544 -- and transformed into an entity.
5546 elsif Nkind (Original_Node (Expr)) = N_Function_Call then
5550 Decl := Next (Parent (Expr));
5552 -- If a pragma Import follows, we assume that it is for the current
5553 -- target of the address clause, and skip the warning.
5556 and then Nkind (Decl) = N_Pragma
5557 and then Pragma_Name (Decl) = Name_Import
5562 if Present (Old) then
5563 Error_Msg_Node_2 := Old;
5565 ("default initialization of & may modify &?",
5569 ("default initialization of & may modify overlaid storage?",
5573 -- Add friendly warning if initialization comes from a packed array
5576 if Is_Record_Type (Typ) then
5581 Comp := First_Component (Typ);
5583 while Present (Comp) loop
5584 if Nkind (Parent (Comp)) = N_Component_Declaration
5585 and then Present (Expression (Parent (Comp)))
5588 elsif Is_Array_Type (Etype (Comp))
5589 and then Present (Packed_Array_Type (Etype (Comp)))
5592 ("\packed array component& " &
5593 "will be initialized to zero?",
5597 Next_Component (Comp);
5604 ("\use pragma Import for & to " &
5605 "suppress initialization (RM B.1(24))?",
OSDN Git Service
