Merge from mainline (160224:163495).
[official-gcc/graphite-test-results.git] / gcc / ada / freeze.adb
blob8a48f9ca78d22a8881b999e0a98ef62302470d3b
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT COMPILER COMPONENTS --
4 -- --
5 -- F R E E Z E --
6 -- --
7 -- B o d y --
8 -- --
9 -- Copyright (C) 1992-2010, Free Software Foundation, Inc. --
10 -- --
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 3, 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. --
17 -- --
18 -- You should have received a copy of the GNU General Public License along --
19 -- with this program; see file COPYING3. If not see --
20 -- <http://www.gnu.org/licenses/>. --
21 -- --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 -- --
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; use Lib;
40 with Namet; use Namet;
41 with Nlists; use Nlists;
42 with Nmake; use Nmake;
43 with Opt; use Opt;
44 with Restrict; use Restrict;
45 with Rident; use Rident;
46 with Sem; use Sem;
47 with Sem_Aux; use Sem_Aux;
48 with Sem_Cat; use Sem_Cat;
49 with Sem_Ch6; use Sem_Ch6;
50 with Sem_Ch7; use Sem_Ch7;
51 with Sem_Ch8; use Sem_Ch8;
52 with Sem_Ch13; use Sem_Ch13;
53 with Sem_Eval; use Sem_Eval;
54 with Sem_Mech; use Sem_Mech;
55 with Sem_Prag; use Sem_Prag;
56 with Sem_Res; use Sem_Res;
57 with Sem_Util; use Sem_Util;
58 with Sinfo; use Sinfo;
59 with Snames; use Snames;
60 with Stand; use Stand;
61 with Targparm; use Targparm;
62 with Tbuild; use Tbuild;
63 with Ttypes; use Ttypes;
64 with Uintp; use Uintp;
65 with Urealp; use Urealp;
67 package body Freeze is
69 -----------------------
70 -- Local Subprograms --
71 -----------------------
73 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id);
74 -- Typ is a type that is being frozen. If no size clause is given,
75 -- but a default Esize has been computed, then this default Esize is
76 -- adjusted up if necessary to be consistent with a given alignment,
77 -- but never to a value greater than Long_Long_Integer'Size. This
78 -- is used for all discrete types and for fixed-point types.
80 procedure Build_And_Analyze_Renamed_Body
81 (Decl : Node_Id;
82 New_S : Entity_Id;
83 After : in out Node_Id);
84 -- Build body for a renaming declaration, insert in tree and analyze
86 procedure Check_Address_Clause (E : Entity_Id);
87 -- Apply legality checks to address clauses for object declarations,
88 -- at the point the object is frozen.
90 procedure Check_Strict_Alignment (E : Entity_Id);
91 -- E is a base type. If E is tagged or has a component that is aliased
92 -- or tagged or contains something this is aliased or tagged, set
93 -- Strict_Alignment.
95 procedure Check_Unsigned_Type (E : Entity_Id);
96 pragma Inline (Check_Unsigned_Type);
97 -- If E is a fixed-point or discrete type, then all the necessary work
98 -- to freeze it is completed except for possible setting of the flag
99 -- Is_Unsigned_Type, which is done by this procedure. The call has no
100 -- effect if the entity E is not a discrete or fixed-point type.
102 procedure Freeze_And_Append
103 (Ent : Entity_Id;
104 Loc : Source_Ptr;
105 Result : in out List_Id);
106 -- Freezes Ent using Freeze_Entity, and appends the resulting list of
107 -- nodes to Result, modifying Result from No_List if necessary.
109 procedure Freeze_Enumeration_Type (Typ : Entity_Id);
110 -- Freeze enumeration type. The Esize field is set as processing
111 -- proceeds (i.e. set by default when the type is declared and then
112 -- adjusted by rep clauses. What this procedure does is to make sure
113 -- that if a foreign convention is specified, and no specific size
114 -- is given, then the size must be at least Integer'Size.
116 procedure Freeze_Static_Object (E : Entity_Id);
117 -- If an object is frozen which has Is_Statically_Allocated set, then
118 -- all referenced types must also be marked with this flag. This routine
119 -- is in charge of meeting this requirement for the object entity E.
121 procedure Freeze_Subprogram (E : Entity_Id);
122 -- Perform freezing actions for a subprogram (create extra formals,
123 -- and set proper default mechanism values). Note that this routine
124 -- is not called for internal subprograms, for which neither of these
125 -- actions is needed (or desirable, we do not want for example to have
126 -- these extra formals present in initialization procedures, where they
127 -- would serve no purpose). In this call E is either a subprogram or
128 -- a subprogram type (i.e. an access to a subprogram).
130 function Is_Fully_Defined (T : Entity_Id) return Boolean;
131 -- True if T is not private and has no private components, or has a full
132 -- view. Used to determine whether the designated type of an access type
133 -- should be frozen when the access type is frozen. This is done when an
134 -- allocator is frozen, or an expression that may involve attributes of
135 -- the designated type. Otherwise freezing the access type does not freeze
136 -- the designated type.
138 procedure Process_Default_Expressions
139 (E : Entity_Id;
140 After : in out Node_Id);
141 -- This procedure is called for each subprogram to complete processing
142 -- of default expressions at the point where all types are known to be
143 -- frozen. The expressions must be analyzed in full, to make sure that
144 -- all error processing is done (they have only been pre-analyzed). If
145 -- the expression is not an entity or literal, its analysis may generate
146 -- code which must not be executed. In that case we build a function
147 -- body to hold that code. This wrapper function serves no other purpose
148 -- (it used to be called to evaluate the default, but now the default is
149 -- inlined at each point of call).
151 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id);
152 -- Typ is a record or array type that is being frozen. This routine
153 -- sets the default component alignment from the scope stack values
154 -- if the alignment is otherwise not specified.
156 procedure Check_Debug_Info_Needed (T : Entity_Id);
157 -- As each entity is frozen, this routine is called to deal with the
158 -- setting of Debug_Info_Needed for the entity. This flag is set if
159 -- the entity comes from source, or if we are in Debug_Generated_Code
160 -- mode or if the -gnatdV debug flag is set. However, it never sets
161 -- the flag if Debug_Info_Off is set. This procedure also ensures that
162 -- subsidiary entities have the flag set as required.
164 procedure Undelay_Type (T : Entity_Id);
165 -- T is a type of a component that we know to be an Itype.
166 -- We don't want this to have a Freeze_Node, so ensure it doesn't.
167 -- Do the same for any Full_View or Corresponding_Record_Type.
169 procedure Warn_Overlay
170 (Expr : Node_Id;
171 Typ : Entity_Id;
172 Nam : Node_Id);
173 -- Expr is the expression for an address clause for entity Nam whose type
174 -- is Typ. If Typ has a default initialization, and there is no explicit
175 -- initialization in the source declaration, check whether the address
176 -- clause might cause overlaying of an entity, and emit a warning on the
177 -- side effect that the initialization will cause.
179 -------------------------------
180 -- Adjust_Esize_For_Alignment --
181 -------------------------------
183 procedure Adjust_Esize_For_Alignment (Typ : Entity_Id) is
184 Align : Uint;
186 begin
187 if Known_Esize (Typ) and then Known_Alignment (Typ) then
188 Align := Alignment_In_Bits (Typ);
190 if Align > Esize (Typ)
191 and then Align <= Standard_Long_Long_Integer_Size
192 then
193 Set_Esize (Typ, Align);
194 end if;
195 end if;
196 end Adjust_Esize_For_Alignment;
198 ------------------------------------
199 -- Build_And_Analyze_Renamed_Body --
200 ------------------------------------
202 procedure Build_And_Analyze_Renamed_Body
203 (Decl : Node_Id;
204 New_S : Entity_Id;
205 After : in out Node_Id)
207 Body_Decl : constant Node_Id := Unit_Declaration_Node (New_S);
208 Ent : constant Entity_Id := Defining_Entity (Decl);
209 Body_Node : Node_Id;
210 Renamed_Subp : Entity_Id;
212 begin
213 -- If the renamed subprogram is intrinsic, there is no need for a
214 -- wrapper body: we set the alias that will be called and expanded which
215 -- completes the declaration. This transformation is only legal if the
216 -- renamed entity has already been elaborated.
218 -- Note that it is legal for a renaming_as_body to rename an intrinsic
219 -- subprogram, as long as the renaming occurs before the new entity
220 -- is frozen. See RM 8.5.4 (5).
222 if Nkind (Body_Decl) = N_Subprogram_Renaming_Declaration
223 and then Is_Entity_Name (Name (Body_Decl))
224 then
225 Renamed_Subp := Entity (Name (Body_Decl));
226 else
227 Renamed_Subp := Empty;
228 end if;
230 if Present (Renamed_Subp)
231 and then Is_Intrinsic_Subprogram (Renamed_Subp)
232 and then
233 (not In_Same_Source_Unit (Renamed_Subp, Ent)
234 or else Sloc (Renamed_Subp) < Sloc (Ent))
236 -- We can make the renaming entity intrisic if the renamed function
237 -- has an interface name, or if it is one of the shift/rotate
238 -- operations known to the compiler.
240 and then (Present (Interface_Name (Renamed_Subp))
241 or else Chars (Renamed_Subp) = Name_Rotate_Left
242 or else Chars (Renamed_Subp) = Name_Rotate_Right
243 or else Chars (Renamed_Subp) = Name_Shift_Left
244 or else Chars (Renamed_Subp) = Name_Shift_Right
245 or else Chars (Renamed_Subp) = Name_Shift_Right_Arithmetic)
246 then
247 Set_Interface_Name (Ent, Interface_Name (Renamed_Subp));
249 if Present (Alias (Renamed_Subp)) then
250 Set_Alias (Ent, Alias (Renamed_Subp));
251 else
252 Set_Alias (Ent, Renamed_Subp);
253 end if;
255 Set_Is_Intrinsic_Subprogram (Ent);
256 Set_Has_Completion (Ent);
258 else
259 Body_Node := Build_Renamed_Body (Decl, New_S);
260 Insert_After (After, Body_Node);
261 Mark_Rewrite_Insertion (Body_Node);
262 Analyze (Body_Node);
263 After := Body_Node;
264 end if;
265 end Build_And_Analyze_Renamed_Body;
267 ------------------------
268 -- Build_Renamed_Body --
269 ------------------------
271 function Build_Renamed_Body
272 (Decl : Node_Id;
273 New_S : Entity_Id) return Node_Id
275 Loc : constant Source_Ptr := Sloc (New_S);
276 -- We use for the source location of the renamed body, the location of
277 -- the spec entity. It might seem more natural to use the location of
278 -- the renaming declaration itself, but that would be wrong, since then
279 -- the body we create would look as though it was created far too late,
280 -- and this could cause problems with elaboration order analysis,
281 -- particularly in connection with instantiations.
283 N : constant Node_Id := Unit_Declaration_Node (New_S);
284 Nam : constant Node_Id := Name (N);
285 Old_S : Entity_Id;
286 Spec : constant Node_Id := New_Copy_Tree (Specification (Decl));
287 Actuals : List_Id := No_List;
288 Call_Node : Node_Id;
289 Call_Name : Node_Id;
290 Body_Node : Node_Id;
291 Formal : Entity_Id;
292 O_Formal : Entity_Id;
293 Param_Spec : Node_Id;
295 Pref : Node_Id := Empty;
296 -- If the renamed entity is a primitive operation given in prefix form,
297 -- the prefix is the target object and it has to be added as the first
298 -- actual in the generated call.
300 begin
301 -- Determine the entity being renamed, which is the target of the call
302 -- statement. If the name is an explicit dereference, this is a renaming
303 -- of a subprogram type rather than a subprogram. The name itself is
304 -- fully analyzed.
306 if Nkind (Nam) = N_Selected_Component then
307 Old_S := Entity (Selector_Name (Nam));
309 elsif Nkind (Nam) = N_Explicit_Dereference then
310 Old_S := Etype (Nam);
312 elsif Nkind (Nam) = N_Indexed_Component then
313 if Is_Entity_Name (Prefix (Nam)) then
314 Old_S := Entity (Prefix (Nam));
315 else
316 Old_S := Entity (Selector_Name (Prefix (Nam)));
317 end if;
319 elsif Nkind (Nam) = N_Character_Literal then
320 Old_S := Etype (New_S);
322 else
323 Old_S := Entity (Nam);
324 end if;
326 if Is_Entity_Name (Nam) then
328 -- If the renamed entity is a predefined operator, retain full name
329 -- to ensure its visibility.
331 if Ekind (Old_S) = E_Operator
332 and then Nkind (Nam) = N_Expanded_Name
333 then
334 Call_Name := New_Copy (Name (N));
335 else
336 Call_Name := New_Reference_To (Old_S, Loc);
337 end if;
339 else
340 if Nkind (Nam) = N_Selected_Component
341 and then Present (First_Formal (Old_S))
342 and then
343 (Is_Controlling_Formal (First_Formal (Old_S))
344 or else Is_Class_Wide_Type (Etype (First_Formal (Old_S))))
345 then
347 -- Retrieve the target object, to be added as a first actual
348 -- in the call.
350 Call_Name := New_Occurrence_Of (Old_S, Loc);
351 Pref := Prefix (Nam);
353 else
354 Call_Name := New_Copy (Name (N));
355 end if;
357 -- Original name may have been overloaded, but is fully resolved now
359 Set_Is_Overloaded (Call_Name, False);
360 end if;
362 -- For simple renamings, subsequent calls can be expanded directly as
363 -- calls to the renamed entity. The body must be generated in any case
364 -- for calls that may appear elsewhere.
366 if Ekind_In (Old_S, E_Function, E_Procedure)
367 and then Nkind (Decl) = N_Subprogram_Declaration
368 then
369 Set_Body_To_Inline (Decl, Old_S);
370 end if;
372 -- The body generated for this renaming is an internal artifact, and
373 -- does not constitute a freeze point for the called entity.
375 Set_Must_Not_Freeze (Call_Name);
377 Formal := First_Formal (Defining_Entity (Decl));
379 if Present (Pref) then
380 declare
381 Pref_Type : constant Entity_Id := Etype (Pref);
382 Form_Type : constant Entity_Id := Etype (First_Formal (Old_S));
384 begin
385 -- The controlling formal may be an access parameter, or the
386 -- actual may be an access value, so adjust accordingly.
388 if Is_Access_Type (Pref_Type)
389 and then not Is_Access_Type (Form_Type)
390 then
391 Actuals := New_List
392 (Make_Explicit_Dereference (Loc, Relocate_Node (Pref)));
394 elsif Is_Access_Type (Form_Type)
395 and then not Is_Access_Type (Pref)
396 then
397 Actuals := New_List
398 (Make_Attribute_Reference (Loc,
399 Attribute_Name => Name_Access,
400 Prefix => Relocate_Node (Pref)));
401 else
402 Actuals := New_List (Pref);
403 end if;
404 end;
406 elsif Present (Formal) then
407 Actuals := New_List;
409 else
410 Actuals := No_List;
411 end if;
413 if Present (Formal) then
414 while Present (Formal) loop
415 Append (New_Reference_To (Formal, Loc), Actuals);
416 Next_Formal (Formal);
417 end loop;
418 end if;
420 -- If the renamed entity is an entry, inherit its profile. For other
421 -- renamings as bodies, both profiles must be subtype conformant, so it
422 -- is not necessary to replace the profile given in the declaration.
423 -- However, default values that are aggregates are rewritten when
424 -- partially analyzed, so we recover the original aggregate to insure
425 -- that subsequent conformity checking works. Similarly, if the default
426 -- expression was constant-folded, recover the original expression.
428 Formal := First_Formal (Defining_Entity (Decl));
430 if Present (Formal) then
431 O_Formal := First_Formal (Old_S);
432 Param_Spec := First (Parameter_Specifications (Spec));
433 while Present (Formal) loop
434 if Is_Entry (Old_S) then
435 if Nkind (Parameter_Type (Param_Spec)) /=
436 N_Access_Definition
437 then
438 Set_Etype (Formal, Etype (O_Formal));
439 Set_Entity (Parameter_Type (Param_Spec), Etype (O_Formal));
440 end if;
442 elsif Nkind (Default_Value (O_Formal)) = N_Aggregate
443 or else Nkind (Original_Node (Default_Value (O_Formal))) /=
444 Nkind (Default_Value (O_Formal))
445 then
446 Set_Expression (Param_Spec,
447 New_Copy_Tree (Original_Node (Default_Value (O_Formal))));
448 end if;
450 Next_Formal (Formal);
451 Next_Formal (O_Formal);
452 Next (Param_Spec);
453 end loop;
454 end if;
456 -- If the renamed entity is a function, the generated body contains a
457 -- return statement. Otherwise, build a procedure call. If the entity is
458 -- an entry, subsequent analysis of the call will transform it into the
459 -- proper entry or protected operation call. If the renamed entity is
460 -- a character literal, return it directly.
462 if Ekind (Old_S) = E_Function
463 or else Ekind (Old_S) = E_Operator
464 or else (Ekind (Old_S) = E_Subprogram_Type
465 and then Etype (Old_S) /= Standard_Void_Type)
466 then
467 Call_Node :=
468 Make_Simple_Return_Statement (Loc,
469 Expression =>
470 Make_Function_Call (Loc,
471 Name => Call_Name,
472 Parameter_Associations => Actuals));
474 elsif Ekind (Old_S) = E_Enumeration_Literal then
475 Call_Node :=
476 Make_Simple_Return_Statement (Loc,
477 Expression => New_Occurrence_Of (Old_S, Loc));
479 elsif Nkind (Nam) = N_Character_Literal then
480 Call_Node :=
481 Make_Simple_Return_Statement (Loc,
482 Expression => Call_Name);
484 else
485 Call_Node :=
486 Make_Procedure_Call_Statement (Loc,
487 Name => Call_Name,
488 Parameter_Associations => Actuals);
489 end if;
491 -- Create entities for subprogram body and formals
493 Set_Defining_Unit_Name (Spec,
494 Make_Defining_Identifier (Loc, Chars => Chars (New_S)));
496 Param_Spec := First (Parameter_Specifications (Spec));
497 while Present (Param_Spec) loop
498 Set_Defining_Identifier (Param_Spec,
499 Make_Defining_Identifier (Loc,
500 Chars => Chars (Defining_Identifier (Param_Spec))));
501 Next (Param_Spec);
502 end loop;
504 Body_Node :=
505 Make_Subprogram_Body (Loc,
506 Specification => Spec,
507 Declarations => New_List,
508 Handled_Statement_Sequence =>
509 Make_Handled_Sequence_Of_Statements (Loc,
510 Statements => New_List (Call_Node)));
512 if Nkind (Decl) /= N_Subprogram_Declaration then
513 Rewrite (N,
514 Make_Subprogram_Declaration (Loc,
515 Specification => Specification (N)));
516 end if;
518 -- Link the body to the entity whose declaration it completes. If
519 -- the body is analyzed when the renamed entity is frozen, it may
520 -- be necessary to restore the proper scope (see package Exp_Ch13).
522 if Nkind (N) = N_Subprogram_Renaming_Declaration
523 and then Present (Corresponding_Spec (N))
524 then
525 Set_Corresponding_Spec (Body_Node, Corresponding_Spec (N));
526 else
527 Set_Corresponding_Spec (Body_Node, New_S);
528 end if;
530 return Body_Node;
531 end Build_Renamed_Body;
533 --------------------------
534 -- Check_Address_Clause --
535 --------------------------
537 procedure Check_Address_Clause (E : Entity_Id) is
538 Addr : constant Node_Id := Address_Clause (E);
539 Expr : Node_Id;
540 Decl : constant Node_Id := Declaration_Node (E);
541 Typ : constant Entity_Id := Etype (E);
543 begin
544 if Present (Addr) then
545 Expr := Expression (Addr);
547 if Needs_Constant_Address (Decl, Typ) then
548 Check_Constant_Address_Clause (Expr, E);
550 -- Has_Delayed_Freeze was set on E when the address clause was
551 -- analyzed. Reset the flag now unless freeze actions were
552 -- attached to it in the mean time.
554 if No (Freeze_Node (E)) then
555 Set_Has_Delayed_Freeze (E, False);
556 end if;
557 end if;
559 -- If Rep_Clauses are to be ignored, remove address clause from
560 -- list attached to entity, because it may be illegal for gigi,
561 -- for example by breaking order of elaboration..
563 if Ignore_Rep_Clauses then
564 declare
565 Rep : Node_Id;
567 begin
568 Rep := First_Rep_Item (E);
570 if Rep = Addr then
571 Set_First_Rep_Item (E, Next_Rep_Item (Addr));
573 else
574 while Present (Rep)
575 and then Next_Rep_Item (Rep) /= Addr
576 loop
577 Rep := Next_Rep_Item (Rep);
578 end loop;
579 end if;
581 if Present (Rep) then
582 Set_Next_Rep_Item (Rep, Next_Rep_Item (Addr));
583 end if;
584 end;
586 Rewrite (Addr, Make_Null_Statement (Sloc (E)));
588 elsif not Error_Posted (Expr)
589 and then not Needs_Finalization (Typ)
590 then
591 Warn_Overlay (Expr, Typ, Name (Addr));
592 end if;
593 end if;
594 end Check_Address_Clause;
596 -----------------------------
597 -- Check_Compile_Time_Size --
598 -----------------------------
600 procedure Check_Compile_Time_Size (T : Entity_Id) is
602 procedure Set_Small_Size (T : Entity_Id; S : Uint);
603 -- Sets the compile time known size (32 bits or less) in the Esize
604 -- field, of T checking for a size clause that was given which attempts
605 -- to give a smaller size, and also checking for an alignment clause.
607 function Size_Known (T : Entity_Id) return Boolean;
608 -- Recursive function that does all the work
610 function Static_Discriminated_Components (T : Entity_Id) return Boolean;
611 -- If T is a constrained subtype, its size is not known if any of its
612 -- discriminant constraints is not static and it is not a null record.
613 -- The test is conservative and doesn't check that the components are
614 -- in fact constrained by non-static discriminant values. Could be made
615 -- more precise ???
617 --------------------
618 -- Set_Small_Size --
619 --------------------
621 procedure Set_Small_Size (T : Entity_Id; S : Uint) is
622 begin
623 if S > 32 then
624 return;
626 -- Don't bother if alignment clause with a value other than 1 is
627 -- present, because size may be padded up to meet back end alignment
628 -- requirements, and only the back end knows the rules!
630 elsif Known_Alignment (T) and then Alignment (T) /= 1 then
631 return;
633 -- Check for bad size clause given
635 elsif Has_Size_Clause (T) then
636 if RM_Size (T) < S then
637 Error_Msg_Uint_1 := S;
638 Error_Msg_NE
639 ("size for& too small, minimum allowed is ^",
640 Size_Clause (T), T);
642 elsif Unknown_Esize (T) then
643 Set_Esize (T, S);
644 end if;
646 -- Set sizes if not set already
648 else
649 if Unknown_Esize (T) then
650 Set_Esize (T, S);
651 end if;
653 if Unknown_RM_Size (T) then
654 Set_RM_Size (T, S);
655 end if;
656 end if;
657 end Set_Small_Size;
659 ----------------
660 -- Size_Known --
661 ----------------
663 function Size_Known (T : Entity_Id) return Boolean is
664 Index : Entity_Id;
665 Comp : Entity_Id;
666 Ctyp : Entity_Id;
667 Low : Node_Id;
668 High : Node_Id;
670 begin
671 if Size_Known_At_Compile_Time (T) then
672 return True;
674 -- Always True for scalar types. This is true even for generic formal
675 -- scalar types. We used to return False in the latter case, but the
676 -- size is known at compile time, even in the template, we just do
677 -- not know the exact size but that's not the point of this routine.
679 elsif Is_Scalar_Type (T)
680 or else Is_Task_Type (T)
681 then
682 return True;
684 -- Array types
686 elsif Is_Array_Type (T) then
688 -- String literals always have known size, and we can set it
690 if Ekind (T) = E_String_Literal_Subtype then
691 Set_Small_Size (T, Component_Size (T)
692 * String_Literal_Length (T));
693 return True;
695 -- Unconstrained types never have known at compile time size
697 elsif not Is_Constrained (T) then
698 return False;
700 -- Don't do any recursion on type with error posted, since we may
701 -- have a malformed type that leads us into a loop.
703 elsif Error_Posted (T) then
704 return False;
706 -- Otherwise if component size unknown, then array size unknown
708 elsif not Size_Known (Component_Type (T)) then
709 return False;
710 end if;
712 -- Check for all indexes static, and also compute possible size
713 -- (in case it is less than 32 and may be packable).
715 declare
716 Esiz : Uint := Component_Size (T);
717 Dim : Uint;
719 begin
720 Index := First_Index (T);
721 while Present (Index) loop
722 if Nkind (Index) = N_Range then
723 Get_Index_Bounds (Index, Low, High);
725 elsif Error_Posted (Scalar_Range (Etype (Index))) then
726 return False;
728 else
729 Low := Type_Low_Bound (Etype (Index));
730 High := Type_High_Bound (Etype (Index));
731 end if;
733 if not Compile_Time_Known_Value (Low)
734 or else not Compile_Time_Known_Value (High)
735 or else Etype (Index) = Any_Type
736 then
737 return False;
739 else
740 Dim := Expr_Value (High) - Expr_Value (Low) + 1;
742 if Dim >= 0 then
743 Esiz := Esiz * Dim;
744 else
745 Esiz := Uint_0;
746 end if;
747 end if;
749 Next_Index (Index);
750 end loop;
752 Set_Small_Size (T, Esiz);
753 return True;
754 end;
756 -- Access types always have known at compile time sizes
758 elsif Is_Access_Type (T) then
759 return True;
761 -- For non-generic private types, go to underlying type if present
763 elsif Is_Private_Type (T)
764 and then not Is_Generic_Type (T)
765 and then Present (Underlying_Type (T))
766 then
767 -- Don't do any recursion on type with error posted, since we may
768 -- have a malformed type that leads us into a loop.
770 if Error_Posted (T) then
771 return False;
772 else
773 return Size_Known (Underlying_Type (T));
774 end if;
776 -- Record types
778 elsif Is_Record_Type (T) then
780 -- A class-wide type is never considered to have a known size
782 if Is_Class_Wide_Type (T) then
783 return False;
785 -- A subtype of a variant record must not have non-static
786 -- discriminanted components.
788 elsif T /= Base_Type (T)
789 and then not Static_Discriminated_Components (T)
790 then
791 return False;
793 -- Don't do any recursion on type with error posted, since we may
794 -- have a malformed type that leads us into a loop.
796 elsif Error_Posted (T) then
797 return False;
798 end if;
800 -- Now look at the components of the record
802 declare
803 -- The following two variables are used to keep track of the
804 -- size of packed records if we can tell the size of the packed
805 -- record in the front end. Packed_Size_Known is True if so far
806 -- we can figure out the size. It is initialized to True for a
807 -- packed record, unless the record has discriminants. The
808 -- reason we eliminate the discriminated case is that we don't
809 -- know the way the back end lays out discriminated packed
810 -- records. If Packed_Size_Known is True, then Packed_Size is
811 -- the size in bits so far.
813 Packed_Size_Known : Boolean :=
814 Is_Packed (T)
815 and then not Has_Discriminants (T);
817 Packed_Size : Uint := Uint_0;
819 begin
820 -- Test for variant part present
822 if Has_Discriminants (T)
823 and then Present (Parent (T))
824 and then Nkind (Parent (T)) = N_Full_Type_Declaration
825 and then Nkind (Type_Definition (Parent (T))) =
826 N_Record_Definition
827 and then not Null_Present (Type_Definition (Parent (T)))
828 and then Present (Variant_Part
829 (Component_List (Type_Definition (Parent (T)))))
830 then
831 -- If variant part is present, and type is unconstrained,
832 -- then we must have defaulted discriminants, or a size
833 -- clause must be present for the type, or else the size
834 -- is definitely not known at compile time.
836 if not Is_Constrained (T)
837 and then
838 No (Discriminant_Default_Value (First_Discriminant (T)))
839 and then Unknown_Esize (T)
840 then
841 return False;
842 end if;
843 end if;
845 -- Loop through components
847 Comp := First_Component_Or_Discriminant (T);
848 while Present (Comp) loop
849 Ctyp := Etype (Comp);
851 -- We do not know the packed size if there is a component
852 -- clause present (we possibly could, but this would only
853 -- help in the case of a record with partial rep clauses.
854 -- That's because in the case of full rep clauses, the
855 -- size gets figured out anyway by a different circuit).
857 if Present (Component_Clause (Comp)) then
858 Packed_Size_Known := False;
859 end if;
861 -- We need to identify a component that is an array where
862 -- the index type is an enumeration type with non-standard
863 -- representation, and some bound of the type depends on a
864 -- discriminant.
866 -- This is because gigi computes the size by doing a
867 -- substitution of the appropriate discriminant value in
868 -- the size expression for the base type, and gigi is not
869 -- clever enough to evaluate the resulting expression (which
870 -- involves a call to rep_to_pos) at compile time.
872 -- It would be nice if gigi would either recognize that
873 -- this expression can be computed at compile time, or
874 -- alternatively figured out the size from the subtype
875 -- directly, where all the information is at hand ???
877 if Is_Array_Type (Etype (Comp))
878 and then Present (Packed_Array_Type (Etype (Comp)))
879 then
880 declare
881 Ocomp : constant Entity_Id :=
882 Original_Record_Component (Comp);
883 OCtyp : constant Entity_Id := Etype (Ocomp);
884 Ind : Node_Id;
885 Indtyp : Entity_Id;
886 Lo, Hi : Node_Id;
888 begin
889 Ind := First_Index (OCtyp);
890 while Present (Ind) loop
891 Indtyp := Etype (Ind);
893 if Is_Enumeration_Type (Indtyp)
894 and then Has_Non_Standard_Rep (Indtyp)
895 then
896 Lo := Type_Low_Bound (Indtyp);
897 Hi := Type_High_Bound (Indtyp);
899 if Is_Entity_Name (Lo)
900 and then Ekind (Entity (Lo)) = E_Discriminant
901 then
902 return False;
904 elsif Is_Entity_Name (Hi)
905 and then Ekind (Entity (Hi)) = E_Discriminant
906 then
907 return False;
908 end if;
909 end if;
911 Next_Index (Ind);
912 end loop;
913 end;
914 end if;
916 -- Clearly size of record is not known if the size of one of
917 -- the components is not known.
919 if not Size_Known (Ctyp) then
920 return False;
921 end if;
923 -- Accumulate packed size if possible
925 if Packed_Size_Known then
927 -- We can only deal with elementary types, since for
928 -- non-elementary components, alignment enters into the
929 -- picture, and we don't know enough to handle proper
930 -- alignment in this context. Packed arrays count as
931 -- elementary if the representation is a modular type.
933 if Is_Elementary_Type (Ctyp)
934 or else (Is_Array_Type (Ctyp)
935 and then Present (Packed_Array_Type (Ctyp))
936 and then Is_Modular_Integer_Type
937 (Packed_Array_Type (Ctyp)))
938 then
939 -- If RM_Size is known and static, then we can keep
940 -- accumulating the packed size.
942 if Known_Static_RM_Size (Ctyp) then
944 -- A little glitch, to be removed sometime ???
945 -- gigi does not understand zero sizes yet.
947 if RM_Size (Ctyp) = Uint_0 then
948 Packed_Size_Known := False;
950 -- Normal case where we can keep accumulating the
951 -- packed array size.
953 else
954 Packed_Size := Packed_Size + RM_Size (Ctyp);
955 end if;
957 -- If we have a field whose RM_Size is not known then
958 -- we can't figure out the packed size here.
960 else
961 Packed_Size_Known := False;
962 end if;
964 -- If we have a non-elementary type we can't figure out
965 -- the packed array size (alignment issues).
967 else
968 Packed_Size_Known := False;
969 end if;
970 end if;
972 Next_Component_Or_Discriminant (Comp);
973 end loop;
975 if Packed_Size_Known then
976 Set_Small_Size (T, Packed_Size);
977 end if;
979 return True;
980 end;
982 -- All other cases, size not known at compile time
984 else
985 return False;
986 end if;
987 end Size_Known;
989 -------------------------------------
990 -- Static_Discriminated_Components --
991 -------------------------------------
993 function Static_Discriminated_Components
994 (T : Entity_Id) return Boolean
996 Constraint : Elmt_Id;
998 begin
999 if Has_Discriminants (T)
1000 and then Present (Discriminant_Constraint (T))
1001 and then Present (First_Component (T))
1002 then
1003 Constraint := First_Elmt (Discriminant_Constraint (T));
1004 while Present (Constraint) loop
1005 if not Compile_Time_Known_Value (Node (Constraint)) then
1006 return False;
1007 end if;
1009 Next_Elmt (Constraint);
1010 end loop;
1011 end if;
1013 return True;
1014 end Static_Discriminated_Components;
1016 -- Start of processing for Check_Compile_Time_Size
1018 begin
1019 Set_Size_Known_At_Compile_Time (T, Size_Known (T));
1020 end Check_Compile_Time_Size;
1022 -----------------------------
1023 -- Check_Debug_Info_Needed --
1024 -----------------------------
1026 procedure Check_Debug_Info_Needed (T : Entity_Id) is
1027 begin
1028 if Debug_Info_Off (T) then
1029 return;
1031 elsif Comes_From_Source (T)
1032 or else Debug_Generated_Code
1033 or else Debug_Flag_VV
1034 or else Needs_Debug_Info (T)
1035 then
1036 Set_Debug_Info_Needed (T);
1037 end if;
1038 end Check_Debug_Info_Needed;
1040 ----------------------------
1041 -- Check_Strict_Alignment --
1042 ----------------------------
1044 procedure Check_Strict_Alignment (E : Entity_Id) is
1045 Comp : Entity_Id;
1047 begin
1048 if Is_Tagged_Type (E) or else Is_Concurrent_Type (E) then
1049 Set_Strict_Alignment (E);
1051 elsif Is_Array_Type (E) then
1052 Set_Strict_Alignment (E, Strict_Alignment (Component_Type (E)));
1054 elsif Is_Record_Type (E) then
1055 if Is_Limited_Record (E) then
1056 Set_Strict_Alignment (E);
1057 return;
1058 end if;
1060 Comp := First_Component (E);
1062 while Present (Comp) loop
1063 if not Is_Type (Comp)
1064 and then (Strict_Alignment (Etype (Comp))
1065 or else Is_Aliased (Comp))
1066 then
1067 Set_Strict_Alignment (E);
1068 return;
1069 end if;
1071 Next_Component (Comp);
1072 end loop;
1073 end if;
1074 end Check_Strict_Alignment;
1076 -------------------------
1077 -- Check_Unsigned_Type --
1078 -------------------------
1080 procedure Check_Unsigned_Type (E : Entity_Id) is
1081 Ancestor : Entity_Id;
1082 Lo_Bound : Node_Id;
1083 Btyp : Entity_Id;
1085 begin
1086 if not Is_Discrete_Or_Fixed_Point_Type (E) then
1087 return;
1088 end if;
1090 -- Do not attempt to analyze case where range was in error
1092 if Error_Posted (Scalar_Range (E)) then
1093 return;
1094 end if;
1096 -- The situation that is non trivial is something like
1098 -- subtype x1 is integer range -10 .. +10;
1099 -- subtype x2 is x1 range 0 .. V1;
1100 -- subtype x3 is x2 range V2 .. V3;
1101 -- subtype x4 is x3 range V4 .. V5;
1103 -- where Vn are variables. Here the base type is signed, but we still
1104 -- know that x4 is unsigned because of the lower bound of x2.
1106 -- The only way to deal with this is to look up the ancestor chain
1108 Ancestor := E;
1109 loop
1110 if Ancestor = Any_Type or else Etype (Ancestor) = Any_Type then
1111 return;
1112 end if;
1114 Lo_Bound := Type_Low_Bound (Ancestor);
1116 if Compile_Time_Known_Value (Lo_Bound) then
1118 if Expr_Rep_Value (Lo_Bound) >= 0 then
1119 Set_Is_Unsigned_Type (E, True);
1120 end if;
1122 return;
1124 else
1125 Ancestor := Ancestor_Subtype (Ancestor);
1127 -- If no ancestor had a static lower bound, go to base type
1129 if No (Ancestor) then
1131 -- Note: the reason we still check for a compile time known
1132 -- value for the base type is that at least in the case of
1133 -- generic formals, we can have bounds that fail this test,
1134 -- and there may be other cases in error situations.
1136 Btyp := Base_Type (E);
1138 if Btyp = Any_Type or else Etype (Btyp) = Any_Type then
1139 return;
1140 end if;
1142 Lo_Bound := Type_Low_Bound (Base_Type (E));
1144 if Compile_Time_Known_Value (Lo_Bound)
1145 and then Expr_Rep_Value (Lo_Bound) >= 0
1146 then
1147 Set_Is_Unsigned_Type (E, True);
1148 end if;
1150 return;
1151 end if;
1152 end if;
1153 end loop;
1154 end Check_Unsigned_Type;
1156 -------------------------
1157 -- Is_Atomic_Aggregate --
1158 -------------------------
1160 function Is_Atomic_Aggregate
1161 (E : Entity_Id;
1162 Typ : Entity_Id) return Boolean
1164 Loc : constant Source_Ptr := Sloc (E);
1165 New_N : Node_Id;
1166 Par : Node_Id;
1167 Temp : Entity_Id;
1169 begin
1170 Par := Parent (E);
1172 -- Array may be qualified, so find outer context
1174 if Nkind (Par) = N_Qualified_Expression then
1175 Par := Parent (Par);
1176 end if;
1178 if Nkind_In (Par, N_Object_Declaration, N_Assignment_Statement)
1179 and then Comes_From_Source (Par)
1180 then
1181 Temp := Make_Temporary (Loc, 'T', E);
1182 New_N :=
1183 Make_Object_Declaration (Loc,
1184 Defining_Identifier => Temp,
1185 Object_Definition => New_Occurrence_Of (Typ, Loc),
1186 Expression => Relocate_Node (E));
1187 Insert_Before (Par, New_N);
1188 Analyze (New_N);
1190 Set_Expression (Par, New_Occurrence_Of (Temp, Loc));
1191 return True;
1193 else
1194 return False;
1195 end if;
1196 end Is_Atomic_Aggregate;
1198 ----------------
1199 -- Freeze_All --
1200 ----------------
1202 -- Note: the easy coding for this procedure would be to just build a
1203 -- single list of freeze nodes and then insert them and analyze them
1204 -- all at once. This won't work, because the analysis of earlier freeze
1205 -- nodes may recursively freeze types which would otherwise appear later
1206 -- on in the freeze list. So we must analyze and expand the freeze nodes
1207 -- as they are generated.
1209 procedure Freeze_All (From : Entity_Id; After : in out Node_Id) is
1210 Loc : constant Source_Ptr := Sloc (After);
1211 E : Entity_Id;
1212 Decl : Node_Id;
1214 procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id);
1215 -- This is the internal recursive routine that does freezing of entities
1216 -- (but NOT the analysis of default expressions, which should not be
1217 -- recursive, we don't want to analyze those till we are sure that ALL
1218 -- the types are frozen).
1220 --------------------
1221 -- Freeze_All_Ent --
1222 --------------------
1224 procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id) is
1225 E : Entity_Id;
1226 Flist : List_Id;
1227 Lastn : Node_Id;
1229 procedure Process_Flist;
1230 -- If freeze nodes are present, insert and analyze, and reset cursor
1231 -- for next insertion.
1233 -------------------
1234 -- Process_Flist --
1235 -------------------
1237 procedure Process_Flist is
1238 begin
1239 if Is_Non_Empty_List (Flist) then
1240 Lastn := Next (After);
1241 Insert_List_After_And_Analyze (After, Flist);
1243 if Present (Lastn) then
1244 After := Prev (Lastn);
1245 else
1246 After := Last (List_Containing (After));
1247 end if;
1248 end if;
1249 end Process_Flist;
1251 -- Start or processing for Freeze_All_Ent
1253 begin
1254 E := From;
1255 while Present (E) loop
1257 -- If the entity is an inner package which is not a package
1258 -- renaming, then its entities must be frozen at this point. Note
1259 -- that such entities do NOT get frozen at the end of the nested
1260 -- package itself (only library packages freeze).
1262 -- Same is true for task declarations, where anonymous records
1263 -- created for entry parameters must be frozen.
1265 if Ekind (E) = E_Package
1266 and then No (Renamed_Object (E))
1267 and then not Is_Child_Unit (E)
1268 and then not Is_Frozen (E)
1269 then
1270 Push_Scope (E);
1271 Install_Visible_Declarations (E);
1272 Install_Private_Declarations (E);
1274 Freeze_All (First_Entity (E), After);
1276 End_Package_Scope (E);
1278 elsif Ekind (E) in Task_Kind
1279 and then
1280 (Nkind (Parent (E)) = N_Task_Type_Declaration
1281 or else
1282 Nkind (Parent (E)) = N_Single_Task_Declaration)
1283 then
1284 Push_Scope (E);
1285 Freeze_All (First_Entity (E), After);
1286 End_Scope;
1288 -- For a derived tagged type, we must ensure that all the
1289 -- primitive operations of the parent have been frozen, so that
1290 -- their addresses will be in the parent's dispatch table at the
1291 -- point it is inherited.
1293 elsif Ekind (E) = E_Record_Type
1294 and then Is_Tagged_Type (E)
1295 and then Is_Tagged_Type (Etype (E))
1296 and then Is_Derived_Type (E)
1297 then
1298 declare
1299 Prim_List : constant Elist_Id :=
1300 Primitive_Operations (Etype (E));
1302 Prim : Elmt_Id;
1303 Subp : Entity_Id;
1305 begin
1306 Prim := First_Elmt (Prim_List);
1307 while Present (Prim) loop
1308 Subp := Node (Prim);
1310 if Comes_From_Source (Subp)
1311 and then not Is_Frozen (Subp)
1312 then
1313 Flist := Freeze_Entity (Subp, Loc);
1314 Process_Flist;
1315 end if;
1317 Next_Elmt (Prim);
1318 end loop;
1319 end;
1320 end if;
1322 if not Is_Frozen (E) then
1323 Flist := Freeze_Entity (E, Loc);
1324 Process_Flist;
1325 end if;
1327 -- If an incomplete type is still not frozen, this may be a
1328 -- premature freezing because of a body declaration that follows.
1329 -- Indicate where the freezing took place.
1331 -- If the freezing is caused by the end of the current declarative
1332 -- part, it is a Taft Amendment type, and there is no error.
1334 if not Is_Frozen (E)
1335 and then Ekind (E) = E_Incomplete_Type
1336 then
1337 declare
1338 Bod : constant Node_Id := Next (After);
1340 begin
1341 if (Nkind_In (Bod, N_Subprogram_Body,
1342 N_Entry_Body,
1343 N_Package_Body,
1344 N_Protected_Body,
1345 N_Task_Body)
1346 or else Nkind (Bod) in N_Body_Stub)
1347 and then
1348 List_Containing (After) = List_Containing (Parent (E))
1349 then
1350 Error_Msg_Sloc := Sloc (Next (After));
1351 Error_Msg_NE
1352 ("type& is frozen# before its full declaration",
1353 Parent (E), E);
1354 end if;
1355 end;
1356 end if;
1358 Next_Entity (E);
1359 end loop;
1360 end Freeze_All_Ent;
1362 -- Start of processing for Freeze_All
1364 begin
1365 Freeze_All_Ent (From, After);
1367 -- Now that all types are frozen, we can deal with default expressions
1368 -- that require us to build a default expression functions. This is the
1369 -- point at which such functions are constructed (after all types that
1370 -- might be used in such expressions have been frozen).
1372 -- For subprograms that are renaming_as_body, we create the wrapper
1373 -- bodies as needed.
1375 -- We also add finalization chains to access types whose designated
1376 -- types are controlled. This is normally done when freezing the type,
1377 -- but this misses recursive type definitions where the later members
1378 -- of the recursion introduce controlled components.
1380 -- Loop through entities
1382 E := From;
1383 while Present (E) loop
1384 if Is_Subprogram (E) then
1386 if not Default_Expressions_Processed (E) then
1387 Process_Default_Expressions (E, After);
1388 end if;
1390 if not Has_Completion (E) then
1391 Decl := Unit_Declaration_Node (E);
1393 if Nkind (Decl) = N_Subprogram_Renaming_Declaration then
1394 Build_And_Analyze_Renamed_Body (Decl, E, After);
1396 elsif Nkind (Decl) = N_Subprogram_Declaration
1397 and then Present (Corresponding_Body (Decl))
1398 and then
1399 Nkind (Unit_Declaration_Node (Corresponding_Body (Decl)))
1400 = N_Subprogram_Renaming_Declaration
1401 then
1402 Build_And_Analyze_Renamed_Body
1403 (Decl, Corresponding_Body (Decl), After);
1404 end if;
1405 end if;
1407 elsif Ekind (E) in Task_Kind
1408 and then
1409 (Nkind (Parent (E)) = N_Task_Type_Declaration
1410 or else
1411 Nkind (Parent (E)) = N_Single_Task_Declaration)
1412 then
1413 declare
1414 Ent : Entity_Id;
1416 begin
1417 Ent := First_Entity (E);
1418 while Present (Ent) loop
1419 if Is_Entry (Ent)
1420 and then not Default_Expressions_Processed (Ent)
1421 then
1422 Process_Default_Expressions (Ent, After);
1423 end if;
1425 Next_Entity (Ent);
1426 end loop;
1427 end;
1429 elsif Is_Access_Type (E)
1430 and then Comes_From_Source (E)
1431 and then Ekind (Directly_Designated_Type (E)) = E_Incomplete_Type
1432 and then Needs_Finalization (Designated_Type (E))
1433 and then No (Associated_Final_Chain (E))
1434 then
1435 Build_Final_List (Parent (E), E);
1436 end if;
1438 Next_Entity (E);
1439 end loop;
1440 end Freeze_All;
1442 -----------------------
1443 -- Freeze_And_Append --
1444 -----------------------
1446 procedure Freeze_And_Append
1447 (Ent : Entity_Id;
1448 Loc : Source_Ptr;
1449 Result : in out List_Id)
1451 L : constant List_Id := Freeze_Entity (Ent, Loc);
1452 begin
1453 if Is_Non_Empty_List (L) then
1454 if Result = No_List then
1455 Result := L;
1456 else
1457 Append_List (L, Result);
1458 end if;
1459 end if;
1460 end Freeze_And_Append;
1462 -------------------
1463 -- Freeze_Before --
1464 -------------------
1466 procedure Freeze_Before (N : Node_Id; T : Entity_Id) is
1467 Freeze_Nodes : constant List_Id := Freeze_Entity (T, Sloc (N));
1468 begin
1469 if Is_Non_Empty_List (Freeze_Nodes) then
1470 Insert_Actions (N, Freeze_Nodes);
1471 end if;
1472 end Freeze_Before;
1474 -------------------
1475 -- Freeze_Entity --
1476 -------------------
1478 function Freeze_Entity (E : Entity_Id; Loc : Source_Ptr) return List_Id is
1479 Test_E : Entity_Id := E;
1480 Comp : Entity_Id;
1481 F_Node : Node_Id;
1482 Result : List_Id;
1483 Indx : Node_Id;
1484 Formal : Entity_Id;
1485 Atype : Entity_Id;
1487 Has_Default_Initialization : Boolean := False;
1488 -- This flag gets set to true for a variable with default initialization
1490 procedure Check_Current_Instance (Comp_Decl : Node_Id);
1491 -- Check that an Access or Unchecked_Access attribute with a prefix
1492 -- which is the current instance type can only be applied when the type
1493 -- is limited.
1495 procedure Check_Suspicious_Modulus (Utype : Entity_Id);
1496 -- Give warning for modulus of 8, 16, 32, or 64 given as an explicit
1497 -- integer literal without an explicit corresponding size clause. The
1498 -- caller has checked that Utype is a modular integer type.
1500 function After_Last_Declaration return Boolean;
1501 -- If Loc is a freeze_entity that appears after the last declaration
1502 -- in the scope, inhibit error messages on late completion.
1504 procedure Freeze_Record_Type (Rec : Entity_Id);
1505 -- Freeze each component, handle some representation clauses, and freeze
1506 -- primitive operations if this is a tagged type.
1508 ----------------------------
1509 -- After_Last_Declaration --
1510 ----------------------------
1512 function After_Last_Declaration return Boolean is
1513 Spec : constant Node_Id := Parent (Current_Scope);
1514 begin
1515 if Nkind (Spec) = N_Package_Specification then
1516 if Present (Private_Declarations (Spec)) then
1517 return Loc >= Sloc (Last (Private_Declarations (Spec)));
1518 elsif Present (Visible_Declarations (Spec)) then
1519 return Loc >= Sloc (Last (Visible_Declarations (Spec)));
1520 else
1521 return False;
1522 end if;
1523 else
1524 return False;
1525 end if;
1526 end After_Last_Declaration;
1528 ----------------------------
1529 -- Check_Current_Instance --
1530 ----------------------------
1532 procedure Check_Current_Instance (Comp_Decl : Node_Id) is
1534 Rec_Type : constant Entity_Id :=
1535 Scope (Defining_Identifier (Comp_Decl));
1537 Decl : constant Node_Id := Parent (Rec_Type);
1539 function Process (N : Node_Id) return Traverse_Result;
1540 -- Process routine to apply check to given node
1542 -------------
1543 -- Process --
1544 -------------
1546 function Process (N : Node_Id) return Traverse_Result is
1547 begin
1548 case Nkind (N) is
1549 when N_Attribute_Reference =>
1550 if (Attribute_Name (N) = Name_Access
1551 or else
1552 Attribute_Name (N) = Name_Unchecked_Access)
1553 and then Is_Entity_Name (Prefix (N))
1554 and then Is_Type (Entity (Prefix (N)))
1555 and then Entity (Prefix (N)) = E
1556 then
1557 Error_Msg_N
1558 ("current instance must be a limited type", Prefix (N));
1559 return Abandon;
1560 else
1561 return OK;
1562 end if;
1564 when others => return OK;
1565 end case;
1566 end Process;
1568 procedure Traverse is new Traverse_Proc (Process);
1570 -- Start of processing for Check_Current_Instance
1572 begin
1573 -- In Ada95, the (imprecise) rule is that the current instance of a
1574 -- limited type is aliased. In Ada2005, limitedness must be explicit:
1575 -- either a tagged type, or a limited record.
1577 if Is_Limited_Type (Rec_Type)
1578 and then (Ada_Version < Ada_05 or else Is_Tagged_Type (Rec_Type))
1579 then
1580 return;
1582 elsif Nkind (Decl) = N_Full_Type_Declaration
1583 and then Limited_Present (Type_Definition (Decl))
1584 then
1585 return;
1587 else
1588 Traverse (Comp_Decl);
1589 end if;
1590 end Check_Current_Instance;
1592 ------------------------------
1593 -- Check_Suspicious_Modulus --
1594 ------------------------------
1596 procedure Check_Suspicious_Modulus (Utype : Entity_Id) is
1597 Decl : constant Node_Id := Declaration_Node (Underlying_Type (Utype));
1599 begin
1600 if Nkind (Decl) = N_Full_Type_Declaration then
1601 declare
1602 Tdef : constant Node_Id := Type_Definition (Decl);
1603 begin
1604 if Nkind (Tdef) = N_Modular_Type_Definition then
1605 declare
1606 Modulus : constant Node_Id :=
1607 Original_Node (Expression (Tdef));
1608 begin
1609 if Nkind (Modulus) = N_Integer_Literal then
1610 declare
1611 Modv : constant Uint := Intval (Modulus);
1612 Sizv : constant Uint := RM_Size (Utype);
1614 begin
1615 -- First case, modulus and size are the same. This
1616 -- happens if you have something like mod 32, with
1617 -- an explicit size of 32, this is for sure a case
1618 -- where the warning is given, since it is seems
1619 -- very unlikely that someone would want e.g. a
1620 -- five bit type stored in 32 bits. It is much
1621 -- more likely they wanted a 32-bit type.
1623 if Modv = Sizv then
1624 null;
1626 -- Second case, the modulus is 32 or 64 and no
1627 -- size clause is present. This is a less clear
1628 -- case for giving the warning, but in the case
1629 -- of 32/64 (5-bit or 6-bit types) these seem rare
1630 -- enough that it is a likely error (and in any
1631 -- case using 2**5 or 2**6 in these cases seems
1632 -- clearer. We don't include 8 or 16 here, simply
1633 -- because in practice 3-bit and 4-bit types are
1634 -- more common and too many false positives if
1635 -- we warn in these cases.
1637 elsif not Has_Size_Clause (Utype)
1638 and then (Modv = Uint_32 or else Modv = Uint_64)
1639 then
1640 null;
1642 -- No warning needed
1644 else
1645 return;
1646 end if;
1648 -- If we fall through, give warning
1650 Error_Msg_Uint_1 := Modv;
1651 Error_Msg_N
1652 ("?2 '*'*^' may have been intended here",
1653 Modulus);
1654 end;
1655 end if;
1656 end;
1657 end if;
1658 end;
1659 end if;
1660 end Check_Suspicious_Modulus;
1662 ------------------------
1663 -- Freeze_Record_Type --
1664 ------------------------
1666 procedure Freeze_Record_Type (Rec : Entity_Id) is
1667 Comp : Entity_Id;
1668 IR : Node_Id;
1669 ADC : Node_Id;
1670 Prev : Entity_Id;
1672 Junk : Boolean;
1673 pragma Warnings (Off, Junk);
1675 Unplaced_Component : Boolean := False;
1676 -- Set True if we find at least one component with no component
1677 -- clause (used to warn about useless Pack pragmas).
1679 Placed_Component : Boolean := False;
1680 -- Set True if we find at least one component with a component
1681 -- clause (used to warn about useless Bit_Order pragmas, and also
1682 -- to detect cases where Implicit_Packing may have an effect).
1684 All_Scalar_Components : Boolean := True;
1685 -- Set False if we encounter a component of a non-scalar type
1687 Scalar_Component_Total_RM_Size : Uint := Uint_0;
1688 Scalar_Component_Total_Esize : Uint := Uint_0;
1689 -- Accumulates total RM_Size values and total Esize values of all
1690 -- scalar components. Used for processing of Implicit_Packing.
1692 function Check_Allocator (N : Node_Id) return Node_Id;
1693 -- If N is an allocator, possibly wrapped in one or more level of
1694 -- qualified expression(s), return the inner allocator node, else
1695 -- return Empty.
1697 procedure Check_Itype (Typ : Entity_Id);
1698 -- If the component subtype is an access to a constrained subtype of
1699 -- an already frozen type, make the subtype frozen as well. It might
1700 -- otherwise be frozen in the wrong scope, and a freeze node on
1701 -- subtype has no effect. Similarly, if the component subtype is a
1702 -- regular (not protected) access to subprogram, set the anonymous
1703 -- subprogram type to frozen as well, to prevent an out-of-scope
1704 -- freeze node at some eventual point of call. Protected operations
1705 -- are handled elsewhere.
1707 ---------------------
1708 -- Check_Allocator --
1709 ---------------------
1711 function Check_Allocator (N : Node_Id) return Node_Id is
1712 Inner : Node_Id;
1713 begin
1714 Inner := N;
1715 loop
1716 if Nkind (Inner) = N_Allocator then
1717 return Inner;
1718 elsif Nkind (Inner) = N_Qualified_Expression then
1719 Inner := Expression (Inner);
1720 else
1721 return Empty;
1722 end if;
1723 end loop;
1724 end Check_Allocator;
1726 -----------------
1727 -- Check_Itype --
1728 -----------------
1730 procedure Check_Itype (Typ : Entity_Id) is
1731 Desig : constant Entity_Id := Designated_Type (Typ);
1733 begin
1734 if not Is_Frozen (Desig)
1735 and then Is_Frozen (Base_Type (Desig))
1736 then
1737 Set_Is_Frozen (Desig);
1739 -- In addition, add an Itype_Reference to ensure that the
1740 -- access subtype is elaborated early enough. This cannot be
1741 -- done if the subtype may depend on discriminants.
1743 if Ekind (Comp) = E_Component
1744 and then Is_Itype (Etype (Comp))
1745 and then not Has_Discriminants (Rec)
1746 then
1747 IR := Make_Itype_Reference (Sloc (Comp));
1748 Set_Itype (IR, Desig);
1750 if No (Result) then
1751 Result := New_List (IR);
1752 else
1753 Append (IR, Result);
1754 end if;
1755 end if;
1757 elsif Ekind (Typ) = E_Anonymous_Access_Subprogram_Type
1758 and then Convention (Desig) /= Convention_Protected
1759 then
1760 Set_Is_Frozen (Desig);
1761 end if;
1762 end Check_Itype;
1764 -- Start of processing for Freeze_Record_Type
1766 begin
1767 -- If this is a subtype of a controlled type, declared without a
1768 -- constraint, the _controller may not appear in the component list
1769 -- if the parent was not frozen at the point of subtype declaration.
1770 -- Inherit the _controller component now.
1772 if Rec /= Base_Type (Rec)
1773 and then Has_Controlled_Component (Rec)
1774 then
1775 if Nkind (Parent (Rec)) = N_Subtype_Declaration
1776 and then Is_Entity_Name (Subtype_Indication (Parent (Rec)))
1777 then
1778 Set_First_Entity (Rec, First_Entity (Base_Type (Rec)));
1780 -- If this is an internal type without a declaration, as for
1781 -- record component, the base type may not yet be frozen, and its
1782 -- controller has not been created. Add an explicit freeze node
1783 -- for the itype, so it will be frozen after the base type. This
1784 -- freeze node is used to communicate with the expander, in order
1785 -- to create the controller for the enclosing record, and it is
1786 -- deleted afterwards (see exp_ch3). It must not be created when
1787 -- expansion is off, because it might appear in the wrong context
1788 -- for the back end.
1790 elsif Is_Itype (Rec)
1791 and then Has_Delayed_Freeze (Base_Type (Rec))
1792 and then
1793 Nkind (Associated_Node_For_Itype (Rec)) =
1794 N_Component_Declaration
1795 and then Expander_Active
1796 then
1797 Ensure_Freeze_Node (Rec);
1798 end if;
1799 end if;
1801 -- Freeze components and embedded subtypes
1803 Comp := First_Entity (Rec);
1804 Prev := Empty;
1805 while Present (Comp) loop
1807 -- First handle the component case
1809 if Ekind (Comp) = E_Component
1810 or else Ekind (Comp) = E_Discriminant
1811 then
1812 declare
1813 CC : constant Node_Id := Component_Clause (Comp);
1815 begin
1816 -- Freezing a record type freezes the type of each of its
1817 -- components. However, if the type of the component is
1818 -- part of this record, we do not want or need a separate
1819 -- Freeze_Node. Note that Is_Itype is wrong because that's
1820 -- also set in private type cases. We also can't check for
1821 -- the Scope being exactly Rec because of private types and
1822 -- record extensions.
1824 if Is_Itype (Etype (Comp))
1825 and then Is_Record_Type (Underlying_Type
1826 (Scope (Etype (Comp))))
1827 then
1828 Undelay_Type (Etype (Comp));
1829 end if;
1831 Freeze_And_Append (Etype (Comp), Loc, Result);
1833 -- Check for error of component clause given for variable
1834 -- sized type. We have to delay this test till this point,
1835 -- since the component type has to be frozen for us to know
1836 -- if it is variable length. We omit this test in a generic
1837 -- context, it will be applied at instantiation time.
1839 if Present (CC) then
1840 Placed_Component := True;
1842 if Inside_A_Generic then
1843 null;
1845 elsif not
1846 Size_Known_At_Compile_Time
1847 (Underlying_Type (Etype (Comp)))
1848 then
1849 Error_Msg_N
1850 ("component clause not allowed for variable " &
1851 "length component", CC);
1852 end if;
1854 else
1855 Unplaced_Component := True;
1856 end if;
1858 -- Case of component requires byte alignment
1860 if Must_Be_On_Byte_Boundary (Etype (Comp)) then
1862 -- Set the enclosing record to also require byte align
1864 Set_Must_Be_On_Byte_Boundary (Rec);
1866 -- Check for component clause that is inconsistent with
1867 -- the required byte boundary alignment.
1869 if Present (CC)
1870 and then Normalized_First_Bit (Comp) mod
1871 System_Storage_Unit /= 0
1872 then
1873 Error_Msg_N
1874 ("component & must be byte aligned",
1875 Component_Name (Component_Clause (Comp)));
1876 end if;
1877 end if;
1878 end;
1879 end if;
1881 -- Gather data for possible Implicit_Packing later. Note that at
1882 -- this stage we might be dealing with a real component, or with
1883 -- an implicit subtype declaration.
1885 if not Is_Scalar_Type (Etype (Comp)) then
1886 All_Scalar_Components := False;
1887 else
1888 Scalar_Component_Total_RM_Size :=
1889 Scalar_Component_Total_RM_Size + RM_Size (Etype (Comp));
1890 Scalar_Component_Total_Esize :=
1891 Scalar_Component_Total_Esize + Esize (Etype (Comp));
1892 end if;
1894 -- If the component is an Itype with Delayed_Freeze and is either
1895 -- a record or array subtype and its base type has not yet been
1896 -- frozen, we must remove this from the entity list of this record
1897 -- and put it on the entity list of the scope of its base type.
1898 -- Note that we know that this is not the type of a component
1899 -- since we cleared Has_Delayed_Freeze for it in the previous
1900 -- loop. Thus this must be the Designated_Type of an access type,
1901 -- which is the type of a component.
1903 if Is_Itype (Comp)
1904 and then Is_Type (Scope (Comp))
1905 and then Is_Composite_Type (Comp)
1906 and then Base_Type (Comp) /= Comp
1907 and then Has_Delayed_Freeze (Comp)
1908 and then not Is_Frozen (Base_Type (Comp))
1909 then
1910 declare
1911 Will_Be_Frozen : Boolean := False;
1912 S : Entity_Id;
1914 begin
1915 -- We have a pretty bad kludge here. Suppose Rec is subtype
1916 -- being defined in a subprogram that's created as part of
1917 -- the freezing of Rec'Base. In that case, we know that
1918 -- Comp'Base must have already been frozen by the time we
1919 -- get to elaborate this because Gigi doesn't elaborate any
1920 -- bodies until it has elaborated all of the declarative
1921 -- part. But Is_Frozen will not be set at this point because
1922 -- we are processing code in lexical order.
1924 -- We detect this case by going up the Scope chain of Rec
1925 -- and seeing if we have a subprogram scope before reaching
1926 -- the top of the scope chain or that of Comp'Base. If we
1927 -- do, then mark that Comp'Base will actually be frozen. If
1928 -- so, we merely undelay it.
1930 S := Scope (Rec);
1931 while Present (S) loop
1932 if Is_Subprogram (S) then
1933 Will_Be_Frozen := True;
1934 exit;
1935 elsif S = Scope (Base_Type (Comp)) then
1936 exit;
1937 end if;
1939 S := Scope (S);
1940 end loop;
1942 if Will_Be_Frozen then
1943 Undelay_Type (Comp);
1944 else
1945 if Present (Prev) then
1946 Set_Next_Entity (Prev, Next_Entity (Comp));
1947 else
1948 Set_First_Entity (Rec, Next_Entity (Comp));
1949 end if;
1951 -- Insert in entity list of scope of base type (which
1952 -- must be an enclosing scope, because still unfrozen).
1954 Append_Entity (Comp, Scope (Base_Type (Comp)));
1955 end if;
1956 end;
1958 -- If the component is an access type with an allocator as default
1959 -- value, the designated type will be frozen by the corresponding
1960 -- expression in init_proc. In order to place the freeze node for
1961 -- the designated type before that for the current record type,
1962 -- freeze it now.
1964 -- Same process if the component is an array of access types,
1965 -- initialized with an aggregate. If the designated type is
1966 -- private, it cannot contain allocators, and it is premature
1967 -- to freeze the type, so we check for this as well.
1969 elsif Is_Access_Type (Etype (Comp))
1970 and then Present (Parent (Comp))
1971 and then Present (Expression (Parent (Comp)))
1972 then
1973 declare
1974 Alloc : constant Node_Id :=
1975 Check_Allocator (Expression (Parent (Comp)));
1977 begin
1978 if Present (Alloc) then
1980 -- If component is pointer to a classwide type, freeze
1981 -- the specific type in the expression being allocated.
1982 -- The expression may be a subtype indication, in which
1983 -- case freeze the subtype mark.
1985 if Is_Class_Wide_Type
1986 (Designated_Type (Etype (Comp)))
1987 then
1988 if Is_Entity_Name (Expression (Alloc)) then
1989 Freeze_And_Append
1990 (Entity (Expression (Alloc)), Loc, Result);
1991 elsif
1992 Nkind (Expression (Alloc)) = N_Subtype_Indication
1993 then
1994 Freeze_And_Append
1995 (Entity (Subtype_Mark (Expression (Alloc))),
1996 Loc, Result);
1997 end if;
1999 elsif Is_Itype (Designated_Type (Etype (Comp))) then
2000 Check_Itype (Etype (Comp));
2002 else
2003 Freeze_And_Append
2004 (Designated_Type (Etype (Comp)), Loc, Result);
2005 end if;
2006 end if;
2007 end;
2009 elsif Is_Access_Type (Etype (Comp))
2010 and then Is_Itype (Designated_Type (Etype (Comp)))
2011 then
2012 Check_Itype (Etype (Comp));
2014 elsif Is_Array_Type (Etype (Comp))
2015 and then Is_Access_Type (Component_Type (Etype (Comp)))
2016 and then Present (Parent (Comp))
2017 and then Nkind (Parent (Comp)) = N_Component_Declaration
2018 and then Present (Expression (Parent (Comp)))
2019 and then Nkind (Expression (Parent (Comp))) = N_Aggregate
2020 and then Is_Fully_Defined
2021 (Designated_Type (Component_Type (Etype (Comp))))
2022 then
2023 Freeze_And_Append
2024 (Designated_Type
2025 (Component_Type (Etype (Comp))), Loc, Result);
2026 end if;
2028 Prev := Comp;
2029 Next_Entity (Comp);
2030 end loop;
2032 -- Deal with pragma Bit_Order setting non-standard bit order
2034 if Reverse_Bit_Order (Rec) and then Base_Type (Rec) = Rec then
2035 if not Placed_Component then
2036 ADC :=
2037 Get_Attribute_Definition_Clause (Rec, Attribute_Bit_Order);
2038 Error_Msg_N ("?Bit_Order specification has no effect", ADC);
2039 Error_Msg_N
2040 ("\?since no component clauses were specified", ADC);
2042 -- Here is where we do the processing for reversed bit order
2044 else
2045 Adjust_Record_For_Reverse_Bit_Order (Rec);
2046 end if;
2047 end if;
2049 -- Complete error checking on record representation clause (e.g.
2050 -- overlap of components). This is called after adjusting the
2051 -- record for reverse bit order.
2053 declare
2054 RRC : constant Node_Id := Get_Record_Representation_Clause (Rec);
2055 begin
2056 if Present (RRC) then
2057 Check_Record_Representation_Clause (RRC);
2058 end if;
2059 end;
2061 -- Set OK_To_Reorder_Components depending on debug flags
2063 if Rec = Base_Type (Rec)
2064 and then Convention (Rec) = Convention_Ada
2065 then
2066 if (Has_Discriminants (Rec) and then Debug_Flag_Dot_V)
2067 or else
2068 (not Has_Discriminants (Rec) and then Debug_Flag_Dot_R)
2069 then
2070 Set_OK_To_Reorder_Components (Rec);
2071 end if;
2072 end if;
2074 -- Check for useless pragma Pack when all components placed. We only
2075 -- do this check for record types, not subtypes, since a subtype may
2076 -- have all its components placed, and it still makes perfectly good
2077 -- sense to pack other subtypes or the parent type. We do not give
2078 -- this warning if Optimize_Alignment is set to Space, since the
2079 -- pragma Pack does have an effect in this case (it always resets
2080 -- the alignment to one).
2082 if Ekind (Rec) = E_Record_Type
2083 and then Is_Packed (Rec)
2084 and then not Unplaced_Component
2085 and then Optimize_Alignment /= 'S'
2086 then
2087 -- Reset packed status. Probably not necessary, but we do it so
2088 -- that there is no chance of the back end doing something strange
2089 -- with this redundant indication of packing.
2091 Set_Is_Packed (Rec, False);
2093 -- Give warning if redundant constructs warnings on
2095 if Warn_On_Redundant_Constructs then
2096 Error_Msg_N -- CODEFIX
2097 ("?pragma Pack has no effect, no unplaced components",
2098 Get_Rep_Pragma (Rec, Name_Pack));
2099 end if;
2100 end if;
2102 -- If this is the record corresponding to a remote type, freeze the
2103 -- remote type here since that is what we are semantically freezing.
2104 -- This prevents the freeze node for that type in an inner scope.
2106 -- Also, Check for controlled components and unchecked unions.
2107 -- Finally, enforce the restriction that access attributes with a
2108 -- current instance prefix can only apply to limited types.
2110 if Ekind (Rec) = E_Record_Type then
2111 if Present (Corresponding_Remote_Type (Rec)) then
2112 Freeze_And_Append
2113 (Corresponding_Remote_Type (Rec), Loc, Result);
2114 end if;
2116 Comp := First_Component (Rec);
2117 while Present (Comp) loop
2119 -- Do not set Has_Controlled_Component on a class-wide
2120 -- equivalent type. See Make_CW_Equivalent_Type.
2122 if not Is_Class_Wide_Equivalent_Type (Rec)
2123 and then (Has_Controlled_Component (Etype (Comp))
2124 or else (Chars (Comp) /= Name_uParent
2125 and then Is_Controlled (Etype (Comp)))
2126 or else (Is_Protected_Type (Etype (Comp))
2127 and then Present
2128 (Corresponding_Record_Type
2129 (Etype (Comp)))
2130 and then Has_Controlled_Component
2131 (Corresponding_Record_Type
2132 (Etype (Comp)))))
2133 then
2134 Set_Has_Controlled_Component (Rec);
2135 exit;
2136 end if;
2138 if Has_Unchecked_Union (Etype (Comp)) then
2139 Set_Has_Unchecked_Union (Rec);
2140 end if;
2142 if Has_Per_Object_Constraint (Comp) then
2144 -- Scan component declaration for likely misuses of current
2145 -- instance, either in a constraint or a default expression.
2147 Check_Current_Instance (Parent (Comp));
2148 end if;
2150 Next_Component (Comp);
2151 end loop;
2152 end if;
2154 Set_Component_Alignment_If_Not_Set (Rec);
2156 -- For first subtypes, check if there are any fixed-point fields with
2157 -- component clauses, where we must check the size. This is not done
2158 -- till the freeze point, since for fixed-point types, we do not know
2159 -- the size until the type is frozen. Similar processing applies to
2160 -- bit packed arrays.
2162 if Is_First_Subtype (Rec) then
2163 Comp := First_Component (Rec);
2165 while Present (Comp) loop
2166 if Present (Component_Clause (Comp))
2167 and then (Is_Fixed_Point_Type (Etype (Comp))
2168 or else
2169 Is_Bit_Packed_Array (Etype (Comp)))
2170 then
2171 Check_Size
2172 (Component_Name (Component_Clause (Comp)),
2173 Etype (Comp),
2174 Esize (Comp),
2175 Junk);
2176 end if;
2178 Next_Component (Comp);
2179 end loop;
2180 end if;
2182 -- Generate warning for applying C or C++ convention to a record
2183 -- with discriminants. This is suppressed for the unchecked union
2184 -- case, since the whole point in this case is interface C. We also
2185 -- do not generate this within instantiations, since we will have
2186 -- generated a message on the template.
2188 if Has_Discriminants (E)
2189 and then not Is_Unchecked_Union (E)
2190 and then (Convention (E) = Convention_C
2191 or else
2192 Convention (E) = Convention_CPP)
2193 and then Comes_From_Source (E)
2194 and then not In_Instance
2195 and then not Has_Warnings_Off (E)
2196 and then not Has_Warnings_Off (Base_Type (E))
2197 then
2198 declare
2199 Cprag : constant Node_Id := Get_Rep_Pragma (E, Name_Convention);
2200 A2 : Node_Id;
2202 begin
2203 if Present (Cprag) then
2204 A2 := Next (First (Pragma_Argument_Associations (Cprag)));
2206 if Convention (E) = Convention_C then
2207 Error_Msg_N
2208 ("?variant record has no direct equivalent in C", A2);
2209 else
2210 Error_Msg_N
2211 ("?variant record has no direct equivalent in C++", A2);
2212 end if;
2214 Error_Msg_NE
2215 ("\?use of convention for type& is dubious", A2, E);
2216 end if;
2217 end;
2218 end if;
2220 -- See if Size is too small as is (and implicit packing might help)
2222 if not Is_Packed (Rec)
2224 -- No implicit packing if even one component is explicitly placed
2226 and then not Placed_Component
2228 -- Must have size clause and all scalar components
2230 and then Has_Size_Clause (Rec)
2231 and then All_Scalar_Components
2233 -- Do not try implicit packing on records with discriminants, too
2234 -- complicated, especially in the variant record case.
2236 and then not Has_Discriminants (Rec)
2238 -- We can implicitly pack if the specified size of the record is
2239 -- less than the sum of the object sizes (no point in packing if
2240 -- this is not the case).
2242 and then Esize (Rec) < Scalar_Component_Total_Esize
2244 -- And the total RM size cannot be greater than the specified size
2245 -- since otherwise packing will not get us where we have to be!
2247 and then Esize (Rec) >= Scalar_Component_Total_RM_Size
2249 -- Never do implicit packing in CodePeer mode since we don't do
2250 -- any packing ever in this mode (why not???)
2252 and then not CodePeer_Mode
2253 then
2254 -- If implicit packing enabled, do it
2256 if Implicit_Packing then
2257 Set_Is_Packed (Rec);
2259 -- Otherwise flag the size clause
2261 else
2262 declare
2263 Sz : constant Node_Id := Size_Clause (Rec);
2264 begin
2265 Error_Msg_NE -- CODEFIX
2266 ("size given for& too small", Sz, Rec);
2267 Error_Msg_N -- CODEFIX
2268 ("\use explicit pragma Pack "
2269 & "or use pragma Implicit_Packing", Sz);
2270 end;
2271 end if;
2272 end if;
2273 end Freeze_Record_Type;
2275 -- Start of processing for Freeze_Entity
2277 begin
2278 -- We are going to test for various reasons why this entity need not be
2279 -- frozen here, but in the case of an Itype that's defined within a
2280 -- record, that test actually applies to the record.
2282 if Is_Itype (E) and then Is_Record_Type (Scope (E)) then
2283 Test_E := Scope (E);
2284 elsif Is_Itype (E) and then Present (Underlying_Type (Scope (E)))
2285 and then Is_Record_Type (Underlying_Type (Scope (E)))
2286 then
2287 Test_E := Underlying_Type (Scope (E));
2288 end if;
2290 -- Do not freeze if already frozen since we only need one freeze node
2292 if Is_Frozen (E) then
2293 return No_List;
2295 -- It is improper to freeze an external entity within a generic because
2296 -- its freeze node will appear in a non-valid context. The entity will
2297 -- be frozen in the proper scope after the current generic is analyzed.
2299 elsif Inside_A_Generic and then External_Ref_In_Generic (Test_E) then
2300 return No_List;
2302 -- Do not freeze a global entity within an inner scope created during
2303 -- expansion. A call to subprogram E within some internal procedure
2304 -- (a stream attribute for example) might require freezing E, but the
2305 -- freeze node must appear in the same declarative part as E itself.
2306 -- The two-pass elaboration mechanism in gigi guarantees that E will
2307 -- be frozen before the inner call is elaborated. We exclude constants
2308 -- from this test, because deferred constants may be frozen early, and
2309 -- must be diagnosed (e.g. in the case of a deferred constant being used
2310 -- in a default expression). If the enclosing subprogram comes from
2311 -- source, or is a generic instance, then the freeze point is the one
2312 -- mandated by the language, and we freeze the entity. A subprogram that
2313 -- is a child unit body that acts as a spec does not have a spec that
2314 -- comes from source, but can only come from source.
2316 elsif In_Open_Scopes (Scope (Test_E))
2317 and then Scope (Test_E) /= Current_Scope
2318 and then Ekind (Test_E) /= E_Constant
2319 then
2320 declare
2321 S : Entity_Id := Current_Scope;
2323 begin
2325 while Present (S) loop
2326 if Is_Overloadable (S) then
2327 if Comes_From_Source (S)
2328 or else Is_Generic_Instance (S)
2329 or else Is_Child_Unit (S)
2330 then
2331 exit;
2332 else
2333 return No_List;
2334 end if;
2335 end if;
2337 S := Scope (S);
2338 end loop;
2339 end;
2341 -- Similarly, an inlined instance body may make reference to global
2342 -- entities, but these references cannot be the proper freezing point
2343 -- for them, and in the absence of inlining freezing will take place in
2344 -- their own scope. Normally instance bodies are analyzed after the
2345 -- enclosing compilation, and everything has been frozen at the proper
2346 -- place, but with front-end inlining an instance body is compiled
2347 -- before the end of the enclosing scope, and as a result out-of-order
2348 -- freezing must be prevented.
2350 elsif Front_End_Inlining
2351 and then In_Instance_Body
2352 and then Present (Scope (Test_E))
2353 then
2354 declare
2355 S : Entity_Id := Scope (Test_E);
2357 begin
2358 while Present (S) loop
2359 if Is_Generic_Instance (S) then
2360 exit;
2361 else
2362 S := Scope (S);
2363 end if;
2364 end loop;
2366 if No (S) then
2367 return No_List;
2368 end if;
2369 end;
2370 end if;
2372 -- Here to freeze the entity
2374 Result := No_List;
2375 Set_Is_Frozen (E);
2377 -- Case of entity being frozen is other than a type
2379 if not Is_Type (E) then
2381 -- If entity is exported or imported and does not have an external
2382 -- name, now is the time to provide the appropriate default name.
2383 -- Skip this if the entity is stubbed, since we don't need a name
2384 -- for any stubbed routine. For the case on intrinsics, if no
2385 -- external name is specified, then calls will be handled in
2386 -- Exp_Intr.Expand_Intrinsic_Call, and no name is needed. If an
2387 -- external name is provided, then Expand_Intrinsic_Call leaves
2388 -- calls in place for expansion by GIGI.
2390 if (Is_Imported (E) or else Is_Exported (E))
2391 and then No (Interface_Name (E))
2392 and then Convention (E) /= Convention_Stubbed
2393 and then Convention (E) /= Convention_Intrinsic
2394 then
2395 Set_Encoded_Interface_Name
2396 (E, Get_Default_External_Name (E));
2398 -- If entity is an atomic object appearing in a declaration and
2399 -- the expression is an aggregate, assign it to a temporary to
2400 -- ensure that the actual assignment is done atomically rather
2401 -- than component-wise (the assignment to the temp may be done
2402 -- component-wise, but that is harmless).
2404 elsif Is_Atomic (E)
2405 and then Nkind (Parent (E)) = N_Object_Declaration
2406 and then Present (Expression (Parent (E)))
2407 and then Nkind (Expression (Parent (E))) = N_Aggregate
2408 and then
2409 Is_Atomic_Aggregate (Expression (Parent (E)), Etype (E))
2410 then
2411 null;
2412 end if;
2414 -- For a subprogram, freeze all parameter types and also the return
2415 -- type (RM 13.14(14)). However skip this for internal subprograms.
2416 -- This is also the point where any extra formal parameters are
2417 -- created since we now know whether the subprogram will use a
2418 -- foreign convention.
2420 if Is_Subprogram (E) then
2421 if not Is_Internal (E) then
2422 declare
2423 F_Type : Entity_Id;
2424 R_Type : Entity_Id;
2425 Warn_Node : Node_Id;
2427 begin
2428 -- Loop through formals
2430 Formal := First_Formal (E);
2431 while Present (Formal) loop
2432 F_Type := Etype (Formal);
2433 Freeze_And_Append (F_Type, Loc, Result);
2435 if Is_Private_Type (F_Type)
2436 and then Is_Private_Type (Base_Type (F_Type))
2437 and then No (Full_View (Base_Type (F_Type)))
2438 and then not Is_Generic_Type (F_Type)
2439 and then not Is_Derived_Type (F_Type)
2440 then
2441 -- If the type of a formal is incomplete, subprogram
2442 -- is being frozen prematurely. Within an instance
2443 -- (but not within a wrapper package) this is an
2444 -- artifact of our need to regard the end of an
2445 -- instantiation as a freeze point. Otherwise it is
2446 -- a definite error.
2448 if In_Instance then
2449 Set_Is_Frozen (E, False);
2450 return No_List;
2452 elsif not After_Last_Declaration
2453 and then not Freezing_Library_Level_Tagged_Type
2454 then
2455 Error_Msg_Node_1 := F_Type;
2456 Error_Msg
2457 ("type& must be fully defined before this point",
2458 Loc);
2459 end if;
2460 end if;
2462 -- Check suspicious parameter for C function. These tests
2463 -- apply only to exported/imported subprograms.
2465 if Warn_On_Export_Import
2466 and then Comes_From_Source (E)
2467 and then (Convention (E) = Convention_C
2468 or else
2469 Convention (E) = Convention_CPP)
2470 and then (Is_Imported (E) or else Is_Exported (E))
2471 and then Convention (E) /= Convention (Formal)
2472 and then not Has_Warnings_Off (E)
2473 and then not Has_Warnings_Off (F_Type)
2474 and then not Has_Warnings_Off (Formal)
2475 then
2476 -- Qualify mention of formals with subprogram name
2478 Error_Msg_Qual_Level := 1;
2480 -- Check suspicious use of fat C pointer
2482 if Is_Access_Type (F_Type)
2483 and then Esize (F_Type) > Ttypes.System_Address_Size
2484 then
2485 Error_Msg_N
2486 ("?type of & does not correspond to C pointer!",
2487 Formal);
2489 -- Check suspicious return of boolean
2491 elsif Root_Type (F_Type) = Standard_Boolean
2492 and then Convention (F_Type) = Convention_Ada
2493 and then not Has_Warnings_Off (F_Type)
2494 and then not Has_Size_Clause (F_Type)
2495 and then VM_Target = No_VM
2496 then
2497 Error_Msg_N ("& is an 8-bit Ada Boolean?", Formal);
2498 Error_Msg_N
2499 ("\use appropriate corresponding type in C "
2500 & "(e.g. char)?", Formal);
2502 -- Check suspicious tagged type
2504 elsif (Is_Tagged_Type (F_Type)
2505 or else (Is_Access_Type (F_Type)
2506 and then
2507 Is_Tagged_Type
2508 (Designated_Type (F_Type))))
2509 and then Convention (E) = Convention_C
2510 then
2511 Error_Msg_N
2512 ("?& involves a tagged type which does not "
2513 & "correspond to any C type!", Formal);
2515 -- Check wrong convention subprogram pointer
2517 elsif Ekind (F_Type) = E_Access_Subprogram_Type
2518 and then not Has_Foreign_Convention (F_Type)
2519 then
2520 Error_Msg_N
2521 ("?subprogram pointer & should "
2522 & "have foreign convention!", Formal);
2523 Error_Msg_Sloc := Sloc (F_Type);
2524 Error_Msg_NE
2525 ("\?add Convention pragma to declaration of &#",
2526 Formal, F_Type);
2527 end if;
2529 -- Turn off name qualification after message output
2531 Error_Msg_Qual_Level := 0;
2532 end if;
2534 -- Check for unconstrained array in exported foreign
2535 -- convention case.
2537 if Has_Foreign_Convention (E)
2538 and then not Is_Imported (E)
2539 and then Is_Array_Type (F_Type)
2540 and then not Is_Constrained (F_Type)
2541 and then Warn_On_Export_Import
2543 -- Exclude VM case, since both .NET and JVM can handle
2544 -- unconstrained arrays without a problem.
2546 and then VM_Target = No_VM
2547 then
2548 Error_Msg_Qual_Level := 1;
2550 -- If this is an inherited operation, place the
2551 -- warning on the derived type declaration, rather
2552 -- than on the original subprogram.
2554 if Nkind (Original_Node (Parent (E))) =
2555 N_Full_Type_Declaration
2556 then
2557 Warn_Node := Parent (E);
2559 if Formal = First_Formal (E) then
2560 Error_Msg_NE
2561 ("?in inherited operation&", Warn_Node, E);
2562 end if;
2563 else
2564 Warn_Node := Formal;
2565 end if;
2567 Error_Msg_NE
2568 ("?type of argument& is unconstrained array",
2569 Warn_Node, Formal);
2570 Error_Msg_NE
2571 ("?foreign caller must pass bounds explicitly",
2572 Warn_Node, Formal);
2573 Error_Msg_Qual_Level := 0;
2574 end if;
2576 if not From_With_Type (F_Type) then
2577 if Is_Access_Type (F_Type) then
2578 F_Type := Designated_Type (F_Type);
2579 end if;
2581 -- If the formal is an anonymous_access_to_subprogram
2582 -- freeze the subprogram type as well, to prevent
2583 -- scope anomalies in gigi, because there is no other
2584 -- clear point at which it could be frozen.
2586 if Is_Itype (Etype (Formal))
2587 and then Ekind (F_Type) = E_Subprogram_Type
2588 then
2589 Freeze_And_Append (F_Type, Loc, Result);
2590 end if;
2591 end if;
2593 Next_Formal (Formal);
2594 end loop;
2596 -- Case of function: similar checks on return type
2598 if Ekind (E) = E_Function then
2600 -- Freeze return type
2602 R_Type := Etype (E);
2603 Freeze_And_Append (R_Type, Loc, Result);
2605 -- Check suspicious return type for C function
2607 if Warn_On_Export_Import
2608 and then (Convention (E) = Convention_C
2609 or else
2610 Convention (E) = Convention_CPP)
2611 and then (Is_Imported (E) or else Is_Exported (E))
2612 then
2613 -- Check suspicious return of fat C pointer
2615 if Is_Access_Type (R_Type)
2616 and then Esize (R_Type) > Ttypes.System_Address_Size
2617 and then not Has_Warnings_Off (E)
2618 and then not Has_Warnings_Off (R_Type)
2619 then
2620 Error_Msg_N
2621 ("?return type of& does not "
2622 & "correspond to C pointer!", E);
2624 -- Check suspicious return of boolean
2626 elsif Root_Type (R_Type) = Standard_Boolean
2627 and then Convention (R_Type) = Convention_Ada
2628 and then VM_Target = No_VM
2629 and then not Has_Warnings_Off (E)
2630 and then not Has_Warnings_Off (R_Type)
2631 and then not Has_Size_Clause (R_Type)
2632 then
2633 declare
2634 N : constant Node_Id :=
2635 Result_Definition (Declaration_Node (E));
2636 begin
2637 Error_Msg_NE
2638 ("return type of & is an 8-bit Ada Boolean?",
2639 N, E);
2640 Error_Msg_NE
2641 ("\use appropriate corresponding type in C "
2642 & "(e.g. char)?", N, E);
2643 end;
2645 -- Check suspicious return tagged type
2647 elsif (Is_Tagged_Type (R_Type)
2648 or else (Is_Access_Type (R_Type)
2649 and then
2650 Is_Tagged_Type
2651 (Designated_Type (R_Type))))
2652 and then Convention (E) = Convention_C
2653 and then not Has_Warnings_Off (E)
2654 and then not Has_Warnings_Off (R_Type)
2655 then
2656 Error_Msg_N
2657 ("?return type of & does not "
2658 & "correspond to C type!", E);
2660 -- Check return of wrong convention subprogram pointer
2662 elsif Ekind (R_Type) = E_Access_Subprogram_Type
2663 and then not Has_Foreign_Convention (R_Type)
2664 and then not Has_Warnings_Off (E)
2665 and then not Has_Warnings_Off (R_Type)
2666 then
2667 Error_Msg_N
2668 ("?& should return a foreign "
2669 & "convention subprogram pointer", E);
2670 Error_Msg_Sloc := Sloc (R_Type);
2671 Error_Msg_NE
2672 ("\?add Convention pragma to declaration of& #",
2673 E, R_Type);
2674 end if;
2675 end if;
2677 -- Give warning for suspicous return of a result of an
2678 -- unconstrained array type in a foreign convention
2679 -- function.
2681 if Has_Foreign_Convention (E)
2683 -- We are looking for a return of unconstrained array
2685 and then Is_Array_Type (R_Type)
2686 and then not Is_Constrained (R_Type)
2688 -- Exclude imported routines, the warning does not
2689 -- belong on the import, but on the routine definition.
2691 and then not Is_Imported (E)
2693 -- Exclude VM case, since both .NET and JVM can handle
2694 -- return of unconstrained arrays without a problem.
2696 and then VM_Target = No_VM
2698 -- Check that general warning is enabled, and that it
2699 -- is not suppressed for this particular case.
2701 and then Warn_On_Export_Import
2702 and then not Has_Warnings_Off (E)
2703 and then not Has_Warnings_Off (R_Type)
2704 then
2705 Error_Msg_N
2706 ("?foreign convention function& should not " &
2707 "return unconstrained array!", E);
2708 end if;
2709 end if;
2710 end;
2711 end if;
2713 -- Must freeze its parent first if it is a derived subprogram
2715 if Present (Alias (E)) then
2716 Freeze_And_Append (Alias (E), Loc, Result);
2717 end if;
2719 -- We don't freeze internal subprograms, because we don't normally
2720 -- want addition of extra formals or mechanism setting to happen
2721 -- for those. However we do pass through predefined dispatching
2722 -- cases, since extra formals may be needed in some cases, such as
2723 -- for the stream 'Input function (build-in-place formals).
2725 if not Is_Internal (E)
2726 or else Is_Predefined_Dispatching_Operation (E)
2727 then
2728 Freeze_Subprogram (E);
2729 end if;
2731 -- Here for other than a subprogram or type
2733 else
2734 -- If entity has a type, and it is not a generic unit, then
2735 -- freeze it first (RM 13.14(10)).
2737 if Present (Etype (E))
2738 and then Ekind (E) /= E_Generic_Function
2739 then
2740 Freeze_And_Append (Etype (E), Loc, Result);
2741 end if;
2743 -- Special processing for objects created by object declaration
2745 if Nkind (Declaration_Node (E)) = N_Object_Declaration then
2747 -- Abstract type allowed only for C++ imported variables or
2748 -- constants.
2750 -- Note: we inhibit this check for objects that do not come
2751 -- from source because there is at least one case (the
2752 -- expansion of x'class'input where x is abstract) where we
2753 -- legitimately generate an abstract object.
2755 if Is_Abstract_Type (Etype (E))
2756 and then Comes_From_Source (Parent (E))
2757 and then not (Is_Imported (E)
2758 and then Is_CPP_Class (Etype (E)))
2759 then
2760 Error_Msg_N ("type of object cannot be abstract",
2761 Object_Definition (Parent (E)));
2763 if Is_CPP_Class (Etype (E)) then
2764 Error_Msg_NE
2765 ("\} may need a cpp_constructor",
2766 Object_Definition (Parent (E)), Etype (E));
2767 end if;
2768 end if;
2770 -- For object created by object declaration, perform required
2771 -- categorization (preelaborate and pure) checks. Defer these
2772 -- checks to freeze time since pragma Import inhibits default
2773 -- initialization and thus pragma Import affects these checks.
2775 Validate_Object_Declaration (Declaration_Node (E));
2777 -- If there is an address clause, check that it is valid
2779 Check_Address_Clause (E);
2781 -- If the object needs any kind of default initialization, an
2782 -- error must be issued if No_Default_Initialization applies.
2783 -- The check doesn't apply to imported objects, which are not
2784 -- ever default initialized, and is why the check is deferred
2785 -- until freezing, at which point we know if Import applies.
2786 -- Deferred constants are also exempted from this test because
2787 -- their completion is explicit, or through an import pragma.
2789 if Ekind (E) = E_Constant
2790 and then Present (Full_View (E))
2791 then
2792 null;
2794 elsif Comes_From_Source (E)
2795 and then not Is_Imported (E)
2796 and then not Has_Init_Expression (Declaration_Node (E))
2797 and then
2798 ((Has_Non_Null_Base_Init_Proc (Etype (E))
2799 and then not No_Initialization (Declaration_Node (E))
2800 and then not Is_Value_Type (Etype (E))
2801 and then not Suppress_Init_Proc (Etype (E)))
2802 or else
2803 (Needs_Simple_Initialization (Etype (E))
2804 and then not Is_Internal (E)))
2805 then
2806 Has_Default_Initialization := True;
2807 Check_Restriction
2808 (No_Default_Initialization, Declaration_Node (E));
2809 end if;
2811 -- Check that a Thread_Local_Storage variable does not have
2812 -- default initialization, and any explicit initialization must
2813 -- either be the null constant or a static constant.
2815 if Has_Pragma_Thread_Local_Storage (E) then
2816 declare
2817 Decl : constant Node_Id := Declaration_Node (E);
2818 begin
2819 if Has_Default_Initialization
2820 or else
2821 (Has_Init_Expression (Decl)
2822 and then
2823 (No (Expression (Decl))
2824 or else not
2825 (Is_Static_Expression (Expression (Decl))
2826 or else
2827 Nkind (Expression (Decl)) = N_Null)))
2828 then
2829 Error_Msg_NE
2830 ("Thread_Local_Storage variable& is "
2831 & "improperly initialized", Decl, E);
2832 Error_Msg_NE
2833 ("\only allowed initialization is explicit "
2834 & "NULL or static expression", Decl, E);
2835 end if;
2836 end;
2837 end if;
2839 -- For imported objects, set Is_Public unless there is also an
2840 -- address clause, which means that there is no external symbol
2841 -- needed for the Import (Is_Public may still be set for other
2842 -- unrelated reasons). Note that we delayed this processing
2843 -- till freeze time so that we can be sure not to set the flag
2844 -- if there is an address clause. If there is such a clause,
2845 -- then the only purpose of the Import pragma is to suppress
2846 -- implicit initialization.
2848 if Is_Imported (E)
2849 and then No (Address_Clause (E))
2850 then
2851 Set_Is_Public (E);
2852 end if;
2854 -- For convention C objects of an enumeration type, warn if
2855 -- the size is not integer size and no explicit size given.
2856 -- Skip warning for Boolean, and Character, assume programmer
2857 -- expects 8-bit sizes for these cases.
2859 if (Convention (E) = Convention_C
2860 or else
2861 Convention (E) = Convention_CPP)
2862 and then Is_Enumeration_Type (Etype (E))
2863 and then not Is_Character_Type (Etype (E))
2864 and then not Is_Boolean_Type (Etype (E))
2865 and then Esize (Etype (E)) < Standard_Integer_Size
2866 and then not Has_Size_Clause (E)
2867 then
2868 Error_Msg_Uint_1 := UI_From_Int (Standard_Integer_Size);
2869 Error_Msg_N
2870 ("?convention C enumeration object has size less than ^",
2872 Error_Msg_N ("\?use explicit size clause to set size", E);
2873 end if;
2874 end if;
2876 -- Check that a constant which has a pragma Volatile[_Components]
2877 -- or Atomic[_Components] also has a pragma Import (RM C.6(13)).
2879 -- Note: Atomic[_Components] also sets Volatile[_Components]
2881 if Ekind (E) = E_Constant
2882 and then (Has_Volatile_Components (E) or else Is_Volatile (E))
2883 and then not Is_Imported (E)
2884 then
2885 -- Make sure we actually have a pragma, and have not merely
2886 -- inherited the indication from elsewhere (e.g. an address
2887 -- clause, which is not good enough in RM terms!)
2889 if Has_Rep_Pragma (E, Name_Atomic)
2890 or else
2891 Has_Rep_Pragma (E, Name_Atomic_Components)
2892 then
2893 Error_Msg_N
2894 ("stand alone atomic constant must be " &
2895 "imported (RM C.6(13))", E);
2897 elsif Has_Rep_Pragma (E, Name_Volatile)
2898 or else
2899 Has_Rep_Pragma (E, Name_Volatile_Components)
2900 then
2901 Error_Msg_N
2902 ("stand alone volatile constant must be " &
2903 "imported (RM C.6(13))", E);
2904 end if;
2905 end if;
2907 -- Static objects require special handling
2909 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
2910 and then Is_Statically_Allocated (E)
2911 then
2912 Freeze_Static_Object (E);
2913 end if;
2915 -- Remaining step is to layout objects
2917 if Ekind (E) = E_Variable
2918 or else
2919 Ekind (E) = E_Constant
2920 or else
2921 Ekind (E) = E_Loop_Parameter
2922 or else
2923 Is_Formal (E)
2924 then
2925 Layout_Object (E);
2926 end if;
2927 end if;
2929 -- Case of a type or subtype being frozen
2931 else
2932 -- We used to check here that a full type must have preelaborable
2933 -- initialization if it completes a private type specified with
2934 -- pragma Preelaborable_Intialization, but that missed cases where
2935 -- the types occur within a generic package, since the freezing
2936 -- that occurs within a containing scope generally skips traversal
2937 -- of a generic unit's declarations (those will be frozen within
2938 -- instances). This check was moved to Analyze_Package_Specification.
2940 -- The type may be defined in a generic unit. This can occur when
2941 -- freezing a generic function that returns the type (which is
2942 -- defined in a parent unit). It is clearly meaningless to freeze
2943 -- this type. However, if it is a subtype, its size may be determi-
2944 -- nable and used in subsequent checks, so might as well try to
2945 -- compute it.
2947 if Present (Scope (E))
2948 and then Is_Generic_Unit (Scope (E))
2949 then
2950 Check_Compile_Time_Size (E);
2951 return No_List;
2952 end if;
2954 -- Deal with special cases of freezing for subtype
2956 if E /= Base_Type (E) then
2958 -- Before we do anything else, a specialized test for the case of
2959 -- a size given for an array where the array needs to be packed,
2960 -- but was not so the size cannot be honored. This would of course
2961 -- be caught by the backend, and indeed we don't catch all cases.
2962 -- The point is that we can give a better error message in those
2963 -- cases that we do catch with the circuitry here. Also if pragma
2964 -- Implicit_Packing is set, this is where the packing occurs.
2966 -- The reason we do this so early is that the processing in the
2967 -- automatic packing case affects the layout of the base type, so
2968 -- it must be done before we freeze the base type.
2970 if Is_Array_Type (E) then
2971 declare
2972 Lo, Hi : Node_Id;
2973 Ctyp : constant Entity_Id := Component_Type (E);
2975 begin
2976 -- Check enabling conditions. These are straightforward
2977 -- except for the test for a limited composite type. This
2978 -- eliminates the rare case of a array of limited components
2979 -- where there are issues of whether or not we can go ahead
2980 -- and pack the array (since we can't freely pack and unpack
2981 -- arrays if they are limited).
2983 -- Note that we check the root type explicitly because the
2984 -- whole point is we are doing this test before we have had
2985 -- a chance to freeze the base type (and it is that freeze
2986 -- action that causes stuff to be inherited).
2988 if Present (Size_Clause (E))
2989 and then Known_Static_Esize (E)
2990 and then not Is_Packed (E)
2991 and then not Has_Pragma_Pack (E)
2992 and then Number_Dimensions (E) = 1
2993 and then not Has_Component_Size_Clause (E)
2994 and then Known_Static_Esize (Ctyp)
2995 and then not Is_Limited_Composite (E)
2996 and then not Is_Packed (Root_Type (E))
2997 and then not Has_Component_Size_Clause (Root_Type (E))
2998 and then not CodePeer_Mode
2999 then
3000 Get_Index_Bounds (First_Index (E), Lo, Hi);
3002 if Compile_Time_Known_Value (Lo)
3003 and then Compile_Time_Known_Value (Hi)
3004 and then Known_Static_RM_Size (Ctyp)
3005 and then RM_Size (Ctyp) < 64
3006 then
3007 declare
3008 Lov : constant Uint := Expr_Value (Lo);
3009 Hiv : constant Uint := Expr_Value (Hi);
3010 Len : constant Uint := UI_Max
3011 (Uint_0,
3012 Hiv - Lov + 1);
3013 Rsiz : constant Uint := RM_Size (Ctyp);
3014 SZ : constant Node_Id := Size_Clause (E);
3015 Btyp : constant Entity_Id := Base_Type (E);
3017 -- What we are looking for here is the situation where
3018 -- the RM_Size given would be exactly right if there
3019 -- was a pragma Pack (resulting in the component size
3020 -- being the same as the RM_Size). Furthermore, the
3021 -- component type size must be an odd size (not a
3022 -- multiple of storage unit). If the component RM size
3023 -- is an exact number of storage units that is a power
3024 -- of two, the array is not packed and has a standard
3025 -- representation.
3027 begin
3028 if RM_Size (E) = Len * Rsiz
3029 and then Rsiz mod System_Storage_Unit /= 0
3030 then
3031 -- For implicit packing mode, just set the
3032 -- component size silently.
3034 if Implicit_Packing then
3035 Set_Component_Size (Btyp, Rsiz);
3036 Set_Is_Bit_Packed_Array (Btyp);
3037 Set_Is_Packed (Btyp);
3038 Set_Has_Non_Standard_Rep (Btyp);
3040 -- Otherwise give an error message
3042 else
3043 Error_Msg_NE
3044 ("size given for& too small", SZ, E);
3045 Error_Msg_N -- CODEFIX
3046 ("\use explicit pragma Pack "
3047 & "or use pragma Implicit_Packing", SZ);
3048 end if;
3050 elsif RM_Size (E) = Len * Rsiz
3051 and then Implicit_Packing
3052 and then
3053 (Rsiz / System_Storage_Unit = 1
3054 or else Rsiz / System_Storage_Unit = 2
3055 or else Rsiz / System_Storage_Unit = 4)
3056 then
3058 -- Not a packed array, but indicate the desired
3059 -- component size, for the back-end.
3061 Set_Component_Size (Btyp, Rsiz);
3062 end if;
3063 end;
3064 end if;
3065 end if;
3066 end;
3067 end if;
3069 -- If ancestor subtype present, freeze that first. Note that this
3070 -- will also get the base type frozen.
3072 Atype := Ancestor_Subtype (E);
3074 if Present (Atype) then
3075 Freeze_And_Append (Atype, Loc, Result);
3077 -- Otherwise freeze the base type of the entity before freezing
3078 -- the entity itself (RM 13.14(15)).
3080 elsif E /= Base_Type (E) then
3081 Freeze_And_Append (Base_Type (E), Loc, Result);
3082 end if;
3084 -- For a derived type, freeze its parent type first (RM 13.14(15))
3086 elsif Is_Derived_Type (E) then
3087 Freeze_And_Append (Etype (E), Loc, Result);
3088 Freeze_And_Append (First_Subtype (Etype (E)), Loc, Result);
3089 end if;
3091 -- For array type, freeze index types and component type first
3092 -- before freezing the array (RM 13.14(15)).
3094 if Is_Array_Type (E) then
3095 declare
3096 Ctyp : constant Entity_Id := Component_Type (E);
3098 Non_Standard_Enum : Boolean := False;
3099 -- Set true if any of the index types is an enumeration type
3100 -- with a non-standard representation.
3102 begin
3103 Freeze_And_Append (Ctyp, Loc, Result);
3105 Indx := First_Index (E);
3106 while Present (Indx) loop
3107 Freeze_And_Append (Etype (Indx), Loc, Result);
3109 if Is_Enumeration_Type (Etype (Indx))
3110 and then Has_Non_Standard_Rep (Etype (Indx))
3111 then
3112 Non_Standard_Enum := True;
3113 end if;
3115 Next_Index (Indx);
3116 end loop;
3118 -- Processing that is done only for base types
3120 if Ekind (E) = E_Array_Type then
3122 -- Propagate flags for component type
3124 if Is_Controlled (Component_Type (E))
3125 or else Has_Controlled_Component (Ctyp)
3126 then
3127 Set_Has_Controlled_Component (E);
3128 end if;
3130 if Has_Unchecked_Union (Component_Type (E)) then
3131 Set_Has_Unchecked_Union (E);
3132 end if;
3134 -- If packing was requested or if the component size was set
3135 -- explicitly, then see if bit packing is required. This
3136 -- processing is only done for base types, since all the
3137 -- representation aspects involved are type-related. This
3138 -- is not just an optimization, if we start processing the
3139 -- subtypes, they interfere with the settings on the base
3140 -- type (this is because Is_Packed has a slightly different
3141 -- meaning before and after freezing).
3143 declare
3144 Csiz : Uint;
3145 Esiz : Uint;
3147 begin
3148 if (Is_Packed (E) or else Has_Pragma_Pack (E))
3149 and then not Has_Atomic_Components (E)
3150 and then Known_Static_RM_Size (Ctyp)
3151 then
3152 Csiz := UI_Max (RM_Size (Ctyp), 1);
3154 elsif Known_Component_Size (E) then
3155 Csiz := Component_Size (E);
3157 elsif not Known_Static_Esize (Ctyp) then
3158 Csiz := Uint_0;
3160 else
3161 Esiz := Esize (Ctyp);
3163 -- We can set the component size if it is less than
3164 -- 16, rounding it up to the next storage unit size.
3166 if Esiz <= 8 then
3167 Csiz := Uint_8;
3168 elsif Esiz <= 16 then
3169 Csiz := Uint_16;
3170 else
3171 Csiz := Uint_0;
3172 end if;
3174 -- Set component size up to match alignment if it
3175 -- would otherwise be less than the alignment. This
3176 -- deals with cases of types whose alignment exceeds
3177 -- their size (padded types).
3179 if Csiz /= 0 then
3180 declare
3181 A : constant Uint := Alignment_In_Bits (Ctyp);
3182 begin
3183 if Csiz < A then
3184 Csiz := A;
3185 end if;
3186 end;
3187 end if;
3188 end if;
3190 -- Case of component size that may result in packing
3192 if 1 <= Csiz and then Csiz <= 64 then
3193 declare
3194 Ent : constant Entity_Id :=
3195 First_Subtype (E);
3196 Pack_Pragma : constant Node_Id :=
3197 Get_Rep_Pragma (Ent, Name_Pack);
3198 Comp_Size_C : constant Node_Id :=
3199 Get_Attribute_Definition_Clause
3200 (Ent, Attribute_Component_Size);
3201 begin
3202 -- Warn if we have pack and component size so that
3203 -- the pack is ignored.
3205 -- Note: here we must check for the presence of a
3206 -- component size before checking for a Pack pragma
3207 -- to deal with the case where the array type is a
3208 -- derived type whose parent is currently private.
3210 if Present (Comp_Size_C)
3211 and then Has_Pragma_Pack (Ent)
3212 then
3213 Error_Msg_Sloc := Sloc (Comp_Size_C);
3214 Error_Msg_NE
3215 ("?pragma Pack for& ignored!",
3216 Pack_Pragma, Ent);
3217 Error_Msg_N
3218 ("\?explicit component size given#!",
3219 Pack_Pragma);
3220 end if;
3222 -- Set component size if not already set by a
3223 -- component size clause.
3225 if not Present (Comp_Size_C) then
3226 Set_Component_Size (E, Csiz);
3227 end if;
3229 -- Check for base type of 8, 16, 32 bits, where an
3230 -- unsigned subtype has a length one less than the
3231 -- base type (e.g. Natural subtype of Integer).
3233 -- In such cases, if a component size was not set
3234 -- explicitly, then generate a warning.
3236 if Has_Pragma_Pack (E)
3237 and then not Present (Comp_Size_C)
3238 and then
3239 (Csiz = 7 or else Csiz = 15 or else Csiz = 31)
3240 and then Esize (Base_Type (Ctyp)) = Csiz + 1
3241 then
3242 Error_Msg_Uint_1 := Csiz;
3244 if Present (Pack_Pragma) then
3245 Error_Msg_N
3246 ("?pragma Pack causes component size "
3247 & "to be ^!", Pack_Pragma);
3248 Error_Msg_N
3249 ("\?use Component_Size to set "
3250 & "desired value!", Pack_Pragma);
3251 end if;
3252 end if;
3254 -- Actual packing is not needed for 8, 16, 32, 64.
3255 -- Also not needed for 24 if alignment is 1.
3257 if Csiz = 8
3258 or else Csiz = 16
3259 or else Csiz = 32
3260 or else Csiz = 64
3261 or else (Csiz = 24 and then Alignment (Ctyp) = 1)
3262 then
3263 -- Here the array was requested to be packed,
3264 -- but the packing request had no effect, so
3265 -- Is_Packed is reset.
3267 -- Note: semantically this means that we lose
3268 -- track of the fact that a derived type
3269 -- inherited a pragma Pack that was non-
3270 -- effective, but that seems fine.
3272 -- We regard a Pack pragma as a request to set
3273 -- a representation characteristic, and this
3274 -- request may be ignored.
3276 Set_Is_Packed (Base_Type (E), False);
3278 -- In all other cases, packing is indeed needed
3280 else
3281 Set_Has_Non_Standard_Rep (Base_Type (E));
3282 Set_Is_Bit_Packed_Array (Base_Type (E));
3283 Set_Is_Packed (Base_Type (E));
3284 end if;
3285 end;
3286 end if;
3287 end;
3289 -- Processing that is done only for subtypes
3291 else
3292 -- Acquire alignment from base type
3294 if Unknown_Alignment (E) then
3295 Set_Alignment (E, Alignment (Base_Type (E)));
3296 Adjust_Esize_Alignment (E);
3297 end if;
3298 end if;
3300 -- For bit-packed arrays, check the size
3302 if Is_Bit_Packed_Array (E) and then Known_RM_Size (E) then
3303 declare
3304 SizC : constant Node_Id := Size_Clause (E);
3306 Discard : Boolean;
3307 pragma Warnings (Off, Discard);
3309 begin
3310 -- It is not clear if it is possible to have no size
3311 -- clause at this stage, but it is not worth worrying
3312 -- about. Post error on the entity name in the size
3313 -- clause if present, else on the type entity itself.
3315 if Present (SizC) then
3316 Check_Size (Name (SizC), E, RM_Size (E), Discard);
3317 else
3318 Check_Size (E, E, RM_Size (E), Discard);
3319 end if;
3320 end;
3321 end if;
3323 -- If any of the index types was an enumeration type with
3324 -- a non-standard rep clause, then we indicate that the
3325 -- array type is always packed (even if it is not bit packed).
3327 if Non_Standard_Enum then
3328 Set_Has_Non_Standard_Rep (Base_Type (E));
3329 Set_Is_Packed (Base_Type (E));
3330 end if;
3332 Set_Component_Alignment_If_Not_Set (E);
3334 -- If the array is packed, we must create the packed array
3335 -- type to be used to actually implement the type. This is
3336 -- only needed for real array types (not for string literal
3337 -- types, since they are present only for the front end).
3339 if Is_Packed (E)
3340 and then Ekind (E) /= E_String_Literal_Subtype
3341 then
3342 Create_Packed_Array_Type (E);
3343 Freeze_And_Append (Packed_Array_Type (E), Loc, Result);
3345 -- Size information of packed array type is copied to the
3346 -- array type, since this is really the representation. But
3347 -- do not override explicit existing size values. If the
3348 -- ancestor subtype is constrained the packed_array_type
3349 -- will be inherited from it, but the size may have been
3350 -- provided already, and must not be overridden either.
3352 if not Has_Size_Clause (E)
3353 and then
3354 (No (Ancestor_Subtype (E))
3355 or else not Has_Size_Clause (Ancestor_Subtype (E)))
3356 then
3357 Set_Esize (E, Esize (Packed_Array_Type (E)));
3358 Set_RM_Size (E, RM_Size (Packed_Array_Type (E)));
3359 end if;
3361 if not Has_Alignment_Clause (E) then
3362 Set_Alignment (E, Alignment (Packed_Array_Type (E)));
3363 end if;
3364 end if;
3366 -- For non-packed arrays set the alignment of the array to the
3367 -- alignment of the component type if it is unknown. Skip this
3368 -- in atomic case (atomic arrays may need larger alignments).
3370 if not Is_Packed (E)
3371 and then Unknown_Alignment (E)
3372 and then Known_Alignment (Ctyp)
3373 and then Known_Static_Component_Size (E)
3374 and then Known_Static_Esize (Ctyp)
3375 and then Esize (Ctyp) = Component_Size (E)
3376 and then not Is_Atomic (E)
3377 then
3378 Set_Alignment (E, Alignment (Component_Type (E)));
3379 end if;
3380 end;
3382 -- For a class-wide type, the corresponding specific type is
3383 -- frozen as well (RM 13.14(15))
3385 elsif Is_Class_Wide_Type (E) then
3386 Freeze_And_Append (Root_Type (E), Loc, Result);
3388 -- If the base type of the class-wide type is still incomplete,
3389 -- the class-wide remains unfrozen as well. This is legal when
3390 -- E is the formal of a primitive operation of some other type
3391 -- which is being frozen.
3393 if not Is_Frozen (Root_Type (E)) then
3394 Set_Is_Frozen (E, False);
3395 return Result;
3396 end if;
3398 -- If the Class_Wide_Type is an Itype (when type is the anonymous
3399 -- parent of a derived type) and it is a library-level entity,
3400 -- generate an itype reference for it. Otherwise, its first
3401 -- explicit reference may be in an inner scope, which will be
3402 -- rejected by the back-end.
3404 if Is_Itype (E)
3405 and then Is_Compilation_Unit (Scope (E))
3406 then
3407 declare
3408 Ref : constant Node_Id := Make_Itype_Reference (Loc);
3410 begin
3411 Set_Itype (Ref, E);
3412 if No (Result) then
3413 Result := New_List (Ref);
3414 else
3415 Append (Ref, Result);
3416 end if;
3417 end;
3418 end if;
3420 -- The equivalent type associated with a class-wide subtype needs
3421 -- to be frozen to ensure that its layout is done.
3423 if Ekind (E) = E_Class_Wide_Subtype
3424 and then Present (Equivalent_Type (E))
3425 then
3426 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3427 end if;
3429 -- For a record (sub)type, freeze all the component types (RM
3430 -- 13.14(15). We test for E_Record_(sub)Type here, rather than using
3431 -- Is_Record_Type, because we don't want to attempt the freeze for
3432 -- the case of a private type with record extension (we will do that
3433 -- later when the full type is frozen).
3435 elsif Ekind (E) = E_Record_Type
3436 or else Ekind (E) = E_Record_Subtype
3437 then
3438 Freeze_Record_Type (E);
3440 -- For a concurrent type, freeze corresponding record type. This
3441 -- does not correspond to any specific rule in the RM, but the
3442 -- record type is essentially part of the concurrent type.
3443 -- Freeze as well all local entities. This includes record types
3444 -- created for entry parameter blocks, and whatever local entities
3445 -- may appear in the private part.
3447 elsif Is_Concurrent_Type (E) then
3448 if Present (Corresponding_Record_Type (E)) then
3449 Freeze_And_Append
3450 (Corresponding_Record_Type (E), Loc, Result);
3451 end if;
3453 Comp := First_Entity (E);
3454 while Present (Comp) loop
3455 if Is_Type (Comp) then
3456 Freeze_And_Append (Comp, Loc, Result);
3458 elsif (Ekind (Comp)) /= E_Function then
3459 if Is_Itype (Etype (Comp))
3460 and then Underlying_Type (Scope (Etype (Comp))) = E
3461 then
3462 Undelay_Type (Etype (Comp));
3463 end if;
3465 Freeze_And_Append (Etype (Comp), Loc, Result);
3466 end if;
3468 Next_Entity (Comp);
3469 end loop;
3471 -- Private types are required to point to the same freeze node as
3472 -- their corresponding full views. The freeze node itself has to
3473 -- point to the partial view of the entity (because from the partial
3474 -- view, we can retrieve the full view, but not the reverse).
3475 -- However, in order to freeze correctly, we need to freeze the full
3476 -- view. If we are freezing at the end of a scope (or within the
3477 -- scope of the private type), the partial and full views will have
3478 -- been swapped, the full view appears first in the entity chain and
3479 -- the swapping mechanism ensures that the pointers are properly set
3480 -- (on scope exit).
3482 -- If we encounter the partial view before the full view (e.g. when
3483 -- freezing from another scope), we freeze the full view, and then
3484 -- set the pointers appropriately since we cannot rely on swapping to
3485 -- fix things up (subtypes in an outer scope might not get swapped).
3487 elsif Is_Incomplete_Or_Private_Type (E)
3488 and then not Is_Generic_Type (E)
3489 then
3490 -- The construction of the dispatch table associated with library
3491 -- level tagged types forces freezing of all the primitives of the
3492 -- type, which may cause premature freezing of the partial view.
3493 -- For example:
3495 -- package Pkg is
3496 -- type T is tagged private;
3497 -- type DT is new T with private;
3498 -- procedure Prim (X : in out T; Y : in out DT'class);
3499 -- private
3500 -- type T is tagged null record;
3501 -- Obj : T;
3502 -- type DT is new T with null record;
3503 -- end;
3505 -- In this case the type will be frozen later by the usual
3506 -- mechanism: an object declaration, an instantiation, or the
3507 -- end of a declarative part.
3509 if Is_Library_Level_Tagged_Type (E)
3510 and then not Present (Full_View (E))
3511 then
3512 Set_Is_Frozen (E, False);
3513 return Result;
3515 -- Case of full view present
3517 elsif Present (Full_View (E)) then
3519 -- If full view has already been frozen, then no further
3520 -- processing is required
3522 if Is_Frozen (Full_View (E)) then
3524 Set_Has_Delayed_Freeze (E, False);
3525 Set_Freeze_Node (E, Empty);
3526 Check_Debug_Info_Needed (E);
3528 -- Otherwise freeze full view and patch the pointers so that
3529 -- the freeze node will elaborate both views in the back-end.
3531 else
3532 declare
3533 Full : constant Entity_Id := Full_View (E);
3535 begin
3536 if Is_Private_Type (Full)
3537 and then Present (Underlying_Full_View (Full))
3538 then
3539 Freeze_And_Append
3540 (Underlying_Full_View (Full), Loc, Result);
3541 end if;
3543 Freeze_And_Append (Full, Loc, Result);
3545 if Has_Delayed_Freeze (E) then
3546 F_Node := Freeze_Node (Full);
3548 if Present (F_Node) then
3549 Set_Freeze_Node (E, F_Node);
3550 Set_Entity (F_Node, E);
3552 else
3553 -- {Incomplete,Private}_Subtypes with Full_Views
3554 -- constrained by discriminants.
3556 Set_Has_Delayed_Freeze (E, False);
3557 Set_Freeze_Node (E, Empty);
3558 end if;
3559 end if;
3560 end;
3562 Check_Debug_Info_Needed (E);
3563 end if;
3565 -- AI-117 requires that the convention of a partial view be the
3566 -- same as the convention of the full view. Note that this is a
3567 -- recognized breach of privacy, but it's essential for logical
3568 -- consistency of representation, and the lack of a rule in
3569 -- RM95 was an oversight.
3571 Set_Convention (E, Convention (Full_View (E)));
3573 Set_Size_Known_At_Compile_Time (E,
3574 Size_Known_At_Compile_Time (Full_View (E)));
3576 -- Size information is copied from the full view to the
3577 -- incomplete or private view for consistency.
3579 -- We skip this is the full view is not a type. This is very
3580 -- strange of course, and can only happen as a result of
3581 -- certain illegalities, such as a premature attempt to derive
3582 -- from an incomplete type.
3584 if Is_Type (Full_View (E)) then
3585 Set_Size_Info (E, Full_View (E));
3586 Set_RM_Size (E, RM_Size (Full_View (E)));
3587 end if;
3589 return Result;
3591 -- Case of no full view present. If entity is derived or subtype,
3592 -- it is safe to freeze, correctness depends on the frozen status
3593 -- of parent. Otherwise it is either premature usage, or a Taft
3594 -- amendment type, so diagnosis is at the point of use and the
3595 -- type might be frozen later.
3597 elsif E /= Base_Type (E)
3598 or else Is_Derived_Type (E)
3599 then
3600 null;
3602 else
3603 Set_Is_Frozen (E, False);
3604 return No_List;
3605 end if;
3607 -- For access subprogram, freeze types of all formals, the return
3608 -- type was already frozen, since it is the Etype of the function.
3609 -- Formal types can be tagged Taft amendment types, but otherwise
3610 -- they cannot be incomplete.
3612 elsif Ekind (E) = E_Subprogram_Type then
3613 Formal := First_Formal (E);
3615 while Present (Formal) loop
3616 if Ekind (Etype (Formal)) = E_Incomplete_Type
3617 and then No (Full_View (Etype (Formal)))
3618 and then not Is_Value_Type (Etype (Formal))
3619 then
3620 if Is_Tagged_Type (Etype (Formal)) then
3621 null;
3622 else
3623 Error_Msg_NE
3624 ("invalid use of incomplete type&", E, Etype (Formal));
3625 end if;
3626 end if;
3628 Freeze_And_Append (Etype (Formal), Loc, Result);
3629 Next_Formal (Formal);
3630 end loop;
3632 Freeze_Subprogram (E);
3634 -- For access to a protected subprogram, freeze the equivalent type
3635 -- (however this is not set if we are not generating code or if this
3636 -- is an anonymous type used just for resolution).
3638 elsif Is_Access_Protected_Subprogram_Type (E) then
3639 if Present (Equivalent_Type (E)) then
3640 Freeze_And_Append (Equivalent_Type (E), Loc, Result);
3641 end if;
3642 end if;
3644 -- Generic types are never seen by the back-end, and are also not
3645 -- processed by the expander (since the expander is turned off for
3646 -- generic processing), so we never need freeze nodes for them.
3648 if Is_Generic_Type (E) then
3649 return Result;
3650 end if;
3652 -- Some special processing for non-generic types to complete
3653 -- representation details not known till the freeze point.
3655 if Is_Fixed_Point_Type (E) then
3656 Freeze_Fixed_Point_Type (E);
3658 -- Some error checks required for ordinary fixed-point type. Defer
3659 -- these till the freeze-point since we need the small and range
3660 -- values. We only do these checks for base types
3662 if Is_Ordinary_Fixed_Point_Type (E)
3663 and then E = Base_Type (E)
3664 then
3665 if Small_Value (E) < Ureal_2_M_80 then
3666 Error_Msg_Name_1 := Name_Small;
3667 Error_Msg_N
3668 ("`&''%` too small, minimum allowed is 2.0'*'*(-80)", E);
3670 elsif Small_Value (E) > Ureal_2_80 then
3671 Error_Msg_Name_1 := Name_Small;
3672 Error_Msg_N
3673 ("`&''%` too large, maximum allowed is 2.0'*'*80", E);
3674 end if;
3676 if Expr_Value_R (Type_Low_Bound (E)) < Ureal_M_10_36 then
3677 Error_Msg_Name_1 := Name_First;
3678 Error_Msg_N
3679 ("`&''%` too small, minimum allowed is -10.0'*'*36", E);
3680 end if;
3682 if Expr_Value_R (Type_High_Bound (E)) > Ureal_10_36 then
3683 Error_Msg_Name_1 := Name_Last;
3684 Error_Msg_N
3685 ("`&''%` too large, maximum allowed is 10.0'*'*36", E);
3686 end if;
3687 end if;
3689 elsif Is_Enumeration_Type (E) then
3690 Freeze_Enumeration_Type (E);
3692 elsif Is_Integer_Type (E) then
3693 Adjust_Esize_For_Alignment (E);
3695 if Is_Modular_Integer_Type (E)
3696 and then Warn_On_Suspicious_Modulus_Value
3697 then
3698 Check_Suspicious_Modulus (E);
3699 end if;
3701 elsif Is_Access_Type (E) then
3703 -- Check restriction for standard storage pool
3705 if No (Associated_Storage_Pool (E)) then
3706 Check_Restriction (No_Standard_Storage_Pools, E);
3707 end if;
3709 -- Deal with error message for pure access type. This is not an
3710 -- error in Ada 2005 if there is no pool (see AI-366).
3712 if Is_Pure_Unit_Access_Type (E)
3713 and then (Ada_Version < Ada_05
3714 or else not No_Pool_Assigned (E))
3715 then
3716 Error_Msg_N ("named access type not allowed in pure unit", E);
3718 if Ada_Version >= Ada_05 then
3719 Error_Msg_N
3720 ("\would be legal if Storage_Size of 0 given?", E);
3722 elsif No_Pool_Assigned (E) then
3723 Error_Msg_N
3724 ("\would be legal in Ada 2005?", E);
3726 else
3727 Error_Msg_N
3728 ("\would be legal in Ada 2005 if "
3729 & "Storage_Size of 0 given?", E);
3730 end if;
3731 end if;
3732 end if;
3734 -- Case of composite types
3736 if Is_Composite_Type (E) then
3738 -- AI-117 requires that all new primitives of a tagged type must
3739 -- inherit the convention of the full view of the type. Inherited
3740 -- and overriding operations are defined to inherit the convention
3741 -- of their parent or overridden subprogram (also specified in
3742 -- AI-117), which will have occurred earlier (in Derive_Subprogram
3743 -- and New_Overloaded_Entity). Here we set the convention of
3744 -- primitives that are still convention Ada, which will ensure
3745 -- that any new primitives inherit the type's convention. Class-
3746 -- wide types can have a foreign convention inherited from their
3747 -- specific type, but are excluded from this since they don't have
3748 -- any associated primitives.
3750 if Is_Tagged_Type (E)
3751 and then not Is_Class_Wide_Type (E)
3752 and then Convention (E) /= Convention_Ada
3753 then
3754 declare
3755 Prim_List : constant Elist_Id := Primitive_Operations (E);
3756 Prim : Elmt_Id;
3757 begin
3758 Prim := First_Elmt (Prim_List);
3759 while Present (Prim) loop
3760 if Convention (Node (Prim)) = Convention_Ada then
3761 Set_Convention (Node (Prim), Convention (E));
3762 end if;
3764 Next_Elmt (Prim);
3765 end loop;
3766 end;
3767 end if;
3768 end if;
3770 -- Now that all types from which E may depend are frozen, see if the
3771 -- size is known at compile time, if it must be unsigned, or if
3772 -- strict alignment is required
3774 Check_Compile_Time_Size (E);
3775 Check_Unsigned_Type (E);
3777 if Base_Type (E) = E then
3778 Check_Strict_Alignment (E);
3779 end if;
3781 -- Do not allow a size clause for a type which does not have a size
3782 -- that is known at compile time
3784 if Has_Size_Clause (E)
3785 and then not Size_Known_At_Compile_Time (E)
3786 then
3787 -- Suppress this message if errors posted on E, even if we are
3788 -- in all errors mode, since this is often a junk message
3790 if not Error_Posted (E) then
3791 Error_Msg_N
3792 ("size clause not allowed for variable length type",
3793 Size_Clause (E));
3794 end if;
3795 end if;
3797 -- Remaining process is to set/verify the representation information,
3798 -- in particular the size and alignment values. This processing is
3799 -- not required for generic types, since generic types do not play
3800 -- any part in code generation, and so the size and alignment values
3801 -- for such types are irrelevant.
3803 if Is_Generic_Type (E) then
3804 return Result;
3806 -- Otherwise we call the layout procedure
3808 else
3809 Layout_Type (E);
3810 end if;
3812 -- End of freeze processing for type entities
3813 end if;
3815 -- Here is where we logically freeze the current entity. If it has a
3816 -- freeze node, then this is the point at which the freeze node is
3817 -- linked into the result list.
3819 if Has_Delayed_Freeze (E) then
3821 -- If a freeze node is already allocated, use it, otherwise allocate
3822 -- a new one. The preallocation happens in the case of anonymous base
3823 -- types, where we preallocate so that we can set First_Subtype_Link.
3824 -- Note that we reset the Sloc to the current freeze location.
3826 if Present (Freeze_Node (E)) then
3827 F_Node := Freeze_Node (E);
3828 Set_Sloc (F_Node, Loc);
3830 else
3831 F_Node := New_Node (N_Freeze_Entity, Loc);
3832 Set_Freeze_Node (E, F_Node);
3833 Set_Access_Types_To_Process (F_Node, No_Elist);
3834 Set_TSS_Elist (F_Node, No_Elist);
3835 Set_Actions (F_Node, No_List);
3836 end if;
3838 Set_Entity (F_Node, E);
3840 if Result = No_List then
3841 Result := New_List (F_Node);
3842 else
3843 Append (F_Node, Result);
3844 end if;
3846 -- A final pass over record types with discriminants. If the type
3847 -- has an incomplete declaration, there may be constrained access
3848 -- subtypes declared elsewhere, which do not depend on the discrimi-
3849 -- nants of the type, and which are used as component types (i.e.
3850 -- the full view is a recursive type). The designated types of these
3851 -- subtypes can only be elaborated after the type itself, and they
3852 -- need an itype reference.
3854 if Ekind (E) = E_Record_Type
3855 and then Has_Discriminants (E)
3856 then
3857 declare
3858 Comp : Entity_Id;
3859 IR : Node_Id;
3860 Typ : Entity_Id;
3862 begin
3863 Comp := First_Component (E);
3865 while Present (Comp) loop
3866 Typ := Etype (Comp);
3868 if Ekind (Comp) = E_Component
3869 and then Is_Access_Type (Typ)
3870 and then Scope (Typ) /= E
3871 and then Base_Type (Designated_Type (Typ)) = E
3872 and then Is_Itype (Designated_Type (Typ))
3873 then
3874 IR := Make_Itype_Reference (Sloc (Comp));
3875 Set_Itype (IR, Designated_Type (Typ));
3876 Append (IR, Result);
3877 end if;
3879 Next_Component (Comp);
3880 end loop;
3881 end;
3882 end if;
3883 end if;
3885 -- When a type is frozen, the first subtype of the type is frozen as
3886 -- well (RM 13.14(15)). This has to be done after freezing the type,
3887 -- since obviously the first subtype depends on its own base type.
3889 if Is_Type (E) then
3890 Freeze_And_Append (First_Subtype (E), Loc, Result);
3892 -- If we just froze a tagged non-class wide record, then freeze the
3893 -- corresponding class-wide type. This must be done after the tagged
3894 -- type itself is frozen, because the class-wide type refers to the
3895 -- tagged type which generates the class.
3897 if Is_Tagged_Type (E)
3898 and then not Is_Class_Wide_Type (E)
3899 and then Present (Class_Wide_Type (E))
3900 then
3901 Freeze_And_Append (Class_Wide_Type (E), Loc, Result);
3902 end if;
3903 end if;
3905 Check_Debug_Info_Needed (E);
3907 -- Special handling for subprograms
3909 if Is_Subprogram (E) then
3911 -- If subprogram has address clause then reset Is_Public flag, since
3912 -- we do not want the backend to generate external references.
3914 if Present (Address_Clause (E))
3915 and then not Is_Library_Level_Entity (E)
3916 then
3917 Set_Is_Public (E, False);
3919 -- If no address clause and not intrinsic, then for imported
3920 -- subprogram in main unit, generate descriptor if we are in
3921 -- Propagate_Exceptions mode.
3923 elsif Propagate_Exceptions
3924 and then Is_Imported (E)
3925 and then not Is_Intrinsic_Subprogram (E)
3926 and then Convention (E) /= Convention_Stubbed
3927 then
3928 if Result = No_List then
3929 Result := Empty_List;
3930 end if;
3931 end if;
3932 end if;
3934 return Result;
3935 end Freeze_Entity;
3937 -----------------------------
3938 -- Freeze_Enumeration_Type --
3939 -----------------------------
3941 procedure Freeze_Enumeration_Type (Typ : Entity_Id) is
3942 begin
3943 -- By default, if no size clause is present, an enumeration type with
3944 -- Convention C is assumed to interface to a C enum, and has integer
3945 -- size. This applies to types. For subtypes, verify that its base
3946 -- type has no size clause either.
3948 if Has_Foreign_Convention (Typ)
3949 and then not Has_Size_Clause (Typ)
3950 and then not Has_Size_Clause (Base_Type (Typ))
3951 and then Esize (Typ) < Standard_Integer_Size
3952 then
3953 Init_Esize (Typ, Standard_Integer_Size);
3955 else
3956 -- If the enumeration type interfaces to C, and it has a size clause
3957 -- that specifies less than int size, it warrants a warning. The
3958 -- user may intend the C type to be an enum or a char, so this is
3959 -- not by itself an error that the Ada compiler can detect, but it
3960 -- it is a worth a heads-up. For Boolean and Character types we
3961 -- assume that the programmer has the proper C type in mind.
3963 if Convention (Typ) = Convention_C
3964 and then Has_Size_Clause (Typ)
3965 and then Esize (Typ) /= Esize (Standard_Integer)
3966 and then not Is_Boolean_Type (Typ)
3967 and then not Is_Character_Type (Typ)
3968 then
3969 Error_Msg_N
3970 ("C enum types have the size of a C int?", Size_Clause (Typ));
3971 end if;
3973 Adjust_Esize_For_Alignment (Typ);
3974 end if;
3975 end Freeze_Enumeration_Type;
3977 -----------------------
3978 -- Freeze_Expression --
3979 -----------------------
3981 procedure Freeze_Expression (N : Node_Id) is
3982 In_Spec_Exp : constant Boolean := In_Spec_Expression;
3983 Typ : Entity_Id;
3984 Nam : Entity_Id;
3985 Desig_Typ : Entity_Id;
3986 P : Node_Id;
3987 Parent_P : Node_Id;
3989 Freeze_Outside : Boolean := False;
3990 -- This flag is set true if the entity must be frozen outside the
3991 -- current subprogram. This happens in the case of expander generated
3992 -- subprograms (_Init_Proc, _Input, _Output, _Read, _Write) which do
3993 -- not freeze all entities like other bodies, but which nevertheless
3994 -- may reference entities that have to be frozen before the body and
3995 -- obviously cannot be frozen inside the body.
3997 function In_Exp_Body (N : Node_Id) return Boolean;
3998 -- Given an N_Handled_Sequence_Of_Statements node N, determines whether
3999 -- it is the handled statement sequence of an expander-generated
4000 -- subprogram (init proc, stream subprogram, or renaming as body).
4001 -- If so, this is not a freezing context.
4003 -----------------
4004 -- In_Exp_Body --
4005 -----------------
4007 function In_Exp_Body (N : Node_Id) return Boolean is
4008 P : Node_Id;
4009 Id : Entity_Id;
4011 begin
4012 if Nkind (N) = N_Subprogram_Body then
4013 P := N;
4014 else
4015 P := Parent (N);
4016 end if;
4018 if Nkind (P) /= N_Subprogram_Body then
4019 return False;
4021 else
4022 Id := Defining_Unit_Name (Specification (P));
4024 if Nkind (Id) = N_Defining_Identifier
4025 and then (Is_Init_Proc (Id) or else
4026 Is_TSS (Id, TSS_Stream_Input) or else
4027 Is_TSS (Id, TSS_Stream_Output) or else
4028 Is_TSS (Id, TSS_Stream_Read) or else
4029 Is_TSS (Id, TSS_Stream_Write) or else
4030 Nkind (Original_Node (P)) =
4031 N_Subprogram_Renaming_Declaration)
4032 then
4033 return True;
4034 else
4035 return False;
4036 end if;
4037 end if;
4038 end In_Exp_Body;
4040 -- Start of processing for Freeze_Expression
4042 begin
4043 -- Immediate return if freezing is inhibited. This flag is set by the
4044 -- analyzer to stop freezing on generated expressions that would cause
4045 -- freezing if they were in the source program, but which are not
4046 -- supposed to freeze, since they are created.
4048 if Must_Not_Freeze (N) then
4049 return;
4050 end if;
4052 -- If expression is non-static, then it does not freeze in a default
4053 -- expression, see section "Handling of Default Expressions" in the
4054 -- spec of package Sem for further details. Note that we have to
4055 -- make sure that we actually have a real expression (if we have
4056 -- a subtype indication, we can't test Is_Static_Expression!)
4058 if In_Spec_Exp
4059 and then Nkind (N) in N_Subexpr
4060 and then not Is_Static_Expression (N)
4061 then
4062 return;
4063 end if;
4065 -- Freeze type of expression if not frozen already
4067 Typ := Empty;
4069 if Nkind (N) in N_Has_Etype then
4070 if not Is_Frozen (Etype (N)) then
4071 Typ := Etype (N);
4073 -- Base type may be an derived numeric type that is frozen at
4074 -- the point of declaration, but first_subtype is still unfrozen.
4076 elsif not Is_Frozen (First_Subtype (Etype (N))) then
4077 Typ := First_Subtype (Etype (N));
4078 end if;
4079 end if;
4081 -- For entity name, freeze entity if not frozen already. A special
4082 -- exception occurs for an identifier that did not come from source.
4083 -- We don't let such identifiers freeze a non-internal entity, i.e.
4084 -- an entity that did come from source, since such an identifier was
4085 -- generated by the expander, and cannot have any semantic effect on
4086 -- the freezing semantics. For example, this stops the parameter of
4087 -- an initialization procedure from freezing the variable.
4089 if Is_Entity_Name (N)
4090 and then not Is_Frozen (Entity (N))
4091 and then (Nkind (N) /= N_Identifier
4092 or else Comes_From_Source (N)
4093 or else not Comes_From_Source (Entity (N)))
4094 then
4095 Nam := Entity (N);
4096 else
4097 Nam := Empty;
4098 end if;
4100 -- For an allocator freeze designated type if not frozen already
4102 -- For an aggregate whose component type is an access type, freeze the
4103 -- designated type now, so that its freeze does not appear within the
4104 -- loop that might be created in the expansion of the aggregate. If the
4105 -- designated type is a private type without full view, the expression
4106 -- cannot contain an allocator, so the type is not frozen.
4108 -- For a function, we freeze the entity when the subprogram declaration
4109 -- is frozen, but a function call may appear in an initialization proc.
4110 -- before the declaration is frozen. We need to generate the extra
4111 -- formals, if any, to ensure that the expansion of the call includes
4112 -- the proper actuals. This only applies to Ada subprograms, not to
4113 -- imported ones.
4115 Desig_Typ := Empty;
4117 case Nkind (N) is
4118 when N_Allocator =>
4119 Desig_Typ := Designated_Type (Etype (N));
4121 when N_Aggregate =>
4122 if Is_Array_Type (Etype (N))
4123 and then Is_Access_Type (Component_Type (Etype (N)))
4124 then
4125 Desig_Typ := Designated_Type (Component_Type (Etype (N)));
4126 end if;
4128 when N_Selected_Component |
4129 N_Indexed_Component |
4130 N_Slice =>
4132 if Is_Access_Type (Etype (Prefix (N))) then
4133 Desig_Typ := Designated_Type (Etype (Prefix (N)));
4134 end if;
4136 when N_Identifier =>
4137 if Present (Nam)
4138 and then Ekind (Nam) = E_Function
4139 and then Nkind (Parent (N)) = N_Function_Call
4140 and then Convention (Nam) = Convention_Ada
4141 then
4142 Create_Extra_Formals (Nam);
4143 end if;
4145 when others =>
4146 null;
4147 end case;
4149 if Desig_Typ /= Empty
4150 and then (Is_Frozen (Desig_Typ)
4151 or else (not Is_Fully_Defined (Desig_Typ)))
4152 then
4153 Desig_Typ := Empty;
4154 end if;
4156 -- All done if nothing needs freezing
4158 if No (Typ)
4159 and then No (Nam)
4160 and then No (Desig_Typ)
4161 then
4162 return;
4163 end if;
4165 -- Loop for looking at the right place to insert the freeze nodes,
4166 -- exiting from the loop when it is appropriate to insert the freeze
4167 -- node before the current node P.
4169 -- Also checks some special exceptions to the freezing rules. These
4170 -- cases result in a direct return, bypassing the freeze action.
4172 P := N;
4173 loop
4174 Parent_P := Parent (P);
4176 -- If we don't have a parent, then we are not in a well-formed tree.
4177 -- This is an unusual case, but there are some legitimate situations
4178 -- in which this occurs, notably when the expressions in the range of
4179 -- a type declaration are resolved. We simply ignore the freeze
4180 -- request in this case. Is this right ???
4182 if No (Parent_P) then
4183 return;
4184 end if;
4186 -- See if we have got to an appropriate point in the tree
4188 case Nkind (Parent_P) is
4190 -- A special test for the exception of (RM 13.14(8)) for the case
4191 -- of per-object expressions (RM 3.8(18)) occurring in component
4192 -- definition or a discrete subtype definition. Note that we test
4193 -- for a component declaration which includes both cases we are
4194 -- interested in, and furthermore the tree does not have explicit
4195 -- nodes for either of these two constructs.
4197 when N_Component_Declaration =>
4199 -- The case we want to test for here is an identifier that is
4200 -- a per-object expression, this is either a discriminant that
4201 -- appears in a context other than the component declaration
4202 -- or it is a reference to the type of the enclosing construct.
4204 -- For either of these cases, we skip the freezing
4206 if not In_Spec_Expression
4207 and then Nkind (N) = N_Identifier
4208 and then (Present (Entity (N)))
4209 then
4210 -- We recognize the discriminant case by just looking for
4211 -- a reference to a discriminant. It can only be one for
4212 -- the enclosing construct. Skip freezing in this case.
4214 if Ekind (Entity (N)) = E_Discriminant then
4215 return;
4217 -- For the case of a reference to the enclosing record,
4218 -- (or task or protected type), we look for a type that
4219 -- matches the current scope.
4221 elsif Entity (N) = Current_Scope then
4222 return;
4223 end if;
4224 end if;
4226 -- If we have an enumeration literal that appears as the choice in
4227 -- the aggregate of an enumeration representation clause, then
4228 -- freezing does not occur (RM 13.14(10)).
4230 when N_Enumeration_Representation_Clause =>
4232 -- The case we are looking for is an enumeration literal
4234 if (Nkind (N) = N_Identifier or Nkind (N) = N_Character_Literal)
4235 and then Is_Enumeration_Type (Etype (N))
4236 then
4237 -- If enumeration literal appears directly as the choice,
4238 -- do not freeze (this is the normal non-overloaded case)
4240 if Nkind (Parent (N)) = N_Component_Association
4241 and then First (Choices (Parent (N))) = N
4242 then
4243 return;
4245 -- If enumeration literal appears as the name of function
4246 -- which is the choice, then also do not freeze. This
4247 -- happens in the overloaded literal case, where the
4248 -- enumeration literal is temporarily changed to a function
4249 -- call for overloading analysis purposes.
4251 elsif Nkind (Parent (N)) = N_Function_Call
4252 and then
4253 Nkind (Parent (Parent (N))) = N_Component_Association
4254 and then
4255 First (Choices (Parent (Parent (N)))) = Parent (N)
4256 then
4257 return;
4258 end if;
4259 end if;
4261 -- Normally if the parent is a handled sequence of statements,
4262 -- then the current node must be a statement, and that is an
4263 -- appropriate place to insert a freeze node.
4265 when N_Handled_Sequence_Of_Statements =>
4267 -- An exception occurs when the sequence of statements is for
4268 -- an expander generated body that did not do the usual freeze
4269 -- all operation. In this case we usually want to freeze
4270 -- outside this body, not inside it, and we skip past the
4271 -- subprogram body that we are inside.
4273 if In_Exp_Body (Parent_P) then
4275 -- However, we *do* want to freeze at this point if we have
4276 -- an entity to freeze, and that entity is declared *inside*
4277 -- the body of the expander generated procedure. This case
4278 -- is recognized by the scope of the type, which is either
4279 -- the spec for some enclosing body, or (in the case of
4280 -- init_procs, for which there are no separate specs) the
4281 -- current scope.
4283 declare
4284 Subp : constant Node_Id := Parent (Parent_P);
4285 Cspc : Entity_Id;
4287 begin
4288 if Nkind (Subp) = N_Subprogram_Body then
4289 Cspc := Corresponding_Spec (Subp);
4291 if (Present (Typ) and then Scope (Typ) = Cspc)
4292 or else
4293 (Present (Nam) and then Scope (Nam) = Cspc)
4294 then
4295 exit;
4297 elsif Present (Typ)
4298 and then Scope (Typ) = Current_Scope
4299 and then Current_Scope = Defining_Entity (Subp)
4300 then
4301 exit;
4302 end if;
4303 end if;
4304 end;
4306 -- If not that exception to the exception, then this is
4307 -- where we delay the freeze till outside the body.
4309 Parent_P := Parent (Parent_P);
4310 Freeze_Outside := True;
4312 -- Here if normal case where we are in handled statement
4313 -- sequence and want to do the insertion right there.
4315 else
4316 exit;
4317 end if;
4319 -- If parent is a body or a spec or a block, then the current node
4320 -- is a statement or declaration and we can insert the freeze node
4321 -- before it.
4323 when N_Package_Specification |
4324 N_Package_Body |
4325 N_Subprogram_Body |
4326 N_Task_Body |
4327 N_Protected_Body |
4328 N_Entry_Body |
4329 N_Block_Statement => exit;
4331 -- The expander is allowed to define types in any statements list,
4332 -- so any of the following parent nodes also mark a freezing point
4333 -- if the actual node is in a list of statements or declarations.
4335 when N_Exception_Handler |
4336 N_If_Statement |
4337 N_Elsif_Part |
4338 N_Case_Statement_Alternative |
4339 N_Compilation_Unit_Aux |
4340 N_Selective_Accept |
4341 N_Accept_Alternative |
4342 N_Delay_Alternative |
4343 N_Conditional_Entry_Call |
4344 N_Entry_Call_Alternative |
4345 N_Triggering_Alternative |
4346 N_Abortable_Part |
4347 N_And_Then |
4348 N_Or_Else |
4349 N_Freeze_Entity =>
4351 exit when Is_List_Member (P);
4353 -- Note: The N_Loop_Statement is a special case. A type that
4354 -- appears in the source can never be frozen in a loop (this
4355 -- occurs only because of a loop expanded by the expander), so we
4356 -- keep on going. Otherwise we terminate the search. Same is true
4357 -- of any entity which comes from source. (if they have predefined
4358 -- type, that type does not appear to come from source, but the
4359 -- entity should not be frozen here).
4361 when N_Loop_Statement =>
4362 exit when not Comes_From_Source (Etype (N))
4363 and then (No (Nam) or else not Comes_From_Source (Nam));
4365 -- For all other cases, keep looking at parents
4367 when others =>
4368 null;
4369 end case;
4371 -- We fall through the case if we did not yet find the proper
4372 -- place in the free for inserting the freeze node, so climb!
4374 P := Parent_P;
4375 end loop;
4377 -- If the expression appears in a record or an initialization procedure,
4378 -- the freeze nodes are collected and attached to the current scope, to
4379 -- be inserted and analyzed on exit from the scope, to insure that
4380 -- generated entities appear in the correct scope. If the expression is
4381 -- a default for a discriminant specification, the scope is still void.
4382 -- The expression can also appear in the discriminant part of a private
4383 -- or concurrent type.
4385 -- If the expression appears in a constrained subcomponent of an
4386 -- enclosing record declaration, the freeze nodes must be attached to
4387 -- the outer record type so they can eventually be placed in the
4388 -- enclosing declaration list.
4390 -- The other case requiring this special handling is if we are in a
4391 -- default expression, since in that case we are about to freeze a
4392 -- static type, and the freeze scope needs to be the outer scope, not
4393 -- the scope of the subprogram with the default parameter.
4395 -- For default expressions and other spec expressions in generic units,
4396 -- the Move_Freeze_Nodes mechanism (see sem_ch12.adb) takes care of
4397 -- placing them at the proper place, after the generic unit.
4399 if (In_Spec_Exp and not Inside_A_Generic)
4400 or else Freeze_Outside
4401 or else (Is_Type (Current_Scope)
4402 and then (not Is_Concurrent_Type (Current_Scope)
4403 or else not Has_Completion (Current_Scope)))
4404 or else Ekind (Current_Scope) = E_Void
4405 then
4406 declare
4407 Loc : constant Source_Ptr := Sloc (Current_Scope);
4408 Freeze_Nodes : List_Id := No_List;
4409 Pos : Int := Scope_Stack.Last;
4411 begin
4412 if Present (Desig_Typ) then
4413 Freeze_And_Append (Desig_Typ, Loc, Freeze_Nodes);
4414 end if;
4416 if Present (Typ) then
4417 Freeze_And_Append (Typ, Loc, Freeze_Nodes);
4418 end if;
4420 if Present (Nam) then
4421 Freeze_And_Append (Nam, Loc, Freeze_Nodes);
4422 end if;
4424 -- The current scope may be that of a constrained component of
4425 -- an enclosing record declaration, which is above the current
4426 -- scope in the scope stack.
4428 if Is_Record_Type (Scope (Current_Scope)) then
4429 Pos := Pos - 1;
4430 end if;
4432 if Is_Non_Empty_List (Freeze_Nodes) then
4433 if No (Scope_Stack.Table (Pos).Pending_Freeze_Actions) then
4434 Scope_Stack.Table (Pos).Pending_Freeze_Actions :=
4435 Freeze_Nodes;
4436 else
4437 Append_List (Freeze_Nodes,
4438 Scope_Stack.Table (Pos).Pending_Freeze_Actions);
4439 end if;
4440 end if;
4441 end;
4443 return;
4444 end if;
4446 -- Now we have the right place to do the freezing. First, a special
4447 -- adjustment, if we are in spec-expression analysis mode, these freeze
4448 -- actions must not be thrown away (normally all inserted actions are
4449 -- thrown away in this mode. However, the freeze actions are from static
4450 -- expressions and one of the important reasons we are doing this
4451 -- special analysis is to get these freeze actions. Therefore we turn
4452 -- off the In_Spec_Expression mode to propagate these freeze actions.
4453 -- This also means they get properly analyzed and expanded.
4455 In_Spec_Expression := False;
4457 -- Freeze the designated type of an allocator (RM 13.14(13))
4459 if Present (Desig_Typ) then
4460 Freeze_Before (P, Desig_Typ);
4461 end if;
4463 -- Freeze type of expression (RM 13.14(10)). Note that we took care of
4464 -- the enumeration representation clause exception in the loop above.
4466 if Present (Typ) then
4467 Freeze_Before (P, Typ);
4468 end if;
4470 -- Freeze name if one is present (RM 13.14(11))
4472 if Present (Nam) then
4473 Freeze_Before (P, Nam);
4474 end if;
4476 -- Restore In_Spec_Expression flag
4478 In_Spec_Expression := In_Spec_Exp;
4479 end Freeze_Expression;
4481 -----------------------------
4482 -- Freeze_Fixed_Point_Type --
4483 -----------------------------
4485 -- Certain fixed-point types and subtypes, including implicit base types
4486 -- and declared first subtypes, have not yet set up a range. This is
4487 -- because the range cannot be set until the Small and Size values are
4488 -- known, and these are not known till the type is frozen.
4490 -- To signal this case, Scalar_Range contains an unanalyzed syntactic range
4491 -- whose bounds are unanalyzed real literals. This routine will recognize
4492 -- this case, and transform this range node into a properly typed range
4493 -- with properly analyzed and resolved values.
4495 procedure Freeze_Fixed_Point_Type (Typ : Entity_Id) is
4496 Rng : constant Node_Id := Scalar_Range (Typ);
4497 Lo : constant Node_Id := Low_Bound (Rng);
4498 Hi : constant Node_Id := High_Bound (Rng);
4499 Btyp : constant Entity_Id := Base_Type (Typ);
4500 Brng : constant Node_Id := Scalar_Range (Btyp);
4501 BLo : constant Node_Id := Low_Bound (Brng);
4502 BHi : constant Node_Id := High_Bound (Brng);
4503 Small : constant Ureal := Small_Value (Typ);
4504 Loval : Ureal;
4505 Hival : Ureal;
4506 Atype : Entity_Id;
4508 Actual_Size : Nat;
4510 function Fsize (Lov, Hiv : Ureal) return Nat;
4511 -- Returns size of type with given bounds. Also leaves these
4512 -- bounds set as the current bounds of the Typ.
4514 -----------
4515 -- Fsize --
4516 -----------
4518 function Fsize (Lov, Hiv : Ureal) return Nat is
4519 begin
4520 Set_Realval (Lo, Lov);
4521 Set_Realval (Hi, Hiv);
4522 return Minimum_Size (Typ);
4523 end Fsize;
4525 -- Start of processing for Freeze_Fixed_Point_Type
4527 begin
4528 -- If Esize of a subtype has not previously been set, set it now
4530 if Unknown_Esize (Typ) then
4531 Atype := Ancestor_Subtype (Typ);
4533 if Present (Atype) then
4534 Set_Esize (Typ, Esize (Atype));
4535 else
4536 Set_Esize (Typ, Esize (Base_Type (Typ)));
4537 end if;
4538 end if;
4540 -- Immediate return if the range is already analyzed. This means that
4541 -- the range is already set, and does not need to be computed by this
4542 -- routine.
4544 if Analyzed (Rng) then
4545 return;
4546 end if;
4548 -- Immediate return if either of the bounds raises Constraint_Error
4550 if Raises_Constraint_Error (Lo)
4551 or else Raises_Constraint_Error (Hi)
4552 then
4553 return;
4554 end if;
4556 Loval := Realval (Lo);
4557 Hival := Realval (Hi);
4559 -- Ordinary fixed-point case
4561 if Is_Ordinary_Fixed_Point_Type (Typ) then
4563 -- For the ordinary fixed-point case, we are allowed to fudge the
4564 -- end-points up or down by small. Generally we prefer to fudge up,
4565 -- i.e. widen the bounds for non-model numbers so that the end points
4566 -- are included. However there are cases in which this cannot be
4567 -- done, and indeed cases in which we may need to narrow the bounds.
4568 -- The following circuit makes the decision.
4570 -- Note: our terminology here is that Incl_EP means that the bounds
4571 -- are widened by Small if necessary to include the end points, and
4572 -- Excl_EP means that the bounds are narrowed by Small to exclude the
4573 -- end-points if this reduces the size.
4575 -- Note that in the Incl case, all we care about is including the
4576 -- end-points. In the Excl case, we want to narrow the bounds as
4577 -- much as permitted by the RM, to give the smallest possible size.
4579 Fudge : declare
4580 Loval_Incl_EP : Ureal;
4581 Hival_Incl_EP : Ureal;
4583 Loval_Excl_EP : Ureal;
4584 Hival_Excl_EP : Ureal;
4586 Size_Incl_EP : Nat;
4587 Size_Excl_EP : Nat;
4589 Model_Num : Ureal;
4590 First_Subt : Entity_Id;
4591 Actual_Lo : Ureal;
4592 Actual_Hi : Ureal;
4594 begin
4595 -- First step. Base types are required to be symmetrical. Right
4596 -- now, the base type range is a copy of the first subtype range.
4597 -- This will be corrected before we are done, but right away we
4598 -- need to deal with the case where both bounds are non-negative.
4599 -- In this case, we set the low bound to the negative of the high
4600 -- bound, to make sure that the size is computed to include the
4601 -- required sign. Note that we do not need to worry about the
4602 -- case of both bounds negative, because the sign will be dealt
4603 -- with anyway. Furthermore we can't just go making such a bound
4604 -- symmetrical, since in a twos-complement system, there is an
4605 -- extra negative value which could not be accommodated on the
4606 -- positive side.
4608 if Typ = Btyp
4609 and then not UR_Is_Negative (Loval)
4610 and then Hival > Loval
4611 then
4612 Loval := -Hival;
4613 Set_Realval (Lo, Loval);
4614 end if;
4616 -- Compute the fudged bounds. If the number is a model number,
4617 -- then we do nothing to include it, but we are allowed to backoff
4618 -- to the next adjacent model number when we exclude it. If it is
4619 -- not a model number then we straddle the two values with the
4620 -- model numbers on either side.
4622 Model_Num := UR_Trunc (Loval / Small) * Small;
4624 if Loval = Model_Num then
4625 Loval_Incl_EP := Model_Num;
4626 else
4627 Loval_Incl_EP := Model_Num - Small;
4628 end if;
4630 -- The low value excluding the end point is Small greater, but
4631 -- we do not do this exclusion if the low value is positive,
4632 -- since it can't help the size and could actually hurt by
4633 -- crossing the high bound.
4635 if UR_Is_Negative (Loval_Incl_EP) then
4636 Loval_Excl_EP := Loval_Incl_EP + Small;
4638 -- If the value went from negative to zero, then we have the
4639 -- case where Loval_Incl_EP is the model number just below
4640 -- zero, so we want to stick to the negative value for the
4641 -- base type to maintain the condition that the size will
4642 -- include signed values.
4644 if Typ = Btyp
4645 and then UR_Is_Zero (Loval_Excl_EP)
4646 then
4647 Loval_Excl_EP := Loval_Incl_EP;
4648 end if;
4650 else
4651 Loval_Excl_EP := Loval_Incl_EP;
4652 end if;
4654 -- Similar processing for upper bound and high value
4656 Model_Num := UR_Trunc (Hival / Small) * Small;
4658 if Hival = Model_Num then
4659 Hival_Incl_EP := Model_Num;
4660 else
4661 Hival_Incl_EP := Model_Num + Small;
4662 end if;
4664 if UR_Is_Positive (Hival_Incl_EP) then
4665 Hival_Excl_EP := Hival_Incl_EP - Small;
4666 else
4667 Hival_Excl_EP := Hival_Incl_EP;
4668 end if;
4670 -- One further adjustment is needed. In the case of subtypes, we
4671 -- cannot go outside the range of the base type, or we get
4672 -- peculiarities, and the base type range is already set. This
4673 -- only applies to the Incl values, since clearly the Excl values
4674 -- are already as restricted as they are allowed to be.
4676 if Typ /= Btyp then
4677 Loval_Incl_EP := UR_Max (Loval_Incl_EP, Realval (BLo));
4678 Hival_Incl_EP := UR_Min (Hival_Incl_EP, Realval (BHi));
4679 end if;
4681 -- Get size including and excluding end points
4683 Size_Incl_EP := Fsize (Loval_Incl_EP, Hival_Incl_EP);
4684 Size_Excl_EP := Fsize (Loval_Excl_EP, Hival_Excl_EP);
4686 -- No need to exclude end-points if it does not reduce size
4688 if Fsize (Loval_Incl_EP, Hival_Excl_EP) = Size_Excl_EP then
4689 Loval_Excl_EP := Loval_Incl_EP;
4690 end if;
4692 if Fsize (Loval_Excl_EP, Hival_Incl_EP) = Size_Excl_EP then
4693 Hival_Excl_EP := Hival_Incl_EP;
4694 end if;
4696 -- Now we set the actual size to be used. We want to use the
4697 -- bounds fudged up to include the end-points but only if this
4698 -- can be done without violating a specifically given size
4699 -- size clause or causing an unacceptable increase in size.
4701 -- Case of size clause given
4703 if Has_Size_Clause (Typ) then
4705 -- Use the inclusive size only if it is consistent with
4706 -- the explicitly specified size.
4708 if Size_Incl_EP <= RM_Size (Typ) then
4709 Actual_Lo := Loval_Incl_EP;
4710 Actual_Hi := Hival_Incl_EP;
4711 Actual_Size := Size_Incl_EP;
4713 -- If the inclusive size is too large, we try excluding
4714 -- the end-points (will be caught later if does not work).
4716 else
4717 Actual_Lo := Loval_Excl_EP;
4718 Actual_Hi := Hival_Excl_EP;
4719 Actual_Size := Size_Excl_EP;
4720 end if;
4722 -- Case of size clause not given
4724 else
4725 -- If we have a base type whose corresponding first subtype
4726 -- has an explicit size that is large enough to include our
4727 -- end-points, then do so. There is no point in working hard
4728 -- to get a base type whose size is smaller than the specified
4729 -- size of the first subtype.
4731 First_Subt := First_Subtype (Typ);
4733 if Has_Size_Clause (First_Subt)
4734 and then Size_Incl_EP <= Esize (First_Subt)
4735 then
4736 Actual_Size := Size_Incl_EP;
4737 Actual_Lo := Loval_Incl_EP;
4738 Actual_Hi := Hival_Incl_EP;
4740 -- If excluding the end-points makes the size smaller and
4741 -- results in a size of 8,16,32,64, then we take the smaller
4742 -- size. For the 64 case, this is compulsory. For the other
4743 -- cases, it seems reasonable. We like to include end points
4744 -- if we can, but not at the expense of moving to the next
4745 -- natural boundary of size.
4747 elsif Size_Incl_EP /= Size_Excl_EP
4748 and then
4749 (Size_Excl_EP = 8 or else
4750 Size_Excl_EP = 16 or else
4751 Size_Excl_EP = 32 or else
4752 Size_Excl_EP = 64)
4753 then
4754 Actual_Size := Size_Excl_EP;
4755 Actual_Lo := Loval_Excl_EP;
4756 Actual_Hi := Hival_Excl_EP;
4758 -- Otherwise we can definitely include the end points
4760 else
4761 Actual_Size := Size_Incl_EP;
4762 Actual_Lo := Loval_Incl_EP;
4763 Actual_Hi := Hival_Incl_EP;
4764 end if;
4766 -- One pathological case: normally we never fudge a low bound
4767 -- down, since it would seem to increase the size (if it has
4768 -- any effect), but for ranges containing single value, or no
4769 -- values, the high bound can be small too large. Consider:
4771 -- type t is delta 2.0**(-14)
4772 -- range 131072.0 .. 0;
4774 -- That lower bound is *just* outside the range of 32 bits, and
4775 -- does need fudging down in this case. Note that the bounds
4776 -- will always have crossed here, since the high bound will be
4777 -- fudged down if necessary, as in the case of:
4779 -- type t is delta 2.0**(-14)
4780 -- range 131072.0 .. 131072.0;
4782 -- So we detect the situation by looking for crossed bounds,
4783 -- and if the bounds are crossed, and the low bound is greater
4784 -- than zero, we will always back it off by small, since this
4785 -- is completely harmless.
4787 if Actual_Lo > Actual_Hi then
4788 if UR_Is_Positive (Actual_Lo) then
4789 Actual_Lo := Loval_Incl_EP - Small;
4790 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4792 -- And of course, we need to do exactly the same parallel
4793 -- fudge for flat ranges in the negative region.
4795 elsif UR_Is_Negative (Actual_Hi) then
4796 Actual_Hi := Hival_Incl_EP + Small;
4797 Actual_Size := Fsize (Actual_Lo, Actual_Hi);
4798 end if;
4799 end if;
4800 end if;
4802 Set_Realval (Lo, Actual_Lo);
4803 Set_Realval (Hi, Actual_Hi);
4804 end Fudge;
4806 -- For the decimal case, none of this fudging is required, since there
4807 -- are no end-point problems in the decimal case (the end-points are
4808 -- always included).
4810 else
4811 Actual_Size := Fsize (Loval, Hival);
4812 end if;
4814 -- At this stage, the actual size has been calculated and the proper
4815 -- required bounds are stored in the low and high bounds.
4817 if Actual_Size > 64 then
4818 Error_Msg_Uint_1 := UI_From_Int (Actual_Size);
4819 Error_Msg_N
4820 ("size required (^) for type& too large, maximum allowed is 64",
4821 Typ);
4822 Actual_Size := 64;
4823 end if;
4825 -- Check size against explicit given size
4827 if Has_Size_Clause (Typ) then
4828 if Actual_Size > RM_Size (Typ) then
4829 Error_Msg_Uint_1 := RM_Size (Typ);
4830 Error_Msg_Uint_2 := UI_From_Int (Actual_Size);
4831 Error_Msg_NE
4832 ("size given (^) for type& too small, minimum allowed is ^",
4833 Size_Clause (Typ), Typ);
4835 else
4836 Actual_Size := UI_To_Int (Esize (Typ));
4837 end if;
4839 -- Increase size to next natural boundary if no size clause given
4841 else
4842 if Actual_Size <= 8 then
4843 Actual_Size := 8;
4844 elsif Actual_Size <= 16 then
4845 Actual_Size := 16;
4846 elsif Actual_Size <= 32 then
4847 Actual_Size := 32;
4848 else
4849 Actual_Size := 64;
4850 end if;
4852 Init_Esize (Typ, Actual_Size);
4853 Adjust_Esize_For_Alignment (Typ);
4854 end if;
4856 -- If we have a base type, then expand the bounds so that they extend to
4857 -- the full width of the allocated size in bits, to avoid junk range
4858 -- checks on intermediate computations.
4860 if Base_Type (Typ) = Typ then
4861 Set_Realval (Lo, -(Small * (Uint_2 ** (Actual_Size - 1))));
4862 Set_Realval (Hi, (Small * (Uint_2 ** (Actual_Size - 1) - 1)));
4863 end if;
4865 -- Final step is to reanalyze the bounds using the proper type
4866 -- and set the Corresponding_Integer_Value fields of the literals.
4868 Set_Etype (Lo, Empty);
4869 Set_Analyzed (Lo, False);
4870 Analyze (Lo);
4872 -- Resolve with universal fixed if the base type, and the base type if
4873 -- it is a subtype. Note we can't resolve the base type with itself,
4874 -- that would be a reference before definition.
4876 if Typ = Btyp then
4877 Resolve (Lo, Universal_Fixed);
4878 else
4879 Resolve (Lo, Btyp);
4880 end if;
4882 -- Set corresponding integer value for bound
4884 Set_Corresponding_Integer_Value
4885 (Lo, UR_To_Uint (Realval (Lo) / Small));
4887 -- Similar processing for high bound
4889 Set_Etype (Hi, Empty);
4890 Set_Analyzed (Hi, False);
4891 Analyze (Hi);
4893 if Typ = Btyp then
4894 Resolve (Hi, Universal_Fixed);
4895 else
4896 Resolve (Hi, Btyp);
4897 end if;
4899 Set_Corresponding_Integer_Value
4900 (Hi, UR_To_Uint (Realval (Hi) / Small));
4902 -- Set type of range to correspond to bounds
4904 Set_Etype (Rng, Etype (Lo));
4906 -- Set Esize to calculated size if not set already
4908 if Unknown_Esize (Typ) then
4909 Init_Esize (Typ, Actual_Size);
4910 end if;
4912 -- Set RM_Size if not already set. If already set, check value
4914 declare
4915 Minsiz : constant Uint := UI_From_Int (Minimum_Size (Typ));
4917 begin
4918 if RM_Size (Typ) /= Uint_0 then
4919 if RM_Size (Typ) < Minsiz then
4920 Error_Msg_Uint_1 := RM_Size (Typ);
4921 Error_Msg_Uint_2 := Minsiz;
4922 Error_Msg_NE
4923 ("size given (^) for type& too small, minimum allowed is ^",
4924 Size_Clause (Typ), Typ);
4925 end if;
4927 else
4928 Set_RM_Size (Typ, Minsiz);
4929 end if;
4930 end;
4931 end Freeze_Fixed_Point_Type;
4933 ------------------
4934 -- Freeze_Itype --
4935 ------------------
4937 procedure Freeze_Itype (T : Entity_Id; N : Node_Id) is
4938 L : List_Id;
4940 begin
4941 Set_Has_Delayed_Freeze (T);
4942 L := Freeze_Entity (T, Sloc (N));
4944 if Is_Non_Empty_List (L) then
4945 Insert_Actions (N, L);
4946 end if;
4947 end Freeze_Itype;
4949 --------------------------
4950 -- Freeze_Static_Object --
4951 --------------------------
4953 procedure Freeze_Static_Object (E : Entity_Id) is
4955 Cannot_Be_Static : exception;
4956 -- Exception raised if the type of a static object cannot be made
4957 -- static. This happens if the type depends on non-global objects.
4959 procedure Ensure_Expression_Is_SA (N : Node_Id);
4960 -- Called to ensure that an expression used as part of a type definition
4961 -- is statically allocatable, which means that the expression type is
4962 -- statically allocatable, and the expression is either static, or a
4963 -- reference to a library level constant.
4965 procedure Ensure_Type_Is_SA (Typ : Entity_Id);
4966 -- Called to mark a type as static, checking that it is possible
4967 -- to set the type as static. If it is not possible, then the
4968 -- exception Cannot_Be_Static is raised.
4970 -----------------------------
4971 -- Ensure_Expression_Is_SA --
4972 -----------------------------
4974 procedure Ensure_Expression_Is_SA (N : Node_Id) is
4975 Ent : Entity_Id;
4977 begin
4978 Ensure_Type_Is_SA (Etype (N));
4980 if Is_Static_Expression (N) then
4981 return;
4983 elsif Nkind (N) = N_Identifier then
4984 Ent := Entity (N);
4986 if Present (Ent)
4987 and then Ekind (Ent) = E_Constant
4988 and then Is_Library_Level_Entity (Ent)
4989 then
4990 return;
4991 end if;
4992 end if;
4994 raise Cannot_Be_Static;
4995 end Ensure_Expression_Is_SA;
4997 -----------------------
4998 -- Ensure_Type_Is_SA --
4999 -----------------------
5001 procedure Ensure_Type_Is_SA (Typ : Entity_Id) is
5002 N : Node_Id;
5003 C : Entity_Id;
5005 begin
5006 -- If type is library level, we are all set
5008 if Is_Library_Level_Entity (Typ) then
5009 return;
5010 end if;
5012 -- We are also OK if the type already marked as statically allocated,
5013 -- which means we processed it before.
5015 if Is_Statically_Allocated (Typ) then
5016 return;
5017 end if;
5019 -- Mark type as statically allocated
5021 Set_Is_Statically_Allocated (Typ);
5023 -- Check that it is safe to statically allocate this type
5025 if Is_Scalar_Type (Typ) or else Is_Real_Type (Typ) then
5026 Ensure_Expression_Is_SA (Type_Low_Bound (Typ));
5027 Ensure_Expression_Is_SA (Type_High_Bound (Typ));
5029 elsif Is_Array_Type (Typ) then
5030 N := First_Index (Typ);
5031 while Present (N) loop
5032 Ensure_Type_Is_SA (Etype (N));
5033 Next_Index (N);
5034 end loop;
5036 Ensure_Type_Is_SA (Component_Type (Typ));
5038 elsif Is_Access_Type (Typ) then
5039 if Ekind (Designated_Type (Typ)) = E_Subprogram_Type then
5041 declare
5042 F : Entity_Id;
5043 T : constant Entity_Id := Etype (Designated_Type (Typ));
5045 begin
5046 if T /= Standard_Void_Type then
5047 Ensure_Type_Is_SA (T);
5048 end if;
5050 F := First_Formal (Designated_Type (Typ));
5052 while Present (F) loop
5053 Ensure_Type_Is_SA (Etype (F));
5054 Next_Formal (F);
5055 end loop;
5056 end;
5058 else
5059 Ensure_Type_Is_SA (Designated_Type (Typ));
5060 end if;
5062 elsif Is_Record_Type (Typ) then
5063 C := First_Entity (Typ);
5064 while Present (C) loop
5065 if Ekind (C) = E_Discriminant
5066 or else Ekind (C) = E_Component
5067 then
5068 Ensure_Type_Is_SA (Etype (C));
5070 elsif Is_Type (C) then
5071 Ensure_Type_Is_SA (C);
5072 end if;
5074 Next_Entity (C);
5075 end loop;
5077 elsif Ekind (Typ) = E_Subprogram_Type then
5078 Ensure_Type_Is_SA (Etype (Typ));
5080 C := First_Formal (Typ);
5081 while Present (C) loop
5082 Ensure_Type_Is_SA (Etype (C));
5083 Next_Formal (C);
5084 end loop;
5086 else
5087 raise Cannot_Be_Static;
5088 end if;
5089 end Ensure_Type_Is_SA;
5091 -- Start of processing for Freeze_Static_Object
5093 begin
5094 Ensure_Type_Is_SA (Etype (E));
5096 exception
5097 when Cannot_Be_Static =>
5099 -- If the object that cannot be static is imported or exported, then
5100 -- issue an error message saying that this object cannot be imported
5101 -- or exported. If it has an address clause it is an overlay in the
5102 -- current partition and the static requirement is not relevant.
5103 -- Do not issue any error message when ignoring rep clauses.
5105 if Ignore_Rep_Clauses then
5106 null;
5108 elsif Is_Imported (E) then
5109 if No (Address_Clause (E)) then
5110 Error_Msg_N
5111 ("& cannot be imported (local type is not constant)", E);
5112 end if;
5114 -- Otherwise must be exported, something is wrong if compiler
5115 -- is marking something as statically allocated which cannot be).
5117 else pragma Assert (Is_Exported (E));
5118 Error_Msg_N
5119 ("& cannot be exported (local type is not constant)", E);
5120 end if;
5121 end Freeze_Static_Object;
5123 -----------------------
5124 -- Freeze_Subprogram --
5125 -----------------------
5127 procedure Freeze_Subprogram (E : Entity_Id) is
5128 Retype : Entity_Id;
5129 F : Entity_Id;
5131 begin
5132 -- Subprogram may not have an address clause unless it is imported
5134 if Present (Address_Clause (E)) then
5135 if not Is_Imported (E) then
5136 Error_Msg_N
5137 ("address clause can only be given " &
5138 "for imported subprogram",
5139 Name (Address_Clause (E)));
5140 end if;
5141 end if;
5143 -- Reset the Pure indication on an imported subprogram unless an
5144 -- explicit Pure_Function pragma was present. We do this because
5145 -- otherwise it is an insidious error to call a non-pure function from
5146 -- pure unit and have calls mysteriously optimized away. What happens
5147 -- here is that the Import can bypass the normal check to ensure that
5148 -- pure units call only pure subprograms.
5150 if Is_Imported (E)
5151 and then Is_Pure (E)
5152 and then not Has_Pragma_Pure_Function (E)
5153 then
5154 Set_Is_Pure (E, False);
5155 end if;
5157 -- For non-foreign convention subprograms, this is where we create
5158 -- the extra formals (for accessibility level and constrained bit
5159 -- information). We delay this till the freeze point precisely so
5160 -- that we know the convention!
5162 if not Has_Foreign_Convention (E) then
5163 Create_Extra_Formals (E);
5164 Set_Mechanisms (E);
5166 -- If this is convention Ada and a Valued_Procedure, that's odd
5168 if Ekind (E) = E_Procedure
5169 and then Is_Valued_Procedure (E)
5170 and then Convention (E) = Convention_Ada
5171 and then Warn_On_Export_Import
5172 then
5173 Error_Msg_N
5174 ("?Valued_Procedure has no effect for convention Ada", E);
5175 Set_Is_Valued_Procedure (E, False);
5176 end if;
5178 -- Case of foreign convention
5180 else
5181 Set_Mechanisms (E);
5183 -- For foreign conventions, warn about return of an
5184 -- unconstrained array.
5186 -- Note: we *do* allow a return by descriptor for the VMS case,
5187 -- though here there is probably more to be done ???
5189 if Ekind (E) = E_Function then
5190 Retype := Underlying_Type (Etype (E));
5192 -- If no return type, probably some other error, e.g. a
5193 -- missing full declaration, so ignore.
5195 if No (Retype) then
5196 null;
5198 -- If the return type is generic, we have emitted a warning
5199 -- earlier on, and there is nothing else to check here. Specific
5200 -- instantiations may lead to erroneous behavior.
5202 elsif Is_Generic_Type (Etype (E)) then
5203 null;
5205 -- Display warning if returning unconstrained array
5207 elsif Is_Array_Type (Retype)
5208 and then not Is_Constrained (Retype)
5210 -- Exclude cases where descriptor mechanism is set, since the
5211 -- VMS descriptor mechanisms allow such unconstrained returns.
5213 and then Mechanism (E) not in Descriptor_Codes
5215 -- Check appropriate warning is enabled (should we check for
5216 -- Warnings (Off) on specific entities here, probably so???)
5218 and then Warn_On_Export_Import
5220 -- Exclude the VM case, since return of unconstrained arrays
5221 -- is properly handled in both the JVM and .NET cases.
5223 and then VM_Target = No_VM
5224 then
5225 Error_Msg_N
5226 ("?foreign convention function& should not return " &
5227 "unconstrained array", E);
5228 return;
5229 end if;
5230 end if;
5232 -- If any of the formals for an exported foreign convention
5233 -- subprogram have defaults, then emit an appropriate warning since
5234 -- this is odd (default cannot be used from non-Ada code)
5236 if Is_Exported (E) then
5237 F := First_Formal (E);
5238 while Present (F) loop
5239 if Warn_On_Export_Import
5240 and then Present (Default_Value (F))
5241 then
5242 Error_Msg_N
5243 ("?parameter cannot be defaulted in non-Ada call",
5244 Default_Value (F));
5245 end if;
5247 Next_Formal (F);
5248 end loop;
5249 end if;
5250 end if;
5252 -- For VMS, descriptor mechanisms for parameters are allowed only for
5253 -- imported/exported subprograms. Moreover, the NCA descriptor is not
5254 -- allowed for parameters of exported subprograms.
5256 if OpenVMS_On_Target then
5257 if Is_Exported (E) then
5258 F := First_Formal (E);
5259 while Present (F) loop
5260 if Mechanism (F) = By_Descriptor_NCA then
5261 Error_Msg_N
5262 ("'N'C'A' descriptor for parameter not permitted", F);
5263 Error_Msg_N
5264 ("\can only be used for imported subprogram", F);
5265 end if;
5267 Next_Formal (F);
5268 end loop;
5270 elsif not Is_Imported (E) then
5271 F := First_Formal (E);
5272 while Present (F) loop
5273 if Mechanism (F) in Descriptor_Codes then
5274 Error_Msg_N
5275 ("descriptor mechanism for parameter not permitted", F);
5276 Error_Msg_N
5277 ("\can only be used for imported/exported subprogram", F);
5278 end if;
5280 Next_Formal (F);
5281 end loop;
5282 end if;
5283 end if;
5285 -- Pragma Inline_Always is disallowed for dispatching subprograms
5286 -- because the address of such subprograms is saved in the dispatch
5287 -- table to support dispatching calls, and dispatching calls cannot
5288 -- be inlined. This is consistent with the restriction against using
5289 -- 'Access or 'Address on an Inline_Always subprogram.
5291 if Is_Dispatching_Operation (E)
5292 and then Has_Pragma_Inline_Always (E)
5293 then
5294 Error_Msg_N
5295 ("pragma Inline_Always not allowed for dispatching subprograms", E);
5296 end if;
5298 -- Because of the implicit representation of inherited predefined
5299 -- operators in the front-end, the overriding status of the operation
5300 -- may be affected when a full view of a type is analyzed, and this is
5301 -- not captured by the analysis of the corresponding type declaration.
5302 -- Therefore the correctness of a not-overriding indicator must be
5303 -- rechecked when the subprogram is frozen.
5305 if Nkind (E) = N_Defining_Operator_Symbol
5306 and then not Error_Posted (Parent (E))
5307 then
5308 Check_Overriding_Indicator (E, Empty, Is_Primitive (E));
5309 end if;
5310 end Freeze_Subprogram;
5312 ----------------------
5313 -- Is_Fully_Defined --
5314 ----------------------
5316 function Is_Fully_Defined (T : Entity_Id) return Boolean is
5317 begin
5318 if Ekind (T) = E_Class_Wide_Type then
5319 return Is_Fully_Defined (Etype (T));
5321 elsif Is_Array_Type (T) then
5322 return Is_Fully_Defined (Component_Type (T));
5324 elsif Is_Record_Type (T)
5325 and not Is_Private_Type (T)
5326 then
5327 -- Verify that the record type has no components with private types
5328 -- without completion.
5330 declare
5331 Comp : Entity_Id;
5333 begin
5334 Comp := First_Component (T);
5336 while Present (Comp) loop
5337 if not Is_Fully_Defined (Etype (Comp)) then
5338 return False;
5339 end if;
5341 Next_Component (Comp);
5342 end loop;
5343 return True;
5344 end;
5346 -- For the designated type of an access to subprogram, all types in
5347 -- the profile must be fully defined.
5349 elsif Ekind (T) = E_Subprogram_Type then
5350 declare
5351 F : Entity_Id;
5353 begin
5354 F := First_Formal (T);
5355 while Present (F) loop
5356 if not Is_Fully_Defined (Etype (F)) then
5357 return False;
5358 end if;
5360 Next_Formal (F);
5361 end loop;
5363 return Is_Fully_Defined (Etype (T));
5364 end;
5366 else
5367 return not Is_Private_Type (T)
5368 or else Present (Full_View (Base_Type (T)));
5369 end if;
5370 end Is_Fully_Defined;
5372 ---------------------------------
5373 -- Process_Default_Expressions --
5374 ---------------------------------
5376 procedure Process_Default_Expressions
5377 (E : Entity_Id;
5378 After : in out Node_Id)
5380 Loc : constant Source_Ptr := Sloc (E);
5381 Dbody : Node_Id;
5382 Formal : Node_Id;
5383 Dcopy : Node_Id;
5384 Dnam : Entity_Id;
5386 begin
5387 Set_Default_Expressions_Processed (E);
5389 -- A subprogram instance and its associated anonymous subprogram share
5390 -- their signature. The default expression functions are defined in the
5391 -- wrapper packages for the anonymous subprogram, and should not be
5392 -- generated again for the instance.
5394 if Is_Generic_Instance (E)
5395 and then Present (Alias (E))
5396 and then Default_Expressions_Processed (Alias (E))
5397 then
5398 return;
5399 end if;
5401 Formal := First_Formal (E);
5402 while Present (Formal) loop
5403 if Present (Default_Value (Formal)) then
5405 -- We work with a copy of the default expression because we
5406 -- do not want to disturb the original, since this would mess
5407 -- up the conformance checking.
5409 Dcopy := New_Copy_Tree (Default_Value (Formal));
5411 -- The analysis of the expression may generate insert actions,
5412 -- which of course must not be executed. We wrap those actions
5413 -- in a procedure that is not called, and later on eliminated.
5414 -- The following cases have no side-effects, and are analyzed
5415 -- directly.
5417 if Nkind (Dcopy) = N_Identifier
5418 or else Nkind (Dcopy) = N_Expanded_Name
5419 or else Nkind (Dcopy) = N_Integer_Literal
5420 or else (Nkind (Dcopy) = N_Real_Literal
5421 and then not Vax_Float (Etype (Dcopy)))
5422 or else Nkind (Dcopy) = N_Character_Literal
5423 or else Nkind (Dcopy) = N_String_Literal
5424 or else Known_Null (Dcopy)
5425 or else (Nkind (Dcopy) = N_Attribute_Reference
5426 and then
5427 Attribute_Name (Dcopy) = Name_Null_Parameter)
5428 then
5430 -- If there is no default function, we must still do a full
5431 -- analyze call on the default value, to ensure that all error
5432 -- checks are performed, e.g. those associated with static
5433 -- evaluation. Note: this branch will always be taken if the
5434 -- analyzer is turned off (but we still need the error checks).
5436 -- Note: the setting of parent here is to meet the requirement
5437 -- that we can only analyze the expression while attached to
5438 -- the tree. Really the requirement is that the parent chain
5439 -- be set, we don't actually need to be in the tree.
5441 Set_Parent (Dcopy, Declaration_Node (Formal));
5442 Analyze (Dcopy);
5444 -- Default expressions are resolved with their own type if the
5445 -- context is generic, to avoid anomalies with private types.
5447 if Ekind (Scope (E)) = E_Generic_Package then
5448 Resolve (Dcopy);
5449 else
5450 Resolve (Dcopy, Etype (Formal));
5451 end if;
5453 -- If that resolved expression will raise constraint error,
5454 -- then flag the default value as raising constraint error.
5455 -- This allows a proper error message on the calls.
5457 if Raises_Constraint_Error (Dcopy) then
5458 Set_Raises_Constraint_Error (Default_Value (Formal));
5459 end if;
5461 -- If the default is a parameterless call, we use the name of
5462 -- the called function directly, and there is no body to build.
5464 elsif Nkind (Dcopy) = N_Function_Call
5465 and then No (Parameter_Associations (Dcopy))
5466 then
5467 null;
5469 -- Else construct and analyze the body of a wrapper procedure
5470 -- that contains an object declaration to hold the expression.
5471 -- Given that this is done only to complete the analysis, it
5472 -- simpler to build a procedure than a function which might
5473 -- involve secondary stack expansion.
5475 else
5476 Dnam := Make_Temporary (Loc, 'D');
5478 Dbody :=
5479 Make_Subprogram_Body (Loc,
5480 Specification =>
5481 Make_Procedure_Specification (Loc,
5482 Defining_Unit_Name => Dnam),
5484 Declarations => New_List (
5485 Make_Object_Declaration (Loc,
5486 Defining_Identifier =>
5487 Make_Defining_Identifier (Loc,
5488 New_Internal_Name ('T')),
5489 Object_Definition =>
5490 New_Occurrence_Of (Etype (Formal), Loc),
5491 Expression => New_Copy_Tree (Dcopy))),
5493 Handled_Statement_Sequence =>
5494 Make_Handled_Sequence_Of_Statements (Loc,
5495 Statements => New_List));
5497 Set_Scope (Dnam, Scope (E));
5498 Set_Assignment_OK (First (Declarations (Dbody)));
5499 Set_Is_Eliminated (Dnam);
5500 Insert_After (After, Dbody);
5501 Analyze (Dbody);
5502 After := Dbody;
5503 end if;
5504 end if;
5506 Next_Formal (Formal);
5507 end loop;
5508 end Process_Default_Expressions;
5510 ----------------------------------------
5511 -- Set_Component_Alignment_If_Not_Set --
5512 ----------------------------------------
5514 procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id) is
5515 begin
5516 -- Ignore if not base type, subtypes don't need anything
5518 if Typ /= Base_Type (Typ) then
5519 return;
5520 end if;
5522 -- Do not override existing representation
5524 if Is_Packed (Typ) then
5525 return;
5527 elsif Has_Specified_Layout (Typ) then
5528 return;
5530 elsif Component_Alignment (Typ) /= Calign_Default then
5531 return;
5533 else
5534 Set_Component_Alignment
5535 (Typ, Scope_Stack.Table
5536 (Scope_Stack.Last).Component_Alignment_Default);
5537 end if;
5538 end Set_Component_Alignment_If_Not_Set;
5540 ------------------
5541 -- Undelay_Type --
5542 ------------------
5544 procedure Undelay_Type (T : Entity_Id) is
5545 begin
5546 Set_Has_Delayed_Freeze (T, False);
5547 Set_Freeze_Node (T, Empty);
5549 -- Since we don't want T to have a Freeze_Node, we don't want its
5550 -- Full_View or Corresponding_Record_Type to have one either.
5552 -- ??? Fundamentally, this whole handling is a kludge. What we really
5553 -- want is to be sure that for an Itype that's part of record R and is a
5554 -- subtype of type T, that it's frozen after the later of the freeze
5555 -- points of R and T. We have no way of doing that directly, so what we
5556 -- do is force most such Itypes to be frozen as part of freezing R via
5557 -- this procedure and only delay the ones that need to be delayed
5558 -- (mostly the designated types of access types that are defined as part
5559 -- of the record).
5561 if Is_Private_Type (T)
5562 and then Present (Full_View (T))
5563 and then Is_Itype (Full_View (T))
5564 and then Is_Record_Type (Scope (Full_View (T)))
5565 then
5566 Undelay_Type (Full_View (T));
5567 end if;
5569 if Is_Concurrent_Type (T)
5570 and then Present (Corresponding_Record_Type (T))
5571 and then Is_Itype (Corresponding_Record_Type (T))
5572 and then Is_Record_Type (Scope (Corresponding_Record_Type (T)))
5573 then
5574 Undelay_Type (Corresponding_Record_Type (T));
5575 end if;
5576 end Undelay_Type;
5578 ------------------
5579 -- Warn_Overlay --
5580 ------------------
5582 procedure Warn_Overlay
5583 (Expr : Node_Id;
5584 Typ : Entity_Id;
5585 Nam : Entity_Id)
5587 Ent : constant Entity_Id := Entity (Nam);
5588 -- The object to which the address clause applies
5590 Init : Node_Id;
5591 Old : Entity_Id := Empty;
5592 Decl : Node_Id;
5594 begin
5595 -- No warning if address clause overlay warnings are off
5597 if not Address_Clause_Overlay_Warnings then
5598 return;
5599 end if;
5601 -- No warning if there is an explicit initialization
5603 Init := Original_Node (Expression (Declaration_Node (Ent)));
5605 if Present (Init) and then Comes_From_Source (Init) then
5606 return;
5607 end if;
5609 -- We only give the warning for non-imported entities of a type for
5610 -- which a non-null base init proc is defined, or for objects of access
5611 -- types with implicit null initialization, or when Normalize_Scalars
5612 -- applies and the type is scalar or a string type (the latter being
5613 -- tested for because predefined String types are initialized by inline
5614 -- code rather than by an init_proc). Note that we do not give the
5615 -- warning for Initialize_Scalars, since we suppressed initialization
5616 -- in this case.
5618 if Present (Expr)
5619 and then not Is_Imported (Ent)
5620 and then (Has_Non_Null_Base_Init_Proc (Typ)
5621 or else Is_Access_Type (Typ)
5622 or else (Normalize_Scalars
5623 and then (Is_Scalar_Type (Typ)
5624 or else Is_String_Type (Typ))))
5625 then
5626 if Nkind (Expr) = N_Attribute_Reference
5627 and then Is_Entity_Name (Prefix (Expr))
5628 then
5629 Old := Entity (Prefix (Expr));
5631 elsif Is_Entity_Name (Expr)
5632 and then Ekind (Entity (Expr)) = E_Constant
5633 then
5634 Decl := Declaration_Node (Entity (Expr));
5636 if Nkind (Decl) = N_Object_Declaration
5637 and then Present (Expression (Decl))
5638 and then Nkind (Expression (Decl)) = N_Attribute_Reference
5639 and then Is_Entity_Name (Prefix (Expression (Decl)))
5640 then
5641 Old := Entity (Prefix (Expression (Decl)));
5643 elsif Nkind (Expr) = N_Function_Call then
5644 return;
5645 end if;
5647 -- A function call (most likely to To_Address) is probably not an
5648 -- overlay, so skip warning. Ditto if the function call was inlined
5649 -- and transformed into an entity.
5651 elsif Nkind (Original_Node (Expr)) = N_Function_Call then
5652 return;
5653 end if;
5655 Decl := Next (Parent (Expr));
5657 -- If a pragma Import follows, we assume that it is for the current
5658 -- target of the address clause, and skip the warning.
5660 if Present (Decl)
5661 and then Nkind (Decl) = N_Pragma
5662 and then Pragma_Name (Decl) = Name_Import
5663 then
5664 return;
5665 end if;
5667 if Present (Old) then
5668 Error_Msg_Node_2 := Old;
5669 Error_Msg_N
5670 ("default initialization of & may modify &?",
5671 Nam);
5672 else
5673 Error_Msg_N
5674 ("default initialization of & may modify overlaid storage?",
5675 Nam);
5676 end if;
5678 -- Add friendly warning if initialization comes from a packed array
5679 -- component.
5681 if Is_Record_Type (Typ) then
5682 declare
5683 Comp : Entity_Id;
5685 begin
5686 Comp := First_Component (Typ);
5688 while Present (Comp) loop
5689 if Nkind (Parent (Comp)) = N_Component_Declaration
5690 and then Present (Expression (Parent (Comp)))
5691 then
5692 exit;
5693 elsif Is_Array_Type (Etype (Comp))
5694 and then Present (Packed_Array_Type (Etype (Comp)))
5695 then
5696 Error_Msg_NE
5697 ("\packed array component& " &
5698 "will be initialized to zero?",
5699 Nam, Comp);
5700 exit;
5701 else
5702 Next_Component (Comp);
5703 end if;
5704 end loop;
5705 end;
5706 end if;
5708 Error_Msg_N
5709 ("\use pragma Import for & to " &
5710 "suppress initialization (RM B.1(24))?",
5711 Nam);
5712 end if;
5713 end Warn_Overlay;
5715 end Freeze;