1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
11 * Copyright (C) 1992-2001, Free Software Foundation, Inc. *
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. *
24 * GNAT was originally developed by the GNAT team at New York University. *
25 * It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). *
27 ****************************************************************************/
29 /* This is the C header corresponding to the Ada package specification for
30 Nlists. It also contains the implementations of inlined functions from the
31 the package body for Nlists. It was generated manually from nlists.ads and
32 nlists.adb and must be kept synchronized with changes in these files.
34 Note that only routines for reading the tree are included, since the
35 tree transformer is not supposed to modify the tree in any way. */
37 /* The following is the structure used for the list headers table */
46 /* The list headers are stored in an array. The pointer to this array is
47 passed as a parameter to gigi and stored in the global variable
50 extern struct List_Header *List_Headers_Ptr;
52 /* The previous and next links for lists are held in two arrays, Next_Node and
53 Prev_Node. The pointers to these arrays are passed as parameters to gigi
54 and stored in the global variables Prev_Node_Ptr and Next_Node_Ptr. */
56 extern Node_Id *Next_Node_Ptr;
57 extern Node_Id *Prev_Node_Ptr;
59 /* Node List Access Functions */
61 static Node_Id First PARAMS ((List_Id));
67 return List_Headers_Ptr[List - First_List_Id].first;
70 #define First_Non_Pragma nlists__first_non_pragma
71 extern Node_Id First_Non_Pragma PARAMS ((Node_Id));
73 static Node_Id Last PARAMS ((List_Id));
79 return List_Headers_Ptr[List - First_List_Id].last;
82 #define First_Non_Pragma nlists__first_non_pragma
83 extern Node_Id First_Non_Pragma PARAMS ((List_Id));
85 static Node_Id Next PARAMS ((Node_Id));
91 return Next_Node_Ptr[Node - First_Node_Id];
94 #define Next_Non_Pragma nlists__next_non_pragma
95 extern Node_Id Next_Non_Pragma PARAMS ((List_Id));
97 static Node_Id Prev PARAMS ((Node_Id));
103 return Prev_Node_Ptr[Node - First_Node_Id];
107 #define Prev_Non_Pragma nlists__prev_non_pragma
108 extern Node_Id Prev_Non_Pragma PARAMS ((Node_Id));
110 static Boolean Is_Empty_List PARAMS ((List_Id));
111 static Boolean Is_Non_Empty_List PARAMS ((List_Id));
112 static Boolean Is_List_Member PARAMS ((Node_Id));
113 static List_Id List_Containing PARAMS ((Node_Id));
119 return (First (Id) == Empty);
123 Is_Non_Empty_List (Id)
126 return (Present (Id) && First (Id) != Empty);
130 Is_List_Member (Node)
133 return Nodes_Ptr[Node - First_Node_Id].U.K.in_list;
137 List_Containing (Node)
140 return Nodes_Ptr[Node - First_Node_Id].V.NX.link;