aboutsummaryrefslogtreecommitdiffstats
path: root/gcc-4.9/gcc/ada/elists.h
diff options
context:
space:
mode:
Diffstat (limited to 'gcc-4.9/gcc/ada/elists.h')
-rw-r--r--gcc-4.9/gcc/ada/elists.h97
1 files changed, 97 insertions, 0 deletions
diff --git a/gcc-4.9/gcc/ada/elists.h b/gcc-4.9/gcc/ada/elists.h
new file mode 100644
index 000000000..06dd4fe4d
--- /dev/null
+++ b/gcc-4.9/gcc/ada/elists.h
@@ -0,0 +1,97 @@
+/****************************************************************************
+ * *
+ * GNAT COMPILER COMPONENTS *
+ * *
+ * E L I S T S *
+ * *
+ * C Header File *
+ * *
+ * Copyright (C) 1992-2007, Free Software Foundation, Inc. *
+ * *
+ * GNAT is free software; you can redistribute it and/or modify it under *
+ * terms of the GNU General Public License as published by the Free Soft- *
+ * ware Foundation; either version 3, or (at your option) any later ver- *
+ * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
+ * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
+ * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
+ * for more details. You should have received a copy of the GNU General *
+ * Public License distributed with GNAT; see file COPYING3. If not, go to *
+ * http://www.gnu.org/licenses for a complete copy of the license. *
+ * *
+ * GNAT was originally developed by the GNAT team at New York University. *
+ * Extensive contributions were provided by Ada Core Technologies Inc. *
+ * *
+ ****************************************************************************/
+
+/* This is the C header corresponding to the Ada package specification for
+ Elists. It also contains the implementations of inlined functions from the
+ package body for Elists. It was generated manually from elists.ads and
+ elists.adb and must be kept synchronized with changes in these files.
+
+ Note that only routines for reading the tree are included, since the
+ tree transformer is not supposed to modify the tree in any way. */
+
+/* The following are the structures used to hold element lists */
+
+struct Elist_Header
+{
+ Elmt_Id first;
+ Elmt_Id last;
+};
+
+struct Elmt_Item
+{
+ Node_Id node;
+ Int next;
+};
+
+/* The element list headers and element descriptors themselves are stored in
+ two arrays. The pointers to these arrays are passed as a parameter to the
+ tree transformer procedure and stored in the global variables Elists_Ptr
+ and Elmts_Ptr. */
+
+extern struct Elist_Header *Elists_Ptr;
+extern struct Elmt_Item *Elmts_Ptr;
+
+/* Element List Access Functions: */
+
+static Node_Id Node (Elmt_Id);
+static Elmt_Id First_Elmt (Elist_Id);
+static Elmt_Id Last_Elmt (Elist_Id);
+static Elmt_Id Next_Elmt (Elmt_Id);
+static Boolean Is_Empty_Elmt_List (Elist_Id);
+
+INLINE Node_Id
+Node (Elmt_Id Elmt)
+{
+ return Elmts_Ptr[Elmt - First_Elmt_Id].node;
+}
+
+INLINE Elmt_Id
+First_Elmt (Elist_Id List)
+{
+ return Elists_Ptr[List - First_Elist_Id].first;
+}
+
+INLINE Elmt_Id
+Last_Elmt (Elist_Id List)
+{
+ return Elists_Ptr[List - First_Elist_Id].last;
+}
+
+INLINE Elmt_Id
+Next_Elmt (Elmt_Id Node)
+{
+ Int N = Elmts_Ptr[Node - First_Elmt_Id].next;
+
+ if (IN (N, Elist_Range))
+ return No_Elmt;
+ else
+ return N;
+}
+
+INLINE Boolean
+Is_Empty_Elmt_List (Elist_Id Id)
+{
+ return Elists_Ptr[Id - First_Elist_Id].first == No_Elmt;
+}