OpenCores
URL https://opencores.org/ocsvn/openrisc_me/openrisc_me/trunk

Subversion Repositories openrisc_me

[/] [openrisc/] [trunk/] [gnu-src/] [gcc-4.5.1/] [gcc/] [ada/] [exp_ch3.adb] - Blame information for rev 311

Go to most recent revision | Details | Compare with Previous | View Log

Line No. Rev Author Line
1 281 jeremybenn
------------------------------------------------------------------------------
2
--                                                                          --
3
--                         GNAT COMPILER COMPONENTS                         --
4
--                                                                          --
5
--                              E X P _ C H 3                               --
6
--                                                                          --
7
--                                 B o d y                                  --
8
--                                                                          --
9
--          Copyright (C) 1992-2009, Free Software Foundation, Inc.         --
10
--                                                                          --
11
-- GNAT is free software;  you can  redistribute it  and/or modify it under --
12
-- terms of the  GNU General Public License as published  by the Free Soft- --
13
-- ware  Foundation;  either version 3,  or (at your option) any later ver- --
14
-- sion.  GNAT is distributed in the hope that it will be useful, but WITH- --
15
-- OUT ANY WARRANTY;  without even the  implied warranty of MERCHANTABILITY --
16
-- or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License --
17
-- for  more details.  You should have  received  a copy of the GNU General --
18
-- Public License  distributed with GNAT; see file COPYING3.  If not, go to --
19
-- http://www.gnu.org/licenses for a complete copy of the license.          --
20
--                                                                          --
21
-- GNAT was originally developed  by the GNAT team at  New York University. --
22
-- Extensive contributions were provided by Ada Core Technologies Inc.      --
23
--                                                                          --
24
------------------------------------------------------------------------------
25
 
26
with Atree;    use Atree;
27
with Checks;   use Checks;
28
with Einfo;    use Einfo;
29
with Errout;   use Errout;
30
with Exp_Aggr; use Exp_Aggr;
31
with Exp_Atag; use Exp_Atag;
32
with Exp_Ch4;  use Exp_Ch4;
33
with Exp_Ch6;  use Exp_Ch6;
34
with Exp_Ch7;  use Exp_Ch7;
35
with Exp_Ch9;  use Exp_Ch9;
36
with Exp_Ch11; use Exp_Ch11;
37
with Exp_Disp; use Exp_Disp;
38
with Exp_Dist; use Exp_Dist;
39
with Exp_Smem; use Exp_Smem;
40
with Exp_Strm; use Exp_Strm;
41
with Exp_Tss;  use Exp_Tss;
42
with Exp_Util; use Exp_Util;
43
with Freeze;   use Freeze;
44
with Nlists;   use Nlists;
45
with Namet;    use Namet;
46
with Nmake;    use Nmake;
47
with Opt;      use Opt;
48
with Restrict; use Restrict;
49
with Rident;   use Rident;
50
with Rtsfind;  use Rtsfind;
51
with Sem;      use Sem;
52
with Sem_Aux;  use Sem_Aux;
53
with Sem_Attr; use Sem_Attr;
54
with Sem_Cat;  use Sem_Cat;
55
with Sem_Ch3;  use Sem_Ch3;
56
with Sem_Ch6;  use Sem_Ch6;
57
with Sem_Ch8;  use Sem_Ch8;
58
with Sem_Disp; use Sem_Disp;
59
with Sem_Eval; use Sem_Eval;
60
with Sem_Mech; use Sem_Mech;
61
with Sem_Res;  use Sem_Res;
62
with Sem_SCIL; use Sem_SCIL;
63
with Sem_Type; use Sem_Type;
64
with Sem_Util; use Sem_Util;
65
with Sinfo;    use Sinfo;
66
with Stand;    use Stand;
67
with Snames;   use Snames;
68
with Targparm; use Targparm;
69
with Tbuild;   use Tbuild;
70
with Ttypes;   use Ttypes;
71
with Validsw;  use Validsw;
72
 
73
package body Exp_Ch3 is
74
 
75
   -----------------------
76
   -- Local Subprograms --
77
   -----------------------
78
 
79
   function Add_Final_Chain (Def_Id : Entity_Id) return Entity_Id;
80
   --  Add the declaration of a finalization list to the freeze actions for
81
   --  Def_Id, and return its defining identifier.
82
 
83
   procedure Adjust_Discriminants (Rtype : Entity_Id);
84
   --  This is used when freezing a record type. It attempts to construct
85
   --  more restrictive subtypes for discriminants so that the max size of
86
   --  the record can be calculated more accurately. See the body of this
87
   --  procedure for details.
88
 
89
   procedure Build_Array_Init_Proc (A_Type : Entity_Id; Nod : Node_Id);
90
   --  Build initialization procedure for given array type. Nod is a node
91
   --  used for attachment of any actions required in its construction.
92
   --  It also supplies the source location used for the procedure.
93
 
94
   function Build_Discriminant_Formals
95
     (Rec_Id : Entity_Id;
96
      Use_Dl : Boolean) return List_Id;
97
   --  This function uses the discriminants of a type to build a list of
98
   --  formal parameters, used in Build_Init_Procedure among other places.
99
   --  If the flag Use_Dl is set, the list is built using the already
100
   --  defined discriminals of the type, as is the case for concurrent
101
   --  types with discriminants. Otherwise new identifiers are created,
102
   --  with the source names of the discriminants.
103
 
104
   function Build_Equivalent_Array_Aggregate (T : Entity_Id) return Node_Id;
105
   --  This function builds a static aggregate that can serve as the initial
106
   --  value for an array type whose bounds are static, and whose component
107
   --  type is a composite type that has a static equivalent aggregate.
108
   --  The equivalent array aggregate is used both for object initialization
109
   --  and for component initialization, when used in the following function.
110
 
111
   function Build_Equivalent_Record_Aggregate (T : Entity_Id) return Node_Id;
112
   --  This function builds a static aggregate that can serve as the initial
113
   --  value for a record type whose components are scalar and initialized
114
   --  with compile-time values, or arrays with similar initialization or
115
   --  defaults. When possible, initialization of an object of the type can
116
   --  be achieved by using a copy of the aggregate as an initial value, thus
117
   --  removing the implicit call that would otherwise constitute elaboration
118
   --  code.
119
 
120
   function Build_Master_Renaming
121
     (N : Node_Id;
122
      T : Entity_Id) return Entity_Id;
123
   --  If the designated type of an access type is a task type or contains
124
   --  tasks, we make sure that a _Master variable is declared in the current
125
   --  scope, and then declare a renaming for it:
126
   --
127
   --    atypeM : Master_Id renames _Master;
128
   --
129
   --  where atyp is the name of the access type. This declaration is used when
130
   --  an allocator for the access type is expanded. The node is the full
131
   --  declaration of the designated type that contains tasks. The renaming
132
   --  declaration is inserted before N, and after the Master declaration.
133
 
134
   procedure Build_Record_Init_Proc (N : Node_Id; Pe : Entity_Id);
135
   --  Build record initialization procedure. N is the type declaration
136
   --  node, and Pe is the corresponding entity for the record type.
137
 
138
   procedure Build_Slice_Assignment (Typ : Entity_Id);
139
   --  Build assignment procedure for one-dimensional arrays of controlled
140
   --  types. Other array and slice assignments are expanded in-line, but
141
   --  the code expansion for controlled components (when control actions
142
   --  are active) can lead to very large blocks that GCC3 handles poorly.
143
 
144
   procedure Build_Variant_Record_Equality (Typ  : Entity_Id);
145
   --  Create An Equality function for the non-tagged variant record 'Typ'
146
   --  and attach it to the TSS list
147
 
148
   procedure Check_Stream_Attributes (Typ : Entity_Id);
149
   --  Check that if a limited extension has a parent with user-defined stream
150
   --  attributes, and does not itself have user-defined stream-attributes,
151
   --  then any limited component of the extension also has the corresponding
152
   --  user-defined stream attributes.
153
 
154
   procedure Clean_Task_Names
155
     (Typ     : Entity_Id;
156
      Proc_Id : Entity_Id);
157
   --  If an initialization procedure includes calls to generate names
158
   --  for task subcomponents, indicate that secondary stack cleanup is
159
   --  needed after an initialization. Typ is the component type, and Proc_Id
160
   --  the initialization procedure for the enclosing composite type.
161
 
162
   procedure Expand_Tagged_Root (T : Entity_Id);
163
   --  Add a field _Tag at the beginning of the record. This field carries
164
   --  the value of the access to the Dispatch table. This procedure is only
165
   --  called on root type, the _Tag field being inherited by the descendants.
166
 
167
   procedure Expand_Record_Controller (T : Entity_Id);
168
   --  T must be a record type that Has_Controlled_Component. Add a field
169
   --  _controller of type Record_Controller or Limited_Record_Controller
170
   --  in the record T.
171
 
172
   procedure Expand_Freeze_Array_Type (N : Node_Id);
173
   --  Freeze an array type. Deals with building the initialization procedure,
174
   --  creating the packed array type for a packed array and also with the
175
   --  creation of the controlling procedures for the controlled case. The
176
   --  argument N is the N_Freeze_Entity node for the type.
177
 
178
   procedure Expand_Freeze_Enumeration_Type (N : Node_Id);
179
   --  Freeze enumeration type with non-standard representation. Builds the
180
   --  array and function needed to convert between enumeration pos and
181
   --  enumeration representation values. N is the N_Freeze_Entity node
182
   --  for the type.
183
 
184
   procedure Expand_Freeze_Record_Type (N : Node_Id);
185
   --  Freeze record type. Builds all necessary discriminant checking
186
   --  and other ancillary functions, and builds dispatch tables where
187
   --  needed. The argument N is the N_Freeze_Entity node. This processing
188
   --  applies only to E_Record_Type entities, not to class wide types,
189
   --  record subtypes, or private types.
190
 
191
   procedure Freeze_Stream_Operations (N : Node_Id; Typ : Entity_Id);
192
   --  Treat user-defined stream operations as renaming_as_body if the
193
   --  subprogram they rename is not frozen when the type is frozen.
194
 
195
   procedure Initialization_Warning (E : Entity_Id);
196
   --  If static elaboration of the package is requested, indicate
197
   --  when a type does meet the conditions for static initialization. If
198
   --  E is a type, it has components that have no static initialization.
199
   --  if E is an entity, its initial expression is not compile-time known.
200
 
201
   function Init_Formals (Typ : Entity_Id) return List_Id;
202
   --  This function builds the list of formals for an initialization routine.
203
   --  The first formal is always _Init with the given type. For task value
204
   --  record types and types containing tasks, three additional formals are
205
   --  added:
206
   --
207
   --    _Master    : Master_Id
208
   --    _Chain     : in out Activation_Chain
209
   --    _Task_Name : String
210
   --
211
   --  The caller must append additional entries for discriminants if required.
212
 
213
   function In_Runtime (E : Entity_Id) return Boolean;
214
   --  Check if E is defined in the RTL (in a child of Ada or System). Used
215
   --  to avoid to bring in the overhead of _Input, _Output for tagged types.
216
 
217
   function Is_Variable_Size_Record (E : Entity_Id) return Boolean;
218
   --  Returns true if E has variable size components
219
 
220
   function Make_Eq_Case
221
     (E     : Entity_Id;
222
      CL    : Node_Id;
223
      Discr : Entity_Id := Empty) return List_Id;
224
   --  Building block for variant record equality. Defined to share the code
225
   --  between the tagged and non-tagged case. Given a Component_List node CL,
226
   --  it generates an 'if' followed by a 'case' statement that compares all
227
   --  components of local temporaries named X and Y (that are declared as
228
   --  formals at some upper level). E provides the Sloc to be used for the
229
   --  generated code. Discr is used as the case statement switch in the case
230
   --  of Unchecked_Union equality.
231
 
232
   function Make_Eq_If
233
     (E : Entity_Id;
234
      L : List_Id) return Node_Id;
235
   --  Building block for variant record equality. Defined to share the code
236
   --  between the tagged and non-tagged case. Given the list of components
237
   --  (or discriminants) L, it generates a return statement that compares all
238
   --  components of local temporaries named X and Y (that are declared as
239
   --  formals at some upper level). E provides the Sloc to be used for the
240
   --  generated code.
241
 
242
   procedure Make_Predefined_Primitive_Specs
243
     (Tag_Typ     : Entity_Id;
244
      Predef_List : out List_Id;
245
      Renamed_Eq  : out Entity_Id);
246
   --  Create a list with the specs of the predefined primitive operations.
247
   --  For tagged types that are interfaces all these primitives are defined
248
   --  abstract.
249
   --
250
   --  The following entries are present for all tagged types, and provide
251
   --  the results of the corresponding attribute applied to the object.
252
   --  Dispatching is required in general, since the result of the attribute
253
   --  will vary with the actual object subtype.
254
   --
255
   --     _alignment     provides result of 'Alignment attribute
256
   --     _size          provides result of 'Size attribute
257
   --     typSR          provides result of 'Read attribute
258
   --     typSW          provides result of 'Write attribute
259
   --     typSI          provides result of 'Input attribute
260
   --     typSO          provides result of 'Output attribute
261
   --
262
   --  The following entries are additionally present for non-limited tagged
263
   --  types, and implement additional dispatching operations for predefined
264
   --  operations:
265
   --
266
   --     _equality      implements "=" operator
267
   --     _assign        implements assignment operation
268
   --     typDF          implements deep finalization
269
   --     typDA          implements deep adjust
270
   --
271
   --  The latter two are empty procedures unless the type contains some
272
   --  controlled components that require finalization actions (the deep
273
   --  in the name refers to the fact that the action applies to components).
274
   --
275
   --  The list is returned in Predef_List. The Parameter Renamed_Eq either
276
   --  returns the value Empty, or else the defining unit name for the
277
   --  predefined equality function in the case where the type has a primitive
278
   --  operation that is a renaming of predefined equality (but only if there
279
   --  is also an overriding user-defined equality function). The returned
280
   --  Renamed_Eq will be passed to the corresponding parameter of
281
   --  Predefined_Primitive_Bodies.
282
 
283
   function Has_New_Non_Standard_Rep (T : Entity_Id) return Boolean;
284
   --  returns True if there are representation clauses for type T that are not
285
   --  inherited. If the result is false, the init_proc and the discriminant
286
   --  checking functions of the parent can be reused by a derived type.
287
 
288
   procedure Make_Controlling_Function_Wrappers
289
     (Tag_Typ   : Entity_Id;
290
      Decl_List : out List_Id;
291
      Body_List : out List_Id);
292
   --  Ada 2005 (AI-391): Makes specs and bodies for the wrapper functions
293
   --  associated with inherited functions with controlling results which
294
   --  are not overridden. The body of each wrapper function consists solely
295
   --  of a return statement whose expression is an extension aggregate
296
   --  invoking the inherited subprogram's parent subprogram and extended
297
   --  with a null association list.
298
 
299
   procedure Make_Null_Procedure_Specs
300
     (Tag_Typ   : Entity_Id;
301
      Decl_List : out List_Id);
302
   --  Ada 2005 (AI-251): Makes specs for null procedures associated with any
303
   --  null procedures inherited from an interface type that have not been
304
   --  overridden. Only one null procedure will be created for a given set of
305
   --  inherited null procedures with homographic profiles.
306
 
307
   function Predef_Spec_Or_Body
308
     (Loc      : Source_Ptr;
309
      Tag_Typ  : Entity_Id;
310
      Name     : Name_Id;
311
      Profile  : List_Id;
312
      Ret_Type : Entity_Id := Empty;
313
      For_Body : Boolean   := False) return Node_Id;
314
   --  This function generates the appropriate expansion for a predefined
315
   --  primitive operation specified by its name, parameter profile and
316
   --  return type (Empty means this is a procedure). If For_Body is false,
317
   --  then the returned node is a subprogram declaration. If For_Body is
318
   --  true, then the returned node is a empty subprogram body containing
319
   --  no declarations and no statements.
320
 
321
   function Predef_Stream_Attr_Spec
322
     (Loc      : Source_Ptr;
323
      Tag_Typ  : Entity_Id;
324
      Name     : TSS_Name_Type;
325
      For_Body : Boolean := False) return Node_Id;
326
   --  Specialized version of Predef_Spec_Or_Body that apply to read, write,
327
   --  input and output attribute whose specs are constructed in Exp_Strm.
328
 
329
   function Predef_Deep_Spec
330
     (Loc      : Source_Ptr;
331
      Tag_Typ  : Entity_Id;
332
      Name     : TSS_Name_Type;
333
      For_Body : Boolean := False) return Node_Id;
334
   --  Specialized version of Predef_Spec_Or_Body that apply to _deep_adjust
335
   --  and _deep_finalize
336
 
337
   function Predefined_Primitive_Bodies
338
     (Tag_Typ    : Entity_Id;
339
      Renamed_Eq : Entity_Id) return List_Id;
340
   --  Create the bodies of the predefined primitives that are described in
341
   --  Predefined_Primitive_Specs. When not empty, Renamed_Eq must denote
342
   --  the defining unit name of the type's predefined equality as returned
343
   --  by Make_Predefined_Primitive_Specs.
344
 
345
   function Predefined_Primitive_Freeze (Tag_Typ : Entity_Id) return List_Id;
346
   --  Freeze entities of all predefined primitive operations. This is needed
347
   --  because the bodies of these operations do not normally do any freezing.
348
 
349
   function Stream_Operation_OK
350
     (Typ       : Entity_Id;
351
      Operation : TSS_Name_Type) return Boolean;
352
   --  Check whether the named stream operation must be emitted for a given
353
   --  type. The rules for inheritance of stream attributes by type extensions
354
   --  are enforced by this function. Furthermore, various restrictions prevent
355
   --  the generation of these operations, as a useful optimization or for
356
   --  certification purposes.
357
 
358
   ---------------------
359
   -- Add_Final_Chain --
360
   ---------------------
361
 
362
   function Add_Final_Chain (Def_Id : Entity_Id) return Entity_Id is
363
      Loc   : constant Source_Ptr := Sloc (Def_Id);
364
      Flist : Entity_Id;
365
 
366
   begin
367
      Flist :=
368
        Make_Defining_Identifier (Loc,
369
          New_External_Name (Chars (Def_Id), 'L'));
370
 
371
      Append_Freeze_Action (Def_Id,
372
        Make_Object_Declaration (Loc,
373
          Defining_Identifier => Flist,
374
          Object_Definition   =>
375
            New_Reference_To (RTE (RE_List_Controller), Loc)));
376
 
377
      return Flist;
378
   end Add_Final_Chain;
379
 
380
   --------------------------
381
   -- Adjust_Discriminants --
382
   --------------------------
383
 
384
   --  This procedure attempts to define subtypes for discriminants that are
385
   --  more restrictive than those declared. Such a replacement is possible if
386
   --  we can demonstrate that values outside the restricted range would cause
387
   --  constraint errors in any case. The advantage of restricting the
388
   --  discriminant types in this way is that the maximum size of the variant
389
   --  record can be calculated more conservatively.
390
 
391
   --  An example of a situation in which we can perform this type of
392
   --  restriction is the following:
393
 
394
   --    subtype B is range 1 .. 10;
395
   --    type Q is array (B range <>) of Integer;
396
 
397
   --    type V (N : Natural) is record
398
   --       C : Q (1 .. N);
399
   --    end record;
400
 
401
   --  In this situation, we can restrict the upper bound of N to 10, since
402
   --  any larger value would cause a constraint error in any case.
403
 
404
   --  There are many situations in which such restriction is possible, but
405
   --  for now, we just look for cases like the above, where the component
406
   --  in question is a one dimensional array whose upper bound is one of
407
   --  the record discriminants. Also the component must not be part of
408
   --  any variant part, since then the component does not always exist.
409
 
410
   procedure Adjust_Discriminants (Rtype : Entity_Id) is
411
      Loc   : constant Source_Ptr := Sloc (Rtype);
412
      Comp  : Entity_Id;
413
      Ctyp  : Entity_Id;
414
      Ityp  : Entity_Id;
415
      Lo    : Node_Id;
416
      Hi    : Node_Id;
417
      P     : Node_Id;
418
      Loval : Uint;
419
      Discr : Entity_Id;
420
      Dtyp  : Entity_Id;
421
      Dhi   : Node_Id;
422
      Dhiv  : Uint;
423
      Ahi   : Node_Id;
424
      Ahiv  : Uint;
425
      Tnn   : Entity_Id;
426
 
427
   begin
428
      Comp := First_Component (Rtype);
429
      while Present (Comp) loop
430
 
431
         --  If our parent is a variant, quit, we do not look at components
432
         --  that are in variant parts, because they may not always exist.
433
 
434
         P := Parent (Comp);   -- component declaration
435
         P := Parent (P);      -- component list
436
 
437
         exit when Nkind (Parent (P)) = N_Variant;
438
 
439
         --  We are looking for a one dimensional array type
440
 
441
         Ctyp := Etype (Comp);
442
 
443
         if not Is_Array_Type (Ctyp)
444
           or else Number_Dimensions (Ctyp) > 1
445
         then
446
            goto Continue;
447
         end if;
448
 
449
         --  The lower bound must be constant, and the upper bound is a
450
         --  discriminant (which is a discriminant of the current record).
451
 
452
         Ityp := Etype (First_Index (Ctyp));
453
         Lo := Type_Low_Bound (Ityp);
454
         Hi := Type_High_Bound (Ityp);
455
 
456
         if not Compile_Time_Known_Value (Lo)
457
           or else Nkind (Hi) /= N_Identifier
458
           or else No (Entity (Hi))
459
           or else Ekind (Entity (Hi)) /= E_Discriminant
460
         then
461
            goto Continue;
462
         end if;
463
 
464
         --  We have an array with appropriate bounds
465
 
466
         Loval := Expr_Value (Lo);
467
         Discr := Entity (Hi);
468
         Dtyp  := Etype (Discr);
469
 
470
         --  See if the discriminant has a known upper bound
471
 
472
         Dhi := Type_High_Bound (Dtyp);
473
 
474
         if not Compile_Time_Known_Value (Dhi) then
475
            goto Continue;
476
         end if;
477
 
478
         Dhiv := Expr_Value (Dhi);
479
 
480
         --  See if base type of component array has known upper bound
481
 
482
         Ahi := Type_High_Bound (Etype (First_Index (Base_Type (Ctyp))));
483
 
484
         if not Compile_Time_Known_Value (Ahi) then
485
            goto Continue;
486
         end if;
487
 
488
         Ahiv := Expr_Value (Ahi);
489
 
490
         --  The condition for doing the restriction is that the high bound
491
         --  of the discriminant is greater than the low bound of the array,
492
         --  and is also greater than the high bound of the base type index.
493
 
494
         if Dhiv > Loval and then Dhiv > Ahiv then
495
 
496
            --  We can reset the upper bound of the discriminant type to
497
            --  whichever is larger, the low bound of the component, or
498
            --  the high bound of the base type array index.
499
 
500
            --  We build a subtype that is declared as
501
 
502
            --     subtype Tnn is discr_type range discr_type'First .. max;
503
 
504
            --  And insert this declaration into the tree. The type of the
505
            --  discriminant is then reset to this more restricted subtype.
506
 
507
            Tnn := Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
508
 
509
            Insert_Action (Declaration_Node (Rtype),
510
              Make_Subtype_Declaration (Loc,
511
                Defining_Identifier => Tnn,
512
                Subtype_Indication =>
513
                  Make_Subtype_Indication (Loc,
514
                    Subtype_Mark => New_Occurrence_Of (Dtyp, Loc),
515
                    Constraint   =>
516
                      Make_Range_Constraint (Loc,
517
                        Range_Expression =>
518
                          Make_Range (Loc,
519
                            Low_Bound =>
520
                              Make_Attribute_Reference (Loc,
521
                                Attribute_Name => Name_First,
522
                                Prefix => New_Occurrence_Of (Dtyp, Loc)),
523
                            High_Bound =>
524
                              Make_Integer_Literal (Loc,
525
                                Intval => UI_Max (Loval, Ahiv)))))));
526
 
527
            Set_Etype (Discr, Tnn);
528
         end if;
529
 
530
      <<Continue>>
531
         Next_Component (Comp);
532
      end loop;
533
   end Adjust_Discriminants;
534
 
535
   ---------------------------
536
   -- Build_Array_Init_Proc --
537
   ---------------------------
538
 
539
   procedure Build_Array_Init_Proc (A_Type : Entity_Id; Nod : Node_Id) is
540
      Loc              : constant Source_Ptr := Sloc (Nod);
541
      Comp_Type        : constant Entity_Id  := Component_Type (A_Type);
542
      Index_List       : List_Id;
543
      Proc_Id          : Entity_Id;
544
      Body_Stmts       : List_Id;
545
      Has_Default_Init : Boolean;
546
 
547
      function Init_Component return List_Id;
548
      --  Create one statement to initialize one array component, designated
549
      --  by a full set of indices.
550
 
551
      function Init_One_Dimension (N : Int) return List_Id;
552
      --  Create loop to initialize one dimension of the array. The single
553
      --  statement in the loop body initializes the inner dimensions if any,
554
      --  or else the single component. Note that this procedure is called
555
      --  recursively, with N being the dimension to be initialized. A call
556
      --  with N greater than the number of dimensions simply generates the
557
      --  component initialization, terminating the recursion.
558
 
559
      --------------------
560
      -- Init_Component --
561
      --------------------
562
 
563
      function Init_Component return List_Id is
564
         Comp : Node_Id;
565
 
566
      begin
567
         Comp :=
568
           Make_Indexed_Component (Loc,
569
             Prefix => Make_Identifier (Loc, Name_uInit),
570
             Expressions => Index_List);
571
 
572
         if Needs_Simple_Initialization (Comp_Type) then
573
            Set_Assignment_OK (Comp);
574
            return New_List (
575
              Make_Assignment_Statement (Loc,
576
                Name => Comp,
577
                Expression =>
578
                  Get_Simple_Init_Val
579
                    (Comp_Type, Nod, Component_Size (A_Type))));
580
 
581
         else
582
            Clean_Task_Names (Comp_Type, Proc_Id);
583
            return
584
              Build_Initialization_Call
585
                (Loc, Comp, Comp_Type,
586
                 In_Init_Proc => True,
587
                 Enclos_Type  => A_Type);
588
         end if;
589
      end Init_Component;
590
 
591
      ------------------------
592
      -- Init_One_Dimension --
593
      ------------------------
594
 
595
      function Init_One_Dimension (N : Int) return List_Id is
596
         Index      : Entity_Id;
597
 
598
      begin
599
         --  If the component does not need initializing, then there is nothing
600
         --  to do here, so we return a null body. This occurs when generating
601
         --  the dummy Init_Proc needed for Initialize_Scalars processing.
602
 
603
         if not Has_Non_Null_Base_Init_Proc (Comp_Type)
604
           and then not Needs_Simple_Initialization (Comp_Type)
605
           and then not Has_Task (Comp_Type)
606
         then
607
            return New_List (Make_Null_Statement (Loc));
608
 
609
         --  If all dimensions dealt with, we simply initialize the component
610
 
611
         elsif N > Number_Dimensions (A_Type) then
612
            return Init_Component;
613
 
614
         --  Here we generate the required loop
615
 
616
         else
617
            Index :=
618
              Make_Defining_Identifier (Loc, New_External_Name ('J', N));
619
 
620
            Append (New_Reference_To (Index, Loc), Index_List);
621
 
622
            return New_List (
623
              Make_Implicit_Loop_Statement (Nod,
624
                Identifier => Empty,
625
                Iteration_Scheme =>
626
                  Make_Iteration_Scheme (Loc,
627
                    Loop_Parameter_Specification =>
628
                      Make_Loop_Parameter_Specification (Loc,
629
                        Defining_Identifier => Index,
630
                        Discrete_Subtype_Definition =>
631
                          Make_Attribute_Reference (Loc,
632
                            Prefix => Make_Identifier (Loc, Name_uInit),
633
                            Attribute_Name  => Name_Range,
634
                            Expressions => New_List (
635
                              Make_Integer_Literal (Loc, N))))),
636
                Statements =>  Init_One_Dimension (N + 1)));
637
         end if;
638
      end Init_One_Dimension;
639
 
640
   --  Start of processing for Build_Array_Init_Proc
641
 
642
   begin
643
      --  Nothing to generate in the following cases:
644
 
645
      --    1. Initialization is suppressed for the type
646
      --    2. The type is a value type, in the CIL sense.
647
      --    3. The type has CIL/JVM convention.
648
      --    4. An initialization already exists for the base type
649
 
650
      if Suppress_Init_Proc (A_Type)
651
        or else Is_Value_Type (Comp_Type)
652
        or else Convention (A_Type) = Convention_CIL
653
        or else Convention (A_Type) = Convention_Java
654
        or else Present (Base_Init_Proc (A_Type))
655
      then
656
         return;
657
      end if;
658
 
659
      Index_List := New_List;
660
 
661
      --  We need an initialization procedure if any of the following is true:
662
 
663
      --    1. The component type has an initialization procedure
664
      --    2. The component type needs simple initialization
665
      --    3. Tasks are present
666
      --    4. The type is marked as a public entity
667
 
668
      --  The reason for the public entity test is to deal properly with the
669
      --  Initialize_Scalars pragma. This pragma can be set in the client and
670
      --  not in the declaring package, this means the client will make a call
671
      --  to the initialization procedure (because one of conditions 1-3 must
672
      --  apply in this case), and we must generate a procedure (even if it is
673
      --  null) to satisfy the call in this case.
674
 
675
      --  Exception: do not build an array init_proc for a type whose root
676
      --  type is Standard.String or Standard.Wide_[Wide_]String, since there
677
      --  is no place to put the code, and in any case we handle initialization
678
      --  of such types (in the Initialize_Scalars case, that's the only time
679
      --  the issue arises) in a special manner anyway which does not need an
680
      --  init_proc.
681
 
682
      Has_Default_Init := Has_Non_Null_Base_Init_Proc (Comp_Type)
683
                            or else Needs_Simple_Initialization (Comp_Type)
684
                            or else Has_Task (Comp_Type);
685
 
686
      if Has_Default_Init
687
        or else (not Restriction_Active (No_Initialize_Scalars)
688
                  and then Is_Public (A_Type)
689
                  and then Root_Type (A_Type) /= Standard_String
690
                  and then Root_Type (A_Type) /= Standard_Wide_String
691
                  and then Root_Type (A_Type) /= Standard_Wide_Wide_String)
692
      then
693
         Proc_Id :=
694
           Make_Defining_Identifier (Loc,
695
             Chars => Make_Init_Proc_Name (A_Type));
696
 
697
         --  If No_Default_Initialization restriction is active, then we don't
698
         --  want to build an init_proc, but we need to mark that an init_proc
699
         --  would be needed if this restriction was not active (so that we can
700
         --  detect attempts to call it), so set a dummy init_proc in place.
701
         --  This is only done though when actual default initialization is
702
         --  needed (and not done when only Is_Public is True), since otherwise
703
         --  objects such as arrays of scalars could be wrongly flagged as
704
         --  violating the restriction.
705
 
706
         if Restriction_Active (No_Default_Initialization) then
707
            if Has_Default_Init then
708
               Set_Init_Proc (A_Type, Proc_Id);
709
            end if;
710
 
711
            return;
712
         end if;
713
 
714
         Body_Stmts := Init_One_Dimension (1);
715
 
716
         Discard_Node (
717
           Make_Subprogram_Body (Loc,
718
             Specification =>
719
               Make_Procedure_Specification (Loc,
720
                 Defining_Unit_Name => Proc_Id,
721
                 Parameter_Specifications => Init_Formals (A_Type)),
722
             Declarations => New_List,
723
             Handled_Statement_Sequence =>
724
               Make_Handled_Sequence_Of_Statements (Loc,
725
                 Statements => Body_Stmts)));
726
 
727
         Set_Ekind          (Proc_Id, E_Procedure);
728
         Set_Is_Public      (Proc_Id, Is_Public (A_Type));
729
         Set_Is_Internal    (Proc_Id);
730
         Set_Has_Completion (Proc_Id);
731
 
732
         if not Debug_Generated_Code then
733
            Set_Debug_Info_Off (Proc_Id);
734
         end if;
735
 
736
         --  Set inlined unless controlled stuff or tasks around, in which
737
         --  case we do not want to inline, because nested stuff may cause
738
         --  difficulties in inter-unit inlining, and furthermore there is
739
         --  in any case no point in inlining such complex init procs.
740
 
741
         if not Has_Task (Proc_Id)
742
           and then not Needs_Finalization (Proc_Id)
743
         then
744
            Set_Is_Inlined (Proc_Id);
745
         end if;
746
 
747
         --  Associate Init_Proc with type, and determine if the procedure
748
         --  is null (happens because of the Initialize_Scalars pragma case,
749
         --  where we have to generate a null procedure in case it is called
750
         --  by a client with Initialize_Scalars set). Such procedures have
751
         --  to be generated, but do not have to be called, so we mark them
752
         --  as null to suppress the call.
753
 
754
         Set_Init_Proc (A_Type, Proc_Id);
755
 
756
         if List_Length (Body_Stmts) = 1
757
 
758
           --  We must skip SCIL nodes because they may have been added to this
759
           --  list by Insert_Actions.
760
 
761
           and then Nkind (First_Non_SCIL_Node (Body_Stmts)) = N_Null_Statement
762
         then
763
            Set_Is_Null_Init_Proc (Proc_Id);
764
 
765
         else
766
            --  Try to build a static aggregate to initialize statically
767
            --  objects of the type. This can only be done for constrained
768
            --  one-dimensional arrays with static bounds.
769
 
770
            Set_Static_Initialization
771
              (Proc_Id,
772
               Build_Equivalent_Array_Aggregate (First_Subtype (A_Type)));
773
         end if;
774
      end if;
775
   end Build_Array_Init_Proc;
776
 
777
   -----------------------------
778
   -- Build_Class_Wide_Master --
779
   -----------------------------
780
 
781
   procedure Build_Class_Wide_Master (T : Entity_Id) is
782
      Loc  : constant Source_Ptr := Sloc (T);
783
      M_Id : Entity_Id;
784
      Decl : Node_Id;
785
      P    : Node_Id;
786
      Par  : Node_Id;
787
 
788
   begin
789
      --  Nothing to do if there is no task hierarchy
790
 
791
      if Restriction_Active (No_Task_Hierarchy) then
792
         return;
793
      end if;
794
 
795
      --  Find declaration that created the access type: either a type
796
      --  declaration, or an object declaration with an access definition,
797
      --  in which case the type is anonymous.
798
 
799
      if Is_Itype (T) then
800
         P := Associated_Node_For_Itype (T);
801
      else
802
         P := Parent (T);
803
      end if;
804
 
805
      --  Nothing to do if we already built a master entity for this scope
806
 
807
      if not Has_Master_Entity (Scope (T)) then
808
 
809
         --  First build the master entity
810
         --    _Master : constant Master_Id := Current_Master.all;
811
         --  and insert it just before the current declaration.
812
 
813
         Decl :=
814
           Make_Object_Declaration (Loc,
815
             Defining_Identifier =>
816
               Make_Defining_Identifier (Loc, Name_uMaster),
817
             Constant_Present => True,
818
             Object_Definition => New_Reference_To (Standard_Integer, Loc),
819
             Expression =>
820
               Make_Explicit_Dereference (Loc,
821
                 New_Reference_To (RTE (RE_Current_Master), Loc)));
822
 
823
         Insert_Action (P, Decl);
824
         Analyze (Decl);
825
         Set_Has_Master_Entity (Scope (T));
826
 
827
         --  Now mark the containing scope as a task master. Masters
828
         --  associated with return statements are already marked at
829
         --  this stage (see Analyze_Subprogram_Body).
830
 
831
         if Ekind (Current_Scope) /= E_Return_Statement then
832
            Par := P;
833
            while Nkind (Par) /= N_Compilation_Unit loop
834
               Par := Parent (Par);
835
 
836
            --  If we fall off the top, we are at the outer level, and the
837
            --  environment task is our effective master, so nothing to mark.
838
 
839
               if Nkind_In
840
                   (Par, N_Task_Body, N_Block_Statement, N_Subprogram_Body)
841
               then
842
                  Set_Is_Task_Master (Par, True);
843
                  exit;
844
               end if;
845
            end loop;
846
         end if;
847
      end if;
848
 
849
      --  Now define the renaming of the master_id
850
 
851
      M_Id :=
852
        Make_Defining_Identifier (Loc,
853
          New_External_Name (Chars (T), 'M'));
854
 
855
      Decl :=
856
        Make_Object_Renaming_Declaration (Loc,
857
          Defining_Identifier => M_Id,
858
          Subtype_Mark => New_Reference_To (Standard_Integer, Loc),
859
          Name => Make_Identifier (Loc, Name_uMaster));
860
      Insert_Before (P, Decl);
861
      Analyze (Decl);
862
 
863
      Set_Master_Id (T, M_Id);
864
 
865
   exception
866
      when RE_Not_Available =>
867
         return;
868
   end Build_Class_Wide_Master;
869
 
870
   --------------------------------
871
   -- Build_Discr_Checking_Funcs --
872
   --------------------------------
873
 
874
   procedure Build_Discr_Checking_Funcs (N : Node_Id) is
875
      Rec_Id            : Entity_Id;
876
      Loc               : Source_Ptr;
877
      Enclosing_Func_Id : Entity_Id;
878
      Sequence          : Nat     := 1;
879
      Type_Def          : Node_Id;
880
      V                 : Node_Id;
881
 
882
      function Build_Case_Statement
883
        (Case_Id : Entity_Id;
884
         Variant : Node_Id) return Node_Id;
885
      --  Build a case statement containing only two alternatives. The first
886
      --  alternative corresponds exactly to the discrete choices given on the
887
      --  variant with contains the components that we are generating the
888
      --  checks for. If the discriminant is one of these return False. The
889
      --  second alternative is an OTHERS choice that will return True
890
      --  indicating the discriminant did not match.
891
 
892
      function Build_Dcheck_Function
893
        (Case_Id : Entity_Id;
894
         Variant : Node_Id) return Entity_Id;
895
      --  Build the discriminant checking function for a given variant
896
 
897
      procedure Build_Dcheck_Functions (Variant_Part_Node : Node_Id);
898
      --  Builds the discriminant checking function for each variant of the
899
      --  given variant part of the record type.
900
 
901
      --------------------------
902
      -- Build_Case_Statement --
903
      --------------------------
904
 
905
      function Build_Case_Statement
906
        (Case_Id : Entity_Id;
907
         Variant : Node_Id) return Node_Id
908
      is
909
         Alt_List       : constant List_Id := New_List;
910
         Actuals_List   : List_Id;
911
         Case_Node      : Node_Id;
912
         Case_Alt_Node  : Node_Id;
913
         Choice         : Node_Id;
914
         Choice_List    : List_Id;
915
         D              : Entity_Id;
916
         Return_Node    : Node_Id;
917
 
918
      begin
919
         Case_Node := New_Node (N_Case_Statement, Loc);
920
 
921
         --  Replace the discriminant which controls the variant, with the name
922
         --  of the formal of the checking function.
923
 
924
         Set_Expression (Case_Node,
925
           Make_Identifier (Loc, Chars (Case_Id)));
926
 
927
         Choice := First (Discrete_Choices (Variant));
928
 
929
         if Nkind (Choice) = N_Others_Choice then
930
            Choice_List := New_Copy_List (Others_Discrete_Choices (Choice));
931
         else
932
            Choice_List := New_Copy_List (Discrete_Choices (Variant));
933
         end if;
934
 
935
         if not Is_Empty_List (Choice_List) then
936
            Case_Alt_Node := New_Node (N_Case_Statement_Alternative, Loc);
937
            Set_Discrete_Choices (Case_Alt_Node, Choice_List);
938
 
939
            --  In case this is a nested variant, we need to return the result
940
            --  of the discriminant checking function for the immediately
941
            --  enclosing variant.
942
 
943
            if Present (Enclosing_Func_Id) then
944
               Actuals_List := New_List;
945
 
946
               D := First_Discriminant (Rec_Id);
947
               while Present (D) loop
948
                  Append (Make_Identifier (Loc, Chars (D)), Actuals_List);
949
                  Next_Discriminant (D);
950
               end loop;
951
 
952
               Return_Node :=
953
                 Make_Simple_Return_Statement (Loc,
954
                   Expression =>
955
                     Make_Function_Call (Loc,
956
                       Name =>
957
                         New_Reference_To (Enclosing_Func_Id,  Loc),
958
                       Parameter_Associations =>
959
                         Actuals_List));
960
 
961
            else
962
               Return_Node :=
963
                 Make_Simple_Return_Statement (Loc,
964
                   Expression =>
965
                     New_Reference_To (Standard_False, Loc));
966
            end if;
967
 
968
            Set_Statements (Case_Alt_Node, New_List (Return_Node));
969
            Append (Case_Alt_Node, Alt_List);
970
         end if;
971
 
972
         Case_Alt_Node := New_Node (N_Case_Statement_Alternative, Loc);
973
         Choice_List := New_List (New_Node (N_Others_Choice, Loc));
974
         Set_Discrete_Choices (Case_Alt_Node, Choice_List);
975
 
976
         Return_Node :=
977
           Make_Simple_Return_Statement (Loc,
978
             Expression =>
979
               New_Reference_To (Standard_True, Loc));
980
 
981
         Set_Statements (Case_Alt_Node, New_List (Return_Node));
982
         Append (Case_Alt_Node, Alt_List);
983
 
984
         Set_Alternatives (Case_Node, Alt_List);
985
         return Case_Node;
986
      end Build_Case_Statement;
987
 
988
      ---------------------------
989
      -- Build_Dcheck_Function --
990
      ---------------------------
991
 
992
      function Build_Dcheck_Function
993
        (Case_Id : Entity_Id;
994
         Variant : Node_Id) return Entity_Id
995
      is
996
         Body_Node           : Node_Id;
997
         Func_Id             : Entity_Id;
998
         Parameter_List      : List_Id;
999
         Spec_Node           : Node_Id;
1000
 
1001
      begin
1002
         Body_Node := New_Node (N_Subprogram_Body, Loc);
1003
         Sequence := Sequence + 1;
1004
 
1005
         Func_Id :=
1006
           Make_Defining_Identifier (Loc,
1007
             Chars => New_External_Name (Chars (Rec_Id), 'D', Sequence));
1008
 
1009
         Spec_Node := New_Node (N_Function_Specification, Loc);
1010
         Set_Defining_Unit_Name (Spec_Node, Func_Id);
1011
 
1012
         Parameter_List := Build_Discriminant_Formals (Rec_Id, False);
1013
 
1014
         Set_Parameter_Specifications (Spec_Node, Parameter_List);
1015
         Set_Result_Definition (Spec_Node,
1016
                                New_Reference_To (Standard_Boolean,  Loc));
1017
         Set_Specification (Body_Node, Spec_Node);
1018
         Set_Declarations (Body_Node, New_List);
1019
 
1020
         Set_Handled_Statement_Sequence (Body_Node,
1021
           Make_Handled_Sequence_Of_Statements (Loc,
1022
             Statements => New_List (
1023
               Build_Case_Statement (Case_Id, Variant))));
1024
 
1025
         Set_Ekind       (Func_Id, E_Function);
1026
         Set_Mechanism   (Func_Id, Default_Mechanism);
1027
         Set_Is_Inlined  (Func_Id, True);
1028
         Set_Is_Pure     (Func_Id, True);
1029
         Set_Is_Public   (Func_Id, Is_Public (Rec_Id));
1030
         Set_Is_Internal (Func_Id, True);
1031
 
1032
         if not Debug_Generated_Code then
1033
            Set_Debug_Info_Off (Func_Id);
1034
         end if;
1035
 
1036
         Analyze (Body_Node);
1037
 
1038
         Append_Freeze_Action (Rec_Id, Body_Node);
1039
         Set_Dcheck_Function (Variant, Func_Id);
1040
         return Func_Id;
1041
      end Build_Dcheck_Function;
1042
 
1043
      ----------------------------
1044
      -- Build_Dcheck_Functions --
1045
      ----------------------------
1046
 
1047
      procedure Build_Dcheck_Functions (Variant_Part_Node : Node_Id) is
1048
         Component_List_Node : Node_Id;
1049
         Decl                : Entity_Id;
1050
         Discr_Name          : Entity_Id;
1051
         Func_Id             : Entity_Id;
1052
         Variant             : Node_Id;
1053
         Saved_Enclosing_Func_Id : Entity_Id;
1054
 
1055
      begin
1056
         --  Build the discriminant-checking function for each variant, and
1057
         --  label all components of that variant with the function's name.
1058
         --  We only Generate a discriminant-checking function when the
1059
         --  variant is not empty, to prevent the creation of dead code.
1060
         --  The exception to that is when Frontend_Layout_On_Target is set,
1061
         --  because the variant record size function generated in package
1062
         --  Layout needs to generate calls to all discriminant-checking
1063
         --  functions, including those for empty variants.
1064
 
1065
         Discr_Name := Entity (Name (Variant_Part_Node));
1066
         Variant := First_Non_Pragma (Variants (Variant_Part_Node));
1067
 
1068
         while Present (Variant) loop
1069
            Component_List_Node := Component_List (Variant);
1070
 
1071
            if not Null_Present (Component_List_Node)
1072
              or else Frontend_Layout_On_Target
1073
            then
1074
               Func_Id := Build_Dcheck_Function (Discr_Name, Variant);
1075
               Decl :=
1076
                 First_Non_Pragma (Component_Items (Component_List_Node));
1077
 
1078
               while Present (Decl) loop
1079
                  Set_Discriminant_Checking_Func
1080
                    (Defining_Identifier (Decl), Func_Id);
1081
 
1082
                  Next_Non_Pragma (Decl);
1083
               end loop;
1084
 
1085
               if Present (Variant_Part (Component_List_Node)) then
1086
                  Saved_Enclosing_Func_Id := Enclosing_Func_Id;
1087
                  Enclosing_Func_Id := Func_Id;
1088
                  Build_Dcheck_Functions (Variant_Part (Component_List_Node));
1089
                  Enclosing_Func_Id := Saved_Enclosing_Func_Id;
1090
               end if;
1091
            end if;
1092
 
1093
            Next_Non_Pragma (Variant);
1094
         end loop;
1095
      end Build_Dcheck_Functions;
1096
 
1097
   --  Start of processing for Build_Discr_Checking_Funcs
1098
 
1099
   begin
1100
      --  Only build if not done already
1101
 
1102
      if not Discr_Check_Funcs_Built (N) then
1103
         Type_Def := Type_Definition (N);
1104
 
1105
         if Nkind (Type_Def) = N_Record_Definition then
1106
            if No (Component_List (Type_Def)) then   -- null record.
1107
               return;
1108
            else
1109
               V := Variant_Part (Component_List (Type_Def));
1110
            end if;
1111
 
1112
         else pragma Assert (Nkind (Type_Def) = N_Derived_Type_Definition);
1113
            if No (Component_List (Record_Extension_Part (Type_Def))) then
1114
               return;
1115
            else
1116
               V := Variant_Part
1117
                      (Component_List (Record_Extension_Part (Type_Def)));
1118
            end if;
1119
         end if;
1120
 
1121
         Rec_Id := Defining_Identifier (N);
1122
 
1123
         if Present (V) and then not Is_Unchecked_Union (Rec_Id) then
1124
            Loc := Sloc (N);
1125
            Enclosing_Func_Id := Empty;
1126
            Build_Dcheck_Functions (V);
1127
         end if;
1128
 
1129
         Set_Discr_Check_Funcs_Built (N);
1130
      end if;
1131
   end Build_Discr_Checking_Funcs;
1132
 
1133
   --------------------------------
1134
   -- Build_Discriminant_Formals --
1135
   --------------------------------
1136
 
1137
   function Build_Discriminant_Formals
1138
     (Rec_Id : Entity_Id;
1139
      Use_Dl : Boolean) return List_Id
1140
   is
1141
      Loc             : Source_Ptr       := Sloc (Rec_Id);
1142
      Parameter_List  : constant List_Id := New_List;
1143
      D               : Entity_Id;
1144
      Formal          : Entity_Id;
1145
      Formal_Type     : Entity_Id;
1146
      Param_Spec_Node : Node_Id;
1147
 
1148
   begin
1149
      if Has_Discriminants (Rec_Id) then
1150
         D := First_Discriminant (Rec_Id);
1151
         while Present (D) loop
1152
            Loc := Sloc (D);
1153
 
1154
            if Use_Dl then
1155
               Formal := Discriminal (D);
1156
               Formal_Type := Etype (Formal);
1157
            else
1158
               Formal := Make_Defining_Identifier (Loc, Chars (D));
1159
               Formal_Type := Etype (D);
1160
            end if;
1161
 
1162
            Param_Spec_Node :=
1163
              Make_Parameter_Specification (Loc,
1164
                  Defining_Identifier => Formal,
1165
                Parameter_Type =>
1166
                  New_Reference_To (Formal_Type, Loc));
1167
            Append (Param_Spec_Node, Parameter_List);
1168
            Next_Discriminant (D);
1169
         end loop;
1170
      end if;
1171
 
1172
      return Parameter_List;
1173
   end Build_Discriminant_Formals;
1174
 
1175
   --------------------------------------
1176
   -- Build_Equivalent_Array_Aggregate --
1177
   --------------------------------------
1178
 
1179
   function Build_Equivalent_Array_Aggregate (T : Entity_Id) return Node_Id is
1180
      Loc        : constant Source_Ptr := Sloc (T);
1181
      Comp_Type  : constant Entity_Id := Component_Type (T);
1182
      Index_Type : constant Entity_Id := Etype (First_Index (T));
1183
      Proc       : constant Entity_Id := Base_Init_Proc (T);
1184
      Lo, Hi     : Node_Id;
1185
      Aggr       : Node_Id;
1186
      Expr       : Node_Id;
1187
 
1188
   begin
1189
      if not Is_Constrained (T)
1190
        or else Number_Dimensions (T) > 1
1191
        or else No (Proc)
1192
      then
1193
         Initialization_Warning (T);
1194
         return Empty;
1195
      end if;
1196
 
1197
      Lo := Type_Low_Bound  (Index_Type);
1198
      Hi := Type_High_Bound (Index_Type);
1199
 
1200
      if not Compile_Time_Known_Value (Lo)
1201
        or else not Compile_Time_Known_Value (Hi)
1202
      then
1203
         Initialization_Warning (T);
1204
         return Empty;
1205
      end if;
1206
 
1207
      if Is_Record_Type (Comp_Type)
1208
        and then Present (Base_Init_Proc (Comp_Type))
1209
      then
1210
         Expr := Static_Initialization (Base_Init_Proc (Comp_Type));
1211
 
1212
         if No (Expr) then
1213
            Initialization_Warning (T);
1214
            return Empty;
1215
         end if;
1216
 
1217
      else
1218
         Initialization_Warning (T);
1219
         return Empty;
1220
      end if;
1221
 
1222
      Aggr := Make_Aggregate (Loc, No_List, New_List);
1223
      Set_Etype (Aggr, T);
1224
      Set_Aggregate_Bounds (Aggr,
1225
        Make_Range (Loc,
1226
          Low_Bound  => New_Copy (Lo),
1227
          High_Bound => New_Copy (Hi)));
1228
      Set_Parent (Aggr, Parent (Proc));
1229
 
1230
      Append_To (Component_Associations (Aggr),
1231
         Make_Component_Association (Loc,
1232
              Choices =>
1233
                 New_List (
1234
                   Make_Range (Loc,
1235
                     Low_Bound  => New_Copy (Lo),
1236
                     High_Bound => New_Copy (Hi))),
1237
              Expression => Expr));
1238
 
1239
      if Static_Array_Aggregate (Aggr) then
1240
         return Aggr;
1241
      else
1242
         Initialization_Warning (T);
1243
         return Empty;
1244
      end if;
1245
   end Build_Equivalent_Array_Aggregate;
1246
 
1247
   ---------------------------------------
1248
   -- Build_Equivalent_Record_Aggregate --
1249
   ---------------------------------------
1250
 
1251
   function Build_Equivalent_Record_Aggregate (T : Entity_Id) return Node_Id is
1252
      Agg       : Node_Id;
1253
      Comp      : Entity_Id;
1254
      Comp_Type : Entity_Id;
1255
 
1256
      --  Start of processing for Build_Equivalent_Record_Aggregate
1257
 
1258
   begin
1259
      if not Is_Record_Type (T)
1260
        or else Has_Discriminants (T)
1261
        or else Is_Limited_Type (T)
1262
        or else Has_Non_Standard_Rep (T)
1263
      then
1264
         Initialization_Warning (T);
1265
         return Empty;
1266
      end if;
1267
 
1268
      Comp := First_Component (T);
1269
 
1270
      --  A null record needs no warning
1271
 
1272
      if No (Comp) then
1273
         return Empty;
1274
      end if;
1275
 
1276
      while Present (Comp) loop
1277
 
1278
         --  Array components are acceptable if initialized by a positional
1279
         --  aggregate with static components.
1280
 
1281
         if Is_Array_Type (Etype (Comp)) then
1282
            Comp_Type := Component_Type (Etype (Comp));
1283
 
1284
            if Nkind (Parent (Comp)) /= N_Component_Declaration
1285
              or else No (Expression (Parent (Comp)))
1286
              or else Nkind (Expression (Parent (Comp))) /= N_Aggregate
1287
            then
1288
               Initialization_Warning (T);
1289
               return Empty;
1290
 
1291
            elsif Is_Scalar_Type (Component_Type (Etype (Comp)))
1292
               and then
1293
                 (not Compile_Time_Known_Value (Type_Low_Bound (Comp_Type))
1294
                   or else
1295
                  not Compile_Time_Known_Value (Type_High_Bound (Comp_Type)))
1296
            then
1297
               Initialization_Warning (T);
1298
               return Empty;
1299
 
1300
            elsif
1301
              not Static_Array_Aggregate (Expression (Parent (Comp)))
1302
            then
1303
               Initialization_Warning (T);
1304
               return Empty;
1305
            end if;
1306
 
1307
         elsif Is_Scalar_Type (Etype (Comp)) then
1308
            Comp_Type := Etype (Comp);
1309
 
1310
            if Nkind (Parent (Comp)) /= N_Component_Declaration
1311
              or else No (Expression (Parent (Comp)))
1312
              or else not Compile_Time_Known_Value (Expression (Parent (Comp)))
1313
              or else not Compile_Time_Known_Value (Type_Low_Bound (Comp_Type))
1314
              or else not
1315
                Compile_Time_Known_Value (Type_High_Bound (Comp_Type))
1316
            then
1317
               Initialization_Warning (T);
1318
               return Empty;
1319
            end if;
1320
 
1321
         --  For now, other types are excluded
1322
 
1323
         else
1324
            Initialization_Warning (T);
1325
            return Empty;
1326
         end if;
1327
 
1328
         Next_Component (Comp);
1329
      end loop;
1330
 
1331
      --  All components have static initialization. Build positional aggregate
1332
      --  from the given expressions or defaults.
1333
 
1334
      Agg := Make_Aggregate (Sloc (T), New_List, New_List);
1335
      Set_Parent (Agg, Parent (T));
1336
 
1337
      Comp := First_Component (T);
1338
      while Present (Comp) loop
1339
         Append
1340
           (New_Copy_Tree (Expression (Parent (Comp))), Expressions (Agg));
1341
         Next_Component (Comp);
1342
      end loop;
1343
 
1344
      Analyze_And_Resolve (Agg, T);
1345
      return Agg;
1346
   end Build_Equivalent_Record_Aggregate;
1347
 
1348
   -------------------------------
1349
   -- Build_Initialization_Call --
1350
   -------------------------------
1351
 
1352
   --  References to a discriminant inside the record type declaration can
1353
   --  appear either in the subtype_indication to constrain a record or an
1354
   --  array, or as part of a larger expression given for the initial value
1355
   --  of a component. In both of these cases N appears in the record
1356
   --  initialization procedure and needs to be replaced by the formal
1357
   --  parameter of the initialization procedure which corresponds to that
1358
   --  discriminant.
1359
 
1360
   --  In the example below, references to discriminants D1 and D2 in proc_1
1361
   --  are replaced by references to formals with the same name
1362
   --  (discriminals)
1363
 
1364
   --  A similar replacement is done for calls to any record initialization
1365
   --  procedure for any components that are themselves of a record type.
1366
 
1367
   --  type R (D1, D2 : Integer) is record
1368
   --     X : Integer := F * D1;
1369
   --     Y : Integer := F * D2;
1370
   --  end record;
1371
 
1372
   --  procedure proc_1 (Out_2 : out R; D1 : Integer; D2 : Integer) is
1373
   --  begin
1374
   --     Out_2.D1 := D1;
1375
   --     Out_2.D2 := D2;
1376
   --     Out_2.X := F * D1;
1377
   --     Out_2.Y := F * D2;
1378
   --  end;
1379
 
1380
   function Build_Initialization_Call
1381
     (Loc               : Source_Ptr;
1382
      Id_Ref            : Node_Id;
1383
      Typ               : Entity_Id;
1384
      In_Init_Proc      : Boolean := False;
1385
      Enclos_Type       : Entity_Id := Empty;
1386
      Discr_Map         : Elist_Id := New_Elmt_List;
1387
      With_Default_Init : Boolean := False;
1388
      Constructor_Ref   : Node_Id := Empty) return List_Id
1389
   is
1390
      Res            : constant List_Id := New_List;
1391
      Arg            : Node_Id;
1392
      Args           : List_Id;
1393
      Controller_Typ : Entity_Id;
1394
      Decl           : Node_Id;
1395
      Decls          : List_Id;
1396
      Discr          : Entity_Id;
1397
      First_Arg      : Node_Id;
1398
      Full_Init_Type : Entity_Id;
1399
      Full_Type      : Entity_Id := Typ;
1400
      Init_Type      : Entity_Id;
1401
      Proc           : Entity_Id;
1402
 
1403
   begin
1404
      pragma Assert (Constructor_Ref = Empty
1405
        or else Is_CPP_Constructor_Call (Constructor_Ref));
1406
 
1407
      if No (Constructor_Ref) then
1408
         Proc := Base_Init_Proc (Typ);
1409
      else
1410
         Proc := Base_Init_Proc (Typ, Entity (Name (Constructor_Ref)));
1411
      end if;
1412
 
1413
      pragma Assert (Present (Proc));
1414
      Init_Type      := Etype (First_Formal (Proc));
1415
      Full_Init_Type := Underlying_Type (Init_Type);
1416
 
1417
      --  Nothing to do if the Init_Proc is null, unless Initialize_Scalars
1418
      --  is active (in which case we make the call anyway, since in the
1419
      --  actual compiled client it may be non null).
1420
      --  Also nothing to do for value types.
1421
 
1422
      if (Is_Null_Init_Proc (Proc) and then not Init_Or_Norm_Scalars)
1423
        or else Is_Value_Type (Typ)
1424
        or else
1425
          (Is_Array_Type (Typ) and then Is_Value_Type (Component_Type (Typ)))
1426
      then
1427
         return Empty_List;
1428
      end if;
1429
 
1430
      --  Go to full view if private type. In the case of successive
1431
      --  private derivations, this can require more than one step.
1432
 
1433
      while Is_Private_Type (Full_Type)
1434
        and then Present (Full_View (Full_Type))
1435
      loop
1436
         Full_Type := Full_View (Full_Type);
1437
      end loop;
1438
 
1439
      --  If Typ is derived, the procedure is the initialization procedure for
1440
      --  the root type. Wrap the argument in an conversion to make it type
1441
      --  honest. Actually it isn't quite type honest, because there can be
1442
      --  conflicts of views in the private type case. That is why we set
1443
      --  Conversion_OK in the conversion node.
1444
 
1445
      if (Is_Record_Type (Typ)
1446
           or else Is_Array_Type (Typ)
1447
           or else Is_Private_Type (Typ))
1448
        and then Init_Type /= Base_Type (Typ)
1449
      then
1450
         First_Arg := OK_Convert_To (Etype (Init_Type), Id_Ref);
1451
         Set_Etype (First_Arg, Init_Type);
1452
 
1453
      else
1454
         First_Arg := Id_Ref;
1455
      end if;
1456
 
1457
      Args := New_List (Convert_Concurrent (First_Arg, Typ));
1458
 
1459
      --  In the tasks case, add _Master as the value of the _Master parameter
1460
      --  and _Chain as the value of the _Chain parameter. At the outer level,
1461
      --  these will be variables holding the corresponding values obtained
1462
      --  from GNARL. At inner levels, they will be the parameters passed down
1463
      --  through the outer routines.
1464
 
1465
      if Has_Task (Full_Type) then
1466
         if Restriction_Active (No_Task_Hierarchy) then
1467
 
1468
            --  See comments in System.Tasking.Initialization.Init_RTS
1469
            --  for the value 3 (should be rtsfindable constant ???)
1470
 
1471
            Append_To (Args, Make_Integer_Literal (Loc, 3));
1472
 
1473
         else
1474
            Append_To (Args, Make_Identifier (Loc, Name_uMaster));
1475
         end if;
1476
 
1477
         Append_To (Args, Make_Identifier (Loc, Name_uChain));
1478
 
1479
         --  Ada 2005 (AI-287): In case of default initialized components
1480
         --  with tasks, we generate a null string actual parameter.
1481
         --  This is just a workaround that must be improved later???
1482
 
1483
         if With_Default_Init then
1484
            Append_To (Args,
1485
              Make_String_Literal (Loc,
1486
                Strval => ""));
1487
 
1488
         else
1489
            Decls :=
1490
              Build_Task_Image_Decls (Loc, Id_Ref, Enclos_Type, In_Init_Proc);
1491
            Decl  := Last (Decls);
1492
 
1493
            Append_To (Args,
1494
              New_Occurrence_Of (Defining_Identifier (Decl), Loc));
1495
            Append_List (Decls, Res);
1496
         end if;
1497
 
1498
      else
1499
         Decls := No_List;
1500
         Decl  := Empty;
1501
      end if;
1502
 
1503
      --  Add discriminant values if discriminants are present
1504
 
1505
      if Has_Discriminants (Full_Init_Type) then
1506
         Discr := First_Discriminant (Full_Init_Type);
1507
 
1508
         while Present (Discr) loop
1509
 
1510
            --  If this is a discriminated concurrent type, the init_proc
1511
            --  for the corresponding record is being called. Use that type
1512
            --  directly to find the discriminant value, to handle properly
1513
            --  intervening renamed discriminants.
1514
 
1515
            declare
1516
               T : Entity_Id := Full_Type;
1517
 
1518
            begin
1519
               if Is_Protected_Type (T) then
1520
                  T := Corresponding_Record_Type (T);
1521
 
1522
               elsif Is_Private_Type (T)
1523
                 and then Present (Underlying_Full_View (T))
1524
                 and then Is_Protected_Type (Underlying_Full_View (T))
1525
               then
1526
                  T := Corresponding_Record_Type (Underlying_Full_View (T));
1527
               end if;
1528
 
1529
               Arg :=
1530
                 Get_Discriminant_Value (
1531
                   Discr,
1532
                   T,
1533
                   Discriminant_Constraint (Full_Type));
1534
            end;
1535
 
1536
            if In_Init_Proc then
1537
 
1538
               --  Replace any possible references to the discriminant in the
1539
               --  call to the record initialization procedure with references
1540
               --  to the appropriate formal parameter.
1541
 
1542
               if Nkind (Arg) = N_Identifier
1543
                  and then Ekind (Entity (Arg)) = E_Discriminant
1544
               then
1545
                  Arg := New_Reference_To (Discriminal (Entity (Arg)), Loc);
1546
 
1547
               --  Case of access discriminants. We replace the reference
1548
               --  to the type by a reference to the actual object
1549
 
1550
               elsif Nkind (Arg) = N_Attribute_Reference
1551
                 and then Is_Access_Type (Etype (Arg))
1552
                 and then Is_Entity_Name (Prefix (Arg))
1553
                 and then Is_Type (Entity (Prefix (Arg)))
1554
               then
1555
                  Arg :=
1556
                    Make_Attribute_Reference (Loc,
1557
                      Prefix         => New_Copy (Prefix (Id_Ref)),
1558
                      Attribute_Name => Name_Unrestricted_Access);
1559
 
1560
               --  Otherwise make a copy of the default expression. Note that
1561
               --  we use the current Sloc for this, because we do not want the
1562
               --  call to appear to be at the declaration point. Within the
1563
               --  expression, replace discriminants with their discriminals.
1564
 
1565
               else
1566
                  Arg :=
1567
                    New_Copy_Tree (Arg, Map => Discr_Map, New_Sloc => Loc);
1568
               end if;
1569
 
1570
            else
1571
               if Is_Constrained (Full_Type) then
1572
                  Arg := Duplicate_Subexpr_No_Checks (Arg);
1573
               else
1574
                  --  The constraints come from the discriminant default exps,
1575
                  --  they must be reevaluated, so we use New_Copy_Tree but we
1576
                  --  ensure the proper Sloc (for any embedded calls).
1577
 
1578
                  Arg := New_Copy_Tree (Arg, New_Sloc => Loc);
1579
               end if;
1580
            end if;
1581
 
1582
            --  Ada 2005 (AI-287): In case of default initialized components,
1583
            --  if the component is constrained with a discriminant of the
1584
            --  enclosing type, we need to generate the corresponding selected
1585
            --  component node to access the discriminant value. In other cases
1586
            --  this is not required, either  because we are inside the init
1587
            --  proc and we use the corresponding formal, or else because the
1588
            --  component is constrained by an expression.
1589
 
1590
            if With_Default_Init
1591
              and then Nkind (Id_Ref) = N_Selected_Component
1592
              and then Nkind (Arg) = N_Identifier
1593
              and then Ekind (Entity (Arg)) = E_Discriminant
1594
            then
1595
               Append_To (Args,
1596
                 Make_Selected_Component (Loc,
1597
                   Prefix => New_Copy_Tree (Prefix (Id_Ref)),
1598
                   Selector_Name => Arg));
1599
            else
1600
               Append_To (Args, Arg);
1601
            end if;
1602
 
1603
            Next_Discriminant (Discr);
1604
         end loop;
1605
      end if;
1606
 
1607
      --  If this is a call to initialize the parent component of a derived
1608
      --  tagged type, indicate that the tag should not be set in the parent.
1609
 
1610
      if Is_Tagged_Type (Full_Init_Type)
1611
        and then not Is_CPP_Class (Full_Init_Type)
1612
        and then Nkind (Id_Ref) = N_Selected_Component
1613
        and then Chars (Selector_Name (Id_Ref)) = Name_uParent
1614
      then
1615
         Append_To (Args, New_Occurrence_Of (Standard_False, Loc));
1616
 
1617
      elsif Present (Constructor_Ref) then
1618
         Append_List_To (Args,
1619
           New_Copy_List (Parameter_Associations (Constructor_Ref)));
1620
      end if;
1621
 
1622
      Append_To (Res,
1623
        Make_Procedure_Call_Statement (Loc,
1624
          Name => New_Occurrence_Of (Proc, Loc),
1625
          Parameter_Associations => Args));
1626
 
1627
      if Needs_Finalization (Typ)
1628
        and then Nkind (Id_Ref) = N_Selected_Component
1629
      then
1630
         if Chars (Selector_Name (Id_Ref)) /= Name_uParent then
1631
            Append_List_To (Res,
1632
              Make_Init_Call (
1633
                Ref         => New_Copy_Tree (First_Arg),
1634
                Typ         => Typ,
1635
                Flist_Ref   =>
1636
                  Find_Final_List (Typ, New_Copy_Tree (First_Arg)),
1637
                With_Attach => Make_Integer_Literal (Loc, 1)));
1638
 
1639
         --  If the enclosing type is an extension with new controlled
1640
         --  components, it has his own record controller. If the parent
1641
         --  also had a record controller, attach it to the new one.
1642
 
1643
         --  Build_Init_Statements relies on the fact that in this specific
1644
         --  case the last statement of the result is the attach call to
1645
         --  the controller. If this is changed, it must be synchronized.
1646
 
1647
         elsif Present (Enclos_Type)
1648
           and then Has_New_Controlled_Component (Enclos_Type)
1649
           and then Has_Controlled_Component (Typ)
1650
         then
1651
            if Is_Inherently_Limited_Type (Typ) then
1652
               Controller_Typ := RTE (RE_Limited_Record_Controller);
1653
            else
1654
               Controller_Typ := RTE (RE_Record_Controller);
1655
            end if;
1656
 
1657
            Append_List_To (Res,
1658
              Make_Init_Call (
1659
                Ref       =>
1660
                  Make_Selected_Component (Loc,
1661
                    Prefix        => New_Copy_Tree (First_Arg),
1662
                    Selector_Name => Make_Identifier (Loc, Name_uController)),
1663
                Typ       => Controller_Typ,
1664
                Flist_Ref => Find_Final_List (Typ, New_Copy_Tree (First_Arg)),
1665
                With_Attach => Make_Integer_Literal (Loc, 1)));
1666
         end if;
1667
      end if;
1668
 
1669
      return Res;
1670
 
1671
   exception
1672
      when RE_Not_Available =>
1673
         return Empty_List;
1674
   end Build_Initialization_Call;
1675
 
1676
   ---------------------------
1677
   -- Build_Master_Renaming --
1678
   ---------------------------
1679
 
1680
   function Build_Master_Renaming
1681
     (N : Node_Id;
1682
      T : Entity_Id) return Entity_Id
1683
   is
1684
      Loc  : constant Source_Ptr := Sloc (N);
1685
      M_Id : Entity_Id;
1686
      Decl : Node_Id;
1687
 
1688
   begin
1689
      --  Nothing to do if there is no task hierarchy
1690
 
1691
      if Restriction_Active (No_Task_Hierarchy) then
1692
         return Empty;
1693
      end if;
1694
 
1695
      M_Id :=
1696
        Make_Defining_Identifier (Loc,
1697
          New_External_Name (Chars (T), 'M'));
1698
 
1699
      Decl :=
1700
        Make_Object_Renaming_Declaration (Loc,
1701
          Defining_Identifier => M_Id,
1702
          Subtype_Mark => New_Reference_To (RTE (RE_Master_Id), Loc),
1703
          Name => Make_Identifier (Loc, Name_uMaster));
1704
      Insert_Before (N, Decl);
1705
      Analyze (Decl);
1706
      return M_Id;
1707
 
1708
   exception
1709
      when RE_Not_Available =>
1710
         return Empty;
1711
   end Build_Master_Renaming;
1712
 
1713
   ---------------------------
1714
   -- Build_Master_Renaming --
1715
   ---------------------------
1716
 
1717
   procedure Build_Master_Renaming (N : Node_Id; T : Entity_Id) is
1718
      M_Id : Entity_Id;
1719
 
1720
   begin
1721
      --  Nothing to do if there is no task hierarchy
1722
 
1723
      if Restriction_Active (No_Task_Hierarchy) then
1724
         return;
1725
      end if;
1726
 
1727
      M_Id := Build_Master_Renaming (N, T);
1728
      Set_Master_Id (T, M_Id);
1729
 
1730
   exception
1731
      when RE_Not_Available =>
1732
         return;
1733
   end Build_Master_Renaming;
1734
 
1735
   ----------------------------
1736
   -- Build_Record_Init_Proc --
1737
   ----------------------------
1738
 
1739
   procedure Build_Record_Init_Proc (N : Node_Id; Pe : Entity_Id) is
1740
      Loc       : Source_Ptr := Sloc (N);
1741
      Discr_Map : constant Elist_Id := New_Elmt_List;
1742
      Proc_Id   : Entity_Id;
1743
      Rec_Type  : Entity_Id;
1744
      Set_Tag   : Entity_Id := Empty;
1745
 
1746
      function Build_Assignment (Id : Entity_Id; N : Node_Id) return List_Id;
1747
      --  Build a assignment statement node which assigns to record component
1748
      --  its default expression if defined. The assignment left hand side is
1749
      --  marked Assignment_OK so that initialization of limited private
1750
      --  records works correctly, Return also the adjustment call for
1751
      --  controlled objects
1752
 
1753
      procedure Build_Discriminant_Assignments (Statement_List : List_Id);
1754
      --  If the record has discriminants, adds assignment statements to
1755
      --  statement list to initialize the discriminant values from the
1756
      --  arguments of the initialization procedure.
1757
 
1758
      function Build_Init_Statements (Comp_List : Node_Id) return List_Id;
1759
      --  Build a list representing a sequence of statements which initialize
1760
      --  components of the given component list. This may involve building
1761
      --  case statements for the variant parts.
1762
 
1763
      function Build_Init_Call_Thru (Parameters : List_Id) return List_Id;
1764
      --  Given a non-tagged type-derivation that declares discriminants,
1765
      --  such as
1766
      --
1767
      --  type R (R1, R2 : Integer) is record ... end record;
1768
      --
1769
      --  type D (D1 : Integer) is new R (1, D1);
1770
      --
1771
      --  we make the _init_proc of D be
1772
      --
1773
      --       procedure _init_proc(X : D; D1 : Integer) is
1774
      --       begin
1775
      --          _init_proc( R(X), 1, D1);
1776
      --       end _init_proc;
1777
      --
1778
      --  This function builds the call statement in this _init_proc.
1779
 
1780
      procedure Build_Init_Procedure;
1781
      --  Build the tree corresponding to the procedure specification and body
1782
      --  of the initialization procedure (by calling all the preceding
1783
      --  auxiliary routines), and install it as the _init TSS.
1784
 
1785
      procedure Build_Offset_To_Top_Functions;
1786
      --  Ada 2005 (AI-251): Build the tree corresponding to the procedure spec
1787
      --  and body of the Offset_To_Top function that is generated when the
1788
      --  parent of a type with discriminants has secondary dispatch tables.
1789
 
1790
      procedure Build_Record_Checks (S : Node_Id; Check_List : List_Id);
1791
      --  Add range checks to components of discriminated records. S is a
1792
      --  subtype indication of a record component. Check_List is a list
1793
      --  to which the check actions are appended.
1794
 
1795
      function Component_Needs_Simple_Initialization
1796
        (T : Entity_Id) return Boolean;
1797
      --  Determines if a component needs simple initialization, given its type
1798
      --  T. This is the same as Needs_Simple_Initialization except for the
1799
      --  following difference: the types Tag and Interface_Tag, that are
1800
      --  access types which would normally require simple initialization to
1801
      --  null, do not require initialization as components, since they are
1802
      --  explicitly initialized by other means.
1803
 
1804
      procedure Constrain_Array
1805
        (SI         : Node_Id;
1806
         Check_List : List_Id);
1807
      --  Called from Build_Record_Checks.
1808
      --  Apply a list of index constraints to an unconstrained array type.
1809
      --  The first parameter is the entity for the resulting subtype.
1810
      --  Check_List is a list to which the check actions are appended.
1811
 
1812
      procedure Constrain_Index
1813
        (Index      : Node_Id;
1814
         S          : Node_Id;
1815
         Check_List : List_Id);
1816
      --  Process an index constraint in a constrained array declaration.
1817
      --  The constraint can be a subtype name, or a range with or without
1818
      --  an explicit subtype mark. The index is the corresponding index of the
1819
      --  unconstrained array. S is the range expression. Check_List is a list
1820
      --  to which the check actions are appended (called from
1821
      --  Build_Record_Checks).
1822
 
1823
      function Parent_Subtype_Renaming_Discrims return Boolean;
1824
      --  Returns True for base types N that rename discriminants, else False
1825
 
1826
      function Requires_Init_Proc (Rec_Id : Entity_Id) return Boolean;
1827
      --  Determines whether a record initialization procedure needs to be
1828
      --  generated for the given record type.
1829
 
1830
      ----------------------
1831
      -- Build_Assignment --
1832
      ----------------------
1833
 
1834
      function Build_Assignment (Id : Entity_Id; N : Node_Id) return List_Id is
1835
         Exp  : Node_Id := N;
1836
         Lhs  : Node_Id;
1837
         Typ  : constant Entity_Id := Underlying_Type (Etype (Id));
1838
         Kind : Node_Kind := Nkind (N);
1839
         Res  : List_Id;
1840
 
1841
      begin
1842
         Loc := Sloc (N);
1843
         Lhs :=
1844
           Make_Selected_Component (Loc,
1845
             Prefix => Make_Identifier (Loc, Name_uInit),
1846
             Selector_Name => New_Occurrence_Of (Id, Loc));
1847
         Set_Assignment_OK (Lhs);
1848
 
1849
         --  Case of an access attribute applied to the current instance.
1850
         --  Replace the reference to the type by a reference to the actual
1851
         --  object. (Note that this handles the case of the top level of
1852
         --  the expression being given by such an attribute, but does not
1853
         --  cover uses nested within an initial value expression. Nested
1854
         --  uses are unlikely to occur in practice, but are theoretically
1855
         --  possible. It is not clear how to handle them without fully
1856
         --  traversing the expression. ???
1857
 
1858
         if Kind = N_Attribute_Reference
1859
           and then (Attribute_Name (N) = Name_Unchecked_Access
1860
                       or else
1861
                     Attribute_Name (N) = Name_Unrestricted_Access)
1862
           and then Is_Entity_Name (Prefix (N))
1863
           and then Is_Type (Entity (Prefix (N)))
1864
           and then Entity (Prefix (N)) = Rec_Type
1865
         then
1866
            Exp :=
1867
              Make_Attribute_Reference (Loc,
1868
                Prefix         => Make_Identifier (Loc, Name_uInit),
1869
                Attribute_Name => Name_Unrestricted_Access);
1870
         end if;
1871
 
1872
         --  Take a copy of Exp to ensure that later copies of this component
1873
         --  declaration in derived types see the original tree, not a node
1874
         --  rewritten during expansion of the init_proc. If the copy contains
1875
         --  itypes, the scope of the new itypes is the init_proc being built.
1876
 
1877
         Exp := New_Copy_Tree (Exp, New_Scope => Proc_Id);
1878
 
1879
         Res := New_List (
1880
           Make_Assignment_Statement (Loc,
1881
             Name       => Lhs,
1882
             Expression => Exp));
1883
 
1884
         Set_No_Ctrl_Actions (First (Res));
1885
 
1886
         --  Adjust the tag if tagged (because of possible view conversions).
1887
         --  Suppress the tag adjustment when VM_Target because VM tags are
1888
         --  represented implicitly in objects.
1889
 
1890
         if Is_Tagged_Type (Typ) and then Tagged_Type_Expansion then
1891
            Append_To (Res,
1892
              Make_Assignment_Statement (Loc,
1893
                Name =>
1894
                  Make_Selected_Component (Loc,
1895
                    Prefix =>  New_Copy_Tree (Lhs, New_Scope => Proc_Id),
1896
                    Selector_Name =>
1897
                      New_Reference_To (First_Tag_Component (Typ), Loc)),
1898
 
1899
                Expression =>
1900
                  Unchecked_Convert_To (RTE (RE_Tag),
1901
                    New_Reference_To
1902
                      (Node (First_Elmt (Access_Disp_Table (Typ))), Loc))));
1903
         end if;
1904
 
1905
         --  Adjust the component if controlled except if it is an aggregate
1906
         --  that will be expanded inline.
1907
 
1908
         if Kind = N_Qualified_Expression then
1909
            Kind := Nkind (Expression (N));
1910
         end if;
1911
 
1912
         if Needs_Finalization (Typ)
1913
           and then not (Nkind_In (Kind, N_Aggregate, N_Extension_Aggregate))
1914
           and then not Is_Inherently_Limited_Type (Typ)
1915
         then
1916
            declare
1917
               Ref : constant Node_Id :=
1918
                       New_Copy_Tree (Lhs, New_Scope => Proc_Id);
1919
            begin
1920
               Append_List_To (Res,
1921
                 Make_Adjust_Call (
1922
                  Ref          => Ref,
1923
                  Typ          => Etype (Id),
1924
                  Flist_Ref    => Find_Final_List (Etype (Id), Ref),
1925
                  With_Attach  => Make_Integer_Literal (Loc, 1)));
1926
            end;
1927
         end if;
1928
 
1929
         return Res;
1930
 
1931
      exception
1932
         when RE_Not_Available =>
1933
            return Empty_List;
1934
      end Build_Assignment;
1935
 
1936
      ------------------------------------
1937
      -- Build_Discriminant_Assignments --
1938
      ------------------------------------
1939
 
1940
      procedure Build_Discriminant_Assignments (Statement_List : List_Id) is
1941
         D         : Entity_Id;
1942
         Is_Tagged : constant Boolean := Is_Tagged_Type (Rec_Type);
1943
 
1944
      begin
1945
         if Has_Discriminants (Rec_Type)
1946
           and then not Is_Unchecked_Union (Rec_Type)
1947
         then
1948
            D := First_Discriminant (Rec_Type);
1949
 
1950
            while Present (D) loop
1951
 
1952
               --  Don't generate the assignment for discriminants in derived
1953
               --  tagged types if the discriminant is a renaming of some
1954
               --  ancestor discriminant. This initialization will be done
1955
               --  when initializing the _parent field of the derived record.
1956
 
1957
               if Is_Tagged and then
1958
                 Present (Corresponding_Discriminant (D))
1959
               then
1960
                  null;
1961
 
1962
               else
1963
                  Loc := Sloc (D);
1964
                  Append_List_To (Statement_List,
1965
                    Build_Assignment (D,
1966
                      New_Reference_To (Discriminal (D), Loc)));
1967
               end if;
1968
 
1969
               Next_Discriminant (D);
1970
            end loop;
1971
         end if;
1972
      end Build_Discriminant_Assignments;
1973
 
1974
      --------------------------
1975
      -- Build_Init_Call_Thru --
1976
      --------------------------
1977
 
1978
      function Build_Init_Call_Thru (Parameters : List_Id) return List_Id is
1979
         Parent_Proc : constant Entity_Id :=
1980
                         Base_Init_Proc (Etype (Rec_Type));
1981
 
1982
         Parent_Type : constant Entity_Id :=
1983
                         Etype (First_Formal (Parent_Proc));
1984
 
1985
         Uparent_Type : constant Entity_Id :=
1986
                          Underlying_Type (Parent_Type);
1987
 
1988
         First_Discr_Param : Node_Id;
1989
 
1990
         Parent_Discr : Entity_Id;
1991
         First_Arg    : Node_Id;
1992
         Args         : List_Id;
1993
         Arg          : Node_Id;
1994
         Res          : List_Id;
1995
 
1996
      begin
1997
         --  First argument (_Init) is the object to be initialized.
1998
         --  ??? not sure where to get a reasonable Loc for First_Arg
1999
 
2000
         First_Arg :=
2001
           OK_Convert_To (Parent_Type,
2002
             New_Reference_To (Defining_Identifier (First (Parameters)), Loc));
2003
 
2004
         Set_Etype (First_Arg, Parent_Type);
2005
 
2006
         Args := New_List (Convert_Concurrent (First_Arg, Rec_Type));
2007
 
2008
         --  In the tasks case,
2009
         --    add _Master as the value of the _Master parameter
2010
         --    add _Chain as the value of the _Chain parameter.
2011
         --    add _Task_Name as the value of the _Task_Name parameter.
2012
         --  At the outer level, these will be variables holding the
2013
         --  corresponding values obtained from GNARL or the expander.
2014
         --
2015
         --  At inner levels, they will be the parameters passed down through
2016
         --  the outer routines.
2017
 
2018
         First_Discr_Param := Next (First (Parameters));
2019
 
2020
         if Has_Task (Rec_Type) then
2021
            if Restriction_Active (No_Task_Hierarchy) then
2022
 
2023
               --  See comments in System.Tasking.Initialization.Init_RTS
2024
               --  for the value 3.
2025
 
2026
               Append_To (Args, Make_Integer_Literal (Loc, 3));
2027
            else
2028
               Append_To (Args, Make_Identifier (Loc, Name_uMaster));
2029
            end if;
2030
 
2031
            Append_To (Args, Make_Identifier (Loc, Name_uChain));
2032
            Append_To (Args, Make_Identifier (Loc, Name_uTask_Name));
2033
            First_Discr_Param := Next (Next (Next (First_Discr_Param)));
2034
         end if;
2035
 
2036
         --  Append discriminant values
2037
 
2038
         if Has_Discriminants (Uparent_Type) then
2039
            pragma Assert (not Is_Tagged_Type (Uparent_Type));
2040
 
2041
            Parent_Discr := First_Discriminant (Uparent_Type);
2042
            while Present (Parent_Discr) loop
2043
 
2044
               --  Get the initial value for this discriminant
2045
               --  ??? needs to be cleaned up to use parent_Discr_Constr
2046
               --  directly.
2047
 
2048
               declare
2049
                  Discr_Value : Elmt_Id :=
2050
                                  First_Elmt
2051
                                    (Stored_Constraint (Rec_Type));
2052
 
2053
                  Discr       : Entity_Id :=
2054
                                  First_Stored_Discriminant (Uparent_Type);
2055
               begin
2056
                  while Original_Record_Component (Parent_Discr) /= Discr loop
2057
                     Next_Stored_Discriminant (Discr);
2058
                     Next_Elmt (Discr_Value);
2059
                  end loop;
2060
 
2061
                  Arg := Node (Discr_Value);
2062
               end;
2063
 
2064
               --  Append it to the list
2065
 
2066
               if Nkind (Arg) = N_Identifier
2067
                  and then Ekind (Entity (Arg)) = E_Discriminant
2068
               then
2069
                  Append_To (Args,
2070
                    New_Reference_To (Discriminal (Entity (Arg)), Loc));
2071
 
2072
               --  Case of access discriminants. We replace the reference
2073
               --  to the type by a reference to the actual object.
2074
 
2075
               --  Is above comment right??? Use of New_Copy below seems mighty
2076
               --  suspicious ???
2077
 
2078
               else
2079
                  Append_To (Args, New_Copy (Arg));
2080
               end if;
2081
 
2082
               Next_Discriminant (Parent_Discr);
2083
            end loop;
2084
         end if;
2085
 
2086
         Res :=
2087
            New_List (
2088
              Make_Procedure_Call_Statement (Loc,
2089
                Name => New_Occurrence_Of (Parent_Proc, Loc),
2090
                Parameter_Associations => Args));
2091
 
2092
         return Res;
2093
      end Build_Init_Call_Thru;
2094
 
2095
      -----------------------------------
2096
      -- Build_Offset_To_Top_Functions --
2097
      -----------------------------------
2098
 
2099
      procedure Build_Offset_To_Top_Functions is
2100
 
2101
         procedure Build_Offset_To_Top_Function (Iface_Comp : Entity_Id);
2102
         --  Generate:
2103
         --    function Fxx (O : in Rec_Typ) return Storage_Offset is
2104
         --    begin
2105
         --       return O.Iface_Comp'Position;
2106
         --    end Fxx;
2107
 
2108
         ----------------------------------
2109
         -- Build_Offset_To_Top_Function --
2110
         ----------------------------------
2111
 
2112
         procedure Build_Offset_To_Top_Function (Iface_Comp : Entity_Id) is
2113
            Body_Node : Node_Id;
2114
            Func_Id   : Entity_Id;
2115
            Spec_Node : Node_Id;
2116
 
2117
         begin
2118
            Func_Id :=
2119
              Make_Defining_Identifier (Loc,
2120
                Chars => New_Internal_Name ('F'));
2121
 
2122
            Set_DT_Offset_To_Top_Func (Iface_Comp, Func_Id);
2123
 
2124
            --  Generate
2125
            --    function Fxx (O : in Rec_Typ) return Storage_Offset;
2126
 
2127
            Spec_Node := New_Node (N_Function_Specification, Loc);
2128
            Set_Defining_Unit_Name (Spec_Node, Func_Id);
2129
            Set_Parameter_Specifications (Spec_Node, New_List (
2130
              Make_Parameter_Specification (Loc,
2131
                Defining_Identifier => Make_Defining_Identifier (Loc, Name_uO),
2132
                In_Present          => True,
2133
                Parameter_Type      => New_Reference_To (Rec_Type, Loc))));
2134
            Set_Result_Definition (Spec_Node,
2135
              New_Reference_To (RTE (RE_Storage_Offset), Loc));
2136
 
2137
            --  Generate
2138
            --    function Fxx (O : in Rec_Typ) return Storage_Offset is
2139
            --    begin
2140
            --       return O.Iface_Comp'Position;
2141
            --    end Fxx;
2142
 
2143
            Body_Node := New_Node (N_Subprogram_Body, Loc);
2144
            Set_Specification (Body_Node, Spec_Node);
2145
            Set_Declarations (Body_Node, New_List);
2146
            Set_Handled_Statement_Sequence (Body_Node,
2147
              Make_Handled_Sequence_Of_Statements (Loc,
2148
                Statements => New_List (
2149
                  Make_Simple_Return_Statement (Loc,
2150
                    Expression =>
2151
                      Make_Attribute_Reference (Loc,
2152
                        Prefix =>
2153
                          Make_Selected_Component (Loc,
2154
                            Prefix => Make_Identifier (Loc, Name_uO),
2155
                            Selector_Name => New_Reference_To
2156
                                               (Iface_Comp, Loc)),
2157
                        Attribute_Name => Name_Position)))));
2158
 
2159
            Set_Ekind       (Func_Id, E_Function);
2160
            Set_Mechanism   (Func_Id, Default_Mechanism);
2161
            Set_Is_Internal (Func_Id, True);
2162
 
2163
            if not Debug_Generated_Code then
2164
               Set_Debug_Info_Off (Func_Id);
2165
            end if;
2166
 
2167
            Analyze (Body_Node);
2168
 
2169
            Append_Freeze_Action (Rec_Type, Body_Node);
2170
         end Build_Offset_To_Top_Function;
2171
 
2172
         --  Local variables
2173
 
2174
         Ifaces_Comp_List : Elist_Id;
2175
         Iface_Comp_Elmt  : Elmt_Id;
2176
         Iface_Comp       : Node_Id;
2177
 
2178
      --  Start of processing for Build_Offset_To_Top_Functions
2179
 
2180
      begin
2181
         --  Offset_To_Top_Functions are built only for derivations of types
2182
         --  with discriminants that cover interface types.
2183
         --  Nothing is needed either in case of virtual machines, since
2184
         --  interfaces are handled directly by the VM.
2185
 
2186
         if not Is_Tagged_Type (Rec_Type)
2187
           or else Etype (Rec_Type) = Rec_Type
2188
           or else not Has_Discriminants (Etype (Rec_Type))
2189
           or else not Tagged_Type_Expansion
2190
         then
2191
            return;
2192
         end if;
2193
 
2194
         Collect_Interface_Components (Rec_Type, Ifaces_Comp_List);
2195
 
2196
         --  For each interface type with secondary dispatch table we generate
2197
         --  the Offset_To_Top_Functions (required to displace the pointer in
2198
         --  interface conversions)
2199
 
2200
         Iface_Comp_Elmt := First_Elmt (Ifaces_Comp_List);
2201
         while Present (Iface_Comp_Elmt) loop
2202
            Iface_Comp := Node (Iface_Comp_Elmt);
2203
            pragma Assert (Is_Interface (Related_Type (Iface_Comp)));
2204
 
2205
            --  If the interface is a parent of Rec_Type it shares the primary
2206
            --  dispatch table and hence there is no need to build the function
2207
 
2208
            if not Is_Ancestor (Related_Type (Iface_Comp), Rec_Type) then
2209
               Build_Offset_To_Top_Function (Iface_Comp);
2210
            end if;
2211
 
2212
            Next_Elmt (Iface_Comp_Elmt);
2213
         end loop;
2214
      end Build_Offset_To_Top_Functions;
2215
 
2216
      --------------------------
2217
      -- Build_Init_Procedure --
2218
      --------------------------
2219
 
2220
      procedure Build_Init_Procedure is
2221
         Body_Node             : Node_Id;
2222
         Handled_Stmt_Node     : Node_Id;
2223
         Parameters            : List_Id;
2224
         Proc_Spec_Node        : Node_Id;
2225
         Body_Stmts            : List_Id;
2226
         Record_Extension_Node : Node_Id;
2227
         Init_Tags_List        : List_Id;
2228
 
2229
      begin
2230
         Body_Stmts := New_List;
2231
         Body_Node := New_Node (N_Subprogram_Body, Loc);
2232
         Set_Ekind (Proc_Id, E_Procedure);
2233
 
2234
         Proc_Spec_Node := New_Node (N_Procedure_Specification, Loc);
2235
         Set_Defining_Unit_Name (Proc_Spec_Node, Proc_Id);
2236
 
2237
         Parameters := Init_Formals (Rec_Type);
2238
         Append_List_To (Parameters,
2239
           Build_Discriminant_Formals (Rec_Type, True));
2240
 
2241
         --  For tagged types, we add a flag to indicate whether the routine
2242
         --  is called to initialize a parent component in the init_proc of
2243
         --  a type extension. If the flag is false, we do not set the tag
2244
         --  because it has been set already in the extension.
2245
 
2246
         if Is_Tagged_Type (Rec_Type)
2247
           and then not Is_CPP_Class (Rec_Type)
2248
         then
2249
            Set_Tag :=
2250
              Make_Defining_Identifier (Loc,
2251
                Chars => New_Internal_Name ('P'));
2252
 
2253
            Append_To (Parameters,
2254
              Make_Parameter_Specification (Loc,
2255
                Defining_Identifier => Set_Tag,
2256
                Parameter_Type => New_Occurrence_Of (Standard_Boolean, Loc),
2257
                Expression => New_Occurrence_Of (Standard_True, Loc)));
2258
         end if;
2259
 
2260
         Set_Parameter_Specifications (Proc_Spec_Node, Parameters);
2261
         Set_Specification (Body_Node, Proc_Spec_Node);
2262
         Set_Declarations (Body_Node, New_List);
2263
 
2264
         if Parent_Subtype_Renaming_Discrims then
2265
 
2266
            --  N is a Derived_Type_Definition that renames the parameters
2267
            --  of the ancestor type. We initialize it by expanding our
2268
            --  discriminants and call the ancestor _init_proc with a
2269
            --  type-converted object
2270
 
2271
            Append_List_To (Body_Stmts,
2272
              Build_Init_Call_Thru (Parameters));
2273
 
2274
         elsif Nkind (Type_Definition (N)) = N_Record_Definition then
2275
            Build_Discriminant_Assignments (Body_Stmts);
2276
 
2277
            if not Null_Present (Type_Definition (N)) then
2278
               Append_List_To (Body_Stmts,
2279
                 Build_Init_Statements (
2280
                   Component_List (Type_Definition (N))));
2281
            end if;
2282
 
2283
         else
2284
            --  N is a Derived_Type_Definition with a possible non-empty
2285
            --  extension. The initialization of a type extension consists
2286
            --  in the initialization of the components in the extension.
2287
 
2288
            Build_Discriminant_Assignments (Body_Stmts);
2289
 
2290
            Record_Extension_Node :=
2291
              Record_Extension_Part (Type_Definition (N));
2292
 
2293
            if not Null_Present (Record_Extension_Node) then
2294
               declare
2295
                  Stmts : constant List_Id :=
2296
                            Build_Init_Statements (
2297
                              Component_List (Record_Extension_Node));
2298
 
2299
               begin
2300
                  --  The parent field must be initialized first because
2301
                  --  the offset of the new discriminants may depend on it
2302
 
2303
                  Prepend_To (Body_Stmts, Remove_Head (Stmts));
2304
                  Append_List_To (Body_Stmts, Stmts);
2305
               end;
2306
            end if;
2307
         end if;
2308
 
2309
         --  Add here the assignment to instantiate the Tag
2310
 
2311
         --  The assignment corresponds to the code:
2312
 
2313
         --     _Init._Tag := Typ'Tag;
2314
 
2315
         --  Suppress the tag assignment when VM_Target because VM tags are
2316
         --  represented implicitly in objects. It is also suppressed in case
2317
         --  of CPP_Class types because in this case the tag is initialized in
2318
         --  the C++ side.
2319
 
2320
         if Is_Tagged_Type (Rec_Type)
2321
           and then not Is_CPP_Class (Rec_Type)
2322
           and then Tagged_Type_Expansion
2323
           and then not No_Run_Time_Mode
2324
         then
2325
            --  Initialize the primary tag
2326
 
2327
            Init_Tags_List := New_List (
2328
              Make_Assignment_Statement (Loc,
2329
                Name =>
2330
                  Make_Selected_Component (Loc,
2331
                    Prefix => Make_Identifier (Loc, Name_uInit),
2332
                    Selector_Name =>
2333
                      New_Reference_To (First_Tag_Component (Rec_Type), Loc)),
2334
 
2335
                Expression =>
2336
                  New_Reference_To
2337
                    (Node (First_Elmt (Access_Disp_Table (Rec_Type))), Loc)));
2338
 
2339
            --  Generate the SCIL node associated with the initialization of
2340
            --  the tag component.
2341
 
2342
            if Generate_SCIL then
2343
               declare
2344
                  New_Node : Node_Id;
2345
 
2346
               begin
2347
                  New_Node :=
2348
                    Make_SCIL_Tag_Init (Sloc (First (Init_Tags_List)));
2349
                  Set_SCIL_Related_Node (New_Node, First (Init_Tags_List));
2350
                  Set_SCIL_Entity (New_Node, Rec_Type);
2351
                  Prepend_To (Init_Tags_List, New_Node);
2352
               end;
2353
            end if;
2354
 
2355
            --  Ada 2005 (AI-251): Initialize the secondary tags components
2356
            --  located at fixed positions (tags whose position depends on
2357
            --  variable size components are initialized later ---see below).
2358
 
2359
            if Ada_Version >= Ada_05
2360
              and then not Is_Interface (Rec_Type)
2361
              and then Has_Interfaces (Rec_Type)
2362
            then
2363
               Init_Secondary_Tags
2364
                 (Typ            => Rec_Type,
2365
                  Target         => Make_Identifier (Loc, Name_uInit),
2366
                  Stmts_List     => Init_Tags_List,
2367
                  Fixed_Comps    => True,
2368
                  Variable_Comps => False);
2369
            end if;
2370
 
2371
            --  The tag must be inserted before the assignments to other
2372
            --  components,  because the initial value of the component may
2373
            --  depend on the tag (eg. through a dispatching operation on
2374
            --  an access to the current type). The tag assignment is not done
2375
            --  when initializing the parent component of a type extension,
2376
            --  because in that case the tag is set in the extension.
2377
 
2378
            --  Extensions of imported C++ classes add a final complication,
2379
            --  because we cannot inhibit tag setting in the constructor for
2380
            --  the parent. In that case we insert the tag initialization
2381
            --  after the calls to initialize the parent.
2382
 
2383
            if not Is_CPP_Class (Root_Type (Rec_Type)) then
2384
               Prepend_To (Body_Stmts,
2385
                 Make_If_Statement (Loc,
2386
                   Condition => New_Occurrence_Of (Set_Tag, Loc),
2387
                   Then_Statements => Init_Tags_List));
2388
 
2389
            --  CPP_Class derivation: In this case the dispatch table of the
2390
            --  parent was built in the C++ side and we copy the table of the
2391
            --  parent to initialize the new dispatch table.
2392
 
2393
            else
2394
               declare
2395
                  Nod : Node_Id;
2396
 
2397
               begin
2398
                  --  We assume the first init_proc call is for the parent
2399
 
2400
                  Nod := First (Body_Stmts);
2401
                  while Present (Next (Nod))
2402
                    and then (Nkind (Nod) /= N_Procedure_Call_Statement
2403
                               or else not Is_Init_Proc (Name (Nod)))
2404
                  loop
2405
                     Nod := Next (Nod);
2406
                  end loop;
2407
 
2408
                  --  Generate:
2409
                  --     ancestor_constructor (_init.parent);
2410
                  --     if Arg2 then
2411
                  --        inherit_prim_ops (_init._tag, new_dt, num_prims);
2412
                  --        _init._tag := new_dt;
2413
                  --     end if;
2414
 
2415
                  Prepend_To (Init_Tags_List,
2416
                    Build_Inherit_Prims (Loc,
2417
                      Typ          => Rec_Type,
2418
                      Old_Tag_Node =>
2419
                        Make_Selected_Component (Loc,
2420
                          Prefix        =>
2421
                            Make_Identifier (Loc,
2422
                              Chars => Name_uInit),
2423
                          Selector_Name =>
2424
                            New_Reference_To
2425
                              (First_Tag_Component (Rec_Type), Loc)),
2426
                      New_Tag_Node =>
2427
                        New_Reference_To
2428
                          (Node (First_Elmt (Access_Disp_Table (Rec_Type))),
2429
                           Loc),
2430
                      Num_Prims    =>
2431
                        UI_To_Int
2432
                          (DT_Entry_Count (First_Tag_Component (Rec_Type)))));
2433
 
2434
                  Insert_After (Nod,
2435
                    Make_If_Statement (Loc,
2436
                      Condition => New_Occurrence_Of (Set_Tag, Loc),
2437
                      Then_Statements => Init_Tags_List));
2438
 
2439
                  --  We have inherited table of the parent from the CPP side.
2440
                  --  Now we fill the slots associated with Ada primitives.
2441
                  --  This needs more work to avoid its execution each time
2442
                  --  an object is initialized???
2443
 
2444
                  declare
2445
                     E    : Elmt_Id;
2446
                     Prim : Node_Id;
2447
 
2448
                  begin
2449
                     E := First_Elmt (Primitive_Operations (Rec_Type));
2450
                     while Present (E) loop
2451
                        Prim := Node (E);
2452
 
2453
                        if not Is_Imported (Prim)
2454
                          and then Convention (Prim) = Convention_CPP
2455
                          and then not Present (Interface_Alias (Prim))
2456
                        then
2457
                           Append_List_To (Init_Tags_List,
2458
                             Register_Primitive (Loc, Prim => Prim));
2459
                        end if;
2460
 
2461
                        Next_Elmt (E);
2462
                     end loop;
2463
                  end;
2464
               end;
2465
            end if;
2466
 
2467
            --  Ada 2005 (AI-251): Initialize the secondary tag components
2468
            --  located at variable positions. We delay the generation of this
2469
            --  code until here because the value of the attribute 'Position
2470
            --  applied to variable size components of the parent type that
2471
            --  depend on discriminants is only safely read at runtime after
2472
            --  the parent components have been initialized.
2473
 
2474
            if Ada_Version >= Ada_05
2475
              and then not Is_Interface (Rec_Type)
2476
              and then Has_Interfaces (Rec_Type)
2477
              and then Has_Discriminants (Etype (Rec_Type))
2478
              and then Is_Variable_Size_Record (Etype (Rec_Type))
2479
            then
2480
               Init_Tags_List := New_List;
2481
 
2482
               Init_Secondary_Tags
2483
                 (Typ            => Rec_Type,
2484
                  Target         => Make_Identifier (Loc, Name_uInit),
2485
                  Stmts_List     => Init_Tags_List,
2486
                  Fixed_Comps    => False,
2487
                  Variable_Comps => True);
2488
 
2489
               if Is_Non_Empty_List (Init_Tags_List) then
2490
                  Append_List_To (Body_Stmts, Init_Tags_List);
2491
               end if;
2492
            end if;
2493
         end if;
2494
 
2495
         Handled_Stmt_Node := New_Node (N_Handled_Sequence_Of_Statements, Loc);
2496
         Set_Statements (Handled_Stmt_Node, Body_Stmts);
2497
         Set_Exception_Handlers (Handled_Stmt_Node, No_List);
2498
         Set_Handled_Statement_Sequence (Body_Node, Handled_Stmt_Node);
2499
 
2500
         if not Debug_Generated_Code then
2501
            Set_Debug_Info_Off (Proc_Id);
2502
         end if;
2503
 
2504
         --  Associate Init_Proc with type, and determine if the procedure
2505
         --  is null (happens because of the Initialize_Scalars pragma case,
2506
         --  where we have to generate a null procedure in case it is called
2507
         --  by a client with Initialize_Scalars set). Such procedures have
2508
         --  to be generated, but do not have to be called, so we mark them
2509
         --  as null to suppress the call.
2510
 
2511
         Set_Init_Proc (Rec_Type, Proc_Id);
2512
 
2513
         if List_Length (Body_Stmts) = 1
2514
 
2515
           --  We must skip SCIL nodes because they may have been added to this
2516
           --  list by Insert_Actions.
2517
 
2518
           and then Nkind (First_Non_SCIL_Node (Body_Stmts)) = N_Null_Statement
2519
           and then VM_Target = No_VM
2520
         then
2521
            --  Even though the init proc may be null at this time it might get
2522
            --  some stuff added to it later by the VM backend.
2523
 
2524
            Set_Is_Null_Init_Proc (Proc_Id);
2525
         end if;
2526
      end Build_Init_Procedure;
2527
 
2528
      ---------------------------
2529
      -- Build_Init_Statements --
2530
      ---------------------------
2531
 
2532
      function Build_Init_Statements (Comp_List : Node_Id) return List_Id is
2533
         Check_List     : constant List_Id := New_List;
2534
         Alt_List       : List_Id;
2535
         Decl           : Node_Id;
2536
         Id             : Entity_Id;
2537
         Names          : Node_Id;
2538
         Statement_List : List_Id;
2539
         Stmts          : List_Id;
2540
         Typ            : Entity_Id;
2541
         Variant        : Node_Id;
2542
 
2543
         Per_Object_Constraint_Components : Boolean;
2544
 
2545
         function Has_Access_Constraint (E : Entity_Id) return Boolean;
2546
         --  Components with access discriminants that depend on the current
2547
         --  instance must be initialized after all other components.
2548
 
2549
         ---------------------------
2550
         -- Has_Access_Constraint --
2551
         ---------------------------
2552
 
2553
         function Has_Access_Constraint (E : Entity_Id) return Boolean is
2554
            Disc : Entity_Id;
2555
            T    : constant Entity_Id := Etype (E);
2556
 
2557
         begin
2558
            if Has_Per_Object_Constraint (E)
2559
              and then Has_Discriminants (T)
2560
            then
2561
               Disc := First_Discriminant (T);
2562
               while Present (Disc) loop
2563
                  if Is_Access_Type (Etype (Disc)) then
2564
                     return True;
2565
                  end if;
2566
 
2567
                  Next_Discriminant (Disc);
2568
               end loop;
2569
 
2570
               return False;
2571
            else
2572
               return False;
2573
            end if;
2574
         end Has_Access_Constraint;
2575
 
2576
      --  Start of processing for Build_Init_Statements
2577
 
2578
      begin
2579
         if Null_Present (Comp_List) then
2580
            return New_List (Make_Null_Statement (Loc));
2581
         end if;
2582
 
2583
         Statement_List := New_List;
2584
 
2585
         --  Loop through visible declarations of task types and protected
2586
         --  types moving any expanded code from the spec to the body of the
2587
         --  init procedure.
2588
 
2589
         if Is_Task_Record_Type (Rec_Type)
2590
           or else Is_Protected_Record_Type (Rec_Type)
2591
         then
2592
            declare
2593
               Decl : constant Node_Id :=
2594
                        Parent (Corresponding_Concurrent_Type (Rec_Type));
2595
               Def  : Node_Id;
2596
               N1   : Node_Id;
2597
               N2   : Node_Id;
2598
 
2599
            begin
2600
               if Is_Task_Record_Type (Rec_Type) then
2601
                  Def := Task_Definition (Decl);
2602
               else
2603
                  Def := Protected_Definition (Decl);
2604
               end if;
2605
 
2606
               if Present (Def) then
2607
                  N1 := First (Visible_Declarations (Def));
2608
                  while Present (N1) loop
2609
                     N2 := N1;
2610
                     N1 := Next (N1);
2611
 
2612
                     if Nkind (N2) in N_Statement_Other_Than_Procedure_Call
2613
                       or else Nkind (N2) in N_Raise_xxx_Error
2614
                       or else Nkind (N2) = N_Procedure_Call_Statement
2615
                     then
2616
                        Append_To (Statement_List,
2617
                          New_Copy_Tree (N2, New_Scope => Proc_Id));
2618
                        Rewrite (N2, Make_Null_Statement (Sloc (N2)));
2619
                        Analyze (N2);
2620
                     end if;
2621
                  end loop;
2622
               end if;
2623
            end;
2624
         end if;
2625
 
2626
         --  Loop through components, skipping pragmas, in 2 steps. The first
2627
         --  step deals with regular components. The second step deals with
2628
         --  components have per object constraints, and no explicit initia-
2629
         --  lization.
2630
 
2631
         Per_Object_Constraint_Components := False;
2632
 
2633
         --  First step : regular components
2634
 
2635
         Decl := First_Non_Pragma (Component_Items (Comp_List));
2636
         while Present (Decl) loop
2637
            Loc := Sloc (Decl);
2638
            Build_Record_Checks
2639
              (Subtype_Indication (Component_Definition (Decl)), Check_List);
2640
 
2641
            Id := Defining_Identifier (Decl);
2642
            Typ := Etype (Id);
2643
 
2644
            if Has_Access_Constraint (Id)
2645
              and then No (Expression (Decl))
2646
            then
2647
               --  Skip processing for now and ask for a second pass
2648
 
2649
               Per_Object_Constraint_Components := True;
2650
 
2651
            else
2652
               --  Case of explicit initialization
2653
 
2654
               if Present (Expression (Decl)) then
2655
                  if Is_CPP_Constructor_Call (Expression (Decl)) then
2656
                     Stmts :=
2657
                       Build_Initialization_Call
2658
                         (Loc,
2659
                          Id_Ref          =>
2660
                            Make_Selected_Component (Loc,
2661
                              Prefix        =>
2662
                                Make_Identifier (Loc, Name_uInit),
2663
                              Selector_Name => New_Occurrence_Of (Id, Loc)),
2664
                          Typ             => Typ,
2665
                          In_Init_Proc    => True,
2666
                          Enclos_Type     => Rec_Type,
2667
                          Discr_Map       => Discr_Map,
2668
                          Constructor_Ref => Expression (Decl));
2669
                  else
2670
                     Stmts := Build_Assignment (Id, Expression (Decl));
2671
                  end if;
2672
 
2673
               --  Case of composite component with its own Init_Proc
2674
 
2675
               elsif not Is_Interface (Typ)
2676
                 and then Has_Non_Null_Base_Init_Proc (Typ)
2677
               then
2678
                  Stmts :=
2679
                    Build_Initialization_Call
2680
                      (Loc,
2681
                       Id_Ref       =>
2682
                         Make_Selected_Component (Loc,
2683
                           Prefix        => Make_Identifier (Loc, Name_uInit),
2684
                           Selector_Name => New_Occurrence_Of (Id, Loc)),
2685
                       Typ          => Typ,
2686
                       In_Init_Proc => True,
2687
                       Enclos_Type  => Rec_Type,
2688
                       Discr_Map    => Discr_Map);
2689
 
2690
                  Clean_Task_Names (Typ, Proc_Id);
2691
 
2692
               --  Case of component needing simple initialization
2693
 
2694
               elsif Component_Needs_Simple_Initialization (Typ) then
2695
                  Stmts :=
2696
                    Build_Assignment
2697
                      (Id, Get_Simple_Init_Val (Typ, N, Esize (Id)));
2698
 
2699
               --  Nothing needed for this case
2700
 
2701
               else
2702
                  Stmts := No_List;
2703
               end if;
2704
 
2705
               if Present (Check_List) then
2706
                  Append_List_To (Statement_List, Check_List);
2707
               end if;
2708
 
2709
               if Present (Stmts) then
2710
 
2711
                  --  Add the initialization of the record controller before
2712
                  --  the _Parent field is attached to it when the attachment
2713
                  --  can occur. It does not work to simply initialize the
2714
                  --  controller first: it must be initialized after the parent
2715
                  --  if the parent holds discriminants that can be used to
2716
                  --  compute the offset of the controller. We assume here that
2717
                  --  the last statement of the initialization call is the
2718
                  --  attachment of the parent (see Build_Initialization_Call)
2719
 
2720
                  if Chars (Id) = Name_uController
2721
                    and then Rec_Type /= Etype (Rec_Type)
2722
                    and then Has_Controlled_Component (Etype (Rec_Type))
2723
                    and then Has_New_Controlled_Component (Rec_Type)
2724
                    and then Present (Last (Statement_List))
2725
                  then
2726
                     Insert_List_Before (Last (Statement_List), Stmts);
2727
                  else
2728
                     Append_List_To (Statement_List, Stmts);
2729
                  end if;
2730
               end if;
2731
            end if;
2732
 
2733
            Next_Non_Pragma (Decl);
2734
         end loop;
2735
 
2736
         --  Set up tasks and protected object support. This needs to be done
2737
         --  before any component with a per-object access discriminant
2738
         --  constraint, or any variant part (which may contain such
2739
         --  components) is initialized, because the initialization of these
2740
         --  components may reference the enclosing concurrent object.
2741
 
2742
         --  For a task record type, add the task create call and calls
2743
         --  to bind any interrupt (signal) entries.
2744
 
2745
         if Is_Task_Record_Type (Rec_Type) then
2746
 
2747
            --  In the case of the restricted run time the ATCB has already
2748
            --  been preallocated.
2749
 
2750
            if Restricted_Profile then
2751
               Append_To (Statement_List,
2752
                 Make_Assignment_Statement (Loc,
2753
                   Name => Make_Selected_Component (Loc,
2754
                     Prefix => Make_Identifier (Loc, Name_uInit),
2755
                     Selector_Name => Make_Identifier (Loc, Name_uTask_Id)),
2756
                   Expression => Make_Attribute_Reference (Loc,
2757
                     Prefix =>
2758
                       Make_Selected_Component (Loc,
2759
                         Prefix => Make_Identifier (Loc, Name_uInit),
2760
                         Selector_Name =>
2761
                           Make_Identifier (Loc, Name_uATCB)),
2762
                     Attribute_Name => Name_Unchecked_Access)));
2763
            end if;
2764
 
2765
            Append_To (Statement_List, Make_Task_Create_Call (Rec_Type));
2766
 
2767
            --  Generate the statements which map a string entry name to a
2768
            --  task entry index. Note that the task may not have entries.
2769
 
2770
            if Entry_Names_OK then
2771
               Names := Build_Entry_Names (Rec_Type);
2772
 
2773
               if Present (Names) then
2774
                  Append_To (Statement_List, Names);
2775
               end if;
2776
            end if;
2777
 
2778
            declare
2779
               Task_Type : constant Entity_Id :=
2780
                             Corresponding_Concurrent_Type (Rec_Type);
2781
               Task_Decl : constant Node_Id := Parent (Task_Type);
2782
               Task_Def  : constant Node_Id := Task_Definition (Task_Decl);
2783
               Vis_Decl  : Node_Id;
2784
               Ent       : Entity_Id;
2785
 
2786
            begin
2787
               if Present (Task_Def) then
2788
                  Vis_Decl := First (Visible_Declarations (Task_Def));
2789
                  while Present (Vis_Decl) loop
2790
                     Loc := Sloc (Vis_Decl);
2791
 
2792
                     if Nkind (Vis_Decl) = N_Attribute_Definition_Clause then
2793
                        if Get_Attribute_Id (Chars (Vis_Decl)) =
2794
                                                       Attribute_Address
2795
                        then
2796
                           Ent := Entity (Name (Vis_Decl));
2797
 
2798
                           if Ekind (Ent) = E_Entry then
2799
                              Append_To (Statement_List,
2800
                                Make_Procedure_Call_Statement (Loc,
2801
                                  Name => New_Reference_To (
2802
                                    RTE (RE_Bind_Interrupt_To_Entry), Loc),
2803
                                  Parameter_Associations => New_List (
2804
                                    Make_Selected_Component (Loc,
2805
                                      Prefix =>
2806
                                        Make_Identifier (Loc, Name_uInit),
2807
                                      Selector_Name =>
2808
                                        Make_Identifier (Loc, Name_uTask_Id)),
2809
                                    Entry_Index_Expression (
2810
                                      Loc, Ent, Empty, Task_Type),
2811
                                    Expression (Vis_Decl))));
2812
                           end if;
2813
                        end if;
2814
                     end if;
2815
 
2816
                     Next (Vis_Decl);
2817
                  end loop;
2818
               end if;
2819
            end;
2820
         end if;
2821
 
2822
         --  For a protected type, add statements generated by
2823
         --  Make_Initialize_Protection.
2824
 
2825
         if Is_Protected_Record_Type (Rec_Type) then
2826
            Append_List_To (Statement_List,
2827
              Make_Initialize_Protection (Rec_Type));
2828
 
2829
            --  Generate the statements which map a string entry name to a
2830
            --  protected entry index. Note that the protected type may not
2831
            --  have entries.
2832
 
2833
            if Entry_Names_OK then
2834
               Names := Build_Entry_Names (Rec_Type);
2835
 
2836
               if Present (Names) then
2837
                  Append_To (Statement_List, Names);
2838
               end if;
2839
            end if;
2840
         end if;
2841
 
2842
         if Per_Object_Constraint_Components then
2843
 
2844
            --  Second pass: components with per-object constraints
2845
 
2846
            Decl := First_Non_Pragma (Component_Items (Comp_List));
2847
            while Present (Decl) loop
2848
               Loc := Sloc (Decl);
2849
               Id := Defining_Identifier (Decl);
2850
               Typ := Etype (Id);
2851
 
2852
               if Has_Access_Constraint (Id)
2853
                 and then No (Expression (Decl))
2854
               then
2855
                  if Has_Non_Null_Base_Init_Proc (Typ) then
2856
                     Append_List_To (Statement_List,
2857
                       Build_Initialization_Call (Loc,
2858
                         Make_Selected_Component (Loc,
2859
                           Prefix        => Make_Identifier (Loc, Name_uInit),
2860
                           Selector_Name => New_Occurrence_Of (Id, Loc)),
2861
                         Typ,
2862
                         In_Init_Proc => True,
2863
                         Enclos_Type  => Rec_Type,
2864
                         Discr_Map    => Discr_Map));
2865
 
2866
                     Clean_Task_Names (Typ, Proc_Id);
2867
 
2868
                  elsif Component_Needs_Simple_Initialization (Typ) then
2869
                     Append_List_To (Statement_List,
2870
                       Build_Assignment
2871
                         (Id, Get_Simple_Init_Val (Typ, N, Esize (Id))));
2872
                  end if;
2873
               end if;
2874
 
2875
               Next_Non_Pragma (Decl);
2876
            end loop;
2877
         end if;
2878
 
2879
         --  Process the variant part
2880
 
2881
         if Present (Variant_Part (Comp_List)) then
2882
            Alt_List := New_List;
2883
            Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
2884
            while Present (Variant) loop
2885
               Loc := Sloc (Variant);
2886
               Append_To (Alt_List,
2887
                 Make_Case_Statement_Alternative (Loc,
2888
                   Discrete_Choices =>
2889
                     New_Copy_List (Discrete_Choices (Variant)),
2890
                   Statements =>
2891
                     Build_Init_Statements (Component_List (Variant))));
2892
               Next_Non_Pragma (Variant);
2893
            end loop;
2894
 
2895
            --  The expression of the case statement which is a reference
2896
            --  to one of the discriminants is replaced by the appropriate
2897
            --  formal parameter of the initialization procedure.
2898
 
2899
            Append_To (Statement_List,
2900
              Make_Case_Statement (Loc,
2901
                Expression =>
2902
                  New_Reference_To (Discriminal (
2903
                    Entity (Name (Variant_Part (Comp_List)))), Loc),
2904
                Alternatives => Alt_List));
2905
         end if;
2906
 
2907
         --  If no initializations when generated for component declarations
2908
         --  corresponding to this Statement_List, append a null statement
2909
         --  to the Statement_List to make it a valid Ada tree.
2910
 
2911
         if Is_Empty_List (Statement_List) then
2912
            Append (New_Node (N_Null_Statement, Loc), Statement_List);
2913
         end if;
2914
 
2915
         return Statement_List;
2916
 
2917
      exception
2918
         when RE_Not_Available =>
2919
         return Empty_List;
2920
      end Build_Init_Statements;
2921
 
2922
      -------------------------
2923
      -- Build_Record_Checks --
2924
      -------------------------
2925
 
2926
      procedure Build_Record_Checks (S : Node_Id; Check_List : List_Id) is
2927
         Subtype_Mark_Id : Entity_Id;
2928
 
2929
      begin
2930
         if Nkind (S) = N_Subtype_Indication then
2931
            Find_Type (Subtype_Mark (S));
2932
            Subtype_Mark_Id := Entity (Subtype_Mark (S));
2933
 
2934
            --  Remaining processing depends on type
2935
 
2936
            case Ekind (Subtype_Mark_Id) is
2937
 
2938
               when Array_Kind =>
2939
                  Constrain_Array (S, Check_List);
2940
 
2941
               when others =>
2942
                  null;
2943
            end case;
2944
         end if;
2945
      end Build_Record_Checks;
2946
 
2947
      -------------------------------------------
2948
      -- Component_Needs_Simple_Initialization --
2949
      -------------------------------------------
2950
 
2951
      function Component_Needs_Simple_Initialization
2952
        (T : Entity_Id) return Boolean
2953
      is
2954
      begin
2955
         return
2956
           Needs_Simple_Initialization (T)
2957
             and then not Is_RTE (T, RE_Tag)
2958
 
2959
               --  Ada 2005 (AI-251): Check also the tag of abstract interfaces
2960
 
2961
             and then not Is_RTE (T, RE_Interface_Tag);
2962
      end Component_Needs_Simple_Initialization;
2963
 
2964
      ---------------------
2965
      -- Constrain_Array --
2966
      ---------------------
2967
 
2968
      procedure Constrain_Array
2969
        (SI          : Node_Id;
2970
         Check_List  : List_Id)
2971
      is
2972
         C                     : constant Node_Id := Constraint (SI);
2973
         Number_Of_Constraints : Nat := 0;
2974
         Index                 : Node_Id;
2975
         S, T                  : Entity_Id;
2976
 
2977
      begin
2978
         T := Entity (Subtype_Mark (SI));
2979
 
2980
         if Ekind (T) in Access_Kind then
2981
            T := Designated_Type (T);
2982
         end if;
2983
 
2984
         S := First (Constraints (C));
2985
 
2986
         while Present (S) loop
2987
            Number_Of_Constraints := Number_Of_Constraints + 1;
2988
            Next (S);
2989
         end loop;
2990
 
2991
         --  In either case, the index constraint must provide a discrete
2992
         --  range for each index of the array type and the type of each
2993
         --  discrete range must be the same as that of the corresponding
2994
         --  index. (RM 3.6.1)
2995
 
2996
         S := First (Constraints (C));
2997
         Index := First_Index (T);
2998
         Analyze (Index);
2999
 
3000
         --  Apply constraints to each index type
3001
 
3002
         for J in 1 .. Number_Of_Constraints loop
3003
            Constrain_Index (Index, S, Check_List);
3004
            Next (Index);
3005
            Next (S);
3006
         end loop;
3007
 
3008
      end Constrain_Array;
3009
 
3010
      ---------------------
3011
      -- Constrain_Index --
3012
      ---------------------
3013
 
3014
      procedure Constrain_Index
3015
        (Index        : Node_Id;
3016
         S            : Node_Id;
3017
         Check_List   : List_Id)
3018
      is
3019
         T : constant Entity_Id := Etype (Index);
3020
 
3021
      begin
3022
         if Nkind (S) = N_Range then
3023
            Process_Range_Expr_In_Decl (S, T, Check_List);
3024
         end if;
3025
      end Constrain_Index;
3026
 
3027
      --------------------------------------
3028
      -- Parent_Subtype_Renaming_Discrims --
3029
      --------------------------------------
3030
 
3031
      function Parent_Subtype_Renaming_Discrims return Boolean is
3032
         De : Entity_Id;
3033
         Dp : Entity_Id;
3034
 
3035
      begin
3036
         if Base_Type (Pe) /= Pe then
3037
            return False;
3038
         end if;
3039
 
3040
         if Etype (Pe) = Pe
3041
           or else not Has_Discriminants (Pe)
3042
           or else Is_Constrained (Pe)
3043
           or else Is_Tagged_Type (Pe)
3044
         then
3045
            return False;
3046
         end if;
3047
 
3048
         --  If there are no explicit stored discriminants we have inherited
3049
         --  the root type discriminants so far, so no renamings occurred.
3050
 
3051
         if First_Discriminant (Pe) = First_Stored_Discriminant (Pe) then
3052
            return False;
3053
         end if;
3054
 
3055
         --  Check if we have done some trivial renaming of the parent
3056
         --  discriminants, i.e. something like
3057
         --
3058
         --    type DT (X1,X2: int) is new PT (X1,X2);
3059
 
3060
         De := First_Discriminant (Pe);
3061
         Dp := First_Discriminant (Etype (Pe));
3062
 
3063
         while Present (De) loop
3064
            pragma Assert (Present (Dp));
3065
 
3066
            if Corresponding_Discriminant (De) /= Dp then
3067
               return True;
3068
            end if;
3069
 
3070
            Next_Discriminant (De);
3071
            Next_Discriminant (Dp);
3072
         end loop;
3073
 
3074
         return Present (Dp);
3075
      end Parent_Subtype_Renaming_Discrims;
3076
 
3077
      ------------------------
3078
      -- Requires_Init_Proc --
3079
      ------------------------
3080
 
3081
      function Requires_Init_Proc (Rec_Id : Entity_Id) return Boolean is
3082
         Comp_Decl : Node_Id;
3083
         Id        : Entity_Id;
3084
         Typ       : Entity_Id;
3085
 
3086
      begin
3087
         --  Definitely do not need one if specifically suppressed
3088
 
3089
         if Suppress_Init_Proc (Rec_Id) then
3090
            return False;
3091
         end if;
3092
 
3093
         --  If it is a type derived from a type with unknown discriminants,
3094
         --  we cannot build an initialization procedure for it.
3095
 
3096
         if Has_Unknown_Discriminants (Rec_Id)
3097
           or else Has_Unknown_Discriminants (Etype (Rec_Id))
3098
         then
3099
            return False;
3100
         end if;
3101
 
3102
         --  Otherwise we need to generate an initialization procedure if
3103
         --  Is_CPP_Class is False and at least one of the following applies:
3104
 
3105
         --  1. Discriminants are present, since they need to be initialized
3106
         --     with the appropriate discriminant constraint expressions.
3107
         --     However, the discriminant of an unchecked union does not
3108
         --     count, since the discriminant is not present.
3109
 
3110
         --  2. The type is a tagged type, since the implicit Tag component
3111
         --     needs to be initialized with a pointer to the dispatch table.
3112
 
3113
         --  3. The type contains tasks
3114
 
3115
         --  4. One or more components has an initial value
3116
 
3117
         --  5. One or more components is for a type which itself requires
3118
         --     an initialization procedure.
3119
 
3120
         --  6. One or more components is a type that requires simple
3121
         --     initialization (see Needs_Simple_Initialization), except
3122
         --     that types Tag and Interface_Tag are excluded, since fields
3123
         --     of these types are initialized by other means.
3124
 
3125
         --  7. The type is the record type built for a task type (since at
3126
         --     the very least, Create_Task must be called)
3127
 
3128
         --  8. The type is the record type built for a protected type (since
3129
         --     at least Initialize_Protection must be called)
3130
 
3131
         --  9. The type is marked as a public entity. The reason we add this
3132
         --     case (even if none of the above apply) is to properly handle
3133
         --     Initialize_Scalars. If a package is compiled without an IS
3134
         --     pragma, and the client is compiled with an IS pragma, then
3135
         --     the client will think an initialization procedure is present
3136
         --     and call it, when in fact no such procedure is required, but
3137
         --     since the call is generated, there had better be a routine
3138
         --     at the other end of the call, even if it does nothing!)
3139
 
3140
         --  Note: the reason we exclude the CPP_Class case is because in this
3141
         --  case the initialization is performed in the C++ side.
3142
 
3143
         if Is_CPP_Class (Rec_Id) then
3144
            return False;
3145
 
3146
         elsif Is_Interface (Rec_Id) then
3147
            return False;
3148
 
3149
         elsif (Has_Discriminants (Rec_Id)
3150
                  and then not Is_Unchecked_Union (Rec_Id))
3151
           or else Is_Tagged_Type (Rec_Id)
3152
           or else Is_Concurrent_Record_Type (Rec_Id)
3153
           or else Has_Task (Rec_Id)
3154
         then
3155
            return True;
3156
         end if;
3157
 
3158
         Id := First_Component (Rec_Id);
3159
         while Present (Id) loop
3160
            Comp_Decl := Parent (Id);
3161
            Typ := Etype (Id);
3162
 
3163
            if Present (Expression (Comp_Decl))
3164
              or else Has_Non_Null_Base_Init_Proc (Typ)
3165
              or else Component_Needs_Simple_Initialization (Typ)
3166
            then
3167
               return True;
3168
            end if;
3169
 
3170
            Next_Component (Id);
3171
         end loop;
3172
 
3173
         --  As explained above, a record initialization procedure is needed
3174
         --  for public types in case Initialize_Scalars applies to a client.
3175
         --  However, such a procedure is not needed in the case where either
3176
         --  of restrictions No_Initialize_Scalars or No_Default_Initialization
3177
         --  applies. No_Initialize_Scalars excludes the possibility of using
3178
         --  Initialize_Scalars in any partition, and No_Default_Initialization
3179
         --  implies that no initialization should ever be done for objects of
3180
         --  the type, so is incompatible with Initialize_Scalars.
3181
 
3182
         if not Restriction_Active (No_Initialize_Scalars)
3183
           and then not Restriction_Active (No_Default_Initialization)
3184
           and then Is_Public (Rec_Id)
3185
         then
3186
            return True;
3187
         end if;
3188
 
3189
         return False;
3190
      end Requires_Init_Proc;
3191
 
3192
   --  Start of processing for Build_Record_Init_Proc
3193
 
3194
   begin
3195
      --  Check for value type, which means no initialization required
3196
 
3197
      Rec_Type := Defining_Identifier (N);
3198
 
3199
      if Is_Value_Type (Rec_Type) then
3200
         return;
3201
      end if;
3202
 
3203
      --  This may be full declaration of a private type, in which case
3204
      --  the visible entity is a record, and the private entity has been
3205
      --  exchanged with it in the private part of the current package.
3206
      --  The initialization procedure is built for the record type, which
3207
      --  is retrievable from the private entity.
3208
 
3209
      if Is_Incomplete_Or_Private_Type (Rec_Type) then
3210
         Rec_Type := Underlying_Type (Rec_Type);
3211
      end if;
3212
 
3213
      --  If there are discriminants, build the discriminant map to replace
3214
      --  discriminants by their discriminals in complex bound expressions.
3215
      --  These only arise for the corresponding records of synchronized types.
3216
 
3217
      if Is_Concurrent_Record_Type (Rec_Type)
3218
        and then Has_Discriminants (Rec_Type)
3219
      then
3220
         declare
3221
            Disc : Entity_Id;
3222
         begin
3223
            Disc := First_Discriminant (Rec_Type);
3224
            while Present (Disc) loop
3225
               Append_Elmt (Disc, Discr_Map);
3226
               Append_Elmt (Discriminal (Disc), Discr_Map);
3227
               Next_Discriminant (Disc);
3228
            end loop;
3229
         end;
3230
      end if;
3231
 
3232
      --  Derived types that have no type extension can use the initialization
3233
      --  procedure of their parent and do not need a procedure of their own.
3234
      --  This is only correct if there are no representation clauses for the
3235
      --  type or its parent, and if the parent has in fact been frozen so
3236
      --  that its initialization procedure exists.
3237
 
3238
      if Is_Derived_Type (Rec_Type)
3239
        and then not Is_Tagged_Type (Rec_Type)
3240
        and then not Is_Unchecked_Union (Rec_Type)
3241
        and then not Has_New_Non_Standard_Rep (Rec_Type)
3242
        and then not Parent_Subtype_Renaming_Discrims
3243
        and then Has_Non_Null_Base_Init_Proc (Etype (Rec_Type))
3244
      then
3245
         Copy_TSS (Base_Init_Proc (Etype (Rec_Type)), Rec_Type);
3246
 
3247
      --  Otherwise if we need an initialization procedure, then build one,
3248
      --  mark it as public and inlinable and as having a completion.
3249
 
3250
      elsif Requires_Init_Proc (Rec_Type)
3251
        or else Is_Unchecked_Union (Rec_Type)
3252
      then
3253
         Proc_Id :=
3254
           Make_Defining_Identifier (Loc,
3255
             Chars => Make_Init_Proc_Name (Rec_Type));
3256
 
3257
         --  If No_Default_Initialization restriction is active, then we don't
3258
         --  want to build an init_proc, but we need to mark that an init_proc
3259
         --  would be needed if this restriction was not active (so that we can
3260
         --  detect attempts to call it), so set a dummy init_proc in place.
3261
 
3262
         if Restriction_Active (No_Default_Initialization) then
3263
            Set_Init_Proc (Rec_Type, Proc_Id);
3264
            return;
3265
         end if;
3266
 
3267
         Build_Offset_To_Top_Functions;
3268
         Build_Init_Procedure;
3269
         Set_Is_Public (Proc_Id, Is_Public (Pe));
3270
 
3271
         --  The initialization of protected records is not worth inlining.
3272
         --  In addition, when compiled for another unit for inlining purposes,
3273
         --  it may make reference to entities that have not been elaborated
3274
         --  yet. The initialization of controlled records contains a nested
3275
         --  clean-up procedure that makes it impractical to inline as well,
3276
         --  and leads to undefined symbols if inlined in a different unit.
3277
         --  Similar considerations apply to task types.
3278
 
3279
         if not Is_Concurrent_Type (Rec_Type)
3280
           and then not Has_Task (Rec_Type)
3281
           and then not Needs_Finalization (Rec_Type)
3282
         then
3283
            Set_Is_Inlined  (Proc_Id);
3284
         end if;
3285
 
3286
         Set_Is_Internal    (Proc_Id);
3287
         Set_Has_Completion (Proc_Id);
3288
 
3289
         if not Debug_Generated_Code then
3290
            Set_Debug_Info_Off (Proc_Id);
3291
         end if;
3292
 
3293
         declare
3294
            Agg : constant Node_Id :=
3295
                    Build_Equivalent_Record_Aggregate (Rec_Type);
3296
 
3297
            procedure Collect_Itypes (Comp : Node_Id);
3298
            --  Generate references to itypes in the aggregate, because
3299
            --  the first use of the aggregate may be in a nested scope.
3300
 
3301
            --------------------
3302
            -- Collect_Itypes --
3303
            --------------------
3304
 
3305
            procedure Collect_Itypes (Comp : Node_Id) is
3306
               Ref      : Node_Id;
3307
               Sub_Aggr : Node_Id;
3308
               Typ      : constant Entity_Id := Etype (Comp);
3309
 
3310
            begin
3311
               if Is_Array_Type (Typ)
3312
                 and then Is_Itype (Typ)
3313
               then
3314
                  Ref := Make_Itype_Reference (Loc);
3315
                  Set_Itype (Ref, Typ);
3316
                  Append_Freeze_Action (Rec_Type, Ref);
3317
 
3318
                  Ref := Make_Itype_Reference (Loc);
3319
                  Set_Itype (Ref, Etype (First_Index (Typ)));
3320
                  Append_Freeze_Action (Rec_Type, Ref);
3321
 
3322
                  Sub_Aggr := First (Expressions (Comp));
3323
 
3324
                  --  Recurse on nested arrays
3325
 
3326
                  while Present (Sub_Aggr) loop
3327
                     Collect_Itypes (Sub_Aggr);
3328
                     Next (Sub_Aggr);
3329
                  end loop;
3330
               end if;
3331
            end Collect_Itypes;
3332
 
3333
         begin
3334
            --  If there is a static initialization aggregate for the type,
3335
            --  generate itype references for the types of its (sub)components,
3336
            --  to prevent out-of-scope errors in the resulting tree.
3337
            --  The aggregate may have been rewritten as a Raise node, in which
3338
            --  case there are no relevant itypes.
3339
 
3340
            if Present (Agg)
3341
              and then Nkind (Agg) = N_Aggregate
3342
            then
3343
               Set_Static_Initialization (Proc_Id, Agg);
3344
 
3345
               declare
3346
                  Comp  : Node_Id;
3347
               begin
3348
                  Comp := First (Component_Associations (Agg));
3349
                  while Present (Comp) loop
3350
                     Collect_Itypes (Expression (Comp));
3351
                     Next (Comp);
3352
                  end loop;
3353
               end;
3354
            end if;
3355
         end;
3356
      end if;
3357
   end Build_Record_Init_Proc;
3358
 
3359
   ----------------------------
3360
   -- Build_Slice_Assignment --
3361
   ----------------------------
3362
 
3363
   --  Generates the following subprogram:
3364
 
3365
   --    procedure Assign
3366
   --     (Source,  Target    : Array_Type,
3367
   --      Left_Lo, Left_Hi   : Index;
3368
   --      Right_Lo, Right_Hi : Index;
3369
   --      Rev                : Boolean)
3370
   --    is
3371
   --       Li1 : Index;
3372
   --       Ri1 : Index;
3373
 
3374
   --    begin
3375
 
3376
   --       if Left_Hi < Left_Lo then
3377
   --          return;
3378
   --       end if;
3379
 
3380
   --       if Rev  then
3381
   --          Li1 := Left_Hi;
3382
   --          Ri1 := Right_Hi;
3383
   --       else
3384
   --          Li1 := Left_Lo;
3385
   --          Ri1 := Right_Lo;
3386
   --       end if;
3387
 
3388
   --       loop
3389
   --          Target (Li1) := Source (Ri1);
3390
 
3391
   --          if Rev then
3392
   --             exit when Li1 = Left_Lo;
3393
   --             Li1 := Index'pred (Li1);
3394
   --             Ri1 := Index'pred (Ri1);
3395
   --          else
3396
   --             exit when Li1 = Left_Hi;
3397
   --             Li1 := Index'succ (Li1);
3398
   --             Ri1 := Index'succ (Ri1);
3399
   --          end if;
3400
   --       end loop;
3401
   --    end Assign;
3402
 
3403
   procedure Build_Slice_Assignment (Typ : Entity_Id) is
3404
      Loc   : constant Source_Ptr := Sloc (Typ);
3405
      Index : constant Entity_Id  := Base_Type (Etype (First_Index (Typ)));
3406
 
3407
      --  Build formal parameters of procedure
3408
 
3409
      Larray   : constant Entity_Id :=
3410
                   Make_Defining_Identifier
3411
                     (Loc, Chars => New_Internal_Name ('A'));
3412
      Rarray   : constant Entity_Id :=
3413
                   Make_Defining_Identifier
3414
                     (Loc, Chars => New_Internal_Name ('R'));
3415
      Left_Lo  : constant Entity_Id :=
3416
                   Make_Defining_Identifier
3417
                     (Loc, Chars => New_Internal_Name ('L'));
3418
      Left_Hi  : constant Entity_Id :=
3419
                   Make_Defining_Identifier
3420
                     (Loc, Chars => New_Internal_Name ('L'));
3421
      Right_Lo : constant Entity_Id :=
3422
                   Make_Defining_Identifier
3423
                     (Loc, Chars => New_Internal_Name ('R'));
3424
      Right_Hi : constant Entity_Id :=
3425
                   Make_Defining_Identifier
3426
                     (Loc, Chars => New_Internal_Name ('R'));
3427
      Rev      : constant Entity_Id :=
3428
                   Make_Defining_Identifier
3429
                     (Loc, Chars => New_Internal_Name ('D'));
3430
      Proc_Name : constant Entity_Id :=
3431
                    Make_Defining_Identifier (Loc,
3432
                      Chars => Make_TSS_Name (Typ, TSS_Slice_Assign));
3433
 
3434
      Lnn : constant Entity_Id :=
3435
              Make_Defining_Identifier (Loc, New_Internal_Name ('L'));
3436
      Rnn : constant Entity_Id :=
3437
              Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
3438
      --  Subscripts for left and right sides
3439
 
3440
      Decls : List_Id;
3441
      Loops : Node_Id;
3442
      Stats : List_Id;
3443
 
3444
   begin
3445
      --  Build declarations for indices
3446
 
3447
      Decls := New_List;
3448
 
3449
      Append_To (Decls,
3450
         Make_Object_Declaration (Loc,
3451
           Defining_Identifier => Lnn,
3452
           Object_Definition  =>
3453
             New_Occurrence_Of (Index, Loc)));
3454
 
3455
      Append_To (Decls,
3456
        Make_Object_Declaration (Loc,
3457
          Defining_Identifier => Rnn,
3458
          Object_Definition  =>
3459
            New_Occurrence_Of (Index, Loc)));
3460
 
3461
      Stats := New_List;
3462
 
3463
      --  Build test for empty slice case
3464
 
3465
      Append_To (Stats,
3466
        Make_If_Statement (Loc,
3467
          Condition =>
3468
             Make_Op_Lt (Loc,
3469
               Left_Opnd  => New_Occurrence_Of (Left_Hi, Loc),
3470
               Right_Opnd => New_Occurrence_Of (Left_Lo, Loc)),
3471
          Then_Statements => New_List (Make_Simple_Return_Statement (Loc))));
3472
 
3473
      --  Build initializations for indices
3474
 
3475
      declare
3476
         F_Init : constant List_Id := New_List;
3477
         B_Init : constant List_Id := New_List;
3478
 
3479
      begin
3480
         Append_To (F_Init,
3481
           Make_Assignment_Statement (Loc,
3482
             Name => New_Occurrence_Of (Lnn, Loc),
3483
             Expression => New_Occurrence_Of (Left_Lo, Loc)));
3484
 
3485
         Append_To (F_Init,
3486
           Make_Assignment_Statement (Loc,
3487
             Name => New_Occurrence_Of (Rnn, Loc),
3488
             Expression => New_Occurrence_Of (Right_Lo, Loc)));
3489
 
3490
         Append_To (B_Init,
3491
           Make_Assignment_Statement (Loc,
3492
             Name => New_Occurrence_Of (Lnn, Loc),
3493
             Expression => New_Occurrence_Of (Left_Hi, Loc)));
3494
 
3495
         Append_To (B_Init,
3496
           Make_Assignment_Statement (Loc,
3497
             Name => New_Occurrence_Of (Rnn, Loc),
3498
             Expression => New_Occurrence_Of (Right_Hi, Loc)));
3499
 
3500
         Append_To (Stats,
3501
           Make_If_Statement (Loc,
3502
             Condition => New_Occurrence_Of (Rev, Loc),
3503
             Then_Statements => B_Init,
3504
             Else_Statements => F_Init));
3505
      end;
3506
 
3507
      --  Now construct the assignment statement
3508
 
3509
      Loops :=
3510
        Make_Loop_Statement (Loc,
3511
          Statements => New_List (
3512
            Make_Assignment_Statement (Loc,
3513
              Name =>
3514
                Make_Indexed_Component (Loc,
3515
                  Prefix => New_Occurrence_Of (Larray, Loc),
3516
                  Expressions => New_List (New_Occurrence_Of (Lnn, Loc))),
3517
              Expression =>
3518
                Make_Indexed_Component (Loc,
3519
                  Prefix => New_Occurrence_Of (Rarray, Loc),
3520
                  Expressions => New_List (New_Occurrence_Of (Rnn, Loc))))),
3521
          End_Label  => Empty);
3522
 
3523
      --  Build the exit condition and increment/decrement statements
3524
 
3525
      declare
3526
         F_Ass : constant List_Id := New_List;
3527
         B_Ass : constant List_Id := New_List;
3528
 
3529
      begin
3530
         Append_To (F_Ass,
3531
           Make_Exit_Statement (Loc,
3532
             Condition =>
3533
               Make_Op_Eq (Loc,
3534
                 Left_Opnd  => New_Occurrence_Of (Lnn, Loc),
3535
                 Right_Opnd => New_Occurrence_Of (Left_Hi, Loc))));
3536
 
3537
         Append_To (F_Ass,
3538
           Make_Assignment_Statement (Loc,
3539
             Name => New_Occurrence_Of (Lnn, Loc),
3540
             Expression =>
3541
               Make_Attribute_Reference (Loc,
3542
                 Prefix =>
3543
                   New_Occurrence_Of (Index, Loc),
3544
                 Attribute_Name => Name_Succ,
3545
                 Expressions => New_List (
3546
                   New_Occurrence_Of (Lnn, Loc)))));
3547
 
3548
         Append_To (F_Ass,
3549
           Make_Assignment_Statement (Loc,
3550
             Name => New_Occurrence_Of (Rnn, Loc),
3551
             Expression =>
3552
               Make_Attribute_Reference (Loc,
3553
                 Prefix =>
3554
                   New_Occurrence_Of (Index, Loc),
3555
                 Attribute_Name => Name_Succ,
3556
                 Expressions => New_List (
3557
                   New_Occurrence_Of (Rnn, Loc)))));
3558
 
3559
         Append_To (B_Ass,
3560
           Make_Exit_Statement (Loc,
3561
             Condition =>
3562
               Make_Op_Eq (Loc,
3563
                 Left_Opnd  => New_Occurrence_Of (Lnn, Loc),
3564
                 Right_Opnd => New_Occurrence_Of (Left_Lo, Loc))));
3565
 
3566
         Append_To (B_Ass,
3567
           Make_Assignment_Statement (Loc,
3568
             Name => New_Occurrence_Of (Lnn, Loc),
3569
             Expression =>
3570
               Make_Attribute_Reference (Loc,
3571
                 Prefix =>
3572
                   New_Occurrence_Of (Index, Loc),
3573
                 Attribute_Name => Name_Pred,
3574
                   Expressions => New_List (
3575
                     New_Occurrence_Of (Lnn, Loc)))));
3576
 
3577
         Append_To (B_Ass,
3578
           Make_Assignment_Statement (Loc,
3579
             Name => New_Occurrence_Of (Rnn, Loc),
3580
             Expression =>
3581
               Make_Attribute_Reference (Loc,
3582
                 Prefix =>
3583
                   New_Occurrence_Of (Index, Loc),
3584
                 Attribute_Name => Name_Pred,
3585
                 Expressions => New_List (
3586
                   New_Occurrence_Of (Rnn, Loc)))));
3587
 
3588
         Append_To (Statements (Loops),
3589
           Make_If_Statement (Loc,
3590
             Condition => New_Occurrence_Of (Rev, Loc),
3591
             Then_Statements => B_Ass,
3592
             Else_Statements => F_Ass));
3593
      end;
3594
 
3595
      Append_To (Stats, Loops);
3596
 
3597
      declare
3598
         Spec    : Node_Id;
3599
         Formals : List_Id := New_List;
3600
 
3601
      begin
3602
         Formals := New_List (
3603
           Make_Parameter_Specification (Loc,
3604
             Defining_Identifier => Larray,
3605
             Out_Present => True,
3606
             Parameter_Type =>
3607
               New_Reference_To (Base_Type (Typ), Loc)),
3608
 
3609
           Make_Parameter_Specification (Loc,
3610
             Defining_Identifier => Rarray,
3611
             Parameter_Type =>
3612
               New_Reference_To (Base_Type (Typ), Loc)),
3613
 
3614
           Make_Parameter_Specification (Loc,
3615
             Defining_Identifier => Left_Lo,
3616
             Parameter_Type =>
3617
               New_Reference_To (Index, Loc)),
3618
 
3619
           Make_Parameter_Specification (Loc,
3620
             Defining_Identifier => Left_Hi,
3621
             Parameter_Type =>
3622
               New_Reference_To (Index, Loc)),
3623
 
3624
           Make_Parameter_Specification (Loc,
3625
             Defining_Identifier => Right_Lo,
3626
             Parameter_Type =>
3627
               New_Reference_To (Index, Loc)),
3628
 
3629
           Make_Parameter_Specification (Loc,
3630
             Defining_Identifier => Right_Hi,
3631
             Parameter_Type =>
3632
               New_Reference_To (Index, Loc)));
3633
 
3634
         Append_To (Formals,
3635
           Make_Parameter_Specification (Loc,
3636
             Defining_Identifier => Rev,
3637
             Parameter_Type =>
3638
               New_Reference_To (Standard_Boolean, Loc)));
3639
 
3640
         Spec :=
3641
           Make_Procedure_Specification (Loc,
3642
             Defining_Unit_Name       => Proc_Name,
3643
             Parameter_Specifications => Formals);
3644
 
3645
         Discard_Node (
3646
           Make_Subprogram_Body (Loc,
3647
             Specification              => Spec,
3648
             Declarations               => Decls,
3649
             Handled_Statement_Sequence =>
3650
               Make_Handled_Sequence_Of_Statements (Loc,
3651
                 Statements => Stats)));
3652
      end;
3653
 
3654
      Set_TSS (Typ, Proc_Name);
3655
      Set_Is_Pure (Proc_Name);
3656
   end Build_Slice_Assignment;
3657
 
3658
   ------------------------------------
3659
   -- Build_Variant_Record_Equality --
3660
   ------------------------------------
3661
 
3662
   --  Generates:
3663
 
3664
   --    function _Equality (X, Y : T) return Boolean is
3665
   --    begin
3666
   --       --  Compare discriminants
3667
 
3668
   --       if False or else X.D1 /= Y.D1 or else X.D2 /= Y.D2 then
3669
   --          return False;
3670
   --       end if;
3671
 
3672
   --       --  Compare components
3673
 
3674
   --       if False or else X.C1 /= Y.C1 or else X.C2 /= Y.C2 then
3675
   --          return False;
3676
   --       end if;
3677
 
3678
   --       --  Compare variant part
3679
 
3680
   --       case X.D1 is
3681
   --          when V1 =>
3682
   --             if False or else X.C2 /= Y.C2 or else X.C3 /= Y.C3 then
3683
   --                return False;
3684
   --             end if;
3685
   --          ...
3686
   --          when Vn =>
3687
   --             if False or else X.Cn /= Y.Cn then
3688
   --                return False;
3689
   --             end if;
3690
   --       end case;
3691
 
3692
   --       return True;
3693
   --    end _Equality;
3694
 
3695
   procedure Build_Variant_Record_Equality (Typ : Entity_Id) is
3696
      Loc : constant Source_Ptr := Sloc (Typ);
3697
 
3698
      F : constant Entity_Id :=
3699
            Make_Defining_Identifier (Loc,
3700
              Chars => Make_TSS_Name (Typ, TSS_Composite_Equality));
3701
 
3702
      X : constant Entity_Id :=
3703
           Make_Defining_Identifier (Loc,
3704
             Chars => Name_X);
3705
 
3706
      Y : constant Entity_Id :=
3707
            Make_Defining_Identifier (Loc,
3708
              Chars => Name_Y);
3709
 
3710
      Def    : constant Node_Id := Parent (Typ);
3711
      Comps  : constant Node_Id := Component_List (Type_Definition (Def));
3712
      Stmts  : constant List_Id := New_List;
3713
      Pspecs : constant List_Id := New_List;
3714
 
3715
   begin
3716
      --  Derived Unchecked_Union types no longer inherit the equality function
3717
      --  of their parent.
3718
 
3719
      if Is_Derived_Type (Typ)
3720
        and then not Is_Unchecked_Union (Typ)
3721
        and then not Has_New_Non_Standard_Rep (Typ)
3722
      then
3723
         declare
3724
            Parent_Eq : constant Entity_Id :=
3725
                          TSS (Root_Type (Typ), TSS_Composite_Equality);
3726
 
3727
         begin
3728
            if Present (Parent_Eq) then
3729
               Copy_TSS (Parent_Eq, Typ);
3730
               return;
3731
            end if;
3732
         end;
3733
      end if;
3734
 
3735
      Discard_Node (
3736
        Make_Subprogram_Body (Loc,
3737
          Specification =>
3738
            Make_Function_Specification (Loc,
3739
              Defining_Unit_Name       => F,
3740
              Parameter_Specifications => Pspecs,
3741
              Result_Definition => New_Reference_To (Standard_Boolean, Loc)),
3742
          Declarations               => New_List,
3743
          Handled_Statement_Sequence =>
3744
            Make_Handled_Sequence_Of_Statements (Loc,
3745
              Statements => Stmts)));
3746
 
3747
      Append_To (Pspecs,
3748
        Make_Parameter_Specification (Loc,
3749
          Defining_Identifier => X,
3750
          Parameter_Type      => New_Reference_To (Typ, Loc)));
3751
 
3752
      Append_To (Pspecs,
3753
        Make_Parameter_Specification (Loc,
3754
          Defining_Identifier => Y,
3755
          Parameter_Type      => New_Reference_To (Typ, Loc)));
3756
 
3757
      --  Unchecked_Unions require additional machinery to support equality.
3758
      --  Two extra parameters (A and B) are added to the equality function
3759
      --  parameter list in order to capture the inferred values of the
3760
      --  discriminants in later calls.
3761
 
3762
      if Is_Unchecked_Union (Typ) then
3763
         declare
3764
            Discr_Type : constant Node_Id := Etype (First_Discriminant (Typ));
3765
 
3766
            A : constant Node_Id :=
3767
                  Make_Defining_Identifier (Loc,
3768
                    Chars => Name_A);
3769
 
3770
            B : constant Node_Id :=
3771
                  Make_Defining_Identifier (Loc,
3772
                    Chars => Name_B);
3773
 
3774
         begin
3775
            --  Add A and B to the parameter list
3776
 
3777
            Append_To (Pspecs,
3778
              Make_Parameter_Specification (Loc,
3779
                Defining_Identifier => A,
3780
                Parameter_Type => New_Reference_To (Discr_Type, Loc)));
3781
 
3782
            Append_To (Pspecs,
3783
              Make_Parameter_Specification (Loc,
3784
                Defining_Identifier => B,
3785
                Parameter_Type => New_Reference_To (Discr_Type, Loc)));
3786
 
3787
            --  Generate the following header code to compare the inferred
3788
            --  discriminants:
3789
 
3790
            --  if a /= b then
3791
            --     return False;
3792
            --  end if;
3793
 
3794
            Append_To (Stmts,
3795
              Make_If_Statement (Loc,
3796
                Condition =>
3797
                  Make_Op_Ne (Loc,
3798
                    Left_Opnd => New_Reference_To (A, Loc),
3799
                    Right_Opnd => New_Reference_To (B, Loc)),
3800
                Then_Statements => New_List (
3801
                  Make_Simple_Return_Statement (Loc,
3802
                    Expression => New_Occurrence_Of (Standard_False, Loc)))));
3803
 
3804
            --  Generate component-by-component comparison. Note that we must
3805
            --  propagate one of the inferred discriminant formals to act as
3806
            --  the case statement switch.
3807
 
3808
            Append_List_To (Stmts,
3809
              Make_Eq_Case (Typ, Comps, A));
3810
 
3811
         end;
3812
 
3813
      --  Normal case (not unchecked union)
3814
 
3815
      else
3816
         Append_To (Stmts,
3817
           Make_Eq_If (Typ,
3818
             Discriminant_Specifications (Def)));
3819
 
3820
         Append_List_To (Stmts,
3821
           Make_Eq_Case (Typ, Comps));
3822
      end if;
3823
 
3824
      Append_To (Stmts,
3825
        Make_Simple_Return_Statement (Loc,
3826
          Expression => New_Reference_To (Standard_True, Loc)));
3827
 
3828
      Set_TSS (Typ, F);
3829
      Set_Is_Pure (F);
3830
 
3831
      if not Debug_Generated_Code then
3832
         Set_Debug_Info_Off (F);
3833
      end if;
3834
   end Build_Variant_Record_Equality;
3835
 
3836
   -----------------------------
3837
   -- Check_Stream_Attributes --
3838
   -----------------------------
3839
 
3840
   procedure Check_Stream_Attributes (Typ : Entity_Id) is
3841
      Comp      : Entity_Id;
3842
      Par_Read  : constant Boolean :=
3843
                    Stream_Attribute_Available (Typ, TSS_Stream_Read)
3844
                      and then not Has_Specified_Stream_Read (Typ);
3845
      Par_Write : constant Boolean :=
3846
                    Stream_Attribute_Available (Typ, TSS_Stream_Write)
3847
                      and then not Has_Specified_Stream_Write (Typ);
3848
 
3849
      procedure Check_Attr (Nam : Name_Id; TSS_Nam : TSS_Name_Type);
3850
      --  Check that Comp has a user-specified Nam stream attribute
3851
 
3852
      ----------------
3853
      -- Check_Attr --
3854
      ----------------
3855
 
3856
      procedure Check_Attr (Nam : Name_Id; TSS_Nam : TSS_Name_Type) is
3857
      begin
3858
         if not Stream_Attribute_Available (Etype (Comp), TSS_Nam) then
3859
            Error_Msg_Name_1 := Nam;
3860
            Error_Msg_N
3861
              ("|component& in limited extension must have% attribute", Comp);
3862
         end if;
3863
      end Check_Attr;
3864
 
3865
   --  Start of processing for Check_Stream_Attributes
3866
 
3867
   begin
3868
      if Par_Read or else Par_Write then
3869
         Comp := First_Component (Typ);
3870
         while Present (Comp) loop
3871
            if Comes_From_Source (Comp)
3872
              and then Original_Record_Component (Comp) = Comp
3873
              and then Is_Limited_Type (Etype (Comp))
3874
            then
3875
               if Par_Read then
3876
                  Check_Attr (Name_Read, TSS_Stream_Read);
3877
               end if;
3878
 
3879
               if Par_Write then
3880
                  Check_Attr (Name_Write, TSS_Stream_Write);
3881
               end if;
3882
            end if;
3883
 
3884
            Next_Component (Comp);
3885
         end loop;
3886
      end if;
3887
   end Check_Stream_Attributes;
3888
 
3889
   -----------------------------
3890
   -- Expand_Record_Extension --
3891
   -----------------------------
3892
 
3893
   --  Add a field _parent at the beginning of the record extension. This is
3894
   --  used to implement inheritance. Here are some examples of expansion:
3895
 
3896
   --  1. no discriminants
3897
   --      type T2 is new T1 with null record;
3898
   --   gives
3899
   --      type T2 is new T1 with record
3900
   --        _Parent : T1;
3901
   --      end record;
3902
 
3903
   --  2. renamed discriminants
3904
   --    type T2 (B, C : Int) is new T1 (A => B) with record
3905
   --       _Parent : T1 (A => B);
3906
   --       D : Int;
3907
   --    end;
3908
 
3909
   --  3. inherited discriminants
3910
   --    type T2 is new T1 with record -- discriminant A inherited
3911
   --       _Parent : T1 (A);
3912
   --       D : Int;
3913
   --    end;
3914
 
3915
   procedure Expand_Record_Extension (T : Entity_Id; Def : Node_Id) is
3916
      Indic        : constant Node_Id    := Subtype_Indication (Def);
3917
      Loc          : constant Source_Ptr := Sloc (Def);
3918
      Rec_Ext_Part : Node_Id             := Record_Extension_Part (Def);
3919
      Par_Subtype  : Entity_Id;
3920
      Comp_List    : Node_Id;
3921
      Comp_Decl    : Node_Id;
3922
      Parent_N     : Node_Id;
3923
      D            : Entity_Id;
3924
      List_Constr  : constant List_Id    := New_List;
3925
 
3926
   begin
3927
      --  Expand_Record_Extension is called directly from the semantics, so
3928
      --  we must check to see whether expansion is active before proceeding
3929
 
3930
      if not Expander_Active then
3931
         return;
3932
      end if;
3933
 
3934
      --  This may be a derivation of an untagged private type whose full
3935
      --  view is tagged, in which case the Derived_Type_Definition has no
3936
      --  extension part. Build an empty one now.
3937
 
3938
      if No (Rec_Ext_Part) then
3939
         Rec_Ext_Part :=
3940
           Make_Record_Definition (Loc,
3941
             End_Label      => Empty,
3942
             Component_List => Empty,
3943
             Null_Present   => True);
3944
 
3945
         Set_Record_Extension_Part (Def, Rec_Ext_Part);
3946
         Mark_Rewrite_Insertion (Rec_Ext_Part);
3947
      end if;
3948
 
3949
      Comp_List := Component_List (Rec_Ext_Part);
3950
 
3951
      Parent_N := Make_Defining_Identifier (Loc, Name_uParent);
3952
 
3953
      --  If the derived type inherits its discriminants the type of the
3954
      --  _parent field must be constrained by the inherited discriminants
3955
 
3956
      if Has_Discriminants (T)
3957
        and then Nkind (Indic) /= N_Subtype_Indication
3958
        and then not Is_Constrained (Entity (Indic))
3959
      then
3960
         D := First_Discriminant (T);
3961
         while Present (D) loop
3962
            Append_To (List_Constr, New_Occurrence_Of (D, Loc));
3963
            Next_Discriminant (D);
3964
         end loop;
3965
 
3966
         Par_Subtype :=
3967
           Process_Subtype (
3968
             Make_Subtype_Indication (Loc,
3969
               Subtype_Mark => New_Reference_To (Entity (Indic), Loc),
3970
               Constraint   =>
3971
                 Make_Index_Or_Discriminant_Constraint (Loc,
3972
                   Constraints => List_Constr)),
3973
             Def);
3974
 
3975
      --  Otherwise the original subtype_indication is just what is needed
3976
 
3977
      else
3978
         Par_Subtype := Process_Subtype (New_Copy_Tree (Indic), Def);
3979
      end if;
3980
 
3981
      Set_Parent_Subtype (T, Par_Subtype);
3982
 
3983
      Comp_Decl :=
3984
        Make_Component_Declaration (Loc,
3985
          Defining_Identifier => Parent_N,
3986
          Component_Definition =>
3987
            Make_Component_Definition (Loc,
3988
              Aliased_Present => False,
3989
              Subtype_Indication => New_Reference_To (Par_Subtype, Loc)));
3990
 
3991
      if Null_Present (Rec_Ext_Part) then
3992
         Set_Component_List (Rec_Ext_Part,
3993
           Make_Component_List (Loc,
3994
             Component_Items => New_List (Comp_Decl),
3995
             Variant_Part => Empty,
3996
             Null_Present => False));
3997
         Set_Null_Present (Rec_Ext_Part, False);
3998
 
3999
      elsif Null_Present (Comp_List)
4000
        or else Is_Empty_List (Component_Items (Comp_List))
4001
      then
4002
         Set_Component_Items (Comp_List, New_List (Comp_Decl));
4003
         Set_Null_Present (Comp_List, False);
4004
 
4005
      else
4006
         Insert_Before (First (Component_Items (Comp_List)), Comp_Decl);
4007
      end if;
4008
 
4009
      Analyze (Comp_Decl);
4010
   end Expand_Record_Extension;
4011
 
4012
   ------------------------------------
4013
   -- Expand_N_Full_Type_Declaration --
4014
   ------------------------------------
4015
 
4016
   procedure Expand_N_Full_Type_Declaration (N : Node_Id) is
4017
      Def_Id : constant Entity_Id := Defining_Identifier (N);
4018
      B_Id   : constant Entity_Id := Base_Type (Def_Id);
4019
      Par_Id : Entity_Id;
4020
      FN     : Node_Id;
4021
 
4022
      procedure Build_Master (Def_Id : Entity_Id);
4023
      --  Create the master associated with Def_Id
4024
 
4025
      ------------------
4026
      -- Build_Master --
4027
      ------------------
4028
 
4029
      procedure Build_Master (Def_Id : Entity_Id) is
4030
      begin
4031
         --  Anonymous access types are created for the components of the
4032
         --  record parameter for an entry declaration. No master is created
4033
         --  for such a type.
4034
 
4035
         if Has_Task (Designated_Type (Def_Id))
4036
           and then Comes_From_Source (N)
4037
         then
4038
            Build_Master_Entity (Def_Id);
4039
            Build_Master_Renaming (Parent (Def_Id), Def_Id);
4040
 
4041
         --  Create a class-wide master because a Master_Id must be generated
4042
         --  for access-to-limited-class-wide types whose root may be extended
4043
         --  with task components.
4044
 
4045
         --  Note: This code covers access-to-limited-interfaces because they
4046
         --        can be used to reference tasks implementing them.
4047
 
4048
         elsif Is_Class_Wide_Type (Designated_Type (Def_Id))
4049
           and then Is_Limited_Type (Designated_Type (Def_Id))
4050
           and then Tasking_Allowed
4051
 
4052
            --  Do not create a class-wide master for types whose convention is
4053
            --  Java since these types cannot embed Ada tasks anyway. Note that
4054
            --  the following test cannot catch the following case:
4055
 
4056
            --      package java.lang.Object is
4057
            --         type Typ is tagged limited private;
4058
            --         type Ref is access all Typ'Class;
4059
            --      private
4060
            --         type Typ is tagged limited ...;
4061
            --         pragma Convention (Typ, Java)
4062
            --      end;
4063
 
4064
            --  Because the convention appears after we have done the
4065
            --  processing for type Ref.
4066
 
4067
           and then Convention (Designated_Type (Def_Id)) /= Convention_Java
4068
           and then Convention (Designated_Type (Def_Id)) /= Convention_CIL
4069
         then
4070
            Build_Class_Wide_Master (Def_Id);
4071
         end if;
4072
      end Build_Master;
4073
 
4074
   --  Start of processing for Expand_N_Full_Type_Declaration
4075
 
4076
   begin
4077
      if Is_Access_Type (Def_Id) then
4078
         Build_Master (Def_Id);
4079
 
4080
         if Ekind (Def_Id) = E_Access_Protected_Subprogram_Type then
4081
            Expand_Access_Protected_Subprogram_Type (N);
4082
         end if;
4083
 
4084
      elsif Ada_Version >= Ada_05
4085
        and then Is_Array_Type (Def_Id)
4086
        and then Is_Access_Type (Component_Type (Def_Id))
4087
        and then Ekind (Component_Type (Def_Id)) = E_Anonymous_Access_Type
4088
      then
4089
         Build_Master (Component_Type (Def_Id));
4090
 
4091
      elsif Has_Task (Def_Id) then
4092
         Expand_Previous_Access_Type (Def_Id);
4093
 
4094
      elsif Ada_Version >= Ada_05
4095
        and then
4096
         (Is_Record_Type (Def_Id)
4097
           or else (Is_Array_Type (Def_Id)
4098
                      and then Is_Record_Type (Component_Type (Def_Id))))
4099
      then
4100
         declare
4101
            Comp : Entity_Id;
4102
            Typ  : Entity_Id;
4103
            M_Id : Entity_Id;
4104
 
4105
         begin
4106
            --  Look for the first anonymous access type component
4107
 
4108
            if Is_Array_Type (Def_Id) then
4109
               Comp := First_Entity (Component_Type (Def_Id));
4110
            else
4111
               Comp := First_Entity (Def_Id);
4112
            end if;
4113
 
4114
            while Present (Comp) loop
4115
               Typ := Etype (Comp);
4116
 
4117
               exit when Is_Access_Type (Typ)
4118
                 and then Ekind (Typ) = E_Anonymous_Access_Type;
4119
 
4120
               Next_Entity (Comp);
4121
            end loop;
4122
 
4123
            --  If found we add a renaming declaration of master_id and we
4124
            --  associate it to each anonymous access type component. Do
4125
            --  nothing if the access type already has a master. This will be
4126
            --  the case if the array type is the packed array created for a
4127
            --  user-defined array type T, where the master_id is created when
4128
            --  expanding the declaration for T.
4129
 
4130
            if Present (Comp)
4131
              and then Ekind (Typ) = E_Anonymous_Access_Type
4132
              and then not Restriction_Active (No_Task_Hierarchy)
4133
              and then No (Master_Id (Typ))
4134
 
4135
               --  Do not consider run-times with no tasking support
4136
 
4137
              and then RTE_Available (RE_Current_Master)
4138
              and then Has_Task (Non_Limited_Designated_Type (Typ))
4139
            then
4140
               Build_Master_Entity (Def_Id);
4141
               M_Id := Build_Master_Renaming (N, Def_Id);
4142
 
4143
               if Is_Array_Type (Def_Id) then
4144
                  Comp := First_Entity (Component_Type (Def_Id));
4145
               else
4146
                  Comp := First_Entity (Def_Id);
4147
               end if;
4148
 
4149
               while Present (Comp) loop
4150
                  Typ := Etype (Comp);
4151
 
4152
                  if Is_Access_Type (Typ)
4153
                    and then Ekind (Typ) = E_Anonymous_Access_Type
4154
                  then
4155
                     Set_Master_Id (Typ, M_Id);
4156
                  end if;
4157
 
4158
                  Next_Entity (Comp);
4159
               end loop;
4160
            end if;
4161
         end;
4162
      end if;
4163
 
4164
      Par_Id := Etype (B_Id);
4165
 
4166
      --  The parent type is private then we need to inherit any TSS operations
4167
      --  from the full view.
4168
 
4169
      if Ekind (Par_Id) in Private_Kind
4170
        and then Present (Full_View (Par_Id))
4171
      then
4172
         Par_Id := Base_Type (Full_View (Par_Id));
4173
      end if;
4174
 
4175
      if Nkind (Type_Definition (Original_Node (N))) =
4176
                                                N_Derived_Type_Definition
4177
        and then not Is_Tagged_Type (Def_Id)
4178
        and then Present (Freeze_Node (Par_Id))
4179
        and then Present (TSS_Elist (Freeze_Node (Par_Id)))
4180
      then
4181
         Ensure_Freeze_Node (B_Id);
4182
         FN := Freeze_Node (B_Id);
4183
 
4184
         if No (TSS_Elist (FN)) then
4185
            Set_TSS_Elist (FN, New_Elmt_List);
4186
         end if;
4187
 
4188
         declare
4189
            T_E  : constant Elist_Id := TSS_Elist (FN);
4190
            Elmt : Elmt_Id;
4191
 
4192
         begin
4193
            Elmt := First_Elmt (TSS_Elist (Freeze_Node (Par_Id)));
4194
            while Present (Elmt) loop
4195
               if Chars (Node (Elmt)) /= Name_uInit then
4196
                  Append_Elmt (Node (Elmt), T_E);
4197
               end if;
4198
 
4199
               Next_Elmt (Elmt);
4200
            end loop;
4201
 
4202
            --  If the derived type itself is private with a full view, then
4203
            --  associate the full view with the inherited TSS_Elist as well.
4204
 
4205
            if Ekind (B_Id) in Private_Kind
4206
              and then Present (Full_View (B_Id))
4207
            then
4208
               Ensure_Freeze_Node (Base_Type (Full_View (B_Id)));
4209
               Set_TSS_Elist
4210
                 (Freeze_Node (Base_Type (Full_View (B_Id))), TSS_Elist (FN));
4211
            end if;
4212
         end;
4213
      end if;
4214
   end Expand_N_Full_Type_Declaration;
4215
 
4216
   ---------------------------------
4217
   -- Expand_N_Object_Declaration --
4218
   ---------------------------------
4219
 
4220
   --  First we do special processing for objects of a tagged type where this
4221
   --  is the point at which the type is frozen. The creation of the dispatch
4222
   --  table and the initialization procedure have to be deferred to this
4223
   --  point, since we reference previously declared primitive subprograms.
4224
 
4225
   --  For all types, we call an initialization procedure if there is one
4226
 
4227
   procedure Expand_N_Object_Declaration (N : Node_Id) is
4228
      Def_Id   : constant Entity_Id  := Defining_Identifier (N);
4229
      Expr     : constant Node_Id    := Expression (N);
4230
      Loc      : constant Source_Ptr := Sloc (N);
4231
      Typ      : constant Entity_Id  := Etype (Def_Id);
4232
      Base_Typ : constant Entity_Id  := Base_Type (Typ);
4233
      Expr_Q   : Node_Id;
4234
      Id_Ref   : Node_Id;
4235
      New_Ref  : Node_Id;
4236
 
4237
      Init_After : Node_Id := N;
4238
      --  Node after which the init proc call is to be inserted. This is
4239
      --  normally N, except for the case of a shared passive variable, in
4240
      --  which case the init proc call must be inserted only after the bodies
4241
      --  of the shared variable procedures have been seen.
4242
 
4243
      function Rewrite_As_Renaming return Boolean;
4244
      --  Indicate whether to rewrite a declaration with initialization into an
4245
      --  object renaming declaration (see below).
4246
 
4247
      -------------------------
4248
      -- Rewrite_As_Renaming --
4249
      -------------------------
4250
 
4251
      function Rewrite_As_Renaming return Boolean is
4252
      begin
4253
         return not Aliased_Present (N)
4254
           and then Is_Entity_Name (Expr_Q)
4255
           and then Ekind (Entity (Expr_Q)) = E_Variable
4256
           and then OK_To_Rename (Entity (Expr_Q))
4257
           and then Is_Entity_Name (Object_Definition (N));
4258
      end Rewrite_As_Renaming;
4259
 
4260
   --  Start of processing for Expand_N_Object_Declaration
4261
 
4262
   begin
4263
      --  Don't do anything for deferred constants. All proper actions will be
4264
      --  expanded during the full declaration.
4265
 
4266
      if No (Expr) and Constant_Present (N) then
4267
         return;
4268
      end if;
4269
 
4270
      --  Force construction of dispatch tables of library level tagged types
4271
 
4272
      if Tagged_Type_Expansion
4273
        and then Static_Dispatch_Tables
4274
        and then Is_Library_Level_Entity (Def_Id)
4275
        and then Is_Library_Level_Tagged_Type (Base_Typ)
4276
        and then (Ekind (Base_Typ) = E_Record_Type
4277
                    or else Ekind (Base_Typ) = E_Protected_Type
4278
                    or else Ekind (Base_Typ) = E_Task_Type)
4279
        and then not Has_Dispatch_Table (Base_Typ)
4280
      then
4281
         declare
4282
            New_Nodes : List_Id := No_List;
4283
 
4284
         begin
4285
            if Is_Concurrent_Type (Base_Typ) then
4286
               New_Nodes := Make_DT (Corresponding_Record_Type (Base_Typ), N);
4287
            else
4288
               New_Nodes := Make_DT (Base_Typ, N);
4289
            end if;
4290
 
4291
            if not Is_Empty_List (New_Nodes) then
4292
               Insert_List_Before (N, New_Nodes);
4293
            end if;
4294
         end;
4295
      end if;
4296
 
4297
      --  Make shared memory routines for shared passive variable
4298
 
4299
      if Is_Shared_Passive (Def_Id) then
4300
         Init_After := Make_Shared_Var_Procs (N);
4301
      end if;
4302
 
4303
      --  If tasks being declared, make sure we have an activation chain
4304
      --  defined for the tasks (has no effect if we already have one), and
4305
      --  also that a Master variable is established and that the appropriate
4306
      --  enclosing construct is established as a task master.
4307
 
4308
      if Has_Task (Typ) then
4309
         Build_Activation_Chain_Entity (N);
4310
         Build_Master_Entity (Def_Id);
4311
      end if;
4312
 
4313
      --  Build a list controller for declarations where the type is anonymous
4314
      --  access and the designated type is controlled. Only declarations from
4315
      --  source files receive such controllers in order to provide the same
4316
      --  lifespan for any potential coextensions that may be associated with
4317
      --  the object. Finalization lists of internal controlled anonymous
4318
      --  access objects are already handled in Expand_N_Allocator.
4319
 
4320
      if Comes_From_Source (N)
4321
        and then Ekind (Typ) = E_Anonymous_Access_Type
4322
        and then Is_Controlled (Directly_Designated_Type (Typ))
4323
        and then No (Associated_Final_Chain (Typ))
4324
      then
4325
         Build_Final_List (N, Typ);
4326
      end if;
4327
 
4328
      --  Default initialization required, and no expression present
4329
 
4330
      if No (Expr) then
4331
 
4332
         --  Expand Initialize call for controlled objects. One may wonder why
4333
         --  the Initialize Call is not done in the regular Init procedure
4334
         --  attached to the record type. That's because the init procedure is
4335
         --  recursively called on each component, including _Parent, thus the
4336
         --  Init call for a controlled object would generate not only one
4337
         --  Initialize call as it is required but one for each ancestor of
4338
         --  its type. This processing is suppressed if No_Initialization set.
4339
 
4340
         if not Needs_Finalization (Typ)
4341
           or else No_Initialization (N)
4342
         then
4343
            null;
4344
 
4345
         elsif not Abort_Allowed
4346
           or else not Comes_From_Source (N)
4347
         then
4348
            Insert_Actions_After (Init_After,
4349
              Make_Init_Call (
4350
                Ref         => New_Occurrence_Of (Def_Id, Loc),
4351
                Typ         => Base_Type (Typ),
4352
                Flist_Ref   => Find_Final_List (Def_Id),
4353
                With_Attach => Make_Integer_Literal (Loc, 1)));
4354
 
4355
         --  Abort allowed
4356
 
4357
         else
4358
            --  We need to protect the initialize call
4359
 
4360
            --  begin
4361
            --     Defer_Abort.all;
4362
            --     Initialize (...);
4363
            --  at end
4364
            --     Undefer_Abort.all;
4365
            --  end;
4366
 
4367
            --  ??? this won't protect the initialize call for controlled
4368
            --  components which are part of the init proc, so this block
4369
            --  should probably also contain the call to _init_proc but this
4370
            --  requires some code reorganization...
4371
 
4372
            declare
4373
               L   : constant List_Id :=
4374
                       Make_Init_Call
4375
                         (Ref         => New_Occurrence_Of (Def_Id, Loc),
4376
                          Typ         => Base_Type (Typ),
4377
                          Flist_Ref   => Find_Final_List (Def_Id),
4378
                          With_Attach => Make_Integer_Literal (Loc, 1));
4379
 
4380
               Blk : constant Node_Id :=
4381
                       Make_Block_Statement (Loc,
4382
                         Handled_Statement_Sequence =>
4383
                           Make_Handled_Sequence_Of_Statements (Loc, L));
4384
 
4385
            begin
4386
               Prepend_To (L, Build_Runtime_Call (Loc, RE_Abort_Defer));
4387
               Set_At_End_Proc (Handled_Statement_Sequence (Blk),
4388
                 New_Occurrence_Of (RTE (RE_Abort_Undefer_Direct), Loc));
4389
               Insert_Actions_After (Init_After, New_List (Blk));
4390
               Expand_At_End_Handler
4391
                 (Handled_Statement_Sequence (Blk), Entity (Identifier (Blk)));
4392
            end;
4393
         end if;
4394
 
4395
         --  Call type initialization procedure if there is one. We build the
4396
         --  call and put it immediately after the object declaration, so that
4397
         --  it will be expanded in the usual manner. Note that this will
4398
         --  result in proper handling of defaulted discriminants.
4399
 
4400
         --  Need call if there is a base init proc
4401
 
4402
         if Has_Non_Null_Base_Init_Proc (Typ)
4403
 
4404
            --  Suppress call if No_Initialization set on declaration
4405
 
4406
            and then not No_Initialization (N)
4407
 
4408
            --  Suppress call for special case of value type for VM
4409
 
4410
            and then not Is_Value_Type (Typ)
4411
 
4412
            --  Suppress call if Suppress_Init_Proc set on the type. This is
4413
            --  needed for the derived type case, where Suppress_Initialization
4414
            --  may be set for the derived type, even if there is an init proc
4415
            --  defined for the root type.
4416
 
4417
            and then not Suppress_Init_Proc (Typ)
4418
         then
4419
            --  Return without initializing when No_Default_Initialization
4420
            --  applies. Note that the actual restriction check occurs later,
4421
            --  when the object is frozen, because we don't know yet whether
4422
            --  the object is imported, which is a case where the check does
4423
            --  not apply.
4424
 
4425
            if Restriction_Active (No_Default_Initialization) then
4426
               return;
4427
            end if;
4428
 
4429
            --  The call to the initialization procedure does NOT freeze the
4430
            --  object being initialized. This is because the call is not a
4431
            --  source level call. This works fine, because the only possible
4432
            --  statements depending on freeze status that can appear after the
4433
            --  Init_Proc call are rep clauses which can safely appear after
4434
            --  actual references to the object. Note that this call may
4435
            --  subsequently be removed (if a pragma Import is encountered),
4436
            --  or moved to the freeze actions for the object (e.g. if an
4437
            --  address clause is applied to the object, causing it to get
4438
            --  delayed freezing).
4439
 
4440
            Id_Ref := New_Reference_To (Def_Id, Loc);
4441
            Set_Must_Not_Freeze (Id_Ref);
4442
            Set_Assignment_OK (Id_Ref);
4443
 
4444
            declare
4445
               Init_Expr : constant Node_Id :=
4446
                             Static_Initialization (Base_Init_Proc (Typ));
4447
            begin
4448
               if Present (Init_Expr) then
4449
                  Set_Expression
4450
                    (N, New_Copy_Tree (Init_Expr, New_Scope => Current_Scope));
4451
                  return;
4452
               else
4453
                  Initialization_Warning (Id_Ref);
4454
 
4455
                  Insert_Actions_After (Init_After,
4456
                    Build_Initialization_Call (Loc, Id_Ref, Typ));
4457
               end if;
4458
            end;
4459
 
4460
         --  If simple initialization is required, then set an appropriate
4461
         --  simple initialization expression in place. This special
4462
         --  initialization is required even though No_Init_Flag is present,
4463
         --  but is not needed if there was an explicit initialization.
4464
 
4465
         --  An internally generated temporary needs no initialization because
4466
         --  it will be assigned subsequently. In particular, there is no point
4467
         --  in applying Initialize_Scalars to such a temporary.
4468
 
4469
         elsif Needs_Simple_Initialization (Typ)
4470
           and then not Is_Internal (Def_Id)
4471
           and then not Has_Init_Expression (N)
4472
         then
4473
            Set_No_Initialization (N, False);
4474
            Set_Expression (N, Get_Simple_Init_Val (Typ, N, Esize (Def_Id)));
4475
            Analyze_And_Resolve (Expression (N), Typ);
4476
         end if;
4477
 
4478
         --  Generate attribute for Persistent_BSS if needed
4479
 
4480
         if Persistent_BSS_Mode
4481
           and then Comes_From_Source (N)
4482
           and then Is_Potentially_Persistent_Type (Typ)
4483
           and then not Has_Init_Expression (N)
4484
           and then Is_Library_Level_Entity (Def_Id)
4485
         then
4486
            declare
4487
               Prag : Node_Id;
4488
            begin
4489
               Prag :=
4490
                 Make_Linker_Section_Pragma
4491
                   (Def_Id, Sloc (N), ".persistent.bss");
4492
               Insert_After (N, Prag);
4493
               Analyze (Prag);
4494
            end;
4495
         end if;
4496
 
4497
         --  If access type, then we know it is null if not initialized
4498
 
4499
         if Is_Access_Type (Typ) then
4500
            Set_Is_Known_Null (Def_Id);
4501
         end if;
4502
 
4503
      --  Explicit initialization present
4504
 
4505
      else
4506
         --  Obtain actual expression from qualified expression
4507
 
4508
         if Nkind (Expr) = N_Qualified_Expression then
4509
            Expr_Q := Expression (Expr);
4510
         else
4511
            Expr_Q := Expr;
4512
         end if;
4513
 
4514
         --  When we have the appropriate type of aggregate in the expression
4515
         --  (it has been determined during analysis of the aggregate by
4516
         --  setting the delay flag), let's perform in place assignment and
4517
         --  thus avoid creating a temporary.
4518
 
4519
         if Is_Delayed_Aggregate (Expr_Q) then
4520
            Convert_Aggr_In_Object_Decl (N);
4521
 
4522
         --  Ada 2005 (AI-318-02): If the initialization expression is a call
4523
         --  to a build-in-place function, then access to the declared object
4524
         --  must be passed to the function. Currently we limit such functions
4525
         --  to those with constrained limited result subtypes, but eventually
4526
         --  plan to expand the allowed forms of functions that are treated as
4527
         --  build-in-place.
4528
 
4529
         elsif Ada_Version >= Ada_05
4530
           and then Is_Build_In_Place_Function_Call (Expr_Q)
4531
         then
4532
            Make_Build_In_Place_Call_In_Object_Declaration (N, Expr_Q);
4533
 
4534
            --  The previous call expands the expression initializing the
4535
            --  built-in-place object into further code that will be analyzed
4536
            --  later. No further expansion needed here.
4537
 
4538
            return;
4539
 
4540
         --  Ada 2005 (AI-251): Rewrite the expression that initializes a
4541
         --  class-wide object to ensure that we copy the full object,
4542
         --  unless we are targetting a VM where interfaces are handled by
4543
         --  VM itself. Note that if the root type of Typ is an ancestor
4544
         --  of Expr's type, both types share the same dispatch table and
4545
         --  there is no need to displace the pointer.
4546
 
4547
         elsif Comes_From_Source (N)
4548
           and then Is_Interface (Typ)
4549
         then
4550
            pragma Assert (Is_Class_Wide_Type (Typ));
4551
 
4552
            --  If the object is a return object of an inherently limited type,
4553
            --  which implies build-in-place treatment, bypass the special
4554
            --  treatment of class-wide interface initialization below. In this
4555
            --  case, the expansion of the return statement will take care of
4556
            --  creating the object (via allocator) and initializing it.
4557
 
4558
            if Is_Return_Object (Def_Id)
4559
              and then Is_Inherently_Limited_Type (Typ)
4560
            then
4561
               null;
4562
 
4563
            elsif Tagged_Type_Expansion then
4564
               declare
4565
                  Iface    : constant Entity_Id := Root_Type (Typ);
4566
                  Expr_N   : Node_Id := Expr;
4567
                  Expr_Typ : Entity_Id;
4568
 
4569
                  Decl_1   : Node_Id;
4570
                  Decl_2   : Node_Id;
4571
                  New_Expr : Node_Id;
4572
 
4573
               begin
4574
                  --  If the original node of the expression was a conversion
4575
                  --  to this specific class-wide interface type then we
4576
                  --  restore the original node to generate code that
4577
                  --  statically displaces the pointer to the interface
4578
                  --  component.
4579
 
4580
                  if not Comes_From_Source (Expr_N)
4581
                    and then Nkind (Expr_N) = N_Unchecked_Type_Conversion
4582
                    and then Nkind (Original_Node (Expr_N)) = N_Type_Conversion
4583
                    and then Etype (Original_Node (Expr_N)) = Typ
4584
                  then
4585
                     Rewrite (Expr_N, Original_Node (Expression (N)));
4586
                  end if;
4587
 
4588
                  --  Avoid expansion of redundant interface conversion
4589
 
4590
                  if Is_Interface (Etype (Expr_N))
4591
                    and then Nkind (Expr_N) = N_Type_Conversion
4592
                    and then Etype (Expr_N) = Typ
4593
                  then
4594
                     Expr_N := Expression (Expr_N);
4595
                     Set_Expression (N, Expr_N);
4596
                  end if;
4597
 
4598
                  Expr_Typ := Base_Type (Etype (Expr_N));
4599
 
4600
                  if Is_Class_Wide_Type (Expr_Typ) then
4601
                     Expr_Typ := Root_Type (Expr_Typ);
4602
                  end if;
4603
 
4604
                  --  Replace
4605
                  --     CW : I'Class := Obj;
4606
                  --  by
4607
                  --     Tmp : T := Obj;
4608
                  --     CW  : I'Class renames TiC!(Tmp.I_Tag);
4609
 
4610
                  if Comes_From_Source (Expr_N)
4611
                    and then Nkind (Expr_N) = N_Identifier
4612
                    and then not Is_Interface (Expr_Typ)
4613
                    and then (Expr_Typ = Etype (Expr_Typ)
4614
                               or else not
4615
                              Is_Variable_Size_Record (Etype (Expr_Typ)))
4616
                  then
4617
                     Decl_1 :=
4618
                       Make_Object_Declaration (Loc,
4619
                         Defining_Identifier =>
4620
                           Make_Defining_Identifier (Loc,
4621
                             New_Internal_Name ('D')),
4622
                         Object_Definition =>
4623
                           New_Occurrence_Of (Expr_Typ, Loc),
4624
                         Expression =>
4625
                           Unchecked_Convert_To (Expr_Typ,
4626
                             Relocate_Node (Expr_N)));
4627
 
4628
                     --  Statically reference the tag associated with the
4629
                     --  interface
4630
 
4631
                     Decl_2 :=
4632
                       Make_Object_Renaming_Declaration (Loc,
4633
                         Defining_Identifier =>
4634
                           Make_Defining_Identifier (Loc,
4635
                             New_Internal_Name ('D')),
4636
                         Subtype_Mark =>
4637
                           New_Occurrence_Of (Typ, Loc),
4638
                         Name =>
4639
                           Unchecked_Convert_To (Typ,
4640
                             Make_Selected_Component (Loc,
4641
                               Prefix =>
4642
                                 New_Occurrence_Of
4643
                                   (Defining_Identifier (Decl_1), Loc),
4644
                               Selector_Name =>
4645
                                 New_Reference_To
4646
                                   (Find_Interface_Tag (Expr_Typ, Iface),
4647
                                    Loc))));
4648
 
4649
                  --  General case:
4650
 
4651
                  --  Replace
4652
                  --     IW : I'Class := Obj;
4653
                  --  by
4654
                  --     type Equiv_Record is record ... end record;
4655
                  --     implicit subtype CW is <Class_Wide_Subtype>;
4656
                  --     Temp : CW := CW!(Obj'Address);
4657
                  --     IW : I'Class renames Displace (Temp, I'Tag);
4658
 
4659
                  else
4660
                     --  Generate the equivalent record type
4661
 
4662
                     Expand_Subtype_From_Expr
4663
                       (N             => N,
4664
                        Unc_Type      => Typ,
4665
                        Subtype_Indic => Object_Definition (N),
4666
                        Exp           => Expression (N));
4667
 
4668
                     if not Is_Interface (Etype (Expression (N))) then
4669
                        New_Expr := Relocate_Node (Expression (N));
4670
                     else
4671
                        New_Expr :=
4672
                          Make_Explicit_Dereference (Loc,
4673
                            Unchecked_Convert_To (RTE (RE_Tag_Ptr),
4674
                              Make_Attribute_Reference (Loc,
4675
                                Prefix => Relocate_Node (Expression (N)),
4676
                                Attribute_Name => Name_Address)));
4677
                     end if;
4678
 
4679
                     Decl_1 :=
4680
                       Make_Object_Declaration (Loc,
4681
                         Defining_Identifier =>
4682
                           Make_Defining_Identifier (Loc,
4683
                             New_Internal_Name ('D')),
4684
                         Object_Definition =>
4685
                           New_Occurrence_Of
4686
                            (Etype (Object_Definition (N)), Loc),
4687
                         Expression =>
4688
                           Unchecked_Convert_To
4689
                             (Etype (Object_Definition (N)), New_Expr));
4690
 
4691
                     Decl_2 :=
4692
                       Make_Object_Renaming_Declaration (Loc,
4693
                         Defining_Identifier =>
4694
                           Make_Defining_Identifier (Loc,
4695
                             New_Internal_Name ('D')),
4696
                         Subtype_Mark =>
4697
                           New_Occurrence_Of (Typ, Loc),
4698
                         Name =>
4699
                           Unchecked_Convert_To (Typ,
4700
                             Make_Explicit_Dereference (Loc,
4701
                               Unchecked_Convert_To (RTE (RE_Tag_Ptr),
4702
                                 Make_Function_Call (Loc,
4703
                                   Name =>
4704
                                     New_Reference_To (RTE (RE_Displace), Loc),
4705
                                   Parameter_Associations => New_List (
4706
                                     Make_Attribute_Reference (Loc,
4707
                                       Prefix =>
4708
                                         New_Occurrence_Of
4709
                                          (Defining_Identifier (Decl_1), Loc),
4710
                                       Attribute_Name => Name_Address),
4711
 
4712
                                     Unchecked_Convert_To (RTE (RE_Tag),
4713
                                       New_Reference_To
4714
                                         (Node
4715
                                           (First_Elmt
4716
                                             (Access_Disp_Table (Iface))),
4717
                                          Loc))))))));
4718
                  end if;
4719
 
4720
                  Insert_Action (N, Decl_1);
4721
                  Rewrite (N, Decl_2);
4722
                  Analyze (N);
4723
 
4724
                  --  Replace internal identifier of Decl_2 by the identifier
4725
                  --  found in the sources. We also have to exchange entities
4726
                  --  containing their defining identifiers to ensure the
4727
                  --  correct replacement of the object declaration by this
4728
                  --  object renaming declaration (because such definings
4729
                  --  identifier have been previously added by Enter_Name to
4730
                  --  the current scope). We must preserve the homonym chain
4731
                  --  of the source entity as well.
4732
 
4733
                  Set_Chars (Defining_Identifier (N), Chars (Def_Id));
4734
                  Set_Homonym (Defining_Identifier (N), Homonym (Def_Id));
4735
                  Exchange_Entities (Defining_Identifier (N), Def_Id);
4736
               end;
4737
            end if;
4738
 
4739
            return;
4740
 
4741
         else
4742
            --  In most cases, we must check that the initial value meets any
4743
            --  constraint imposed by the declared type. However, there is one
4744
            --  very important exception to this rule. If the entity has an
4745
            --  unconstrained nominal subtype, then it acquired its constraints
4746
            --  from the expression in the first place, and not only does this
4747
            --  mean that the constraint check is not needed, but an attempt to
4748
            --  perform the constraint check can cause order of elaboration
4749
            --  problems.
4750
 
4751
            if not Is_Constr_Subt_For_U_Nominal (Typ) then
4752
 
4753
               --  If this is an allocator for an aggregate that has been
4754
               --  allocated in place, delay checks until assignments are
4755
               --  made, because the discriminants are not initialized.
4756
 
4757
               if Nkind (Expr) = N_Allocator
4758
                 and then No_Initialization (Expr)
4759
               then
4760
                  null;
4761
               else
4762
                  Apply_Constraint_Check (Expr, Typ);
4763
 
4764
                  --  If the expression has been marked as requiring a range
4765
                  --  generate it now and reset the flag.
4766
 
4767
                  if Do_Range_Check (Expr) then
4768
                     Set_Do_Range_Check (Expr, False);
4769
                     Generate_Range_Check (Expr, Typ, CE_Range_Check_Failed);
4770
                  end if;
4771
               end if;
4772
            end if;
4773
 
4774
            --  If the type is controlled and not inherently limited, then
4775
            --  the target is adjusted after the copy and attached to the
4776
            --  finalization list. However, no adjustment is done in the case
4777
            --  where the object was initialized by a call to a function whose
4778
            --  result is built in place, since no copy occurred. (Eventually
4779
            --  we plan to support in-place function results for some cases
4780
            --  of nonlimited types. ???) Similarly, no adjustment is required
4781
            --  if we are going to rewrite the object declaration into a
4782
            --  renaming declaration.
4783
 
4784
            if Needs_Finalization (Typ)
4785
              and then not Is_Inherently_Limited_Type (Typ)
4786
              and then not Rewrite_As_Renaming
4787
            then
4788
               Insert_Actions_After (Init_After,
4789
                 Make_Adjust_Call (
4790
                   Ref          => New_Reference_To (Def_Id, Loc),
4791
                   Typ          => Base_Type (Typ),
4792
                   Flist_Ref    => Find_Final_List (Def_Id),
4793
                   With_Attach  => Make_Integer_Literal (Loc, 1)));
4794
            end if;
4795
 
4796
            --  For tagged types, when an init value is given, the tag has to
4797
            --  be re-initialized separately in order to avoid the propagation
4798
            --  of a wrong tag coming from a view conversion unless the type
4799
            --  is class wide (in this case the tag comes from the init value).
4800
            --  Suppress the tag assignment when VM_Target because VM tags are
4801
            --  represented implicitly in objects. Ditto for types that are
4802
            --  CPP_CLASS, and for initializations that are aggregates, because
4803
            --  they have to have the right tag.
4804
 
4805
            if Is_Tagged_Type (Typ)
4806
              and then not Is_Class_Wide_Type (Typ)
4807
              and then not Is_CPP_Class (Typ)
4808
              and then Tagged_Type_Expansion
4809
              and then Nkind (Expr) /= N_Aggregate
4810
            then
4811
               --  The re-assignment of the tag has to be done even if the
4812
               --  object is a constant.
4813
 
4814
               New_Ref :=
4815
                 Make_Selected_Component (Loc,
4816
                    Prefix => New_Reference_To (Def_Id, Loc),
4817
                    Selector_Name =>
4818
                      New_Reference_To (First_Tag_Component (Typ), Loc));
4819
 
4820
               Set_Assignment_OK (New_Ref);
4821
 
4822
               Insert_After (Init_After,
4823
                 Make_Assignment_Statement (Loc,
4824
                   Name => New_Ref,
4825
                   Expression =>
4826
                     Unchecked_Convert_To (RTE (RE_Tag),
4827
                       New_Reference_To
4828
                         (Node
4829
                           (First_Elmt
4830
                             (Access_Disp_Table (Base_Type (Typ)))),
4831
                          Loc))));
4832
 
4833
            elsif Is_Tagged_Type (Typ)
4834
              and then Is_CPP_Constructor_Call (Expr)
4835
            then
4836
               --  The call to the initialization procedure does NOT freeze the
4837
               --  object being initialized.
4838
 
4839
               Id_Ref := New_Reference_To (Def_Id, Loc);
4840
               Set_Must_Not_Freeze (Id_Ref);
4841
               Set_Assignment_OK (Id_Ref);
4842
 
4843
               Insert_Actions_After (Init_After,
4844
                 Build_Initialization_Call (Loc, Id_Ref, Typ,
4845
                   Constructor_Ref => Expr));
4846
 
4847
               --  We remove here the original call to the constructor
4848
               --  to avoid its management in the backend
4849
 
4850
               Set_Expression (N, Empty);
4851
               return;
4852
 
4853
            --  For discrete types, set the Is_Known_Valid flag if the
4854
            --  initializing value is known to be valid.
4855
 
4856
            elsif Is_Discrete_Type (Typ) and then Expr_Known_Valid (Expr) then
4857
               Set_Is_Known_Valid (Def_Id);
4858
 
4859
            elsif Is_Access_Type (Typ) then
4860
 
4861
               --  For access types set the Is_Known_Non_Null flag if the
4862
               --  initializing value is known to be non-null. We can also set
4863
               --  Can_Never_Be_Null if this is a constant.
4864
 
4865
               if Known_Non_Null (Expr) then
4866
                  Set_Is_Known_Non_Null (Def_Id, True);
4867
 
4868
                  if Constant_Present (N) then
4869
                     Set_Can_Never_Be_Null (Def_Id);
4870
                  end if;
4871
               end if;
4872
            end if;
4873
 
4874
            --  If validity checking on copies, validate initial expression.
4875
            --  But skip this if declaration is for a generic type, since it
4876
            --  makes no sense to validate generic types. Not clear if this
4877
            --  can happen for legal programs, but it definitely can arise
4878
            --  from previous instantiation errors.
4879
 
4880
            if Validity_Checks_On
4881
              and then Validity_Check_Copies
4882
              and then not Is_Generic_Type (Etype (Def_Id))
4883
            then
4884
               Ensure_Valid (Expr);
4885
               Set_Is_Known_Valid (Def_Id);
4886
            end if;
4887
         end if;
4888
 
4889
         --  Cases where the back end cannot handle the initialization directly
4890
         --  In such cases, we expand an assignment that will be appropriately
4891
         --  handled by Expand_N_Assignment_Statement.
4892
 
4893
         --  The exclusion of the unconstrained case is wrong, but for now it
4894
         --  is too much trouble ???
4895
 
4896
         if (Is_Possibly_Unaligned_Slice (Expr)
4897
               or else (Is_Possibly_Unaligned_Object (Expr)
4898
                          and then not Represented_As_Scalar (Etype (Expr))))
4899
 
4900
            --  The exclusion of the unconstrained case is wrong, but for now
4901
            --  it is too much trouble ???
4902
 
4903
           and then not (Is_Array_Type (Etype (Expr))
4904
                           and then not Is_Constrained (Etype (Expr)))
4905
         then
4906
            declare
4907
               Stat : constant Node_Id :=
4908
                       Make_Assignment_Statement (Loc,
4909
                         Name       => New_Reference_To (Def_Id, Loc),
4910
                         Expression => Relocate_Node (Expr));
4911
            begin
4912
               Set_Expression (N, Empty);
4913
               Set_No_Initialization (N);
4914
               Set_Assignment_OK (Name (Stat));
4915
               Set_No_Ctrl_Actions (Stat);
4916
               Insert_After_And_Analyze (Init_After, Stat);
4917
            end;
4918
         end if;
4919
 
4920
         --  Final transformation, if the initializing expression is an entity
4921
         --  for a variable with OK_To_Rename set, then we transform:
4922
 
4923
         --     X : typ := expr;
4924
 
4925
         --  into
4926
 
4927
         --     X : typ renames expr
4928
 
4929
         --  provided that X is not aliased. The aliased case has to be
4930
         --  excluded in general because Expr will not be aliased in general.
4931
 
4932
         if Rewrite_As_Renaming then
4933
            Rewrite (N,
4934
              Make_Object_Renaming_Declaration (Loc,
4935
                Defining_Identifier => Defining_Identifier (N),
4936
                Subtype_Mark        => Object_Definition (N),
4937
                Name                => Expr_Q));
4938
 
4939
            --  We do not analyze this renaming declaration, because all its
4940
            --  components have already been analyzed, and if we were to go
4941
            --  ahead and analyze it, we would in effect be trying to generate
4942
            --  another declaration of X, which won't do!
4943
 
4944
            Set_Renamed_Object (Defining_Identifier (N), Expr_Q);
4945
            Set_Analyzed (N);
4946
         end if;
4947
 
4948
      end if;
4949
 
4950
   exception
4951
      when RE_Not_Available =>
4952
         return;
4953
   end Expand_N_Object_Declaration;
4954
 
4955
   ---------------------------------
4956
   -- Expand_N_Subtype_Indication --
4957
   ---------------------------------
4958
 
4959
   --  Add a check on the range of the subtype. The static case is partially
4960
   --  duplicated by Process_Range_Expr_In_Decl in Sem_Ch3, but we still need
4961
   --  to check here for the static case in order to avoid generating
4962
   --  extraneous expanded code. Also deal with validity checking.
4963
 
4964
   procedure Expand_N_Subtype_Indication (N : Node_Id) is
4965
      Ran : constant Node_Id   := Range_Expression (Constraint (N));
4966
      Typ : constant Entity_Id := Entity (Subtype_Mark (N));
4967
 
4968
   begin
4969
      if Nkind (Constraint (N)) = N_Range_Constraint then
4970
         Validity_Check_Range (Range_Expression (Constraint (N)));
4971
      end if;
4972
 
4973
      if Nkind_In (Parent (N), N_Constrained_Array_Definition, N_Slice) then
4974
         Apply_Range_Check (Ran, Typ);
4975
      end if;
4976
   end Expand_N_Subtype_Indication;
4977
 
4978
   ---------------------------
4979
   -- Expand_N_Variant_Part --
4980
   ---------------------------
4981
 
4982
   --  If the last variant does not contain the Others choice, replace it with
4983
   --  an N_Others_Choice node since Gigi always wants an Others. Note that we
4984
   --  do not bother to call Analyze on the modified variant part, since it's
4985
   --  only effect would be to compute the Others_Discrete_Choices node
4986
   --  laboriously, and of course we already know the list of choices that
4987
   --  corresponds to the others choice (it's the list we are replacing!)
4988
 
4989
   procedure Expand_N_Variant_Part (N : Node_Id) is
4990
      Last_Var    : constant Node_Id := Last_Non_Pragma (Variants (N));
4991
      Others_Node : Node_Id;
4992
   begin
4993
      if Nkind (First (Discrete_Choices (Last_Var))) /= N_Others_Choice then
4994
         Others_Node := Make_Others_Choice (Sloc (Last_Var));
4995
         Set_Others_Discrete_Choices
4996
           (Others_Node, Discrete_Choices (Last_Var));
4997
         Set_Discrete_Choices (Last_Var, New_List (Others_Node));
4998
      end if;
4999
   end Expand_N_Variant_Part;
5000
 
5001
   ---------------------------------
5002
   -- Expand_Previous_Access_Type --
5003
   ---------------------------------
5004
 
5005
   procedure Expand_Previous_Access_Type (Def_Id : Entity_Id) is
5006
      T : Entity_Id := First_Entity (Current_Scope);
5007
 
5008
   begin
5009
      --  Find all access types declared in the current scope, whose
5010
      --  designated type is Def_Id. If it does not have a Master_Id,
5011
      --  create one now.
5012
 
5013
      while Present (T) loop
5014
         if Is_Access_Type (T)
5015
           and then Designated_Type (T) = Def_Id
5016
           and then No (Master_Id (T))
5017
         then
5018
            Build_Master_Entity (Def_Id);
5019
            Build_Master_Renaming (Parent (Def_Id), T);
5020
         end if;
5021
 
5022
         Next_Entity (T);
5023
      end loop;
5024
   end Expand_Previous_Access_Type;
5025
 
5026
   ------------------------------
5027
   -- Expand_Record_Controller --
5028
   ------------------------------
5029
 
5030
   procedure Expand_Record_Controller (T : Entity_Id) is
5031
      Def             : Node_Id := Type_Definition (Parent (T));
5032
      Comp_List       : Node_Id;
5033
      Comp_Decl       : Node_Id;
5034
      Loc             : Source_Ptr;
5035
      First_Comp      : Node_Id;
5036
      Controller_Type : Entity_Id;
5037
      Ent             : Entity_Id;
5038
 
5039
   begin
5040
      if Nkind (Def) = N_Derived_Type_Definition then
5041
         Def := Record_Extension_Part (Def);
5042
      end if;
5043
 
5044
      if Null_Present (Def) then
5045
         Set_Component_List (Def,
5046
           Make_Component_List (Sloc (Def),
5047
             Component_Items => Empty_List,
5048
             Variant_Part => Empty,
5049
             Null_Present => True));
5050
      end if;
5051
 
5052
      Comp_List := Component_List (Def);
5053
 
5054
      if Null_Present (Comp_List)
5055
        or else Is_Empty_List (Component_Items (Comp_List))
5056
      then
5057
         Loc := Sloc (Comp_List);
5058
      else
5059
         Loc := Sloc (First (Component_Items (Comp_List)));
5060
      end if;
5061
 
5062
      if Is_Inherently_Limited_Type (T) then
5063
         Controller_Type := RTE (RE_Limited_Record_Controller);
5064
      else
5065
         Controller_Type := RTE (RE_Record_Controller);
5066
      end if;
5067
 
5068
      Ent := Make_Defining_Identifier (Loc, Name_uController);
5069
 
5070
      Comp_Decl :=
5071
        Make_Component_Declaration (Loc,
5072
          Defining_Identifier =>  Ent,
5073
          Component_Definition =>
5074
            Make_Component_Definition (Loc,
5075
              Aliased_Present => False,
5076
              Subtype_Indication => New_Reference_To (Controller_Type, Loc)));
5077
 
5078
      if Null_Present (Comp_List)
5079
        or else Is_Empty_List (Component_Items (Comp_List))
5080
      then
5081
         Set_Component_Items (Comp_List, New_List (Comp_Decl));
5082
         Set_Null_Present (Comp_List, False);
5083
 
5084
      else
5085
         --  The controller cannot be placed before the _Parent field since
5086
         --  gigi lays out field in order and _parent must be first to preserve
5087
         --  the polymorphism of tagged types.
5088
 
5089
         First_Comp := First (Component_Items (Comp_List));
5090
 
5091
         if not Is_Tagged_Type (T) then
5092
            Insert_Before (First_Comp, Comp_Decl);
5093
 
5094
         --  if T is a tagged type, place controller declaration after parent
5095
         --  field and after eventual tags of interface types.
5096
 
5097
         else
5098
            while Present (First_Comp)
5099
              and then
5100
                (Chars (Defining_Identifier (First_Comp)) = Name_uParent
5101
                   or else Is_Tag (Defining_Identifier (First_Comp))
5102
 
5103
               --  Ada 2005 (AI-251): The following condition covers secondary
5104
               --  tags but also the adjacent component containing the offset
5105
               --  to the base of the object (component generated if the parent
5106
               --  has discriminants --- see Add_Interface_Tag_Components).
5107
               --  This is required to avoid the addition of the controller
5108
               --  between the secondary tag and its adjacent component.
5109
 
5110
                   or else Present
5111
                             (Related_Type
5112
                               (Defining_Identifier (First_Comp))))
5113
            loop
5114
               Next (First_Comp);
5115
            end loop;
5116
 
5117
            --  An empty tagged extension might consist only of the parent
5118
            --  component. Otherwise insert the controller before the first
5119
            --  component that is neither parent nor tag.
5120
 
5121
            if Present (First_Comp) then
5122
               Insert_Before (First_Comp, Comp_Decl);
5123
            else
5124
               Append (Comp_Decl, Component_Items (Comp_List));
5125
            end if;
5126
         end if;
5127
      end if;
5128
 
5129
      Push_Scope (T);
5130
      Analyze (Comp_Decl);
5131
      Set_Ekind (Ent, E_Component);
5132
      Init_Component_Location (Ent);
5133
 
5134
      --  Move the _controller entity ahead in the list of internal entities
5135
      --  of the enclosing record so that it is selected instead of a
5136
      --  potentially inherited one.
5137
 
5138
      declare
5139
         E    : constant Entity_Id := Last_Entity (T);
5140
         Comp : Entity_Id;
5141
 
5142
      begin
5143
         pragma Assert (Chars (E) = Name_uController);
5144
 
5145
         Set_Next_Entity (E, First_Entity (T));
5146
         Set_First_Entity (T, E);
5147
 
5148
         Comp := Next_Entity (E);
5149
         while Next_Entity (Comp) /= E loop
5150
            Next_Entity (Comp);
5151
         end loop;
5152
 
5153
         Set_Next_Entity (Comp, Empty);
5154
         Set_Last_Entity (T, Comp);
5155
      end;
5156
 
5157
      End_Scope;
5158
 
5159
   exception
5160
      when RE_Not_Available =>
5161
         return;
5162
   end Expand_Record_Controller;
5163
 
5164
   ------------------------
5165
   -- Expand_Tagged_Root --
5166
   ------------------------
5167
 
5168
   procedure Expand_Tagged_Root (T : Entity_Id) is
5169
      Def       : constant Node_Id := Type_Definition (Parent (T));
5170
      Comp_List : Node_Id;
5171
      Comp_Decl : Node_Id;
5172
      Sloc_N    : Source_Ptr;
5173
 
5174
   begin
5175
      if Null_Present (Def) then
5176
         Set_Component_List (Def,
5177
           Make_Component_List (Sloc (Def),
5178
             Component_Items => Empty_List,
5179
             Variant_Part => Empty,
5180
             Null_Present => True));
5181
      end if;
5182
 
5183
      Comp_List := Component_List (Def);
5184
 
5185
      if Null_Present (Comp_List)
5186
        or else Is_Empty_List (Component_Items (Comp_List))
5187
      then
5188
         Sloc_N := Sloc (Comp_List);
5189
      else
5190
         Sloc_N := Sloc (First (Component_Items (Comp_List)));
5191
      end if;
5192
 
5193
      Comp_Decl :=
5194
        Make_Component_Declaration (Sloc_N,
5195
          Defining_Identifier => First_Tag_Component (T),
5196
          Component_Definition =>
5197
            Make_Component_Definition (Sloc_N,
5198
              Aliased_Present => False,
5199
              Subtype_Indication => New_Reference_To (RTE (RE_Tag), Sloc_N)));
5200
 
5201
      if Null_Present (Comp_List)
5202
        or else Is_Empty_List (Component_Items (Comp_List))
5203
      then
5204
         Set_Component_Items (Comp_List, New_List (Comp_Decl));
5205
         Set_Null_Present (Comp_List, False);
5206
 
5207
      else
5208
         Insert_Before (First (Component_Items (Comp_List)), Comp_Decl);
5209
      end if;
5210
 
5211
      --  We don't Analyze the whole expansion because the tag component has
5212
      --  already been analyzed previously. Here we just insure that the tree
5213
      --  is coherent with the semantic decoration
5214
 
5215
      Find_Type (Subtype_Indication (Component_Definition (Comp_Decl)));
5216
 
5217
   exception
5218
      when RE_Not_Available =>
5219
         return;
5220
   end Expand_Tagged_Root;
5221
 
5222
   ----------------------
5223
   -- Clean_Task_Names --
5224
   ----------------------
5225
 
5226
   procedure Clean_Task_Names
5227
     (Typ     : Entity_Id;
5228
      Proc_Id : Entity_Id)
5229
   is
5230
   begin
5231
      if Has_Task (Typ)
5232
        and then not Restriction_Active (No_Implicit_Heap_Allocations)
5233
        and then not Global_Discard_Names
5234
        and then Tagged_Type_Expansion
5235
      then
5236
         Set_Uses_Sec_Stack (Proc_Id);
5237
      end if;
5238
   end Clean_Task_Names;
5239
 
5240
   ------------------------------
5241
   -- Expand_Freeze_Array_Type --
5242
   ------------------------------
5243
 
5244
   procedure Expand_Freeze_Array_Type (N : Node_Id) is
5245
      Typ      : constant Entity_Id  := Entity (N);
5246
      Comp_Typ : constant Entity_Id := Component_Type (Typ);
5247
      Base     : constant Entity_Id  := Base_Type (Typ);
5248
 
5249
   begin
5250
      if not Is_Bit_Packed_Array (Typ) then
5251
 
5252
         --  If the component contains tasks, so does the array type. This may
5253
         --  not be indicated in the array type because the component may have
5254
         --  been a private type at the point of definition. Same if component
5255
         --  type is controlled.
5256
 
5257
         Set_Has_Task (Base, Has_Task (Comp_Typ));
5258
         Set_Has_Controlled_Component (Base,
5259
           Has_Controlled_Component (Comp_Typ)
5260
             or else Is_Controlled (Comp_Typ));
5261
 
5262
         if No (Init_Proc (Base)) then
5263
 
5264
            --  If this is an anonymous array created for a declaration with
5265
            --  an initial value, its init_proc will never be called. The
5266
            --  initial value itself may have been expanded into assignments,
5267
            --  in which case the object declaration is carries the
5268
            --  No_Initialization flag.
5269
 
5270
            if Is_Itype (Base)
5271
              and then Nkind (Associated_Node_For_Itype (Base)) =
5272
                                                    N_Object_Declaration
5273
              and then (Present (Expression (Associated_Node_For_Itype (Base)))
5274
                          or else
5275
                        No_Initialization (Associated_Node_For_Itype (Base)))
5276
            then
5277
               null;
5278
 
5279
            --  We do not need an init proc for string or wide [wide] string,
5280
            --  since the only time these need initialization in normalize or
5281
            --  initialize scalars mode, and these types are treated specially
5282
            --  and do not need initialization procedures.
5283
 
5284
            elsif Root_Type (Base) = Standard_String
5285
              or else Root_Type (Base) = Standard_Wide_String
5286
              or else Root_Type (Base) = Standard_Wide_Wide_String
5287
            then
5288
               null;
5289
 
5290
            --  Otherwise we have to build an init proc for the subtype
5291
 
5292
            else
5293
               Build_Array_Init_Proc (Base, N);
5294
            end if;
5295
         end if;
5296
 
5297
         if Typ = Base then
5298
            if Has_Controlled_Component (Base) then
5299
               Build_Controlling_Procs (Base);
5300
 
5301
               if not Is_Limited_Type (Comp_Typ)
5302
                 and then Number_Dimensions (Typ) = 1
5303
               then
5304
                  Build_Slice_Assignment (Typ);
5305
               end if;
5306
 
5307
            elsif Ekind (Comp_Typ) = E_Anonymous_Access_Type
5308
              and then Needs_Finalization (Directly_Designated_Type (Comp_Typ))
5309
            then
5310
               Set_Associated_Final_Chain (Comp_Typ, Add_Final_Chain (Typ));
5311
            end if;
5312
         end if;
5313
 
5314
      --  For packed case, default initialization, except if the component type
5315
      --  is itself a packed structure with an initialization procedure, or
5316
      --  initialize/normalize scalars active, and we have a base type, or the
5317
      --  type is public, because in that case a client might specify
5318
      --  Normalize_Scalars and there better be a public Init_Proc for it.
5319
 
5320
      elsif (Present (Init_Proc (Component_Type (Base)))
5321
               and then No (Base_Init_Proc (Base)))
5322
        or else (Init_Or_Norm_Scalars and then Base = Typ)
5323
        or else Is_Public (Typ)
5324
      then
5325
         Build_Array_Init_Proc (Base, N);
5326
      end if;
5327
   end Expand_Freeze_Array_Type;
5328
 
5329
   ------------------------------------
5330
   -- Expand_Freeze_Enumeration_Type --
5331
   ------------------------------------
5332
 
5333
   procedure Expand_Freeze_Enumeration_Type (N : Node_Id) is
5334
      Typ           : constant Entity_Id  := Entity (N);
5335
      Loc           : constant Source_Ptr := Sloc (Typ);
5336
      Ent           : Entity_Id;
5337
      Lst           : List_Id;
5338
      Num           : Nat;
5339
      Arr           : Entity_Id;
5340
      Fent          : Entity_Id;
5341
      Ityp          : Entity_Id;
5342
      Is_Contiguous : Boolean;
5343
      Pos_Expr      : Node_Id;
5344
      Last_Repval   : Uint;
5345
 
5346
      Func : Entity_Id;
5347
      pragma Warnings (Off, Func);
5348
 
5349
   begin
5350
      --  Various optimizations possible if given representation is contiguous
5351
 
5352
      Is_Contiguous := True;
5353
 
5354
      Ent := First_Literal (Typ);
5355
      Last_Repval := Enumeration_Rep (Ent);
5356
 
5357
      Next_Literal (Ent);
5358
      while Present (Ent) loop
5359
         if Enumeration_Rep (Ent) - Last_Repval /= 1 then
5360
            Is_Contiguous := False;
5361
            exit;
5362
         else
5363
            Last_Repval := Enumeration_Rep (Ent);
5364
         end if;
5365
 
5366
         Next_Literal (Ent);
5367
      end loop;
5368
 
5369
      if Is_Contiguous then
5370
         Set_Has_Contiguous_Rep (Typ);
5371
         Ent := First_Literal (Typ);
5372
         Num := 1;
5373
         Lst := New_List (New_Reference_To (Ent, Sloc (Ent)));
5374
 
5375
      else
5376
         --  Build list of literal references
5377
 
5378
         Lst := New_List;
5379
         Num := 0;
5380
 
5381
         Ent := First_Literal (Typ);
5382
         while Present (Ent) loop
5383
            Append_To (Lst, New_Reference_To (Ent, Sloc (Ent)));
5384
            Num := Num + 1;
5385
            Next_Literal (Ent);
5386
         end loop;
5387
      end if;
5388
 
5389
      --  Now build an array declaration
5390
 
5391
      --    typA : array (Natural range 0 .. num - 1) of ctype :=
5392
      --             (v, v, v, v, v, ....)
5393
 
5394
      --  where ctype is the corresponding integer type. If the representation
5395
      --  is contiguous, we only keep the first literal, which provides the
5396
      --  offset for Pos_To_Rep computations.
5397
 
5398
      Arr :=
5399
        Make_Defining_Identifier (Loc,
5400
          Chars => New_External_Name (Chars (Typ), 'A'));
5401
 
5402
      Append_Freeze_Action (Typ,
5403
        Make_Object_Declaration (Loc,
5404
          Defining_Identifier => Arr,
5405
          Constant_Present    => True,
5406
 
5407
          Object_Definition   =>
5408
            Make_Constrained_Array_Definition (Loc,
5409
              Discrete_Subtype_Definitions => New_List (
5410
                Make_Subtype_Indication (Loc,
5411
                  Subtype_Mark => New_Reference_To (Standard_Natural, Loc),
5412
                  Constraint =>
5413
                    Make_Range_Constraint (Loc,
5414
                      Range_Expression =>
5415
                        Make_Range (Loc,
5416
                          Low_Bound  =>
5417
                            Make_Integer_Literal (Loc, 0),
5418
                          High_Bound =>
5419
                            Make_Integer_Literal (Loc, Num - 1))))),
5420
 
5421
              Component_Definition =>
5422
                Make_Component_Definition (Loc,
5423
                  Aliased_Present => False,
5424
                  Subtype_Indication => New_Reference_To (Typ, Loc))),
5425
 
5426
          Expression =>
5427
            Make_Aggregate (Loc,
5428
              Expressions => Lst)));
5429
 
5430
      Set_Enum_Pos_To_Rep (Typ, Arr);
5431
 
5432
      --  Now we build the function that converts representation values to
5433
      --  position values. This function has the form:
5434
 
5435
      --    function _Rep_To_Pos (A : etype; F : Boolean) return Integer is
5436
      --    begin
5437
      --       case ityp!(A) is
5438
      --         when enum-lit'Enum_Rep => return posval;
5439
      --         when enum-lit'Enum_Rep => return posval;
5440
      --         ...
5441
      --         when others   =>
5442
      --           [raise Constraint_Error when F "invalid data"]
5443
      --           return -1;
5444
      --       end case;
5445
      --    end;
5446
 
5447
      --  Note: the F parameter determines whether the others case (no valid
5448
      --  representation) raises Constraint_Error or returns a unique value
5449
      --  of minus one. The latter case is used, e.g. in 'Valid code.
5450
 
5451
      --  Note: the reason we use Enum_Rep values in the case here is to avoid
5452
      --  the code generator making inappropriate assumptions about the range
5453
      --  of the values in the case where the value is invalid. ityp is a
5454
      --  signed or unsigned integer type of appropriate width.
5455
 
5456
      --  Note: if exceptions are not supported, then we suppress the raise
5457
      --  and return -1 unconditionally (this is an erroneous program in any
5458
      --  case and there is no obligation to raise Constraint_Error here!) We
5459
      --  also do this if pragma Restrictions (No_Exceptions) is active.
5460
 
5461
      --  Is this right??? What about No_Exception_Propagation???
5462
 
5463
      --  Representations are signed
5464
 
5465
      if Enumeration_Rep (First_Literal (Typ)) < 0 then
5466
 
5467
         --  The underlying type is signed. Reset the Is_Unsigned_Type
5468
         --  explicitly, because it might have been inherited from
5469
         --  parent type.
5470
 
5471
         Set_Is_Unsigned_Type (Typ, False);
5472
 
5473
         if Esize (Typ) <= Standard_Integer_Size then
5474
            Ityp := Standard_Integer;
5475
         else
5476
            Ityp := Universal_Integer;
5477
         end if;
5478
 
5479
      --  Representations are unsigned
5480
 
5481
      else
5482
         if Esize (Typ) <= Standard_Integer_Size then
5483
            Ityp := RTE (RE_Unsigned);
5484
         else
5485
            Ityp := RTE (RE_Long_Long_Unsigned);
5486
         end if;
5487
      end if;
5488
 
5489
      --  The body of the function is a case statement. First collect case
5490
      --  alternatives, or optimize the contiguous case.
5491
 
5492
      Lst := New_List;
5493
 
5494
      --  If representation is contiguous, Pos is computed by subtracting
5495
      --  the representation of the first literal.
5496
 
5497
      if Is_Contiguous then
5498
         Ent := First_Literal (Typ);
5499
 
5500
         if Enumeration_Rep (Ent) = Last_Repval then
5501
 
5502
            --  Another special case: for a single literal, Pos is zero
5503
 
5504
            Pos_Expr := Make_Integer_Literal (Loc, Uint_0);
5505
 
5506
         else
5507
            Pos_Expr :=
5508
              Convert_To (Standard_Integer,
5509
                Make_Op_Subtract (Loc,
5510
                  Left_Opnd =>
5511
                     Unchecked_Convert_To (Ityp,
5512
                       Make_Identifier (Loc, Name_uA)),
5513
                   Right_Opnd =>
5514
                     Make_Integer_Literal (Loc,
5515
                        Intval =>
5516
                          Enumeration_Rep (First_Literal (Typ)))));
5517
         end if;
5518
 
5519
         Append_To (Lst,
5520
              Make_Case_Statement_Alternative (Loc,
5521
                Discrete_Choices => New_List (
5522
                  Make_Range (Sloc (Enumeration_Rep_Expr (Ent)),
5523
                    Low_Bound =>
5524
                      Make_Integer_Literal (Loc,
5525
                       Intval =>  Enumeration_Rep (Ent)),
5526
                    High_Bound =>
5527
                      Make_Integer_Literal (Loc, Intval => Last_Repval))),
5528
 
5529
                Statements => New_List (
5530
                  Make_Simple_Return_Statement (Loc,
5531
                    Expression => Pos_Expr))));
5532
 
5533
      else
5534
         Ent := First_Literal (Typ);
5535
         while Present (Ent) loop
5536
            Append_To (Lst,
5537
              Make_Case_Statement_Alternative (Loc,
5538
                Discrete_Choices => New_List (
5539
                  Make_Integer_Literal (Sloc (Enumeration_Rep_Expr (Ent)),
5540
                    Intval => Enumeration_Rep (Ent))),
5541
 
5542
                Statements => New_List (
5543
                  Make_Simple_Return_Statement (Loc,
5544
                    Expression =>
5545
                      Make_Integer_Literal (Loc,
5546
                        Intval => Enumeration_Pos (Ent))))));
5547
 
5548
            Next_Literal (Ent);
5549
         end loop;
5550
      end if;
5551
 
5552
      --  In normal mode, add the others clause with the test
5553
 
5554
      if not No_Exception_Handlers_Set then
5555
         Append_To (Lst,
5556
           Make_Case_Statement_Alternative (Loc,
5557
             Discrete_Choices => New_List (Make_Others_Choice (Loc)),
5558
             Statements => New_List (
5559
               Make_Raise_Constraint_Error (Loc,
5560
                 Condition => Make_Identifier (Loc, Name_uF),
5561
                 Reason    => CE_Invalid_Data),
5562
               Make_Simple_Return_Statement (Loc,
5563
                 Expression =>
5564
                   Make_Integer_Literal (Loc, -1)))));
5565
 
5566
      --  If either of the restrictions No_Exceptions_Handlers/Propagation is
5567
      --  active then return -1 (we cannot usefully raise Constraint_Error in
5568
      --  this case). See description above for further details.
5569
 
5570
      else
5571
         Append_To (Lst,
5572
           Make_Case_Statement_Alternative (Loc,
5573
             Discrete_Choices => New_List (Make_Others_Choice (Loc)),
5574
             Statements => New_List (
5575
               Make_Simple_Return_Statement (Loc,
5576
                 Expression =>
5577
                   Make_Integer_Literal (Loc, -1)))));
5578
      end if;
5579
 
5580
      --  Now we can build the function body
5581
 
5582
      Fent :=
5583
        Make_Defining_Identifier (Loc, Make_TSS_Name (Typ, TSS_Rep_To_Pos));
5584
 
5585
      Func :=
5586
        Make_Subprogram_Body (Loc,
5587
          Specification =>
5588
            Make_Function_Specification (Loc,
5589
              Defining_Unit_Name       => Fent,
5590
              Parameter_Specifications => New_List (
5591
                Make_Parameter_Specification (Loc,
5592
                  Defining_Identifier =>
5593
                    Make_Defining_Identifier (Loc, Name_uA),
5594
                  Parameter_Type => New_Reference_To (Typ, Loc)),
5595
                Make_Parameter_Specification (Loc,
5596
                  Defining_Identifier =>
5597
                    Make_Defining_Identifier (Loc, Name_uF),
5598
                  Parameter_Type => New_Reference_To (Standard_Boolean, Loc))),
5599
 
5600
              Result_Definition => New_Reference_To (Standard_Integer, Loc)),
5601
 
5602
            Declarations => Empty_List,
5603
 
5604
            Handled_Statement_Sequence =>
5605
              Make_Handled_Sequence_Of_Statements (Loc,
5606
                Statements => New_List (
5607
                  Make_Case_Statement (Loc,
5608
                    Expression =>
5609
                      Unchecked_Convert_To (Ityp,
5610
                        Make_Identifier (Loc, Name_uA)),
5611
                    Alternatives => Lst))));
5612
 
5613
      Set_TSS (Typ, Fent);
5614
      Set_Is_Pure (Fent);
5615
 
5616
      if not Debug_Generated_Code then
5617
         Set_Debug_Info_Off (Fent);
5618
      end if;
5619
 
5620
   exception
5621
      when RE_Not_Available =>
5622
         return;
5623
   end Expand_Freeze_Enumeration_Type;
5624
 
5625
   -------------------------------
5626
   -- Expand_Freeze_Record_Type --
5627
   -------------------------------
5628
 
5629
   procedure Expand_Freeze_Record_Type (N : Node_Id) is
5630
      Def_Id        : constant Node_Id := Entity (N);
5631
      Type_Decl     : constant Node_Id := Parent (Def_Id);
5632
      Comp          : Entity_Id;
5633
      Comp_Typ      : Entity_Id;
5634
      Has_Static_DT : Boolean := False;
5635
      Predef_List   : List_Id;
5636
 
5637
      Flist : Entity_Id := Empty;
5638
      --  Finalization list allocated for the case of a type with anonymous
5639
      --  access components whose designated type is potentially controlled.
5640
 
5641
      Renamed_Eq : Node_Id := Empty;
5642
      --  Defining unit name for the predefined equality function in the case
5643
      --  where the type has a primitive operation that is a renaming of
5644
      --  predefined equality (but only if there is also an overriding
5645
      --  user-defined equality function). Used to pass this entity from
5646
      --  Make_Predefined_Primitive_Specs to Predefined_Primitive_Bodies.
5647
 
5648
      Wrapper_Decl_List   : List_Id := No_List;
5649
      Wrapper_Body_List   : List_Id := No_List;
5650
      Null_Proc_Decl_List : List_Id := No_List;
5651
 
5652
   --  Start of processing for Expand_Freeze_Record_Type
5653
 
5654
   begin
5655
      --  Build discriminant checking functions if not a derived type (for
5656
      --  derived types that are not tagged types, always use the discriminant
5657
      --  checking functions of the parent type). However, for untagged types
5658
      --  the derivation may have taken place before the parent was frozen, so
5659
      --  we copy explicitly the discriminant checking functions from the
5660
      --  parent into the components of the derived type.
5661
 
5662
      if not Is_Derived_Type (Def_Id)
5663
        or else Has_New_Non_Standard_Rep (Def_Id)
5664
        or else Is_Tagged_Type (Def_Id)
5665
      then
5666
         Build_Discr_Checking_Funcs (Type_Decl);
5667
 
5668
      elsif Is_Derived_Type (Def_Id)
5669
        and then not Is_Tagged_Type (Def_Id)
5670
 
5671
         --  If we have a derived Unchecked_Union, we do not inherit the
5672
         --  discriminant checking functions from the parent type since the
5673
         --  discriminants are non existent.
5674
 
5675
        and then not Is_Unchecked_Union (Def_Id)
5676
        and then Has_Discriminants (Def_Id)
5677
      then
5678
         declare
5679
            Old_Comp : Entity_Id;
5680
 
5681
         begin
5682
            Old_Comp :=
5683
              First_Component (Base_Type (Underlying_Type (Etype (Def_Id))));
5684
            Comp := First_Component (Def_Id);
5685
            while Present (Comp) loop
5686
               if Ekind (Comp) = E_Component
5687
                 and then Chars (Comp) = Chars (Old_Comp)
5688
               then
5689
                  Set_Discriminant_Checking_Func (Comp,
5690
                    Discriminant_Checking_Func (Old_Comp));
5691
               end if;
5692
 
5693
               Next_Component (Old_Comp);
5694
               Next_Component (Comp);
5695
            end loop;
5696
         end;
5697
      end if;
5698
 
5699
      if Is_Derived_Type (Def_Id)
5700
        and then Is_Limited_Type (Def_Id)
5701
        and then Is_Tagged_Type (Def_Id)
5702
      then
5703
         Check_Stream_Attributes (Def_Id);
5704
      end if;
5705
 
5706
      --  Update task and controlled component flags, because some of the
5707
      --  component types may have been private at the point of the record
5708
      --  declaration.
5709
 
5710
      Comp := First_Component (Def_Id);
5711
 
5712
      while Present (Comp) loop
5713
         Comp_Typ := Etype (Comp);
5714
 
5715
         if Has_Task (Comp_Typ) then
5716
            Set_Has_Task (Def_Id);
5717
 
5718
         --  Do not set Has_Controlled_Component on a class-wide equivalent
5719
         --  type. See Make_CW_Equivalent_Type.
5720
 
5721
         elsif not Is_Class_Wide_Equivalent_Type (Def_Id)
5722
           and then (Has_Controlled_Component (Comp_Typ)
5723
                      or else (Chars (Comp) /= Name_uParent
5724
                                and then Is_Controlled (Comp_Typ)))
5725
         then
5726
            Set_Has_Controlled_Component (Def_Id);
5727
 
5728
         elsif Ekind (Comp_Typ) = E_Anonymous_Access_Type
5729
           and then Needs_Finalization (Directly_Designated_Type (Comp_Typ))
5730
         then
5731
            if No (Flist) then
5732
               Flist := Add_Final_Chain (Def_Id);
5733
            end if;
5734
 
5735
            Set_Associated_Final_Chain (Comp_Typ, Flist);
5736
         end if;
5737
 
5738
         Next_Component (Comp);
5739
      end loop;
5740
 
5741
      --  Handle constructors of non-tagged CPP_Class types
5742
 
5743
      if not Is_Tagged_Type (Def_Id) and then Is_CPP_Class (Def_Id) then
5744
         Set_CPP_Constructors (Def_Id);
5745
      end if;
5746
 
5747
      --  Creation of the Dispatch Table. Note that a Dispatch Table is built
5748
      --  for regular tagged types as well as for Ada types deriving from a C++
5749
      --  Class, but not for tagged types directly corresponding to C++ classes
5750
      --  In the later case we assume that it is created in the C++ side and we
5751
      --  just use it.
5752
 
5753
      if Is_Tagged_Type (Def_Id) then
5754
         Has_Static_DT :=
5755
           Static_Dispatch_Tables
5756
             and then Is_Library_Level_Tagged_Type (Def_Id);
5757
 
5758
         --  Add the _Tag component
5759
 
5760
         if Underlying_Type (Etype (Def_Id)) = Def_Id then
5761
            Expand_Tagged_Root (Def_Id);
5762
         end if;
5763
 
5764
         if Is_CPP_Class (Def_Id) then
5765
            Set_All_DT_Position (Def_Id);
5766
            Set_CPP_Constructors (Def_Id);
5767
 
5768
            --  Create the tag entities with a minimum decoration
5769
 
5770
            if Tagged_Type_Expansion then
5771
               Append_Freeze_Actions (Def_Id, Make_Tags (Def_Id));
5772
            end if;
5773
 
5774
         else
5775
            if not Has_Static_DT then
5776
 
5777
               --  Usually inherited primitives are not delayed but the first
5778
               --  Ada extension of a CPP_Class is an exception since the
5779
               --  address of the inherited subprogram has to be inserted in
5780
               --  the new Ada Dispatch Table and this is a freezing action.
5781
 
5782
               --  Similarly, if this is an inherited operation whose parent is
5783
               --  not frozen yet, it is not in the DT of the parent, and we
5784
               --  generate an explicit freeze node for the inherited operation
5785
               --  so that it is properly inserted in the DT of the current
5786
               --  type.
5787
 
5788
               declare
5789
                  Elmt : Elmt_Id := First_Elmt (Primitive_Operations (Def_Id));
5790
                  Subp : Entity_Id;
5791
 
5792
               begin
5793
                  while Present (Elmt) loop
5794
                     Subp := Node (Elmt);
5795
 
5796
                     if Present (Alias (Subp)) then
5797
                        if Is_CPP_Class (Etype (Def_Id)) then
5798
                           Set_Has_Delayed_Freeze (Subp);
5799
 
5800
                        elsif Has_Delayed_Freeze (Alias (Subp))
5801
                          and then not Is_Frozen (Alias (Subp))
5802
                        then
5803
                           Set_Is_Frozen (Subp, False);
5804
                           Set_Has_Delayed_Freeze (Subp);
5805
                        end if;
5806
                     end if;
5807
 
5808
                     Next_Elmt (Elmt);
5809
                  end loop;
5810
               end;
5811
            end if;
5812
 
5813
            --  Unfreeze momentarily the type to add the predefined primitives
5814
            --  operations. The reason we unfreeze is so that these predefined
5815
            --  operations will indeed end up as primitive operations (which
5816
            --  must be before the freeze point).
5817
 
5818
            Set_Is_Frozen (Def_Id, False);
5819
 
5820
            --  Do not add the spec of predefined primitives in case of
5821
            --  CPP tagged type derivations that have convention CPP.
5822
 
5823
            if Is_CPP_Class (Root_Type (Def_Id))
5824
              and then Convention (Def_Id) = Convention_CPP
5825
            then
5826
               null;
5827
 
5828
            --  Do not add the spec of the predefined primitives if we are
5829
            --  compiling under restriction No_Dispatching_Calls
5830
 
5831
            elsif not Restriction_Active (No_Dispatching_Calls) then
5832
               Make_Predefined_Primitive_Specs
5833
                 (Def_Id, Predef_List, Renamed_Eq);
5834
               Insert_List_Before_And_Analyze (N, Predef_List);
5835
            end if;
5836
 
5837
            --  Ada 2005 (AI-391): For a nonabstract null extension, create
5838
            --  wrapper functions for each nonoverridden inherited function
5839
            --  with a controlling result of the type. The wrapper for such
5840
            --  a function returns an extension aggregate that invokes the
5841
            --  the parent function.
5842
 
5843
            if Ada_Version >= Ada_05
5844
              and then not Is_Abstract_Type (Def_Id)
5845
              and then Is_Null_Extension (Def_Id)
5846
            then
5847
               Make_Controlling_Function_Wrappers
5848
                 (Def_Id, Wrapper_Decl_List, Wrapper_Body_List);
5849
               Insert_List_Before_And_Analyze (N, Wrapper_Decl_List);
5850
            end if;
5851
 
5852
            --  Ada 2005 (AI-251): For a nonabstract type extension, build
5853
            --  null procedure declarations for each set of homographic null
5854
            --  procedures that are inherited from interface types but not
5855
            --  overridden. This is done to ensure that the dispatch table
5856
            --  entry associated with such null primitives are properly filled.
5857
 
5858
            if Ada_Version >= Ada_05
5859
              and then Etype (Def_Id) /= Def_Id
5860
              and then not Is_Abstract_Type (Def_Id)
5861
            then
5862
               Make_Null_Procedure_Specs (Def_Id, Null_Proc_Decl_List);
5863
               Insert_Actions (N, Null_Proc_Decl_List);
5864
            end if;
5865
 
5866
            Set_Is_Frozen (Def_Id);
5867
            Set_All_DT_Position (Def_Id);
5868
 
5869
            --  Add the controlled component before the freezing actions
5870
            --  referenced in those actions.
5871
 
5872
            if Has_New_Controlled_Component (Def_Id) then
5873
               Expand_Record_Controller (Def_Id);
5874
            end if;
5875
 
5876
            --  Create and decorate the tags. Suppress their creation when
5877
            --  VM_Target because the dispatching mechanism is handled
5878
            --  internally by the VMs.
5879
 
5880
            if Tagged_Type_Expansion then
5881
               Append_Freeze_Actions (Def_Id, Make_Tags (Def_Id));
5882
 
5883
               --  Generate dispatch table of locally defined tagged type.
5884
               --  Dispatch tables of library level tagged types are built
5885
               --  later (see Analyze_Declarations).
5886
 
5887
               if not Has_Static_DT then
5888
                  Append_Freeze_Actions (Def_Id, Make_DT (Def_Id));
5889
               end if;
5890
            end if;
5891
 
5892
            --  If the type has unknown discriminants, propagate dispatching
5893
            --  information to its underlying record view, which does not get
5894
            --  its own dispatch table.
5895
 
5896
            if Is_Derived_Type (Def_Id)
5897
              and then Has_Unknown_Discriminants (Def_Id)
5898
              and then Present (Underlying_Record_View (Def_Id))
5899
            then
5900
               declare
5901
                  Rep : constant Entity_Id :=
5902
                           Underlying_Record_View (Def_Id);
5903
               begin
5904
                  Set_Access_Disp_Table
5905
                    (Rep, Access_Disp_Table       (Def_Id));
5906
                  Set_Dispatch_Table_Wrappers
5907
                    (Rep, Dispatch_Table_Wrappers (Def_Id));
5908
                  Set_Primitive_Operations
5909
                    (Rep, Primitive_Operations    (Def_Id));
5910
               end;
5911
            end if;
5912
 
5913
            --  Make sure that the primitives Initialize, Adjust and Finalize
5914
            --  are Frozen before other TSS subprograms. We don't want them
5915
            --  Frozen inside.
5916
 
5917
            if Is_Controlled (Def_Id) then
5918
               if not Is_Limited_Type (Def_Id) then
5919
                  Append_Freeze_Actions (Def_Id,
5920
                    Freeze_Entity
5921
                      (Find_Prim_Op (Def_Id, Name_Adjust), Sloc (Def_Id)));
5922
               end if;
5923
 
5924
               Append_Freeze_Actions (Def_Id,
5925
                 Freeze_Entity
5926
                   (Find_Prim_Op (Def_Id, Name_Initialize), Sloc (Def_Id)));
5927
 
5928
               Append_Freeze_Actions (Def_Id,
5929
                 Freeze_Entity
5930
                   (Find_Prim_Op (Def_Id, Name_Finalize), Sloc (Def_Id)));
5931
            end if;
5932
 
5933
            --  Freeze rest of primitive operations. There is no need to handle
5934
            --  the predefined primitives if we are compiling under restriction
5935
            --  No_Dispatching_Calls
5936
 
5937
            if not Restriction_Active (No_Dispatching_Calls) then
5938
               Append_Freeze_Actions
5939
                 (Def_Id, Predefined_Primitive_Freeze (Def_Id));
5940
            end if;
5941
         end if;
5942
 
5943
      --  In the non-tagged case, an equality function is provided only for
5944
      --  variant records (that are not unchecked unions).
5945
 
5946
      elsif Has_Discriminants (Def_Id)
5947
        and then not Is_Limited_Type (Def_Id)
5948
      then
5949
         declare
5950
            Comps : constant Node_Id :=
5951
                      Component_List (Type_Definition (Type_Decl));
5952
 
5953
         begin
5954
            if Present (Comps)
5955
              and then Present (Variant_Part (Comps))
5956
            then
5957
               Build_Variant_Record_Equality (Def_Id);
5958
            end if;
5959
         end;
5960
      end if;
5961
 
5962
      --  Before building the record initialization procedure, if we are
5963
      --  dealing with a concurrent record value type, then we must go through
5964
      --  the discriminants, exchanging discriminals between the concurrent
5965
      --  type and the concurrent record value type. See the section "Handling
5966
      --  of Discriminants" in the Einfo spec for details.
5967
 
5968
      if Is_Concurrent_Record_Type (Def_Id)
5969
        and then Has_Discriminants (Def_Id)
5970
      then
5971
         declare
5972
            Ctyp : constant Entity_Id :=
5973
                     Corresponding_Concurrent_Type (Def_Id);
5974
            Conc_Discr : Entity_Id;
5975
            Rec_Discr  : Entity_Id;
5976
            Temp       : Entity_Id;
5977
 
5978
         begin
5979
            Conc_Discr := First_Discriminant (Ctyp);
5980
            Rec_Discr  := First_Discriminant (Def_Id);
5981
 
5982
            while Present (Conc_Discr) loop
5983
               Temp := Discriminal (Conc_Discr);
5984
               Set_Discriminal (Conc_Discr, Discriminal (Rec_Discr));
5985
               Set_Discriminal (Rec_Discr, Temp);
5986
 
5987
               Set_Discriminal_Link (Discriminal (Conc_Discr), Conc_Discr);
5988
               Set_Discriminal_Link (Discriminal (Rec_Discr),  Rec_Discr);
5989
 
5990
               Next_Discriminant (Conc_Discr);
5991
               Next_Discriminant (Rec_Discr);
5992
            end loop;
5993
         end;
5994
      end if;
5995
 
5996
      if Has_Controlled_Component (Def_Id) then
5997
         if No (Controller_Component (Def_Id)) then
5998
            Expand_Record_Controller (Def_Id);
5999
         end if;
6000
 
6001
         Build_Controlling_Procs (Def_Id);
6002
      end if;
6003
 
6004
      Adjust_Discriminants (Def_Id);
6005
 
6006
      if Tagged_Type_Expansion or else not Is_Interface (Def_Id) then
6007
 
6008
         --  Do not need init for interfaces on e.g. CIL since they're
6009
         --  abstract. Helps operation of peverify (the PE Verify tool).
6010
 
6011
         Build_Record_Init_Proc (Type_Decl, Def_Id);
6012
      end if;
6013
 
6014
      --  For tagged type that are not interfaces, build bodies of primitive
6015
      --  operations. Note that we do this after building the record
6016
      --  initialization procedure, since the primitive operations may need
6017
      --  the initialization routine. There is no need to add predefined
6018
      --  primitives of interfaces because all their predefined primitives
6019
      --  are abstract.
6020
 
6021
      if Is_Tagged_Type (Def_Id)
6022
        and then not Is_Interface (Def_Id)
6023
      then
6024
         --  Do not add the body of predefined primitives in case of
6025
         --  CPP tagged type derivations that have convention CPP.
6026
 
6027
         if Is_CPP_Class (Root_Type (Def_Id))
6028
           and then Convention (Def_Id) = Convention_CPP
6029
         then
6030
            null;
6031
 
6032
         --  Do not add the body of the predefined primitives if we are
6033
         --  compiling under restriction No_Dispatching_Calls or if we are
6034
         --  compiling a CPP tagged type.
6035
 
6036
         elsif not Restriction_Active (No_Dispatching_Calls) then
6037
            Predef_List := Predefined_Primitive_Bodies (Def_Id, Renamed_Eq);
6038
            Append_Freeze_Actions (Def_Id, Predef_List);
6039
         end if;
6040
 
6041
         --  Ada 2005 (AI-391): If any wrappers were created for nonoverridden
6042
         --  inherited functions, then add their bodies to the freeze actions.
6043
 
6044
         if Present (Wrapper_Body_List) then
6045
            Append_Freeze_Actions (Def_Id, Wrapper_Body_List);
6046
         end if;
6047
 
6048
         --  Create extra formals for the primitive operations of the type.
6049
         --  This must be done before analyzing the body of the initialization
6050
         --  procedure, because a self-referential type might call one of these
6051
         --  primitives in the body of the init_proc itself.
6052
 
6053
         declare
6054
            Elmt : Elmt_Id;
6055
            Subp : Entity_Id;
6056
 
6057
         begin
6058
            Elmt := First_Elmt (Primitive_Operations (Def_Id));
6059
            while Present (Elmt) loop
6060
               Subp := Node (Elmt);
6061
               if not Has_Foreign_Convention (Subp)
6062
                 and then not Is_Predefined_Dispatching_Operation (Subp)
6063
               then
6064
                  Create_Extra_Formals (Subp);
6065
               end if;
6066
 
6067
               Next_Elmt (Elmt);
6068
            end loop;
6069
         end;
6070
      end if;
6071
   end Expand_Freeze_Record_Type;
6072
 
6073
   ------------------------------
6074
   -- Freeze_Stream_Operations --
6075
   ------------------------------
6076
 
6077
   procedure Freeze_Stream_Operations (N : Node_Id; Typ : Entity_Id) is
6078
      Names     : constant array (1 .. 4) of TSS_Name_Type :=
6079
                    (TSS_Stream_Input,
6080
                     TSS_Stream_Output,
6081
                     TSS_Stream_Read,
6082
                     TSS_Stream_Write);
6083
      Stream_Op : Entity_Id;
6084
 
6085
   begin
6086
      --  Primitive operations of tagged types are frozen when the dispatch
6087
      --  table is constructed.
6088
 
6089
      if not Comes_From_Source (Typ)
6090
        or else Is_Tagged_Type (Typ)
6091
      then
6092
         return;
6093
      end if;
6094
 
6095
      for J in Names'Range loop
6096
         Stream_Op := TSS (Typ, Names (J));
6097
 
6098
         if Present (Stream_Op)
6099
           and then Is_Subprogram (Stream_Op)
6100
           and then Nkind (Unit_Declaration_Node (Stream_Op)) =
6101
                      N_Subprogram_Declaration
6102
           and then not Is_Frozen (Stream_Op)
6103
         then
6104
            Append_Freeze_Actions
6105
               (Typ, Freeze_Entity (Stream_Op, Sloc (N)));
6106
         end if;
6107
      end loop;
6108
   end Freeze_Stream_Operations;
6109
 
6110
   -----------------
6111
   -- Freeze_Type --
6112
   -----------------
6113
 
6114
   --  Full type declarations are expanded at the point at which the type is
6115
   --  frozen. The formal N is the Freeze_Node for the type. Any statements or
6116
   --  declarations generated by the freezing (e.g. the procedure generated
6117
   --  for initialization) are chained in the Actions field list of the freeze
6118
   --  node using Append_Freeze_Actions.
6119
 
6120
   function Freeze_Type (N : Node_Id) return Boolean is
6121
      Def_Id    : constant Entity_Id := Entity (N);
6122
      RACW_Seen : Boolean := False;
6123
      Result    : Boolean := False;
6124
 
6125
   begin
6126
      --  Process associated access types needing special processing
6127
 
6128
      if Present (Access_Types_To_Process (N)) then
6129
         declare
6130
            E : Elmt_Id := First_Elmt (Access_Types_To_Process (N));
6131
         begin
6132
            while Present (E) loop
6133
 
6134
               if Is_Remote_Access_To_Class_Wide_Type (Node (E)) then
6135
                  Validate_RACW_Primitives (Node (E));
6136
                  RACW_Seen := True;
6137
               end if;
6138
 
6139
               E := Next_Elmt (E);
6140
            end loop;
6141
         end;
6142
 
6143
         if RACW_Seen then
6144
 
6145
            --  If there are RACWs designating this type, make stubs now
6146
 
6147
            Remote_Types_Tagged_Full_View_Encountered (Def_Id);
6148
         end if;
6149
      end if;
6150
 
6151
      --  Freeze processing for record types
6152
 
6153
      if Is_Record_Type (Def_Id) then
6154
         if Ekind (Def_Id) = E_Record_Type then
6155
            Expand_Freeze_Record_Type (N);
6156
 
6157
         --  The subtype may have been declared before the type was frozen. If
6158
         --  the type has controlled components it is necessary to create the
6159
         --  entity for the controller explicitly because it did not exist at
6160
         --  the point of the subtype declaration. Only the entity is needed,
6161
         --  the back-end will obtain the layout from the type. This is only
6162
         --  necessary if this is constrained subtype whose component list is
6163
         --  not shared with the base type.
6164
 
6165
         elsif Ekind (Def_Id) = E_Record_Subtype
6166
           and then Has_Discriminants (Def_Id)
6167
           and then Last_Entity (Def_Id) /= Last_Entity (Base_Type (Def_Id))
6168
           and then Present (Controller_Component (Def_Id))
6169
         then
6170
            declare
6171
               Old_C : constant Entity_Id := Controller_Component (Def_Id);
6172
               New_C : Entity_Id;
6173
 
6174
            begin
6175
               if Scope (Old_C) = Base_Type (Def_Id) then
6176
 
6177
                  --  The entity is the one in the parent. Create new one
6178
 
6179
                  New_C := New_Copy (Old_C);
6180
                  Set_Parent (New_C, Parent (Old_C));
6181
                  Push_Scope (Def_Id);
6182
                  Enter_Name (New_C);
6183
                  End_Scope;
6184
               end if;
6185
            end;
6186
 
6187
            if Is_Itype (Def_Id)
6188
              and then Is_Record_Type (Underlying_Type (Scope (Def_Id)))
6189
            then
6190
               --  The freeze node is only used to introduce the controller,
6191
               --  the back-end has no use for it for a discriminated
6192
               --  component.
6193
 
6194
               Set_Freeze_Node (Def_Id, Empty);
6195
               Set_Has_Delayed_Freeze (Def_Id, False);
6196
               Result := True;
6197
            end if;
6198
 
6199
         --  Similar process if the controller of the subtype is not present
6200
         --  but the parent has it. This can happen with constrained
6201
         --  record components where the subtype is an itype.
6202
 
6203
         elsif Ekind (Def_Id) = E_Record_Subtype
6204
           and then Is_Itype (Def_Id)
6205
           and then No (Controller_Component (Def_Id))
6206
           and then Present (Controller_Component (Etype (Def_Id)))
6207
         then
6208
            declare
6209
               Old_C : constant Entity_Id :=
6210
                         Controller_Component (Etype (Def_Id));
6211
               New_C : constant Entity_Id := New_Copy (Old_C);
6212
 
6213
            begin
6214
               Set_Next_Entity  (New_C, First_Entity (Def_Id));
6215
               Set_First_Entity (Def_Id, New_C);
6216
 
6217
               --  The freeze node is only used to introduce the controller,
6218
               --  the back-end has no use for it for a discriminated
6219
               --   component.
6220
 
6221
               Set_Freeze_Node (Def_Id, Empty);
6222
               Set_Has_Delayed_Freeze (Def_Id, False);
6223
               Result := True;
6224
            end;
6225
         end if;
6226
 
6227
      --  Freeze processing for array types
6228
 
6229
      elsif Is_Array_Type (Def_Id) then
6230
         Expand_Freeze_Array_Type (N);
6231
 
6232
      --  Freeze processing for access types
6233
 
6234
      --  For pool-specific access types, find out the pool object used for
6235
      --  this type, needs actual expansion of it in some cases. Here are the
6236
      --  different cases :
6237
 
6238
      --  1. Rep Clause "for Def_Id'Storage_Size use 0;"
6239
      --      ---> don't use any storage pool
6240
 
6241
      --  2. Rep Clause : for Def_Id'Storage_Size use Expr.
6242
      --     Expand:
6243
      --      Def_Id__Pool : Stack_Bounded_Pool (Expr, DT'Size, DT'Alignment);
6244
 
6245
      --  3. Rep Clause "for Def_Id'Storage_Pool use a_Pool_Object"
6246
      --      ---> Storage Pool is the specified one
6247
 
6248
      --  See GNAT Pool packages in the Run-Time for more details
6249
 
6250
      elsif Ekind (Def_Id) = E_Access_Type
6251
        or else Ekind (Def_Id) = E_General_Access_Type
6252
      then
6253
         declare
6254
            Loc         : constant Source_Ptr := Sloc (N);
6255
            Desig_Type  : constant Entity_Id  := Designated_Type (Def_Id);
6256
            Pool_Object : Entity_Id;
6257
 
6258
            Freeze_Action_Typ : Entity_Id;
6259
 
6260
         begin
6261
            --  Case 1
6262
 
6263
            --    Rep Clause "for Def_Id'Storage_Size use 0;"
6264
            --    ---> don't use any storage pool
6265
 
6266
            if No_Pool_Assigned (Def_Id) then
6267
               null;
6268
 
6269
            --  Case 2
6270
 
6271
            --    Rep Clause : for Def_Id'Storage_Size use Expr.
6272
            --    ---> Expand:
6273
            --           Def_Id__Pool : Stack_Bounded_Pool
6274
            --                            (Expr, DT'Size, DT'Alignment);
6275
 
6276
            elsif Has_Storage_Size_Clause (Def_Id) then
6277
               declare
6278
                  DT_Size  : Node_Id;
6279
                  DT_Align : Node_Id;
6280
 
6281
               begin
6282
                  --  For unconstrained composite types we give a size of zero
6283
                  --  so that the pool knows that it needs a special algorithm
6284
                  --  for variable size object allocation.
6285
 
6286
                  if Is_Composite_Type (Desig_Type)
6287
                    and then not Is_Constrained (Desig_Type)
6288
                  then
6289
                     DT_Size :=
6290
                       Make_Integer_Literal (Loc, 0);
6291
 
6292
                     DT_Align :=
6293
                       Make_Integer_Literal (Loc, Maximum_Alignment);
6294
 
6295
                  else
6296
                     DT_Size :=
6297
                       Make_Attribute_Reference (Loc,
6298
                         Prefix => New_Reference_To (Desig_Type, Loc),
6299
                         Attribute_Name => Name_Max_Size_In_Storage_Elements);
6300
 
6301
                     DT_Align :=
6302
                       Make_Attribute_Reference (Loc,
6303
                         Prefix => New_Reference_To (Desig_Type, Loc),
6304
                         Attribute_Name => Name_Alignment);
6305
                  end if;
6306
 
6307
                  Pool_Object :=
6308
                    Make_Defining_Identifier (Loc,
6309
                      Chars => New_External_Name (Chars (Def_Id), 'P'));
6310
 
6311
                  --  We put the code associated with the pools in the entity
6312
                  --  that has the later freeze node, usually the access type
6313
                  --  but it can also be the designated_type; because the pool
6314
                  --  code requires both those types to be frozen
6315
 
6316
                  if Is_Frozen (Desig_Type)
6317
                    and then (No (Freeze_Node (Desig_Type))
6318
                               or else Analyzed (Freeze_Node (Desig_Type)))
6319
                  then
6320
                     Freeze_Action_Typ := Def_Id;
6321
 
6322
                  --  A Taft amendment type cannot get the freeze actions
6323
                  --  since the full view is not there.
6324
 
6325
                  elsif Is_Incomplete_Or_Private_Type (Desig_Type)
6326
                    and then No (Full_View (Desig_Type))
6327
                  then
6328
                     Freeze_Action_Typ := Def_Id;
6329
 
6330
                  else
6331
                     Freeze_Action_Typ := Desig_Type;
6332
                  end if;
6333
 
6334
                  Append_Freeze_Action (Freeze_Action_Typ,
6335
                    Make_Object_Declaration (Loc,
6336
                      Defining_Identifier => Pool_Object,
6337
                      Object_Definition =>
6338
                        Make_Subtype_Indication (Loc,
6339
                          Subtype_Mark =>
6340
                            New_Reference_To
6341
                              (RTE (RE_Stack_Bounded_Pool), Loc),
6342
 
6343
                          Constraint =>
6344
                            Make_Index_Or_Discriminant_Constraint (Loc,
6345
                              Constraints => New_List (
6346
 
6347
                              --  First discriminant is the Pool Size
6348
 
6349
                                New_Reference_To (
6350
                                  Storage_Size_Variable (Def_Id), Loc),
6351
 
6352
                              --  Second discriminant is the element size
6353
 
6354
                                DT_Size,
6355
 
6356
                              --  Third discriminant is the alignment
6357
 
6358
                                DT_Align)))));
6359
               end;
6360
 
6361
               Set_Associated_Storage_Pool (Def_Id, Pool_Object);
6362
 
6363
            --  Case 3
6364
 
6365
            --    Rep Clause "for Def_Id'Storage_Pool use a_Pool_Object"
6366
            --    ---> Storage Pool is the specified one
6367
 
6368
            elsif Present (Associated_Storage_Pool (Def_Id)) then
6369
 
6370
               --  Nothing to do the associated storage pool has been attached
6371
               --  when analyzing the rep. clause
6372
 
6373
               null;
6374
            end if;
6375
 
6376
            --  For access-to-controlled types (including class-wide types and
6377
            --  Taft-amendment types which potentially have controlled
6378
            --  components), expand the list controller object that will store
6379
            --  the dynamically allocated objects. Do not do this
6380
            --  transformation for expander-generated access types, but do it
6381
            --  for types that are the full view of types derived from other
6382
            --  private types. Also suppress the list controller in the case
6383
            --  of a designated type with convention Java, since this is used
6384
            --  when binding to Java API specs, where there's no equivalent of
6385
            --  a finalization list and we don't want to pull in the
6386
            --  finalization support if not needed.
6387
 
6388
            if not Comes_From_Source (Def_Id)
6389
               and then not Has_Private_Declaration (Def_Id)
6390
            then
6391
               null;
6392
 
6393
            elsif (Needs_Finalization (Desig_Type)
6394
                    and then Convention (Desig_Type) /= Convention_Java
6395
                    and then Convention (Desig_Type) /= Convention_CIL)
6396
              or else
6397
                (Is_Incomplete_Or_Private_Type (Desig_Type)
6398
                   and then No (Full_View (Desig_Type))
6399
 
6400
                  --  An exception is made for types defined in the run-time
6401
                  --  because Ada.Tags.Tag itself is such a type and cannot
6402
                  --  afford this unnecessary overhead that would generates a
6403
                  --  loop in the expansion scheme...
6404
 
6405
                  and then not In_Runtime (Def_Id)
6406
 
6407
                  --  Another exception is if Restrictions (No_Finalization)
6408
                  --  is active, since then we know nothing is controlled.
6409
 
6410
                  and then not Restriction_Active (No_Finalization))
6411
 
6412
               --  If the designated type is not frozen yet, its controlled
6413
               --  status must be retrieved explicitly.
6414
 
6415
              or else (Is_Array_Type (Desig_Type)
6416
                and then not Is_Frozen (Desig_Type)
6417
                and then Needs_Finalization (Component_Type (Desig_Type)))
6418
 
6419
               --  The designated type has controlled anonymous access
6420
               --  discriminants.
6421
 
6422
              or else Has_Controlled_Coextensions (Desig_Type)
6423
            then
6424
               Set_Associated_Final_Chain (Def_Id, Add_Final_Chain (Def_Id));
6425
            end if;
6426
         end;
6427
 
6428
      --  Freeze processing for enumeration types
6429
 
6430
      elsif Ekind (Def_Id) = E_Enumeration_Type then
6431
 
6432
         --  We only have something to do if we have a non-standard
6433
         --  representation (i.e. at least one literal whose pos value
6434
         --  is not the same as its representation)
6435
 
6436
         if Has_Non_Standard_Rep (Def_Id) then
6437
            Expand_Freeze_Enumeration_Type (N);
6438
         end if;
6439
 
6440
      --  Private types that are completed by a derivation from a private
6441
      --  type have an internally generated full view, that needs to be
6442
      --  frozen. This must be done explicitly because the two views share
6443
      --  the freeze node, and the underlying full view is not visible when
6444
      --  the freeze node is analyzed.
6445
 
6446
      elsif Is_Private_Type (Def_Id)
6447
        and then Is_Derived_Type (Def_Id)
6448
        and then Present (Full_View (Def_Id))
6449
        and then Is_Itype (Full_View (Def_Id))
6450
        and then Has_Private_Declaration (Full_View (Def_Id))
6451
        and then Freeze_Node (Full_View (Def_Id)) = N
6452
      then
6453
         Set_Entity (N, Full_View (Def_Id));
6454
         Result := Freeze_Type (N);
6455
         Set_Entity (N, Def_Id);
6456
 
6457
      --  All other types require no expander action. There are such cases
6458
      --  (e.g. task types and protected types). In such cases, the freeze
6459
      --  nodes are there for use by Gigi.
6460
 
6461
      end if;
6462
 
6463
      Freeze_Stream_Operations (N, Def_Id);
6464
      return Result;
6465
 
6466
   exception
6467
      when RE_Not_Available =>
6468
         return False;
6469
   end Freeze_Type;
6470
 
6471
   -------------------------
6472
   -- Get_Simple_Init_Val --
6473
   -------------------------
6474
 
6475
   function Get_Simple_Init_Val
6476
     (T    : Entity_Id;
6477
      N    : Node_Id;
6478
      Size : Uint := No_Uint) return Node_Id
6479
   is
6480
      Loc    : constant Source_Ptr := Sloc (N);
6481
      Val    : Node_Id;
6482
      Result : Node_Id;
6483
      Val_RE : RE_Id;
6484
 
6485
      Size_To_Use : Uint;
6486
      --  This is the size to be used for computation of the appropriate
6487
      --  initial value for the Normalize_Scalars and Initialize_Scalars case.
6488
 
6489
      IV_Attribute : constant Boolean :=
6490
                       Nkind (N) = N_Attribute_Reference
6491
                         and then Attribute_Name (N) = Name_Invalid_Value;
6492
 
6493
      Lo_Bound : Uint;
6494
      Hi_Bound : Uint;
6495
      --  These are the values computed by the procedure Check_Subtype_Bounds
6496
 
6497
      procedure Check_Subtype_Bounds;
6498
      --  This procedure examines the subtype T, and its ancestor subtypes and
6499
      --  derived types to determine the best known information about the
6500
      --  bounds of the subtype. After the call Lo_Bound is set either to
6501
      --  No_Uint if no information can be determined, or to a value which
6502
      --  represents a known low bound, i.e. a valid value of the subtype can
6503
      --  not be less than this value. Hi_Bound is similarly set to a known
6504
      --  high bound (valid value cannot be greater than this).
6505
 
6506
      --------------------------
6507
      -- Check_Subtype_Bounds --
6508
      --------------------------
6509
 
6510
      procedure Check_Subtype_Bounds is
6511
         ST1  : Entity_Id;
6512
         ST2  : Entity_Id;
6513
         Lo   : Node_Id;
6514
         Hi   : Node_Id;
6515
         Loval : Uint;
6516
         Hival : Uint;
6517
 
6518
      begin
6519
         Lo_Bound := No_Uint;
6520
         Hi_Bound := No_Uint;
6521
 
6522
         --  Loop to climb ancestor subtypes and derived types
6523
 
6524
         ST1 := T;
6525
         loop
6526
            if not Is_Discrete_Type (ST1) then
6527
               return;
6528
            end if;
6529
 
6530
            Lo := Type_Low_Bound (ST1);
6531
            Hi := Type_High_Bound (ST1);
6532
 
6533
            if Compile_Time_Known_Value (Lo) then
6534
               Loval := Expr_Value (Lo);
6535
 
6536
               if Lo_Bound = No_Uint or else Lo_Bound < Loval then
6537
                  Lo_Bound := Loval;
6538
               end if;
6539
            end if;
6540
 
6541
            if Compile_Time_Known_Value (Hi) then
6542
               Hival := Expr_Value (Hi);
6543
 
6544
               if Hi_Bound = No_Uint or else Hi_Bound > Hival then
6545
                  Hi_Bound := Hival;
6546
               end if;
6547
            end if;
6548
 
6549
            ST2 := Ancestor_Subtype (ST1);
6550
 
6551
            if No (ST2) then
6552
               ST2 := Etype (ST1);
6553
            end if;
6554
 
6555
            exit when ST1 = ST2;
6556
            ST1 := ST2;
6557
         end loop;
6558
      end Check_Subtype_Bounds;
6559
 
6560
   --  Start of processing for Get_Simple_Init_Val
6561
 
6562
   begin
6563
      --  For a private type, we should always have an underlying type
6564
      --  (because this was already checked in Needs_Simple_Initialization).
6565
      --  What we do is to get the value for the underlying type and then do
6566
      --  an Unchecked_Convert to the private type.
6567
 
6568
      if Is_Private_Type (T) then
6569
         Val := Get_Simple_Init_Val (Underlying_Type (T), N, Size);
6570
 
6571
         --  A special case, if the underlying value is null, then qualify it
6572
         --  with the underlying type, so that the null is properly typed
6573
         --  Similarly, if it is an aggregate it must be qualified, because an
6574
         --  unchecked conversion does not provide a context for it.
6575
 
6576
         if Nkind_In (Val, N_Null, N_Aggregate) then
6577
            Val :=
6578
              Make_Qualified_Expression (Loc,
6579
                Subtype_Mark =>
6580
                  New_Occurrence_Of (Underlying_Type (T), Loc),
6581
                Expression => Val);
6582
         end if;
6583
 
6584
         Result := Unchecked_Convert_To (T, Val);
6585
 
6586
         --  Don't truncate result (important for Initialize/Normalize_Scalars)
6587
 
6588
         if Nkind (Result) = N_Unchecked_Type_Conversion
6589
           and then Is_Scalar_Type (Underlying_Type (T))
6590
         then
6591
            Set_No_Truncation (Result);
6592
         end if;
6593
 
6594
         return Result;
6595
 
6596
      --  For scalars, we must have normalize/initialize scalars case, or
6597
      --  if the node N is an 'Invalid_Value attribute node.
6598
 
6599
      elsif Is_Scalar_Type (T) then
6600
         pragma Assert (Init_Or_Norm_Scalars or IV_Attribute);
6601
 
6602
         --  Compute size of object. If it is given by the caller, we can use
6603
         --  it directly, otherwise we use Esize (T) as an estimate. As far as
6604
         --  we know this covers all cases correctly.
6605
 
6606
         if Size = No_Uint or else Size <= Uint_0 then
6607
            Size_To_Use := UI_Max (Uint_1, Esize (T));
6608
         else
6609
            Size_To_Use := Size;
6610
         end if;
6611
 
6612
         --  Maximum size to use is 64 bits, since we will create values
6613
         --  of type Unsigned_64 and the range must fit this type.
6614
 
6615
         if Size_To_Use /= No_Uint and then Size_To_Use > Uint_64 then
6616
            Size_To_Use := Uint_64;
6617
         end if;
6618
 
6619
         --  Check known bounds of subtype
6620
 
6621
         Check_Subtype_Bounds;
6622
 
6623
         --  Processing for Normalize_Scalars case
6624
 
6625
         if Normalize_Scalars and then not IV_Attribute then
6626
 
6627
            --  If zero is invalid, it is a convenient value to use that is
6628
            --  for sure an appropriate invalid value in all situations.
6629
 
6630
            if Lo_Bound /= No_Uint and then Lo_Bound > Uint_0 then
6631
               Val := Make_Integer_Literal (Loc, 0);
6632
 
6633
            --  Cases where all one bits is the appropriate invalid value
6634
 
6635
            --  For modular types, all 1 bits is either invalid or valid. If
6636
            --  it is valid, then there is nothing that can be done since there
6637
            --  are no invalid values (we ruled out zero already).
6638
 
6639
            --  For signed integer types that have no negative values, either
6640
            --  there is room for negative values, or there is not. If there
6641
            --  is, then all 1 bits may be interpreted as minus one, which is
6642
            --  certainly invalid. Alternatively it is treated as the largest
6643
            --  positive value, in which case the observation for modular types
6644
            --  still applies.
6645
 
6646
            --  For float types, all 1-bits is a NaN (not a number), which is
6647
            --  certainly an appropriately invalid value.
6648
 
6649
            elsif Is_Unsigned_Type (T)
6650
              or else Is_Floating_Point_Type (T)
6651
              or else Is_Enumeration_Type (T)
6652
            then
6653
               Val := Make_Integer_Literal (Loc, 2 ** Size_To_Use - 1);
6654
 
6655
               --  Resolve as Unsigned_64, because the largest number we
6656
               --  can generate is out of range of universal integer.
6657
 
6658
               Analyze_And_Resolve (Val, RTE (RE_Unsigned_64));
6659
 
6660
            --  Case of signed types
6661
 
6662
            else
6663
               declare
6664
                  Signed_Size : constant Uint :=
6665
                                  UI_Min (Uint_63, Size_To_Use - 1);
6666
 
6667
               begin
6668
                  --  Normally we like to use the most negative number. The
6669
                  --  one exception is when this number is in the known
6670
                  --  subtype range and the largest positive number is not in
6671
                  --  the known subtype range.
6672
 
6673
                  --  For this exceptional case, use largest positive value
6674
 
6675
                  if Lo_Bound /= No_Uint and then Hi_Bound /= No_Uint
6676
                    and then Lo_Bound <= (-(2 ** Signed_Size))
6677
                    and then Hi_Bound < 2 ** Signed_Size
6678
                  then
6679
                     Val := Make_Integer_Literal (Loc, 2 ** Signed_Size - 1);
6680
 
6681
                     --  Normal case of largest negative value
6682
 
6683
                  else
6684
                     Val := Make_Integer_Literal (Loc, -(2 ** Signed_Size));
6685
                  end if;
6686
               end;
6687
            end if;
6688
 
6689
         --  Here for Initialize_Scalars case (or Invalid_Value attribute used)
6690
 
6691
         else
6692
            --  For float types, use float values from System.Scalar_Values
6693
 
6694
            if Is_Floating_Point_Type (T) then
6695
               if Root_Type (T) = Standard_Short_Float then
6696
                  Val_RE := RE_IS_Isf;
6697
               elsif Root_Type (T) = Standard_Float then
6698
                  Val_RE := RE_IS_Ifl;
6699
               elsif Root_Type (T) = Standard_Long_Float then
6700
                  Val_RE := RE_IS_Ilf;
6701
               else pragma Assert (Root_Type (T) = Standard_Long_Long_Float);
6702
                  Val_RE := RE_IS_Ill;
6703
               end if;
6704
 
6705
            --  If zero is invalid, use zero values from System.Scalar_Values
6706
 
6707
            elsif Lo_Bound /= No_Uint and then Lo_Bound > Uint_0 then
6708
               if Size_To_Use <= 8 then
6709
                  Val_RE := RE_IS_Iz1;
6710
               elsif Size_To_Use <= 16 then
6711
                  Val_RE := RE_IS_Iz2;
6712
               elsif Size_To_Use <= 32 then
6713
                  Val_RE := RE_IS_Iz4;
6714
               else
6715
                  Val_RE := RE_IS_Iz8;
6716
               end if;
6717
 
6718
            --  For unsigned, use unsigned values from System.Scalar_Values
6719
 
6720
            elsif Is_Unsigned_Type (T) then
6721
               if Size_To_Use <= 8 then
6722
                  Val_RE := RE_IS_Iu1;
6723
               elsif Size_To_Use <= 16 then
6724
                  Val_RE := RE_IS_Iu2;
6725
               elsif Size_To_Use <= 32 then
6726
                  Val_RE := RE_IS_Iu4;
6727
               else
6728
                  Val_RE := RE_IS_Iu8;
6729
               end if;
6730
 
6731
            --  For signed, use signed values from System.Scalar_Values
6732
 
6733
            else
6734
               if Size_To_Use <= 8 then
6735
                  Val_RE := RE_IS_Is1;
6736
               elsif Size_To_Use <= 16 then
6737
                  Val_RE := RE_IS_Is2;
6738
               elsif Size_To_Use <= 32 then
6739
                  Val_RE := RE_IS_Is4;
6740
               else
6741
                  Val_RE := RE_IS_Is8;
6742
               end if;
6743
            end if;
6744
 
6745
            Val := New_Occurrence_Of (RTE (Val_RE), Loc);
6746
         end if;
6747
 
6748
         --  The final expression is obtained by doing an unchecked conversion
6749
         --  of this result to the base type of the required subtype. We use
6750
         --  the base type to avoid the unchecked conversion from chopping
6751
         --  bits, and then we set Kill_Range_Check to preserve the "bad"
6752
         --  value.
6753
 
6754
         Result := Unchecked_Convert_To (Base_Type (T), Val);
6755
 
6756
         --  Ensure result is not truncated, since we want the "bad" bits
6757
         --  and also kill range check on result.
6758
 
6759
         if Nkind (Result) = N_Unchecked_Type_Conversion then
6760
            Set_No_Truncation (Result);
6761
            Set_Kill_Range_Check (Result, True);
6762
         end if;
6763
 
6764
         return Result;
6765
 
6766
      --  String or Wide_[Wide]_String (must have Initialize_Scalars set)
6767
 
6768
      elsif Root_Type (T) = Standard_String
6769
              or else
6770
            Root_Type (T) = Standard_Wide_String
6771
              or else
6772
            Root_Type (T) = Standard_Wide_Wide_String
6773
      then
6774
         pragma Assert (Init_Or_Norm_Scalars);
6775
 
6776
         return
6777
           Make_Aggregate (Loc,
6778
             Component_Associations => New_List (
6779
               Make_Component_Association (Loc,
6780
                 Choices => New_List (
6781
                   Make_Others_Choice (Loc)),
6782
                 Expression =>
6783
                   Get_Simple_Init_Val
6784
                     (Component_Type (T), N, Esize (Root_Type (T))))));
6785
 
6786
      --  Access type is initialized to null
6787
 
6788
      elsif Is_Access_Type (T) then
6789
         return
6790
           Make_Null (Loc);
6791
 
6792
      --  No other possibilities should arise, since we should only be
6793
      --  calling Get_Simple_Init_Val if Needs_Simple_Initialization
6794
      --  returned True, indicating one of the above cases held.
6795
 
6796
      else
6797
         raise Program_Error;
6798
      end if;
6799
 
6800
   exception
6801
      when RE_Not_Available =>
6802
         return Empty;
6803
   end Get_Simple_Init_Val;
6804
 
6805
   ------------------------------
6806
   -- Has_New_Non_Standard_Rep --
6807
   ------------------------------
6808
 
6809
   function Has_New_Non_Standard_Rep (T : Entity_Id) return Boolean is
6810
   begin
6811
      if not Is_Derived_Type (T) then
6812
         return Has_Non_Standard_Rep (T)
6813
           or else Has_Non_Standard_Rep (Root_Type (T));
6814
 
6815
      --  If Has_Non_Standard_Rep is not set on the derived type, the
6816
      --  representation is fully inherited.
6817
 
6818
      elsif not Has_Non_Standard_Rep (T) then
6819
         return False;
6820
 
6821
      else
6822
         return First_Rep_Item (T) /= First_Rep_Item (Root_Type (T));
6823
 
6824
         --  May need a more precise check here: the First_Rep_Item may
6825
         --  be a stream attribute, which does not affect the representation
6826
         --  of the type ???
6827
      end if;
6828
   end Has_New_Non_Standard_Rep;
6829
 
6830
   ----------------
6831
   -- In_Runtime --
6832
   ----------------
6833
 
6834
   function In_Runtime (E : Entity_Id) return Boolean is
6835
      S1 : Entity_Id;
6836
 
6837
   begin
6838
      S1 := Scope (E);
6839
      while Scope (S1) /= Standard_Standard loop
6840
         S1 := Scope (S1);
6841
      end loop;
6842
 
6843
      return Chars (S1) = Name_System or else Chars (S1) = Name_Ada;
6844
   end In_Runtime;
6845
 
6846
   ----------------------------
6847
   -- Initialization_Warning --
6848
   ----------------------------
6849
 
6850
   procedure Initialization_Warning (E : Entity_Id) is
6851
      Warning_Needed : Boolean;
6852
 
6853
   begin
6854
      Warning_Needed := False;
6855
 
6856
      if Ekind (Current_Scope) = E_Package
6857
        and then Static_Elaboration_Desired (Current_Scope)
6858
      then
6859
         if Is_Type (E) then
6860
            if Is_Record_Type (E) then
6861
               if Has_Discriminants (E)
6862
                 or else Is_Limited_Type (E)
6863
                 or else Has_Non_Standard_Rep (E)
6864
               then
6865
                  Warning_Needed := True;
6866
 
6867
               else
6868
                  --  Verify that at least one component has an initialization
6869
                  --  expression. No need for a warning on a type if all its
6870
                  --  components have no initialization.
6871
 
6872
                  declare
6873
                     Comp : Entity_Id;
6874
 
6875
                  begin
6876
                     Comp := First_Component (E);
6877
                     while Present (Comp) loop
6878
                        if Ekind (Comp) = E_Discriminant
6879
                          or else
6880
                            (Nkind (Parent (Comp)) = N_Component_Declaration
6881
                               and then Present (Expression (Parent (Comp))))
6882
                        then
6883
                           Warning_Needed := True;
6884
                           exit;
6885
                        end if;
6886
 
6887
                        Next_Component (Comp);
6888
                     end loop;
6889
                  end;
6890
               end if;
6891
 
6892
               if Warning_Needed then
6893
                  Error_Msg_N
6894
                    ("Objects of the type cannot be initialized " &
6895
                       "statically by default?",
6896
                       Parent (E));
6897
               end if;
6898
            end if;
6899
 
6900
         else
6901
            Error_Msg_N ("Object cannot be initialized statically?", E);
6902
         end if;
6903
      end if;
6904
   end Initialization_Warning;
6905
 
6906
   ------------------
6907
   -- Init_Formals --
6908
   ------------------
6909
 
6910
   function Init_Formals (Typ : Entity_Id) return List_Id is
6911
      Loc     : constant Source_Ptr := Sloc (Typ);
6912
      Formals : List_Id;
6913
 
6914
   begin
6915
      --  First parameter is always _Init : in out typ. Note that we need
6916
      --  this to be in/out because in the case of the task record value,
6917
      --  there are default record fields (_Priority, _Size, -Task_Info)
6918
      --  that may be referenced in the generated initialization routine.
6919
 
6920
      Formals := New_List (
6921
        Make_Parameter_Specification (Loc,
6922
          Defining_Identifier =>
6923
            Make_Defining_Identifier (Loc, Name_uInit),
6924
          In_Present  => True,
6925
          Out_Present => True,
6926
          Parameter_Type => New_Reference_To (Typ, Loc)));
6927
 
6928
      --  For task record value, or type that contains tasks, add two more
6929
      --  formals, _Master : Master_Id and _Chain : in out Activation_Chain
6930
      --  We also add these parameters for the task record type case.
6931
 
6932
      if Has_Task (Typ)
6933
        or else (Is_Record_Type (Typ) and then Is_Task_Record_Type (Typ))
6934
      then
6935
         Append_To (Formals,
6936
           Make_Parameter_Specification (Loc,
6937
             Defining_Identifier =>
6938
               Make_Defining_Identifier (Loc, Name_uMaster),
6939
             Parameter_Type => New_Reference_To (RTE (RE_Master_Id), Loc)));
6940
 
6941
         Append_To (Formals,
6942
           Make_Parameter_Specification (Loc,
6943
             Defining_Identifier =>
6944
               Make_Defining_Identifier (Loc, Name_uChain),
6945
             In_Present => True,
6946
             Out_Present => True,
6947
             Parameter_Type =>
6948
               New_Reference_To (RTE (RE_Activation_Chain), Loc)));
6949
 
6950
         Append_To (Formals,
6951
           Make_Parameter_Specification (Loc,
6952
             Defining_Identifier =>
6953
               Make_Defining_Identifier (Loc, Name_uTask_Name),
6954
             In_Present => True,
6955
             Parameter_Type =>
6956
               New_Reference_To (Standard_String, Loc)));
6957
      end if;
6958
 
6959
      return Formals;
6960
 
6961
   exception
6962
      when RE_Not_Available =>
6963
         return Empty_List;
6964
   end Init_Formals;
6965
 
6966
   -------------------------
6967
   -- Init_Secondary_Tags --
6968
   -------------------------
6969
 
6970
   procedure Init_Secondary_Tags
6971
     (Typ            : Entity_Id;
6972
      Target         : Node_Id;
6973
      Stmts_List     : List_Id;
6974
      Fixed_Comps    : Boolean := True;
6975
      Variable_Comps : Boolean := True)
6976
   is
6977
      Loc : constant Source_Ptr := Sloc (Target);
6978
 
6979
      procedure Inherit_CPP_Tag
6980
        (Typ       : Entity_Id;
6981
         Iface     : Entity_Id;
6982
         Tag_Comp  : Entity_Id;
6983
         Iface_Tag : Node_Id);
6984
      --  Inherit the C++ tag of the secondary dispatch table of Typ associated
6985
      --  with Iface. Tag_Comp is the component of Typ that stores Iface_Tag.
6986
 
6987
      procedure Initialize_Tag
6988
        (Typ       : Entity_Id;
6989
         Iface     : Entity_Id;
6990
         Tag_Comp  : Entity_Id;
6991
         Iface_Tag : Node_Id);
6992
      --  Initialize the tag of the secondary dispatch table of Typ associated
6993
      --  with Iface. Tag_Comp is the component of Typ that stores Iface_Tag.
6994
      --  Compiling under the CPP full ABI compatibility mode, if the ancestor
6995
      --  of Typ CPP tagged type we generate code to inherit the contents of
6996
      --  the dispatch table directly from the ancestor.
6997
 
6998
      ---------------------
6999
      -- Inherit_CPP_Tag --
7000
      ---------------------
7001
 
7002
      procedure Inherit_CPP_Tag
7003
        (Typ       : Entity_Id;
7004
         Iface     : Entity_Id;
7005
         Tag_Comp  : Entity_Id;
7006
         Iface_Tag : Node_Id)
7007
      is
7008
      begin
7009
         pragma Assert (Is_CPP_Class (Etype (Typ)));
7010
 
7011
         Append_To (Stmts_List,
7012
           Build_Inherit_Prims (Loc,
7013
             Typ          => Iface,
7014
             Old_Tag_Node =>
7015
               Make_Selected_Component (Loc,
7016
                 Prefix        => New_Copy_Tree (Target),
7017
                 Selector_Name => New_Reference_To (Tag_Comp, Loc)),
7018
             New_Tag_Node =>
7019
               New_Reference_To (Iface_Tag, Loc),
7020
             Num_Prims    =>
7021
               UI_To_Int (DT_Entry_Count (First_Tag_Component (Iface)))));
7022
      end Inherit_CPP_Tag;
7023
 
7024
      --------------------
7025
      -- Initialize_Tag --
7026
      --------------------
7027
 
7028
      procedure Initialize_Tag
7029
        (Typ       : Entity_Id;
7030
         Iface     : Entity_Id;
7031
         Tag_Comp  : Entity_Id;
7032
         Iface_Tag : Node_Id)
7033
      is
7034
         Comp_Typ           : Entity_Id;
7035
         Offset_To_Top_Comp : Entity_Id := Empty;
7036
 
7037
      begin
7038
         --  Initialize the pointer to the secondary DT associated with the
7039
         --  interface.
7040
 
7041
         if not Is_Ancestor (Iface, Typ) then
7042
            Append_To (Stmts_List,
7043
              Make_Assignment_Statement (Loc,
7044
                Name =>
7045
                  Make_Selected_Component (Loc,
7046
                    Prefix => New_Copy_Tree (Target),
7047
                    Selector_Name => New_Reference_To (Tag_Comp, Loc)),
7048
                Expression =>
7049
                  New_Reference_To (Iface_Tag, Loc)));
7050
         end if;
7051
 
7052
         Comp_Typ := Scope (Tag_Comp);
7053
 
7054
         --  Initialize the entries of the table of interfaces. We generate a
7055
         --  different call when the parent of the type has variable size
7056
         --  components.
7057
 
7058
         if Comp_Typ /= Etype (Comp_Typ)
7059
           and then Is_Variable_Size_Record (Etype (Comp_Typ))
7060
           and then Chars (Tag_Comp) /= Name_uTag
7061
         then
7062
            pragma Assert (Present (DT_Offset_To_Top_Func (Tag_Comp)));
7063
 
7064
            --  Issue error if Set_Dynamic_Offset_To_Top is not available in a
7065
            --  configurable run-time environment.
7066
 
7067
            if not RTE_Available (RE_Set_Dynamic_Offset_To_Top) then
7068
               Error_Msg_CRT
7069
                 ("variable size record with interface types", Typ);
7070
               return;
7071
            end if;
7072
 
7073
            --  Generate:
7074
            --    Set_Dynamic_Offset_To_Top
7075
            --      (This         => Init,
7076
            --       Interface_T  => Iface'Tag,
7077
            --       Offset_Value => n,
7078
            --       Offset_Func  => Fn'Address)
7079
 
7080
            Append_To (Stmts_List,
7081
              Make_Procedure_Call_Statement (Loc,
7082
                Name => New_Reference_To
7083
                          (RTE (RE_Set_Dynamic_Offset_To_Top), Loc),
7084
                Parameter_Associations => New_List (
7085
                  Make_Attribute_Reference (Loc,
7086
                    Prefix => New_Copy_Tree (Target),
7087
                    Attribute_Name => Name_Address),
7088
 
7089
                  Unchecked_Convert_To (RTE (RE_Tag),
7090
                    New_Reference_To
7091
                      (Node (First_Elmt (Access_Disp_Table (Iface))),
7092
                       Loc)),
7093
 
7094
                  Unchecked_Convert_To
7095
                    (RTE (RE_Storage_Offset),
7096
                     Make_Attribute_Reference (Loc,
7097
                       Prefix         =>
7098
                         Make_Selected_Component (Loc,
7099
                           Prefix => New_Copy_Tree (Target),
7100
                           Selector_Name =>
7101
                             New_Reference_To (Tag_Comp, Loc)),
7102
                       Attribute_Name => Name_Position)),
7103
 
7104
                  Unchecked_Convert_To (RTE (RE_Offset_To_Top_Function_Ptr),
7105
                    Make_Attribute_Reference (Loc,
7106
                      Prefix => New_Reference_To
7107
                                  (DT_Offset_To_Top_Func (Tag_Comp), Loc),
7108
                      Attribute_Name => Name_Address)))));
7109
 
7110
            --  In this case the next component stores the value of the
7111
            --  offset to the top.
7112
 
7113
            Offset_To_Top_Comp := Next_Entity (Tag_Comp);
7114
            pragma Assert (Present (Offset_To_Top_Comp));
7115
 
7116
            Append_To (Stmts_List,
7117
              Make_Assignment_Statement (Loc,
7118
                Name =>
7119
                  Make_Selected_Component (Loc,
7120
                    Prefix => New_Copy_Tree (Target),
7121
                    Selector_Name => New_Reference_To
7122
                                       (Offset_To_Top_Comp, Loc)),
7123
                Expression =>
7124
                  Make_Attribute_Reference (Loc,
7125
                    Prefix         =>
7126
                      Make_Selected_Component (Loc,
7127
                        Prefix => New_Copy_Tree (Target),
7128
                        Selector_Name =>
7129
                          New_Reference_To (Tag_Comp, Loc)),
7130
                  Attribute_Name => Name_Position)));
7131
 
7132
         --  Normal case: No discriminants in the parent type
7133
 
7134
         else
7135
            --  Don't need to set any value if this interface shares
7136
            --  the primary dispatch table.
7137
 
7138
            if not Is_Ancestor (Iface, Typ) then
7139
               Append_To (Stmts_List,
7140
                 Build_Set_Static_Offset_To_Top (Loc,
7141
                   Iface_Tag    => New_Reference_To (Iface_Tag, Loc),
7142
                   Offset_Value =>
7143
                     Unchecked_Convert_To (RTE (RE_Storage_Offset),
7144
                       Make_Attribute_Reference (Loc,
7145
                         Prefix =>
7146
                           Make_Selected_Component (Loc,
7147
                             Prefix        => New_Copy_Tree (Target),
7148
                             Selector_Name =>
7149
                               New_Reference_To (Tag_Comp, Loc)),
7150
                         Attribute_Name => Name_Position))));
7151
            end if;
7152
 
7153
            --  Generate:
7154
            --    Register_Interface_Offset
7155
            --      (This         => Init,
7156
            --       Interface_T  => Iface'Tag,
7157
            --       Is_Constant  => True,
7158
            --       Offset_Value => n,
7159
            --       Offset_Func  => null);
7160
 
7161
            if RTE_Available (RE_Register_Interface_Offset) then
7162
               Append_To (Stmts_List,
7163
                 Make_Procedure_Call_Statement (Loc,
7164
                   Name => New_Reference_To
7165
                             (RTE (RE_Register_Interface_Offset), Loc),
7166
                   Parameter_Associations => New_List (
7167
                     Make_Attribute_Reference (Loc,
7168
                       Prefix         => New_Copy_Tree (Target),
7169
                       Attribute_Name => Name_Address),
7170
 
7171
                     Unchecked_Convert_To (RTE (RE_Tag),
7172
                       New_Reference_To
7173
                         (Node (First_Elmt (Access_Disp_Table (Iface))), Loc)),
7174
 
7175
                     New_Occurrence_Of (Standard_True, Loc),
7176
 
7177
                     Unchecked_Convert_To
7178
                       (RTE (RE_Storage_Offset),
7179
                        Make_Attribute_Reference (Loc,
7180
                          Prefix =>
7181
                            Make_Selected_Component (Loc,
7182
                              Prefix         => New_Copy_Tree (Target),
7183
                              Selector_Name  =>
7184
                                New_Reference_To (Tag_Comp, Loc)),
7185
                         Attribute_Name => Name_Position)),
7186
 
7187
                     Make_Null (Loc))));
7188
            end if;
7189
         end if;
7190
      end Initialize_Tag;
7191
 
7192
      --  Local variables
7193
 
7194
      Full_Typ         : Entity_Id;
7195
      Ifaces_List      : Elist_Id;
7196
      Ifaces_Comp_List : Elist_Id;
7197
      Ifaces_Tag_List  : Elist_Id;
7198
      Iface_Elmt       : Elmt_Id;
7199
      Iface_Comp_Elmt  : Elmt_Id;
7200
      Iface_Tag_Elmt   : Elmt_Id;
7201
      Tag_Comp         : Node_Id;
7202
      In_Variable_Pos  : Boolean;
7203
 
7204
   --  Start of processing for Init_Secondary_Tags
7205
 
7206
   begin
7207
      --  Handle private types
7208
 
7209
      if Present (Full_View (Typ)) then
7210
         Full_Typ := Full_View (Typ);
7211
      else
7212
         Full_Typ := Typ;
7213
      end if;
7214
 
7215
      Collect_Interfaces_Info
7216
        (Full_Typ, Ifaces_List, Ifaces_Comp_List, Ifaces_Tag_List);
7217
 
7218
      Iface_Elmt      := First_Elmt (Ifaces_List);
7219
      Iface_Comp_Elmt := First_Elmt (Ifaces_Comp_List);
7220
      Iface_Tag_Elmt  := First_Elmt (Ifaces_Tag_List);
7221
      while Present (Iface_Elmt) loop
7222
         Tag_Comp := Node (Iface_Comp_Elmt);
7223
 
7224
         --  If we are compiling under the CPP full ABI compatibility mode and
7225
         --  the ancestor is a CPP_Pragma tagged type then we generate code to
7226
         --  inherit the contents of the dispatch table directly from the
7227
         --  ancestor.
7228
 
7229
         if Is_CPP_Class (Etype (Full_Typ)) then
7230
            Inherit_CPP_Tag (Full_Typ,
7231
              Iface     => Node (Iface_Elmt),
7232
              Tag_Comp  => Tag_Comp,
7233
              Iface_Tag => Node (Iface_Tag_Elmt));
7234
 
7235
         --  Otherwise generate code to initialize the tag
7236
 
7237
         else
7238
            --  Check if the parent of the record type has variable size
7239
            --  components.
7240
 
7241
            In_Variable_Pos := Scope (Tag_Comp) /= Etype (Scope (Tag_Comp))
7242
              and then Is_Variable_Size_Record (Etype (Scope (Tag_Comp)));
7243
 
7244
            if (In_Variable_Pos and then Variable_Comps)
7245
              or else (not In_Variable_Pos and then Fixed_Comps)
7246
            then
7247
               Initialize_Tag (Full_Typ,
7248
                 Iface     => Node (Iface_Elmt),
7249
                 Tag_Comp  => Tag_Comp,
7250
                 Iface_Tag => Node (Iface_Tag_Elmt));
7251
            end if;
7252
         end if;
7253
 
7254
         Next_Elmt (Iface_Elmt);
7255
         Next_Elmt (Iface_Comp_Elmt);
7256
         Next_Elmt (Iface_Tag_Elmt);
7257
      end loop;
7258
   end Init_Secondary_Tags;
7259
 
7260
   -----------------------------
7261
   -- Is_Variable_Size_Record --
7262
   -----------------------------
7263
 
7264
   function Is_Variable_Size_Record (E : Entity_Id) return Boolean is
7265
      Comp     : Entity_Id;
7266
      Comp_Typ : Entity_Id;
7267
      Idx      : Node_Id;
7268
 
7269
      function Is_Constant_Bound (Exp : Node_Id) return Boolean;
7270
      --  To simplify handling of array components. Determines whether the
7271
      --  given bound is constant (a constant or enumeration literal, or an
7272
      --  integer literal) as opposed to per-object, through an expression
7273
      --  or a discriminant.
7274
 
7275
      -----------------------
7276
      -- Is_Constant_Bound --
7277
      -----------------------
7278
 
7279
      function Is_Constant_Bound (Exp : Node_Id) return Boolean is
7280
      begin
7281
         if Nkind (Exp) = N_Integer_Literal then
7282
            return True;
7283
         else
7284
            return
7285
              Is_Entity_Name (Exp)
7286
                and then Present (Entity (Exp))
7287
                and then
7288
                 (Ekind (Entity (Exp)) = E_Constant
7289
                   or else Ekind (Entity (Exp)) = E_Enumeration_Literal);
7290
         end if;
7291
      end Is_Constant_Bound;
7292
 
7293
   --  Start of processing for Is_Variable_Sized_Record
7294
 
7295
   begin
7296
      pragma Assert (Is_Record_Type (E));
7297
 
7298
      Comp := First_Entity (E);
7299
      while Present (Comp) loop
7300
         Comp_Typ := Etype (Comp);
7301
 
7302
         if Is_Record_Type (Comp_Typ) then
7303
 
7304
            --  Recursive call if the record type has discriminants
7305
 
7306
            if Has_Discriminants (Comp_Typ)
7307
              and then Is_Variable_Size_Record (Comp_Typ)
7308
            then
7309
               return True;
7310
            end if;
7311
 
7312
         elsif Is_Array_Type (Comp_Typ) then
7313
 
7314
            --  Check if some index is initialized with a non-constant value
7315
 
7316
            Idx := First_Index (Comp_Typ);
7317
            while Present (Idx) loop
7318
               if Nkind (Idx) = N_Range then
7319
                  if not Is_Constant_Bound (Low_Bound  (Idx))
7320
                       or else
7321
                     not Is_Constant_Bound (High_Bound (Idx))
7322
                  then
7323
                     return True;
7324
                  end if;
7325
               end if;
7326
 
7327
               Idx := Next_Index (Idx);
7328
            end loop;
7329
         end if;
7330
 
7331
         Next_Entity (Comp);
7332
      end loop;
7333
 
7334
      return False;
7335
   end Is_Variable_Size_Record;
7336
 
7337
   ----------------------------------------
7338
   -- Make_Controlling_Function_Wrappers --
7339
   ----------------------------------------
7340
 
7341
   procedure Make_Controlling_Function_Wrappers
7342
     (Tag_Typ   : Entity_Id;
7343
      Decl_List : out List_Id;
7344
      Body_List : out List_Id)
7345
   is
7346
      Loc         : constant Source_Ptr := Sloc (Tag_Typ);
7347
      Prim_Elmt   : Elmt_Id;
7348
      Subp        : Entity_Id;
7349
      Actual_List : List_Id;
7350
      Formal_List : List_Id;
7351
      Formal      : Entity_Id;
7352
      Par_Formal  : Entity_Id;
7353
      Formal_Node : Node_Id;
7354
      Func_Body   : Node_Id;
7355
      Func_Decl   : Node_Id;
7356
      Func_Spec   : Node_Id;
7357
      Return_Stmt : Node_Id;
7358
 
7359
   begin
7360
      Decl_List := New_List;
7361
      Body_List := New_List;
7362
 
7363
      Prim_Elmt := First_Elmt (Primitive_Operations (Tag_Typ));
7364
 
7365
      while Present (Prim_Elmt) loop
7366
         Subp := Node (Prim_Elmt);
7367
 
7368
         --  If a primitive function with a controlling result of the type has
7369
         --  not been overridden by the user, then we must create a wrapper
7370
         --  function here that effectively overrides it and invokes the
7371
         --  (non-abstract) parent function. This can only occur for a null
7372
         --  extension. Note that functions with anonymous controlling access
7373
         --  results don't qualify and must be overridden. We also exclude
7374
         --  Input attributes, since each type will have its own version of
7375
         --  Input constructed by the expander. The test for Comes_From_Source
7376
         --  is needed to distinguish inherited operations from renamings
7377
         --  (which also have Alias set).
7378
 
7379
         --  The function may be abstract, or require_Overriding may be set
7380
         --  for it, because tests for null extensions may already have reset
7381
         --  the Is_Abstract_Subprogram_Flag. If Requires_Overriding is not
7382
         --  set, functions that need wrappers are recognized by having an
7383
         --  alias that returns the parent type.
7384
 
7385
         if Comes_From_Source (Subp)
7386
           or else No (Alias (Subp))
7387
           or else Ekind (Subp) /= E_Function
7388
           or else not Has_Controlling_Result (Subp)
7389
           or else Is_Access_Type (Etype (Subp))
7390
           or else Is_Abstract_Subprogram (Alias (Subp))
7391
           or else Is_TSS (Subp, TSS_Stream_Input)
7392
         then
7393
            goto Next_Prim;
7394
 
7395
         elsif Is_Abstract_Subprogram (Subp)
7396
           or else Requires_Overriding (Subp)
7397
           or else
7398
             (Is_Null_Extension (Etype (Subp))
7399
               and then Etype (Alias (Subp)) /= Etype (Subp))
7400
         then
7401
            Formal_List := No_List;
7402
            Formal := First_Formal (Subp);
7403
 
7404
            if Present (Formal) then
7405
               Formal_List := New_List;
7406
 
7407
               while Present (Formal) loop
7408
                  Append
7409
                    (Make_Parameter_Specification
7410
                       (Loc,
7411
                        Defining_Identifier =>
7412
                          Make_Defining_Identifier (Sloc (Formal),
7413
                            Chars => Chars (Formal)),
7414
                        In_Present  => In_Present (Parent (Formal)),
7415
                        Out_Present => Out_Present (Parent (Formal)),
7416
                        Null_Exclusion_Present =>
7417
                          Null_Exclusion_Present (Parent (Formal)),
7418
                        Parameter_Type =>
7419
                          New_Reference_To (Etype (Formal), Loc),
7420
                        Expression =>
7421
                          New_Copy_Tree (Expression (Parent (Formal)))),
7422
                     Formal_List);
7423
 
7424
                  Next_Formal (Formal);
7425
               end loop;
7426
            end if;
7427
 
7428
            Func_Spec :=
7429
              Make_Function_Specification (Loc,
7430
                Defining_Unit_Name       =>
7431
                  Make_Defining_Identifier (Loc,
7432
                    Chars => Chars (Subp)),
7433
                Parameter_Specifications => Formal_List,
7434
                Result_Definition        =>
7435
                  New_Reference_To (Etype (Subp), Loc));
7436
 
7437
            Func_Decl := Make_Subprogram_Declaration (Loc, Func_Spec);
7438
            Append_To (Decl_List, Func_Decl);
7439
 
7440
            --  Build a wrapper body that calls the parent function. The body
7441
            --  contains a single return statement that returns an extension
7442
            --  aggregate whose ancestor part is a call to the parent function,
7443
            --  passing the formals as actuals (with any controlling arguments
7444
            --  converted to the types of the corresponding formals of the
7445
            --  parent function, which might be anonymous access types), and
7446
            --  having a null extension.
7447
 
7448
            Formal      := First_Formal (Subp);
7449
            Par_Formal  := First_Formal (Alias (Subp));
7450
            Formal_Node := First (Formal_List);
7451
 
7452
            if Present (Formal) then
7453
               Actual_List := New_List;
7454
            else
7455
               Actual_List := No_List;
7456
            end if;
7457
 
7458
            while Present (Formal) loop
7459
               if Is_Controlling_Formal (Formal) then
7460
                  Append_To (Actual_List,
7461
                    Make_Type_Conversion (Loc,
7462
                      Subtype_Mark =>
7463
                        New_Occurrence_Of (Etype (Par_Formal), Loc),
7464
                      Expression   =>
7465
                        New_Reference_To
7466
                          (Defining_Identifier (Formal_Node), Loc)));
7467
               else
7468
                  Append_To
7469
                    (Actual_List,
7470
                     New_Reference_To
7471
                       (Defining_Identifier (Formal_Node), Loc));
7472
               end if;
7473
 
7474
               Next_Formal (Formal);
7475
               Next_Formal (Par_Formal);
7476
               Next (Formal_Node);
7477
            end loop;
7478
 
7479
            Return_Stmt :=
7480
              Make_Simple_Return_Statement (Loc,
7481
                Expression =>
7482
                  Make_Extension_Aggregate (Loc,
7483
                    Ancestor_Part =>
7484
                      Make_Function_Call (Loc,
7485
                        Name => New_Reference_To (Alias (Subp), Loc),
7486
                        Parameter_Associations => Actual_List),
7487
                    Null_Record_Present => True));
7488
 
7489
            Func_Body :=
7490
              Make_Subprogram_Body (Loc,
7491
                Specification => New_Copy_Tree (Func_Spec),
7492
                Declarations => Empty_List,
7493
                Handled_Statement_Sequence =>
7494
                  Make_Handled_Sequence_Of_Statements (Loc,
7495
                    Statements => New_List (Return_Stmt)));
7496
 
7497
            Set_Defining_Unit_Name
7498
              (Specification (Func_Body),
7499
                Make_Defining_Identifier (Loc, Chars (Subp)));
7500
 
7501
            Append_To (Body_List, Func_Body);
7502
 
7503
            --  Replace the inherited function with the wrapper function
7504
            --  in the primitive operations list.
7505
 
7506
            Override_Dispatching_Operation
7507
              (Tag_Typ, Subp, New_Op => Defining_Unit_Name (Func_Spec));
7508
         end if;
7509
 
7510
      <<Next_Prim>>
7511
         Next_Elmt (Prim_Elmt);
7512
      end loop;
7513
   end Make_Controlling_Function_Wrappers;
7514
 
7515
   ------------------
7516
   -- Make_Eq_Case --
7517
   ------------------
7518
 
7519
   --  <Make_Eq_If shared components>
7520
   --  case X.D1 is
7521
   --     when V1 => <Make_Eq_Case> on subcomponents
7522
   --     ...
7523
   --     when Vn => <Make_Eq_Case> on subcomponents
7524
   --  end case;
7525
 
7526
   function Make_Eq_Case
7527
     (E     : Entity_Id;
7528
      CL    : Node_Id;
7529
      Discr : Entity_Id := Empty) return List_Id
7530
   is
7531
      Loc      : constant Source_Ptr := Sloc (E);
7532
      Result   : constant List_Id    := New_List;
7533
      Variant  : Node_Id;
7534
      Alt_List : List_Id;
7535
 
7536
   begin
7537
      Append_To (Result, Make_Eq_If (E, Component_Items (CL)));
7538
 
7539
      if No (Variant_Part (CL)) then
7540
         return Result;
7541
      end if;
7542
 
7543
      Variant := First_Non_Pragma (Variants (Variant_Part (CL)));
7544
 
7545
      if No (Variant) then
7546
         return Result;
7547
      end if;
7548
 
7549
      Alt_List := New_List;
7550
 
7551
      while Present (Variant) loop
7552
         Append_To (Alt_List,
7553
           Make_Case_Statement_Alternative (Loc,
7554
             Discrete_Choices => New_Copy_List (Discrete_Choices (Variant)),
7555
             Statements => Make_Eq_Case (E, Component_List (Variant))));
7556
 
7557
         Next_Non_Pragma (Variant);
7558
      end loop;
7559
 
7560
      --  If we have an Unchecked_Union, use one of the parameters that
7561
      --  captures the discriminants.
7562
 
7563
      if Is_Unchecked_Union (E) then
7564
         Append_To (Result,
7565
           Make_Case_Statement (Loc,
7566
             Expression => New_Reference_To (Discr, Loc),
7567
             Alternatives => Alt_List));
7568
 
7569
      else
7570
         Append_To (Result,
7571
           Make_Case_Statement (Loc,
7572
             Expression =>
7573
               Make_Selected_Component (Loc,
7574
                 Prefix => Make_Identifier (Loc, Name_X),
7575
                 Selector_Name => New_Copy (Name (Variant_Part (CL)))),
7576
             Alternatives => Alt_List));
7577
      end if;
7578
 
7579
      return Result;
7580
   end Make_Eq_Case;
7581
 
7582
   ----------------
7583
   -- Make_Eq_If --
7584
   ----------------
7585
 
7586
   --  Generates:
7587
 
7588
   --    if
7589
   --      X.C1 /= Y.C1
7590
   --        or else
7591
   --      X.C2 /= Y.C2
7592
   --        ...
7593
   --    then
7594
   --       return False;
7595
   --    end if;
7596
 
7597
   --  or a null statement if the list L is empty
7598
 
7599
   function Make_Eq_If
7600
     (E : Entity_Id;
7601
      L : List_Id) return Node_Id
7602
   is
7603
      Loc        : constant Source_Ptr := Sloc (E);
7604
      C          : Node_Id;
7605
      Field_Name : Name_Id;
7606
      Cond       : Node_Id;
7607
 
7608
   begin
7609
      if No (L) then
7610
         return Make_Null_Statement (Loc);
7611
 
7612
      else
7613
         Cond := Empty;
7614
 
7615
         C := First_Non_Pragma (L);
7616
         while Present (C) loop
7617
            Field_Name := Chars (Defining_Identifier (C));
7618
 
7619
            --  The tags must not be compared: they are not part of the value.
7620
            --  Ditto for the controller component, if present.
7621
 
7622
            --  Note also that in the following, we use Make_Identifier for
7623
            --  the component names. Use of New_Reference_To to identify the
7624
            --  components would be incorrect because the wrong entities for
7625
            --  discriminants could be picked up in the private type case.
7626
 
7627
            if Field_Name /= Name_uTag
7628
                 and then
7629
               Field_Name /= Name_uController
7630
            then
7631
               Evolve_Or_Else (Cond,
7632
                 Make_Op_Ne (Loc,
7633
                   Left_Opnd =>
7634
                     Make_Selected_Component (Loc,
7635
                       Prefix        => Make_Identifier (Loc, Name_X),
7636
                       Selector_Name =>
7637
                         Make_Identifier (Loc, Field_Name)),
7638
 
7639
                   Right_Opnd =>
7640
                     Make_Selected_Component (Loc,
7641
                       Prefix        => Make_Identifier (Loc, Name_Y),
7642
                       Selector_Name =>
7643
                         Make_Identifier (Loc, Field_Name))));
7644
            end if;
7645
 
7646
            Next_Non_Pragma (C);
7647
         end loop;
7648
 
7649
         if No (Cond) then
7650
            return Make_Null_Statement (Loc);
7651
 
7652
         else
7653
            return
7654
              Make_Implicit_If_Statement (E,
7655
                Condition => Cond,
7656
                Then_Statements => New_List (
7657
                  Make_Simple_Return_Statement (Loc,
7658
                    Expression => New_Occurrence_Of (Standard_False, Loc))));
7659
         end if;
7660
      end if;
7661
   end Make_Eq_If;
7662
 
7663
   -------------------------------
7664
   -- Make_Null_Procedure_Specs --
7665
   -------------------------------
7666
 
7667
   procedure Make_Null_Procedure_Specs
7668
     (Tag_Typ   : Entity_Id;
7669
      Decl_List : out List_Id)
7670
   is
7671
      Loc : constant Source_Ptr := Sloc (Tag_Typ);
7672
 
7673
      Formal         : Entity_Id;
7674
      Formal_List    : List_Id;
7675
      New_Param_Spec : Node_Id;
7676
      Parent_Subp    : Entity_Id;
7677
      Prim_Elmt      : Elmt_Id;
7678
      Proc_Decl      : Node_Id;
7679
      Subp           : Entity_Id;
7680
 
7681
      function Is_Null_Interface_Primitive (E : Entity_Id) return Boolean;
7682
      --  Returns True if E is a null procedure that is an interface primitive
7683
 
7684
      ---------------------------------
7685
      -- Is_Null_Interface_Primitive --
7686
      ---------------------------------
7687
 
7688
      function Is_Null_Interface_Primitive (E : Entity_Id) return Boolean is
7689
      begin
7690
         return Comes_From_Source (E)
7691
           and then Is_Dispatching_Operation (E)
7692
           and then Ekind (E) = E_Procedure
7693
           and then Null_Present (Parent (E))
7694
           and then Is_Interface (Find_Dispatching_Type (E));
7695
      end Is_Null_Interface_Primitive;
7696
 
7697
   --  Start of processing for Make_Null_Procedure_Specs
7698
 
7699
   begin
7700
      Decl_List := New_List;
7701
      Prim_Elmt := First_Elmt (Primitive_Operations (Tag_Typ));
7702
      while Present (Prim_Elmt) loop
7703
         Subp := Node (Prim_Elmt);
7704
 
7705
         --  If a null procedure inherited from an interface has not been
7706
         --  overridden, then we build a null procedure declaration to
7707
         --  override the inherited procedure.
7708
 
7709
         Parent_Subp := Alias (Subp);
7710
 
7711
         if Present (Parent_Subp)
7712
           and then Is_Null_Interface_Primitive (Parent_Subp)
7713
         then
7714
            Formal_List := No_List;
7715
            Formal := First_Formal (Subp);
7716
 
7717
            if Present (Formal) then
7718
               Formal_List := New_List;
7719
 
7720
               while Present (Formal) loop
7721
 
7722
                  --  Copy the parameter spec including default expressions
7723
 
7724
                  New_Param_Spec :=
7725
                    New_Copy_Tree (Parent (Formal), New_Sloc => Loc);
7726
 
7727
                  --  Generate a new defining identifier for the new formal.
7728
                  --  required because New_Copy_Tree does not duplicate
7729
                  --  semantic fields (except itypes).
7730
 
7731
                  Set_Defining_Identifier (New_Param_Spec,
7732
                    Make_Defining_Identifier (Sloc (Formal),
7733
                      Chars => Chars (Formal)));
7734
 
7735
                  --  For controlling arguments we must change their
7736
                  --  parameter type to reference the tagged type (instead
7737
                  --  of the interface type)
7738
 
7739
                  if Is_Controlling_Formal (Formal) then
7740
                     if Nkind (Parameter_Type (Parent (Formal)))
7741
                       = N_Identifier
7742
                     then
7743
                        Set_Parameter_Type (New_Param_Spec,
7744
                          New_Occurrence_Of (Tag_Typ, Loc));
7745
 
7746
                     else pragma Assert
7747
                            (Nkind (Parameter_Type (Parent (Formal)))
7748
                               = N_Access_Definition);
7749
                        Set_Subtype_Mark (Parameter_Type (New_Param_Spec),
7750
                          New_Occurrence_Of (Tag_Typ, Loc));
7751
                     end if;
7752
                  end if;
7753
 
7754
                  Append (New_Param_Spec, Formal_List);
7755
 
7756
                  Next_Formal (Formal);
7757
               end loop;
7758
            end if;
7759
 
7760
            Proc_Decl :=
7761
              Make_Subprogram_Declaration (Loc,
7762
                Make_Procedure_Specification (Loc,
7763
                  Defining_Unit_Name =>
7764
                    Make_Defining_Identifier (Loc, Chars (Subp)),
7765
                  Parameter_Specifications => Formal_List,
7766
                  Null_Present => True));
7767
            Append_To (Decl_List, Proc_Decl);
7768
            Analyze (Proc_Decl);
7769
         end if;
7770
 
7771
         Next_Elmt (Prim_Elmt);
7772
      end loop;
7773
   end Make_Null_Procedure_Specs;
7774
 
7775
   -------------------------------------
7776
   -- Make_Predefined_Primitive_Specs --
7777
   -------------------------------------
7778
 
7779
   procedure Make_Predefined_Primitive_Specs
7780
     (Tag_Typ     : Entity_Id;
7781
      Predef_List : out List_Id;
7782
      Renamed_Eq  : out Entity_Id)
7783
   is
7784
      Loc       : constant Source_Ptr := Sloc (Tag_Typ);
7785
      Res       : constant List_Id    := New_List;
7786
      Prim      : Elmt_Id;
7787
      Eq_Needed : Boolean;
7788
      Eq_Spec   : Node_Id;
7789
      Eq_Name   : Name_Id := Name_Op_Eq;
7790
 
7791
      function Is_Predefined_Eq_Renaming (Prim : Node_Id) return Boolean;
7792
      --  Returns true if Prim is a renaming of an unresolved predefined
7793
      --  equality operation.
7794
 
7795
      -------------------------------
7796
      -- Is_Predefined_Eq_Renaming --
7797
      -------------------------------
7798
 
7799
      function Is_Predefined_Eq_Renaming (Prim : Node_Id) return Boolean is
7800
      begin
7801
         return Chars (Prim) /= Name_Op_Eq
7802
           and then Present (Alias (Prim))
7803
           and then Comes_From_Source (Prim)
7804
           and then Is_Intrinsic_Subprogram (Alias (Prim))
7805
           and then Chars (Alias (Prim)) = Name_Op_Eq;
7806
      end Is_Predefined_Eq_Renaming;
7807
 
7808
   --  Start of processing for Make_Predefined_Primitive_Specs
7809
 
7810
   begin
7811
      Renamed_Eq := Empty;
7812
 
7813
      --  Spec of _Size
7814
 
7815
      Append_To (Res, Predef_Spec_Or_Body (Loc,
7816
        Tag_Typ => Tag_Typ,
7817
        Name    => Name_uSize,
7818
        Profile => New_List (
7819
          Make_Parameter_Specification (Loc,
7820
            Defining_Identifier => Make_Defining_Identifier (Loc, Name_X),
7821
            Parameter_Type      => New_Reference_To (Tag_Typ, Loc))),
7822
 
7823
        Ret_Type => Standard_Long_Long_Integer));
7824
 
7825
      --  Spec of _Alignment
7826
 
7827
      Append_To (Res, Predef_Spec_Or_Body (Loc,
7828
        Tag_Typ => Tag_Typ,
7829
        Name    => Name_uAlignment,
7830
        Profile => New_List (
7831
          Make_Parameter_Specification (Loc,
7832
            Defining_Identifier => Make_Defining_Identifier (Loc, Name_X),
7833
            Parameter_Type      => New_Reference_To (Tag_Typ, Loc))),
7834
 
7835
        Ret_Type => Standard_Integer));
7836
 
7837
      --  Specs for dispatching stream attributes
7838
 
7839
      declare
7840
         Stream_Op_TSS_Names :
7841
           constant array (Integer range <>) of TSS_Name_Type :=
7842
             (TSS_Stream_Read,
7843
              TSS_Stream_Write,
7844
              TSS_Stream_Input,
7845
              TSS_Stream_Output);
7846
 
7847
      begin
7848
         for Op in Stream_Op_TSS_Names'Range loop
7849
            if Stream_Operation_OK (Tag_Typ, Stream_Op_TSS_Names (Op)) then
7850
               Append_To (Res,
7851
                 Predef_Stream_Attr_Spec (Loc, Tag_Typ,
7852
                  Stream_Op_TSS_Names (Op)));
7853
            end if;
7854
         end loop;
7855
      end;
7856
 
7857
      --  Spec of "=" is expanded if the type is not limited and if a
7858
      --  user defined "=" was not already declared for the non-full
7859
      --  view of a private extension
7860
 
7861
      if not Is_Limited_Type (Tag_Typ) then
7862
         Eq_Needed := True;
7863
         Prim := First_Elmt (Primitive_Operations (Tag_Typ));
7864
         while Present (Prim) loop
7865
 
7866
            --  If a primitive is encountered that renames the predefined
7867
            --  equality operator before reaching any explicit equality
7868
            --  primitive, then we still need to create a predefined
7869
            --  equality function, because calls to it can occur via
7870
            --  the renaming. A new name is created for the equality
7871
            --  to avoid conflicting with any user-defined equality.
7872
            --  (Note that this doesn't account for renamings of
7873
            --  equality nested within subpackages???)
7874
 
7875
            if Is_Predefined_Eq_Renaming (Node (Prim)) then
7876
               Eq_Name := New_External_Name (Chars (Node (Prim)), 'E');
7877
 
7878
            --  User-defined equality
7879
 
7880
            elsif Chars (Node (Prim)) = Name_Op_Eq
7881
              and then Etype (First_Formal (Node (Prim))) =
7882
                         Etype (Next_Formal (First_Formal (Node (Prim))))
7883
              and then Base_Type (Etype (Node (Prim))) = Standard_Boolean
7884
            then
7885
               if No (Alias (Node (Prim)))
7886
                 or else Nkind (Unit_Declaration_Node (Node (Prim))) =
7887
                           N_Subprogram_Renaming_Declaration
7888
               then
7889
                  Eq_Needed := False;
7890
                  exit;
7891
 
7892
               --  If the parent is not an interface type and has an abstract
7893
               --  equality function, the inherited equality is abstract as
7894
               --  well, and no body can be created for it.
7895
 
7896
               elsif not Is_Interface (Etype (Tag_Typ))
7897
                 and then Present (Alias (Node (Prim)))
7898
                 and then Is_Abstract_Subprogram (Alias (Node (Prim)))
7899
               then
7900
                  Eq_Needed := False;
7901
                  exit;
7902
 
7903
               --  If the type has an equality function corresponding with
7904
               --  a primitive defined in an interface type, the inherited
7905
               --  equality is abstract as well, and no body can be created
7906
               --  for it.
7907
 
7908
               elsif Present (Alias (Node (Prim)))
7909
                 and then Comes_From_Source (Ultimate_Alias (Node (Prim)))
7910
                 and then
7911
                   Is_Interface
7912
                     (Find_Dispatching_Type (Ultimate_Alias (Node (Prim))))
7913
               then
7914
                  Eq_Needed := False;
7915
                  exit;
7916
               end if;
7917
            end if;
7918
 
7919
            Next_Elmt (Prim);
7920
         end loop;
7921
 
7922
         --  If a renaming of predefined equality was found but there was no
7923
         --  user-defined equality (so Eq_Needed is still true), then set the
7924
         --  name back to Name_Op_Eq. But in the case where a user-defined
7925
         --  equality was located after such a renaming, then the predefined
7926
         --  equality function is still needed, so Eq_Needed must be set back
7927
         --  to True.
7928
 
7929
         if Eq_Name /= Name_Op_Eq then
7930
            if Eq_Needed then
7931
               Eq_Name := Name_Op_Eq;
7932
            else
7933
               Eq_Needed := True;
7934
            end if;
7935
         end if;
7936
 
7937
         if Eq_Needed then
7938
            Eq_Spec := Predef_Spec_Or_Body (Loc,
7939
              Tag_Typ => Tag_Typ,
7940
              Name    => Eq_Name,
7941
              Profile => New_List (
7942
                Make_Parameter_Specification (Loc,
7943
                  Defining_Identifier =>
7944
                    Make_Defining_Identifier (Loc, Name_X),
7945
                    Parameter_Type      => New_Reference_To (Tag_Typ, Loc)),
7946
                Make_Parameter_Specification (Loc,
7947
                  Defining_Identifier =>
7948
                    Make_Defining_Identifier (Loc, Name_Y),
7949
                    Parameter_Type      => New_Reference_To (Tag_Typ, Loc))),
7950
                Ret_Type => Standard_Boolean);
7951
            Append_To (Res, Eq_Spec);
7952
 
7953
            if Eq_Name /= Name_Op_Eq then
7954
               Renamed_Eq := Defining_Unit_Name (Specification (Eq_Spec));
7955
 
7956
               Prim := First_Elmt (Primitive_Operations (Tag_Typ));
7957
               while Present (Prim) loop
7958
 
7959
                  --  Any renamings of equality that appeared before an
7960
                  --  overriding equality must be updated to refer to the
7961
                  --  entity for the predefined equality, otherwise calls via
7962
                  --  the renaming would get incorrectly resolved to call the
7963
                  --  user-defined equality function.
7964
 
7965
                  if Is_Predefined_Eq_Renaming (Node (Prim)) then
7966
                     Set_Alias (Node (Prim), Renamed_Eq);
7967
 
7968
                  --  Exit upon encountering a user-defined equality
7969
 
7970
                  elsif Chars (Node (Prim)) = Name_Op_Eq
7971
                    and then No (Alias (Node (Prim)))
7972
                  then
7973
                     exit;
7974
                  end if;
7975
 
7976
                  Next_Elmt (Prim);
7977
               end loop;
7978
            end if;
7979
         end if;
7980
 
7981
         --  Spec for dispatching assignment
7982
 
7983
         Append_To (Res, Predef_Spec_Or_Body (Loc,
7984
           Tag_Typ => Tag_Typ,
7985
           Name    => Name_uAssign,
7986
           Profile => New_List (
7987
             Make_Parameter_Specification (Loc,
7988
               Defining_Identifier => Make_Defining_Identifier (Loc, Name_X),
7989
               Out_Present         => True,
7990
               Parameter_Type      => New_Reference_To (Tag_Typ, Loc)),
7991
 
7992
             Make_Parameter_Specification (Loc,
7993
               Defining_Identifier => Make_Defining_Identifier (Loc, Name_Y),
7994
               Parameter_Type      => New_Reference_To (Tag_Typ, Loc)))));
7995
      end if;
7996
 
7997
      --  Ada 2005: Generate declarations for the following primitive
7998
      --  operations for limited interfaces and synchronized types that
7999
      --  implement a limited interface.
8000
 
8001
      --    Disp_Asynchronous_Select
8002
      --    Disp_Conditional_Select
8003
      --    Disp_Get_Prim_Op_Kind
8004
      --    Disp_Get_Task_Id
8005
      --    Disp_Requeue
8006
      --    Disp_Timed_Select
8007
 
8008
      --  These operations cannot be implemented on VM targets, so we simply
8009
      --  disable their generation in this case. Disable the generation of
8010
      --  these bodies if No_Dispatching_Calls, Ravenscar or ZFP is active.
8011
 
8012
      if Ada_Version >= Ada_05
8013
        and then Tagged_Type_Expansion
8014
        and then not Restriction_Active (No_Dispatching_Calls)
8015
        and then not Restriction_Active (No_Select_Statements)
8016
        and then RTE_Available (RE_Select_Specific_Data)
8017
      then
8018
         --  These primitives are defined abstract in interface types
8019
 
8020
         if Is_Interface (Tag_Typ)
8021
           and then Is_Limited_Record (Tag_Typ)
8022
         then
8023
            Append_To (Res,
8024
              Make_Abstract_Subprogram_Declaration (Loc,
8025
                Specification =>
8026
                  Make_Disp_Asynchronous_Select_Spec (Tag_Typ)));
8027
 
8028
            Append_To (Res,
8029
              Make_Abstract_Subprogram_Declaration (Loc,
8030
                Specification =>
8031
                  Make_Disp_Conditional_Select_Spec (Tag_Typ)));
8032
 
8033
            Append_To (Res,
8034
              Make_Abstract_Subprogram_Declaration (Loc,
8035
                Specification =>
8036
                  Make_Disp_Get_Prim_Op_Kind_Spec (Tag_Typ)));
8037
 
8038
            Append_To (Res,
8039
              Make_Abstract_Subprogram_Declaration (Loc,
8040
                Specification =>
8041
                  Make_Disp_Get_Task_Id_Spec (Tag_Typ)));
8042
 
8043
            Append_To (Res,
8044
              Make_Abstract_Subprogram_Declaration (Loc,
8045
                Specification =>
8046
                  Make_Disp_Requeue_Spec (Tag_Typ)));
8047
 
8048
            Append_To (Res,
8049
              Make_Abstract_Subprogram_Declaration (Loc,
8050
                Specification =>
8051
                  Make_Disp_Timed_Select_Spec (Tag_Typ)));
8052
 
8053
         --  If the ancestor is an interface type we declare non-abstract
8054
         --  primitives to override the abstract primitives of the interface
8055
         --  type.
8056
 
8057
         elsif (not Is_Interface (Tag_Typ)
8058
                  and then Is_Interface (Etype (Tag_Typ))
8059
                  and then Is_Limited_Record (Etype (Tag_Typ)))
8060
             or else
8061
               (Is_Concurrent_Record_Type (Tag_Typ)
8062
                  and then Has_Interfaces (Tag_Typ))
8063
         then
8064
            Append_To (Res,
8065
              Make_Subprogram_Declaration (Loc,
8066
                Specification =>
8067
                  Make_Disp_Asynchronous_Select_Spec (Tag_Typ)));
8068
 
8069
            Append_To (Res,
8070
              Make_Subprogram_Declaration (Loc,
8071
                Specification =>
8072
                  Make_Disp_Conditional_Select_Spec (Tag_Typ)));
8073
 
8074
            Append_To (Res,
8075
              Make_Subprogram_Declaration (Loc,
8076
                Specification =>
8077
                  Make_Disp_Get_Prim_Op_Kind_Spec (Tag_Typ)));
8078
 
8079
            Append_To (Res,
8080
              Make_Subprogram_Declaration (Loc,
8081
                Specification =>
8082
                  Make_Disp_Get_Task_Id_Spec (Tag_Typ)));
8083
 
8084
            Append_To (Res,
8085
              Make_Subprogram_Declaration (Loc,
8086
                Specification =>
8087
                  Make_Disp_Requeue_Spec (Tag_Typ)));
8088
 
8089
            Append_To (Res,
8090
              Make_Subprogram_Declaration (Loc,
8091
                Specification =>
8092
                  Make_Disp_Timed_Select_Spec (Tag_Typ)));
8093
         end if;
8094
      end if;
8095
 
8096
      --  Specs for finalization actions that may be required in case a future
8097
      --  extension contain a controlled element. We generate those only for
8098
      --  root tagged types where they will get dummy bodies or when the type
8099
      --  has controlled components and their body must be generated. It is
8100
      --  also impossible to provide those for tagged types defined within
8101
      --  s-finimp since it would involve circularity problems
8102
 
8103
      if In_Finalization_Root (Tag_Typ) then
8104
         null;
8105
 
8106
      --  We also skip these if finalization is not available
8107
 
8108
      elsif Restriction_Active (No_Finalization) then
8109
         null;
8110
 
8111
      --  Skip these for CIL Value types, where finalization is not available
8112
 
8113
      elsif Is_Value_Type (Tag_Typ) then
8114
         null;
8115
 
8116
      elsif Etype (Tag_Typ) = Tag_Typ
8117
        or else Needs_Finalization (Tag_Typ)
8118
 
8119
         --  Ada 2005 (AI-251): We must also generate these subprograms if
8120
         --  the immediate ancestor is an interface to ensure the correct
8121
         --  initialization of its dispatch table.
8122
 
8123
        or else (not Is_Interface (Tag_Typ)
8124
                   and then Is_Interface (Etype (Tag_Typ)))
8125
 
8126
         --  Ada 205 (AI-251): We must also generate these subprograms if
8127
         --  the parent of an nonlimited interface is a limited interface
8128
 
8129
        or else (Is_Interface (Tag_Typ)
8130
                  and then not Is_Limited_Interface (Tag_Typ)
8131
                  and then Is_Limited_Interface (Etype (Tag_Typ)))
8132
      then
8133
         if not Is_Limited_Type (Tag_Typ) then
8134
            Append_To (Res,
8135
              Predef_Deep_Spec (Loc, Tag_Typ, TSS_Deep_Adjust));
8136
         end if;
8137
 
8138
         Append_To (Res, Predef_Deep_Spec (Loc, Tag_Typ, TSS_Deep_Finalize));
8139
      end if;
8140
 
8141
      Predef_List := Res;
8142
   end Make_Predefined_Primitive_Specs;
8143
 
8144
   ---------------------------------
8145
   -- Needs_Simple_Initialization --
8146
   ---------------------------------
8147
 
8148
   function Needs_Simple_Initialization (T : Entity_Id) return Boolean is
8149
   begin
8150
      --  Check for private type, in which case test applies to the underlying
8151
      --  type of the private type.
8152
 
8153
      if Is_Private_Type (T) then
8154
         declare
8155
            RT : constant Entity_Id := Underlying_Type (T);
8156
 
8157
         begin
8158
            if Present (RT) then
8159
               return Needs_Simple_Initialization (RT);
8160
            else
8161
               return False;
8162
            end if;
8163
         end;
8164
 
8165
      --  Cases needing simple initialization are access types, and, if pragma
8166
      --  Normalize_Scalars or Initialize_Scalars is in effect, then all scalar
8167
      --  types.
8168
 
8169
      elsif Is_Access_Type (T)
8170
        or else (Init_Or_Norm_Scalars and then (Is_Scalar_Type (T)))
8171
      then
8172
         return True;
8173
 
8174
      --  If Initialize/Normalize_Scalars is in effect, string objects also
8175
      --  need initialization, unless they are created in the course of
8176
      --  expanding an aggregate (since in the latter case they will be
8177
      --  filled with appropriate initializing values before they are used).
8178
 
8179
      elsif Init_Or_Norm_Scalars
8180
        and then
8181
          (Root_Type (T) = Standard_String
8182
             or else Root_Type (T) = Standard_Wide_String
8183
             or else Root_Type (T) = Standard_Wide_Wide_String)
8184
        and then
8185
          (not Is_Itype (T)
8186
            or else Nkind (Associated_Node_For_Itype (T)) /= N_Aggregate)
8187
      then
8188
         return True;
8189
 
8190
      else
8191
         return False;
8192
      end if;
8193
   end Needs_Simple_Initialization;
8194
 
8195
   ----------------------
8196
   -- Predef_Deep_Spec --
8197
   ----------------------
8198
 
8199
   function Predef_Deep_Spec
8200
     (Loc      : Source_Ptr;
8201
      Tag_Typ  : Entity_Id;
8202
      Name     : TSS_Name_Type;
8203
      For_Body : Boolean := False) return Node_Id
8204
   is
8205
      Prof   : List_Id;
8206
      Type_B : Entity_Id;
8207
 
8208
   begin
8209
      if Name = TSS_Deep_Finalize then
8210
         Prof := New_List;
8211
         Type_B := Standard_Boolean;
8212
 
8213
      else
8214
         Prof := New_List (
8215
           Make_Parameter_Specification (Loc,
8216
             Defining_Identifier => Make_Defining_Identifier (Loc, Name_L),
8217
             In_Present          => True,
8218
             Out_Present         => True,
8219
             Parameter_Type      =>
8220
               New_Reference_To (RTE (RE_Finalizable_Ptr), Loc)));
8221
         Type_B := Standard_Short_Short_Integer;
8222
      end if;
8223
 
8224
      Append_To (Prof,
8225
           Make_Parameter_Specification (Loc,
8226
             Defining_Identifier => Make_Defining_Identifier (Loc, Name_V),
8227
             In_Present          => True,
8228
             Out_Present         => True,
8229
             Parameter_Type      => New_Reference_To (Tag_Typ, Loc)));
8230
 
8231
      Append_To (Prof,
8232
           Make_Parameter_Specification (Loc,
8233
             Defining_Identifier => Make_Defining_Identifier (Loc, Name_B),
8234
             Parameter_Type      => New_Reference_To (Type_B, Loc)));
8235
 
8236
      return Predef_Spec_Or_Body (Loc,
8237
        Name     => Make_TSS_Name (Tag_Typ, Name),
8238
        Tag_Typ  => Tag_Typ,
8239
        Profile  => Prof,
8240
        For_Body => For_Body);
8241
 
8242
   exception
8243
      when RE_Not_Available =>
8244
         return Empty;
8245
   end Predef_Deep_Spec;
8246
 
8247
   -------------------------
8248
   -- Predef_Spec_Or_Body --
8249
   -------------------------
8250
 
8251
   function Predef_Spec_Or_Body
8252
     (Loc      : Source_Ptr;
8253
      Tag_Typ  : Entity_Id;
8254
      Name     : Name_Id;
8255
      Profile  : List_Id;
8256
      Ret_Type : Entity_Id := Empty;
8257
      For_Body : Boolean := False) return Node_Id
8258
   is
8259
      Id   : constant Entity_Id := Make_Defining_Identifier (Loc, Name);
8260
      Spec : Node_Id;
8261
 
8262
   begin
8263
      Set_Is_Public (Id, Is_Public (Tag_Typ));
8264
 
8265
      --  The internal flag is set to mark these declarations because they have
8266
      --  specific properties. First, they are primitives even if they are not
8267
      --  defined in the type scope (the freezing point is not necessarily in
8268
      --  the same scope). Second, the predefined equality can be overridden by
8269
      --  a user-defined equality, no body will be generated in this case.
8270
 
8271
      Set_Is_Internal (Id);
8272
 
8273
      if not Debug_Generated_Code then
8274
         Set_Debug_Info_Off (Id);
8275
      end if;
8276
 
8277
      if No (Ret_Type) then
8278
         Spec :=
8279
           Make_Procedure_Specification (Loc,
8280
             Defining_Unit_Name       => Id,
8281
             Parameter_Specifications => Profile);
8282
      else
8283
         Spec :=
8284
           Make_Function_Specification (Loc,
8285
             Defining_Unit_Name       => Id,
8286
             Parameter_Specifications => Profile,
8287
             Result_Definition        =>
8288
               New_Reference_To (Ret_Type, Loc));
8289
      end if;
8290
 
8291
      if Is_Interface (Tag_Typ) then
8292
         return Make_Abstract_Subprogram_Declaration (Loc, Spec);
8293
 
8294
      --  If body case, return empty subprogram body. Note that this is ill-
8295
      --  formed, because there is not even a null statement, and certainly not
8296
      --  a return in the function case. The caller is expected to do surgery
8297
      --  on the body to add the appropriate stuff.
8298
 
8299
      elsif For_Body then
8300
         return Make_Subprogram_Body (Loc, Spec, Empty_List, Empty);
8301
 
8302
      --  For the case of an Input attribute predefined for an abstract type,
8303
      --  generate an abstract specification. This will never be called, but we
8304
      --  need the slot allocated in the dispatching table so that attributes
8305
      --  typ'Class'Input and typ'Class'Output will work properly.
8306
 
8307
      elsif Is_TSS (Name, TSS_Stream_Input)
8308
        and then Is_Abstract_Type (Tag_Typ)
8309
      then
8310
         return Make_Abstract_Subprogram_Declaration (Loc, Spec);
8311
 
8312
      --  Normal spec case, where we return a subprogram declaration
8313
 
8314
      else
8315
         return Make_Subprogram_Declaration (Loc, Spec);
8316
      end if;
8317
   end Predef_Spec_Or_Body;
8318
 
8319
   -----------------------------
8320
   -- Predef_Stream_Attr_Spec --
8321
   -----------------------------
8322
 
8323
   function Predef_Stream_Attr_Spec
8324
     (Loc      : Source_Ptr;
8325
      Tag_Typ  : Entity_Id;
8326
      Name     : TSS_Name_Type;
8327
      For_Body : Boolean := False) return Node_Id
8328
   is
8329
      Ret_Type : Entity_Id;
8330
 
8331
   begin
8332
      if Name = TSS_Stream_Input then
8333
         Ret_Type := Tag_Typ;
8334
      else
8335
         Ret_Type := Empty;
8336
      end if;
8337
 
8338
      return Predef_Spec_Or_Body (Loc,
8339
        Name     => Make_TSS_Name (Tag_Typ, Name),
8340
        Tag_Typ  => Tag_Typ,
8341
        Profile  => Build_Stream_Attr_Profile (Loc, Tag_Typ, Name),
8342
        Ret_Type => Ret_Type,
8343
        For_Body => For_Body);
8344
   end Predef_Stream_Attr_Spec;
8345
 
8346
   ---------------------------------
8347
   -- Predefined_Primitive_Bodies --
8348
   ---------------------------------
8349
 
8350
   function Predefined_Primitive_Bodies
8351
     (Tag_Typ    : Entity_Id;
8352
      Renamed_Eq : Entity_Id) return List_Id
8353
   is
8354
      Loc       : constant Source_Ptr := Sloc (Tag_Typ);
8355
      Res       : constant List_Id    := New_List;
8356
      Decl      : Node_Id;
8357
      Prim      : Elmt_Id;
8358
      Eq_Needed : Boolean;
8359
      Eq_Name   : Name_Id;
8360
      Ent       : Entity_Id;
8361
 
8362
      pragma Warnings (Off, Ent);
8363
 
8364
   begin
8365
      pragma Assert (not Is_Interface (Tag_Typ));
8366
 
8367
      --  See if we have a predefined "=" operator
8368
 
8369
      if Present (Renamed_Eq) then
8370
         Eq_Needed := True;
8371
         Eq_Name   := Chars (Renamed_Eq);
8372
 
8373
      --  If the parent is an interface type then it has defined all the
8374
      --  predefined primitives abstract and we need to check if the type
8375
      --  has some user defined "=" function to avoid generating it.
8376
 
8377
      elsif Is_Interface (Etype (Tag_Typ)) then
8378
         Eq_Needed := True;
8379
         Eq_Name := Name_Op_Eq;
8380
 
8381
         Prim := First_Elmt (Primitive_Operations (Tag_Typ));
8382
         while Present (Prim) loop
8383
            if Chars (Node (Prim)) = Name_Op_Eq
8384
              and then not Is_Internal (Node (Prim))
8385
            then
8386
               Eq_Needed := False;
8387
               Eq_Name := No_Name;
8388
               exit;
8389
            end if;
8390
 
8391
            Next_Elmt (Prim);
8392
         end loop;
8393
 
8394
      else
8395
         Eq_Needed := False;
8396
         Eq_Name   := No_Name;
8397
 
8398
         Prim := First_Elmt (Primitive_Operations (Tag_Typ));
8399
         while Present (Prim) loop
8400
            if Chars (Node (Prim)) = Name_Op_Eq
8401
              and then Is_Internal (Node (Prim))
8402
            then
8403
               Eq_Needed := True;
8404
               Eq_Name := Name_Op_Eq;
8405
               exit;
8406
            end if;
8407
 
8408
            Next_Elmt (Prim);
8409
         end loop;
8410
      end if;
8411
 
8412
      --  Body of _Alignment
8413
 
8414
      Decl := Predef_Spec_Or_Body (Loc,
8415
        Tag_Typ => Tag_Typ,
8416
        Name    => Name_uAlignment,
8417
        Profile => New_List (
8418
          Make_Parameter_Specification (Loc,
8419
            Defining_Identifier => Make_Defining_Identifier (Loc, Name_X),
8420
            Parameter_Type      => New_Reference_To (Tag_Typ, Loc))),
8421
 
8422
        Ret_Type => Standard_Integer,
8423
        For_Body => True);
8424
 
8425
      Set_Handled_Statement_Sequence (Decl,
8426
        Make_Handled_Sequence_Of_Statements (Loc, New_List (
8427
          Make_Simple_Return_Statement (Loc,
8428
            Expression =>
8429
              Make_Attribute_Reference (Loc,
8430
                Prefix => Make_Identifier (Loc, Name_X),
8431
                Attribute_Name  => Name_Alignment)))));
8432
 
8433
      Append_To (Res, Decl);
8434
 
8435
      --  Body of _Size
8436
 
8437
      Decl := Predef_Spec_Or_Body (Loc,
8438
        Tag_Typ => Tag_Typ,
8439
        Name    => Name_uSize,
8440
        Profile => New_List (
8441
          Make_Parameter_Specification (Loc,
8442
            Defining_Identifier => Make_Defining_Identifier (Loc, Name_X),
8443
            Parameter_Type      => New_Reference_To (Tag_Typ, Loc))),
8444
 
8445
        Ret_Type => Standard_Long_Long_Integer,
8446
        For_Body => True);
8447
 
8448
      Set_Handled_Statement_Sequence (Decl,
8449
        Make_Handled_Sequence_Of_Statements (Loc, New_List (
8450
          Make_Simple_Return_Statement (Loc,
8451
            Expression =>
8452
              Make_Attribute_Reference (Loc,
8453
                Prefix => Make_Identifier (Loc, Name_X),
8454
                Attribute_Name  => Name_Size)))));
8455
 
8456
      Append_To (Res, Decl);
8457
 
8458
      --  Bodies for Dispatching stream IO routines. We need these only for
8459
      --  non-limited types (in the limited case there is no dispatching).
8460
      --  We also skip them if dispatching or finalization are not available.
8461
 
8462
      if Stream_Operation_OK (Tag_Typ, TSS_Stream_Read)
8463
        and then No (TSS (Tag_Typ, TSS_Stream_Read))
8464
      then
8465
         Build_Record_Read_Procedure (Loc, Tag_Typ, Decl, Ent);
8466
         Append_To (Res, Decl);
8467
      end if;
8468
 
8469
      if Stream_Operation_OK (Tag_Typ, TSS_Stream_Write)
8470
        and then No (TSS (Tag_Typ, TSS_Stream_Write))
8471
      then
8472
         Build_Record_Write_Procedure (Loc, Tag_Typ, Decl, Ent);
8473
         Append_To (Res, Decl);
8474
      end if;
8475
 
8476
      --  Skip body of _Input for the abstract case, since the corresponding
8477
      --  spec is abstract (see Predef_Spec_Or_Body).
8478
 
8479
      if not Is_Abstract_Type (Tag_Typ)
8480
        and then Stream_Operation_OK (Tag_Typ, TSS_Stream_Input)
8481
        and then No (TSS (Tag_Typ, TSS_Stream_Input))
8482
      then
8483
         Build_Record_Or_Elementary_Input_Function
8484
           (Loc, Tag_Typ, Decl, Ent);
8485
         Append_To (Res, Decl);
8486
      end if;
8487
 
8488
      if Stream_Operation_OK (Tag_Typ, TSS_Stream_Output)
8489
        and then No (TSS (Tag_Typ, TSS_Stream_Output))
8490
      then
8491
         Build_Record_Or_Elementary_Output_Procedure
8492
           (Loc, Tag_Typ, Decl, Ent);
8493
         Append_To (Res, Decl);
8494
      end if;
8495
 
8496
      --  Ada 2005: Generate bodies for the following primitive operations for
8497
      --  limited interfaces and synchronized types that implement a limited
8498
      --  interface.
8499
 
8500
      --    disp_asynchronous_select
8501
      --    disp_conditional_select
8502
      --    disp_get_prim_op_kind
8503
      --    disp_get_task_id
8504
      --    disp_timed_select
8505
 
8506
      --  The interface versions will have null bodies
8507
 
8508
      --  These operations cannot be implemented on VM targets, so we simply
8509
      --  disable their generation in this case. Disable the generation of
8510
      --  these bodies if No_Dispatching_Calls, Ravenscar or ZFP is active.
8511
 
8512
      if Ada_Version >= Ada_05
8513
        and then Tagged_Type_Expansion
8514
        and then not Is_Interface (Tag_Typ)
8515
        and then
8516
          ((Is_Interface (Etype (Tag_Typ))
8517
              and then Is_Limited_Record (Etype (Tag_Typ)))
8518
           or else (Is_Concurrent_Record_Type (Tag_Typ)
8519
                      and then Has_Interfaces (Tag_Typ)))
8520
        and then not Restriction_Active (No_Dispatching_Calls)
8521
        and then not Restriction_Active (No_Select_Statements)
8522
        and then RTE_Available (RE_Select_Specific_Data)
8523
      then
8524
         Append_To (Res, Make_Disp_Asynchronous_Select_Body (Tag_Typ));
8525
         Append_To (Res, Make_Disp_Conditional_Select_Body  (Tag_Typ));
8526
         Append_To (Res, Make_Disp_Get_Prim_Op_Kind_Body    (Tag_Typ));
8527
         Append_To (Res, Make_Disp_Get_Task_Id_Body         (Tag_Typ));
8528
         Append_To (Res, Make_Disp_Requeue_Body             (Tag_Typ));
8529
         Append_To (Res, Make_Disp_Timed_Select_Body        (Tag_Typ));
8530
      end if;
8531
 
8532
      if not Is_Limited_Type (Tag_Typ)
8533
        and then not Is_Interface (Tag_Typ)
8534
      then
8535
         --  Body for equality
8536
 
8537
         if Eq_Needed then
8538
            Decl :=
8539
              Predef_Spec_Or_Body (Loc,
8540
                Tag_Typ => Tag_Typ,
8541
                Name    => Eq_Name,
8542
                Profile => New_List (
8543
                  Make_Parameter_Specification (Loc,
8544
                    Defining_Identifier =>
8545
                      Make_Defining_Identifier (Loc, Name_X),
8546
                    Parameter_Type      => New_Reference_To (Tag_Typ, Loc)),
8547
 
8548
                  Make_Parameter_Specification (Loc,
8549
                    Defining_Identifier =>
8550
                      Make_Defining_Identifier (Loc, Name_Y),
8551
                    Parameter_Type      => New_Reference_To (Tag_Typ, Loc))),
8552
 
8553
                Ret_Type => Standard_Boolean,
8554
                For_Body => True);
8555
 
8556
            declare
8557
               Def          : constant Node_Id := Parent (Tag_Typ);
8558
               Stmts        : constant List_Id := New_List;
8559
               Variant_Case : Boolean := Has_Discriminants (Tag_Typ);
8560
               Comps        : Node_Id := Empty;
8561
               Typ_Def      : Node_Id := Type_Definition (Def);
8562
 
8563
            begin
8564
               if Variant_Case then
8565
                  if Nkind (Typ_Def) = N_Derived_Type_Definition then
8566
                     Typ_Def := Record_Extension_Part (Typ_Def);
8567
                  end if;
8568
 
8569
                  if Present (Typ_Def) then
8570
                     Comps := Component_List (Typ_Def);
8571
                  end if;
8572
 
8573
                  Variant_Case := Present (Comps)
8574
                    and then Present (Variant_Part (Comps));
8575
               end if;
8576
 
8577
               if Variant_Case then
8578
                  Append_To (Stmts,
8579
                    Make_Eq_If (Tag_Typ, Discriminant_Specifications (Def)));
8580
                  Append_List_To (Stmts, Make_Eq_Case (Tag_Typ, Comps));
8581
                  Append_To (Stmts,
8582
                    Make_Simple_Return_Statement (Loc,
8583
                      Expression => New_Reference_To (Standard_True, Loc)));
8584
 
8585
               else
8586
                  Append_To (Stmts,
8587
                    Make_Simple_Return_Statement (Loc,
8588
                      Expression =>
8589
                        Expand_Record_Equality (Tag_Typ,
8590
                          Typ => Tag_Typ,
8591
                          Lhs => Make_Identifier (Loc, Name_X),
8592
                          Rhs => Make_Identifier (Loc, Name_Y),
8593
                          Bodies => Declarations (Decl))));
8594
               end if;
8595
 
8596
               Set_Handled_Statement_Sequence (Decl,
8597
                 Make_Handled_Sequence_Of_Statements (Loc, Stmts));
8598
            end;
8599
            Append_To (Res, Decl);
8600
         end if;
8601
 
8602
         --  Body for dispatching assignment
8603
 
8604
         Decl :=
8605
           Predef_Spec_Or_Body (Loc,
8606
             Tag_Typ => Tag_Typ,
8607
             Name    => Name_uAssign,
8608
             Profile => New_List (
8609
               Make_Parameter_Specification (Loc,
8610
                 Defining_Identifier => Make_Defining_Identifier (Loc, Name_X),
8611
                 Out_Present         => True,
8612
                 Parameter_Type      => New_Reference_To (Tag_Typ, Loc)),
8613
 
8614
               Make_Parameter_Specification (Loc,
8615
                 Defining_Identifier => Make_Defining_Identifier (Loc, Name_Y),
8616
                 Parameter_Type      => New_Reference_To (Tag_Typ, Loc))),
8617
             For_Body => True);
8618
 
8619
         Set_Handled_Statement_Sequence (Decl,
8620
           Make_Handled_Sequence_Of_Statements (Loc, New_List (
8621
             Make_Assignment_Statement (Loc,
8622
               Name       => Make_Identifier (Loc, Name_X),
8623
               Expression => Make_Identifier (Loc, Name_Y)))));
8624
 
8625
         Append_To (Res, Decl);
8626
      end if;
8627
 
8628
      --  Generate dummy bodies for finalization actions of types that have
8629
      --  no controlled components.
8630
 
8631
      --  Skip this processing if we are in the finalization routine in the
8632
      --  runtime itself, otherwise we get hopelessly circularly confused!
8633
 
8634
      if In_Finalization_Root (Tag_Typ) then
8635
         null;
8636
 
8637
      --  Skip this if finalization is not available
8638
 
8639
      elsif Restriction_Active (No_Finalization) then
8640
         null;
8641
 
8642
      elsif (Etype (Tag_Typ) = Tag_Typ
8643
             or else Is_Controlled (Tag_Typ)
8644
 
8645
               --  Ada 2005 (AI-251): We must also generate these subprograms
8646
               --  if the immediate ancestor of Tag_Typ is an interface to
8647
               --  ensure the correct initialization of its dispatch table.
8648
 
8649
             or else (not Is_Interface (Tag_Typ)
8650
                        and then
8651
                      Is_Interface (Etype (Tag_Typ))))
8652
        and then not Has_Controlled_Component (Tag_Typ)
8653
      then
8654
         if not Is_Limited_Type (Tag_Typ) then
8655
            Decl := Predef_Deep_Spec (Loc, Tag_Typ, TSS_Deep_Adjust, True);
8656
 
8657
            if Is_Controlled (Tag_Typ) then
8658
               Set_Handled_Statement_Sequence (Decl,
8659
                 Make_Handled_Sequence_Of_Statements (Loc,
8660
                   Make_Adjust_Call (
8661
                     Ref          => Make_Identifier (Loc, Name_V),
8662
                     Typ          => Tag_Typ,
8663
                     Flist_Ref    => Make_Identifier (Loc, Name_L),
8664
                     With_Attach  => Make_Identifier (Loc, Name_B))));
8665
 
8666
            else
8667
               Set_Handled_Statement_Sequence (Decl,
8668
                 Make_Handled_Sequence_Of_Statements (Loc, New_List (
8669
                   Make_Null_Statement (Loc))));
8670
            end if;
8671
 
8672
            Append_To (Res, Decl);
8673
         end if;
8674
 
8675
         Decl := Predef_Deep_Spec (Loc, Tag_Typ, TSS_Deep_Finalize, True);
8676
 
8677
         if Is_Controlled (Tag_Typ) then
8678
            Set_Handled_Statement_Sequence (Decl,
8679
              Make_Handled_Sequence_Of_Statements (Loc,
8680
                Make_Final_Call (
8681
                  Ref         => Make_Identifier (Loc, Name_V),
8682
                  Typ         => Tag_Typ,
8683
                  With_Detach => Make_Identifier (Loc, Name_B))));
8684
 
8685
         else
8686
            Set_Handled_Statement_Sequence (Decl,
8687
              Make_Handled_Sequence_Of_Statements (Loc, New_List (
8688
                Make_Null_Statement (Loc))));
8689
         end if;
8690
 
8691
         Append_To (Res, Decl);
8692
      end if;
8693
 
8694
      return Res;
8695
   end Predefined_Primitive_Bodies;
8696
 
8697
   ---------------------------------
8698
   -- Predefined_Primitive_Freeze --
8699
   ---------------------------------
8700
 
8701
   function Predefined_Primitive_Freeze
8702
     (Tag_Typ : Entity_Id) return List_Id
8703
   is
8704
      Loc     : constant Source_Ptr := Sloc (Tag_Typ);
8705
      Res     : constant List_Id    := New_List;
8706
      Prim    : Elmt_Id;
8707
      Frnodes : List_Id;
8708
 
8709
   begin
8710
      Prim := First_Elmt (Primitive_Operations (Tag_Typ));
8711
      while Present (Prim) loop
8712
         if Is_Predefined_Dispatching_Operation (Node (Prim)) then
8713
            Frnodes := Freeze_Entity (Node (Prim), Loc);
8714
 
8715
            if Present (Frnodes) then
8716
               Append_List_To (Res, Frnodes);
8717
            end if;
8718
         end if;
8719
 
8720
         Next_Elmt (Prim);
8721
      end loop;
8722
 
8723
      return Res;
8724
   end Predefined_Primitive_Freeze;
8725
 
8726
   -------------------------
8727
   -- Stream_Operation_OK --
8728
   -------------------------
8729
 
8730
   function Stream_Operation_OK
8731
     (Typ       : Entity_Id;
8732
      Operation : TSS_Name_Type) return Boolean
8733
   is
8734
      Has_Predefined_Or_Specified_Stream_Attribute : Boolean := False;
8735
 
8736
   begin
8737
      --  Special case of a limited type extension: a default implementation
8738
      --  of the stream attributes Read or Write exists if that attribute
8739
      --  has been specified or is available for an ancestor type; a default
8740
      --  implementation of the attribute Output (resp. Input) exists if the
8741
      --  attribute has been specified or Write (resp. Read) is available for
8742
      --  an ancestor type. The last condition only applies under Ada 2005.
8743
 
8744
      if Is_Limited_Type (Typ)
8745
        and then Is_Tagged_Type (Typ)
8746
      then
8747
         if Operation = TSS_Stream_Read then
8748
            Has_Predefined_Or_Specified_Stream_Attribute :=
8749
              Has_Specified_Stream_Read (Typ);
8750
 
8751
         elsif Operation = TSS_Stream_Write then
8752
            Has_Predefined_Or_Specified_Stream_Attribute :=
8753
              Has_Specified_Stream_Write (Typ);
8754
 
8755
         elsif Operation = TSS_Stream_Input then
8756
            Has_Predefined_Or_Specified_Stream_Attribute :=
8757
              Has_Specified_Stream_Input (Typ)
8758
                or else
8759
                  (Ada_Version >= Ada_05
8760
                    and then Stream_Operation_OK (Typ, TSS_Stream_Read));
8761
 
8762
         elsif Operation = TSS_Stream_Output then
8763
            Has_Predefined_Or_Specified_Stream_Attribute :=
8764
              Has_Specified_Stream_Output (Typ)
8765
                or else
8766
                  (Ada_Version >= Ada_05
8767
                    and then Stream_Operation_OK (Typ, TSS_Stream_Write));
8768
         end if;
8769
 
8770
         --  Case of inherited TSS_Stream_Read or TSS_Stream_Write
8771
 
8772
         if not Has_Predefined_Or_Specified_Stream_Attribute
8773
           and then Is_Derived_Type (Typ)
8774
           and then (Operation = TSS_Stream_Read
8775
                      or else Operation = TSS_Stream_Write)
8776
         then
8777
            Has_Predefined_Or_Specified_Stream_Attribute :=
8778
              Present
8779
                (Find_Inherited_TSS (Base_Type (Etype (Typ)), Operation));
8780
         end if;
8781
      end if;
8782
 
8783
      --  If the type is not limited, or else is limited but the attribute is
8784
      --  explicitly specified or is predefined for the type, then return True,
8785
      --  unless other conditions prevail, such as restrictions prohibiting
8786
      --  streams or dispatching operations. We also return True for limited
8787
      --  interfaces, because they may be extended by nonlimited types and
8788
      --  permit inheritance in this case (addresses cases where an abstract
8789
      --  extension doesn't get 'Input declared, as per comments below, but
8790
      --  'Class'Input must still be allowed). Note that attempts to apply
8791
      --  stream attributes to a limited interface or its class-wide type
8792
      --  (or limited extensions thereof) will still get properly rejected
8793
      --  by Check_Stream_Attribute.
8794
 
8795
      --  We exclude the Input operation from being a predefined subprogram in
8796
      --  the case where the associated type is an abstract extension, because
8797
      --  the attribute is not callable in that case, per 13.13.2(49/2). Also,
8798
      --  we don't want an abstract version created because types derived from
8799
      --  the abstract type may not even have Input available (for example if
8800
      --  derived from a private view of the abstract type that doesn't have
8801
      --  a visible Input), but a VM such as .NET or the Java VM can treat the
8802
      --  operation as inherited anyway, and we don't want an abstract function
8803
      --  to be (implicitly) inherited in that case because it can lead to a VM
8804
      --  exception.
8805
 
8806
      return (not Is_Limited_Type (Typ)
8807
               or else Is_Interface (Typ)
8808
               or else Has_Predefined_Or_Specified_Stream_Attribute)
8809
        and then (Operation /= TSS_Stream_Input
8810
                   or else not Is_Abstract_Type (Typ)
8811
                   or else not Is_Derived_Type (Typ))
8812
        and then not Has_Unknown_Discriminants (Typ)
8813
        and then not (Is_Interface (Typ)
8814
                       and then (Is_Task_Interface (Typ)
8815
                                  or else Is_Protected_Interface (Typ)
8816
                                  or else Is_Synchronized_Interface (Typ)))
8817
        and then not Restriction_Active (No_Streams)
8818
        and then not Restriction_Active (No_Dispatch)
8819
        and then not No_Run_Time_Mode
8820
        and then RTE_Available (RE_Tag)
8821
        and then RTE_Available (RE_Root_Stream_Type);
8822
   end Stream_Operation_OK;
8823
 
8824
end Exp_Ch3;

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.