gcc/ada/elists.ads

   1 ------------------------------------------------------------------------------
   2 --                                                                          --
   3 --                         GNAT COMPILER COMPONENTS                         --
   4 --                                                                          --
   5 --                               E L I S T S                                --
   6 --                                                                          --
   7 --                                 S p e c                                  --
   8 --                                                                          --
   9 --                            $Revision: 1.1.16.1 $
  10 --                                                                          --
  11 --          Copyright (C) 1992-1998 Free Software Foundation, Inc.          --
  12 --                                                                          --
  13 -- GNAT is free software;  you can  redistribute it  and/or modify it under --
  14 -- terms of the  GNU General Public License as published  by the Free Soft- --
  15 -- ware  Foundation;  either version 2,  or (at your option) any later ver- --
  16 -- sion.  GNAT is distributed in the hope that it will be useful, but WITH- --
  17 -- OUT ANY WARRANTY;  without even the  implied warranty of MERCHANTABILITY --
  18 -- or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License --
  19 -- for  more details.  You should have  received  a copy of the GNU General --
  20 -- Public License  distributed with GNAT;  see file COPYING.  If not, write --
  21 -- to  the Free Software Foundation,  59 Temple Place - Suite 330,  Boston, --
  22 -- MA 02111-1307, USA.                                                      --
  23 --                                                                          --
  24 -- As a special exception,  if other files  instantiate  generics from this --
  25 -- unit, or you link  this unit with other files  to produce an executable, --
  26 -- this  unit  does not  by itself cause  the resulting  executable  to  be --
  27 -- covered  by the  GNU  General  Public  License.  This exception does not --
  28 -- however invalidate  any other reasons why  the executable file  might be --
  29 -- covered by the  GNU Public License.                                      --
  30 --                                                                          --
  31 -- GNAT was originally developed  by the GNAT team at  New York University. --
  32 -- Extensive contributions were provided by Ada Core Technologies Inc.      --
  33 --                                                                          --
  34 ------------------------------------------------------------------------------
  35
  36 --  This package provides facilities for manipulating lists of nodes (see
  37 --  package Atree for format and implementation of tree nodes). Separate list
  38 --  elements are allocated to represent elements of these lists, so it is
  39 --  possible for a given node to be on more than one element list at a time.
  40 --  See also package Nlists, which provides another form that is threaded
  41 --  through the nodes themselves (using the Link field), which is more time
  42 --  and space efficient, but a node can be only one such list.
  43
  44 with Types;  use Types;
  45 with System;
  46
  47 package Elists is
  48
  49    --  An element list is represented by a header that is allocated in the
  50    --  Elist header table. This header contains pointers to the first and
  51    --  last elements in the list, or to No_Elmt if the list is empty.
  52
  53    --  The elements in the list each contain a pointer to the next element
  54    --  and a pointer to the referenced node. Putting a node into an element
  55    --  list causes no change at all to the node itself, so a node may be
  56    --  included in multiple element lists, and the nodes thus included may
  57    --  or may not be elements of node lists (see package Nlists).
  58
  59    procedure Initialize;
  60    --  Initialize allocation of element list tables. Called at the start of
  61    --  compiling each new main source file. Note that Initialize must not be
  62    --  called if Tree_Read is used.
  63
  64    procedure Lock;
  65    --  Lock tables used for element lists before calling backend
  66
  67    procedure Tree_Read;
  68    --  Initializes internal tables from current tree file using Tree_Read.
  69    --  Note that Initialize should not be called if Tree_Read is used.
  70    --  Tree_Read includes all necessary initialization.
  71
  72    procedure Tree_Write;
  73    --  Writes out internal tables to current tree file using Tree_Write
  74
  75    function Last_Elist_Id return Elist_Id;
  76    --  Returns Id of last allocated element list header
  77
  78    function Elists_Address return System.Address;
  79    --  Return address of Elists table (used in Back_End for Gigi call)
  80
  81    function Num_Elists return Nat;
  82    --  Number of currently allocated element lists
  83
  84    function Last_Elmt_Id return Elmt_Id;
  85    --  Returns Id of last allocated list element
  86
  87    function Elmts_Address return System.Address;
  88    --  Return address of Elmts table (used in Back_End for Gigi call)
  89
  90    function Node (Elmt : Elmt_Id) return Node_Id;
  91    pragma Inline (Node);
  92    --  Returns the value of a given list element. Returns Empty if Elmt
  93    --  is set to No_Elmt.
  94
  95    function New_Elmt_List return Elist_Id;
  96    --  Creates a new empty element list. Typically this is used to initialize
  97    --  a field in some other node which points to an element list where the
  98    --  list is then subsequently filled in using Append calls.
  99
 100    function First_Elmt (List : Elist_Id) return Elmt_Id;
 101    pragma Inline (First_Elmt);
 102    --  Obtains the first element of the given element list or, if the
 103    --  list has no items, then No_Elmt is returned.
 104
 105    function Last_Elmt (List : Elist_Id) return Elmt_Id;
 106    pragma Inline (Last_Elmt);
 107    --  Obtains the last element of the given element list or, if the
 108    --  list has no items, then No_Elmt is returned.
 109
 110    function Next_Elmt (Elmt : Elmt_Id) return Elmt_Id;
 111    pragma Inline (Next_Elmt);
 112    --  This function returns the next element on an element list. The argument
 113    --  must be a list element other than No_Elmt. Returns No_Elmt if the given
 114    --  element is the last element of the list.
 115
 116    procedure Next_Elmt (Elmt : in out Elmt_Id);
 117    pragma Inline (Next_Elmt);
 118    --  Next_Elmt (Elmt) is equivalent to Elmt := Next_Elmt (Elmt)
 119
 120    function Is_Empty_Elmt_List (List : Elist_Id) return Boolean;
 121    pragma Inline (Is_Empty_Elmt_List);
 122    --  This function determines if a given tree id references an element list
 123    --  that contains no items.
 124
 125    procedure Append_Elmt (Node : Node_Id; To : Elist_Id);
 126    --  Appends Node at the end of To, allocating a new element.
 127
 128    procedure Prepend_Elmt (Node : Node_Id; To : Elist_Id);
 129    --  Appends Node at the beginning of To, allocating a new element.
 130
 131    procedure Insert_Elmt_After (Node : Node_Id; Elmt : Elmt_Id);
 132    --  Add a new element (Node) right after the pre-existing element Elmt
 133    --  It is invalid to call this subprogram with Elmt = No_Elmt.
 134
 135    procedure Replace_Elmt (Elmt : Elmt_Id; New_Node : Node_Id);
 136    pragma Inline (Replace_Elmt);
 137    --  Causes the given element of the list to refer to New_Node, the node
 138    --  which was previously referred to by Elmt is effectively removed from
 139    --  the list and replaced by New_Node.
 140
 141    procedure Remove_Elmt (List : Elist_Id; Elmt : Elmt_Id);
 142    --  Removes Elmt from the given list. The node itself is not affected,
 143    --  but the space used by the list element may be (but is not required
 144    --  to be) freed for reuse in a subsequent Append_Elmt call.
 145
 146    procedure Remove_Last_Elmt (List : Elist_Id);
 147    --  Removes the last element of the given list. The node itself is not
 148    --  affected, but the space used by the list element may be (but is not
 149    --  required to be) freed for reuse in a subsequent Append_Elmt call.
 150
 151    function No (List : Elist_Id) return Boolean;
 152    pragma Inline (No);
 153    --  Tests given Id for equality with No_Elist. This allows notations like
 154    --  "if No (Statements)" as opposed to "if Statements = No_Elist".
 155
 156    function Present (List : Elist_Id) return Boolean;
 157    pragma Inline (Present);
 158    --  Tests given Id for inequality with No_Elist. This allows notations like
 159    --  "if Present (Statements)" as opposed to "if Statements /= No_Elist".
 160
 161    function No (Elmt : Elmt_Id) return Boolean;
 162    pragma Inline (No);
 163    --  Tests given Id for equality with No_Elmt. This allows notations like
 164    --  "if No (Operation)" as opposed to "if Operation = No_Elmt".
 165
 166    function Present (Elmt : Elmt_Id) return Boolean;
 167    pragma Inline (Present);
 168    --  Tests given Id for inequality with No_Elmt. This allows notations like
 169    --  "if Present (Operation)" as opposed to "if Operation /= No_Elmt".
 170
 171 end Elists;