2010-10-26 Jerry DeLisle <jvdelisle@gcc.gnu.org>

[pf3gnuchains/gcc-fork.git] / gcc / ada / nlists.h

diff --git a/gcc/ada/nlists.h b/gcc/ada/nlists.h
index 641426f..1dd9394 100644 (file)
--- a/gcc/ada/nlists.h
+++ b/gcc/ada/nlists.h
@@ -6,27 +6,25 @@
  *                                                                          *
  *                              C Header File                               *
  *                                                                          *
- *                                                                          *
- *          Copyright (C) 1992-2001, Free Software Foundation, Inc.         *
+ *            Copyright (C) 1992-2008, 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.                                                      *
+ * for  more details.  You should have received a copy of the GNU General   *
+ * Public License along with GCC; see the file COPYING3.  If not see        *
+ * <http://www.gnu.org/licenses/>.                                          *
  *                                                                          *
  * 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.      *
  *                                                                          *
  ****************************************************************************/
 
 /* This is the C header corresponding to the Ada package specification for
-   Nlists. It also contains the implementations of inlined functions from the
+   Nlists. It also contains the implementations of inlined functions from
    the package body for Nlists.  It was generated manually from nlists.ads and
    nlists.adb and must be kept synchronized with changes in these files.
 
@@ -57,84 +55,76 @@ extern Node_Id *Prev_Node_Ptr;
 
 /* Node List Access Functions */
 
-static Node_Id First PARAMS ((List_Id));
+static Node_Id First (List_Id);
 
 INLINE Node_Id
-First (List)
-     List_Id List;
+First (List_Id List)
 {
   return List_Headers_Ptr[List - First_List_Id].first;
 }
 
 #define First_Non_Pragma nlists__first_non_pragma
-extern Node_Id First_Non_Pragma PARAMS ((Node_Id));
+extern Node_Id First_Non_Pragma (Node_Id);
 
-static Node_Id Last PARAMS ((List_Id));
+static Node_Id Last (List_Id);
 
 INLINE Node_Id
-Last (List)
-     List_Id List;
+Last (List_Id List)
 {
   return List_Headers_Ptr[List - First_List_Id].last;
 }
 
 #define First_Non_Pragma nlists__first_non_pragma
-extern Node_Id First_Non_Pragma PARAMS ((List_Id));
+extern Node_Id First_Non_Pragma (List_Id);
 
-static Node_Id Next PARAMS ((Node_Id));
+static Node_Id Next (Node_Id);
 
 INLINE Node_Id
-Next (Node)
-     Node_Id Node;
+Next (Node_Id Node)
 {
   return Next_Node_Ptr[Node - First_Node_Id];
 }
 
 #define Next_Non_Pragma nlists__next_non_pragma
-extern Node_Id Next_Non_Pragma PARAMS ((List_Id));
+extern Node_Id Next_Non_Pragma (List_Id);
 
-static Node_Id Prev PARAMS ((Node_Id));
+static Node_Id Prev (Node_Id);
 
 INLINE Node_Id
-Prev (Node)
-     Node_Id Node;
+Prev (Node_Id Node)
 {
   return Prev_Node_Ptr[Node - First_Node_Id];
 }
 
 
 #define Prev_Non_Pragma nlists__prev_non_pragma
-extern Node_Id Prev_Non_Pragma         PARAMS ((Node_Id));
+extern Node_Id Prev_Non_Pragma         (Node_Id);
 
-static Boolean Is_Empty_List           PARAMS ((List_Id));
-static Boolean Is_Non_Empty_List       PARAMS ((List_Id));
-static Boolean Is_List_Member          PARAMS ((Node_Id));
-static List_Id List_Containing         PARAMS ((Node_Id));
+static Boolean Is_Empty_List           (List_Id);
+static Boolean Is_Non_Empty_List       (List_Id);
+static Boolean Is_List_Member          (Node_Id);
+static List_Id List_Containing         (Node_Id);
 
 INLINE Boolean
-Is_Empty_List (Id)
-     List_Id Id;
+Is_Empty_List (List_Id Id)
 {
   return (First (Id) == Empty);
 }
 
 INLINE Boolean
-Is_Non_Empty_List (Id)
-     List_Id Id;
+Is_Non_Empty_List (List_Id Id)
 {
   return (Present (Id) && First (Id) != Empty);
 }
 
 INLINE Boolean
-Is_List_Member (Node)
-     Node_Id Node;
+Is_List_Member (Node_Id Node)
 {
   return Nodes_Ptr[Node - First_Node_Id].U.K.in_list;
 }
 
 INLINE List_Id
-List_Containing (Node)
-     Node_Id Node;
+List_Containing (Node_Id Node)
 {
   return Nodes_Ptr[Node - First_Node_Id].V.NX.link;
 }