* *
* C Header File *
* *
- * $Revision$
- * *
- * Copyright (C) 1992-2001 Free Software Foundation, Inc. *
+ * 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 2, or (at your option) any later ver- *
+ * 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 COPYING. If not, write *
- * to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, *
- * MA 02111-1307, USA. *
+ * 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. *
- * It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). *
+ * Extensive contributions were provided by Ada Core Technologies Inc. *
* *
****************************************************************************/
/* Element List Access Functions: */
-static Node_Id Node PARAMS ((Elmt_Id));
-static Elmt_Id First_Elmt PARAMS ((Elist_Id));
-static Elmt_Id Last_Elmt PARAMS ((Elist_Id));
-static Elmt_Id Next_Elmt PARAMS ((Elmt_Id));
-static Boolean Is_Empty_Elmt_List PARAMS ((Elist_Id));
+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)
- Elmt_Id Elmt;
+Node (Elmt_Id Elmt)
{
return Elmts_Ptr[Elmt - First_Elmt_Id].node;
}
INLINE Elmt_Id
-First_Elmt (List)
- Elist_Id List;
+First_Elmt (Elist_Id List)
{
return Elists_Ptr[List - First_Elist_Id].first;
}
INLINE Elmt_Id
-Last_Elmt (List)
- Elist_Id List;
+Last_Elmt (Elist_Id List)
{
return Elists_Ptr[List - First_Elist_Id].last;
}
INLINE Elmt_Id
-Next_Elmt (Node)
- Elmt_Id Node;
+Next_Elmt (Elmt_Id Node)
{
Int N = Elmts_Ptr[Node - First_Elmt_Id].next;
}
INLINE Boolean
-Is_Empty_Elmt_List (Id)
- Elist_Id Id;
+Is_Empty_Elmt_List (Elist_Id Id)
{
return Elists_Ptr[Id - First_Elist_Id].first == No_Elmt;
}