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