gcc/ada/exp_ch3.ads

   1 ------------------------------------------------------------------------------
   2 --                                                                          --
   3 --                         GNAT COMPILER COMPONENTS                         --
   4 --                                                                          --
   5 --                              E X P _ C H 3                               --
   6 --                                                                          --
   7 --                                 S p e c                                  --
   8 --                                                                          --
   9 --                                                                          --
  10 --           Copyright (C) 1992-2001 Free Software Foundation, Inc.         --
  11 --                                                                          --
  12 -- GNAT is free software;  you can  redistribute it  and/or modify it under --
  13 -- terms of the  GNU General Public License as published  by the Free Soft- --
  14 -- ware  Foundation;  either version 2,  or (at your option) any later ver- --
  15 -- sion.  GNAT is distributed in the hope that it will be useful, but WITH- --
  16 -- OUT ANY WARRANTY;  without even the  implied warranty of MERCHANTABILITY --
  17 -- or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License --
  18 -- for  more details.  You should have  received  a copy of the GNU General --
  19 -- Public License  distributed with GNAT;  see file COPYING.  If not, write --
  20 -- to  the Free Software Foundation,  59 Temple Place - Suite 330,  Boston, --
  21 -- MA 02111-1307, USA.                                                      --
  22 --                                                                          --
  23 -- GNAT was originally developed  by the GNAT team at  New York University. --
  24 -- Extensive contributions were provided by Ada Core Technologies Inc.      --
  25 --                                                                          --
  26 ------------------------------------------------------------------------------
  27
  28 --  Expand routines for chapter 3 constructs
  29
  30 with Types; use Types;
  31 with Elists; use Elists;
  32
  33 package Exp_Ch3 is
  34
  35    procedure Expand_N_Object_Declaration         (N : Node_Id);
  36    procedure Expand_N_Subtype_Indication         (N : Node_Id);
  37    procedure Expand_N_Variant_Part               (N : Node_Id);
  38    procedure Expand_N_Full_Type_Declaration      (N : Node_Id);
  39
  40    procedure Expand_Previous_Access_Type (Def_Id : Entity_Id);
  41    --  For a full type declaration that contains tasks, or that is a task,
  42    --  check whether there exists an access type whose designated type is an
  43    --  incomplete declarations for the current composite type. If so, build
  44    --  the master for that access type, now that it is known to denote an
  45    --  object with tasks.
  46
  47    procedure Expand_Derived_Record (T : Entity_Id; Def : Node_Id);
  48    --  Add a field _parent in the extension part of the record.
  49
  50    procedure Build_Discr_Checking_Funcs (N : Node_Id);
  51    --  Builds function which checks whether the component name is consistent
  52    --  with the current discriminants. N is the full type declaration node,
  53    --  and the discriminant checking functions are inserted after this node.
  54
  55    function Build_Initialization_Call
  56      (Loc          : Source_Ptr;
  57       Id_Ref       : Node_Id;
  58       Typ          : Entity_Id;
  59       In_Init_Proc : Boolean := False;
  60       Enclos_Type  : Entity_Id := Empty;
  61       Discr_Map    : Elist_Id := New_Elmt_List)
  62       return         List_Id;
  63    --  Builds a call to the initialization procedure of the Id entity. Id_Ref
  64    --  is either a new reference to Id (for record fields), or an indexed
  65    --  component (for array elements). Loc is the source location for the
  66    --  constructed tree, and Typ is the type of the entity (the initialization
  67    --  procedure of the base type is the procedure that actually gets called).
  68    --  In_Init_Proc has to be set to True when the call is itself in an Init
  69    --  procedure in order to enable the use of discriminals. Enclos_type is
  70    --  the type of the init_proc and it is used for various expansion cases
  71    --  including the case where Typ is a task type which is a array component,
  72    --  the indices of the enclosing type are used to build the string that
  73    --  identifies each task at runtime.
  74    --
  75    --  Discr_Map is used to replace discriminants by their discriminals in
  76    --  expressions used to constrain record components. In the presence of
  77    --  entry families bounded by discriminants, protected type discriminants
  78    --  can appear within expressions in array bounds (not as stand-alone
  79    --  identifiers) and a general replacement is necessary.
  80
  81    procedure Freeze_Type (N : Node_Id);
  82    --  This procedure executes the freezing actions associated with the given
  83    --  freeze type node N.
  84
  85    function Needs_Simple_Initialization (T : Entity_Id) return Boolean;
  86    --  Certain types need initialization even though there is no specific
  87    --  initialization routine. In this category are access types (which
  88    --  need initializing to null), packed array types whose implementation
  89    --  is a modular type, and all scalar types if Normalize_Scalars is set,
  90    --  as well as private types whose underlying type is present and meets
  91    --  any of these criteria. Finally, descendants of String and Wide_String
  92    --  also need initialization in Initialize/Normalize_Scalars mode.
  93
  94    function Get_Simple_Init_Val
  95      (T    : Entity_Id;
  96       Loc  : Source_Ptr)
  97       return Node_Id;
  98    --  For a type which Needs_Simple_Initialization (see above), prepares
  99    --  the tree for an expression representing the required initial value.
 100    --  Loc is the source location used in constructing this tree which is
 101    --  returned as the result of the call.
 102
 103 end Exp_Ch3;